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 ComplexSort m_complexSort =
null;
124 private SeqSort<CharSort> m_stringSort =
null;
131 if (m_boolSort ==
null) {
142 if (m_intSort ==
null) {
153 if (m_realSort ==
null) {
162 if (m_complexSort ==
null) {
165 return m_complexSort;
196 if (m_stringSort ==
null) {
197 m_stringSort = mkStringSort();
207 checkContextMatch(s);
216 return mkUninterpretedSort(mkSymbol(str));
240 return new BitVecSort(
this, Native.mkBvSort(nCtx(), size));
248 checkContextMatch(domain);
249 checkContextMatch(range);
259 checkContextMatch(domains);
260 checkContextMatch(range);
269 return new SeqSort<>(
this, Native.mkStringSort(nCtx()));
277 return new SeqSort<>(
this, Native.mkSeqSort(nCtx(), s.getNativeObject()));
285 return new ReSort<>(
this, Native.mkReSort(nCtx(), s.getNativeObject()));
295 checkContextMatch(name);
296 checkContextMatch(fieldNames);
297 checkContextMatch(fieldSorts);
298 return new TupleSort(
this, name, fieldNames.length, fieldNames,
308 checkContextMatch(name);
309 checkContextMatch(enumNames);
319 return new EnumSort<>(
this, mkSymbol(name), mkSymbols(enumNames));
327 checkContextMatch(name);
328 checkContextMatch(elemSort);
337 checkContextMatch(elemSort);
338 return new ListSort<>(
this, mkSymbol(name), elemSort);
347 checkContextMatch(name);
372 Symbol[] fieldNames,
Sort[] sorts,
int[] sortRefs)
375 return of(
this, name, recognizer, fieldNames, sorts, sortRefs);
382 String[] fieldNames,
Sort[] sorts,
int[] sortRefs)
384 return of(
this, mkSymbol(name), mkSymbol(recognizer), mkSymbols(fieldNames), sorts, sortRefs);
392 checkContextMatch(name);
393 checkContextMatch(constructors);
403 checkContextMatch(constructors);
415 checkContextMatch(name);
417 checkContextMatch(params);
419 int numParams = (params ==
null) ? 0 : params.length;
420 long[] paramsNative = (params ==
null) ?
new long[0] :
AST.arrayToNative(params);
421 return new DatatypeSort<>(
this, Native.mkDatatypeSort(nCtx(), name.getNativeObject(), numParams, paramsNative));
429 public <R> DatatypeSort<R> mkDatatypeSortRef(Symbol name)
431 return mkDatatypeSortRef(name,
null);
440 public <R> DatatypeSort<R> mkDatatypeSortRef(String name, Sort[] params)
442 return mkDatatypeSortRef(mkSymbol(name), params);
450 public <R> DatatypeSort<R> mkDatatypeSortRef(String name)
452 return mkDatatypeSortRef(name,
null);
462 checkContextMatch(names);
463 int n = names.length;
465 long[] n_constr =
new long[n];
466 for (
int i = 0; i < n; i++)
470 checkContextMatch(constructor);
472 n_constr[i] = cla[i].getNativeObject();
474 long[] n_res =
new long[n];
478 for (
int i = 0; i < n; i++)
489 return mkDatatypeSorts(mkSymbols(names), c);
500 checkContextMatch(name);
512 return mkTypeVariable(mkSymbol(name));
540 checkContextMatch(name);
541 checkContextMatch(parameters);
542 checkContextMatch(constructors);
544 int numParams = parameters.length;
547 int numConstructors = constructors.length;
548 long[] constructorsNative =
new long[numConstructors];
549 for (
int i = 0; i < numConstructors; i++) {
550 constructorsNative[i] = constructors[i].getNativeObject();
553 long nativeSort = Native.mkPolymorphicDatatype(nCtx(), name.getNativeObject(),
554 numParams, paramsNative, numConstructors, constructorsNative);
556 return new DatatypeSort<>(
this, nativeSort);
569 public <R> DatatypeSort<R> mkPolymorphicDatatypeSort(String name, Sort[] parameters, Constructor<R>[] constructors)
571 return mkPolymorphicDatatypeSort(mkSymbol(name), parameters, constructors);
584 Native.datatypeUpdateField
585 (nCtx(), field.getNativeObject(),
586 t.getNativeObject(), v.getNativeObject()));
595 checkContextMatch(name);
596 checkContextMatch(domain);
597 checkContextMatch(range);
598 return new FuncDecl<>(
this, name, domain, range);
603 checkContextMatch(name);
604 checkContextMatch(domain);
605 checkContextMatch(range);
606 long f = Native.solverPropagateDeclare(
608 name.getNativeObject(),
611 range.getNativeObject());
622 checkContextMatch(name);
623 checkContextMatch(domain);
624 checkContextMatch(range);
635 checkContextMatch(domain);
636 checkContextMatch(range);
637 return new FuncDecl<>(
this, mkSymbol(name), domain, range);
646 checkContextMatch(domain);
647 checkContextMatch(range);
649 return new FuncDecl<>(
this, mkSymbol(name), q, range);
657 checkContextMatch(name);
658 checkContextMatch(domain);
659 checkContextMatch(range);
660 return new FuncDecl<>(
this, name, domain, range,
true);
672 checkContextMatch(f);
673 checkContextMatch(args);
674 checkContextMatch(body);
676 Native.addRecDef(nCtx(), f.getNativeObject(), args.length, argsNative, body.getNativeObject());
688 checkContextMatch(domain);
689 checkContextMatch(range);
690 return new FuncDecl<>(
this, prefix, domain, range);
698 checkContextMatch(name);
699 checkContextMatch(range);
700 return new FuncDecl<>(
this, name,
null, range);
708 checkContextMatch(range);
709 return new FuncDecl<>(
this, mkSymbol(name),
null, range);
721 checkContextMatch(range);
722 return new FuncDecl<>(
this, prefix,
null, range);
733 Native.mkBound(nCtx(), index, ty.getNativeObject()));
742 if (terms.length == 0)
743 throw new Z3Exception(
"Cannot create a pattern from zero terms");
746 return new Pattern(
this, Native.mkPattern(nCtx(), terms.length,
756 checkContextMatch(name);
757 checkContextMatch(range);
761 Native.mkConst(nCtx(), name.getNativeObject(),
762 range.getNativeObject()));
771 return mkConst(mkSymbol(name), range);
780 checkContextMatch(range);
782 Native.mkFreshConst(nCtx(), prefix, range.getNativeObject()));
791 return mkApp(f, (
Expr<?>[])
null);
799 return (
BoolExpr) mkConst(name, getBoolSort());
807 return (
BoolExpr) mkConst(mkSymbol(name), getBoolSort());
815 return (
IntExpr) mkConst(name, getIntSort());
823 return (
IntExpr) mkConst(name, getIntSort());
831 return (
RealExpr) mkConst(name, getRealSort());
839 return (
RealExpr) mkConst(name, getRealSort());
845 return (
ComplexExpr) mkConst(name, getComplexSort());
851 return (
ComplexExpr) mkConst(name, getComplexSort());
857 checkContextMatch(real);
858 checkContextMatch(imag);
859 return new ComplexExpr(
this, Native.mkComplex(nCtx(), real.getNativeObject(), imag.getNativeObject()));
865 checkContextMatch(value);
866 return new RealExpr(
this, Native.mkRealPart(nCtx(), value.getNativeObject()));
872 checkContextMatch(value);
873 return new RealExpr(
this, Native.mkImagPart(nCtx(), value.getNativeObject()));
881 return (
BitVecExpr) mkConst(name, mkBitVecSort(size));
889 return (
BitVecExpr) mkConst(name, mkBitVecSort(size));
898 checkContextMatch(f);
899 checkContextMatch(args);
900 return Expr.create(
this, f, args);
908 return new BoolExpr(
this, Native.mkTrue(nCtx()));
916 return new BoolExpr(
this, Native.mkFalse(nCtx()));
924 return value ? mkTrue() : mkFalse();
932 checkContextMatch(x);
933 checkContextMatch(y);
934 return new BoolExpr(
this, Native.mkEq(nCtx(), x.getNativeObject(),
935 y.getNativeObject()));
944 checkContextMatch(args);
945 return new BoolExpr(
this, Native.mkDistinct(nCtx(), args.length,
954 checkContextMatch(a);
955 return new BoolExpr(
this, Native.mkNot(nCtx(), a.getNativeObject()));
967 checkContextMatch(t1);
968 checkContextMatch(t2);
969 checkContextMatch(t3);
970 return (
Expr<R>)
Expr.create(
this, Native.mkIte(nCtx(), t1.getNativeObject(),
971 t2.getNativeObject(), t3.getNativeObject()));
979 checkContextMatch(t1);
980 checkContextMatch(t2);
981 return new BoolExpr(
this, Native.mkIff(nCtx(), t1.getNativeObject(),
982 t2.getNativeObject()));
990 checkContextMatch(t1);
991 checkContextMatch(t2);
992 return new BoolExpr(
this, Native.mkImplies(nCtx(),
993 t1.getNativeObject(), t2.getNativeObject()));
1001 checkContextMatch(t1);
1002 checkContextMatch(t2);
1003 return new BoolExpr(
this, Native.mkXor(nCtx(), t1.getNativeObject(),
1004 t2.getNativeObject()));
1013 checkContextMatch(t);
1014 return new BoolExpr(
this, Native.mkAnd(nCtx(), t.length,
1024 checkContextMatch(t);
1025 return new BoolExpr(
this, Native.mkOr(nCtx(), t.length,
1035 checkContextMatch(t);
1046 checkContextMatch(t);
1057 checkContextMatch(t);
1067 checkContextMatch(t);
1069 Native.mkUnaryMinus(nCtx(), t.getNativeObject()));
1077 checkContextMatch(t1);
1078 checkContextMatch(t2);
1080 t1.getNativeObject(), t2.getNativeObject()));
1090 checkContextMatch(t1);
1091 checkContextMatch(t2);
1092 return new IntExpr(
this, Native.mkMod(nCtx(), t1.getNativeObject(),
1093 t2.getNativeObject()));
1103 checkContextMatch(t1);
1104 checkContextMatch(t2);
1105 return new IntExpr(
this, Native.mkRem(nCtx(), t1.getNativeObject(),
1106 t2.getNativeObject()));
1115 checkContextMatch(t1);
1116 checkContextMatch(t2);
1119 Native.mkPower(nCtx(), t1.getNativeObject(),
1120 t2.getNativeObject()));
1128 checkContextMatch(t1);
1129 checkContextMatch(t2);
1130 return new BoolExpr(
this, Native.mkLt(nCtx(), t1.getNativeObject(),
1131 t2.getNativeObject()));
1139 checkContextMatch(t1);
1140 checkContextMatch(t2);
1141 return new BoolExpr(
this, Native.mkLe(nCtx(), t1.getNativeObject(),
1142 t2.getNativeObject()));
1150 checkContextMatch(t1);
1151 checkContextMatch(t2);
1152 return new BoolExpr(
this, Native.mkGt(nCtx(), t1.getNativeObject(),
1153 t2.getNativeObject()));
1161 checkContextMatch(t1);
1162 checkContextMatch(t2);
1163 return new BoolExpr(
this, Native.mkGe(nCtx(), t1.getNativeObject(),
1164 t2.getNativeObject()));
1179 checkContextMatch(t);
1181 Native.mkInt2real(nCtx(), t.getNativeObject()));
1192 checkContextMatch(t);
1193 return new IntExpr(
this, Native.mkReal2int(nCtx(), t.getNativeObject()));
1201 checkContextMatch(t);
1202 return new BoolExpr(
this, Native.mkIsInt(nCtx(), t.getNativeObject()));
1211 checkContextMatch(arg);
1212 return (
ArithExpr<R>)
Expr.create(
this, Native.mkAbs(nCtx(), arg.getNativeObject()));
1221 checkContextMatch(t1);
1222 checkContextMatch(t2);
1223 return new BoolExpr(
this, Native.mkDivides(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
1233 checkContextMatch(t);
1234 return new BitVecExpr(
this, Native.mkBvnot(nCtx(), t.getNativeObject()));
1244 checkContextMatch(t);
1245 return new BitVecExpr(
this, Native.mkBvredand(nCtx(),
1246 t.getNativeObject()));
1256 checkContextMatch(t);
1257 return new BitVecExpr(
this, Native.mkBvredor(nCtx(),
1258 t.getNativeObject()));
1268 checkContextMatch(t1);
1269 checkContextMatch(t2);
1270 return new BitVecExpr(
this, Native.mkBvand(nCtx(),
1271 t1.getNativeObject(), t2.getNativeObject()));
1281 checkContextMatch(t1);
1282 checkContextMatch(t2);
1283 return new BitVecExpr(
this, Native.mkBvor(nCtx(), t1.getNativeObject(),
1284 t2.getNativeObject()));
1294 checkContextMatch(t1);
1295 checkContextMatch(t2);
1296 return new BitVecExpr(
this, Native.mkBvxor(nCtx(),
1297 t1.getNativeObject(), t2.getNativeObject()));
1307 checkContextMatch(t1);
1308 checkContextMatch(t2);
1309 return new BitVecExpr(
this, Native.mkBvnand(nCtx(),
1310 t1.getNativeObject(), t2.getNativeObject()));
1320 checkContextMatch(t1);
1321 checkContextMatch(t2);
1322 return new BitVecExpr(
this, Native.mkBvnor(nCtx(),
1323 t1.getNativeObject(), t2.getNativeObject()));
1333 checkContextMatch(t1);
1334 checkContextMatch(t2);
1335 return new BitVecExpr(
this, Native.mkBvxnor(nCtx(),
1336 t1.getNativeObject(), t2.getNativeObject()));
1346 checkContextMatch(t);
1347 return new BitVecExpr(
this, Native.mkBvneg(nCtx(), t.getNativeObject()));
1357 checkContextMatch(t1);
1358 checkContextMatch(t2);
1359 return new BitVecExpr(
this, Native.mkBvadd(nCtx(),
1360 t1.getNativeObject(), t2.getNativeObject()));
1370 checkContextMatch(t1);
1371 checkContextMatch(t2);
1372 return new BitVecExpr(
this, Native.mkBvsub(nCtx(),
1373 t1.getNativeObject(), t2.getNativeObject()));
1383 checkContextMatch(t1);
1384 checkContextMatch(t2);
1385 return new BitVecExpr(
this, Native.mkBvmul(nCtx(),
1386 t1.getNativeObject(), t2.getNativeObject()));
1398 checkContextMatch(t1);
1399 checkContextMatch(t2);
1400 return new BitVecExpr(
this, Native.mkBvudiv(nCtx(),
1401 t1.getNativeObject(), t2.getNativeObject()));
1419 checkContextMatch(t1);
1420 checkContextMatch(t2);
1421 return new BitVecExpr(
this, Native.mkBvsdiv(nCtx(),
1422 t1.getNativeObject(), t2.getNativeObject()));
1434 checkContextMatch(t1);
1435 checkContextMatch(t2);
1436 return new BitVecExpr(
this, Native.mkBvurem(nCtx(),
1437 t1.getNativeObject(), t2.getNativeObject()));
1452 checkContextMatch(t1);
1453 checkContextMatch(t2);
1454 return new BitVecExpr(
this, Native.mkBvsrem(nCtx(),
1455 t1.getNativeObject(), t2.getNativeObject()));
1466 checkContextMatch(t1);
1467 checkContextMatch(t2);
1468 return new BitVecExpr(
this, Native.mkBvsmod(nCtx(),
1469 t1.getNativeObject(), t2.getNativeObject()));
1479 checkContextMatch(t1);
1480 checkContextMatch(t2);
1481 return new BoolExpr(
this, Native.mkBvult(nCtx(), t1.getNativeObject(),
1482 t2.getNativeObject()));
1492 checkContextMatch(t1);
1493 checkContextMatch(t2);
1494 return new BoolExpr(
this, Native.mkBvslt(nCtx(), t1.getNativeObject(),
1495 t2.getNativeObject()));
1505 checkContextMatch(t1);
1506 checkContextMatch(t2);
1507 return new BoolExpr(
this, Native.mkBvule(nCtx(), t1.getNativeObject(),
1508 t2.getNativeObject()));
1518 checkContextMatch(t1);
1519 checkContextMatch(t2);
1520 return new BoolExpr(
this, Native.mkBvsle(nCtx(), t1.getNativeObject(),
1521 t2.getNativeObject()));
1531 checkContextMatch(t1);
1532 checkContextMatch(t2);
1533 return new BoolExpr(
this, Native.mkBvuge(nCtx(), t1.getNativeObject(),
1534 t2.getNativeObject()));
1544 checkContextMatch(t1);
1545 checkContextMatch(t2);
1546 return new BoolExpr(
this, Native.mkBvsge(nCtx(), t1.getNativeObject(),
1547 t2.getNativeObject()));
1557 checkContextMatch(t1);
1558 checkContextMatch(t2);
1559 return new BoolExpr(
this, Native.mkBvugt(nCtx(), t1.getNativeObject(),
1560 t2.getNativeObject()));
1570 checkContextMatch(t1);
1571 checkContextMatch(t2);
1572 return new BoolExpr(
this, Native.mkBvsgt(nCtx(), t1.getNativeObject(),
1573 t2.getNativeObject()));
1588 checkContextMatch(t1);
1589 checkContextMatch(t2);
1590 return new BitVecExpr(
this, Native.mkConcat(nCtx(),
1591 t1.getNativeObject(), t2.getNativeObject()));
1605 checkContextMatch(t);
1606 return new BitVecExpr(
this, Native.mkExtract(nCtx(), high, low,
1607 t.getNativeObject()));
1619 checkContextMatch(t);
1620 return new BitVecExpr(
this, Native.mkSignExt(nCtx(), i,
1621 t.getNativeObject()));
1633 checkContextMatch(t);
1634 return new BitVecExpr(
this, Native.mkZeroExt(nCtx(), i,
1635 t.getNativeObject()));
1645 checkContextMatch(t);
1646 return new BitVecExpr(
this, Native.mkRepeat(nCtx(), i,
1647 t.getNativeObject()));
1663 checkContextMatch(t1);
1664 checkContextMatch(t2);
1665 return new BitVecExpr(
this, Native.mkBvshl(nCtx(),
1666 t1.getNativeObject(), t2.getNativeObject()));
1682 checkContextMatch(t1);
1683 checkContextMatch(t2);
1684 return new BitVecExpr(
this, Native.mkBvlshr(nCtx(),
1685 t1.getNativeObject(), t2.getNativeObject()));
1702 checkContextMatch(t1);
1703 checkContextMatch(t2);
1704 return new BitVecExpr(
this, Native.mkBvashr(nCtx(),
1705 t1.getNativeObject(), t2.getNativeObject()));
1715 checkContextMatch(t);
1716 return new BitVecExpr(
this, Native.mkRotateLeft(nCtx(), i,
1717 t.getNativeObject()));
1727 checkContextMatch(t);
1728 return new BitVecExpr(
this, Native.mkRotateRight(nCtx(), i,
1729 t.getNativeObject()));
1741 checkContextMatch(t1);
1742 checkContextMatch(t2);
1743 return new BitVecExpr(
this, Native.mkExtRotateLeft(nCtx(),
1744 t1.getNativeObject(), t2.getNativeObject()));
1756 checkContextMatch(t1);
1757 checkContextMatch(t2);
1758 return new BitVecExpr(
this, Native.mkExtRotateRight(nCtx(),
1759 t1.getNativeObject(), t2.getNativeObject()));
1773 checkContextMatch(t);
1774 return new BitVecExpr(
this, Native.mkInt2bv(nCtx(), n,
1775 t.getNativeObject()));
1794 checkContextMatch(t);
1795 return new IntExpr(
this, Native.mkBv2int(nCtx(), t.getNativeObject(),
1807 checkContextMatch(t1);
1808 checkContextMatch(t2);
1809 return new BoolExpr(
this, Native.mkBvaddNoOverflow(nCtx(), t1
1810 .getNativeObject(), t2.getNativeObject(), (isSigned)));
1821 checkContextMatch(t1);
1822 checkContextMatch(t2);
1823 return new BoolExpr(
this, Native.mkBvaddNoUnderflow(nCtx(),
1824 t1.getNativeObject(), t2.getNativeObject()));
1835 checkContextMatch(t1);
1836 checkContextMatch(t2);
1837 return new BoolExpr(
this, Native.mkBvsubNoOverflow(nCtx(),
1838 t1.getNativeObject(), t2.getNativeObject()));
1849 checkContextMatch(t1);
1850 checkContextMatch(t2);
1851 return new BoolExpr(
this, Native.mkBvsubNoUnderflow(nCtx(), t1
1852 .getNativeObject(), t2.getNativeObject(), (isSigned)));
1863 checkContextMatch(t1);
1864 checkContextMatch(t2);
1865 return new BoolExpr(
this, Native.mkBvsdivNoOverflow(nCtx(),
1866 t1.getNativeObject(), t2.getNativeObject()));
1876 checkContextMatch(t);
1877 return new BoolExpr(
this, Native.mkBvnegNoOverflow(nCtx(),
1878 t.getNativeObject()));
1889 checkContextMatch(t1);
1890 checkContextMatch(t2);
1891 return new BoolExpr(
this, Native.mkBvmulNoOverflow(nCtx(), t1
1892 .getNativeObject(), t2.getNativeObject(), (isSigned)));
1903 checkContextMatch(t1);
1904 checkContextMatch(t2);
1905 return new BoolExpr(
this, Native.mkBvmulNoUnderflow(nCtx(),
1906 t1.getNativeObject(), t2.getNativeObject()));
1924 return (
ArrayExpr<D, R>) mkConst(mkSymbol(name), mkArraySort(domain, range));
1941 checkContextMatch(a);
1942 checkContextMatch(i);
1945 Native.mkSelect(nCtx(), a.getNativeObject(),
1946 i.getNativeObject()));
1963 checkContextMatch(a);
1964 checkContextMatch(args);
1967 Native.mkSelectN(nCtx(), a.getNativeObject(), args.length,
AST.
arrayToNative(args)));
1988 checkContextMatch(a);
1989 checkContextMatch(i);
1990 checkContextMatch(v);
1991 return new ArrayExpr<>(
this, Native.mkStore(nCtx(), a.getNativeObject(),
1992 i.getNativeObject(), v.getNativeObject()));
2013 checkContextMatch(a);
2014 checkContextMatch(args);
2015 checkContextMatch(v);
2016 return new ArrayExpr<>(
this, Native.mkStoreN(nCtx(), a.getNativeObject(),
2031 checkContextMatch(domain);
2032 checkContextMatch(v);
2033 return new ArrayExpr<>(
this, Native.mkConstArray(nCtx(),
2034 domain.getNativeObject(), v.getNativeObject()));
2053 checkContextMatch(f);
2054 checkContextMatch(args);
2068 checkContextMatch(array);
2070 Native.mkArrayDefault(nCtx(), array.getNativeObject()));
2082 checkContextMatch(f);
2083 return (
ArrayExpr<D, R>)
Expr.create(
this, Native.mkAsArray(nCtx(), f.getNativeObject()));
2091 checkContextMatch(arg1);
2092 checkContextMatch(arg2);
2093 return (
Expr<D>)
Expr.create(
this, Native.mkArrayExt(nCtx(), arg1.getNativeObject(), arg2.getNativeObject()));
2102 checkContextMatch(ty);
2111 checkContextMatch(domain);
2113 Native.mkEmptySet(nCtx(), domain.getNativeObject()));
2121 checkContextMatch(domain);
2123 Native.mkFullSet(nCtx(), domain.getNativeObject()));
2131 checkContextMatch(
set);
2132 checkContextMatch(element);
2134 Native.mkSetAdd(nCtx(),
set.getNativeObject(),
2135 element.getNativeObject()));
2143 checkContextMatch(
set);
2144 checkContextMatch(element);
2146 Native.mkSetDel(nCtx(),
set.getNativeObject(),
2147 element.getNativeObject()));
2156 checkContextMatch(args);
2158 Native.mkSetUnion(nCtx(), args.length,
2168 checkContextMatch(args);
2170 Native.mkSetIntersect(nCtx(), args.length,
2179 checkContextMatch(arg1);
2180 checkContextMatch(arg2);
2182 Native.mkSetDifference(nCtx(), arg1.getNativeObject(),
2183 arg2.getNativeObject()));
2191 checkContextMatch(arg);
2193 Native.mkSetComplement(nCtx(), arg.getNativeObject()));
2201 checkContextMatch(elem);
2202 checkContextMatch(
set);
2204 Native.mkSetMember(nCtx(), elem.getNativeObject(),
2205 set.getNativeObject()));
2213 checkContextMatch(arg1);
2214 checkContextMatch(arg2);
2216 Native.mkSetSubset(nCtx(), arg1.getNativeObject(),
2217 arg2.getNativeObject()));
2230 checkContextMatch(elemSort);
2239 checkContextMatch(s);
2240 return Native.isFiniteSetSort(nCtx(), s.getNativeObject());
2248 checkContextMatch(s);
2249 return Sort.create(
this, Native.getFiniteSetSortBasis(nCtx(), s.getNativeObject()));
2257 checkContextMatch(setSort);
2258 return Expr.create(
this, Native.mkFiniteSetEmpty(nCtx(), setSort.getNativeObject()));
2266 checkContextMatch(elem);
2267 return Expr.create(
this, Native.mkFiniteSetSingleton(nCtx(), elem.getNativeObject()));
2275 checkContextMatch(s1);
2276 checkContextMatch(s2);
2277 return Expr.create(
this, Native.mkFiniteSetUnion(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2285 checkContextMatch(s1);
2286 checkContextMatch(s2);
2287 return Expr.create(
this, Native.mkFiniteSetIntersect(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2295 checkContextMatch(s1);
2296 checkContextMatch(s2);
2297 return Expr.create(
this, Native.mkFiniteSetDifference(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2305 checkContextMatch(elem);
2306 checkContextMatch(
set);
2307 return (
BoolExpr)
Expr.create(
this, Native.mkFiniteSetMember(nCtx(), elem.getNativeObject(),
set.getNativeObject()));
2315 checkContextMatch(
set);
2316 return Expr.create(
this, Native.mkFiniteSetSize(nCtx(),
set.getNativeObject()));
2324 checkContextMatch(s1);
2325 checkContextMatch(s2);
2326 return (
BoolExpr)
Expr.create(
this, Native.mkFiniteSetSubset(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2334 checkContextMatch(f);
2335 checkContextMatch(
set);
2336 return Expr.create(
this, Native.mkFiniteSetMap(nCtx(), f.getNativeObject(),
set.getNativeObject()));
2344 checkContextMatch(f);
2345 checkContextMatch(
set);
2346 return Expr.create(
this, Native.mkFiniteSetFilter(nCtx(), f.getNativeObject(),
set.getNativeObject()));
2354 checkContextMatch(low);
2355 checkContextMatch(high);
2356 return Expr.create(
this, Native.mkFiniteSetRange(nCtx(), low.getNativeObject(), high.getNativeObject()));
2369 checkContextMatch(s);
2370 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqEmpty(nCtx(), s.getNativeObject()));
2378 checkContextMatch(elem);
2379 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqUnit(nCtx(), elem.getNativeObject()));
2387 StringBuilder buf =
new StringBuilder();
2388 for (
int i = 0; i < s.length(); i += Character.charCount(s.codePointAt(i))) {
2389 int code = s.codePointAt(i);
2390 if (code <= 32 || 127 < code)
2391 buf.append(String.format(
"\\u{%x}", code));
2393 buf.append(s.charAt(i));
2427 return (
IntExpr)
Expr.create(
this, Native.mkStrToInt(nCtx(), e.getNativeObject()));
2436 checkContextMatch(t);
2446 checkContextMatch(s);
2447 return (
IntExpr)
Expr.create(
this, Native.mkSeqLength(nCtx(), s.getNativeObject()));
2455 checkContextMatch(s, n);
2456 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqPower(nCtx(), s.getNativeObject(), n.getNativeObject()));
2464 checkContextMatch(s1, s2);
2465 return (
BoolExpr)
Expr.create(
this, Native.mkSeqPrefix(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2473 checkContextMatch(s1, s2);
2474 return (
BoolExpr)
Expr.create(
this, Native.mkSeqSuffix(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2482 checkContextMatch(s1, s2);
2483 return (
BoolExpr)
Expr.create(
this, Native.mkSeqContains(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2492 checkContextMatch(s1, s2);
2493 return new BoolExpr(
this, Native.mkStrLt(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2501 checkContextMatch(s1, s2);
2502 return new BoolExpr(
this, Native.mkStrLe(nCtx(), s1.getNativeObject(), s2.getNativeObject()));
2511 checkContextMatch(s, index);
2512 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqAt(nCtx(), s.getNativeObject(), index.getNativeObject()));
2520 checkContextMatch(s, index);
2521 return (
Expr<R>)
Expr.create(
this, Native.mkSeqNth(nCtx(), s.getNativeObject(), index.getNativeObject()));
2530 checkContextMatch(s, offset, length);
2531 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqExtract(nCtx(), s.getNativeObject(), offset.getNativeObject(), length.getNativeObject()));
2539 checkContextMatch(s, substr, offset);
2540 return (
IntExpr)
Expr.create(
this, Native.mkSeqIndex(nCtx(), s.getNativeObject(), substr.getNativeObject(), offset.getNativeObject()));
2548 checkContextMatch(s, substr);
2549 return (
IntExpr)
Expr.create(
this, Native.mkSeqLastIndex(nCtx(), s.getNativeObject(), substr.getNativeObject()));
2558 checkContextMatch(f, s);
2559 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqMap(nCtx(), f.getNativeObject(), s.getNativeObject()));
2568 checkContextMatch(f, i, s);
2569 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqMapi(nCtx(), f.getNativeObject(), i.getNativeObject(), s.getNativeObject()));
2578 checkContextMatch(f, a, s);
2579 return (
Expr<A>)
Expr.create(
this, Native.mkSeqFoldl(nCtx(), f.getNativeObject(), a.getNativeObject(), s.getNativeObject()));
2588 checkContextMatch(f, i, a, s);
2589 return (
Expr<A>)
Expr.create(
this, Native.mkSeqFoldli(nCtx(), f.getNativeObject(), i.getNativeObject(), a.getNativeObject(), s.getNativeObject()));
2597 checkContextMatch(s, src, dst);
2598 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqReplace(nCtx(), s.getNativeObject(), src.getNativeObject(), dst.getNativeObject()));
2606 checkContextMatch(s, src, dst);
2607 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqReplaceAll(nCtx(), s.getNativeObject(), src.getNativeObject(), dst.getNativeObject()));
2615 checkContextMatch(s, re, dst);
2616 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqReplaceRe(nCtx(), s.getNativeObject(), re.getNativeObject(), dst.getNativeObject()));
2624 checkContextMatch(s, re, dst);
2625 return (
SeqExpr<R>)
Expr.create(
this, Native.mkSeqReplaceReAll(nCtx(), s.getNativeObject(), re.getNativeObject(), dst.getNativeObject()));
2633 checkContextMatch(s);
2643 checkContextMatch(s, re);
2644 return (
BoolExpr)
Expr.create(
this, Native.mkSeqInRe(nCtx(), s.getNativeObject(), re.getNativeObject()));
2652 checkContextMatch(re);
2653 return (
ReExpr<R>)
Expr.create(
this, Native.mkReStar(nCtx(), re.getNativeObject()));
2661 return (
ReExpr<R>)
Expr.create(
this, Native.mkRePower(nCtx(), re.getNativeObject(), n));
2669 return (
ReExpr<R>)
Expr.create(
this, Native.mkReLoop(nCtx(), re.getNativeObject(), lo, hi));
2677 return (
ReExpr<R>)
Expr.create(
this, Native.mkReLoop(nCtx(), re.getNativeObject(), lo, 0));
2686 checkContextMatch(re);
2687 return (
ReExpr<R>)
Expr.create(
this, Native.mkRePlus(nCtx(), re.getNativeObject()));
2695 checkContextMatch(re);
2696 return (
ReExpr<R>)
Expr.create(
this, Native.mkReOption(nCtx(), re.getNativeObject()));
2704 checkContextMatch(re);
2705 return (
ReExpr<R>)
Expr.create(
this, Native.mkReComplement(nCtx(), re.getNativeObject()));
2714 checkContextMatch(t);
2724 checkContextMatch(t);
2734 checkContextMatch(t);
2743 checkContextMatch(a, b);
2744 return (
ReExpr<R>)
Expr.create(
this, Native.mkReDiff(nCtx(), a.getNativeObject(), b.getNativeObject()));
2754 return (
ReExpr<R>)
Expr.create(
this, Native.mkReEmpty(nCtx(), s.getNativeObject()));
2763 return (
ReExpr<R>)
Expr.create(
this, Native.mkReFull(nCtx(), s.getNativeObject()));
2773 return (
ReExpr<R>)
Expr.create(
this, Native.mkReAllchar(nCtx(), s.getNativeObject()));
2781 checkContextMatch(lo, hi);
2790 checkContextMatch(ch1, ch2);
2791 return (
BoolExpr)
Expr.create(
this, Native.mkCharLe(nCtx(), ch1.getNativeObject(), ch2.getNativeObject()));
2799 checkContextMatch(ch);
2800 return (
IntExpr)
Expr.create(
this, Native.mkCharToInt(nCtx(), ch.getNativeObject()));
2808 checkContextMatch(ch);
2809 return (
BitVecExpr)
Expr.create(
this, Native.mkCharToBv(nCtx(), ch.getNativeObject()));
2817 checkContextMatch(bv);
2818 return (
Expr<CharSort>)
Expr.create(
this, Native.mkCharFromBv(nCtx(), bv.getNativeObject()));
2826 checkContextMatch(ch);
2827 return (
BoolExpr)
Expr.create(
this, Native.mkCharIsDigit(nCtx(), ch.getNativeObject()));
2835 checkContextMatch(args);
2844 checkContextMatch(args);
2853 checkContextMatch(args);
2862 checkContextMatch(args);
2871 checkContextMatch(args);
2888 checkContextMatch(ty);
2890 Native.mkNumeral(nCtx(), v, ty.getNativeObject()));
2905 checkContextMatch(ty);
2906 return (
Expr<R>)
Expr.create(
this, Native.mkInt(nCtx(), v, ty.getNativeObject()));
2921 checkContextMatch(ty);
2923 Native.mkInt64(nCtx(), v, ty.getNativeObject()));
2941 return new RatNum(
this, Native.mkReal(nCtx(), num, den));
2953 return new RatNum(
this, Native.mkNumeral(nCtx(), v, getRealSort()
2954 .getNativeObject()));
2966 return new RatNum(
this, Native.mkInt(nCtx(), v, getRealSort()
2967 .getNativeObject()));
2979 return new RatNum(
this, Native.mkInt64(nCtx(), v, getRealSort()
2980 .getNativeObject()));
2990 return new IntNum(
this, Native.mkNumeral(nCtx(), v, getIntSort()
2991 .getNativeObject()));
3003 return new IntNum(
this, Native.mkInt(nCtx(), v, getIntSort()
3004 .getNativeObject()));
3016 return new IntNum(
this, Native.mkInt64(nCtx(), v, getIntSort()
3017 .getNativeObject()));
3027 return (
BitVecNum) mkNumeral(v, mkBitVecSort(size));
3037 return (
BitVecNum) mkNumeral(v, mkBitVecSort(size));
3047 return (
BitVecNum) mkNumeral(v, mkBitVecSort(size));
3079 return Quantifier.
of(
this,
true, sorts, names, body, weight, patterns,
3080 noPatterns, quantifierID, skolemID);
3092 return Quantifier.
of(
this,
true, boundConstants, body, weight,
3093 patterns, noPatterns, quantifierID, skolemID);
3105 return Quantifier.
of(
this,
false, sorts, names, body, weight,
3106 patterns, noPatterns, quantifierID, skolemID);
3118 return Quantifier.
of(
this,
false, boundConstants, body, weight,
3119 patterns, noPatterns, quantifierID, skolemID);
3133 return mkForall(sorts, names, body, weight, patterns, noPatterns,
3134 quantifierID, skolemID);
3136 return mkExists(sorts, names, body, weight, patterns, noPatterns,
3137 quantifierID, skolemID);
3150 return mkForall(boundConstants, body, weight, patterns, noPatterns,
3151 quantifierID, skolemID);
3153 return mkExists(boundConstants, body, weight, patterns, noPatterns,
3154 quantifierID, skolemID);
3176 return Lambda.
of(
this, sorts, names, body);
3187 return Lambda.
of(
this, boundConstants, body);
3207 Native.setAstPrintMode(nCtx(), value.toInt());
3228 return Native.benchmarkToSmtlibString(nCtx(), name, logic, status,
3229 attributes, assumptions.length,
3249 if (csn != cs || cdn != cd) {
3270 if (csn != cs || cdn != cd)
3290 public Goal mkGoal(
boolean models,
boolean unsatCores,
boolean proofs)
3292 return new Goal(
this, models, unsatCores, proofs);
3308 return Native.getNumTactics(nCtx());
3317 int n = getNumTactics();
3318 String[] res =
new String[n];
3319 for (
int i = 0; i < n; i++)
3320 res[i] = Native.getTacticName(nCtx(), i);
3330 return Native.tacticGetDescr(nCtx(), name);
3338 return new Tactic(
this, name);
3348 checkContextMatch(t1);
3349 checkContextMatch(t2);
3350 checkContextMatch(ts);
3353 if (ts !=
null && ts.length > 0)
3355 last = ts[ts.length - 1].getNativeObject();
3356 for (
int i = ts.length - 2; i >= 0; i--) {
3357 last = Native.tacticAndThen(nCtx(), ts[i].getNativeObject(),
3363 last = Native.tacticAndThen(nCtx(), t2.getNativeObject(), last);
3364 return new Tactic(
this, Native.tacticAndThen(nCtx(),
3365 t1.getNativeObject(), last));
3367 return new Tactic(
this, Native.tacticAndThen(nCtx(),
3368 t1.getNativeObject(), t2.getNativeObject()));
3379 return andThen(t1, t2, ts);
3389 checkContextMatch(t1);
3390 checkContextMatch(t2);
3391 return new Tactic(
this, Native.tacticOrElse(nCtx(),
3392 t1.getNativeObject(), t2.getNativeObject()));
3403 checkContextMatch(t);
3404 return new Tactic(
this, Native.tacticTryFor(nCtx(),
3405 t.getNativeObject(), ms));
3416 checkContextMatch(t);
3417 checkContextMatch(p);
3418 return new Tactic(
this, Native.tacticWhen(nCtx(), p.getNativeObject(),
3419 t.getNativeObject()));
3429 checkContextMatch(p);
3430 checkContextMatch(t1);
3431 checkContextMatch(t2);
3432 return new Tactic(
this, Native.tacticCond(nCtx(), p.getNativeObject(),
3433 t1.getNativeObject(), t2.getNativeObject()));
3442 checkContextMatch(t);
3443 return new Tactic(
this, Native.tacticRepeat(nCtx(),
3444 t.getNativeObject(), max));
3452 return new Tactic(
this, Native.tacticSkip(nCtx()));
3460 return new Tactic(
this, Native.tacticFail(nCtx()));
3469 checkContextMatch(p);
3471 Native.tacticFailIf(nCtx(), p.getNativeObject()));
3480 return new Tactic(
this, Native.tacticFailIfNotDecided(nCtx()));
3489 checkContextMatch(t);
3490 checkContextMatch(p);
3491 return new Tactic(
this, Native.tacticUsingParams(nCtx(),
3492 t.getNativeObject(), p.getNativeObject()));
3503 return usingParams(t, p);
3511 checkContextMatch(t);
3512 return new Tactic(
this, Native.tacticParOr(nCtx(),
3522 checkContextMatch(t1);
3523 checkContextMatch(t2);
3524 return new Tactic(
this, Native.tacticParAndThen(nCtx(),
3525 t1.getNativeObject(), t2.getNativeObject()));
3535 Native.interrupt(nCtx());
3552 checkContextMatch(vars);
3553 checkContextMatch(body);
3554 return Expr.create(
this, Native.qeLite(nCtx(), vars.getNativeObject(),
3555 body.getNativeObject()));
3563 checkContextMatch(model);
3564 checkContextMatch(bounds);
3565 checkContextMatch(body);
3566 return Expr.create(
this, Native.qeModelProject(nCtx(), model.getNativeObject(),
3576 checkContextMatch(model);
3577 checkContextMatch(bounds);
3578 checkContextMatch(body);
3579 checkContextMatch(map);
3580 return Expr.create(
this, Native.qeModelProjectSkolem(nCtx(),
3582 body.getNativeObject(), map.getNativeObject()));
3591 checkContextMatch(model);
3592 checkContextMatch(bounds);
3593 checkContextMatch(body);
3594 checkContextMatch(map);
3595 return Expr.create(
this, Native.qeModelProjectWithWitness(nCtx(),
3597 body.getNativeObject(), map.getNativeObject()));
3605 return Native.getNumSimplifiers(nCtx());
3614 int n = getNumSimplifiers();
3615 String[] res =
new String[n];
3616 for (
int i = 0; i < n; i++)
3617 res[i] = Native.getSimplifierName(nCtx(), i);
3627 return Native.simplifierGetDescr(nCtx(), name);
3644 checkContextMatch(t1);
3645 checkContextMatch(t2);
3646 checkContextMatch(ts);
3649 if (ts !=
null && ts.length > 0)
3651 last = ts[ts.length - 1].getNativeObject();
3652 for (
int i = ts.length - 2; i >= 0; i--) {
3653 last = Native.simplifierAndThen(nCtx(), ts[i].getNativeObject(),
3659 last = Native.simplifierAndThen(nCtx(), t2.getNativeObject(), last);
3660 return new Simplifier(
this, Native.simplifierAndThen(nCtx(),
3661 t1.getNativeObject(), last));
3663 return new Simplifier(
this, Native.simplifierAndThen(nCtx(),
3664 t1.getNativeObject(), t2.getNativeObject()));
3674 return andThen(t1, t2, ts);
3683 checkContextMatch(t);
3684 checkContextMatch(p);
3685 return new Simplifier(
this, Native.simplifierUsingParams(nCtx(),
3686 t.getNativeObject(), p.getNativeObject()));
3697 return usingParams(t, p);
3705 return Native.getNumProbes(nCtx());
3714 int n = getNumProbes();
3715 String[] res =
new String[n];
3716 for (
int i = 0; i < n; i++)
3717 res[i] = Native.getProbeName(nCtx(), i);
3727 return Native.probeGetDescr(nCtx(), name);
3735 return new Probe(
this, name);
3743 return new Probe(
this, Native.probeConst(nCtx(), val));
3752 checkContextMatch(p1);
3753 checkContextMatch(p2);
3754 return new Probe(
this, Native.probeLt(nCtx(), p1.getNativeObject(),
3755 p2.getNativeObject()));
3764 checkContextMatch(p1);
3765 checkContextMatch(p2);
3766 return new Probe(
this, Native.probeGt(nCtx(), p1.getNativeObject(),
3767 p2.getNativeObject()));
3777 checkContextMatch(p1);
3778 checkContextMatch(p2);
3779 return new Probe(
this, Native.probeLe(nCtx(), p1.getNativeObject(),
3780 p2.getNativeObject()));
3790 checkContextMatch(p1);
3791 checkContextMatch(p2);
3792 return new Probe(
this, Native.probeGe(nCtx(), p1.getNativeObject(),
3793 p2.getNativeObject()));
3802 checkContextMatch(p1);
3803 checkContextMatch(p2);
3804 return new Probe(
this, Native.probeEq(nCtx(), p1.getNativeObject(),
3805 p2.getNativeObject()));
3813 checkContextMatch(p1);
3814 checkContextMatch(p2);
3815 return new Probe(
this, Native.probeAnd(nCtx(), p1.getNativeObject(),
3816 p2.getNativeObject()));
3824 checkContextMatch(p1);
3825 checkContextMatch(p2);
3826 return new Probe(
this, Native.probeOr(nCtx(), p1.getNativeObject(),
3827 p2.getNativeObject()));
3835 checkContextMatch(p);
3836 return new Probe(
this, Native.probeNot(nCtx(), p.getNativeObject()));
3848 return mkSolver((
Symbol)
null);
3862 return new Solver(
this, Native.mkSolver(nCtx()));
3864 return new Solver(
this, Native.mkSolverForLogic(nCtx(),
3865 logic.getNativeObject()));
3874 return mkSolver(mkSymbol(logic));
3882 return new Solver(
this, Native.mkSimpleSolver(nCtx()));
3894 return new Solver(
this, Native.mkSolverFromTactic(nCtx(),
3895 t.getNativeObject()));
3903 return new Solver(
this, Native.solverAddSimplifier(nCtx(), s.getNativeObject(), simp.getNativeObject()));
3938 return new FPRMExpr(
this, Native.mkFpaRoundNearestTiesToEven(nCtx()));
3947 return new FPRMNum(
this, Native.mkFpaRne(nCtx()));
3956 return new FPRMNum(
this, Native.mkFpaRoundNearestTiesToAway(nCtx()));
3965 return new FPRMNum(
this, Native.mkFpaRna(nCtx()));
3974 return new FPRMNum(
this, Native.mkFpaRoundTowardPositive(nCtx()));
3983 return new FPRMNum(
this, Native.mkFpaRtp(nCtx()));
3992 return new FPRMNum(
this, Native.mkFpaRoundTowardNegative(nCtx()));
4001 return new FPRMNum(
this, Native.mkFpaRtn(nCtx()));
4010 return new FPRMNum(
this, Native.mkFpaRoundTowardZero(nCtx()));
4019 return new FPRMNum(
this, Native.mkFpaRtz(nCtx()));
4030 return new FPSort(
this, ebits, sbits);
4039 return new FPSort(
this, Native.mkFpaSortHalf(nCtx()));
4048 return new FPSort(
this, Native.mkFpaSort16(nCtx()));
4057 return new FPSort(
this, Native.mkFpaSortSingle(nCtx()));
4066 return new FPSort(
this, Native.mkFpaSort32(nCtx()));
4075 return new FPSort(
this, Native.mkFpaSortDouble(nCtx()));
4084 return new FPSort(
this, Native.mkFpaSort64(nCtx()));
4093 return new FPSort(
this, Native.mkFpaSortQuadruple(nCtx()));
4102 return new FPSort(
this, Native.mkFpaSort128(nCtx()));
4113 return new FPNum(
this, Native.mkFpaNan(nCtx(), s.getNativeObject()));
4124 return new FPNum(
this, Native.mkFpaInf(nCtx(), s.getNativeObject(), negative));
4135 return new FPNum(
this, Native.mkFpaZero(nCtx(), s.getNativeObject(), negative));
4146 return new FPNum(
this, Native.mkFpaNumeralFloat(nCtx(), v, s.getNativeObject()));
4157 return new FPNum(
this, Native.mkFpaNumeralDouble(nCtx(), v, s.getNativeObject()));
4168 return new FPNum(
this, Native.mkFpaNumeralInt(nCtx(), v, s.getNativeObject()));
4181 return new FPNum(
this, Native.mkFpaNumeralIntUint(nCtx(), sgn, exp, sig, s.getNativeObject()));
4194 return new FPNum(
this, Native.mkFpaNumeralInt64Uint64(nCtx(), sgn, exp, sig, s.getNativeObject()));
4205 return mkFPNumeral(v, s);
4216 return mkFPNumeral(v, s);
4228 return mkFPNumeral(v, s);
4241 return mkFPNumeral(sgn, exp, sig, s);
4254 return mkFPNumeral(sgn, exp, sig, s);
4265 return new FPExpr(
this, Native.mkFpaAbs(nCtx(), t.getNativeObject()));
4275 return new FPExpr(
this, Native.mkFpaNeg(nCtx(), t.getNativeObject()));
4287 return new FPExpr(
this, Native.mkFpaAdd(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
4299 return new FPExpr(
this, Native.mkFpaSub(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
4311 return new FPExpr(
this, Native.mkFpaMul(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
4323 return new FPExpr(
this, Native.mkFpaDiv(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject()));
4338 return new FPExpr(
this, Native.mkFpaFma(nCtx(), rm.getNativeObject(), t1.getNativeObject(), t2.getNativeObject(), t3.getNativeObject()));
4349 return new FPExpr(
this, Native.mkFpaSqrt(nCtx(), rm.getNativeObject(), t.getNativeObject()));
4360 return new FPExpr(
this, Native.mkFpaRem(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4372 return new FPExpr(
this, Native.mkFpaRoundToIntegral(nCtx(), rm.getNativeObject(), t.getNativeObject()));
4383 return new FPExpr(
this, Native.mkFpaMin(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4394 return new FPExpr(
this, Native.mkFpaMax(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4405 return new BoolExpr(
this, Native.mkFpaLeq(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4416 return new BoolExpr(
this, Native.mkFpaLt(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4427 return new BoolExpr(
this, Native.mkFpaGeq(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4438 return new BoolExpr(
this, Native.mkFpaGt(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4451 return new BoolExpr(
this, Native.mkFpaEq(nCtx(), t1.getNativeObject(), t2.getNativeObject()));
4461 return new BoolExpr(
this, Native.mkFpaIsNormal(nCtx(), t.getNativeObject()));
4471 return new BoolExpr(
this, Native.mkFpaIsSubnormal(nCtx(), t.getNativeObject()));
4481 return new BoolExpr(
this, Native.mkFpaIsZero(nCtx(), t.getNativeObject()));
4491 return new BoolExpr(
this, Native.mkFpaIsInfinite(nCtx(), t.getNativeObject()));
4501 return new BoolExpr(
this, Native.mkFpaIsNan(nCtx(), t.getNativeObject()));
4511 return new BoolExpr(
this, Native.mkFpaIsNegative(nCtx(), t.getNativeObject()));
4521 return new BoolExpr(
this, Native.mkFpaIsPositive(nCtx(), t.getNativeObject()));
4539 return new FPExpr(
this, Native.mkFpaFp(nCtx(), sgn.getNativeObject(), sig.getNativeObject(), exp.getNativeObject()));
4555 return new FPExpr(
this, Native.mkFpaToFpBv(nCtx(), bv.getNativeObject(), s.getNativeObject()));
4571 return new FPExpr(
this, Native.mkFpaToFpFloat(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
4587 return new FPExpr(
this, Native.mkFpaToFpReal(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
4606 return new FPExpr(
this, Native.mkFpaToFpSigned(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
4608 return new FPExpr(
this, Native.mkFpaToFpUnsigned(nCtx(), rm.getNativeObject(), t.getNativeObject(), s.getNativeObject()));
4623 return new FPExpr(
this, Native.mkFpaToFpFloat(nCtx(), s.getNativeObject(), rm.getNativeObject(), t.getNativeObject()));
4641 return new BitVecExpr(
this, Native.mkFpaToSbv(nCtx(), rm.getNativeObject(), t.getNativeObject(), sz));
4643 return new BitVecExpr(
this, Native.mkFpaToUbv(nCtx(), rm.getNativeObject(), t.getNativeObject(), sz));
4657 return new RealExpr(
this, Native.mkFpaToReal(nCtx(), t.getNativeObject()));
4672 return new BitVecExpr(
this, Native.mkFpaToIeeeBv(nCtx(), t.getNativeObject()));
4690 return new BitVecExpr(
this, Native.mkFpaToFpIntReal(nCtx(), rm.getNativeObject(), exp.getNativeObject(), sig.getNativeObject(), s.getNativeObject()));
4701 Native.mkLinearOrder(
4703 sort.getNativeObject(),
4717 Native.mkPartialOrder(
4719 sort.getNativeObject(),
4733 Native.mkTransitiveClosure(
4748 Native.mkPiecewiseLinearOrder(
4750 sort.getNativeObject(),
4766 sort.getNativeObject(),
4782 Native.polynomialSubresultants(
4784 p.getNativeObject(),
4785 q.getNativeObject(),
4803 return AST.create(
this, nativeObject);
4820 return a.getNativeObject();
4829 return Native.simplifyGetHelp(nCtx());
4837 return new ParamDescrs(
this, Native.simplifyGetParamDescrs(nCtx()));
4850 Native.updateParamValue(nCtx(),
id, value);
4862 void checkContextMatch(
Z3Object other)
4864 if (
this != other.getContext())
4868 void checkContextMatch(Z3Object other1, Z3Object other2)
4870 checkContextMatch(other1);
4871 checkContextMatch(other2);
4874 void checkContextMatch(Z3Object other1, Z3Object other2, Z3Object other3)
4876 checkContextMatch(other1);
4877 checkContextMatch(other2);
4878 checkContextMatch(other3);
4881 void checkContextMatch(Z3Object other1, Z3Object other2, Z3Object other3, Z3Object other4)
4883 checkContextMatch(other1);
4884 checkContextMatch(other2);
4885 checkContextMatch(other3);
4886 checkContextMatch(other4);
4889 void checkContextMatch(Z3Object[] arr)
4892 for (Z3Object a : arr)
4893 checkContextMatch(a);
4896 private Z3ReferenceQueue m_RefQueue =
new Z3ReferenceQueue(
this);
4898 Z3ReferenceQueue getReferenceQueue() {
return m_RefQueue; }
4909 m_RefQueue.forceClear();
4914 m_complexSort =
null;
4915 m_stringSort =
null;
4918 synchronized (creation_lock) {
4919 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()
final Expr mkFiniteSetFilter(Expr f, Expr set)
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)
final< R extends Sort, A extends Sort > Expr< A > mkSeqFoldl(Expr<?> f, Expr< A > a, Expr< SeqSort< R > > s)
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)
ComplexExpr mkComplexConst(Symbol name)
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)
Expr<?> qeLite(ASTVector vars, Expr<?> body)
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)
ComplexExpr mkComplex(Expr<? extends ArithSort > real, Expr<? extends ArithSort > imag)
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)
TypeVarSort mkTypeVariable(String name)
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 > SeqExpr< R > mkSeqMap(Expr<?> f, Expr< SeqSort< R > > 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)
ComplexSort getComplexSort()
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)
final< R extends Sort > SeqExpr< R > mkSeqPower(Expr< SeqSort< R > > s, Expr< IntSort > n)
Simplifier andThen(Simplifier t1, Simplifier t2, Simplifier... ts)
SeqExpr< CharSort > ubvToString(Expr< BitVecSort > e)
final< R extends Sort > ASTVector polynomialSubresultants(Expr< R > p, Expr< R > q, Expr< R > x)
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)
final< R extends Sort > FuncDecl< BoolSort > mkPiecewiseLinearOrder(R sort, int index)
FPNum mkFPNumeral(float v, FPSort s)
Expr<?> qeModelProjectWithWitness(Model model, Expr<?>[] bounds, Expr<?> body, ASTMap map)
Tactic when(Probe p, Tactic t)
final Expr mkFiniteSetRange(Expr low, Expr high)
final< R extends Sort > ReExpr< R > mkPlus(Expr< ReSort< R > > re)
ComplexSort mkComplexSort()
Probe mkProbe(String name)
BoolExpr mkPBLe(int[] coeffs, Expr< BoolSort >[] args, int k)
RealExpr mkRealConst(String name)
final< R extends Sort > SeqExpr< R > mkSeqMapi(Expr<?> f, Expr< IntSort > i, Expr< SeqSort< R > > s)
final< R extends Sort > IntExpr mkLength(Expr< SeqSort< R > > s)
final< R extends Sort, A extends Sort > Expr< A > mkSeqFoldli(Expr<?> f, Expr< IntSort > i, Expr< A > a, Expr< SeqSort< R > > s)
final< R extends ArithSort > ArithExpr< R > mkAdd(Expr<? extends R >... t)
Tactic failIfNotDecided()
ParamDescrs getSimplifyParameterDescriptions()
final BoolExpr mkFiniteSetMember(Expr elem, Expr set)
BitVecExpr mkBVRotateRight(Expr< BitVecSort > t1, Expr< BitVecSort > t2)
final< D extends Sort > ArrayExpr< D, BoolSort > mkFullSet(D domain)
SeqExpr< CharSort > sbvToString(Expr< BitVecSort > e)
RealExpr mkRealPart(Expr< ComplexSort > value)
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 Expr mkFiniteSetDifference(Expr s1, Expr s2)
final< R extends Sort > ArraySort< Sort, R > mkArraySort(Sort[] domains, R range)
final Expr mkFiniteSetMap(Expr f, Expr set)
FPRMNum mkFPRoundNearestTiesToAway()
BoolExpr mkIsDigit(Expr< CharSort > ch)
BoolExpr mkBool(boolean value)
RealExpr mkImagPart(Expr< ComplexSort > 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)
Expr<?> qeModelProject(Model model, Expr<?>[] bounds, Expr<?> body)
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 Expr mkFiniteSetEmpty(Sort setSort)
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)
final Expr mkFiniteSetUnion(Expr s1, Expr s2)
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)
Expr<?> qeModelProjectSkolem(Model model, Expr<?>[] bounds, Expr<?> body, ASTMap map)
BoolExpr mkGt(Expr<? extends ArithSort > t1, Expr<? extends ArithSort > t2)
final Sort getFiniteSetSortBasis(Sort s)
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)
final Expr mkFiniteSetSingleton(Expr elem)
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)
final< R extends Sort > FuncDecl< BoolSort > mkTreeOrder(R sort, int index)
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)
final Expr mkFiniteSetIntersect(Expr s1, Expr 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)
BoolExpr mkDivides(Expr< IntSort > t1, Expr< IntSort > t2)
final< R extends Sort > FuncDecl< BoolSort > mkTransitiveClosure(FuncDecl< BoolSort > f)
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 boolean isFiniteSetSort(Sort s)
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 BoolExpr mkFiniteSetSubset(Expr s1, Expr s2)
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 FiniteSetSort mkFiniteSetSort(Sort elemSort)
final< R extends ArithSort > ArithExpr< R > mkUnaryMinus(Expr< R > t)
final Expr mkFiniteSetSize(Expr set)
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)
final< D extends Sort, R extends Sort > ArrayExpr< D, R > mkAsArray(FuncDecl< R > f)
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)
ComplexExpr mkComplexConst(String name)
final< R extends Sort > FuncDecl< R > mkPropagateFunction(Symbol name, Sort[] domain, R range)
TypeVarSort mkTypeVariable(Symbol name)
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).