18package com.microsoft.z3;
20import static com.microsoft.z3.Constructor.of;
22import com.microsoft.z3.enumerations.Z3_ast_print_mode;
35@SuppressWarnings(
"unchecked")
38 static final Object creation_lock =
new Object();
41 synchronized (creation_lock) {
42 m_ctx = Native.mkContextRc(0);
48 synchronized (creation_lock) {
72 public Context(Map<String, String> settings) {
73 synchronized (creation_lock) {
74 long cfg = Native.mkConfig();
75 for (Map.Entry<String, String> kv : settings.entrySet()) {
76 Native.setParamValue(cfg, kv.getKey(), kv.getValue());
78 m_ctx = Native.mkContextRc(cfg);
79 Native.delConfig(cfg);
86 Native.setInternalErrorHandler(m_ctx);
110 Symbol[] mkSymbols(String[] names)
115 for (
int i = 0; i < names.length; ++i)
116 result[i] = mkSymbol(names[i]);
120 private BoolSort m_boolSort =
null;
121 private IntSort m_intSort =
null;
122 private RealSort m_realSort =
null;
123 private SeqSort<CharSort> m_stringSort =
null;
130 if (m_boolSort ==
null) {
141 if (m_intSort ==
null) {
152 if (m_realSort ==
null) {
180 if (m_stringSort ==
null) {
181 m_stringSort = mkStringSort();
191 checkContextMatch(s);
200 return mkUninterpretedSort(mkSymbol(str));
224 return new BitVecSort(
this, Native.mkBvSort(nCtx(), size));
232 checkContextMatch(domain);
233 checkContextMatch(range);
243 checkContextMatch(domains);
244 checkContextMatch(range);
253 return new SeqSort<>(
this, Native.mkStringSort(nCtx()));
261 return new SeqSort<>(
this, Native.mkSeqSort(nCtx(), s.getNativeObject()));
269 return new ReSort<>(
this, Native.mkReSort(nCtx(), s.getNativeObject()));
279 checkContextMatch(name);
280 checkContextMatch(fieldNames);
281 checkContextMatch(fieldSorts);
282 return new TupleSort(
this, name, fieldNames.length, fieldNames,
292 checkContextMatch(name);
293 checkContextMatch(enumNames);
303 return new EnumSort<>(
this, mkSymbol(name), mkSymbols(enumNames));
311 checkContextMatch(name);
312 checkContextMatch(elemSort);
321 checkContextMatch(elemSort);
322 return new ListSort<>(
this, mkSymbol(name), elemSort);
331 checkContextMatch(name);
356 Symbol[] fieldNames,
Sort[] sorts,
int[] sortRefs)
359 return of(
this, name, recognizer, fieldNames, sorts, sortRefs);
366 String[] fieldNames,
Sort[] sorts,
int[] sortRefs)
368 return of(
this, mkSymbol(name), mkSymbol(recognizer), mkSymbols(fieldNames), sorts, sortRefs);
376 checkContextMatch(name);
377 checkContextMatch(constructors);
387 checkContextMatch(constructors);
399 checkContextMatch(name);
401 checkContextMatch(params);
403 int numParams = (params ==
null) ? 0 : params.length;
404 long[] paramsNative = (params ==
null) ?
new long[0] :
AST.arrayToNative(params);
405 return new DatatypeSort<>(
this, Native.mkDatatypeSort(nCtx(), name.getNativeObject(), numParams, paramsNative));
413 public <R> DatatypeSort<R> mkDatatypeSortRef(Symbol name)
415 return mkDatatypeSortRef(name,
null);
424 public <R> DatatypeSort<R> mkDatatypeSortRef(String name, Sort[] params)
426 return mkDatatypeSortRef(mkSymbol(name), params);
434 public <R> DatatypeSort<R> mkDatatypeSortRef(String name)
436 return mkDatatypeSortRef(name,
null);
446 checkContextMatch(names);
447 int n = names.length;
449 long[] n_constr =
new long[n];
450 for (
int i = 0; i < n; i++)
454 checkContextMatch(constructor);
456 n_constr[i] = cla[i].getNativeObject();
458 long[] n_res =
new long[n];
462 for (
int i = 0; i < n; i++)
473 return mkDatatypeSorts(mkSymbols(names), c);
486 Native.datatypeUpdateField
487 (nCtx(), field.getNativeObject(),
488 t.getNativeObject(), v.getNativeObject()));
497 checkContextMatch(name);
498 checkContextMatch(domain);
499 checkContextMatch(range);
500 return new FuncDecl<>(
this, name, domain, range);
505 checkContextMatch(name);
506 checkContextMatch(domain);
507 checkContextMatch(range);
508 long f = Native.solverPropagateDeclare(
510 name.getNativeObject(),
513 range.getNativeObject());
524 checkContextMatch(name);
525 checkContextMatch(domain);
526 checkContextMatch(range);
537 checkContextMatch(domain);
538 checkContextMatch(range);
539 return new FuncDecl<>(
this, mkSymbol(name), domain, range);
548 checkContextMatch(domain);
549 checkContextMatch(range);
551 return new FuncDecl<>(
this, mkSymbol(name), q, range);
559 checkContextMatch(name);
560 checkContextMatch(domain);
561 checkContextMatch(range);
562 return new FuncDecl<>(
this, name, domain, range,
true);
574 checkContextMatch(f);
575 checkContextMatch(args);
576 checkContextMatch(body);
578 Native.addRecDef(nCtx(), f.getNativeObject(), args.length, argsNative, body.getNativeObject());
590 checkContextMatch(domain);
591 checkContextMatch(range);
592 return new FuncDecl<>(
this, prefix, domain, range);
600 checkContextMatch(name);
601 checkContextMatch(range);
602 return new FuncDecl<>(
this, name,
null, range);
610 checkContextMatch(range);
611 return new FuncDecl<>(
this, mkSymbol(name),
null, range);
623 checkContextMatch(range);
624 return new FuncDecl<>(
this, prefix,
null, range);
635 Native.mkBound(nCtx(), index, ty.getNativeObject()));
644 if (terms.length == 0)
645 throw new Z3Exception(
"Cannot create a pattern from zero terms");
648 return new Pattern(
this, Native.mkPattern(nCtx(), terms.length,
658 checkContextMatch(name);
659 checkContextMatch(range);
663 Native.mkConst(nCtx(), name.getNativeObject(),
664 range.getNativeObject()));
673 return mkConst(mkSymbol(name), range);
682 checkContextMatch(range);
684 Native.mkFreshConst(nCtx(), prefix, range.getNativeObject()));
693 return mkApp(f, (
Expr<?>[])
null);
701 return (
BoolExpr) mkConst(name, getBoolSort());
709 return (
BoolExpr) mkConst(mkSymbol(name), getBoolSort());
717 return (
IntExpr) mkConst(name, getIntSort());
725 return (
IntExpr) mkConst(name, getIntSort());
733 return (
RealExpr) mkConst(name, getRealSort());
741 return (
RealExpr) mkConst(name, getRealSort());
749 return (
BitVecExpr) mkConst(name, mkBitVecSort(size));
757 return (
BitVecExpr) mkConst(name, mkBitVecSort(size));
766 checkContextMatch(f);
767 checkContextMatch(args);
768 return Expr.create(
this, f, args);
776 return new BoolExpr(
this, Native.mkTrue(nCtx()));
784 return new BoolExpr(
this, Native.mkFalse(nCtx()));
792 return value ? mkTrue() : mkFalse();
800 checkContextMatch(x);
801 checkContextMatch(y);
802 return new BoolExpr(
this, Native.mkEq(nCtx(), x.getNativeObject(),
803 y.getNativeObject()));
812 checkContextMatch(args);
813 return new BoolExpr(
this, Native.mkDistinct(nCtx(), args.length,
822 checkContextMatch(a);
823 return new BoolExpr(
this, Native.mkNot(nCtx(), a.getNativeObject()));
835 checkContextMatch(t1);
836 checkContextMatch(t2);
837 checkContextMatch(t3);
838 return (
Expr<R>)
Expr.create(
this, Native.mkIte(nCtx(), t1.getNativeObject(),
839 t2.getNativeObject(), t3.getNativeObject()));
847 checkContextMatch(t1);
848 checkContextMatch(t2);
849 return new BoolExpr(
this, Native.mkIff(nCtx(), t1.getNativeObject(),
850 t2.getNativeObject()));
858 checkContextMatch(t1);
859 checkContextMatch(t2);
860 return new BoolExpr(
this, Native.mkImplies(nCtx(),
861 t1.getNativeObject(), t2.getNativeObject()));
869 checkContextMatch(t1);
870 checkContextMatch(t2);
871 return new BoolExpr(
this, Native.mkXor(nCtx(), t1.getNativeObject(),
872 t2.getNativeObject()));
881 checkContextMatch(t);
882 return new BoolExpr(
this, Native.mkAnd(nCtx(), t.length,
892 checkContextMatch(t);
893 return new BoolExpr(
this, Native.mkOr(nCtx(), t.length,
903 checkContextMatch(t);
914 checkContextMatch(t);
925 checkContextMatch(t);
935 checkContextMatch(t);
937 Native.mkUnaryMinus(nCtx(), t.getNativeObject()));
945 checkContextMatch(t1);
946 checkContextMatch(t2);
948 t1.getNativeObject(), t2.getNativeObject()));
958 checkContextMatch(t1);
959 checkContextMatch(t2);
960 return new IntExpr(
this, Native.mkMod(nCtx(), t1.getNativeObject(),
961 t2.getNativeObject()));
971 checkContextMatch(t1);
972 checkContextMatch(t2);
973 return new IntExpr(
this, Native.mkRem(nCtx(), t1.getNativeObject(),
974 t2.getNativeObject()));
983 checkContextMatch(t1);
984 checkContextMatch(t2);
987 Native.mkPower(nCtx(), t1.getNativeObject(),
988 t2.getNativeObject()));
996 checkContextMatch(t1);
997 checkContextMatch(t2);
998 return new BoolExpr(
this, Native.mkLt(nCtx(), t1.getNativeObject(),
999 t2.getNativeObject()));
1007 checkContextMatch(t1);
1008 checkContextMatch(t2);
1009 return new BoolExpr(
this, Native.mkLe(nCtx(), t1.getNativeObject(),
1010 t2.getNativeObject()));
1018 checkContextMatch(t1);
1019 checkContextMatch(t2);
1020 return new BoolExpr(
this, Native.mkGt(nCtx(), t1.getNativeObject(),
1021 t2.getNativeObject()));
1029 checkContextMatch(t1);
1030 checkContextMatch(t2);
1031 return new BoolExpr(
this, Native.mkGe(nCtx(), t1.getNativeObject(),
1032 t2.getNativeObject()));
1047 checkContextMatch(t);
1049 Native.mkInt2real(nCtx(), t.getNativeObject()));
1060 checkContextMatch(t);
1061 return new IntExpr(
this, Native.mkReal2int(nCtx(), t.getNativeObject()));
1069 checkContextMatch(t);
1070 return new BoolExpr(
this, Native.mkIsInt(nCtx(), t.getNativeObject()));
1080 checkContextMatch(t);
1081 return new BitVecExpr(
this, Native.mkBvnot(nCtx(), t.getNativeObject()));
1091 checkContextMatch(t);
1092 return new BitVecExpr(
this, Native.mkBvredand(nCtx(),
1093 t.getNativeObject()));
1103 checkContextMatch(t);
1104 return new BitVecExpr(
this, Native.mkBvredor(nCtx(),
1105 t.getNativeObject()));
1115 checkContextMatch(t1);
1116 checkContextMatch(t2);
1117 return new BitVecExpr(
this, Native.mkBvand(nCtx(),
1118 t1.getNativeObject(), t2.getNativeObject()));
1128 checkContextMatch(t1);
1129 checkContextMatch(t2);
1130 return new BitVecExpr(
this, Native.mkBvor(nCtx(), t1.getNativeObject(),
1131 t2.getNativeObject()));
1141 checkContextMatch(t1);
1142 checkContextMatch(t2);
1143 return new BitVecExpr(
this, Native.mkBvxor(nCtx(),
1144 t1.getNativeObject(), t2.getNativeObject()));
1154 checkContextMatch(t1);
1155 checkContextMatch(t2);
1156 return new BitVecExpr(
this, Native.mkBvnand(nCtx(),
1157 t1.getNativeObject(), t2.getNativeObject()));
1167 checkContextMatch(t1);
1168 checkContextMatch(t2);
1169 return new BitVecExpr(
this, Native.mkBvnor(nCtx(),
1170 t1.getNativeObject(), t2.getNativeObject()));
1180 checkContextMatch(t1);
1181 checkContextMatch(t2);
1182 return new BitVecExpr(
this, Native.mkBvxnor(nCtx(),
1183 t1.getNativeObject(), t2.getNativeObject()));
1193 checkContextMatch(t);
1194 return new BitVecExpr(
this, Native.mkBvneg(nCtx(), t.getNativeObject()));
1204 checkContextMatch(t1);
1205 checkContextMatch(t2);
1206 return new BitVecExpr(
this, Native.mkBvadd(nCtx(),
1207 t1.getNativeObject(), t2.getNativeObject()));
1217 checkContextMatch(t1);
1218 checkContextMatch(t2);
1219 return new BitVecExpr(
this, Native.mkBvsub(nCtx(),
1220 t1.getNativeObject(), t2.getNativeObject()));
1230 checkContextMatch(t1);
1231 checkContextMatch(t2);
1232 return new BitVecExpr(
this, Native.mkBvmul(nCtx(),
1233 t1.getNativeObject(), t2.getNativeObject()));
1245 checkContextMatch(t1);
1246 checkContextMatch(t2);
1247 return new BitVecExpr(
this, Native.mkBvudiv(nCtx(),
1248 t1.getNativeObject(), t2.getNativeObject()));
1266 checkContextMatch(t1);
1267 checkContextMatch(t2);
1268 return new BitVecExpr(
this, Native.mkBvsdiv(nCtx(),
1269 t1.getNativeObject(), t2.getNativeObject()));
1281 checkContextMatch(t1);
1282 checkContextMatch(t2);
1283 return new BitVecExpr(
this, Native.mkBvurem(nCtx(),
1284 t1.getNativeObject(), t2.getNativeObject()));
1299 checkContextMatch(t1);
1300 checkContextMatch(t2);
1301 return new BitVecExpr(
this, Native.mkBvsrem(nCtx(),
1302 t1.getNativeObject(), t2.getNativeObject()));
1313 checkContextMatch(t1);
1314 checkContextMatch(t2);
1315 return new BitVecExpr(
this, Native.mkBvsmod(nCtx(),
1316 t1.getNativeObject(), t2.getNativeObject()));
1326 checkContextMatch(t1);
1327 checkContextMatch(t2);
1328 return new BoolExpr(
this, Native.mkBvult(nCtx(), t1.getNativeObject(),
1329 t2.getNativeObject()));
1339 checkContextMatch(t1);
1340 checkContextMatch(t2);
1341 return new BoolExpr(
this, Native.mkBvslt(nCtx(), t1.getNativeObject(),
1342 t2.getNativeObject()));
1352 checkContextMatch(t1);
1353 checkContextMatch(t2);
1354 return new BoolExpr(
this, Native.mkBvule(nCtx(), t1.getNativeObject(),
1355 t2.getNativeObject()));
1365 checkContextMatch(t1);
1366 checkContextMatch(t2);
1367 return new BoolExpr(
this, Native.mkBvsle(nCtx(), t1.getNativeObject(),
1368 t2.getNativeObject()));
1378 checkContextMatch(t1);
1379 checkContextMatch(t2);
1380 return new BoolExpr(
this, Native.mkBvuge(nCtx(), t1.getNativeObject(),
1381 t2.getNativeObject()));
1391 checkContextMatch(t1);
1392 checkContextMatch(t2);
1393 return new BoolExpr(
this, Native.mkBvsge(nCtx(), t1.getNativeObject(),
1394 t2.getNativeObject()));
1404 checkContextMatch(t1);
1405 checkContextMatch(t2);
1406 return new BoolExpr(
this, Native.mkBvugt(nCtx(), t1.getNativeObject(),
1407 t2.getNativeObject()));
1417 checkContextMatch(t1);
1418 checkContextMatch(t2);
1419 return new BoolExpr(
this, Native.mkBvsgt(nCtx(), t1.getNativeObject(),
1420 t2.getNativeObject()));
1435 checkContextMatch(t1);
1436 checkContextMatch(t2);
1437 return new BitVecExpr(
this, Native.mkConcat(nCtx(),
1438 t1.getNativeObject(), t2.getNativeObject()));
1452 checkContextMatch(t);
1453 return new BitVecExpr(
this, Native.mkExtract(nCtx(), high, low,
1454 t.getNativeObject()));
1466 checkContextMatch(t);
1467 return new BitVecExpr(
this, Native.mkSignExt(nCtx(), i,
1468 t.getNativeObject()));
1480 checkContextMatch(t);
1481 return new BitVecExpr(
this, Native.mkZeroExt(nCtx(), i,
1482 t.getNativeObject()));
1492 checkContextMatch(t);
1493 return new BitVecExpr(
this, Native.mkRepeat(nCtx(), i,
1494 t.getNativeObject()));
1510 checkContextMatch(t1);
1511 checkContextMatch(t2);
1512 return new BitVecExpr(
this, Native.mkBvshl(nCtx(),
1513 t1.getNativeObject(), t2.getNativeObject()));
1529 checkContextMatch(t1);
1530 checkContextMatch(t2);
1531 return new BitVecExpr(
this, Native.mkBvlshr(nCtx(),
1532 t1.getNativeObject(), t2.getNativeObject()));
1549 checkContextMatch(t1);
1550 checkContextMatch(t2);
1551 return new BitVecExpr(
this, Native.mkBvashr(nCtx(),
1552 t1.getNativeObject(), t2.getNativeObject()));
1562 checkContextMatch(t);
1563 return new BitVecExpr(
this, Native.mkRotateLeft(nCtx(), i,
1564 t.getNativeObject()));
1574 checkContextMatch(t);
1575 return new BitVecExpr(
this, Native.mkRotateRight(nCtx(), i,
1576 t.getNativeObject()));
1588 checkContextMatch(t1);
1589 checkContextMatch(t2);
1590 return new BitVecExpr(
this, Native.mkExtRotateLeft(nCtx(),
1591 t1.getNativeObject(), t2.getNativeObject()));
1603 checkContextMatch(t1);
1604 checkContextMatch(t2);
1605 return new BitVecExpr(
this, Native.mkExtRotateRight(nCtx(),
1606 t1.getNativeObject(), t2.getNativeObject()));
1620 checkContextMatch(t);
1621 return new BitVecExpr(
this, Native.mkInt2bv(nCtx(), n,
1622 t.getNativeObject()));
1641 checkContextMatch(t);
1642 return new IntExpr(
this, Native.mkBv2int(nCtx(), t.getNativeObject(),
1654 checkContextMatch(t1);
1655 checkContextMatch(t2);
1656 return new BoolExpr(
this, Native.mkBvaddNoOverflow(nCtx(), t1
1657 .getNativeObject(), t2.getNativeObject(), (isSigned)));
1668 checkContextMatch(t1);
1669 checkContextMatch(t2);
1670 return new BoolExpr(
this, Native.mkBvaddNoUnderflow(nCtx(),
1671 t1.getNativeObject(), t2.getNativeObject()));
1682 checkContextMatch(t1);
1683 checkContextMatch(t2);
1684 return new BoolExpr(
this, Native.mkBvsubNoOverflow(nCtx(),
1685 t1.getNativeObject(), t2.getNativeObject()));
1696 checkContextMatch(t1);
1697 checkContextMatch(t2);
1698 return new BoolExpr(
this, Native.mkBvsubNoUnderflow(nCtx(), t1
1699 .getNativeObject(), t2.getNativeObject(), (isSigned)));
1710 checkContextMatch(t1);
1711 checkContextMatch(t2);
1712 return new BoolExpr(
this, Native.mkBvsdivNoOverflow(nCtx(),
1713 t1.getNativeObject(), t2.getNativeObject()));
1723 checkContextMatch(t);
1724 return new BoolExpr(
this, Native.mkBvnegNoOverflow(nCtx(),
1725 t.getNativeObject()));
1736 checkContextMatch(t1);
1737 checkContextMatch(t2);
1738 return new BoolExpr(
this, Native.mkBvmulNoOverflow(nCtx(), t1
1739 .getNativeObject(), t2.getNativeObject(), (isSigned)));
1750 checkContextMatch(t1);
1751 checkContextMatch(t2);
1752 return new BoolExpr(
this, Native.mkBvmulNoUnderflow(nCtx(),
1753 t1.getNativeObject(), t2.getNativeObject()));
1771 return (
ArrayExpr<D, R>) mkConst(mkSymbol(name), mkArraySort(domain, range));
1788 checkContextMatch(a);
1789 checkContextMatch(i);
1792 Native.mkSelect(nCtx(), a.getNativeObject(),
1793 i.getNativeObject()));
1810 checkContextMatch(a);
1811 checkContextMatch(args);
1814 Native.mkSelectN(nCtx(), a.getNativeObject(), args.length,
AST.
arrayToNative(args)));
1835 checkContextMatch(a);
1836 checkContextMatch(i);
1837 checkContextMatch(v);
1838 return new ArrayExpr<>(
this, Native.mkStore(nCtx(), a.getNativeObject(),
1839 i.getNativeObject(), v.getNativeObject()));
1860 checkContextMatch(a);
1861 checkContextMatch(args);
1862 checkContextMatch(v);
1863 return new ArrayExpr<>(
this, Native.mkStoreN(nCtx(), a.getNativeObject(),
1878 checkContextMatch(domain);
1879 checkContextMatch(v);
1880 return new ArrayExpr<>(
this, Native.mkConstArray(nCtx(),
1881 domain.getNativeObject(), v.getNativeObject()));
1900 checkContextMatch(f);
1901 checkContextMatch(args);
1915 checkContextMatch(array);
1917 Native.mkArrayDefault(nCtx(), array.getNativeObject()));
1925 checkContextMatch(arg1);
1926 checkContextMatch(arg2);
1927 return (
Expr<D>)
Expr.create(
this, Native.mkArrayExt(nCtx(), arg1.getNativeObject(), arg2.getNativeObject()));
1936 checkContextMatch(ty);
1945 checkContextMatch(domain);
1947 Native.mkEmptySet(nCtx(), domain.getNativeObject()));
1955 checkContextMatch(domain);
1957 Native.mkFullSet(nCtx(), domain.getNativeObject()));
1965 checkContextMatch(
set);
1966 checkContextMatch(element);
1968 Native.mkSetAdd(nCtx(),
set.getNativeObject(),
1969 element.getNativeObject()));
1977 checkContextMatch(
set);
1978 checkContextMatch(element);
1980 Native.mkSetDel(nCtx(),
set.getNativeObject(),
1981 element.getNativeObject()));
1990 checkContextMatch(args);
1992 Native.mkSetUnion(nCtx(), args.length,
2002 checkContextMatch(args);
2004 Native.mkSetIntersect(nCtx(), args.length,
2013 checkContextMatch(arg1);
2014 checkContextMatch(arg2);
2016 Native.mkSetDifference(nCtx(), arg1.getNativeObject(),
2017 arg2.getNativeObject()));
2025 checkContextMatch(arg);
2027 Native.mkSetComplement(nCtx(), arg.getNativeObject()));
2035 checkContextMatch(elem);
2036 checkContextMatch(
set);
2038 Native.mkSetMember(nCtx(), elem.getNativeObject(),
2039 set.getNativeObject()));
2047 checkContextMatch(arg1);
2048 checkContextMatch(arg2);
2050 Native.mkSetSubset(nCtx(), arg1.getNativeObject(),
2051 arg2.getNativeObject()));
2064 checkContextMatch(s);
2065 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqEmpty(nCtx(), s.getNativeObject()));
2073 checkContextMatch(elem);
2074 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqUnit(nCtx(), elem.getNativeObject()));
2082 StringBuilder buf =
new StringBuilder();
2083 for (
int i = 0; i < s.length(); i += Character.charCount(s.codePointAt(i))) {
2084 int code = s.codePointAt(i);
2085 if (code <= 32 || 127 < code)
2086 buf.append(String.format(
"\\u{%x}", code));
2088 buf.append(s.charAt(i));
2122 return (
IntExpr)
Expr.create(
this, Native.mkStrToInt(nCtx(), e.getNativeObject()));
2131 checkContextMatch(t);
2141 checkContextMatch(s);
2142 return (
IntExpr)
Expr.create(
this, Native.mkSeqLength(nCtx(), s.getNativeObject()));
2150 checkContextMatch(s1, s2);
2151 return (
BoolExpr)
Expr.create(
this, Native.mkSeqPrefix(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2159 checkContextMatch(s1, s2);
2160 return (
BoolExpr)
Expr.create(
this, Native.mkSeqSuffix(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2168 checkContextMatch(s1, s2);
2169 return (
BoolExpr)
Expr.create(
this, Native.mkSeqContains(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2178 checkContextMatch(s1, s2);
2179 return new BoolExpr(
this, Native.mkStrLt(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2187 checkContextMatch(s1, s2);
2188 return new BoolExpr(
this, Native.mkStrLe(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2197 checkContextMatch(s, index);
2198 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqAt(nCtx(), s.getNativeObject(), index.getNativeObject()));
2206 checkContextMatch(s, index);
2207 return (
Expr<R>)
Expr.create(
this, Native.mkSeqNth(nCtx(), s.getNativeObject(), index.getNativeObject()));
2216 checkContextMatch(s, offset, length);
2217 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqExtract(nCtx(), s.getNativeObject(), offset.getNativeObject(), length.getNativeObject()));
2225 checkContextMatch(s, substr, offset);
2226 return (
IntExpr)
Expr.create(
this, Native.mkSeqIndex(nCtx(), s.getNativeObject(), substr.getNativeObject(), offset.getNativeObject()));
2234 checkContextMatch(s, substr);
2235 return (
IntExpr)
Expr.create(
this, Native.mkSeqLastIndex(nCtx(), s.getNativeObject(), substr.getNativeObject()));
2243 checkContextMatch(s, src, dst);
2244 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqReplace(nCtx(), s.getNativeObject(), src.getNativeObject(), dst.getNativeObject()));
2252 checkContextMatch(s, src, dst);
2253 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqReplaceAll(nCtx(), s.getNativeObject(), src.getNativeObject(), dst.getNativeObject()));
2261 checkContextMatch(s, re, dst);
2262 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqReplaceRe(nCtx(), s.getNativeObject(), re.getNativeObject(), dst.getNativeObject()));
2270 checkContextMatch(s, re, dst);
2271 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqReplaceReAll(nCtx(), s.getNativeObject(), re.getNativeObject(), dst.getNativeObject()));
2279 checkContextMatch(s);
2289 checkContextMatch(s, re);
2290 return (
BoolExpr)
Expr.create(
this, Native.mkSeqInRe(nCtx(), s.getNativeObject(), re.getNativeObject()));
2298 checkContextMatch(re);
2299 return (
ReExpr<R>)
Expr.create(
this, Native.mkReStar(nCtx(), re.getNativeObject()));
2307 return (
ReExpr<R>)
Expr.create(
this, Native.mkRePower(nCtx(), re.getNativeObject(), n));
2315 return (
ReExpr<R>)
Expr.create(
this, Native.mkReLoop(nCtx(), re.getNativeObject(), lo, hi));
2323 return (
ReExpr<R>)
Expr.create(
this, Native.mkReLoop(nCtx(), re.getNativeObject(), lo, 0));
2332 checkContextMatch(re);
2333 return (
ReExpr<R>)
Expr.create(
this, Native.mkRePlus(nCtx(), re.getNativeObject()));
2341 checkContextMatch(re);
2342 return (
ReExpr<R>)
Expr.create(
this, Native.mkReOption(nCtx(), re.getNativeObject()));
2350 checkContextMatch(re);
2351 return (
ReExpr<R>)
Expr.create(
this, Native.mkReComplement(nCtx(), re.getNativeObject()));
2360 checkContextMatch(t);
2370 checkContextMatch(t);
2380 checkContextMatch(t);
2389 checkContextMatch(a, b);
2390 return (
ReExpr<R>)
Expr.create(
this, Native.mkReDiff(nCtx(), a.getNativeObject(), b.getNativeObject()));
2400 return (
ReExpr<R>)
Expr.create(
this, Native.mkReEmpty(nCtx(), s.getNativeObject()));
2409 return (
ReExpr<R>)
Expr.create(
this, Native.mkReFull(nCtx(), s.getNativeObject()));
2419 return (
ReExpr<R>)
Expr.create(
this, Native.mkReAllchar(nCtx(), s.getNativeObject()));
2427 checkContextMatch(lo, hi);
2436 checkContextMatch(ch1, ch2);
2437 return (
BoolExpr)
Expr.create(
this, Native.mkCharLe(nCtx(), ch1.getNativeObject(), ch2.getNativeObject()));
2445 checkContextMatch(ch);
2446 return (
IntExpr)
Expr.create(
this, Native.mkCharToInt(nCtx(), ch.getNativeObject()));
2454 checkContextMatch(ch);
2455 return (
BitVecExpr)
Expr.create(
this, Native.mkCharToBv(nCtx(), ch.getNativeObject()));
2463 checkContextMatch(bv);
2464 return (
Expr<CharSort>)
Expr.create(
this, Native.mkCharFromBv(nCtx(), bv.getNativeObject()));
2472 checkContextMatch(ch);
2473 return (
BoolExpr)
Expr.create(
this, Native.mkCharIsDigit(nCtx(), ch.getNativeObject()));
2481 checkContextMatch(args);
2490 checkContextMatch(args);
2499 checkContextMatch(args);
2508 checkContextMatch(args);
2517 checkContextMatch(args);
2534 checkContextMatch(ty);
2536 Native.mkNumeral(nCtx(), v, ty.getNativeObject()));
2551 checkContextMatch(ty);
2552 return (
Expr<R>)
Expr.create(
this, Native.mkInt(nCtx(), v, ty.getNativeObject()));
2567 checkContextMatch(ty);
2569 Native.mkInt64(nCtx(), v, ty.getNativeObject()));
2587 return new RatNum(
this, Native.mkReal(nCtx(), num, den));
2599 return new RatNum(
this, Native.mkNumeral(nCtx(), v, getRealSort()
2600 .getNativeObject()));
2612 return new RatNum(
this, Native.mkInt(nCtx(), v, getRealSort()
2613 .getNativeObject()));
2625 return new RatNum(
this, Native.mkInt64(nCtx(), v, getRealSort()
2626 .getNativeObject()));
2636 return new IntNum(
this, Native.mkNumeral(nCtx(), v, getIntSort()
2637 .getNativeObject()));
2649 return new IntNum(
this, Native.mkInt(nCtx(), v, getIntSort()
2650 .getNativeObject()));
2662 return new IntNum(
this, Native.mkInt64(nCtx(), v, getIntSort()
2663 .getNativeObject()));
2673 return (
BitVecNum) mkNumeral(v, mkBitVecSort(size));
2683 return (
BitVecNum) mkNumeral(v, mkBitVecSort(size));
2693 return (
BitVecNum) mkNumeral(v, mkBitVecSort(size));
2725 return Quantifier.
of(
this,
true, sorts, names, body, weight, patterns,
2726 noPatterns, quantifierID, skolemID);
2738 return Quantifier.
of(
this,
true, boundConstants, body, weight,
2739 patterns, noPatterns, quantifierID, skolemID);
2751 return Quantifier.
of(
this,
false, sorts, names, body, weight,
2752 patterns, noPatterns, quantifierID, skolemID);
2764 return Quantifier.
of(
this,
false, boundConstants, body, weight,
2765 patterns, noPatterns, quantifierID, skolemID);
2779 return mkForall(sorts, names, body, weight, patterns, noPatterns,
2780 quantifierID, skolemID);
2782 return mkExists(sorts, names, body, weight, patterns, noPatterns,
2783 quantifierID, skolemID);
2796 return mkForall(boundConstants, body, weight, patterns, noPatterns,
2797 quantifierID, skolemID);
2799 return mkExists(boundConstants, body, weight, patterns, noPatterns,
2800 quantifierID, skolemID);
2822 return Lambda.
of(
this, sorts, names, body);
2833 return Lambda.
of(
this, boundConstants, body);
2853 Native.setAstPrintMode(nCtx(), value.toInt());
2874 return Native.benchmarkToSmtlibString(nCtx(), name, logic, status,
2875 attributes, assumptions.length,
2895 if (csn != cs || cdn != cd) {
2916 if (csn != cs || cdn != cd)
2936 public Goal mkGoal(
boolean models,
boolean unsatCores,
boolean proofs)
2938 return new Goal(
this, models, unsatCores, proofs);
2954 return Native.getNumTactics(nCtx());
2963 int n = getNumTactics();
2964 String[] res =
new String[n];
2965 for (
int i = 0; i < n; i++)
2966 res[i] = Native.getTacticName(nCtx(), i);
2976 return Native.tacticGetDescr(nCtx(), name);
2984 return new Tactic(
this, name);
2994 checkContextMatch(t1);
2995 checkContextMatch(t2);
2996 checkContextMatch(ts);
2999 if (ts !=
null && ts.length > 0)
3001 last = ts[ts.length - 1].getNativeObject();
3002 for (
int i = ts.length - 2; i >= 0; i--) {
3003 last = Native.tacticAndThen(nCtx(), ts[i].getNativeObject(),
3009 last = Native.tacticAndThen(nCtx(), t2.getNativeObject(), last);
3010 return new Tactic(
this, Native.tacticAndThen(nCtx(),
3011 t1.getNativeObject(), last));
3013 return new Tactic(
this, Native.tacticAndThen(nCtx(),
3014 t1.getNativeObject(), t2.getNativeObject()));
3025 return andThen(t1, t2, ts);
3035 checkContextMatch(t1);
3036 checkContextMatch(t2);
3037 return new Tactic(
this, Native.tacticOrElse(nCtx(),
3038 t1.getNativeObject(), t2.getNativeObject()));
3049 checkContextMatch(t);
3050 return new Tactic(
this, Native.tacticTryFor(nCtx(),
3051 t.getNativeObject(), ms));
3062 checkContextMatch(t);
3063 checkContextMatch(p);
3064 return new Tactic(
this, Native.tacticWhen(nCtx(), p.getNativeObject(),
3065 t.getNativeObject()));
3075 checkContextMatch(p);
3076 checkContextMatch(t1);
3077 checkContextMatch(t2);
3078 return new Tactic(
this, Native.tacticCond(nCtx(), p.getNativeObject(),
3079 t1.getNativeObject(), t2.getNativeObject()));
3088 checkContextMatch(t);
3089 return new Tactic(
this, Native.tacticRepeat(nCtx(),
3090 t.getNativeObject(), max));
3098 return new Tactic(
this, Native.tacticSkip(nCtx()));
3106 return new Tactic(
this, Native.tacticFail(nCtx()));
3115 checkContextMatch(p);
3117 Native.tacticFailIf(nCtx(), p.getNativeObject()));
3126 return new Tactic(
this, Native.tacticFailIfNotDecided(nCtx()));
3135 checkContextMatch(t);
3136 checkContextMatch(p);
3137 return new Tactic(
this, Native.tacticUsingParams(nCtx(),
3138 t.getNativeObject(), p.getNativeObject()));
3149 return usingParams(t, p);
3157 checkContextMatch(t);
3158 return new Tactic(
this, Native.tacticParOr(nCtx(),
3168 checkContextMatch(t1);
3169 checkContextMatch(t2);
3170 return new Tactic(
this, Native.tacticParAndThen(nCtx(),
3171 t1.getNativeObject(), t2.getNativeObject()));
3181 Native.interrupt(nCtx());
3189 return Native.getNumSimplifiers(nCtx());
3198 int n = getNumSimplifiers();
3199 String[] res =
new String[n];
3200 for (
int i = 0; i < n; i++)
3201 res[i] = Native.getSimplifierName(nCtx(), i);
3211 return Native.simplifierGetDescr(nCtx(), name);
3228 checkContextMatch(t1);
3229 checkContextMatch(t2);
3230 checkContextMatch(ts);
3233 if (ts !=
null && ts.length > 0)
3235 last = ts[ts.length - 1].getNativeObject();
3236 for (
int i = ts.length - 2; i >= 0; i--) {
3237 last = Native.simplifierAndThen(nCtx(), ts[i].getNativeObject(),
3243 last = Native.simplifierAndThen(nCtx(), t2.getNativeObject(), last);
3244 return new Simplifier(
this, Native.simplifierAndThen(nCtx(),
3245 t1.getNativeObject(), last));
3247 return new Simplifier(
this, Native.simplifierAndThen(nCtx(),
3248 t1.getNativeObject(), t2.getNativeObject()));
3258 return andThen(t1, t2, ts);
3267 checkContextMatch(t);
3268 checkContextMatch(p);
3269 return new Simplifier(
this, Native.simplifierUsingParams(nCtx(),
3270 t.getNativeObject(), p.getNativeObject()));
3281 return usingParams(t, p);
3289 return Native.getNumProbes(nCtx());
3298 int n = getNumProbes();
3299 String[] res =
new String[n];
3300 for (
int i = 0; i < n; i++)
3301 res[i] = Native.getProbeName(nCtx(), i);
3311 return Native.probeGetDescr(nCtx(), name);
3319 return new Probe(
this, name);
3327 return new Probe(
this, Native.probeConst(nCtx(), val));
3336 checkContextMatch(p1);
3337 checkContextMatch(p2);
3338 return new Probe(
this, Native.probeLt(nCtx(), p1.getNativeObject(),
3339 p2.getNativeObject()));
3348 checkContextMatch(p1);
3349 checkContextMatch(p2);
3350 return new Probe(
this, Native.probeGt(nCtx(), p1.getNativeObject(),
3351 p2.getNativeObject()));
3361 checkContextMatch(p1);
3362 checkContextMatch(p2);
3363 return new Probe(
this, Native.probeLe(nCtx(), p1.getNativeObject(),
3364 p2.getNativeObject()));
3374 checkContextMatch(p1);
3375 checkContextMatch(p2);
3376 return new Probe(
this, Native.probeGe(nCtx(), p1.getNativeObject(),
3377 p2.getNativeObject()));
3386 checkContextMatch(p1);
3387 checkContextMatch(p2);
3388 return new Probe(
this, Native.probeEq(nCtx(), p1.getNativeObject(),
3389 p2.getNativeObject()));
3397 checkContextMatch(p1);
3398 checkContextMatch(p2);
3399 return new Probe(
this, Native.probeAnd(nCtx(), p1.getNativeObject(),
3400 p2.getNativeObject()));
3408 checkContextMatch(p1);
3409 checkContextMatch(p2);
3410 return new Probe(
this, Native.probeOr(nCtx(), p1.getNativeObject(),
3411 p2.getNativeObject()));
3419 checkContextMatch(p);
3420 return new Probe(
this, Native.probeNot(nCtx(), p.getNativeObject()));
3432 return mkSolver((
Symbol)
null);
3446 return new Solver(
this, Native.mkSolver(nCtx()));
3448 return new Solver(
this, Native.mkSolverForLogic(nCtx(),
3449 logic.getNativeObject()));
3458 return mkSolver(mkSymbol(logic));
3466 return new Solver(
this, Native.mkSimpleSolver(nCtx()));
3478 return new Solver(
this, Native.mkSolverFromTactic(nCtx(),
3479 t.getNativeObject()));
3487 return new Solver(
this, Native.solverAddSimplifier(nCtx(), s.getNativeObject(), simp.getNativeObject()));
3522 return new FPRMExpr(
this, Native.mkFpaRoundNearestTiesToEven(nCtx()));
3531 return new FPRMNum(
this, Native.mkFpaRne(nCtx()));
3540 return new FPRMNum(
this, Native.mkFpaRoundNearestTiesToAway(nCtx()));
3549 return new FPRMNum(
this, Native.mkFpaRna(nCtx()));
3558 return new FPRMNum(
this, Native.mkFpaRoundTowardPositive(nCtx()));
3567 return new FPRMNum(
this, Native.mkFpaRtp(nCtx()));
3576 return new FPRMNum(
this, Native.mkFpaRoundTowardNegative(nCtx()));
3585 return new FPRMNum(
this, Native.mkFpaRtn(nCtx()));
3594 return new FPRMNum(
this, Native.mkFpaRoundTowardZero(nCtx()));
3603 return new FPRMNum(
this, Native.mkFpaRtz(nCtx()));
3614 return new FPSort(
this, ebits, sbits);
3623 return new FPSort(
this, Native.mkFpaSortHalf(nCtx()));
3632 return new FPSort(
this, Native.mkFpaSort16(nCtx()));
3641 return new FPSort(
this, Native.mkFpaSortSingle(nCtx()));
3650 return new FPSort(
this, Native.mkFpaSort32(nCtx()));
3659 return new FPSort(
this, Native.mkFpaSortDouble(nCtx()));
3668 return new FPSort(
this, Native.mkFpaSort64(nCtx()));
3677 return new FPSort(
this, Native.mkFpaSortQuadruple(nCtx()));
3686 return new FPSort(
this, Native.mkFpaSort128(nCtx()));
3697 return new FPNum(
this, Native.mkFpaNan(nCtx(), s.getNativeObject()));
3708 return new FPNum(
this, Native.mkFpaInf(nCtx(), s.getNativeObject(), negative));
3719 return new FPNum(
this, Native.mkFpaZero(nCtx(), s.getNativeObject(), negative));
3730 return new FPNum(
this, Native.mkFpaNumeralFloat(nCtx(), v, s.getNativeObject()));
3741 return new FPNum(
this, Native.mkFpaNumeralDouble(nCtx(), v, s.getNativeObject()));
3752 return new FPNum(
this, Native.mkFpaNumeralInt(nCtx(), v, s.getNativeObject()));
3765 return new FPNum(
this, Native.mkFpaNumeralIntUint(nCtx(), sgn, exp, sig, s.getNativeObject()));
3778 return new FPNum(
this, Native.mkFpaNumeralInt64Uint64(nCtx(), sgn, exp, sig, s.getNativeObject()));
3789 return mkFPNumeral(v, s);
3800 return mkFPNumeral(v, s);
3812 return mkFPNumeral(v, s);
3825 return mkFPNumeral(sgn, exp, sig, s);
3838 return mkFPNumeral(sgn, exp, sig, s);
3849 return new FPExpr(
this, Native.mkFpaAbs(nCtx(), t.getNativeObject()));
3859 return new FPExpr(
this, Native.mkFpaNeg(nCtx(), t.getNativeObject()));
3871 return new FPExpr(
this, Native.mkFpaAdd(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
3883 return new FPExpr(
this, Native.mkFpaSub(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
3895 return new FPExpr(
this, Native.mkFpaMul(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
3907 return new FPExpr(
this, Native.mkFpaDiv(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
3922 return new FPExpr(
this, Native.mkFpaFma(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject(), t3.getNativeObject()));
3933 return new FPExpr(
this, Native.mkFpaSqrt(nCtx(), rm.getNativeObject(), t.getNativeObject()));
3944 return new FPExpr(
this, Native.mkFpaRem(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
3956 return new FPExpr(
this, Native.mkFpaRoundToIntegral(nCtx(), rm.getNativeObject(), t.getNativeObject()));
3967 return new FPExpr(
this, Native.mkFpaMin(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
3978 return new FPExpr(
this, Native.mkFpaMax(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
3989 return new BoolExpr(
this, Native.mkFpaLeq(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4000 return new BoolExpr(
this, Native.mkFpaLt(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4011 return new BoolExpr(
this, Native.mkFpaGeq(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4022 return new BoolExpr(
this, Native.mkFpaGt(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4035 return new BoolExpr(
this, Native.mkFpaEq(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4045 return new BoolExpr(
this, Native.mkFpaIsNormal(nCtx(), t.getNativeObject()));
4055 return new BoolExpr(
this, Native.mkFpaIsSubnormal(nCtx(), t.getNativeObject()));
4065 return new BoolExpr(
this, Native.mkFpaIsZero(nCtx(), t.getNativeObject()));
4075 return new BoolExpr(
this, Native.mkFpaIsInfinite(nCtx(), t.getNativeObject()));
4085 return new BoolExpr(
this, Native.mkFpaIsNan(nCtx(), t.getNativeObject()));
4095 return new BoolExpr(
this, Native.mkFpaIsNegative(nCtx(), t.getNativeObject()));
4105 return new BoolExpr(
this, Native.mkFpaIsPositive(nCtx(), t.getNativeObject()));
4123 return new FPExpr(
this, Native.mkFpaFp(nCtx(), sgn.getNativeObject(), sig.getNativeObject(), exp.getNativeObject()));
4139 return new FPExpr(
this, Native.mkFpaToFpBv(nCtx(), bv.getNativeObject(), s.getNativeObject()));
4155 return new FPExpr(
this, Native.mkFpaToFpFloat(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
4171 return new FPExpr(
this, Native.mkFpaToFpReal(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
4190 return new FPExpr(
this, Native.mkFpaToFpSigned(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
4192 return new FPExpr(
this, Native.mkFpaToFpUnsigned(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
4207 return new FPExpr(
this, Native.mkFpaToFpFloat(nCtx(), s.getNativeObject(), rm.getNativeObject(), t.getNativeObject()));
4225 return new BitVecExpr(
this, Native.mkFpaToSbv(nCtx(), rm.getNativeObject(), t.getNativeObject(), sz));
4227 return new BitVecExpr(
this, Native.mkFpaToUbv(nCtx(), rm.getNativeObject(), t.getNativeObject(), sz));
4241 return new RealExpr(
this, Native.mkFpaToReal(nCtx(), t.getNativeObject()));
4256 return new BitVecExpr(
this, Native.mkFpaToIeeeBv(nCtx(), t.getNativeObject()));
4274 return new BitVecExpr(
this, Native.mkFpaToFpIntReal(nCtx(), rm.getNativeObject(), exp.getNativeObject(), sig.getNativeObject(), s.getNativeObject()));
4285 Native.mkLinearOrder(
4287 sort.getNativeObject(),
4301 Native.mkPartialOrder(
4303 sort.getNativeObject(),
4321 return AST.create(
this, nativeObject);
4338 return a.getNativeObject();
4347 return Native.simplifyGetHelp(nCtx());
4355 return new ParamDescrs(
this, Native.simplifyGetParamDescrs(nCtx()));
4368 Native.updateParamValue(nCtx(),
id, value);
4380 void checkContextMatch(
Z3Object other)
4382 if (
this != other.getContext())
4386 void checkContextMatch(Z3Object other1, Z3Object other2)
4388 checkContextMatch(other1);
4389 checkContextMatch(other2);
4392 void checkContextMatch(Z3Object other1, Z3Object other2, Z3Object other3)
4394 checkContextMatch(other1);
4395 checkContextMatch(other2);
4396 checkContextMatch(other3);
4399 void checkContextMatch(Z3Object[] arr)
4402 for (Z3Object a : arr)
4403 checkContextMatch(a);
4406 private Z3ReferenceQueue m_RefQueue =
new Z3ReferenceQueue(
this);
4408 Z3ReferenceQueue getReferenceQueue() {
return m_RefQueue; }
4419 m_RefQueue.forceClear();
4424 m_stringSort =
null;
4427 synchronized (creation_lock) {
4428 Native.delContext(m_ctx);
BoolExpr[] ToBoolExprArray()
final< R extends Sort > FuncDecl< R > mkFuncDecl(String name, Sort[] domain, R range)
final ReExpr< SeqSort< CharSort > > mkRange(Expr< SeqSort< CharSort > > lo, Expr< SeqSort< CharSort > > hi)
Probe ge(Probe p1, Probe p2)
final< R extends Sort > ListSort< R > mkListSort(Symbol name, R elemSort)
final< D extends Sort > ArrayExpr< D, BoolSort > mkSetAdd(Expr< ArraySort< D, BoolSort > > set, Expr< D > element)
Solver mkSolver(String logic)
Tactic repeat(Tactic t, int max)
BitVecExpr mkBVXOR(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final BoolExpr mkDistinct(Expr<?>... args)
BoolExpr MkStringLe(Expr< SeqSort< CharSort > > s1, Expr< SeqSort< CharSort > > s2)
final< F extends Sort, R extends Sort > Expr< R > mkUpdateField(FuncDecl< F > field, Expr< R > t, Expr< F > v)
String[] getSimplifierNames()
final< R extends Sort > SeqExpr< R > mkAt(Expr< SeqSort< R > > s, Expr< IntSort > index)
BitVecExpr mkBVUDiv(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< R extends Sort > Expr< R > mkNumeral(long v, R ty)
String getProbeDescription(String name)
FPNum mkFP(boolean sgn, long exp, long sig, FPSort s)
final< D extends Sort > ArrayExpr< D, BoolSort > mkSetIntersection(Expr< ArraySort< D, BoolSort > >... args)
BoolExpr mkFPIsPositive(Expr< FPSort > t)
BitVecExpr mkBVNOR(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
FPExpr mkFPToFP(Expr< FPRMSort > rm, Expr< BitVecSort > t, FPSort s, boolean signed)
FPRMExpr mkFPRoundNearestTiesToEven()
Expr< CharSort > charFromBv(BitVecExpr bv)
IntExpr stringToInt(Expr< SeqSort< CharSort > > e)
final< R > EnumSort< R > mkEnumSort(Symbol name, Symbol... enumNames)
final< R extends Sort > Expr< R > mkFreshConst(String prefix, R range)
Fixedpoint mkFixedpoint()
Tactic usingParams(Tactic t, Params p)
Tactic parOr(Tactic... t)
BoolExpr mkBVULE(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BoolExpr mkBVSubNoOverflow(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< R extends Sort > SeqExpr< R > mkReplaceReAll(Expr< SeqSort< R > > s, ReExpr< SeqSort< R > > re, Expr< SeqSort< R > > dst)
BoolExpr mkBVNegNoOverflow(Expr< BitVecSort > t)
final< R extends Sort > ReExpr< SeqSort< R > > mkToRe(Expr< SeqSort< R > > s)
final< D extends Sort > ArrayExpr< D, BoolSort > mkSetComplement(Expr< ArraySort< D, BoolSort > > arg)
final< D extends Sort, R extends Sort > Expr< R > mkSelect(Expr< ArraySort< D, R > > a, Expr< D > i)
Tactic then(Tactic t1, Tactic t2, Tactic... ts)
FPExpr mkFPMax(Expr< FPSort > t1, Expr< FPSort > t2)
final< R extends Sort > FuncDecl< BoolSort > mkPartialOrder(R sort, int index)
IntExpr mkBV2Int(Expr< BitVecSort > t, boolean signed)
final< R extends Sort > ReExpr< R > mkLoop(Expr< ReSort< R > > re, int lo)
final< R extends Sort > ReExpr< R > mkComplement(Expr< ReSort< R > > re)
FPSort mkFPSort(int ebits, int sbits)
final< R extends Sort > FuncDecl< R > mkFreshConstDecl(String prefix, R range)
BoolExpr mkBVSDivNoOverflow(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
Probe le(Probe p1, Probe p2)
SeqExpr< CharSort > mkString(String s)
final< R extends Sort > BoolExpr mkPrefixOf(Expr< SeqSort< R > > s1, Expr< SeqSort< R > > s2)
AST wrapAST(long nativeObject)
final< R extends Sort > SeqExpr< R > mkReplace(Expr< SeqSort< R > > s, Expr< SeqSort< R > > src, Expr< SeqSort< R > > dst)
UninterpretedSort mkUninterpretedSort(Symbol s)
BitVecExpr mkBVXNOR(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BoolExpr mkImplies(Expr< BoolSort > t1, Expr< BoolSort > t2)
BoolExpr mkBVAddNoOverflow(Expr< BitVecSort > t1, Expr< BitVecSort > t2, boolean isSigned)
Simplifier mkSimplifier(String name)
BitVecExpr mkBVRotateRight(int i, Expr< BitVecSort > t)
RealExpr mkInt2Real(Expr< IntSort > t)
final< R extends Sort > Expr< R > mkITE(Expr< BoolSort > t1, Expr<? extends R > t2, Expr<? extends R > t3)
BitVecExpr mkBVLSHR(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
FPNum mkFPNumeral(boolean sgn, int exp, int sig, FPSort s)
FPNum mkFP(double v, FPSort s)
BoolExpr mkLe(Expr<? extends ArithSort > t1, Expr<? extends ArithSort > t2)
IntExpr mkReal2Int(Expr< RealSort > t)
final< D extends Sort > BoolExpr mkSetSubset(Expr< ArraySort< D, BoolSort > > arg1, Expr< ArraySort< D, BoolSort > > arg2)
FPNum mkFPInf(FPSort s, boolean negative)
FPExpr mkFPRoundToIntegral(Expr< FPRMSort > rm, Expr< FPSort > t)
BoolExpr mkAtLeast(Expr< BoolSort >[] args, int k)
BitVecExpr mkBVSMod(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BitVecExpr mkInt2BV(int n, Expr< IntSort > t)
BoolExpr mkBVSGE(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BitVecExpr mkBVConst(Symbol name, int size)
BitVecExpr mkExtract(int high, int low, Expr< BitVecSort > t)
FPRMNum mkFPRoundTowardZero()
BoolExpr mkFPGEq(Expr< FPSort > t1, Expr< FPSort > t2)
final< R extends Sort > SeqExpr< R > mkUnit(Expr< R > elem)
Probe or(Probe p1, Probe p2)
BitVecExpr mkBVURem(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< D extends Sort, R1 extends Sort, R2 extends Sort > ArrayExpr< D, R2 > mkMap(FuncDecl< R2 > f, Expr< ArraySort< D, R1 > >... args)
final< D extends Sort, R extends Sort > ArrayExpr< D, R > mkConstArray(D domain, Expr< R > v)
Tactic cond(Probe p, Tactic t1, Tactic t2)
BoolExpr mkBVSGT(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BitVecExpr mkBVConst(String name, int size)
final< R extends Sort > SeqSort< R > mkSeqSort(R s)
BoolExpr mkAtMost(Expr< BoolSort >[] args, int k)
final< R extends Sort > Expr< R > mkSelect(Expr< ArraySort< Sort, R > > a, Expr<?>[] args)
BoolExpr mkFPIsSubnormal(Expr< FPSort > t)
IntExpr mkMod(Expr< IntSort > t1, Expr< IntSort > t2)
FPExpr mkFPToFP(Expr< FPRMSort > rm, RealExpr t, FPSort s)
FPExpr mkFPSub(Expr< FPRMSort > rm, Expr< FPSort > t1, Expr< FPSort > t2)
final< R extends Sort > ReExpr< R > mkAllcharRe(ReSort< R > s)
SeqExpr< CharSort > intToString(Expr< IntSort > e)
BoolExpr mkBVMulNoOverflow(Expr< BitVecSort > t1, Expr< BitVecSort > t2, boolean isSigned)
FPExpr mkFPSqrt(Expr< FPRMSort > rm, Expr< FPSort > t)
FPNum mkFPNumeral(int v, FPSort s)
final< R extends Sort > Expr< R > mkConst(String name, R range)
FPExpr mkFPMul(Expr< FPRMSort > rm, Expr< FPSort > t1, Expr< FPSort > t2)
final< R extends Sort > ReExpr< R > mkStar(Expr< ReSort< R > > re)
BitVecExpr mkConcat(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BitVecExpr mkSignExt(int i, Expr< BitVecSort > t)
BitVecExpr mkBVAdd(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
FPNum mkFP(boolean sgn, int exp, int sig, FPSort s)
final< R extends Sort > FuncDecl< R > mkFreshFuncDecl(String prefix, Sort[] domain, R range)
final< R extends Sort > Expr< R > mkBound(int index, R ty)
final< R extends Sort > SeqExpr< R > mkReplaceAll(Expr< SeqSort< R > > s, Expr< SeqSort< R > > src, Expr< SeqSort< R > > dst)
void updateParamValue(String id, String value)
BitVecExpr mkZeroExt(int i, Expr< BitVecSort > t)
Simplifier andThen(Simplifier t1, Simplifier t2, Simplifier... ts)
SeqExpr< CharSort > ubvToString(Expr< BitVecSort > e)
final< R extends Sort > Lambda< R > mkLambda(Sort[] sorts, Symbol[] names, Expr< R > body)
final< R extends Sort > ReExpr< R > mkConcat(ReExpr< R >... t)
BoolExpr mkFPLt(Expr< FPSort > t1, Expr< FPSort > t2)
final< R extends Sort > ReExpr< R > mkFullRe(ReSort< R > s)
BitVecExpr mkBVRedAND(Expr< BitVecSort > t)
BitVecNum mkBV(long v, int size)
BitVecExpr mkBVSRem(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
FPNum mkFPNumeral(float v, FPSort s)
Tactic when(Probe p, Tactic t)
final< R extends Sort > ReExpr< R > mkPlus(Expr< ReSort< R > > re)
Probe mkProbe(String name)
BoolExpr mkPBLe(int[] coeffs, Expr< BoolSort >[] args, int k)
RealExpr mkRealConst(String name)
final< R extends Sort > IntExpr mkLength(Expr< SeqSort< R > > s)
final< R extends ArithSort > ArithExpr< R > mkAdd(Expr<? extends R >... t)
Tactic failIfNotDecided()
ParamDescrs getSimplifyParameterDescriptions()
BitVecExpr mkBVRotateRight(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< D extends Sort > ArrayExpr< D, BoolSort > mkFullSet(D domain)
SeqExpr< CharSort > sbvToString(Expr< BitVecSort > e)
Probe gt(Probe p1, Probe p2)
BoolExpr mkFPIsNaN(Expr< FPSort > t)
BoolExpr mkEq(Expr<?> x, Expr<?> y)
Tactic with(Tactic t, Params p)
final BoolExpr mkNot(Expr< BoolSort > a)
BitVecExpr mkBVASHR(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BoolExpr[] parseSMTLIB2String(String str, Symbol[] sortNames, Sort[] sorts, Symbol[] declNames, FuncDecl<?>[] decls)
final< R > DatatypeSort< R > mkDatatypeSort(Symbol name, Constructor< R >[] constructors)
String[] getTacticNames()
Solver mkSolver(Solver s, Simplifier simp)
String benchmarkToSMTString(String name, String logic, String status, String attributes, Expr< BoolSort >[] assumptions, Expr< BoolSort > formula)
final< R extends Sort > ArraySort< Sort, R > mkArraySort(Sort[] domains, R range)
FPRMNum mkFPRoundNearestTiesToAway()
BoolExpr mkIsDigit(Expr< CharSort > ch)
BoolExpr mkBool(boolean value)
final< R extends Sort > BoolExpr mkInRe(Expr< SeqSort< R > > s, ReExpr< SeqSort< R > > re)
final< D extends Sort, R extends Sort > ArraySort< D, R > mkArraySort(D domain, R range)
BitVecExpr mkBVMul(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< R extends Sort > Expr< R > mkNumeral(int v, R ty)
BitVecExpr mkBVSub(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
TupleSort mkTupleSort(Symbol name, Symbol[] fieldNames, Sort[] fieldSorts)
BitVecExpr mkBVOR(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BoolExpr mkLt(Expr<? extends ArithSort > t1, Expr<? extends ArithSort > t2)
final Pattern mkPattern(Expr<?>... terms)
final< D extends Sort, R extends Sort > ArrayExpr< D, R > mkArrayConst(Symbol name, D domain, R range)
final< R > Constructor< R > mkConstructor(String name, String recognizer, String[] fieldNames, Sort[] sorts, int[] sortRefs)
BitVecExpr mkRepeat(int i, Expr< BitVecSort > t)
final< R extends Sort > IntExpr mkLastIndexOf(Expr< SeqSort< R > > s, Expr< SeqSort< R > > substr)
final< R extends Sort > Expr< R > mkNumeral(String v, R ty)
BoolExpr mkXor(Expr< BoolSort > t1, Expr< BoolSort > t2)
Simplifier then(Simplifier t1, Simplifier t2, Simplifier... ts)
FPRMNum mkFPRoundTowardNegative()
Probe eq(Probe p1, Probe p2)
Quantifier mkForall(Sort[] sorts, Symbol[] names, Expr< BoolSort > body, int weight, Pattern[] patterns, Expr<?>[] noPatterns, Symbol quantifierID, Symbol skolemID)
BitVecExpr mkBVRotateLeft(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< R extends Sort > FuncDecl< BoolSort > mkLinearOrder(R sort, int index)
final< R extends Sort > FuncDecl< R > mkFuncDecl(String name, Sort domain, R range)
final< R extends Sort > Expr< R > mkNth(Expr< SeqSort< R > > s, Expr< IntSort > index)
final< R extends Sort > ReExpr< R > mkEmptyRe(ReSort< R > s)
Quantifier mkQuantifier(boolean universal, Expr<?>[] boundConstants, Expr< BoolSort > body, int weight, Pattern[] patterns, Expr<?>[] noPatterns, Symbol quantifierID, Symbol skolemID)
BitVecExpr mkBVRedOR(Expr< BitVecSort > t)
BoolExpr mkBVUGE(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
FPExpr mkFPDiv(Expr< FPRMSort > rm, Expr< FPSort > t1, Expr< FPSort > t2)
final< R extends Sort > SeqExpr< R > mkExtract(Expr< SeqSort< R > > s, Expr< IntSort > offset, Expr< IntSort > length)
BitVecExpr mkBVNAND(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< R extends Sort > SeqExpr< R > mkEmptySeq(R s)
final< R extends ArithSort > ArithExpr< R > mkDiv(Expr<? extends R > t1, Expr<? extends R > t2)
FPExpr mkFPRem(Expr< FPSort > t1, Expr< FPSort > t2)
SeqSort< CharSort > getStringSort()
final< D extends Sort, R extends Sort > Expr< D > mkArrayExt(Expr< ArraySort< D, R > > arg1, Expr< ArraySort< D, R > > arg2)
final< R extends Sort > ReExpr< R > mkLoop(Expr< ReSort< R > > re, int lo, int hi)
Quantifier mkQuantifier(boolean universal, Sort[] sorts, Symbol[] names, Expr< BoolSort > body, int weight, Pattern[] patterns, Expr<?>[] noPatterns, Symbol quantifierID, Symbol skolemID)
IntExpr mkIntConst(String name)
Solver mkSolver(Tactic t)
BoolExpr[] parseSMTLIB2File(String fileName, Symbol[] sortNames, Sort[] sorts, Symbol[] declNames, FuncDecl<?>[] decls)
Tactic andThen(Tactic t1, Tactic t2, Tactic... ts)
final< R extends Sort > Expr< R > mkApp(FuncDecl< R > f, Expr<?>... args)
BoolExpr mkBVAddNoUnderflow(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BoolExpr mkBVSubNoUnderflow(Expr< BitVecSort > t1, Expr< BitVecSort > t2, boolean isSigned)
BoolExpr mkFPIsZero(Expr< FPSort > t)
final< R > DatatypeSort< R > mkDatatypeSort(String name, Constructor< R >[] constructors)
final< R extends Sort > Expr< R > mkConst(FuncDecl< R > f)
BitVecExpr charToBv(Expr< CharSort > ch)
IntExpr mkIntConst(Symbol name)
final< R > FiniteDomainSort< R > mkFiniteDomainSort(Symbol name, long size)
final< R extends Sort > ReExpr< R > mkPower(Expr< ReSort< R > > re, int n)
final< R extends Sort > FuncDecl< R > mkConstDecl(String name, R range)
Simplifier with(Simplifier t, Params p)
BitVecExpr mkBVNeg(Expr< BitVecSort > t)
Tactic mkTactic(String name)
BoolExpr mkBVSLE(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
FPNum mkFPNumeral(double v, FPSort s)
final< R extends Sort > ListSort< R > mkListSort(String name, R elemSort)
Tactic parAndThen(Tactic t1, Tactic t2)
BoolExpr mkGt(Expr<? extends ArithSort > t1, Expr<? extends ArithSort > t2)
BitVecNum mkBV(int v, int size)
final< R extends ArithSort > ArithExpr< R > mkPower(Expr<? extends R > t1, Expr<? extends R > t2)
Context(Map< String, String > settings)
final< R extends Sort > ReExpr< R > mkIntersect(Expr< ReSort< R > >... t)
final< R extends Sort > FuncDecl< R > mkFuncDecl(Symbol name, Sort domain, R range)
final< R extends ArithSort > ArithExpr< R > mkMul(Expr<? extends R >... t)
BoolExpr mkBVMulNoUnderflow(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BitVecExpr mkBVSDiv(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
FPRMSort mkFPRoundingModeSort()
RealExpr mkRealConst(Symbol name)
String getTacticDescription(String name)
Solver mkSolver(Symbol logic)
BoolExpr mkFPEq(Expr< FPSort > t1, Expr< FPSort > t2)
final< R extends Sort > IntExpr mkIndexOf(Expr< SeqSort< R > > s, Expr< SeqSort< R > > substr, Expr< IntSort > offset)
BoolExpr mkFPLEq(Expr< FPSort > t1, Expr< FPSort > t2)
RatNum mkReal(int num, int den)
BitVecSort mkBitVecSort(int size)
final< D extends Sort, R extends Sort > ArrayExpr< D, R > mkStore(Expr< ArraySort< D, R > > a, Expr< D > i, Expr< R > v)
FPExpr mkFPToFP(Expr< BitVecSort > bv, FPSort s)
BoolExpr mkBVSLT(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
BoolExpr mkFPGt(Expr< FPSort > t1, Expr< FPSort > t2)
BoolExpr mkIff(Expr< BoolSort > t1, Expr< BoolSort > t2)
BoolExpr mkGe(Expr<? extends ArithSort > t1, Expr<? extends ArithSort > t2)
BitVecExpr mkFPToFP(Expr< FPRMSort > rm, Expr< IntSort > exp, Expr< RealSort > sig, FPSort s)
BoolExpr mkIsInteger(Expr< RealSort > t)
FPExpr mkFPToFP(Expr< FPRMSort > rm, FPExpr t, FPSort s)
Probe constProbe(double val)
BoolExpr mkFPIsNegative(Expr< FPSort > t)
final< D extends Sort, R extends Sort > ArrayExpr< D, R > mkArrayConst(String name, D domain, R range)
BoolExpr mkBoolConst(String name)
RealExpr mkFPToReal(Expr< FPSort > t)
BoolExpr MkStringLt(Expr< SeqSort< CharSort > > s1, Expr< SeqSort< CharSort > > s2)
FPExpr mkFP(Expr< BitVecSort > sgn, Expr< BitVecSort > sig, Expr< BitVecSort > exp)
FPExpr mkFPToFP(FPSort s, Expr< FPRMSort > rm, Expr< FPSort > t)
FPExpr mkFPNeg(Expr< FPSort > t)
final< R extends Sort > SeqExpr< R > mkConcat(Expr< SeqSort< R > >... t)
BoolExpr mkCharLe(Expr< CharSort > ch1, Expr< CharSort > ch2)
FPNum mkFPNumeral(boolean sgn, long exp, long sig, FPSort s)
final< R extends Sort > BoolExpr mkSuffixOf(Expr< SeqSort< R > > s1, Expr< SeqSort< R > > s2)
SeqSort< CharSort > mkStringSort()
final< R extends Sort > BoolExpr mkContains(Expr< SeqSort< R > > s1, Expr< SeqSort< R > > s2)
FPSort mkFPSortQuadruple()
FPRMNum mkFPRoundTowardPositive()
final< D extends Sort > SetSort< D > mkSetSort(D ty)
Quantifier mkExists(Expr<?>[] boundConstants, Expr< BoolSort > body, int weight, Pattern[] patterns, Expr<?>[] noPatterns, Symbol quantifierID, Symbol skolemID)
final< D extends Sort > BoolExpr mkSetMembership(Expr< D > elem, Expr< ArraySort< D, BoolSort > > set)
final< R > Constructor< R > mkConstructor(Symbol name, Symbol recognizer, Symbol[] fieldNames, Sort[] sorts, int[] sortRefs)
final< D extends Sort > ArrayExpr< D, BoolSort > mkSetUnion(Expr< ArraySort< D, BoolSort > >... args)
BoolExpr mkBVULT(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< R extends Sort > ArrayExpr< Sort, R > mkStore(Expr< ArraySort< Sort, R > > a, Expr<?>[] args, Expr< R > v)
final< R extends Sort > ReExpr< R > mkOption(Expr< ReSort< R > > re)
BoolExpr mkFPIsNormal(Expr< FPSort > t)
DatatypeSort< Object >[] mkDatatypeSorts(String[] names, Constructor< Object >[][] c)
final< R extends Sort > SeqExpr< R > mkReplaceRe(Expr< SeqSort< R > > s, ReExpr< SeqSort< R > > re, Expr< SeqSort< R > > dst)
Probe and(Probe p1, Probe p2)
IntExpr charToInt(Expr< CharSort > ch)
Tactic tryFor(Tactic t, int ms)
FPExpr mkFPFMA(Expr< FPRMSort > rm, Expr< FPSort > t1, Expr< FPSort > t2, Expr< FPSort > t3)
UninterpretedSort mkUninterpretedSort(String str)
void setPrintMode(Z3_ast_print_mode value)
DatatypeSort< Object >[] mkDatatypeSorts(Symbol[] names, Constructor< Object >[][] c)
final BoolExpr mkAnd(Expr< BoolSort >... t)
final< R extends Sort > FuncDecl< R > mkConstDecl(Symbol name, R range)
BitVecNum mkBV(String v, int size)
BitVecExpr mkBVRotateLeft(int i, Expr< BitVecSort > t)
Probe lt(Probe p1, Probe p2)
final< D extends Sort > ArrayExpr< D, BoolSort > mkSetDel(Expr< ArraySort< D, BoolSort > > set, Expr< D > element)
Quantifier mkForall(Expr<?>[] boundConstants, Expr< BoolSort > body, int weight, Pattern[] patterns, Expr<?>[] noPatterns, Symbol quantifierID, Symbol skolemID)
final< R extends Sort > void AddRecDef(FuncDecl< R > f, Expr<?>[] args, Expr< R > body)
final< R extends Sort > ReSort< R > mkReSort(R s)
IntExpr mkRem(Expr< IntSort > t1, Expr< IntSort > t2)
BitVecExpr mkBVNot(Expr< BitVecSort > t)
final< R extends ArithSort > ArithExpr< R > mkSub(Expr<? extends R >... t)
BitVecExpr mkBVAND(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< R extends Sort > FuncDecl< R > mkFuncDecl(Symbol name, Sort[] domain, R range)
FPExpr mkFPAbs(Expr< FPSort > t)
BoolExpr mkPBEq(int[] coeffs, Expr< BoolSort >[] args, int k)
Goal mkGoal(boolean models, boolean unsatCores, boolean proofs)
final< R extends ArithSort > ArithExpr< R > mkUnaryMinus(Expr< R > t)
FPExpr mkFPAdd(Expr< FPRMSort > rm, Expr< FPSort > t1, Expr< FPSort > t2)
BoolExpr mkBVUGT(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
FPNum mkFP(float v, FPSort s)
final BoolExpr mkOr(Expr< BoolSort >... t)
BitVecExpr mkBVSHL(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
String getSimplifierDescription(String name)
final< R extends Sort > Expr< R > mkConst(Symbol name, R range)
final< D extends Sort > ArrayExpr< D, BoolSort > mkEmptySet(D domain)
Quantifier mkExists(Sort[] sorts, Symbol[] names, Expr< BoolSort > body, int weight, Pattern[] patterns, Expr<?>[] noPatterns, Symbol quantifierID, Symbol skolemID)
BitVecExpr mkFPToIEEEBV(Expr< FPSort > t)
final< R extends Sort > Lambda< R > mkLambda(Expr<?>[] boundConstants, Expr< R > body)
FPExpr mkFPMin(Expr< FPSort > t1, Expr< FPSort > t2)
Tactic orElse(Tactic t1, Tactic t2)
final< R extends Sort > FuncDecl< R > mkRecFuncDecl(Symbol name, Sort[] domain, R range)
final< R extends Sort > FuncDecl< R > mkPropagateFunction(Symbol name, Sort[] domain, R range)
FPNum mkFP(int v, FPSort s)
final< D extends Sort, R extends Sort > Expr< R > mkTermArray(Expr< ArraySort< D, R > > array)
final< R extends Sort > ReExpr< R > mkUnion(Expr< ReSort< R > >... t)
IntSymbol mkSymbol(int i)
final< R extends Sort > ReExpr< R > mkDiff(Expr< ReSort< R > > a, Expr< ReSort< R > > b)
StringSymbol mkSymbol(String name)
FPNum mkFPZero(FPSort s, boolean negative)
final< D extends Sort > ArrayExpr< D, BoolSort > mkSetDifference(Expr< ArraySort< D, BoolSort > > arg1, Expr< ArraySort< D, BoolSort > > arg2)
BoolExpr mkFPIsInfinite(Expr< FPSort > t)
final< R > FiniteDomainSort< R > mkFiniteDomainSort(String name, long size)
Simplifier usingParams(Simplifier t, Params p)
BoolExpr mkBoolConst(Symbol name)
final< R > EnumSort< R > mkEnumSort(String name, String... enumNames)
BitVecExpr mkFPToBV(Expr< FPRMSort > rm, Expr< FPSort > t, int sz, boolean signed)
BoolExpr mkPBGe(int[] coeffs, Expr< BoolSort >[] args, int k)
static< R extends Sort > Lambda< R > of(Context ctx, Sort[] sorts, Symbol[] names, Expr< R > body)
static Quantifier of(Context ctx, boolean isForall, Sort[] sorts, Symbol[] names, Expr< BoolSort > body, int weight, Pattern[] patterns, Expr<?>[] noPatterns, Symbol quantifierID, Symbol skolemID)
static long[] arrayToNative(Z3Object[] a)
static int arrayLength(Z3Object[] a)
Z3_ast_print_mode
Z3 pretty printing modes (See Z3_set_ast_print_mode).