diff options
Diffstat (limited to 'rba.tool.core/lib32/z3')
33 files changed, 24518 insertions, 0 deletions
diff --git a/rba.tool.core/lib32/z3/LICENSE.txt b/rba.tool.core/lib32/z3/LICENSE.txt new file mode 100644 index 0000000..cc90bed --- /dev/null +++ b/rba.tool.core/lib32/z3/LICENSE.txt @@ -0,0 +1,10 @@ +Z3 +Copyright (c) Microsoft Corporation +All rights reserved. +MIT License + +Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED *AS IS*, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file diff --git a/rba.tool.core/lib32/z3/Microsoft.Z3.dll b/rba.tool.core/lib32/z3/Microsoft.Z3.dll Binary files differnew file mode 100644 index 0000000..f1bfef9 --- /dev/null +++ b/rba.tool.core/lib32/z3/Microsoft.Z3.dll diff --git a/rba.tool.core/lib32/z3/Microsoft.Z3.xml b/rba.tool.core/lib32/z3/Microsoft.Z3.xml new file mode 100644 index 0000000..1120891 --- /dev/null +++ b/rba.tool.core/lib32/z3/Microsoft.Z3.xml @@ -0,0 +1,6921 @@ +<?xml version="1.0"?> +<doc> + <assembly> + <name>Microsoft.Z3</name> + </assembly> + <members> + <member name="T:Microsoft.Z3.AlgebraicNum"> + <summary> + Algebraic numbers + </summary> + </member> + <member name="T:Microsoft.Z3.ArithExpr"> + <summary> + Arithmetic expressions (int/real) + </summary> + </member> + <member name="T:Microsoft.Z3.Expr"> + <summary> + Expressions are terms. + </summary> + </member> + <member name="T:Microsoft.Z3.AST"> + <summary> + The abstract syntax tree (AST) class. + </summary> + </member> + <member name="T:Microsoft.Z3.Z3Object"> + <summary> + Internal base class for interfacing with native Z3 objects. + Should not be used externally. + </summary> + </member> + <member name="M:Microsoft.Z3.Z3Object.Finalize"> + <summary> + Finalizer. + </summary> + </member> + <member name="M:Microsoft.Z3.Z3Object.Dispose"> + <summary> + Disposes of the underlying native Z3 object. + </summary> + </member> + <member name="M:Microsoft.Z3.AST.op_Equality(Microsoft.Z3.AST,Microsoft.Z3.AST)"> + <summary> + Comparison operator. + </summary> + <param name="a">An AST</param> + <param name="b">An AST</param> + <returns>True if <paramref name="a"/> and <paramref name="b"/> are from the same context + and represent the same sort; false otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.AST.op_Inequality(Microsoft.Z3.AST,Microsoft.Z3.AST)"> + <summary> + Comparison operator. + </summary> + <param name="a">An AST</param> + <param name="b">An AST</param> + <returns>True if <paramref name="a"/> and <paramref name="b"/> are not from the same context + or represent different sorts; false otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.AST.Equals(System.Object)"> + <summary> + Object comparison. + </summary> + </member> + <member name="M:Microsoft.Z3.AST.CompareTo(System.Object)"> + <summary> + Object Comparison. + </summary> + <param name="other">Another AST</param> + <returns>Negative if the object should be sorted before <paramref name="other"/>, positive if after else zero.</returns> + </member> + <member name="M:Microsoft.Z3.AST.GetHashCode"> + <summary> + The AST's hash code. + </summary> + <returns>A hash code</returns> + </member> + <member name="M:Microsoft.Z3.AST.Translate(Microsoft.Z3.Context)"> + <summary> + Translates (copies) the AST to the Context <paramref name="ctx"/>. + </summary> + <param name="ctx">A context</param> + <returns>A copy of the AST which is associated with <paramref name="ctx"/></returns> + </member> + <member name="M:Microsoft.Z3.AST.ToString"> + <summary> + A string representation of the AST. + </summary> + </member> + <member name="M:Microsoft.Z3.AST.SExpr"> + <summary> + A string representation of the AST in s-expression notation. + </summary> + </member> + <member name="P:Microsoft.Z3.AST.Id"> + <summary> + A unique identifier for the AST (unique among all ASTs). + </summary> + </member> + <member name="P:Microsoft.Z3.AST.ASTKind"> + <summary> + The kind of the AST. + </summary> + </member> + <member name="P:Microsoft.Z3.AST.IsExpr"> + <summary> + Indicates whether the AST is an Expr + </summary> + </member> + <member name="P:Microsoft.Z3.AST.IsApp"> + <summary> + Indicates whether the AST is an application + </summary> + </member> + <member name="P:Microsoft.Z3.AST.IsVar"> + <summary> + Indicates whether the AST is a BoundVariable + </summary> + </member> + <member name="P:Microsoft.Z3.AST.IsQuantifier"> + <summary> + Indicates whether the AST is a Quantifier + </summary> + </member> + <member name="P:Microsoft.Z3.AST.IsSort"> + <summary> + Indicates whether the AST is a Sort + </summary> + </member> + <member name="P:Microsoft.Z3.AST.IsFuncDecl"> + <summary> + Indicates whether the AST is a FunctionDeclaration + </summary> + </member> + <member name="T:Microsoft.Z3.IDecRefQueue"> + <summary> + DecRefQueue interface + </summary> + </member> + <member name="M:Microsoft.Z3.IDecRefQueue.SetLimit(System.UInt32)"> + <summary> + Sets the limit on numbers of objects that are kept back at GC collection. + </summary> + <param name="l"></param> + </member> + <member name="M:Microsoft.Z3.Expr.Simplify(Microsoft.Z3.Params)"> + <summary> + Returns a simplified version of the expression. + </summary> + <param name="p">A set of parameters to configure the simplifier</param> + <seealso cref="M:Microsoft.Z3.Context.SimplifyHelp"/> + </member> + <member name="M:Microsoft.Z3.Expr.Update(Microsoft.Z3.Expr[])"> + <summary> + Update the arguments of the expression using the arguments <paramref name="args"/> + The number of new arguments should coincide with the current number of arguments. + </summary> + </member> + <member name="M:Microsoft.Z3.Expr.Substitute(Microsoft.Z3.Expr[],Microsoft.Z3.Expr[])"> + <summary> + Substitute every occurrence of <c>from[i]</c> in the expression with <c>to[i]</c>, for <c>i</c> smaller than <c>num_exprs</c>. + </summary> + <remarks> + The result is the new expression. The arrays <c>from</c> and <c>to</c> must have size <c>num_exprs</c>. + For every <c>i</c> smaller than <c>num_exprs</c>, we must have that + sort of <c>from[i]</c> must be equal to sort of <c>to[i]</c>. + </remarks> + </member> + <member name="M:Microsoft.Z3.Expr.Substitute(Microsoft.Z3.Expr,Microsoft.Z3.Expr)"> + <summary> + Substitute every occurrence of <c>from</c> in the expression with <c>to</c>. + </summary> + <seealso cref="M:Microsoft.Z3.Expr.Substitute(Microsoft.Z3.Expr[],Microsoft.Z3.Expr[])"/> + </member> + <member name="M:Microsoft.Z3.Expr.SubstituteVars(Microsoft.Z3.Expr[])"> + <summary> + Substitute the free variables in the expression with the expressions in <paramref name="to"/> + </summary> + <remarks> + For every <c>i</c> smaller than <c>num_exprs</c>, the variable with de-Bruijn index <c>i</c> is replaced with term <c>to[i]</c>. + </remarks> + </member> + <member name="M:Microsoft.Z3.Expr.Translate(Microsoft.Z3.Context)"> + <summary> + Translates (copies) the term to the Context <paramref name="ctx"/>. + </summary> + <param name="ctx">A context</param> + <returns>A copy of the term which is associated with <paramref name="ctx"/></returns> + </member> + <member name="M:Microsoft.Z3.Expr.ToString"> + <summary> + Returns a string representation of the expression. + </summary> + </member> + <member name="M:Microsoft.Z3.Expr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> + Constructor for Expr + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.FuncDecl"> + <summary> + The function declaration of the function that is applied in this expression. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.BoolValue"> + <summary> + Indicates whether the expression is the true or false expression + or something else (Z3_L_UNDEF). + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.NumArgs"> + <summary> + The number of arguments of the expression. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.Args"> + <summary> + The arguments of the expression. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsNumeral"> + <summary> + Indicates whether the term is a numeral + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsWellSorted"> + <summary> + Indicates whether the term is well-sorted. + </summary> + <returns>True if the term is well-sorted, false otherwise.</returns> + </member> + <member name="P:Microsoft.Z3.Expr.Sort"> + <summary> + The Sort of the term. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsConst"> + <summary> + Indicates whether the term represents a constant. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsIntNum"> + <summary> + Indicates whether the term is an integer numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsRatNum"> + <summary> + Indicates whether the term is a real numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsAlgebraicNumber"> + <summary> + Indicates whether the term is an algebraic number + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBool"> + <summary> + Indicates whether the term has Boolean sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsTrue"> + <summary> + Indicates whether the term is the constant true. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFalse"> + <summary> + Indicates whether the term is the constant false. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsEq"> + <summary> + Indicates whether the term is an equality predicate. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsDistinct"> + <summary> + Indicates whether the term is an n-ary distinct predicate (every argument is mutually distinct). + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsITE"> + <summary> + Indicates whether the term is a ternary if-then-else term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsAnd"> + <summary> + Indicates whether the term is an n-ary conjunction + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsOr"> + <summary> + Indicates whether the term is an n-ary disjunction + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsIff"> + <summary> + Indicates whether the term is an if-and-only-if (Boolean equivalence, binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsXor"> + <summary> + Indicates whether the term is an exclusive or + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsNot"> + <summary> + Indicates whether the term is a negation + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsImplies"> + <summary> + Indicates whether the term is an implication + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsInterpolant"> + <summary> + Indicates whether the term is marked for interpolation. + </summary> + <remarks></remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsInt"> + <summary> + Indicates whether the term is of integer sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsReal"> + <summary> + Indicates whether the term is of sort real. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsArithmeticNumeral"> + <summary> + Indicates whether the term is an arithmetic numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsLE"> + <summary> + Indicates whether the term is a less-than-or-equal + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsGE"> + <summary> + Indicates whether the term is a greater-than-or-equal + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsLT"> + <summary> + Indicates whether the term is a less-than + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsGT"> + <summary> + Indicates whether the term is a greater-than + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsAdd"> + <summary> + Indicates whether the term is addition (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsSub"> + <summary> + Indicates whether the term is subtraction (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsUMinus"> + <summary> + Indicates whether the term is a unary minus + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsMul"> + <summary> + Indicates whether the term is multiplication (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsDiv"> + <summary> + Indicates whether the term is division (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsIDiv"> + <summary> + Indicates whether the term is integer division (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsRemainder"> + <summary> + Indicates whether the term is remainder (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsModulus"> + <summary> + Indicates whether the term is modulus (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsIntToReal"> + <summary> + Indicates whether the term is a coercion of integer to real (unary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsRealToInt"> + <summary> + Indicates whether the term is a coercion of real to integer (unary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsRealIsInt"> + <summary> + Indicates whether the term is a check that tests whether a real is integral (unary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsArray"> + <summary> + Indicates whether the term is of an array sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsStore"> + <summary> + Indicates whether the term is an array store. + </summary> + <remarks>It satisfies select(store(a,i,v),j) = if i = j then v else select(a,j). + Array store takes at least 3 arguments. </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsSelect"> + <summary> + Indicates whether the term is an array select. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsConstantArray"> + <summary> + Indicates whether the term is a constant array. + </summary> + <remarks>For example, select(const(v),i) = v holds for every v and i. The function is unary.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsDefaultArray"> + <summary> + Indicates whether the term is a default array. + </summary> + <remarks>For example default(const(v)) = v. The function is unary.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsArrayMap"> + <summary> + Indicates whether the term is an array map. + </summary> + <remarks>It satisfies map[f](a1,..,a_n)[i] = f(a1[i],...,a_n[i]) for every i.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsAsArray"> + <summary> + Indicates whether the term is an as-array term. + </summary> + <remarks>An as-array term is n array value that behaves as the function graph of the + function passed as parameter.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsSetUnion"> + <summary> + Indicates whether the term is set union + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsSetIntersect"> + <summary> + Indicates whether the term is set intersection + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsSetDifference"> + <summary> + Indicates whether the term is set difference + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsSetComplement"> + <summary> + Indicates whether the term is set complement + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsSetSubset"> + <summary> + Indicates whether the term is set subset + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBV"> + <summary> + Indicates whether the terms is of bit-vector sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVNumeral"> + <summary> + Indicates whether the term is a bit-vector numeral + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVBitOne"> + <summary> + Indicates whether the term is a one-bit bit-vector with value one + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVBitZero"> + <summary> + Indicates whether the term is a one-bit bit-vector with value zero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVUMinus"> + <summary> + Indicates whether the term is a bit-vector unary minus + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVAdd"> + <summary> + Indicates whether the term is a bit-vector addition (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSub"> + <summary> + Indicates whether the term is a bit-vector subtraction (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVMul"> + <summary> + Indicates whether the term is a bit-vector multiplication (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSDiv"> + <summary> + Indicates whether the term is a bit-vector signed division (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVUDiv"> + <summary> + Indicates whether the term is a bit-vector unsigned division (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSRem"> + <summary> + Indicates whether the term is a bit-vector signed remainder (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVURem"> + <summary> + Indicates whether the term is a bit-vector unsigned remainder (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSMod"> + <summary> + Indicates whether the term is a bit-vector signed modulus + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSDiv0"> + <summary> + Indicates whether the term is a bit-vector signed division by zero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVUDiv0"> + <summary> + Indicates whether the term is a bit-vector unsigned division by zero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSRem0"> + <summary> + Indicates whether the term is a bit-vector signed remainder by zero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVURem0"> + <summary> + Indicates whether the term is a bit-vector unsigned remainder by zero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSMod0"> + <summary> + Indicates whether the term is a bit-vector signed modulus by zero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVULE"> + <summary> + Indicates whether the term is an unsigned bit-vector less-than-or-equal + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSLE"> + <summary> + Indicates whether the term is a signed bit-vector less-than-or-equal + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVUGE"> + <summary> + Indicates whether the term is an unsigned bit-vector greater-than-or-equal + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSGE"> + <summary> + Indicates whether the term is a signed bit-vector greater-than-or-equal + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVULT"> + <summary> + Indicates whether the term is an unsigned bit-vector less-than + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSLT"> + <summary> + Indicates whether the term is a signed bit-vector less-than + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVUGT"> + <summary> + Indicates whether the term is an unsigned bit-vector greater-than + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSGT"> + <summary> + Indicates whether the term is a signed bit-vector greater-than + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVAND"> + <summary> + Indicates whether the term is a bit-wise AND + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVOR"> + <summary> + Indicates whether the term is a bit-wise OR + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVNOT"> + <summary> + Indicates whether the term is a bit-wise NOT + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVXOR"> + <summary> + Indicates whether the term is a bit-wise XOR + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVNAND"> + <summary> + Indicates whether the term is a bit-wise NAND + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVNOR"> + <summary> + Indicates whether the term is a bit-wise NOR + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVXNOR"> + <summary> + Indicates whether the term is a bit-wise XNOR + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVConcat"> + <summary> + Indicates whether the term is a bit-vector concatenation (binary) + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVSignExtension"> + <summary> + Indicates whether the term is a bit-vector sign extension + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVZeroExtension"> + <summary> + Indicates whether the term is a bit-vector zero extension + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVExtract"> + <summary> + Indicates whether the term is a bit-vector extraction + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVRepeat"> + <summary> + Indicates whether the term is a bit-vector repetition + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVReduceOR"> + <summary> + Indicates whether the term is a bit-vector reduce OR + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVReduceAND"> + <summary> + Indicates whether the term is a bit-vector reduce AND + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVComp"> + <summary> + Indicates whether the term is a bit-vector comparison + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVShiftLeft"> + <summary> + Indicates whether the term is a bit-vector shift left + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVShiftRightLogical"> + <summary> + Indicates whether the term is a bit-vector logical shift right + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVShiftRightArithmetic"> + <summary> + Indicates whether the term is a bit-vector arithmetic shift left + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVRotateLeft"> + <summary> + Indicates whether the term is a bit-vector rotate left + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVRotateRight"> + <summary> + Indicates whether the term is a bit-vector rotate right + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVRotateLeftExtended"> + <summary> + Indicates whether the term is a bit-vector rotate left (extended) + </summary> + <remarks>Similar to Z3_OP_ROTATE_LEFT, but it is a binary operator instead of a parametric one.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVRotateRightExtended"> + <summary> + Indicates whether the term is a bit-vector rotate right (extended) + </summary> + <remarks>Similar to Z3_OP_ROTATE_RIGHT, but it is a binary operator instead of a parametric one.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsIntToBV"> + <summary> + Indicates whether the term is a coercion from integer to bit-vector + </summary> + <remarks>This function is not supported by the decision procedures. Only the most + rudimentary simplification rules are applied to this function.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVToInt"> + <summary> + Indicates whether the term is a coercion from bit-vector to integer + </summary> + <remarks>This function is not supported by the decision procedures. Only the most + rudimentary simplification rules are applied to this function.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVCarry"> + <summary> + Indicates whether the term is a bit-vector carry + </summary> + <remarks>Compute the carry bit in a full-adder. The meaning is given by the + equivalence (carry l1 l2 l3) <=> (or (and l1 l2) (and l1 l3) (and l2 l3)))</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsBVXOR3"> + <summary> + Indicates whether the term is a bit-vector ternary XOR + </summary> + <remarks>The meaning is given by the equivalence (xor3 l1 l2 l3) <=> (xor (xor l1 l2) l3)</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsLabel"> + <summary> + Indicates whether the term is a label (used by the Boogie Verification condition generator). + </summary> + <remarks>The label has two parameters, a string and a Boolean polarity. It takes one argument, a formula.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsLabelLit"> + <summary> + Indicates whether the term is a label literal (used by the Boogie Verification condition generator). + </summary> + <remarks>A label literal has a set of string parameters. It takes no arguments.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsString"> + <summary> + Check whether expression is a string constant. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.String"> + <summary> + Retrieve string corresponding to string constant. + </summary> + <remarks>the expression should be a string constant, (IsString should be true).</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsConcat"> + <summary> + Check whether expression is a concatentation. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.IsPrefix"> + <summary> + Check whether expression is a prefix. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.IsSuffix"> + <summary> + Check whether expression is a suffix. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.IsContains"> + <summary> + Check whether expression is a contains. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.IsExtract"> + <summary> + Check whether expression is an extract. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.IsReplace"> + <summary> + Check whether expression is a replace. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.IsAt"> + <summary> + Check whether expression is an at. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.IsLength"> + <summary> + Check whether expression is a sequence length. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.IsIndex"> + <summary> + Check whether expression is a sequence index. + </summary> + <returns>a Boolean</returns> + </member> + <member name="P:Microsoft.Z3.Expr.IsOEQ"> + <summary> + Indicates whether the term is a binary equivalence modulo namings. + </summary> + <remarks>This binary predicate is used in proof terms. + It captures equisatisfiability and equivalence modulo renamings.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofTrue"> + <summary> + Indicates whether the term is a Proof for the expression 'true'. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofAsserted"> + <summary> + Indicates whether the term is a proof for a fact asserted by the user. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofGoal"> + <summary> + Indicates whether the term is a proof for a fact (tagged as goal) asserted by the user. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofModusPonens"> + <summary> + Indicates whether the term is proof via modus ponens + </summary> + <remarks> + Given a proof for p and a proof for (implies p q), produces a proof for q. + T1: p + T2: (implies p q) + [mp T1 T2]: q + The second antecedents may also be a proof for (iff p q).</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofReflexivity"> + <summary> + Indicates whether the term is a proof for (R t t), where R is a reflexive relation. + </summary> + <remarks>This proof object has no antecedents. + The only reflexive relations that are used are + equivalence modulo namings, equality and equivalence. + That is, R is either '~', '=' or 'iff'.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofSymmetry"> + <summary> + Indicates whether the term is proof by symmetricity of a relation + </summary> + <remarks> + Given an symmetric relation R and a proof for (R t s), produces a proof for (R s t). + T1: (R t s) + [symmetry T1]: (R s t) + T1 is the antecedent of this proof object. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofTransitivity"> + <summary> + Indicates whether the term is a proof by transitivity of a relation + </summary> + <remarks> + Given a transitive relation R, and proofs for (R t s) and (R s u), produces a proof + for (R t u). + T1: (R t s) + T2: (R s u) + [trans T1 T2]: (R t u) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofTransitivityStar"> + <summary> + Indicates whether the term is a proof by condensed transitivity of a relation + </summary> + <remarks> + Condensed transitivity proof. This proof object is only used if the parameter PROOF_MODE is 1. + It combines several symmetry and transitivity proofs. + Example: + T1: (R a b) + T2: (R c b) + T3: (R c d) + [trans* T1 T2 T3]: (R a d) + R must be a symmetric and transitive relation. + + Assuming that this proof object is a proof for (R s t), then + a proof checker must check if it is possible to prove (R s t) + using the antecedents, symmetry and transitivity. That is, + if there is a path from s to t, if we view every + antecedent (R a b) as an edge between a and b. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofMonotonicity"> + <summary> + Indicates whether the term is a monotonicity proof object. + </summary> + <remarks> + T1: (R t_1 s_1) + ... + Tn: (R t_n s_n) + [monotonicity T1 ... Tn]: (R (f t_1 ... t_n) (f s_1 ... s_n)) + Remark: if t_i == s_i, then the antecedent Ti is suppressed. + That is, reflexivity proofs are supressed to save space. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofQuantIntro"> + <summary> + Indicates whether the term is a quant-intro proof + </summary> + <remarks> + Given a proof for (~ p q), produces a proof for (~ (forall (x) p) (forall (x) q)). + T1: (~ p q) + [quant-intro T1]: (~ (forall (x) p) (forall (x) q)) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofDistributivity"> + <summary> + Indicates whether the term is a distributivity proof object. + </summary> + <remarks> + Given that f (= or) distributes over g (= and), produces a proof for + (= (f a (g c d)) + (g (f a c) (f a d))) + If f and g are associative, this proof also justifies the following equality: + (= (f (g a b) (g c d)) + (g (f a c) (f a d) (f b c) (f b d))) + where each f and g can have arbitrary number of arguments. + + This proof object has no antecedents. + Remark. This rule is used by the CNF conversion pass and + instantiated by f = or, and g = and. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofAndElimination"> + <summary> + Indicates whether the term is a proof by elimination of AND + </summary> + <remarks> + Given a proof for (and l_1 ... l_n), produces a proof for l_i + T1: (and l_1 ... l_n) + [and-elim T1]: l_i + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofOrElimination"> + <summary> + Indicates whether the term is a proof by eliminiation of not-or + </summary> + <remarks> + Given a proof for (not (or l_1 ... l_n)), produces a proof for (not l_i). + T1: (not (or l_1 ... l_n)) + [not-or-elim T1]: (not l_i) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofRewrite"> + <summary> + Indicates whether the term is a proof by rewriting + </summary> + <remarks> + A proof for a local rewriting step (= t s). + The head function symbol of t is interpreted. + + This proof object has no antecedents. + The conclusion of a rewrite rule is either an equality (= t s), + an equivalence (iff t s), or equi-satisfiability (~ t s). + Remark: if f is bool, then = is iff. + + Examples: + (= (+ x 0) x) + (= (+ x 1 2) (+ 3 x)) + (iff (or x false) x) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofRewriteStar"> + <summary> + Indicates whether the term is a proof by rewriting + </summary> + <remarks> + A proof for rewriting an expression t into an expression s. + This proof object is used if the parameter PROOF_MODE is 1. + This proof object can have n antecedents. + The antecedents are proofs for equalities used as substitution rules. + The object is also used in a few cases if the parameter PROOF_MODE is 2. + The cases are: + - When applying contextual simplification (CONTEXT_SIMPLIFIER=true) + - When converting bit-vectors to Booleans (BIT2BOOL=true) + - When pulling ite expression up (PULL_CHEAP_ITE_TREES=true) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofPullQuant"> + <summary> + Indicates whether the term is a proof for pulling quantifiers out. + </summary> + <remarks> + A proof for (iff (f (forall (x) q(x)) r) (forall (x) (f (q x) r))). This proof object has no antecedents. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofPullQuantStar"> + <summary> + Indicates whether the term is a proof for pulling quantifiers out. + </summary> + <remarks> + A proof for (iff P Q) where Q is in prenex normal form. + This proof object is only used if the parameter PROOF_MODE is 1. + This proof object has no antecedents + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofPushQuant"> + <summary> + Indicates whether the term is a proof for pushing quantifiers in. + </summary> + <remarks> + A proof for: + (iff (forall (x_1 ... x_m) (and p_1[x_1 ... x_m] ... p_n[x_1 ... x_m])) + (and (forall (x_1 ... x_m) p_1[x_1 ... x_m]) + ... + (forall (x_1 ... x_m) p_n[x_1 ... x_m]))) + This proof object has no antecedents + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofElimUnusedVars"> + <summary> + Indicates whether the term is a proof for elimination of unused variables. + </summary> + <remarks> + A proof for (iff (forall (x_1 ... x_n y_1 ... y_m) p[x_1 ... x_n]) + (forall (x_1 ... x_n) p[x_1 ... x_n])) + + It is used to justify the elimination of unused variables. + This proof object has no antecedents. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofDER"> + <summary> + Indicates whether the term is a proof for destructive equality resolution + </summary> + <remarks> + A proof for destructive equality resolution: + (iff (forall (x) (or (not (= x t)) P[x])) P[t]) + if x does not occur in t. + + This proof object has no antecedents. + + Several variables can be eliminated simultaneously. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofQuantInst"> + <summary> + Indicates whether the term is a proof for quantifier instantiation + </summary> + <remarks> + A proof of (or (not (forall (x) (P x))) (P a)) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofHypothesis"> + <summary> + Indicates whether the term is a hypthesis marker. + </summary> + <remarks>Mark a hypothesis in a natural deduction style proof.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofLemma"> + <summary> + Indicates whether the term is a proof by lemma + </summary> + <remarks> + T1: false + [lemma T1]: (or (not l_1) ... (not l_n)) + + This proof object has one antecedent: a hypothetical proof for false. + It converts the proof in a proof for (or (not l_1) ... (not l_n)), + when T1 contains the hypotheses: l_1, ..., l_n. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofUnitResolution"> + <summary> + Indicates whether the term is a proof by unit resolution + </summary> + <remarks> + T1: (or l_1 ... l_n l_1' ... l_m') + T2: (not l_1) + ... + T(n+1): (not l_n) + [unit-resolution T1 ... T(n+1)]: (or l_1' ... l_m') + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofIFFTrue"> + <summary> + Indicates whether the term is a proof by iff-true + </summary> + <remarks> + T1: p + [iff-true T1]: (iff p true) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofIFFFalse"> + <summary> + Indicates whether the term is a proof by iff-false + </summary> + <remarks> + T1: (not p) + [iff-false T1]: (iff p false) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofCommutativity"> + <summary> + Indicates whether the term is a proof by commutativity + </summary> + <remarks> + [comm]: (= (f a b) (f b a)) + + f is a commutative operator. + + This proof object has no antecedents. + Remark: if f is bool, then = is iff. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofDefAxiom"> + <summary> + Indicates whether the term is a proof for Tseitin-like axioms + </summary> + <remarks> + Proof object used to justify Tseitin's like axioms: + + (or (not (and p q)) p) + (or (not (and p q)) q) + (or (not (and p q r)) p) + (or (not (and p q r)) q) + (or (not (and p q r)) r) + ... + (or (and p q) (not p) (not q)) + (or (not (or p q)) p q) + (or (or p q) (not p)) + (or (or p q) (not q)) + (or (not (iff p q)) (not p) q) + (or (not (iff p q)) p (not q)) + (or (iff p q) (not p) (not q)) + (or (iff p q) p q) + (or (not (ite a b c)) (not a) b) + (or (not (ite a b c)) a c) + (or (ite a b c) (not a) (not b)) + (or (ite a b c) a (not c)) + (or (not (not a)) (not a)) + (or (not a) a) + + This proof object has no antecedents. + Note: all axioms are propositional tautologies. + Note also that 'and' and 'or' can take multiple arguments. + You can recover the propositional tautologies by + unfolding the Boolean connectives in the axioms a small + bounded number of steps (=3). + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofDefIntro"> + <summary> + Indicates whether the term is a proof for introduction of a name + </summary> + <remarks> + Introduces a name for a formula/term. + Suppose e is an expression with free variables x, and def-intro + introduces the name n(x). The possible cases are: + + When e is of Boolean type: + [def-intro]: (and (or n (not e)) (or (not n) e)) + + or: + [def-intro]: (or (not n) e) + when e only occurs positively. + + When e is of the form (ite cond th el): + [def-intro]: (and (or (not cond) (= n th)) (or cond (= n el))) + + Otherwise: + [def-intro]: (= n e) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofApplyDef"> + <summary> + Indicates whether the term is a proof for application of a definition + </summary> + <remarks> + [apply-def T1]: F ~ n + F is 'equivalent' to n, given that T1 is a proof that + n is a name for F. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofIFFOEQ"> + <summary> + Indicates whether the term is a proof iff-oeq + </summary> + <remarks> + T1: (iff p q) + [iff~ T1]: (~ p q) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofNNFPos"> + <summary> + Indicates whether the term is a proof for a positive NNF step + </summary> + <remarks> + Proof for a (positive) NNF step. Example: + + T1: (not s_1) ~ r_1 + T2: (not s_2) ~ r_2 + T3: s_1 ~ r_1' + T4: s_2 ~ r_2' + [nnf-pos T1 T2 T3 T4]: (~ (iff s_1 s_2) + (and (or r_1 r_2') (or r_1' r_2))) + + The negation normal form steps NNF_POS and NNF_NEG are used in the following cases: + (a) When creating the NNF of a positive force quantifier. + The quantifier is retained (unless the bound variables are eliminated). + Example + T1: q ~ q_new + [nnf-pos T1]: (~ (forall (x T) q) (forall (x T) q_new)) + + (b) When recursively creating NNF over Boolean formulas, where the top-level + connective is changed during NNF conversion. The relevant Boolean connectives + for NNF_POS are 'implies', 'iff', 'xor', 'ite'. + NNF_NEG furthermore handles the case where negation is pushed + over Boolean connectives 'and' and 'or'. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofNNFNeg"> + <summary> + Indicates whether the term is a proof for a negative NNF step + </summary> + <remarks> + Proof for a (negative) NNF step. Examples: + + T1: (not s_1) ~ r_1 + ... + Tn: (not s_n) ~ r_n + [nnf-neg T1 ... Tn]: (not (and s_1 ... s_n)) ~ (or r_1 ... r_n) + and + T1: (not s_1) ~ r_1 + ... + Tn: (not s_n) ~ r_n + [nnf-neg T1 ... Tn]: (not (or s_1 ... s_n)) ~ (and r_1 ... r_n) + and + T1: (not s_1) ~ r_1 + T2: (not s_2) ~ r_2 + T3: s_1 ~ r_1' + T4: s_2 ~ r_2' + [nnf-neg T1 T2 T3 T4]: (~ (not (iff s_1 s_2)) + (and (or r_1 r_2) (or r_1' r_2'))) + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofNNFStar"> + <summary> + Indicates whether the term is a proof for (~ P Q) here Q is in negation normal form. + </summary> + <remarks> + A proof for (~ P Q) where Q is in negation normal form. + + This proof object is only used if the parameter PROOF_MODE is 1. + + This proof object may have n antecedents. Each antecedent is a PR_DEF_INTRO. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofCNFStar"> + <summary> + Indicates whether the term is a proof for (~ P Q) where Q is in conjunctive normal form. + </summary> + <remarks> + A proof for (~ P Q) where Q is in conjunctive normal form. + This proof object is only used if the parameter PROOF_MODE is 1. + This proof object may have n antecedents. Each antecedent is a PR_DEF_INTRO. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofSkolemize"> + <summary> + Indicates whether the term is a proof for a Skolemization step + </summary> + <remarks> + Proof for: + + [sk]: (~ (not (forall x (p x y))) (not (p (sk y) y))) + [sk]: (~ (exists x (p x y)) (p (sk y) y)) + + This proof object has no antecedents. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofModusPonensOEQ"> + <summary> + Indicates whether the term is a proof by modus ponens for equi-satisfiability. + </summary> + <remarks> + Modus ponens style rule for equi-satisfiability. + T1: p + T2: (~ p q) + [mp~ T1 T2]: q + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsProofTheoryLemma"> + <summary> + Indicates whether the term is a proof for theory lemma + </summary> + <remarks> + Generic proof for theory lemmas. + + The theory lemma function comes with one or more parameters. + The first parameter indicates the name of the theory. + For the theory of arithmetic, additional parameters provide hints for + checking the theory lemma. + The hints for arithmetic are: + - farkas - followed by rational coefficients. Multiply the coefficients to the + inequalities in the lemma, add the (negated) inequalities and obtain a contradiction. + - triangle-eq - Indicates a lemma related to the equivalence: + (iff (= t1 t2) (and (<= t1 t2) (<= t2 t1))) + - gcd-test - Indicates an integer linear arithmetic lemma that uses a gcd test. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelation"> + <summary> + Indicates whether the term is of relation sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationStore"> + <summary> + Indicates whether the term is an relation store + </summary> + <remarks> + Insert a record into a relation. + The function takes <c>n+1</c> arguments, where the first argument is the relation and the remaining <c>n</c> elements + correspond to the <c>n</c> columns of the relation. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsEmptyRelation"> + <summary> + Indicates whether the term is an empty relation + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsIsEmptyRelation"> + <summary> + Indicates whether the term is a test for the emptiness of a relation + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationalJoin"> + <summary> + Indicates whether the term is a relational join + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationUnion"> + <summary> + Indicates whether the term is the union or convex hull of two relations. + </summary> + <remarks>The function takes two arguments.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationWiden"> + <summary> + Indicates whether the term is the widening of two relations + </summary> + <remarks>The function takes two arguments.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationProject"> + <summary> + Indicates whether the term is a projection of columns (provided as numbers in the parameters). + </summary> + <remarks>The function takes one argument.</remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationFilter"> + <summary> + Indicates whether the term is a relation filter + </summary> + <remarks> + Filter (restrict) a relation with respect to a predicate. + The first argument is a relation. + The second argument is a predicate with free de-Brujin indices + corresponding to the columns of the relation. + So the first column in the relation has index 0. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationNegationFilter"> + <summary> + Indicates whether the term is an intersection of a relation with the negation of another. + </summary> + <remarks> + Intersect the first relation with respect to negation + of the second relation (the function takes two arguments). + Logically, the specification can be described by a function + + target = filter_by_negation(pos, neg, columns) + + where columns are pairs c1, d1, .., cN, dN of columns from pos and neg, such that + target are elements in x in pos, such that there is no y in neg that agrees with + x on the columns c1, d1, .., cN, dN. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationRename"> + <summary> + Indicates whether the term is the renaming of a column in a relation + </summary> + <remarks> + The function takes one argument. + The parameters contain the renaming as a cycle. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationComplement"> + <summary> + Indicates whether the term is the complement of a relation + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationSelect"> + <summary> + Indicates whether the term is a relational select + </summary> + <remarks> + Check if a record is an element of the relation. + The function takes <c>n+1</c> arguments, where the first argument is a relation, + and the remaining <c>n</c> arguments correspond to a record. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsRelationClone"> + <summary> + Indicates whether the term is a relational clone (copy) + </summary> + <remarks> + Create a fresh copy (clone) of a relation. + The function is logically the identity, but + in the context of a register machine allows + for terms of kind <seealso cref="P:Microsoft.Z3.Expr.IsRelationUnion"/> + to perform destructive updates to the first argument. + </remarks> + </member> + <member name="P:Microsoft.Z3.Expr.IsFiniteDomain"> + <summary> + Indicates whether the term is of an array sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFiniteDomainLT"> + <summary> + Indicates whether the term is a less than predicate over a finite domain. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFP"> + <summary> + Indicates whether the terms is of floating-point sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRM"> + <summary> + Indicates whether the terms is of floating-point rounding mode sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPNumeral"> + <summary> + Indicates whether the term is a floating-point numeral + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMNumeral"> + <summary> + Indicates whether the term is a floating-point rounding mode numeral + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMRoundNearestTiesToEven"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMRoundNearestTiesToAway"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMRoundTowardNegative"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardNegative + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMRoundTowardPositive"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardPositive + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMRoundTowardZero"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardZero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMExprRNE"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMExprRNA"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMExprRTN"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardNegative + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMExprRTP"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardPositive + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMExprRTZ"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardZero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRMExpr"> + <summary> + Indicates whether the term is a floating-point rounding mode numeral + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPPlusInfinity"> + <summary> + Indicates whether the term is a floating-point +oo + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPMinusInfinity"> + <summary> + Indicates whether the term is a floating-point -oo + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPNaN"> + <summary> + Indicates whether the term is a floating-point NaN + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPPlusZero"> + <summary> + Indicates whether the term is a floating-point +zero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPMinusZero"> + <summary> + Indicates whether the term is a floating-point -zero + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPAdd"> + <summary> + Indicates whether the term is a floating-point addition term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPSub"> + <summary> + Indicates whether the term is a floating-point subtraction term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPNeg"> + <summary> + Indicates whether the term is a floating-point negation term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPMul"> + <summary> + Indicates whether the term is a floating-point multiplication term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPDiv"> + <summary> + Indicates whether the term is a floating-point divison term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRem"> + <summary> + Indicates whether the term is a floating-point remainder term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPAbs"> + <summary> + Indicates whether the term is a floating-point term absolute value term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPMin"> + <summary> + Indicates whether the term is a floating-point minimum term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPMax"> + <summary> + Indicates whether the term is a floating-point maximum term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPFMA"> + <summary> + Indicates whether the term is a floating-point fused multiply-add term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPSqrt"> + <summary> + Indicates whether the term is a floating-point square root term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPRoundToIntegral"> + <summary> + Indicates whether the term is a floating-point roundToIntegral term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPEq"> + <summary> + Indicates whether the term is a floating-point equality term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPLt"> + <summary> + Indicates whether the term is a floating-point less-than term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPGt"> + <summary> + Indicates whether the term is a floating-point greater-than term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPLe"> + <summary> + Indicates whether the term is a floating-point less-than or equal term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPGe"> + <summary> + Indicates whether the term is a floating-point greater-than or erqual term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPisNaN"> + <summary> + Indicates whether the term is a floating-point isNaN predicate term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPisInf"> + <summary> + Indicates whether the term is a floating-point isInf predicate term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPisZero"> + <summary> + Indicates whether the term is a floating-point isZero predicate term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPisNormal"> + <summary> + Indicates whether the term is a floating-point isNormal term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPisSubnormal"> + <summary> + Indicates whether the term is a floating-point isSubnormal predicate term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPisNegative"> + <summary> + Indicates whether the term is a floating-point isNegative predicate term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPisPositive"> + <summary> + Indicates whether the term is a floating-point isPositive predicate term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPFP"> + <summary> + Indicates whether the term is a floating-point constructor term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPToFp"> + <summary> + Indicates whether the term is a floating-point conversion term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPToFpUnsigned"> + <summary> + Indicates whether the term is a floating-point conversion from unsigned bit-vector term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPToUBV"> + <summary> + Indicates whether the term is a floating-point conversion to unsigned bit-vector term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPToSBV"> + <summary> + Indicates whether the term is a floating-point conversion to signed bit-vector term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPToReal"> + <summary> + Indicates whether the term is a floating-point conversion to real term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.IsFPToIEEEBV"> + <summary> + Indicates whether the term is a floating-point conversion to IEEE-754 bit-vector term + </summary> + </member> + <member name="P:Microsoft.Z3.Expr.Index"> + <summary> + The de-Burijn index of a bound variable. + </summary> + <remarks> + Bound variables are indexed by de-Bruijn indices. It is perhaps easiest to explain + the meaning of de-Bruijn indices by indicating the compilation process from + non-de-Bruijn formulas to de-Bruijn format. + <code> + abs(forall (x1) phi) = forall (x1) abs1(phi, x1, 0) + abs(forall (x1, x2) phi) = abs(forall (x1) abs(forall (x2) phi)) + abs1(x, x, n) = b_n + abs1(y, x, n) = y + abs1(f(t1,...,tn), x, n) = f(abs1(t1,x,n), ..., abs1(tn,x,n)) + abs1(forall (x1) phi, x, n) = forall (x1) (abs1(phi, x, n+1)) + </code> + The last line is significant: the index of a bound variable is different depending + on the scope in which it appears. The deeper x appears, the higher is its + index. + </remarks> + </member> + <member name="M:Microsoft.Z3.ArithExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for ArithExpr </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Division(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical divsion operator (over reals) </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Division(Microsoft.Z3.ArithExpr,System.Int32)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Division(Microsoft.Z3.ArithExpr,System.Double)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Division(System.Int32,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Division(System.Double,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_UnaryNegation(Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Subtraction(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Subtraction(Microsoft.Z3.ArithExpr,System.Int32)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Subtraction(Microsoft.Z3.ArithExpr,System.Double)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Subtraction(System.Int32,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Subtraction(System.Double,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Addition(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Addition(Microsoft.Z3.ArithExpr,System.Int32)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Addition(Microsoft.Z3.ArithExpr,System.Double)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Addition(System.Int32,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Addition(System.Double,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Multiply(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Multiply(Microsoft.Z3.ArithExpr,System.Int32)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Multiply(Microsoft.Z3.ArithExpr,System.Double)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Multiply(System.Int32,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_Multiply(System.Double,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThanOrEqual(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThanOrEqual(Microsoft.Z3.ArithExpr,System.Int32)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThanOrEqual(Microsoft.Z3.ArithExpr,System.Double)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThanOrEqual(System.Int32,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThanOrEqual(System.Double,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThan(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThan(Microsoft.Z3.ArithExpr,System.Int32)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThan(Microsoft.Z3.ArithExpr,System.Double)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThan(System.Int32,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_LessThan(System.Double,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThan(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThan(Microsoft.Z3.ArithExpr,System.Int32)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThan(Microsoft.Z3.ArithExpr,System.Double)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThan(System.Int32,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThan(System.Double,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThanOrEqual(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThanOrEqual(Microsoft.Z3.ArithExpr,System.Int32)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThanOrEqual(Microsoft.Z3.ArithExpr,System.Double)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThanOrEqual(System.Int32,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.ArithExpr.op_GreaterThanOrEqual(System.Double,Microsoft.Z3.ArithExpr)"> + <summary> Operator overloading for arithmetical operator </summary> + </member> + <member name="M:Microsoft.Z3.AlgebraicNum.ToUpper(System.UInt32)"> + <summary> + Return a upper bound for a given real algebraic number. + The interval isolating the number is smaller than 1/10^<paramref name="precision"/>. + <seealso cref="P:Microsoft.Z3.Expr.IsAlgebraicNumber"/> + </summary> + <param name="precision">the precision of the result</param> + <returns>A numeral Expr of sort Real</returns> + </member> + <member name="M:Microsoft.Z3.AlgebraicNum.ToLower(System.UInt32)"> + <summary> + Return a lower bound for the given real algebraic number. + The interval isolating the number is smaller than 1/10^<paramref name="precision"/>. + <seealso cref="P:Microsoft.Z3.Expr.IsAlgebraicNumber"/> + </summary> + <param name="precision"></param> + <returns>A numeral Expr of sort Real</returns> + </member> + <member name="M:Microsoft.Z3.AlgebraicNum.ToDecimal(System.UInt32)"> + <summary> + Returns a string representation in decimal notation. + </summary> + <remarks>The result has at most <paramref name="precision"/> decimal places.</remarks> + </member> + <member name="T:Microsoft.Z3.ApplyResult"> + <summary> + ApplyResult objects represent the result of an application of a + tactic to a goal. It contains the subgoals that were produced. + </summary> + </member> + <member name="M:Microsoft.Z3.ApplyResult.ConvertModel(System.UInt32,Microsoft.Z3.Model)"> + <summary> + Convert a model for the subgoal <paramref name="i"/> into a model for the original + goal <c>g</c>, that the ApplyResult was obtained from. + </summary> + <returns>A model for <c>g</c></returns> + </member> + <member name="M:Microsoft.Z3.ApplyResult.ToString"> + <summary> + A string representation of the ApplyResult. + </summary> + </member> + <member name="P:Microsoft.Z3.ApplyResult.NumSubgoals"> + <summary> + The number of Subgoals. + </summary> + </member> + <member name="P:Microsoft.Z3.ApplyResult.Subgoals"> + <summary> + Retrieves the subgoals from the ApplyResult. + </summary> + </member> + <member name="T:Microsoft.Z3.ArithSort"> + <summary> + An arithmetic sort, i.e., Int or Real. + </summary> + </member> + <member name="T:Microsoft.Z3.Sort"> + <summary> + The Sort class implements type information for ASTs. + </summary> + </member> + <member name="M:Microsoft.Z3.Sort.op_Equality(Microsoft.Z3.Sort,Microsoft.Z3.Sort)"> + <summary> + Comparison operator. + </summary> + <param name="a">A Sort</param> + <param name="b">A Sort</param> + <returns>True if <paramref name="a"/> and <paramref name="b"/> are from the same context + and represent the same sort; false otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.Sort.op_Inequality(Microsoft.Z3.Sort,Microsoft.Z3.Sort)"> + <summary> + Comparison operator. + </summary> + <param name="a">A Sort</param> + <param name="b">A Sort</param> + <returns>True if <paramref name="a"/> and <paramref name="b"/> are not from the same context + or represent different sorts; false otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.Sort.Equals(System.Object)"> + <summary> + Equality operator for objects of type Sort. + </summary> + <param name="o"></param> + <returns></returns> + </member> + <member name="M:Microsoft.Z3.Sort.GetHashCode"> + <summary> + Hash code generation for Sorts + </summary> + <returns>A hash code</returns> + </member> + <member name="M:Microsoft.Z3.Sort.ToString"> + <summary> + A string representation of the sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Sort.Translate(Microsoft.Z3.Context)"> + <summary> + Translates (copies) the sort to the Context <paramref name="ctx"/>. + </summary> + <param name="ctx">A context</param> + <returns>A copy of the sort which is associated with <paramref name="ctx"/></returns> + </member> + <member name="M:Microsoft.Z3.Sort.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> + Sort constructor + </summary> + </member> + <member name="P:Microsoft.Z3.Sort.Id"> + <summary> + Returns a unique identifier for the sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Sort.SortKind"> + <summary> + The kind of the sort. + </summary> + </member> + <member name="P:Microsoft.Z3.Sort.Name"> + <summary> + The name of the sort + </summary> + </member> + <member name="T:Microsoft.Z3.ArrayExpr"> + <summary> + Array expressions + </summary> + </member> + <member name="M:Microsoft.Z3.ArrayExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for ArrayExpr </summary> + </member> + <member name="T:Microsoft.Z3.ArraySort"> + <summary> + Array sorts. + </summary> + </member> + <member name="P:Microsoft.Z3.ArraySort.Domain"> + <summary> + The domain of the array sort. + </summary> + </member> + <member name="P:Microsoft.Z3.ArraySort.Range"> + <summary> + The range of the array sort. + </summary> + </member> + <member name="T:Microsoft.Z3.ASTMap"> + <summary> + Map from AST to AST + </summary> + </member> + <member name="M:Microsoft.Z3.ASTMap.Contains(Microsoft.Z3.AST)"> + <summary> + Checks whether the map contains the key <paramref name="k"/>. + </summary> + <param name="k">An AST</param> + <returns>True if <paramref name="k"/> is a key in the map, false otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.ASTMap.Find(Microsoft.Z3.AST)"> + <summary> + Finds the value associated with the key <paramref name="k"/>. + </summary> + <remarks> + This function signs an error when <paramref name="k"/> is not a key in the map. + </remarks> + <param name="k">An AST</param> + </member> + <member name="M:Microsoft.Z3.ASTMap.Insert(Microsoft.Z3.AST,Microsoft.Z3.AST)"> + <summary> + Stores or replaces a new key/value pair in the map. + </summary> + <param name="k">The key AST</param> + <param name="v">The value AST</param> + </member> + <member name="M:Microsoft.Z3.ASTMap.Erase(Microsoft.Z3.AST)"> + <summary> + Erases the key <paramref name="k"/> from the map. + </summary> + <param name="k">An AST</param> + </member> + <member name="M:Microsoft.Z3.ASTMap.Reset"> + <summary> + Removes all keys from the map. + </summary> + </member> + <member name="M:Microsoft.Z3.ASTMap.ToString"> + <summary> + Retrieves a string representation of the map. + </summary> + </member> + <member name="P:Microsoft.Z3.ASTMap.Size"> + <summary> + The size of the map + </summary> + </member> + <member name="P:Microsoft.Z3.ASTMap.Keys"> + <summary> + The keys stored in the map. + </summary> + </member> + <member name="T:Microsoft.Z3.ASTVector"> + <summary> + Vectors of ASTs. + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.Resize(System.UInt32)"> + <summary> + Resize the vector to <paramref name="newSize"/>. + </summary> + <param name="newSize">The new size of the vector.</param> + </member> + <member name="M:Microsoft.Z3.ASTVector.Push(Microsoft.Z3.AST)"> + <summary> + Add the AST <paramref name="a"/> to the back of the vector. The size + is increased by 1. + </summary> + <param name="a">An AST</param> + </member> + <member name="M:Microsoft.Z3.ASTVector.Translate(Microsoft.Z3.Context)"> + <summary> + Translates all ASTs in the vector to <paramref name="ctx"/>. + </summary> + <param name="ctx">A context</param> + <returns>A new ASTVector</returns> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToString"> + <summary> + Retrieves a string representation of the vector. + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToArray"> + <summary> + Translates an AST vector into an AST[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToExprArray"> + <summary> + Translates an ASTVector into an Expr[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToBoolExprArray"> + <summary> + Translates an ASTVector into a BoolExpr[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToBitVecExprArray"> + <summary> + Translates an ASTVector into a BitVecExpr[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToArithExprArray"> + <summary> + Translates an ASTVector into a ArithExpr[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToArrayExprArray"> + <summary> + Translates an ASTVector into a ArrayExpr[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToDatatypeExprArray"> + <summary> + Translates an ASTVector into a DatatypeExpr[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToFPExprArray"> + <summary> + Translates an ASTVector into a FPExpr[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToFPRMExprArray"> + <summary> + Translates an ASTVector into a FPRMExpr[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToIntExprArray"> + <summary> + Translates an ASTVector into a IntExpr[] + </summary> + </member> + <member name="M:Microsoft.Z3.ASTVector.ToRealExprArray"> + <summary> + Translates an ASTVector into a RealExpr[] + </summary> + </member> + <member name="P:Microsoft.Z3.ASTVector.Size"> + <summary> + The size of the vector + </summary> + </member> + <member name="P:Microsoft.Z3.ASTVector.Item(System.UInt32)"> + <summary> + Retrieves the i-th object in the vector. + </summary> + <remarks>May throw an IndexOutOfBoundsException when <paramref name="i"/> is out of range.</remarks> + <param name="i">Index</param> + <returns>An AST</returns> + </member> + <member name="T:Microsoft.Z3.BitVecExpr"> + <summary> + Bit-vector expressions + </summary> + </member> + <member name="M:Microsoft.Z3.BitVecExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for BitVecExpr </summary> + </member> + <member name="P:Microsoft.Z3.BitVecExpr.SortSize"> + <summary> + The size of the sort of a bit-vector term. + </summary> + </member> + <member name="T:Microsoft.Z3.BitVecNum"> + <summary> + Bit-vector numerals + </summary> + </member> + <member name="M:Microsoft.Z3.BitVecNum.ToString"> + <summary> + Returns a string representation of the numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.BitVecNum.UInt64"> + <summary> + Retrieve the 64-bit unsigned integer value. + </summary> + </member> + <member name="P:Microsoft.Z3.BitVecNum.Int"> + <summary> + Retrieve the int value. + </summary> + </member> + <member name="P:Microsoft.Z3.BitVecNum.Int64"> + <summary> + Retrieve the 64-bit int value. + </summary> + </member> + <member name="P:Microsoft.Z3.BitVecNum.UInt"> + <summary> + Retrieve the int value. + </summary> + </member> + <member name="P:Microsoft.Z3.BitVecNum.BigInteger"> + <summary> + Retrieve the BigInteger value. + </summary> + </member> + <member name="T:Microsoft.Z3.BitVecSort"> + <summary> + Bit-vector sorts. + </summary> + </member> + <member name="P:Microsoft.Z3.BitVecSort.Size"> + <summary> + The size of the bit-vector sort. + </summary> + </member> + <member name="T:Microsoft.Z3.BoolExpr"> + <summary> + Boolean expressions + </summary> + </member> + <member name="M:Microsoft.Z3.BoolExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for BoolExpr </summary> + </member> + <member name="M:Microsoft.Z3.BoolExpr.op_BitwiseOr(Microsoft.Z3.BoolExpr,Microsoft.Z3.BoolExpr)"> + <summary> Disjunction of Boolean expressions </summary> + </member> + <member name="M:Microsoft.Z3.BoolExpr.op_BitwiseAnd(Microsoft.Z3.BoolExpr,Microsoft.Z3.BoolExpr)"> + <summary> Conjunction of Boolean expressions </summary> + </member> + <member name="M:Microsoft.Z3.BoolExpr.op_ExclusiveOr(Microsoft.Z3.BoolExpr,Microsoft.Z3.BoolExpr)"> + <summary> Xor of Boolean expressions </summary> + </member> + <member name="M:Microsoft.Z3.BoolExpr.op_LogicalNot(Microsoft.Z3.BoolExpr)"> + <summary> Negation </summary> + </member> + <member name="T:Microsoft.Z3.BoolSort"> + <summary> + A Boolean sort. + </summary> + </member> + <member name="T:Microsoft.Z3.Constructor"> + <summary> + Constructors are used for datatype sorts. + </summary> + </member> + <member name="M:Microsoft.Z3.Constructor.Finalize"> + <summary> + Destructor. + </summary> + </member> + <member name="P:Microsoft.Z3.Constructor.NumFields"> + <summary> + The number of fields of the constructor. + </summary> + </member> + <member name="P:Microsoft.Z3.Constructor.ConstructorDecl"> + <summary> + The function declaration of the constructor. + </summary> + </member> + <member name="P:Microsoft.Z3.Constructor.TesterDecl"> + <summary> + The function declaration of the tester. + </summary> + </member> + <member name="P:Microsoft.Z3.Constructor.AccessorDecls"> + <summary> + The function declarations of the accessors + </summary> + </member> + <member name="T:Microsoft.Z3.ConstructorList"> + <summary> + Lists of constructors + </summary> + </member> + <member name="M:Microsoft.Z3.ConstructorList.Finalize"> + <summary> + Destructor. + </summary> + </member> + <member name="T:Microsoft.Z3.Context"> + <summary> + The main interaction with Z3 happens via the Context. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.#ctor"> + <summary> + Constructor. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.#ctor(System.Collections.Generic.Dictionary{System.String,System.String})"> + <summary> + Constructor. + </summary> + <remarks> + The following parameters can be set: + - proof (Boolean) Enable proof generation + - debug_ref_count (Boolean) Enable debug support for Z3_ast reference counting + - trace (Boolean) Tracing support for VCC + - trace_file_name (String) Trace out file for VCC traces + - timeout (unsigned) default timeout (in milliseconds) used for solvers + - well_sorted_check type checker + - auto_config use heuristics to automatically select solver and configure it + - model model generation for solvers, this parameter can be overwritten when creating a solver + - model_validate validate models produced by solvers + - unsat_core unsat-core generation for solvers, this parameter can be overwritten when creating a solver + Note that in previous versions of Z3, this constructor was also used to set global and module parameters. + For this purpose we should now use <see cref="M:Microsoft.Z3.Global.SetParameter(System.String,System.String)"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkSymbol(System.Int32)"> + <summary> + Creates a new symbol using an integer. + </summary> + <remarks> + Not all integers can be passed to this function. + The legal range of unsigned integers is 0 to 2^30-1. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkSymbol(System.String)"> + <summary> + Create a symbol using a string. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSymbols(System.String[])"> + <summary> + Create an array of symbols. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkBoolSort"> + <summary> + Create a new Boolean sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkUninterpretedSort(Microsoft.Z3.Symbol)"> + <summary> + Create a new uninterpreted sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkUninterpretedSort(System.String)"> + <summary> + Create a new uninterpreted sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkIntSort"> + <summary> + Create a new integer sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkRealSort"> + <summary> + Create a real sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkBitVecSort(System.UInt32)"> + <summary> + Create a new bit-vector sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSeqSort(Microsoft.Z3.Sort)"> + <summary> + Create a new sequence sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkReSort(Microsoft.Z3.SeqSort)"> + <summary> + Create a new regular expression sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkArraySort(Microsoft.Z3.Sort,Microsoft.Z3.Sort)"> + <summary> + Create a new array sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkArraySort(Microsoft.Z3.Sort[],Microsoft.Z3.Sort)"> + <summary> + Create a new n-ary array sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkTupleSort(Microsoft.Z3.Symbol,Microsoft.Z3.Symbol[],Microsoft.Z3.Sort[])"> + <summary> + Create a new tuple sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkEnumSort(Microsoft.Z3.Symbol,Microsoft.Z3.Symbol[])"> + <summary> + Create a new enumeration sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkEnumSort(System.String,System.String[])"> + <summary> + Create a new enumeration sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkListSort(Microsoft.Z3.Symbol,Microsoft.Z3.Sort)"> + <summary> + Create a new list sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkListSort(System.String,Microsoft.Z3.Sort)"> + <summary> + Create a new list sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFiniteDomainSort(Microsoft.Z3.Symbol,System.UInt64)"> + <summary> + Create a new finite domain sort. + <returns>The result is a sort</returns> + </summary> + <param name="name">The name used to identify the sort</param> + <param name="size">The size of the sort</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFiniteDomainSort(System.String,System.UInt64)"> + <summary> + Create a new finite domain sort. + <returns>The result is a sort</returns> + Elements of the sort are created using <seealso cref="M:Microsoft.Z3.Context.MkNumeral(System.UInt64,Microsoft.Z3.Sort)"/>, + and the elements range from 0 to <tt>size-1</tt>. + </summary> + <param name="name">The name used to identify the sort</param> + <param name="size">The size of the sort</param> + </member> + <member name="M:Microsoft.Z3.Context.MkConstructor(Microsoft.Z3.Symbol,Microsoft.Z3.Symbol,Microsoft.Z3.Symbol[],Microsoft.Z3.Sort[],System.UInt32[])"> + <summary> + Create a datatype constructor. + </summary> + <param name="name">constructor name</param> + <param name="recognizer">name of recognizer function.</param> + <param name="fieldNames">names of the constructor fields.</param> + <param name="sorts">field sorts, 0 if the field sort refers to a recursive sort.</param> + <param name="sortRefs">reference to datatype sort that is an argument to the constructor; + if the corresponding sort reference is 0, then the value in sort_refs should be an index + referring to one of the recursive datatypes that is declared.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkConstructor(System.String,System.String,System.String[],Microsoft.Z3.Sort[],System.UInt32[])"> + <summary> + Create a datatype constructor. + </summary> + <param name="name"></param> + <param name="recognizer"></param> + <param name="fieldNames"></param> + <param name="sorts"></param> + <param name="sortRefs"></param> + <returns></returns> + </member> + <member name="M:Microsoft.Z3.Context.MkDatatypeSort(Microsoft.Z3.Symbol,Microsoft.Z3.Constructor[])"> + <summary> + Create a new datatype sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkDatatypeSort(System.String,Microsoft.Z3.Constructor[])"> + <summary> + Create a new datatype sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkDatatypeSorts(Microsoft.Z3.Symbol[],Microsoft.Z3.Constructor[][])"> + <summary> + Create mutually recursive datatypes. + </summary> + <param name="names">names of datatype sorts</param> + <param name="c">list of constructors, one list per sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkDatatypeSorts(System.String[],Microsoft.Z3.Constructor[][])"> + <summary> + Create mutually recursive data-types. + </summary> + <param name="names"></param> + <param name="c"></param> + <returns></returns> + </member> + <member name="M:Microsoft.Z3.Context.MkUpdateField(Microsoft.Z3.FuncDecl,Microsoft.Z3.Expr,Microsoft.Z3.Expr)"> + <summary> + Update a datatype field at expression t with value v. + The function performs a record update at t. The field + that is passed in as argument is updated with value v, + the remainig fields of t are unchanged. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFuncDecl(Microsoft.Z3.Symbol,Microsoft.Z3.Sort[],Microsoft.Z3.Sort)"> + <summary> + Creates a new function declaration. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFuncDecl(Microsoft.Z3.Symbol,Microsoft.Z3.Sort,Microsoft.Z3.Sort)"> + <summary> + Creates a new function declaration. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFuncDecl(System.String,Microsoft.Z3.Sort[],Microsoft.Z3.Sort)"> + <summary> + Creates a new function declaration. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFuncDecl(System.String,Microsoft.Z3.Sort,Microsoft.Z3.Sort)"> + <summary> + Creates a new function declaration. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFreshFuncDecl(System.String,Microsoft.Z3.Sort[],Microsoft.Z3.Sort)"> + <summary> + Creates a fresh function declaration with a name prefixed with <paramref name="prefix"/>. + </summary> + <seealso cref="M:Microsoft.Z3.Context.MkFuncDecl(System.String,Microsoft.Z3.Sort,Microsoft.Z3.Sort)"/> + <seealso cref="M:Microsoft.Z3.Context.MkFuncDecl(System.String,Microsoft.Z3.Sort[],Microsoft.Z3.Sort)"/> + </member> + <member name="M:Microsoft.Z3.Context.MkConstDecl(Microsoft.Z3.Symbol,Microsoft.Z3.Sort)"> + <summary> + Creates a new constant function declaration. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkConstDecl(System.String,Microsoft.Z3.Sort)"> + <summary> + Creates a new constant function declaration. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFreshConstDecl(System.String,Microsoft.Z3.Sort)"> + <summary> + Creates a fresh constant function declaration with a name prefixed with <paramref name="prefix"/>. + </summary> + <seealso cref="M:Microsoft.Z3.Context.MkFuncDecl(System.String,Microsoft.Z3.Sort,Microsoft.Z3.Sort)"/> + <seealso cref="M:Microsoft.Z3.Context.MkFuncDecl(System.String,Microsoft.Z3.Sort[],Microsoft.Z3.Sort)"/> + </member> + <member name="M:Microsoft.Z3.Context.MkBound(System.UInt32,Microsoft.Z3.Sort)"> + <summary> + Creates a new bound variable. + </summary> + <param name="index">The de-Bruijn index of the variable</param> + <param name="ty">The sort of the variable</param> + </member> + <member name="M:Microsoft.Z3.Context.MkPattern(Microsoft.Z3.Expr[])"> + <summary> + Create a quantifier pattern. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkConst(Microsoft.Z3.Symbol,Microsoft.Z3.Sort)"> + <summary> + Creates a new Constant of sort <paramref name="range"/> and named <paramref name="name"/>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkConst(System.String,Microsoft.Z3.Sort)"> + <summary> + Creates a new Constant of sort <paramref name="range"/> and named <paramref name="name"/>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFreshConst(System.String,Microsoft.Z3.Sort)"> + <summary> + Creates a fresh Constant of sort <paramref name="range"/> and a + name prefixed with <paramref name="prefix"/>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkConst(Microsoft.Z3.FuncDecl)"> + <summary> + Creates a fresh constant from the FuncDecl <paramref name="f"/>. + </summary> + <param name="f">A decl of a 0-arity function</param> + </member> + <member name="M:Microsoft.Z3.Context.MkBoolConst(Microsoft.Z3.Symbol)"> + <summary> + Create a Boolean constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkBoolConst(System.String)"> + <summary> + Create a Boolean constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkIntConst(Microsoft.Z3.Symbol)"> + <summary> + Creates an integer constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkIntConst(System.String)"> + <summary> + Creates an integer constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkRealConst(Microsoft.Z3.Symbol)"> + <summary> + Creates a real constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkRealConst(System.String)"> + <summary> + Creates a real constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkBVConst(Microsoft.Z3.Symbol,System.UInt32)"> + <summary> + Creates a bit-vector constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkBVConst(System.String,System.UInt32)"> + <summary> + Creates a bit-vector constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkApp(Microsoft.Z3.FuncDecl,Microsoft.Z3.Expr[])"> + <summary> + Create a new function application. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkApp(Microsoft.Z3.FuncDecl,System.Collections.Generic.IEnumerable{Microsoft.Z3.Expr})"> + <summary> + Create a new function application. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkTrue"> + <summary> + The true Term. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFalse"> + <summary> + The false Term. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkBool(System.Boolean)"> + <summary> + Creates a Boolean value. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkEq(Microsoft.Z3.Expr,Microsoft.Z3.Expr)"> + <summary> + Creates the equality <paramref name="x"/> = <paramref name="y"/>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkDistinct(Microsoft.Z3.Expr[])"> + <summary> + Creates a <c>distinct</c> term. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkNot(Microsoft.Z3.BoolExpr)"> + <summary> + Mk an expression representing <c>not(a)</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkITE(Microsoft.Z3.BoolExpr,Microsoft.Z3.Expr,Microsoft.Z3.Expr)"> + <summary> + Create an expression representing an if-then-else: <c>ite(t1, t2, t3)</c>. + </summary> + <param name="t1">An expression with Boolean sort</param> + <param name="t2">An expression </param> + <param name="t3">An expression with the same sort as <paramref name="t2"/></param> + </member> + <member name="M:Microsoft.Z3.Context.MkIff(Microsoft.Z3.BoolExpr,Microsoft.Z3.BoolExpr)"> + <summary> + Create an expression representing <c>t1 iff t2</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkImplies(Microsoft.Z3.BoolExpr,Microsoft.Z3.BoolExpr)"> + <summary> + Create an expression representing <c>t1 -> t2</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkXor(Microsoft.Z3.BoolExpr,Microsoft.Z3.BoolExpr)"> + <summary> + Create an expression representing <c>t1 xor t2</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkAnd(Microsoft.Z3.BoolExpr[])"> + <summary> + Create an expression representing <c>t[0] and t[1] and ...</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkAnd(System.Collections.Generic.IEnumerable{Microsoft.Z3.BoolExpr})"> + <summary> + Create an expression representing <c>t[0] and t[1] and ...</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkOr(Microsoft.Z3.BoolExpr[])"> + <summary> + Create an expression representing <c>t[0] or t[1] or ...</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkOr(System.Collections.Generic.IEnumerable{Microsoft.Z3.BoolExpr})"> + <summary> + Create an expression representing <c>t[0] or t[1] or ...</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkAdd(Microsoft.Z3.ArithExpr[])"> + <summary> + Create an expression representing <c>t[0] + t[1] + ...</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkAdd(System.Collections.Generic.IEnumerable{Microsoft.Z3.ArithExpr})"> + <summary> + Create an expression representing <c>t[0] + t[1] + ...</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkMul(Microsoft.Z3.ArithExpr[])"> + <summary> + Create an expression representing <c>t[0] * t[1] * ...</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkMul(System.Collections.Generic.IEnumerable{Microsoft.Z3.ArithExpr})"> + <summary> + Create an expression representing <c>t[0] * t[1] * ...</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSub(Microsoft.Z3.ArithExpr[])"> + <summary> + Create an expression representing <c>t[0] - t[1] - ...</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkUnaryMinus(Microsoft.Z3.ArithExpr)"> + <summary> + Create an expression representing <c>-t</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkDiv(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> + Create an expression representing <c>t1 / t2</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkMod(Microsoft.Z3.IntExpr,Microsoft.Z3.IntExpr)"> + <summary> + Create an expression representing <c>t1 mod t2</c>. + </summary> + <remarks>The arguments must have int type.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkRem(Microsoft.Z3.IntExpr,Microsoft.Z3.IntExpr)"> + <summary> + Create an expression representing <c>t1 rem t2</c>. + </summary> + <remarks>The arguments must have int type.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkPower(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> + Create an expression representing <c>t1 ^ t2</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkLt(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> + Create an expression representing <c>t1 < t2</c> + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkLe(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> + Create an expression representing <c>t1 <= t2</c> + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkGt(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> + Create an expression representing <c>t1 > t2</c> + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkGe(Microsoft.Z3.ArithExpr,Microsoft.Z3.ArithExpr)"> + <summary> + Create an expression representing <c>t1 >= t2</c> + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkInt2Real(Microsoft.Z3.IntExpr)"> + <summary> + Coerce an integer to a real. + </summary> + <remarks> + There is also a converse operation exposed. It follows the semantics prescribed by the SMT-LIB standard. + + You can take the floor of a real by creating an auxiliary integer Term <c>k</c> and + and asserting <c>MakeInt2Real(k) <= t1 < MkInt2Real(k)+1</c>. + The argument must be of integer sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkReal2Int(Microsoft.Z3.RealExpr)"> + <summary> + Coerce a real to an integer. + </summary> + <remarks> + The semantics of this function follows the SMT-LIB standard for the function to_int. + The argument must be of real sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkIsInteger(Microsoft.Z3.RealExpr)"> + <summary> + Creates an expression that checks whether a real number is an integer. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkBVNot(Microsoft.Z3.BitVecExpr)"> + <summary> + Bitwise negation. + </summary> + <remarks>The argument must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVRedAND(Microsoft.Z3.BitVecExpr)"> + <summary> + Take conjunction of bits in a vector, return vector of length 1. + </summary> + <remarks>The argument must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVRedOR(Microsoft.Z3.BitVecExpr)"> + <summary> + Take disjunction of bits in a vector, return vector of length 1. + </summary> + <remarks>The argument must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVAND(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Bitwise conjunction. + </summary> + <remarks>The arguments must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVOR(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Bitwise disjunction. + </summary> + <remarks>The arguments must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVXOR(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Bitwise XOR. + </summary> + <remarks>The arguments must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVNAND(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Bitwise NAND. + </summary> + <remarks>The arguments must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVNOR(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Bitwise NOR. + </summary> + <remarks>The arguments must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVXNOR(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Bitwise XNOR. + </summary> + <remarks>The arguments must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVNeg(Microsoft.Z3.BitVecExpr)"> + <summary> + Standard two's complement unary minus. + </summary> + <remarks>The arguments must have a bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVAdd(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Two's complement addition. + </summary> + <remarks>The arguments must have the same bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSub(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Two's complement subtraction. + </summary> + <remarks>The arguments must have the same bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVMul(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Two's complement multiplication. + </summary> + <remarks>The arguments must have the same bit-vector sort.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVUDiv(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Unsigned division. + </summary> + <remarks> + It is defined as the floor of <c>t1/t2</c> if \c t2 is + different from zero. If <c>t2</c> is zero, then the result + is undefined. + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSDiv(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Signed division. + </summary> + <remarks> + It is defined in the following way: + + - The \c floor of <c>t1/t2</c> if \c t2 is different from zero, and <c>t1*t2 >= 0</c>. + + - The \c ceiling of <c>t1/t2</c> if \c t2 is different from zero, and <c>t1*t2 < 0</c>. + + If <c>t2</c> is zero, then the result is undefined. + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVURem(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Unsigned remainder. + </summary> + <remarks> + It is defined as <c>t1 - (t1 /u t2) * t2</c>, where <c>/u</c> represents unsigned division. + If <c>t2</c> is zero, then the result is undefined. + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSRem(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Signed remainder. + </summary> + <remarks> + It is defined as <c>t1 - (t1 /s t2) * t2</c>, where <c>/s</c> represents signed division. + The most significant bit (sign) of the result is equal to the most significant bit of \c t1. + + If <c>t2</c> is zero, then the result is undefined. + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSMod(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Two's complement signed remainder (sign follows divisor). + </summary> + <remarks> + If <c>t2</c> is zero, then the result is undefined. + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVULT(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Unsigned less-than + </summary> + <remarks> + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSLT(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Two's complement signed less-than + </summary> + <remarks> + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVULE(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Unsigned less-than or equal to. + </summary> + <remarks> + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSLE(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Two's complement signed less-than or equal to. + </summary> + <remarks> + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVUGE(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Unsigned greater than or equal to. + </summary> + <remarks> + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSGE(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Two's complement signed greater than or equal to. + </summary> + <remarks> + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVUGT(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Unsigned greater-than. + </summary> + <remarks> + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSGT(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Two's complement signed greater-than. + </summary> + <remarks> + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkConcat(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Bit-vector concatenation. + </summary> + <remarks> + The arguments must have a bit-vector sort. + </remarks> + <returns> + The result is a bit-vector of size <c>n1+n2</c>, where <c>n1</c> (<c>n2</c>) + is the size of <c>t1</c> (<c>t2</c>). + </returns> + </member> + <member name="M:Microsoft.Z3.Context.MkExtract(System.UInt32,System.UInt32,Microsoft.Z3.BitVecExpr)"> + <summary> + Bit-vector extraction. + </summary> + <remarks> + Extract the bits <paramref name="high"/> down to <paramref name="low"/> from a bitvector of + size <c>m</c> to yield a new bitvector of size <c>n</c>, where + <c>n = high - low + 1</c>. + The argument <paramref name="t"/> must have a bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkSignExt(System.UInt32,Microsoft.Z3.BitVecExpr)"> + <summary> + Bit-vector sign extension. + </summary> + <remarks> + Sign-extends the given bit-vector to the (signed) equivalent bitvector of + size <c>m+i</c>, where \c m is the size of the given bit-vector. + The argument <paramref name="t"/> must have a bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkZeroExt(System.UInt32,Microsoft.Z3.BitVecExpr)"> + <summary> + Bit-vector zero extension. + </summary> + <remarks> + Extend the given bit-vector with zeros to the (unsigned) equivalent + bitvector of size <c>m+i</c>, where \c m is the size of the + given bit-vector. + The argument <paramref name="t"/> must have a bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkRepeat(System.UInt32,Microsoft.Z3.BitVecExpr)"> + <summary> + Bit-vector repetition. + </summary> + <remarks> + The argument <paramref name="t"/> must have a bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSHL(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Shift left. + </summary> + <remarks> + It is equivalent to multiplication by <c>2^x</c> where \c x is the value of <paramref name="t2"/>. + + NB. The semantics of shift operations varies between environments. This + definition does not necessarily capture directly the semantics of the + programming language or assembly architecture you are modeling. + + The arguments must have a bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVLSHR(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Logical shift right + </summary> + <remarks> + It is equivalent to unsigned division by <c>2^x</c> where \c x is the value of <paramref name="t2"/>. + + NB. The semantics of shift operations varies between environments. This + definition does not necessarily capture directly the semantics of the + programming language or assembly architecture you are modeling. + + The arguments must have a bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVASHR(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Arithmetic shift right + </summary> + <remarks> + It is like logical shift right except that the most significant + bits of the result always copy the most significant bit of the + second argument. + + NB. The semantics of shift operations varies between environments. This + definition does not necessarily capture directly the semantics of the + programming language or assembly architecture you are modeling. + + The arguments must have a bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVRotateLeft(System.UInt32,Microsoft.Z3.BitVecExpr)"> + <summary> + Rotate Left. + </summary> + <remarks> + Rotate bits of \c t to the left \c i times. + The argument <paramref name="t"/> must have a bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVRotateRight(System.UInt32,Microsoft.Z3.BitVecExpr)"> + <summary> + Rotate Right. + </summary> + <remarks> + Rotate bits of \c t to the right \c i times. + The argument <paramref name="t"/> must have a bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVRotateLeft(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Rotate Left. + </summary> + <remarks> + Rotate bits of <paramref name="t1"/> to the left <paramref name="t2"/> times. + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVRotateRight(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Rotate Right. + </summary> + <remarks> + Rotate bits of <paramref name="t1"/> to the right<paramref name="t2"/> times. + The arguments must have the same bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkInt2BV(System.UInt32,Microsoft.Z3.IntExpr)"> + <summary> + Create an <paramref name="n"/> bit bit-vector from the integer argument <paramref name="t"/>. + </summary> + <remarks> + NB. This function is essentially treated as uninterpreted. + So you cannot expect Z3 to precisely reflect the semantics of this function + when solving constraints with this function. + + The argument must be of integer sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBV2Int(Microsoft.Z3.BitVecExpr,System.Boolean)"> + <summary> + Create an integer from the bit-vector argument <paramref name="t"/>. + </summary> + <remarks> + If \c is_signed is false, then the bit-vector \c t1 is treated as unsigned. + So the result is non-negative and in the range <c>[0..2^N-1]</c>, where + N are the number of bits in <paramref name="t"/>. + If \c is_signed is true, \c t1 is treated as a signed bit-vector. + + NB. This function is essentially treated as uninterpreted. + So you cannot expect Z3 to precisely reflect the semantics of this function + when solving constraints with this function. + + The argument must be of bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVAddNoOverflow(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr,System.Boolean)"> + <summary> + Create a predicate that checks that the bit-wise addition does not overflow. + </summary> + <remarks> + The arguments must be of bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVAddNoUnderflow(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Create a predicate that checks that the bit-wise addition does not underflow. + </summary> + <remarks> + The arguments must be of bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSubNoOverflow(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Create a predicate that checks that the bit-wise subtraction does not overflow. + </summary> + <remarks> + The arguments must be of bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSubNoUnderflow(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr,System.Boolean)"> + <summary> + Create a predicate that checks that the bit-wise subtraction does not underflow. + </summary> + <remarks> + The arguments must be of bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVSDivNoOverflow(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Create a predicate that checks that the bit-wise signed division does not overflow. + </summary> + <remarks> + The arguments must be of bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVNegNoOverflow(Microsoft.Z3.BitVecExpr)"> + <summary> + Create a predicate that checks that the bit-wise negation does not overflow. + </summary> + <remarks> + The arguments must be of bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVMulNoOverflow(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr,System.Boolean)"> + <summary> + Create a predicate that checks that the bit-wise multiplication does not overflow. + </summary> + <remarks> + The arguments must be of bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkBVMulNoUnderflow(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Create a predicate that checks that the bit-wise multiplication does not underflow. + </summary> + <remarks> + The arguments must be of bit-vector sort. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkArrayConst(Microsoft.Z3.Symbol,Microsoft.Z3.Sort,Microsoft.Z3.Sort)"> + <summary> + Create an array constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkArrayConst(System.String,Microsoft.Z3.Sort,Microsoft.Z3.Sort)"> + <summary> + Create an array constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSelect(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr)"> + <summary> + Array read. + </summary> + <remarks> + The argument <c>a</c> is the array and <c>i</c> is the index + of the array that gets read. + + The node <c>a</c> must have an array sort <c>[domain -> range]</c>, + and <c>i</c> must have the sort <c>domain</c>. + The sort of the result is <c>range</c>. + <seealso cref="M:Microsoft.Z3.Context.MkArraySort(Microsoft.Z3.Sort,Microsoft.Z3.Sort)"/> + <seealso cref="M:Microsoft.Z3.Context.MkStore(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr,Microsoft.Z3.Expr)"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkSelect(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr[])"> + <summary> + Array read. + </summary> + <remarks> + The argument <c>a</c> is the array and <c>args</c> are the indices + of the array that gets read. + + The node <c>a</c> must have an array sort <c>[domain1,..,domaink -> range]</c>, + and <c>args</c> must have the sort <c>domain1,..,domaink</c>. + The sort of the result is <c>range</c>. + <seealso cref="M:Microsoft.Z3.Context.MkArraySort(Microsoft.Z3.Sort,Microsoft.Z3.Sort)"/> + <seealso cref="M:Microsoft.Z3.Context.MkStore(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr,Microsoft.Z3.Expr)"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkStore(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr,Microsoft.Z3.Expr)"> + <summary> + Array update. + </summary> + <remarks> + The node <c>a</c> must have an array sort <c>[domain -> range]</c>, + <c>i</c> must have sort <c>domain</c>, + <c>v</c> must have sort range. The sort of the result is <c>[domain -> range]</c>. + The semantics of this function is given by the theory of arrays described in the SMT-LIB + standard. See http://smtlib.org for more details. + The result of this function is an array that is equal to <c>a</c> + (with respect to <c>select</c>) + on all indices except for <c>i</c>, where it maps to <c>v</c> + (and the <c>select</c> of <c>a</c> with + respect to <c>i</c> may be a different value). + <seealso cref="M:Microsoft.Z3.Context.MkArraySort(Microsoft.Z3.Sort,Microsoft.Z3.Sort)"/> + <seealso cref="M:Microsoft.Z3.Context.MkSelect(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr)"/> + <seealso cref="M:Microsoft.Z3.Context.MkSelect(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr[])"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkStore(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr[],Microsoft.Z3.Expr)"> + <summary> + Array update. + </summary> + <remarks> + The node <c>a</c> must have an array sort <c>[domain1,..,domaink -> range]</c>, + <c>args</c> must have sort <c>domain1,..,domaink</c>, + <c>v</c> must have sort range. The sort of the result is <c>[domain -> range]</c>. + The semantics of this function is given by the theory of arrays described in the SMT-LIB + standard. See http://smtlib.org for more details. + The result of this function is an array that is equal to <c>a</c> + (with respect to <c>select</c>) + on all indices except for <c>args</c>, where it maps to <c>v</c> + (and the <c>select</c> of <c>a</c> with + respect to <c>args</c> may be a different value). + <seealso cref="M:Microsoft.Z3.Context.MkArraySort(Microsoft.Z3.Sort,Microsoft.Z3.Sort)"/> + <seealso cref="M:Microsoft.Z3.Context.MkSelect(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr)"/> + <seealso cref="M:Microsoft.Z3.Context.MkSelect(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr[])"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkConstArray(Microsoft.Z3.Sort,Microsoft.Z3.Expr)"> + <summary> + Create a constant array. + </summary> + <remarks> + The resulting term is an array, such that a <c>select</c>on an arbitrary index + produces the value <c>v</c>. + <seealso cref="M:Microsoft.Z3.Context.MkArraySort(Microsoft.Z3.Sort,Microsoft.Z3.Sort)"/> + <seealso cref="M:Microsoft.Z3.Context.MkSelect(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr)"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkMap(Microsoft.Z3.FuncDecl,Microsoft.Z3.ArrayExpr[])"> + <summary> + Maps f on the argument arrays. + </summary> + <remarks> + Eeach element of <c>args</c> must be of an array sort <c>[domain_i -> range_i]</c>. + The function declaration <c>f</c> must have type <c> range_1 .. range_n -> range</c>. + <c>v</c> must have sort range. The sort of the result is <c>[domain_i -> range]</c>. + <seealso cref="M:Microsoft.Z3.Context.MkArraySort(Microsoft.Z3.Sort,Microsoft.Z3.Sort)"/> + <seealso cref="M:Microsoft.Z3.Context.MkSelect(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr)"/> + <seealso cref="M:Microsoft.Z3.Context.MkStore(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr,Microsoft.Z3.Expr)"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkTermArray(Microsoft.Z3.ArrayExpr)"> + <summary> + Access the array default value. + </summary> + <remarks> + Produces the default range value, for arrays that can be represented as + finite maps with a default range value. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkArrayExt(Microsoft.Z3.ArrayExpr,Microsoft.Z3.ArrayExpr)"> + <summary> + Create Extentionality index. Two arrays are equal if and only if they are equal on the index returned by MkArrayExt. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSetSort(Microsoft.Z3.Sort)"> + <summary> + Create a set type. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkEmptySet(Microsoft.Z3.Sort)"> + <summary> + Create an empty set. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFullSet(Microsoft.Z3.Sort)"> + <summary> + Create the full set. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSetAdd(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr)"> + <summary> + Add an element to the set. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSetDel(Microsoft.Z3.ArrayExpr,Microsoft.Z3.Expr)"> + <summary> + Remove an element from a set. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSetUnion(Microsoft.Z3.ArrayExpr[])"> + <summary> + Take the union of a list of sets. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSetIntersection(Microsoft.Z3.ArrayExpr[])"> + <summary> + Take the intersection of a list of sets. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSetDifference(Microsoft.Z3.ArrayExpr,Microsoft.Z3.ArrayExpr)"> + <summary> + Take the difference between two sets. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSetComplement(Microsoft.Z3.ArrayExpr)"> + <summary> + Take the complement of a set. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSetMembership(Microsoft.Z3.Expr,Microsoft.Z3.ArrayExpr)"> + <summary> + Check for set membership. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSetSubset(Microsoft.Z3.ArrayExpr,Microsoft.Z3.ArrayExpr)"> + <summary> + Check for subsetness of sets. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkEmptySeq(Microsoft.Z3.Sort)"> + <summary> + Create the empty sequence. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkUnit(Microsoft.Z3.Expr)"> + <summary> + Create the singleton sequence. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkString(System.String)"> + <summary> + Create a string constant. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.IntToString(Microsoft.Z3.Expr)"> + <summary> + Convert an integer expression to a string. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.StringToInt(Microsoft.Z3.Expr)"> + <summary> + Convert an integer expression to a string. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkConcat(Microsoft.Z3.SeqExpr[])"> + <summary> + Concatentate sequences. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkLength(Microsoft.Z3.SeqExpr)"> + <summary> + Retrieve the length of a given sequence. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkPrefixOf(Microsoft.Z3.SeqExpr,Microsoft.Z3.SeqExpr)"> + <summary> + Check for sequence prefix. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSuffixOf(Microsoft.Z3.SeqExpr,Microsoft.Z3.SeqExpr)"> + <summary> + Check for sequence suffix. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkContains(Microsoft.Z3.SeqExpr,Microsoft.Z3.SeqExpr)"> + <summary> + Check for sequence containment of s2 in s1. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkAt(Microsoft.Z3.SeqExpr,Microsoft.Z3.IntExpr)"> + <summary> + Retrieve sequence of length one at index. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkExtract(Microsoft.Z3.SeqExpr,Microsoft.Z3.IntExpr,Microsoft.Z3.IntExpr)"> + <summary> + Extract subsequence. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkIndexOf(Microsoft.Z3.SeqExpr,Microsoft.Z3.SeqExpr,Microsoft.Z3.ArithExpr)"> + <summary> + Extract index of sub-string starting at offset. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkReplace(Microsoft.Z3.SeqExpr,Microsoft.Z3.SeqExpr,Microsoft.Z3.SeqExpr)"> + <summary> + Replace the first occurrence of src by dst in s. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkToRe(Microsoft.Z3.SeqExpr)"> + <summary> + Convert a regular expression that accepts sequence s. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkInRe(Microsoft.Z3.SeqExpr,Microsoft.Z3.ReExpr)"> + <summary> + Check for regular expression membership. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkStar(Microsoft.Z3.ReExpr)"> + <summary> + Take the Kleene star of a regular expression. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkLoop(Microsoft.Z3.ReExpr,System.UInt32,System.UInt32)"> + <summary> + Take the bounded Kleene star of a regular expression. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkPlus(Microsoft.Z3.ReExpr)"> + <summary> + Take the Kleene plus of a regular expression. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkOption(Microsoft.Z3.ReExpr)"> + <summary> + Create the optional regular expression. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkComplement(Microsoft.Z3.ReExpr)"> + <summary> + Create the complement regular expression. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkConcat(Microsoft.Z3.ReExpr[])"> + <summary> + Create the concatenation of regular languages. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkUnion(Microsoft.Z3.ReExpr[])"> + <summary> + Create the union of regular languages. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkIntersect(Microsoft.Z3.ReExpr[])"> + <summary> + Create the intersection of regular languages. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkEmptyRe(Microsoft.Z3.Sort)"> + <summary> + Create the empty regular expression. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFullRe(Microsoft.Z3.Sort)"> + <summary> + Create the full regular expression. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkRange(Microsoft.Z3.SeqExpr,Microsoft.Z3.SeqExpr)"> + <summary> + Create a range expression. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkAtMost(Microsoft.Z3.BoolExpr[],System.UInt32)"> + <summary> + Create an at-most-k constraint. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkAtLeast(Microsoft.Z3.BoolExpr[],System.UInt32)"> + <summary> + Create an at-least-k constraint. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkPBLe(System.Int32[],Microsoft.Z3.BoolExpr[],System.Int32)"> + <summary> + Create a pseudo-Boolean less-or-equal constraint. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkPBGe(System.Int32[],Microsoft.Z3.BoolExpr[],System.Int32)"> + <summary> + Create a pseudo-Boolean greater-or-equal constraint. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkPBEq(System.Int32[],Microsoft.Z3.BoolExpr[],System.Int32)"> + <summary> + Create a pseudo-Boolean equal constraint. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkNumeral(System.String,Microsoft.Z3.Sort)"> + <summary> + Create a Term of a given sort. + </summary> + <param name="v">A string representing the Term value in decimal notation. If the given sort is a real, then the Term can be a rational, that is, a string of the form <c>[num]* / [num]*</c>.</param> + <param name="ty">The sort of the numeral. In the current implementation, the given sort can be an int, real, or bit-vectors of arbitrary size. </param> + <returns>A Term with value <paramref name="v"/> and sort <paramref name="ty"/> </returns> + </member> + <member name="M:Microsoft.Z3.Context.MkNumeral(System.Int32,Microsoft.Z3.Sort)"> + <summary> + Create a Term of a given sort. This function can be use to create numerals that fit in a machine integer. + It is slightly faster than <c>MakeNumeral</c> since it is not necessary to parse a string. + </summary> + <param name="v">Value of the numeral</param> + <param name="ty">Sort of the numeral</param> + <returns>A Term with value <paramref name="v"/> and type <paramref name="ty"/></returns> + </member> + <member name="M:Microsoft.Z3.Context.MkNumeral(System.UInt32,Microsoft.Z3.Sort)"> + <summary> + Create a Term of a given sort. This function can be use to create numerals that fit in a machine integer. + It is slightly faster than <c>MakeNumeral</c> since it is not necessary to parse a string. + </summary> + <param name="v">Value of the numeral</param> + <param name="ty">Sort of the numeral</param> + <returns>A Term with value <paramref name="v"/> and type <paramref name="ty"/></returns> + </member> + <member name="M:Microsoft.Z3.Context.MkNumeral(System.Int64,Microsoft.Z3.Sort)"> + <summary> + Create a Term of a given sort. This function can be use to create numerals that fit in a machine integer. + It is slightly faster than <c>MakeNumeral</c> since it is not necessary to parse a string. + </summary> + <param name="v">Value of the numeral</param> + <param name="ty">Sort of the numeral</param> + <returns>A Term with value <paramref name="v"/> and type <paramref name="ty"/></returns> + </member> + <member name="M:Microsoft.Z3.Context.MkNumeral(System.UInt64,Microsoft.Z3.Sort)"> + <summary> + Create a Term of a given sort. This function can be use to create numerals that fit in a machine integer. + It is slightly faster than <c>MakeNumeral</c> since it is not necessary to parse a string. + </summary> + <param name="v">Value of the numeral</param> + <param name="ty">Sort of the numeral</param> + <returns>A Term with value <paramref name="v"/> and type <paramref name="ty"/></returns> + </member> + <member name="M:Microsoft.Z3.Context.MkReal(System.Int32,System.Int32)"> + <summary> + Create a real from a fraction. + </summary> + <param name="num">numerator of rational.</param> + <param name="den">denominator of rational.</param> + <returns>A Term with value <paramref name="num"/>/<paramref name="den"/> and sort Real</returns> + <seealso cref="M:Microsoft.Z3.Context.MkNumeral(System.String,Microsoft.Z3.Sort)"/> + </member> + <member name="M:Microsoft.Z3.Context.MkReal(System.String)"> + <summary> + Create a real numeral. + </summary> + <param name="v">A string representing the Term value in decimal notation.</param> + <returns>A Term with value <paramref name="v"/> and sort Real</returns> + </member> + <member name="M:Microsoft.Z3.Context.MkReal(System.Int32)"> + <summary> + Create a real numeral. + </summary> + <param name="v">value of the numeral.</param> + <returns>A Term with value <paramref name="v"/> and sort Real</returns> + </member> + <member name="M:Microsoft.Z3.Context.MkReal(System.UInt32)"> + <summary> + Create a real numeral. + </summary> + <param name="v">value of the numeral.</param> + <returns>A Term with value <paramref name="v"/> and sort Real</returns> + </member> + <member name="M:Microsoft.Z3.Context.MkReal(System.Int64)"> + <summary> + Create a real numeral. + </summary> + <param name="v">value of the numeral.</param> + <returns>A Term with value <paramref name="v"/> and sort Real</returns> + </member> + <member name="M:Microsoft.Z3.Context.MkReal(System.UInt64)"> + <summary> + Create a real numeral. + </summary> + <param name="v">value of the numeral.</param> + <returns>A Term with value <paramref name="v"/> and sort Real</returns> + </member> + <member name="M:Microsoft.Z3.Context.MkInt(System.String)"> + <summary> + Create an integer numeral. + </summary> + <param name="v">A string representing the Term value in decimal notation.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkInt(System.Int32)"> + <summary> + Create an integer numeral. + </summary> + <param name="v">value of the numeral.</param> + <returns>A Term with value <paramref name="v"/> and sort Integer</returns> + </member> + <member name="M:Microsoft.Z3.Context.MkInt(System.UInt32)"> + <summary> + Create an integer numeral. + </summary> + <param name="v">value of the numeral.</param> + <returns>A Term with value <paramref name="v"/> and sort Integer</returns> + </member> + <member name="M:Microsoft.Z3.Context.MkInt(System.Int64)"> + <summary> + Create an integer numeral. + </summary> + <param name="v">value of the numeral.</param> + <returns>A Term with value <paramref name="v"/> and sort Integer</returns> + </member> + <member name="M:Microsoft.Z3.Context.MkInt(System.UInt64)"> + <summary> + Create an integer numeral. + </summary> + <param name="v">value of the numeral.</param> + <returns>A Term with value <paramref name="v"/> and sort Integer</returns> + </member> + <member name="M:Microsoft.Z3.Context.MkBV(System.String,System.UInt32)"> + <summary> + Create a bit-vector numeral. + </summary> + <param name="v">A string representing the value in decimal notation.</param> + <param name="size">the size of the bit-vector</param> + </member> + <member name="M:Microsoft.Z3.Context.MkBV(System.Int32,System.UInt32)"> + <summary> + Create a bit-vector numeral. + </summary> + <param name="v">value of the numeral.</param> + <param name="size">the size of the bit-vector</param> + </member> + <member name="M:Microsoft.Z3.Context.MkBV(System.UInt32,System.UInt32)"> + <summary> + Create a bit-vector numeral. + </summary> + <param name="v">value of the numeral.</param> + <param name="size">the size of the bit-vector</param> + </member> + <member name="M:Microsoft.Z3.Context.MkBV(System.Int64,System.UInt32)"> + <summary> + Create a bit-vector numeral. + </summary> + <param name="v">value of the numeral.</param> + <param name="size">the size of the bit-vector</param> + </member> + <member name="M:Microsoft.Z3.Context.MkBV(System.UInt64,System.UInt32)"> + <summary> + Create a bit-vector numeral. + </summary> + <param name="v">value of the numeral.</param> + <param name="size">the size of the bit-vector</param> + </member> + <member name="M:Microsoft.Z3.Context.MkBV(System.Boolean[])"> + <summary> + Create a bit-vector numeral. + </summary> + <param name="bits">An array of bits representing the bit-vector. Least signficant bit is at position 0.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkForall(Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Create a universal Quantifier. + </summary> + <remarks> + Creates a forall formula, where <paramref name="weight"/> is the weight, + <paramref name="patterns"/> is an array of patterns, <paramref name="sorts"/> is an array + with the sorts of the bound variables, <paramref name="names"/> is an array with the + 'names' of the bound variables, and <paramref name="body"/> is the body of the + quantifier. Quantifiers are associated with weights indicating the importance of + using the quantifier during instantiation. + Note that the bound variables are de-Bruijn indices created using <see cref="M:Microsoft.Z3.Context.MkBound(System.UInt32,Microsoft.Z3.Sort)"/>. + Z3 applies the convention that the last element in <paramref name="names"/> and + <paramref name="sorts"/> refers to the variable with index 0, the second to last element + of <paramref name="names"/> and <paramref name="sorts"/> refers to the variable + with index 1, etc. + </remarks> + <param name="sorts">the sorts of the bound variables.</param> + <param name="names">names of the bound variables</param> + <param name="body">the body of the quantifier.</param> + <param name="weight">quantifiers are associated with weights indicating the importance of using the quantifier during instantiation. By default, pass the weight 0.</param> + <param name="patterns">array containing the patterns created using <c>MkPattern</c>.</param> + <param name="noPatterns">array containing the anti-patterns created using <c>MkPattern</c>.</param> + <param name="quantifierID">optional symbol to track quantifier.</param> + <param name="skolemID">optional symbol to track skolem constants.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkForall(Microsoft.Z3.Expr[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Create a universal Quantifier. + </summary> + <remarks> + Creates a universal quantifier using a list of constants that will + form the set of bound variables. + <seealso cref="M:Microsoft.Z3.Context.MkForall(Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkExists(Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Create an existential Quantifier. + </summary> + <remarks> + Creates an existential quantifier using de-Brujin indexed variables. + (<see cref="M:Microsoft.Z3.Context.MkForall(Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"/>). + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkExists(Microsoft.Z3.Expr[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Create an existential Quantifier. + </summary> + <remarks> + Creates an existential quantifier using a list of constants that will + form the set of bound variables. + <seealso cref="M:Microsoft.Z3.Context.MkForall(Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkQuantifier(System.Boolean,Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Create a Quantifier. + </summary> + <see cref="M:Microsoft.Z3.Context.MkForall(Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"/> + </member> + <member name="M:Microsoft.Z3.Context.MkQuantifier(System.Boolean,Microsoft.Z3.Expr[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Create a Quantifier. + </summary> + <see cref="M:Microsoft.Z3.Context.MkForall(Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.Expr,System.UInt32,Microsoft.Z3.Pattern[],Microsoft.Z3.Expr[],Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"/> + </member> + <member name="M:Microsoft.Z3.Context.ParseSMTLIB2String(System.String,Microsoft.Z3.Symbol[],Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.FuncDecl[])"> + <summary> + Parse the given string using the SMT-LIB2 parser. + </summary> + <returns>A conjunction of assertions in the scope (up to push/pop) at the end of the string.</returns> + </member> + <member name="M:Microsoft.Z3.Context.ParseSMTLIB2File(System.String,Microsoft.Z3.Symbol[],Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.FuncDecl[])"> + <summary> + Parse the given file using the SMT-LIB2 parser. + </summary> + <seealso cref="M:Microsoft.Z3.Context.ParseSMTLIB2String(System.String,Microsoft.Z3.Symbol[],Microsoft.Z3.Sort[],Microsoft.Z3.Symbol[],Microsoft.Z3.FuncDecl[])"/> + </member> + <member name="M:Microsoft.Z3.Context.MkGoal(System.Boolean,System.Boolean,System.Boolean)"> + <summary> + Creates a new Goal. + </summary> + <remarks> + Note that the Context must have been created with proof generation support if + <paramref name="proofs"/> is set to true here. + </remarks> + <param name="models">Indicates whether model generation should be enabled.</param> + <param name="unsatCores">Indicates whether unsat core generation should be enabled.</param> + <param name="proofs">Indicates whether proof generation should be enabled.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkParams"> + <summary> + Creates a new ParameterSet. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.TacticDescription(System.String)"> + <summary> + Returns a string containing a description of the tactic with the given name. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkTactic(System.String)"> + <summary> + Creates a new Tactic. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.AndThen(Microsoft.Z3.Tactic,Microsoft.Z3.Tactic,Microsoft.Z3.Tactic[])"> + <summary> + Create a tactic that applies <paramref name="t1"/> to a Goal and + then <paramref name="t2"/> to every subgoal produced by <paramref name="t1"/>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Then(Microsoft.Z3.Tactic,Microsoft.Z3.Tactic,Microsoft.Z3.Tactic[])"> + <summary> + Create a tactic that applies <paramref name="t1"/> to a Goal and + then <paramref name="t2"/> to every subgoal produced by <paramref name="t1"/>. + </summary> + <remarks> + Shorthand for <c>AndThen</c>. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.OrElse(Microsoft.Z3.Tactic,Microsoft.Z3.Tactic)"> + <summary> + Create a tactic that first applies <paramref name="t1"/> to a Goal and + if it fails then returns the result of <paramref name="t2"/> applied to the Goal. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.TryFor(Microsoft.Z3.Tactic,System.UInt32)"> + <summary> + Create a tactic that applies <paramref name="t"/> to a goal for <paramref name="ms"/> milliseconds. + </summary> + <remarks> + If <paramref name="t"/> does not terminate within <paramref name="ms"/> milliseconds, then it fails. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.When(Microsoft.Z3.Probe,Microsoft.Z3.Tactic)"> + <summary> + Create a tactic that applies <paramref name="t"/> to a given goal if the probe + <paramref name="p"/> evaluates to true. + </summary> + <remarks> + If <paramref name="p"/> evaluates to false, then the new tactic behaves like the <c>skip</c> tactic. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.Cond(Microsoft.Z3.Probe,Microsoft.Z3.Tactic,Microsoft.Z3.Tactic)"> + <summary> + Create a tactic that applies <paramref name="t1"/> to a given goal if the probe + <paramref name="p"/> evaluates to true and <paramref name="t2"/> otherwise. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Repeat(Microsoft.Z3.Tactic,System.UInt32)"> + <summary> + Create a tactic that keeps applying <paramref name="t"/> until the goal is not + modified anymore or the maximum number of iterations <paramref name="max"/> is reached. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Skip"> + <summary> + Create a tactic that just returns the given goal. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Fail"> + <summary> + Create a tactic always fails. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.FailIf(Microsoft.Z3.Probe)"> + <summary> + Create a tactic that fails if the probe <paramref name="p"/> evaluates to false. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.FailIfNotDecided"> + <summary> + Create a tactic that fails if the goal is not triviall satisfiable (i.e., empty) + or trivially unsatisfiable (i.e., contains `false'). + </summary> + </member> + <member name="M:Microsoft.Z3.Context.UsingParams(Microsoft.Z3.Tactic,Microsoft.Z3.Params)"> + <summary> + Create a tactic that applies <paramref name="t"/> using the given set of parameters <paramref name="p"/>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.With(Microsoft.Z3.Tactic,Microsoft.Z3.Params)"> + <summary> + Create a tactic that applies <paramref name="t"/> using the given set of parameters <paramref name="p"/>. + </summary> + <remarks>Alias for <c>UsingParams</c></remarks> + </member> + <member name="M:Microsoft.Z3.Context.ParOr(Microsoft.Z3.Tactic[])"> + <summary> + Create a tactic that applies the given tactics in parallel until one of them succeeds (i.e., the first that doesn't fail). + </summary> + </member> + <member name="M:Microsoft.Z3.Context.ParAndThen(Microsoft.Z3.Tactic,Microsoft.Z3.Tactic)"> + <summary> + Create a tactic that applies <paramref name="t1"/> to a given goal and then <paramref name="t2"/> + to every subgoal produced by <paramref name="t1"/>. The subgoals are processed in parallel. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Interrupt"> + <summary> + Interrupt the execution of a Z3 procedure. + </summary> + <remarks>This procedure can be used to interrupt: solvers, simplifiers and tactics.</remarks> + </member> + <member name="M:Microsoft.Z3.Context.ProbeDescription(System.String)"> + <summary> + Returns a string containing a description of the probe with the given name. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkProbe(System.String)"> + <summary> + Creates a new Probe. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.ConstProbe(System.Double)"> + <summary> + Create a probe that always evaluates to <paramref name="val"/>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Lt(Microsoft.Z3.Probe,Microsoft.Z3.Probe)"> + <summary> + Create a probe that evaluates to "true" when the value returned by <paramref name="p1"/> + is less than the value returned by <paramref name="p2"/> + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Gt(Microsoft.Z3.Probe,Microsoft.Z3.Probe)"> + <summary> + Create a probe that evaluates to "true" when the value returned by <paramref name="p1"/> + is greater than the value returned by <paramref name="p2"/> + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Le(Microsoft.Z3.Probe,Microsoft.Z3.Probe)"> + <summary> + Create a probe that evaluates to "true" when the value returned by <paramref name="p1"/> + is less than or equal the value returned by <paramref name="p2"/> + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Ge(Microsoft.Z3.Probe,Microsoft.Z3.Probe)"> + <summary> + Create a probe that evaluates to "true" when the value returned by <paramref name="p1"/> + is greater than or equal the value returned by <paramref name="p2"/> + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Eq(Microsoft.Z3.Probe,Microsoft.Z3.Probe)"> + <summary> + Create a probe that evaluates to "true" when the value returned by <paramref name="p1"/> + is equal to the value returned by <paramref name="p2"/> + </summary> + </member> + <member name="M:Microsoft.Z3.Context.And(Microsoft.Z3.Probe,Microsoft.Z3.Probe)"> + <summary> + Create a probe that evaluates to "true" when the value <paramref name="p1"/> + and <paramref name="p2"/> evaluate to "true". + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Or(Microsoft.Z3.Probe,Microsoft.Z3.Probe)"> + <summary> + Create a probe that evaluates to "true" when the value <paramref name="p1"/> + or <paramref name="p2"/> evaluate to "true". + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Not(Microsoft.Z3.Probe)"> + <summary> + Create a probe that evaluates to "true" when the value <paramref name="p"/> + does not evaluate to "true". + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSolver(Microsoft.Z3.Symbol)"> + <summary> + Creates a new (incremental) solver. + </summary> + <remarks> + This solver also uses a set of builtin tactics for handling the first + check-sat command, and check-sat commands that take more than a given + number of milliseconds to be solved. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkSolver(System.String)"> + <summary> + Creates a new (incremental) solver. + </summary> + <seealso cref="M:Microsoft.Z3.Context.MkSolver(Microsoft.Z3.Symbol)"/> + </member> + <member name="M:Microsoft.Z3.Context.MkSimpleSolver"> + <summary> + Creates a new (incremental) solver. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkSolver(Microsoft.Z3.Tactic)"> + <summary> + Creates a solver that is implemented using the given tactic. + </summary> + <remarks> + The solver supports the commands <c>Push</c> and <c>Pop</c>, but it + will always solve each check from scratch. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.MkFixedpoint"> + <summary> + Create a Fixedpoint context. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkOptimize"> + <summary> + Create an Optimization context. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRoundingModeSort"> + <summary> + Create the floating-point RoundingMode sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRoundNearestTiesToEven"> + <summary> + Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRNE"> + <summary> + Create a numeral of RoundingMode sort which represents the NearestTiesToEven rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRoundNearestTiesToAway"> + <summary> + Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRNA"> + <summary> + Create a numeral of RoundingMode sort which represents the NearestTiesToAway rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRoundTowardPositive"> + <summary> + Create a numeral of RoundingMode sort which represents the RoundTowardPositive rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRTP"> + <summary> + Create a numeral of RoundingMode sort which represents the RoundTowardPositive rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRoundTowardNegative"> + <summary> + Create a numeral of RoundingMode sort which represents the RoundTowardNegative rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRTN"> + <summary> + Create a numeral of RoundingMode sort which represents the RoundTowardNegative rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRoundTowardZero"> + <summary> + Create a numeral of RoundingMode sort which represents the RoundTowardZero rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRTZ"> + <summary> + Create a numeral of RoundingMode sort which represents the RoundTowardZero rounding mode. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSort(System.UInt32,System.UInt32)"> + <summary> + Create a FloatingPoint sort. + </summary> + <param name="ebits">exponent bits in the FloatingPoint sort.</param> + <param name="sbits">significand bits in the FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSortHalf"> + <summary> + Create the half-precision (16-bit) FloatingPoint sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSort16"> + <summary> + Create the half-precision (16-bit) FloatingPoint sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSortSingle"> + <summary> + Create the single-precision (32-bit) FloatingPoint sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSort32"> + <summary> + Create the single-precision (32-bit) FloatingPoint sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSortDouble"> + <summary> + Create the double-precision (64-bit) FloatingPoint sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSort64"> + <summary> + Create the double-precision (64-bit) FloatingPoint sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSortQuadruple"> + <summary> + Create the quadruple-precision (128-bit) FloatingPoint sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSort128"> + <summary> + Create the quadruple-precision (128-bit) FloatingPoint sort. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.MkFPNaN(Microsoft.Z3.FPSort)"> + <summary> + Create a NaN of sort s. + </summary> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPInf(Microsoft.Z3.FPSort,System.Boolean)"> + <summary> + Create a floating-point infinity of sort s. + </summary> + <param name="s">FloatingPoint sort.</param> + <param name="negative">indicates whether the result should be negative.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPZero(Microsoft.Z3.FPSort,System.Boolean)"> + <summary> + Create a floating-point zero of sort s. + </summary> + <param name="s">FloatingPoint sort.</param> + <param name="negative">indicates whether the result should be negative.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPNumeral(System.Single,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from a float. + </summary> + <param name="v">numeral value.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPNumeral(System.Double,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from a float. + </summary> + <param name="v">numeral value.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPNumeral(System.Int32,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from an int. + </summary> + <param name="v">numeral value.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPNumeral(System.Boolean,System.UInt32,System.Int32,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from a sign bit and two integers. + </summary> + <param name="sgn">the sign.</param> + <param name="sig">the significand.</param> + <param name="exp">the exponent.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPNumeral(System.Boolean,System.Int64,System.UInt64,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from a sign bit and two 64-bit integers. + </summary> + <param name="sgn">the sign.</param> + <param name="sig">the significand.</param> + <param name="exp">the exponent.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFP(System.Single,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from a float. + </summary> + <param name="v">numeral value.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFP(System.Double,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from a float. + </summary> + <param name="v">numeral value.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFP(System.Int32,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from an int. + </summary> + <param name="v">numeral value.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFP(System.Boolean,System.Int32,System.UInt32,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from a sign bit and two integers. + </summary> + <param name="sgn">the sign.</param> + <param name="exp">the exponent.</param> + <param name="sig">the significand.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFP(System.Boolean,System.Int64,System.UInt64,Microsoft.Z3.FPSort)"> + <summary> + Create a numeral of FloatingPoint sort from a sign bit and two 64-bit integers. + </summary> + <param name="sgn">the sign.</param> + <param name="exp">the exponent.</param> + <param name="sig">the significand.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPAbs(Microsoft.Z3.FPExpr)"> + <summary> + Floating-point absolute value + </summary> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPNeg(Microsoft.Z3.FPExpr)"> + <summary> + Floating-point negation + </summary> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPAdd(Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point addition + </summary> + <param name="rm">rounding mode term</param> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSub(Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point subtraction + </summary> + <param name="rm">rounding mode term</param> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPMul(Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point multiplication + </summary> + <param name="rm">rounding mode term</param> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPDiv(Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point division + </summary> + <param name="rm">rounding mode term</param> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPFMA(Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point fused multiply-add + </summary> + <remarks> + The result is round((t1 * t2) + t3) + </remarks> + <param name="rm">rounding mode term</param> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + <param name="t3">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPSqrt(Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point square root + </summary> + <param name="rm">rounding mode term</param> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRem(Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point remainder + </summary> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPRoundToIntegral(Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point roundToIntegral. Rounds a floating-point number to + the closest integer, again represented as a floating-point number. + </summary> + <param name="rm">term of RoundingMode sort</param> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPMin(Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Minimum of floating-point numbers. + </summary> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPMax(Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Maximum of floating-point numbers. + </summary> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPLEq(Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point less than or equal. + </summary> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPLt(Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point less than. + </summary> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPGEq(Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point greater than or equal. + </summary> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPGt(Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point greater than. + </summary> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPEq(Microsoft.Z3.FPExpr,Microsoft.Z3.FPExpr)"> + <summary> + Floating-point equality. + </summary> + <remarks> + Note that this is IEEE 754 equality (as opposed to standard =). + </remarks> + <param name="t1">floating-point term</param> + <param name="t2">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPIsNormal(Microsoft.Z3.FPExpr)"> + <summary> + Predicate indicating whether t is a normal floating-point number. + </summary> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPIsSubnormal(Microsoft.Z3.FPExpr)"> + <summary> + Predicate indicating whether t is a subnormal floating-point number. + </summary> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPIsZero(Microsoft.Z3.FPExpr)"> + <summary> + Predicate indicating whether t is a floating-point number with zero value, i.e., +0 or -0. + </summary> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPIsInfinite(Microsoft.Z3.FPExpr)"> + <summary> + Predicate indicating whether t is a floating-point number representing +oo or -oo. + </summary> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPIsNaN(Microsoft.Z3.FPExpr)"> + <summary> + Predicate indicating whether t is a NaN. + </summary> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPIsNegative(Microsoft.Z3.FPExpr)"> + <summary> + Predicate indicating whether t is a negative floating-point number. + </summary> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPIsPositive(Microsoft.Z3.FPExpr)"> + <summary> + Predicate indicating whether t is a positive floating-point number. + </summary> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFP(Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr,Microsoft.Z3.BitVecExpr)"> + <summary> + Create an expression of FloatingPoint sort from three bit-vector expressions. + </summary> + <remarks> + This is the operator named `fp' in the SMT FP theory definition. + Note that sgn is required to be a bit-vector of size 1. Significand and exponent + are required to be greater than 1 and 2 respectively. The FloatingPoint sort + of the resulting expression is automatically determined from the bit-vector sizes + of the arguments. + </remarks> + <param name="sgn">bit-vector term (of size 1) representing the sign.</param> + <param name="sig">bit-vector term representing the significand.</param> + <param name="exp">bit-vector term representing the exponent.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPToFP(Microsoft.Z3.BitVecExpr,Microsoft.Z3.FPSort)"> + <summary> + Conversion of a single IEEE 754-2008 bit-vector into a floating-point number. + </summary> + <remarks> + Produces a term that represents the conversion of a bit-vector term bv to a + floating-point term of sort s. The bit-vector size of bv (m) must be equal + to ebits+sbits of s. The format of the bit-vector is as defined by the + IEEE 754-2008 interchange format. + </remarks> + <param name="bv">bit-vector value (of size m).</param> + <param name="s">FloatingPoint sort (ebits+sbits == m)</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPToFP(Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr,Microsoft.Z3.FPSort)"> + <summary> + Conversion of a FloatingPoint term into another term of different FloatingPoint sort. + </summary> + <remarks> + Produces a term that represents the conversion of a floating-point term t to a + floating-point term of sort s. If necessary, the result will be rounded according + to rounding mode rm. + </remarks> + <param name="rm">RoundingMode term.</param> + <param name="t">FloatingPoint term.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPToFP(Microsoft.Z3.FPRMExpr,Microsoft.Z3.RealExpr,Microsoft.Z3.FPSort)"> + <summary> + Conversion of a term of real sort into a term of FloatingPoint sort. + </summary> + <remarks> + Produces a term that represents the conversion of term t of real sort into a + floating-point term of sort s. If necessary, the result will be rounded according + to rounding mode rm. + </remarks> + <param name="rm">RoundingMode term.</param> + <param name="t">term of Real sort.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPToFP(Microsoft.Z3.FPRMExpr,Microsoft.Z3.BitVecExpr,Microsoft.Z3.FPSort,System.Boolean)"> + <summary> + Conversion of a 2's complement signed bit-vector term into a term of FloatingPoint sort. + </summary> + <remarks> + Produces a term that represents the conversion of the bit-vector term t into a + floating-point term of sort s. The bit-vector t is taken to be in signed + 2's complement format (when signed==true, otherwise unsigned). If necessary, the + result will be rounded according to rounding mode rm. + </remarks> + <param name="rm">RoundingMode term.</param> + <param name="t">term of bit-vector sort.</param> + <param name="s">FloatingPoint sort.</param> + <param name="signed">flag indicating whether t is interpreted as signed or unsigned bit-vector.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPToFP(Microsoft.Z3.FPSort,Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr)"> + <summary> + Conversion of a floating-point number to another FloatingPoint sort s. + </summary> + <remarks> + Produces a term that represents the conversion of a floating-point term t to a different + FloatingPoint sort s. If necessary, rounding according to rm is applied. + </remarks> + <param name="s">FloatingPoint sort</param> + <param name="rm">floating-point rounding mode term</param> + <param name="t">floating-point term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPToBV(Microsoft.Z3.FPRMExpr,Microsoft.Z3.FPExpr,System.UInt32,System.Boolean)"> + <summary> + Conversion of a floating-point term into a bit-vector. + </summary> + <remarks> + Produces a term that represents the conversion of the floating-poiunt term t into a + bit-vector term of size sz in 2's complement format (signed when signed==true). If necessary, + the result will be rounded according to rounding mode rm. + </remarks> + <param name="rm">RoundingMode term.</param> + <param name="t">FloatingPoint term</param> + <param name="sz">Size of the resulting bit-vector.</param> + <param name="signed">Indicates whether the result is a signed or unsigned bit-vector.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPToReal(Microsoft.Z3.FPExpr)"> + <summary> + Conversion of a floating-point term into a real-numbered term. + </summary> + <remarks> + Produces a term that represents the conversion of the floating-poiunt term t into a + real number. Note that this type of conversion will often result in non-linear + constraints over real terms. + </remarks> + <param name="t">FloatingPoint term</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPToIEEEBV(Microsoft.Z3.FPExpr)"> + <summary> + Conversion of a floating-point term into a bit-vector term in IEEE 754-2008 format. + </summary> + <remarks> + The size of the resulting bit-vector is automatically determined. Note that + IEEE 754-2008 allows multiple different representations of NaN. This conversion + knows only one NaN and it will always produce the same bit-vector represenatation of + that NaN. + </remarks> + <param name="t">FloatingPoint term.</param> + </member> + <member name="M:Microsoft.Z3.Context.MkFPToFP(Microsoft.Z3.FPRMExpr,Microsoft.Z3.IntExpr,Microsoft.Z3.RealExpr,Microsoft.Z3.FPSort)"> + <summary> + Conversion of a real-sorted significand and an integer-sorted exponent into a term of FloatingPoint sort. + </summary> + <remarks> + Produces a term that represents the conversion of sig * 2^exp into a + floating-point term of sort s. If necessary, the result will be rounded + according to rounding mode rm. + </remarks> + <param name="rm">RoundingMode term.</param> + <param name="exp">Exponent term of Int sort.</param> + <param name="sig">Significand term of Real sort.</param> + <param name="s">FloatingPoint sort.</param> + </member> + <member name="M:Microsoft.Z3.Context.WrapAST(System.IntPtr)"> + <summary> + Wraps an AST. + </summary> + <remarks>This function is used for transitions between native and + managed objects. Note that <paramref name="nativeObject"/> must be a + native object obtained from Z3 (e.g., through <seealso cref="M:Microsoft.Z3.Context.UnwrapAST(Microsoft.Z3.AST)"/>) + and that it must have a correct reference count (see e.g., + <seealso cref="M:Microsoft.Z3.Native.Z3_inc_ref(System.IntPtr,System.IntPtr)"/>.</remarks> + <seealso cref="M:Microsoft.Z3.Context.UnwrapAST(Microsoft.Z3.AST)"/> + <param name="nativeObject">The native pointer to wrap.</param> + </member> + <member name="M:Microsoft.Z3.Context.UnwrapAST(Microsoft.Z3.AST)"> + <summary> + Unwraps an AST. + </summary> + <remarks>This function is used for transitions between native and + managed objects. It returns the native pointer to the AST. Note that + AST objects are reference counted and unwrapping an AST disables automatic + reference counting, i.e., all references to the IntPtr that is returned + must be handled externally and through native calls (see e.g., + <seealso cref="M:Microsoft.Z3.Native.Z3_inc_ref(System.IntPtr,System.IntPtr)"/>).</remarks> + <seealso cref="M:Microsoft.Z3.Context.WrapAST(System.IntPtr)"/> + <param name="a">The AST to unwrap.</param> + </member> + <member name="M:Microsoft.Z3.Context.SimplifyHelp"> + <summary> + Return a string describing all available parameters to <c>Expr.Simplify</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.UpdateParamValue(System.String,System.String)"> + <summary> + Update a mutable configuration parameter. + </summary> + <remarks> + The list of all configuration parameters can be obtained using the Z3 executable: + <c>z3.exe -p</c> + Only a few configuration parameters are mutable once the context is created. + An exception is thrown when trying to modify an immutable parameter. + </remarks> + </member> + <member name="M:Microsoft.Z3.Context.Finalize"> + <summary> + Finalizer. + </summary> + </member> + <member name="M:Microsoft.Z3.Context.Dispose"> + <summary> + Disposes of the context. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.BoolSort"> + <summary> + Retrieves the Boolean sort of the context. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.IntSort"> + <summary> + Retrieves the Integer sort of the context. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.RealSort"> + <summary> + Retrieves the Real sort of the context. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.StringSort"> + <summary> + Retrieves the String sort of the context. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.PrintMode"> + <summary> + Selects the format used for pretty-printing expressions. + </summary> + <remarks> + The default mode for pretty printing expressions is to produce + SMT-LIB style output where common subexpressions are printed + at each occurrence. The mode is called Z3_PRINT_SMTLIB_FULL. + To print shared common subexpressions only once, + use the Z3_PRINT_LOW_LEVEL mode. + To print in way that conforms to SMT-LIB standards and uses let + expressions to share common sub-expressions use Z3_PRINT_SMTLIB_COMPLIANT. + </remarks> + <seealso cref="M:Microsoft.Z3.AST.ToString"/> + <seealso cref="M:Microsoft.Z3.Pattern.ToString"/> + <seealso cref="M:Microsoft.Z3.FuncDecl.ToString"/> + <seealso cref="M:Microsoft.Z3.Sort.ToString"/> + </member> + <member name="P:Microsoft.Z3.Context.NumTactics"> + <summary> + The number of supported tactics. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.TacticNames"> + <summary> + The names of all supported tactics. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.NumProbes"> + <summary> + The number of supported Probes. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.ProbeNames"> + <summary> + The names of all supported Probes. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.SimplifyParameterDescriptions"> + <summary> + Retrieves parameter descriptions for simplifier. + </summary> + </member> + <member name="P:Microsoft.Z3.Context.AST_DRQ"> + <summary> + AST DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.ASTMap_DRQ"> + <summary> + ASTMap DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.ASTVector_DRQ"> + <summary> + ASTVector DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.ApplyResult_DRQ"> + <summary> + ApplyResult DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.FuncEntry_DRQ"> + <summary> + FuncEntry DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.FuncInterp_DRQ"> + <summary> + FuncInterp DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.Goal_DRQ"> + <summary> + Goal DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.Model_DRQ"> + <summary> + Model DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.Params_DRQ"> + <summary> + Params DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.ParamDescrs_DRQ"> + <summary> + ParamDescrs DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.Probe_DRQ"> + <summary> + Probe DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.Solver_DRQ"> + <summary> + Solver DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.Statistics_DRQ"> + <summary> + Statistics DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.Tactic_DRQ"> + <summary> + Tactic DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.Fixedpoint_DRQ"> + <summary> + FixedPoint DRQ + </summary> + </member> + <member name="P:Microsoft.Z3.Context.Optimize_DRQ"> + <summary> + Optimize DRQ + </summary> + </member> + <member name="T:Microsoft.Z3.DatatypeExpr"> + <summary> + Datatype expressions + </summary> + </member> + <member name="M:Microsoft.Z3.DatatypeExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for DatatypeExpr </summary> + </member> + <member name="T:Microsoft.Z3.DatatypeSort"> + <summary> + Datatype sorts. + </summary> + </member> + <member name="P:Microsoft.Z3.DatatypeSort.NumConstructors"> + <summary> + The number of constructors of the datatype sort. + </summary> + </member> + <member name="P:Microsoft.Z3.DatatypeSort.Constructors"> + <summary> + The constructors. + </summary> + </member> + <member name="P:Microsoft.Z3.DatatypeSort.Recognizers"> + <summary> + The recognizers. + </summary> + </member> + <member name="P:Microsoft.Z3.DatatypeSort.Accessors"> + <summary> + The constructor accessors. + </summary> + </member> + <member name="T:Microsoft.Z3.Deprecated"> + <summary> + The main interaction with Z3 happens via the Context. + </summary> + </member> + <member name="T:Microsoft.Z3.Z3_lbool"> + <summary>Z3_lbool</summary> + </member> + <member name="T:Microsoft.Z3.Z3_symbol_kind"> + <summary>Z3_symbol_kind</summary> + </member> + <member name="T:Microsoft.Z3.Z3_parameter_kind"> + <summary>Z3_parameter_kind</summary> + </member> + <member name="T:Microsoft.Z3.Z3_sort_kind"> + <summary>Z3_sort_kind</summary> + </member> + <member name="T:Microsoft.Z3.Z3_ast_kind"> + <summary>Z3_ast_kind</summary> + </member> + <member name="T:Microsoft.Z3.Z3_decl_kind"> + <summary>Z3_decl_kind</summary> + </member> + <member name="T:Microsoft.Z3.Z3_param_kind"> + <summary>Z3_param_kind</summary> + </member> + <member name="T:Microsoft.Z3.Z3_ast_print_mode"> + <summary>Z3_ast_print_mode</summary> + </member> + <member name="T:Microsoft.Z3.Z3_error_code"> + <summary>Z3_error_code</summary> + </member> + <member name="T:Microsoft.Z3.Z3_goal_prec"> + <summary>Z3_goal_prec</summary> + </member> + <member name="T:Microsoft.Z3.EnumSort"> + <summary> + Enumeration sorts. + </summary> + </member> + <member name="M:Microsoft.Z3.EnumSort.ConstDecl(System.UInt32)"> + <summary> + Retrieves the inx'th constant declaration in the enumeration. + </summary> + <param name="inx"></param> + <returns></returns> + </member> + <member name="M:Microsoft.Z3.EnumSort.Const(System.UInt32)"> + <summary> + Retrieves the inx'th constant in the enumeration. + </summary> + <param name="inx"></param> + <returns></returns> + </member> + <member name="M:Microsoft.Z3.EnumSort.TesterDecl(System.UInt32)"> + <summary> + Retrieves the inx'th tester/recognizer declaration in the enumeration. + </summary> + <param name="inx"></param> + <returns></returns> + </member> + <member name="P:Microsoft.Z3.EnumSort.ConstDecls"> + <summary> + The function declarations of the constants in the enumeration. + </summary> + </member> + <member name="P:Microsoft.Z3.EnumSort.Consts"> + <summary> + The constants in the enumeration. + </summary> + </member> + <member name="P:Microsoft.Z3.EnumSort.TesterDecls"> + <summary> + The test predicates (recognizers) for the constants in the enumeration. + </summary> + </member> + <member name="T:Microsoft.Z3.FiniteDomainExpr"> + <summary> + Finite-domain expressions + </summary> + </member> + <member name="M:Microsoft.Z3.FiniteDomainExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for DatatypeExpr </summary> + </member> + <member name="T:Microsoft.Z3.FiniteDomainNum"> + <summary> + Finite-domain numerals + </summary> + </member> + <member name="M:Microsoft.Z3.FiniteDomainNum.ToString"> + <summary> + Returns a string representation of the numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.FiniteDomainNum.UInt64"> + <summary> + Retrieve the 64-bit unsigned integer value. + </summary> + </member> + <member name="P:Microsoft.Z3.FiniteDomainNum.Int"> + <summary> + Retrieve the int value. + </summary> + </member> + <member name="P:Microsoft.Z3.FiniteDomainNum.Int64"> + <summary> + Retrieve the 64-bit int value. + </summary> + </member> + <member name="P:Microsoft.Z3.FiniteDomainNum.UInt"> + <summary> + Retrieve the int value. + </summary> + </member> + <member name="P:Microsoft.Z3.FiniteDomainNum.BigInteger"> + <summary> + Retrieve the BigInteger value. + </summary> + </member> + <member name="T:Microsoft.Z3.FiniteDomainSort"> + <summary> + Finite domain sorts. + </summary> + </member> + <member name="P:Microsoft.Z3.FiniteDomainSort.Size"> + <summary> + The size of the finite domain sort. + </summary> + </member> + <member name="T:Microsoft.Z3.Fixedpoint"> + <summary> + Object for managing fixedpoints + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.Assert(Microsoft.Z3.BoolExpr[])"> + <summary> + Assert a constraint (or multiple) into the fixedpoint solver. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.Add(Microsoft.Z3.BoolExpr[])"> + <summary> + Alias for Assert. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.RegisterRelation(Microsoft.Z3.FuncDecl)"> + <summary> + Register predicate as recursive relation. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.AddRule(Microsoft.Z3.BoolExpr,Microsoft.Z3.Symbol)"> + <summary> + Add rule into the fixedpoint solver. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.AddFact(Microsoft.Z3.FuncDecl,System.UInt32[])"> + <summary> + Add table fact to the fixedpoint solver. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.Query(Microsoft.Z3.BoolExpr)"> + <summary> + Query the fixedpoint solver. + A query is a conjunction of constraints. The constraints may include the recursively defined relations. + The query is satisfiable if there is an instance of the query variables and a derivation for it. + The query is unsatisfiable if there are no derivations satisfying the query variables. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.Query(Microsoft.Z3.FuncDecl[])"> + <summary> + Query the fixedpoint solver. + A query is an array of relations. + The query is satisfiable if there is an instance of some relation that is non-empty. + The query is unsatisfiable if there are no derivations satisfying any of the relations. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.Push"> + <summary> + Creates a backtracking point. + </summary> + <seealso cref="M:Microsoft.Z3.Fixedpoint.Pop"/> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.Pop"> + <summary> + Backtrack one backtracking point. + </summary> + <remarks>Note that an exception is thrown if Pop is called without a corresponding <c>Push</c></remarks> + <seealso cref="M:Microsoft.Z3.Fixedpoint.Push"/> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.UpdateRule(Microsoft.Z3.BoolExpr,Microsoft.Z3.Symbol)"> + <summary> + Update named rule into in the fixedpoint solver. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.GetAnswer"> + <summary> + Retrieve satisfying instance or instances of solver, + or definitions for the recursive predicates that show unsatisfiability. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.GetReasonUnknown"> + <summary> + Retrieve explanation why fixedpoint engine returned status Unknown. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.GetNumLevels(Microsoft.Z3.FuncDecl)"> + <summary> + Retrieve the number of levels explored for a given predicate. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.GetCoverDelta(System.Int32,Microsoft.Z3.FuncDecl)"> + <summary> + Retrieve the cover of a predicate. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.AddCover(System.Int32,Microsoft.Z3.FuncDecl,Microsoft.Z3.Expr)"> + <summary> + Add <tt>property</tt> about the <tt>predicate</tt>. + The property is added at <tt>level</tt>. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.ToString"> + <summary> + Retrieve internal string representation of fixedpoint object. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.SetPredicateRepresentation(Microsoft.Z3.FuncDecl,Microsoft.Z3.Symbol[])"> + <summary> + Instrument the Datalog engine on which table representation to use for recursive predicate. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.ToString(Microsoft.Z3.BoolExpr[])"> + <summary> + Convert benchmark given as set of axioms, rules and queries to a string. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.ParseFile(System.String)"> + <summary> + Parse an SMT-LIB2 file with fixedpoint rules. + Add the rules to the current fixedpoint context. + Return the set of queries in the file. + </summary> + </member> + <member name="M:Microsoft.Z3.Fixedpoint.ParseString(System.String)"> + <summary> + Similar to ParseFile. Instead it takes as argument a string. + </summary> + </member> + <member name="P:Microsoft.Z3.Fixedpoint.Help"> + <summary> + A string that describes all available fixedpoint solver parameters. + </summary> + </member> + <member name="P:Microsoft.Z3.Fixedpoint.Parameters"> + <summary> + Sets the fixedpoint solver parameters. + </summary> + </member> + <member name="P:Microsoft.Z3.Fixedpoint.ParameterDescriptions"> + <summary> + Retrieves parameter descriptions for Fixedpoint solver. + </summary> + </member> + <member name="P:Microsoft.Z3.Fixedpoint.Rules"> + <summary> + Retrieve set of rules added to fixedpoint context. + </summary> + </member> + <member name="P:Microsoft.Z3.Fixedpoint.Assertions"> + <summary> + Retrieve set of assertions added to fixedpoint context. + </summary> + </member> + <member name="P:Microsoft.Z3.Fixedpoint.Statistics"> + <summary> + Fixedpoint statistics. + </summary> + </member> + <member name="T:Microsoft.Z3.FPExpr"> + <summary> + FloatingPoint Expressions + </summary> + </member> + <member name="M:Microsoft.Z3.FPExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for FPExpr </summary> + </member> + <member name="P:Microsoft.Z3.FPExpr.EBits"> + <summary> + The number of exponent bits. + </summary> + </member> + <member name="P:Microsoft.Z3.FPExpr.SBits"> + <summary> + The number of significand bits. + </summary> + </member> + <member name="T:Microsoft.Z3.FPNum"> + <summary> + FloatiungPoint Numerals + </summary> + </member> + <member name="M:Microsoft.Z3.FPNum.Exponent(System.Boolean)"> + <summary> + Return the (biased) exponent value of a floating-point numeral as a string + </summary> + </member> + <member name="M:Microsoft.Z3.FPNum.ExponentInt64(System.Boolean)"> + <summary> + Return the exponent value of a floating-point numeral as a signed 64-bit integer + </summary> + </member> + <member name="M:Microsoft.Z3.FPNum.ExponentBV(System.Boolean)"> + <summary> + The exponent of a floating-point numeral as a bit-vector expression + </summary> + <remarks> + +oo, -oo and NaN's do not have a bit-vector exponent, so they are invalid arguments. + </remarks> + </member> + <member name="M:Microsoft.Z3.FPNum.ToString"> + <summary> + Returns a string representation of the numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.FPNum.SignBV"> + <summary> + The sign of a floating-point numeral as a bit-vector expression + </summary> + <remarks> + NaN's do not have a bit-vector sign, so they are invalid arguments. + </remarks> + </member> + <member name="P:Microsoft.Z3.FPNum.Sign"> + <summary> + Retrieves the sign of a floating-point literal + </summary> + <remarks> + Remarks: returns true if the numeral is negative + </remarks> + </member> + <member name="P:Microsoft.Z3.FPNum.Significand"> + <summary> + The significand value of a floating-point numeral as a string + </summary> + <remarks> + The significand s is always 0 < s < 2.0; the resulting string is long + enough to represent the real significand precisely. + </remarks> + </member> + <member name="P:Microsoft.Z3.FPNum.SignificandUInt64"> + <summary> + The significand value of a floating-point numeral as a UInt64 + </summary> + <remarks> + This function extracts the significand bits, without the + hidden bit or normalization. Throws an exception if the + significand does not fit into a UInt64. + </remarks> + </member> + <member name="P:Microsoft.Z3.FPNum.SignificandBV"> + <summary> + The significand of a floating-point numeral as a bit-vector expression + </summary> + <remarks> + +oo, -oo and NaN's do not have a bit-vector significand, so they are invalid arguments. + </remarks> + </member> + <member name="P:Microsoft.Z3.FPNum.IsNaN"> + <summary> + Indicates whether the numeral is a NaN. + </summary> + </member> + <member name="P:Microsoft.Z3.FPNum.IsInf"> + <summary> + Indicates whether the numeral is a +oo or -oo. + </summary> + </member> + <member name="P:Microsoft.Z3.FPNum.IsZero"> + <summary> + Indicates whether the numeral is +zero or -zero. + </summary> + </member> + <member name="P:Microsoft.Z3.FPNum.IsNormal"> + <summary> + Indicates whether the numeral is normal. + </summary> + </member> + <member name="P:Microsoft.Z3.FPNum.IsSubnormal"> + <summary> + Indicates whether the numeral is subnormal. + </summary> + </member> + <member name="P:Microsoft.Z3.FPNum.IsPositive"> + <summary> + Indicates whether the numeral is positive. + </summary> + </member> + <member name="P:Microsoft.Z3.FPNum.IsNegative"> + <summary> + Indicates whether the numeral is negative. + </summary> + </member> + <member name="T:Microsoft.Z3.FPRMExpr"> + <summary> + FloatingPoint RoundingMode Expressions + </summary> + </member> + <member name="M:Microsoft.Z3.FPRMExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for FPRMExpr </summary> + </member> + <member name="T:Microsoft.Z3.FPRMNum"> + <summary> + Floating-point rounding mode numerals + </summary> + </member> + <member name="M:Microsoft.Z3.FPRMNum.ToString"> + <summary> + Returns a string representation of the numeral. + </summary> + </member> + <member name="M:Microsoft.Z3.FPRMNum.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for FPRMNum </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRoundNearestTiesToEven"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven + </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRNE"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundNearestTiesToEven + </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRoundNearestTiesToAway"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway + </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRNA"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundNearestTiesToAway + </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRoundTowardPositive"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardPositive + </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRTP"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardPositive + </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRoundTowardNegative"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardNegative + </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRTN"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardNegative + </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRoundTowardZero"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardZero + </summary> + </member> + <member name="P:Microsoft.Z3.FPRMNum.isRTZ"> + <summary> + Indicates whether the term is the floating-point rounding numeral roundTowardZero + </summary> + </member> + <member name="T:Microsoft.Z3.FPRMSort"> + <summary> + The FloatingPoint RoundingMode sort + </summary> + </member> + <member name="T:Microsoft.Z3.FPSort"> + <summary> + FloatingPoint sort + </summary> + </member> + <member name="P:Microsoft.Z3.FPSort.EBits"> + <summary> + The number of exponent bits. + </summary> + </member> + <member name="P:Microsoft.Z3.FPSort.SBits"> + <summary> + The number of significand bits. + </summary> + </member> + <member name="T:Microsoft.Z3.FuncDecl"> + <summary> + Function declarations. + </summary> + </member> + <member name="M:Microsoft.Z3.FuncDecl.op_Equality(Microsoft.Z3.FuncDecl,Microsoft.Z3.FuncDecl)"> + <summary> + Comparison operator. + </summary> + <returns>True if <paramref name="a"/> and <paramref name="b"/> share the same context and are equal, false otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.FuncDecl.op_Inequality(Microsoft.Z3.FuncDecl,Microsoft.Z3.FuncDecl)"> + <summary> + Comparison operator. + </summary> + <returns>True if <paramref name="a"/> and <paramref name="b"/> do not share the same context or are not equal, false otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.FuncDecl.Equals(System.Object)"> + <summary> + Object comparison. + </summary> + </member> + <member name="M:Microsoft.Z3.FuncDecl.GetHashCode"> + <summary> + A hash code. + </summary> + </member> + <member name="M:Microsoft.Z3.FuncDecl.ToString"> + <summary> + A string representations of the function declaration. + </summary> + </member> + <member name="M:Microsoft.Z3.FuncDecl.Translate(Microsoft.Z3.Context)"> + <summary> + Translates (copies) the function declaration to the Context <paramref name="ctx"/>. + </summary> + <param name="ctx">A context</param> + <returns>A copy of the function declaration which is associated with <paramref name="ctx"/></returns> + </member> + <member name="M:Microsoft.Z3.FuncDecl.Apply(Microsoft.Z3.Expr[])"> + <summary> + Create expression that applies function to arguments. + </summary> + <param name="args"></param> + <returns></returns> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Id"> + <summary> + Returns a unique identifier for the function declaration. + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Arity"> + <summary> + The arity of the function declaration + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.DomainSize"> + <summary> + The size of the domain of the function declaration + <seealso cref="P:Microsoft.Z3.FuncDecl.Arity"/> + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Domain"> + <summary> + The domain of the function declaration + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Range"> + <summary> + The range of the function declaration + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.DeclKind"> + <summary> + The kind of the function declaration. + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Name"> + <summary> + The name of the function declaration + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.NumParameters"> + <summary> + The number of parameters of the function declaration + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Parameters"> + <summary> + The parameters of the function declaration + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Item(Microsoft.Z3.Expr[])"> + <summary> + Create expression that applies function to arguments. + </summary> + <param name="args"></param> + <returns></returns> + </member> + <member name="T:Microsoft.Z3.FuncDecl.Parameter"> + <summary> + Function declarations can have Parameters associated with them. + </summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Parameter.Int"> + <summary>The int value of the parameter.</summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Parameter.Double"> + <summary>The double value of the parameter.</summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Parameter.Symbol"> + <summary>The Symbol value of the parameter.</summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Parameter.Sort"> + <summary>The Sort value of the parameter.</summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Parameter.AST"> + <summary>The AST value of the parameter.</summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Parameter.FuncDecl"> + <summary>The FunctionDeclaration value of the parameter.</summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Parameter.Rational"> + <summary>The rational string value of the parameter.</summary> + </member> + <member name="P:Microsoft.Z3.FuncDecl.Parameter.ParameterKind"> + <summary> + The kind of the parameter. + </summary> + </member> + <member name="T:Microsoft.Z3.FuncInterp"> + <summary> + A function interpretation is represented as a finite map and an 'else' value. + Each entry in the finite map represents the value of a function given a set of arguments. + </summary> + </member> + <member name="M:Microsoft.Z3.FuncInterp.ToString"> + <summary> + A string representation of the function interpretation. + </summary> + </member> + <member name="P:Microsoft.Z3.FuncInterp.NumEntries"> + <summary> + The number of entries in the function interpretation. + </summary> + </member> + <member name="P:Microsoft.Z3.FuncInterp.Entries"> + <summary> + The entries in the function interpretation + </summary> + </member> + <member name="P:Microsoft.Z3.FuncInterp.Else"> + <summary> + The (symbolic) `else' value of the function interpretation. + </summary> + </member> + <member name="P:Microsoft.Z3.FuncInterp.Arity"> + <summary> + The arity of the function interpretation + </summary> + </member> + <member name="T:Microsoft.Z3.FuncInterp.Entry"> + <summary> + An Entry object represents an element in the finite map used to encode + a function interpretation. + </summary> + </member> + <member name="M:Microsoft.Z3.FuncInterp.Entry.ToString"> + <summary> + A string representation of the function entry. + </summary> + </member> + <member name="P:Microsoft.Z3.FuncInterp.Entry.Value"> + <summary> + Return the (symbolic) value of this entry. + </summary> + </member> + <member name="P:Microsoft.Z3.FuncInterp.Entry.NumArgs"> + <summary> + The number of arguments of the entry. + </summary> + </member> + <member name="P:Microsoft.Z3.FuncInterp.Entry.Args"> + <summary> + The arguments of the function entry. + </summary> + </member> + <member name="T:Microsoft.Z3.Global"> + <summary> + Global functions for Z3. + </summary> + <remarks> + This (static) class contains functions that effect the behaviour of Z3 + globally across contexts, etc. + </remarks> + </member> + <member name="M:Microsoft.Z3.Global.SetParameter(System.String,System.String)"> + <summary> + Set a global (or module) parameter, which is shared by all Z3 contexts. + </summary> + <remarks> + When a Z3 module is initialized it will use the value of these parameters + when Z3_params objects are not provided. + The name of parameter can be composed of characters [a-z][A-Z], digits [0-9], '-' and '_'. + The character '.' is a delimiter (more later). + The parameter names are case-insensitive. The character '-' should be viewed as an "alias" for '_'. + Thus, the following parameter names are considered equivalent: "pp.decimal-precision" and "PP.DECIMAL_PRECISION". + This function can be used to set parameters for a specific Z3 module. + This can be done by using [module-name].[parameter-name]. + For example: + Z3_global_param_set('pp.decimal', 'true') + will set the parameter "decimal" in the module "pp" to true. + </remarks> + </member> + <member name="M:Microsoft.Z3.Global.GetParameter(System.String)"> + <summary> + Get a global (or module) parameter. + </summary> + <remarks> + Returns null if the parameter <param name="id"/> does not exist. + The caller must invoke #Z3_global_param_del_value to delete the value returned at \c param_value. + This function cannot be invoked simultaneously from different threads without synchronization. + The result string stored in param_value is stored in a shared location. + </remarks> + </member> + <member name="M:Microsoft.Z3.Global.ResetParameters"> + <summary> + Restore the value of all global (and module) parameters. + </summary> + <remarks> + This command will not affect already created objects (such as tactics and solvers) + </remarks> + <seealso cref="M:Microsoft.Z3.Global.SetParameter(System.String,System.String)"/> + </member> + <member name="M:Microsoft.Z3.Global.ToggleWarningMessages(System.Boolean)"> + <summary> + Enable/disable printing of warning messages to the console. + </summary> + <remarks>Note that this function is static and effects the behaviour of + all contexts globally.</remarks> + </member> + <member name="M:Microsoft.Z3.Global.EnableTrace(System.String)"> + <summary> + Enable tracing messages tagged as `tag' when Z3 is compiled in debug mode. + </summary> + <remarks> + It is a NOOP otherwise. + </remarks> + <param name="tag">trace tag</param> + </member> + <member name="M:Microsoft.Z3.Global.DisableTrace(System.String)"> + <summary> + Disable tracing messages tagged as `tag' when Z3 is compiled in debug mode. + </summary> + <remarks> + It is a NOOP otherwise. + </remarks> + <param name="tag">trace tag</param> + </member> + <member name="T:Microsoft.Z3.Goal"> + <summary> + A goal (aka problem). A goal is essentially a set + of formulas, that can be solved and/or transformed using + tactics and solvers. + </summary> + </member> + <member name="M:Microsoft.Z3.Goal.Assert(Microsoft.Z3.BoolExpr[])"> + <summary> + Adds the <paramref name="constraints"/> to the given goal. + </summary> + </member> + <member name="M:Microsoft.Z3.Goal.Add(Microsoft.Z3.BoolExpr[])"> + <summary> + Alias for Assert. + </summary> + </member> + <member name="M:Microsoft.Z3.Goal.Reset"> + <summary> + Erases all formulas from the given goal. + </summary> + </member> + <member name="M:Microsoft.Z3.Goal.Translate(Microsoft.Z3.Context)"> + <summary> + Translates (copies) the Goal to the target Context <paramref name="ctx"/>. + </summary> + </member> + <member name="M:Microsoft.Z3.Goal.Simplify(Microsoft.Z3.Params)"> + <summary> + Simplifies the goal. + </summary> + <remarks>Essentially invokes the `simplify' tactic on the goal.</remarks> + </member> + <member name="M:Microsoft.Z3.Goal.ToString"> + <summary> + Goal to string conversion. + </summary> + <returns>A string representation of the Goal.</returns> + </member> + <member name="M:Microsoft.Z3.Goal.AsBoolExpr"> + <summary> + Goal to BoolExpr conversion. + </summary> + <returns>A string representation of the Goal.</returns> + </member> + <member name="P:Microsoft.Z3.Goal.Precision"> + <summary> + The precision of the goal. + </summary> + <remarks> + Goals can be transformed using over and under approximations. + An under approximation is applied when the objective is to find a model for a given goal. + An over approximation is applied when the objective is to find a proof for a given goal. + </remarks> + </member> + <member name="P:Microsoft.Z3.Goal.IsPrecise"> + <summary> + Indicates whether the goal is precise. + </summary> + </member> + <member name="P:Microsoft.Z3.Goal.IsUnderApproximation"> + <summary> + Indicates whether the goal is an under-approximation. + </summary> + </member> + <member name="P:Microsoft.Z3.Goal.IsOverApproximation"> + <summary> + Indicates whether the goal is an over-approximation. + </summary> + </member> + <member name="P:Microsoft.Z3.Goal.IsGarbage"> + <summary> + Indicates whether the goal is garbage (i.e., the product of over- and under-approximations). + </summary> + </member> + <member name="P:Microsoft.Z3.Goal.Inconsistent"> + <summary> + Indicates whether the goal contains `false'. + </summary> + </member> + <member name="P:Microsoft.Z3.Goal.Depth"> + <summary> + The depth of the goal. + </summary> + <remarks> + This tracks how many transformations were applied to it. + </remarks> + </member> + <member name="P:Microsoft.Z3.Goal.Size"> + <summary> + The number of formulas in the goal. + </summary> + </member> + <member name="P:Microsoft.Z3.Goal.Formulas"> + <summary> + The formulas in the goal. + </summary> + </member> + <member name="P:Microsoft.Z3.Goal.NumExprs"> + <summary> + The number of formulas, subformulas and terms in the goal. + </summary> + </member> + <member name="P:Microsoft.Z3.Goal.IsDecidedSat"> + <summary> + Indicates whether the goal is empty, and it is precise or the product of an under approximation. + </summary> + </member> + <member name="P:Microsoft.Z3.Goal.IsDecidedUnsat"> + <summary> + Indicates whether the goal contains `false', and it is precise or the product of an over approximation. + </summary> + </member> + <member name="T:Microsoft.Z3.InterpolationContext"> + <summary> + The InterpolationContext is suitable for generation of interpolants. + </summary> + <remarks>For more information on interpolation please refer + too the C/C++ API, which is well documented.</remarks> + </member> + <member name="M:Microsoft.Z3.InterpolationContext.#ctor"> + <summary> + Constructor. + </summary> + </member> + <member name="M:Microsoft.Z3.InterpolationContext.#ctor(System.Collections.Generic.Dictionary{System.String,System.String})"> + <summary> + Constructor. + </summary> + <remarks><seealso cref="T:Microsoft.Z3.Context"/></remarks> + </member> + <member name="M:Microsoft.Z3.InterpolationContext.MkInterpolant(Microsoft.Z3.BoolExpr)"> + <summary> + Create an expression that marks a formula position for interpolation. + </summary> + </member> + <member name="M:Microsoft.Z3.InterpolationContext.GetInterpolant(Microsoft.Z3.Expr,Microsoft.Z3.Expr,Microsoft.Z3.Params)"> + <summary> + Computes an interpolant. + </summary> + <remarks>For more information on interpolation please refer + too the function Z3_get_interpolant in the C/C++ API, which is + well documented.</remarks> + </member> + <member name="M:Microsoft.Z3.InterpolationContext.ComputeInterpolant(Microsoft.Z3.Expr,Microsoft.Z3.Params,Microsoft.Z3.BoolExpr[]@,Microsoft.Z3.Model@)"> + <summary> + Computes an interpolant. + </summary> + <remarks>For more information on interpolation please refer + too the function Z3_compute_interpolant in the C/C++ API, which is + well documented.</remarks> + </member> + <member name="M:Microsoft.Z3.InterpolationContext.InterpolationProfile"> + <summary> + Return a string summarizing cumulative time used for interpolation. + </summary> + <remarks>For more information on interpolation please refer + too the function Z3_interpolation_profile in the C/C++ API, which is + well documented.</remarks> + </member> + <member name="M:Microsoft.Z3.InterpolationContext.CheckInterpolant(Microsoft.Z3.Expr[],System.UInt32[],Microsoft.Z3.BoolExpr[],System.String@,Microsoft.Z3.Expr[])"> + <summary> + Checks the correctness of an interpolant. + </summary> + <remarks>For more information on interpolation please refer + too the function Z3_check_interpolant in the C/C++ API, which is + well documented.</remarks> + </member> + <member name="M:Microsoft.Z3.InterpolationContext.ReadInterpolationProblem(System.String,Microsoft.Z3.Expr[]@,System.UInt32[]@,System.String@,Microsoft.Z3.Expr[]@)"> + <summary> + Reads an interpolation problem from a file. + </summary> + <remarks>For more information on interpolation please refer + too the function Z3_read_interpolation_problem in the C/C++ API, which is + well documented.</remarks> + </member> + <member name="M:Microsoft.Z3.InterpolationContext.WriteInterpolationProblem(System.String,Microsoft.Z3.Expr[],System.UInt32[],Microsoft.Z3.Expr[])"> + <summary> + Writes an interpolation problem to a file. + </summary> + <remarks>For more information on interpolation please refer + too the function Z3_write_interpolation_problem in the C/C++ API, which is + well documented.</remarks> + </member> + <member name="T:Microsoft.Z3.IntExpr"> + <summary> + Int expressions + </summary> + </member> + <member name="M:Microsoft.Z3.IntExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for IntExpr </summary> + </member> + <member name="T:Microsoft.Z3.IntNum"> + <summary> + Integer Numerals + </summary> + </member> + <member name="M:Microsoft.Z3.IntNum.ToString"> + <summary> + Returns a string representation of the numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.IntNum.UInt64"> + <summary> + Retrieve the 64-bit unsigned integer value. + </summary> + </member> + <member name="P:Microsoft.Z3.IntNum.Int"> + <summary> + Retrieve the int value. + </summary> + </member> + <member name="P:Microsoft.Z3.IntNum.Int64"> + <summary> + Retrieve the 64-bit int value. + </summary> + </member> + <member name="P:Microsoft.Z3.IntNum.UInt"> + <summary> + Retrieve the int value. + </summary> + </member> + <member name="P:Microsoft.Z3.IntNum.BigInteger"> + <summary> + Retrieve the BigInteger value. + </summary> + </member> + <member name="T:Microsoft.Z3.IntSort"> + <summary> + An Integer sort + </summary> + </member> + <member name="T:Microsoft.Z3.IntSymbol"> + <summary> + Numbered symbols + </summary> + </member> + <member name="T:Microsoft.Z3.Symbol"> + <summary> + Symbols are used to name several term and type constructors. + </summary> + </member> + <member name="M:Microsoft.Z3.Symbol.IsIntSymbol"> + <summary> + Indicates whether the symbol is of Int kind + </summary> + </member> + <member name="M:Microsoft.Z3.Symbol.IsStringSymbol"> + <summary> + Indicates whether the symbol is of string kind. + </summary> + </member> + <member name="M:Microsoft.Z3.Symbol.ToString"> + <summary> + A string representation of the symbol. + </summary> + </member> + <member name="M:Microsoft.Z3.Symbol.op_Equality(Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Equality overloading. + </summary> + </member> + <member name="M:Microsoft.Z3.Symbol.op_Inequality(Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Equality overloading. + </summary> + </member> + <member name="M:Microsoft.Z3.Symbol.Equals(System.Object)"> + <summary> + Object comparison. + </summary> + </member> + <member name="M:Microsoft.Z3.Symbol.GetHashCode"> + <summary> + The Symbols's hash code. + </summary> + <returns>A hash code</returns> + </member> + <member name="M:Microsoft.Z3.Symbol.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> + Symbol constructor + </summary> + </member> + <member name="P:Microsoft.Z3.Symbol.Kind"> + <summary> + The kind of the symbol (int or string) + </summary> + </member> + <member name="P:Microsoft.Z3.IntSymbol.Int"> + <summary> + The int value of the symbol. + </summary> + <remarks>Throws an exception if the symbol is not of int kind. </remarks> + </member> + <member name="T:Microsoft.Z3.ListSort"> + <summary> + List sorts. + </summary> + </member> + <member name="P:Microsoft.Z3.ListSort.NilDecl"> + <summary> + The declaration of the nil function of this list sort. + </summary> + </member> + <member name="P:Microsoft.Z3.ListSort.Nil"> + <summary> + The empty list. + </summary> + </member> + <member name="P:Microsoft.Z3.ListSort.IsNilDecl"> + <summary> + The declaration of the isNil function of this list sort. + </summary> + </member> + <member name="P:Microsoft.Z3.ListSort.ConsDecl"> + <summary> + The declaration of the cons function of this list sort. + </summary> + </member> + <member name="P:Microsoft.Z3.ListSort.IsConsDecl"> + <summary> + The declaration of the isCons function of this list sort. + </summary> + + </member> + <member name="P:Microsoft.Z3.ListSort.HeadDecl"> + <summary> + The declaration of the head function of this list sort. + </summary> + </member> + <member name="P:Microsoft.Z3.ListSort.TailDecl"> + <summary> + The declaration of the tail function of this list sort. + </summary> + </member> + <member name="T:Microsoft.Z3.Log"> + <summary> + Interaction logging for Z3. + </summary> + <remarks> + Note that this is a global, static log and if multiple Context + objects are created, it logs the interaction with all of them. + </remarks> + </member> + <member name="M:Microsoft.Z3.Log.Open(System.String)"> + <summary> + Open an interaction log file. + </summary> + <param name="filename">the name of the file to open</param> + <returns>True if opening the log file succeeds, false otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.Log.Close"> + <summary> + Closes the interaction log. + </summary> + </member> + <member name="M:Microsoft.Z3.Log.Append(System.String)"> + <summary> + Appends the user-provided string <paramref name="s"/> to the interaction log. + </summary> + </member> + <member name="M:Microsoft.Z3.Log.isOpen"> + <summary> + Checks whether the interaction log is opened. + </summary> + <returns>True if the interaction log is open, false otherwise.</returns> + </member> + <member name="T:Microsoft.Z3.Model"> + <summary> + A Model contains interpretations (assignments) of constants and functions. + </summary> + </member> + <member name="M:Microsoft.Z3.Model.ConstInterp(Microsoft.Z3.Expr)"> + <summary> + Retrieves the interpretation (the assignment) of <paramref name="a"/> in the model. + </summary> + <param name="a">A Constant</param> + <returns>An expression if the constant has an interpretation in the model, null otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.Model.ConstInterp(Microsoft.Z3.FuncDecl)"> + <summary> + Retrieves the interpretation (the assignment) of <paramref name="f"/> in the model. + </summary> + <param name="f">A function declaration of zero arity</param> + <returns>An expression if the function has an interpretation in the model, null otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.Model.FuncInterp(Microsoft.Z3.FuncDecl)"> + <summary> + Retrieves the interpretation (the assignment) of a non-constant <paramref name="f"/> in the model. + </summary> + <param name="f">A function declaration of non-zero arity</param> + <returns>A FunctionInterpretation if the function has an interpretation in the model, null otherwise.</returns> + </member> + <member name="M:Microsoft.Z3.Model.Eval(Microsoft.Z3.Expr,System.Boolean)"> + <summary> + Evaluates the expression <paramref name="t"/> in the current model. + </summary> + <remarks> + This function may fail if <paramref name="t"/> contains quantifiers, + is partial (MODEL_PARTIAL enabled), or if <paramref name="t"/> is not well-sorted. + In this case a <c>ModelEvaluationFailedException</c> is thrown. + </remarks> + <param name="t">An expression</param> + <param name="completion"> + When this flag is enabled, a model value will be assigned to any constant + or function that does not have an interpretation in the model. + </param> + <returns>The evaluation of <paramref name="t"/> in the model.</returns> + </member> + <member name="M:Microsoft.Z3.Model.Evaluate(Microsoft.Z3.Expr,System.Boolean)"> + <summary> + Alias for <c>Eval</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Model.SortUniverse(Microsoft.Z3.Sort)"> + <summary> + The finite set of distinct values that represent the interpretation for sort <paramref name="s"/>. + </summary> + <seealso cref="P:Microsoft.Z3.Model.Sorts"/> + <param name="s">An uninterpreted sort</param> + <returns>An array of expressions, where each is an element of the universe of <paramref name="s"/></returns> + </member> + <member name="M:Microsoft.Z3.Model.ToString"> + <summary> + Conversion of models to strings. + </summary> + <returns>A string representation of the model.</returns> + </member> + <member name="P:Microsoft.Z3.Model.NumConsts"> + <summary> + The number of constants that have an interpretation in the model. + </summary> + </member> + <member name="P:Microsoft.Z3.Model.ConstDecls"> + <summary> + The function declarations of the constants in the model. + </summary> + </member> + <member name="P:Microsoft.Z3.Model.Consts"> + <summary> + Enumerate constants in model. + </summary> + </member> + <member name="P:Microsoft.Z3.Model.NumFuncs"> + <summary> + The number of function interpretations in the model. + </summary> + </member> + <member name="P:Microsoft.Z3.Model.FuncDecls"> + <summary> + The function declarations of the function interpretations in the model. + </summary> + </member> + <member name="P:Microsoft.Z3.Model.Decls"> + <summary> + All symbols that have an interpretation in the model. + </summary> + </member> + <member name="P:Microsoft.Z3.Model.NumSorts"> + <summary> + The number of uninterpreted sorts that the model has an interpretation for. + </summary> + </member> + <member name="P:Microsoft.Z3.Model.Sorts"> + <summary> + The uninterpreted sorts that the model has an interpretation for. + </summary> + <remarks> + Z3 also provides an intepretation for uninterpreted sorts used in a formula. + The interpretation for a sort is a finite set of distinct values. We say this finite set is + the "universe" of the sort. + </remarks> + <seealso cref="P:Microsoft.Z3.Model.NumSorts"/> + <seealso cref="M:Microsoft.Z3.Model.SortUniverse(Microsoft.Z3.Sort)"/> + </member> + <member name="T:Microsoft.Z3.Model.ModelEvaluationFailedException"> + <summary> + A ModelEvaluationFailedException is thrown when an expression cannot be evaluated by the model. + </summary> + </member> + <member name="T:Microsoft.Z3.Z3Exception"> + <summary> + The exception base class for error reporting from Z3 + </summary> + </member> + <member name="M:Microsoft.Z3.Z3Exception.#ctor"> + <summary> + Constructor. + </summary> + </member> + <member name="M:Microsoft.Z3.Z3Exception.#ctor(System.String)"> + <summary> + Constructor. + </summary> + </member> + <member name="M:Microsoft.Z3.Z3Exception.#ctor(System.String,System.Exception)"> + <summary> + Constructor. + </summary> + </member> + <member name="M:Microsoft.Z3.Model.ModelEvaluationFailedException.#ctor"> + <summary> + An exception that is thrown when model evaluation fails. + </summary> + </member> + <member name="T:Microsoft.Z3.Optimize"> + <summary> + Object for managing optimizization context + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.Assert(Microsoft.Z3.BoolExpr[])"> + <summary> + Assert a constraint (or multiple) into the optimize solver. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.Assert(System.Collections.Generic.IEnumerable{Microsoft.Z3.BoolExpr})"> + <summary> + Assert a constraint (or multiple) into the optimize solver. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.Add(Microsoft.Z3.BoolExpr[])"> + <summary> + Alias for Assert. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.Add(System.Collections.Generic.IEnumerable{Microsoft.Z3.BoolExpr})"> + <summary> + Alias for Assert. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.AddConstraints(System.Collections.Generic.IEnumerable{Microsoft.Z3.BoolExpr})"> + <summary> + Assert a constraint (or multiple) into the optimize solver. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.AssertSoft(Microsoft.Z3.BoolExpr,System.UInt32,System.String)"> + <summary> + Assert soft constraint + </summary> + <remarks> + Return an objective which associates with the group of constraints. + </remarks> + </member> + <member name="M:Microsoft.Z3.Optimize.Check"> + <summary> + Check satisfiability of asserted constraints. + Produce a model that (when the objectives are bounded and + don't use strict inequalities) meets the objectives. + </summary> + + </member> + <member name="M:Microsoft.Z3.Optimize.Push"> + <summary> + Creates a backtracking point. + </summary> + <seealso cref="M:Microsoft.Z3.Optimize.Pop"/> + </member> + <member name="M:Microsoft.Z3.Optimize.Pop"> + <summary> + Backtrack one backtracking point. + </summary> + <remarks>Note that an exception is thrown if Pop is called without a corresponding <c>Push</c></remarks> + <seealso cref="M:Microsoft.Z3.Optimize.Push"/> + </member> + <member name="M:Microsoft.Z3.Optimize.MkMaximize(Microsoft.Z3.Expr)"> + <summary> + Declare an arithmetical maximization objective. + Return a handle to the objective. The handle is used as + to retrieve the values of objectives after calling Check. + The expression can be either an arithmetical expression or bit-vector. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.MkMinimize(Microsoft.Z3.Expr)"> + <summary> + Declare an arithmetical minimization objective. + Similar to MkMaximize. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.GetLower(System.UInt32)"> + <summary> + Retrieve a lower bound for the objective handle. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.GetUpper(System.UInt32)"> + <summary> + Retrieve an upper bound for the objective handle. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.GetLowerAsVector(System.UInt32)"> + <summary> + Retrieve a lower bound for the objective handle. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.GetUpperAsVector(System.UInt32)"> + <summary> + Retrieve an upper bound for the objective handle. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.ToString"> + <summary> + Print the context to a string (SMT-LIB parseable benchmark). + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.FromFile(System.String)"> + <summary> + Parse an SMT-LIB2 file with optimization objectives and constraints. + The parsed constraints and objectives are added to the optimization context. + </summary> + </member> + <member name="M:Microsoft.Z3.Optimize.FromString(System.String)"> + <summary> + Similar to FromFile. Instead it takes as argument a string. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Help"> + <summary> + A string that describes all available optimize solver parameters. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Parameters"> + <summary> + Sets the optimize solver parameters. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.ParameterDescriptions"> + <summary> + Retrieves parameter descriptions for Optimize solver. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Model"> + <summary> + The model of the last <c>Check</c>. + </summary> + <remarks> + The result is <c>null</c> if <c>Check</c> was not invoked before, + if its results was not <c>SATISFIABLE</c>, or if model production is not enabled. + </remarks> + </member> + <member name="P:Microsoft.Z3.Optimize.ReasonUnknown"> + <summary> + Return a string the describes why the last to check returned unknown + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Assertions"> + <summary> + The set of asserted formulas. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Objectives"> + <summary> + The set of asserted formulas. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Statistics"> + <summary> + Optimize statistics. + </summary> + </member> + <member name="T:Microsoft.Z3.Optimize.Handle"> + <summary> + Handle to objectives returned by objective functions. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Handle.Lower"> + <summary> + Retrieve a lower bound for the objective handle. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Handle.Upper"> + <summary> + Retrieve an upper bound for the objective handle. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Handle.Value"> + <summary> + Retrieve the value of an objective. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Handle.LowerAsVector"> + <summary> + Retrieve a lower bound for the objective handle. + </summary> + </member> + <member name="P:Microsoft.Z3.Optimize.Handle.UpperAsVector"> + <summary> + Retrieve an upper bound for the objective handle. + </summary> + </member> + <member name="T:Microsoft.Z3.ParamDescrs"> + <summary> + A ParamDescrs describes a set of parameters. + </summary> + </member> + <member name="M:Microsoft.Z3.ParamDescrs.Validate(Microsoft.Z3.Params)"> + <summary> + validate a set of parameters. + </summary> + </member> + <member name="M:Microsoft.Z3.ParamDescrs.GetKind(Microsoft.Z3.Symbol)"> + <summary> + Retrieve kind of parameter. + </summary> + </member> + <member name="M:Microsoft.Z3.ParamDescrs.GetDocumentation(Microsoft.Z3.Symbol)"> + <summary> + Retrieve documentation of parameter. + </summary> + </member> + <member name="M:Microsoft.Z3.ParamDescrs.ToString"> + <summary> + Retrieves a string representation of the ParamDescrs. + </summary> + </member> + <member name="P:Microsoft.Z3.ParamDescrs.Names"> + <summary> + Retrieve all names of parameters. + </summary> + </member> + <member name="P:Microsoft.Z3.ParamDescrs.Size"> + <summary> + The size of the ParamDescrs. + </summary> + </member> + <member name="T:Microsoft.Z3.Params"> + <summary> + A Params objects represents a configuration in the form of Symbol/value pairs. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(Microsoft.Z3.Symbol,System.Boolean)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(Microsoft.Z3.Symbol,System.UInt32)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(Microsoft.Z3.Symbol,System.Double)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(Microsoft.Z3.Symbol,System.String)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(System.String,System.Boolean)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(System.String,System.UInt32)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(System.String,System.Double)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(System.String,Microsoft.Z3.Symbol)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.Add(System.String,System.String)"> + <summary> + Adds a parameter setting. + </summary> + </member> + <member name="M:Microsoft.Z3.Params.ToString"> + <summary> + A string representation of the parameter set. + </summary> + </member> + <member name="T:Microsoft.Z3.Pattern"> + <summary> + Patterns comprise a list of terms. The list should be + non-empty. If the list comprises of more than one term, it is + also called a multi-pattern. + </summary> + </member> + <member name="M:Microsoft.Z3.Pattern.ToString"> + <summary> + A string representation of the pattern. + </summary> + </member> + <member name="P:Microsoft.Z3.Pattern.NumTerms"> + <summary> + The number of terms in the pattern. + </summary> + </member> + <member name="P:Microsoft.Z3.Pattern.Terms"> + <summary> + The terms in the pattern. + </summary> + </member> + <member name="T:Microsoft.Z3.Probe"> + <summary> + Probes are used to inspect a goal (aka problem) and collect information that may be used to decide + which solver and/or preprocessing step will be used. + The complete list of probes may be obtained using the procedures <c>Context.NumProbes</c> + and <c>Context.ProbeNames</c>. + It may also be obtained using the command <c>(help-tactic)</c> in the SMT 2.0 front-end. + </summary> + </member> + <member name="M:Microsoft.Z3.Probe.Apply(Microsoft.Z3.Goal)"> + <summary> + Execute the probe over the goal. + </summary> + <returns>A probe always produce a double value. + "Boolean" probes return 0.0 for false, and a value different from 0.0 for true.</returns> + </member> + <member name="P:Microsoft.Z3.Probe.Item(Microsoft.Z3.Goal)"> + <summary> + Apply the probe to a goal. + </summary> + </member> + <member name="T:Microsoft.Z3.Quantifier"> + <summary> + Quantifier expressions. + </summary> + </member> + <member name="M:Microsoft.Z3.Quantifier.Translate(Microsoft.Z3.Context)"> + <summary> + Translates (copies) the quantifier to the Context <paramref name="ctx"/>. + </summary> + <param name="ctx">A context</param> + <returns>A copy of the quantifier which is associated with <paramref name="ctx"/></returns> + </member> + <member name="P:Microsoft.Z3.Quantifier.IsUniversal"> + <summary> + Indicates whether the quantifier is universal. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.IsExistential"> + <summary> + Indicates whether the quantifier is existential. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.Weight"> + <summary> + The weight of the quantifier. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.NumPatterns"> + <summary> + The number of patterns. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.Patterns"> + <summary> + The patterns. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.NumNoPatterns"> + <summary> + The number of no-patterns. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.NoPatterns"> + <summary> + The no-patterns. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.NumBound"> + <summary> + The number of bound variables. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.BoundVariableNames"> + <summary> + The symbols for the bound variables. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.BoundVariableSorts"> + <summary> + The sorts of the bound variables. + </summary> + </member> + <member name="P:Microsoft.Z3.Quantifier.Body"> + <summary> + The body of the quantifier. + </summary> + </member> + <member name="T:Microsoft.Z3.RatNum"> + <summary> + Rational Numerals + </summary> + </member> + <member name="T:Microsoft.Z3.RealExpr"> + <summary> + Real expressions + </summary> + </member> + <member name="M:Microsoft.Z3.RealExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for RealExpr </summary> + </member> + <member name="M:Microsoft.Z3.RatNum.ToDecimalString(System.UInt32)"> + <summary> + Returns a string representation in decimal notation. + </summary> + <remarks>The result has at most <paramref name="precision"/> decimal places.</remarks> + </member> + <member name="M:Microsoft.Z3.RatNum.ToString"> + <summary> + Returns a string representation of the numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.RatNum.Numerator"> + <summary> + The numerator of a rational numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.RatNum.Denominator"> + <summary> + The denominator of a rational numeral. + </summary> + </member> + <member name="P:Microsoft.Z3.RatNum.BigIntNumerator"> + <summary> + Converts the numerator of the rational to a BigInteger + </summary> + </member> + <member name="P:Microsoft.Z3.RatNum.BigIntDenominator"> + <summary> + Converts the denominator of the rational to a BigInteger + </summary> + </member> + <member name="T:Microsoft.Z3.RealSort"> + <summary> + A real sort + </summary> + </member> + <member name="T:Microsoft.Z3.ReExpr"> + <summary> + Regular expression expressions + </summary> + </member> + <member name="M:Microsoft.Z3.ReExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for ReExpr </summary> + </member> + <member name="T:Microsoft.Z3.RelationSort"> + <summary> + Relation sorts. + </summary> + </member> + <member name="P:Microsoft.Z3.RelationSort.Arity"> + <summary> + The arity of the relation sort. + </summary> + </member> + <member name="P:Microsoft.Z3.RelationSort.ColumnSorts"> + <summary> + The sorts of the columns of the relation sort. + </summary> + </member> + <member name="T:Microsoft.Z3.ReSort"> + <summary> + A regular expression sort + </summary> + </member> + <member name="T:Microsoft.Z3.SeqExpr"> + <summary> + Sequence expressions + </summary> + </member> + <member name="M:Microsoft.Z3.SeqExpr.#ctor(Microsoft.Z3.Context,System.IntPtr)"> + <summary> Constructor for SeqExpr </summary> + </member> + <member name="T:Microsoft.Z3.SeqSort"> + <summary> + A Sequence sort + </summary> + </member> + <member name="T:Microsoft.Z3.SetSort"> + <summary> + Set sorts. + </summary> + </member> + <member name="T:Microsoft.Z3.Solver"> + <summary> + Solvers. + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(System.String,System.Boolean)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(System.String,System.UInt32)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(System.String,System.Double)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(System.String,System.String)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(System.String,Microsoft.Z3.Symbol)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(Microsoft.Z3.Symbol,System.Boolean)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(Microsoft.Z3.Symbol,System.UInt32)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(Microsoft.Z3.Symbol,System.Double)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(Microsoft.Z3.Symbol,System.String)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Set(Microsoft.Z3.Symbol,Microsoft.Z3.Symbol)"> + <summary> + Sets parameter on the solver + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Push"> + <summary> + Creates a backtracking point. + </summary> + <seealso cref="M:Microsoft.Z3.Solver.Pop(System.UInt32)"/> + </member> + <member name="M:Microsoft.Z3.Solver.Pop(System.UInt32)"> + <summary> + Backtracks <paramref name="n"/> backtracking points. + </summary> + <remarks>Note that an exception is thrown if <paramref name="n"/> is not smaller than <c>NumScopes</c></remarks> + <seealso cref="M:Microsoft.Z3.Solver.Push"/> + </member> + <member name="M:Microsoft.Z3.Solver.Reset"> + <summary> + Resets the Solver. + </summary> + <remarks>This removes all assertions from the solver.</remarks> + </member> + <member name="M:Microsoft.Z3.Solver.Assert(Microsoft.Z3.BoolExpr[])"> + <summary> + Assert a constraint (or multiple) into the solver. + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Add(Microsoft.Z3.BoolExpr[])"> + <summary> + Alias for Assert. + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Add(System.Collections.Generic.IEnumerable{Microsoft.Z3.BoolExpr})"> + <summary> + Alias for Assert. + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.AssertAndTrack(Microsoft.Z3.BoolExpr[],Microsoft.Z3.BoolExpr[])"> + <summary> + Assert multiple constraints into the solver, and track them (in the unsat) core + using the Boolean constants in ps. + </summary> + <remarks> + This API is an alternative to <see cref="M:Microsoft.Z3.Solver.Check(Microsoft.Z3.Expr[])"/> with assumptions for extracting unsat cores. + Both APIs can be used in the same solver. The unsat core will contain a combination + of the Boolean variables provided using <see cref="M:Microsoft.Z3.Solver.AssertAndTrack(Microsoft.Z3.BoolExpr[],Microsoft.Z3.BoolExpr[])"/> + and the Boolean literals + provided using <see cref="M:Microsoft.Z3.Solver.Check(Microsoft.Z3.Expr[])"/> with assumptions. + </remarks> + </member> + <member name="M:Microsoft.Z3.Solver.AssertAndTrack(Microsoft.Z3.BoolExpr,Microsoft.Z3.BoolExpr)"> + <summary> + Assert a constraint into the solver, and track it (in the unsat) core + using the Boolean constant p. + </summary> + <remarks> + This API is an alternative to <see cref="M:Microsoft.Z3.Solver.Check(Microsoft.Z3.Expr[])"/> with assumptions for extracting unsat cores. + Both APIs can be used in the same solver. The unsat core will contain a combination + of the Boolean variables provided using <see cref="M:Microsoft.Z3.Solver.AssertAndTrack(Microsoft.Z3.BoolExpr[],Microsoft.Z3.BoolExpr[])"/> + and the Boolean literals + provided using <see cref="M:Microsoft.Z3.Solver.Check(Microsoft.Z3.Expr[])"/> with assumptions. + </remarks> + </member> + <member name="M:Microsoft.Z3.Solver.FromFile(System.String)"> + <summary> + Load solver assertions from a file. + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.FromString(System.String)"> + <summary> + Load solver assertions from a string. + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.Check(Microsoft.Z3.Expr[])"> + <summary> + Checks whether the assertions in the solver are consistent or not. + </summary> + <remarks> + <seealso cref="P:Microsoft.Z3.Solver.Model"/> + <seealso cref="P:Microsoft.Z3.Solver.UnsatCore"/> + <seealso cref="P:Microsoft.Z3.Solver.Proof"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Solver.Check(System.Collections.Generic.IEnumerable{Microsoft.Z3.BoolExpr})"> + <summary> + Checks whether the assertions in the solver are consistent or not. + </summary> + <remarks> + <seealso cref="P:Microsoft.Z3.Solver.Model"/> + <seealso cref="P:Microsoft.Z3.Solver.UnsatCore"/> + <seealso cref="P:Microsoft.Z3.Solver.Proof"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Solver.Consequences(System.Collections.Generic.IEnumerable{Microsoft.Z3.BoolExpr},System.Collections.Generic.IEnumerable{Microsoft.Z3.Expr},Microsoft.Z3.BoolExpr[]@)"> + <summary> + Retrieve fixed assignments to the set of variables in the form of consequences. + Each consequence is an implication of the form + + relevant-assumptions Implies variable = value + + where the relevant assumptions is a subset of the assumptions that are passed in + and the equality on the right side of the implication indicates how a variable + is fixed. + </summary> + <remarks> + <seealso cref="P:Microsoft.Z3.Solver.Model"/> + <seealso cref="P:Microsoft.Z3.Solver.UnsatCore"/> + <seealso cref="P:Microsoft.Z3.Solver.Proof"/> + </remarks> + </member> + <member name="M:Microsoft.Z3.Solver.Translate(Microsoft.Z3.Context)"> + <summary> + Create a clone of the current solver with respect to <c>ctx</c>. + </summary> + </member> + <member name="M:Microsoft.Z3.Solver.ToString"> + <summary> + A string representation of the solver. + </summary> + </member> + <member name="P:Microsoft.Z3.Solver.Help"> + <summary> + A string that describes all available solver parameters. + </summary> + </member> + <member name="P:Microsoft.Z3.Solver.Parameters"> + <summary> + Sets the solver parameters. + </summary> + </member> + <member name="P:Microsoft.Z3.Solver.ParameterDescriptions"> + <summary> + Retrieves parameter descriptions for solver. + </summary> + </member> + <member name="P:Microsoft.Z3.Solver.NumScopes"> + <summary> + The current number of backtracking points (scopes). + </summary> + <seealso cref="M:Microsoft.Z3.Solver.Pop(System.UInt32)"/> + <seealso cref="M:Microsoft.Z3.Solver.Push"/> + </member> + <member name="P:Microsoft.Z3.Solver.NumAssertions"> + <summary> + The number of assertions in the solver. + </summary> + </member> + <member name="P:Microsoft.Z3.Solver.Assertions"> + <summary> + The set of asserted formulas. + </summary> + </member> + <member name="P:Microsoft.Z3.Solver.Model"> + <summary> + The model of the last <c>Check</c>. + </summary> + <remarks> + The result is <c>null</c> if <c>Check</c> was not invoked before, + if its results was not <c>SATISFIABLE</c>, or if model production is not enabled. + </remarks> + </member> + <member name="P:Microsoft.Z3.Solver.Proof"> + <summary> + The proof of the last <c>Check</c>. + </summary> + <remarks> + The result is <c>null</c> if <c>Check</c> was not invoked before, + if its results was not <c>UNSATISFIABLE</c>, or if proof production is disabled. + </remarks> + </member> + <member name="P:Microsoft.Z3.Solver.UnsatCore"> + <summary> + The unsat core of the last <c>Check</c>. + </summary> + <remarks> + The unsat core is a subset of <c>Assertions</c> + The result is empty if <c>Check</c> was not invoked before, + if its results was not <c>UNSATISFIABLE</c>, or if core production is disabled. + </remarks> + </member> + <member name="P:Microsoft.Z3.Solver.ReasonUnknown"> + <summary> + A brief justification of why the last call to <c>Check</c> returned <c>UNKNOWN</c>. + </summary> + </member> + <member name="P:Microsoft.Z3.Solver.Statistics"> + <summary> + Solver statistics. + </summary> + </member> + <member name="T:Microsoft.Z3.Statistics"> + <summary> + Objects of this class track statistical information about solvers. + </summary> + </member> + <member name="M:Microsoft.Z3.Statistics.ToString"> + <summary> + A string representation of the statistical data. + </summary> + </member> + <member name="P:Microsoft.Z3.Statistics.Size"> + <summary> + The number of statistical data. + </summary> + </member> + <member name="P:Microsoft.Z3.Statistics.Entries"> + <summary> + The data entries. + </summary> + </member> + <member name="P:Microsoft.Z3.Statistics.Keys"> + <summary> + The statistical counters. + </summary> + </member> + <member name="P:Microsoft.Z3.Statistics.Item(System.String)"> + <summary> + The value of a particular statistical counter. + </summary> + <remarks>Returns null if the key is unknown.</remarks> + </member> + <member name="T:Microsoft.Z3.Statistics.Entry"> + <summary> + Statistical data is organized into pairs of [Key, Entry], where every + Entry is either a <c>DoubleEntry</c> or a <c>UIntEntry</c> + </summary> + </member> + <member name="F:Microsoft.Z3.Statistics.Entry.Key"> + <summary> + The key of the entry. + </summary> + </member> + <member name="M:Microsoft.Z3.Statistics.Entry.ToString"> + <summary> + The string representation of the Entry. + </summary> + </member> + <member name="P:Microsoft.Z3.Statistics.Entry.UIntValue"> + <summary> + The uint-value of the entry. + </summary> + </member> + <member name="P:Microsoft.Z3.Statistics.Entry.DoubleValue"> + <summary> + The double-value of the entry. + </summary> + </member> + <member name="P:Microsoft.Z3.Statistics.Entry.IsUInt"> + <summary> + True if the entry is uint-valued. + </summary> + </member> + <member name="P:Microsoft.Z3.Statistics.Entry.IsDouble"> + <summary> + True if the entry is double-valued. + </summary> + </member> + <member name="P:Microsoft.Z3.Statistics.Entry.Value"> + <summary> + The string representation of the the entry's value. + </summary> + </member> + <member name="T:Microsoft.Z3.Status"> + <summary> + Status values. + </summary> + </member> + <member name="F:Microsoft.Z3.Status.UNSATISFIABLE"> + <summary> + Used to signify an unsatisfiable status. + </summary> + </member> + <member name="F:Microsoft.Z3.Status.UNKNOWN"> + <summary> + Used to signify an unknown status. + </summary> + </member> + <member name="F:Microsoft.Z3.Status.SATISFIABLE"> + <summary> + Used to signify a satisfiable status. + </summary> + </member> + <member name="T:Microsoft.Z3.StringSymbol"> + <summary> + Named symbols + </summary> + </member> + <member name="P:Microsoft.Z3.StringSymbol.String"> + <summary> + The string value of the symbol. + </summary> + <remarks>Throws an exception if the symbol is not of string kind.</remarks> + </member> + <member name="T:Microsoft.Z3.Tactic"> + <summary> + Tactics are the basic building block for creating custom solvers for specific problem domains. + The complete list of tactics may be obtained using <c>Context.NumTactics</c> + and <c>Context.TacticNames</c>. + It may also be obtained using the command <c>(help-tactic)</c> in the SMT 2.0 front-end. + </summary> + </member> + <member name="M:Microsoft.Z3.Tactic.Apply(Microsoft.Z3.Goal,Microsoft.Z3.Params)"> + <summary> + Execute the tactic over the goal. + </summary> + </member> + <member name="P:Microsoft.Z3.Tactic.Help"> + <summary> + A string containing a description of parameters accepted by the tactic. + </summary> + </member> + <member name="P:Microsoft.Z3.Tactic.ParameterDescriptions"> + <summary> + Retrieves parameter descriptions for Tactics. + </summary> + </member> + <member name="P:Microsoft.Z3.Tactic.Item(Microsoft.Z3.Goal)"> + <summary> + Apply the tactic to a goal. + </summary> + </member> + <member name="P:Microsoft.Z3.Tactic.Solver"> + <summary> + Creates a solver that is implemented using the given tactic. + </summary> + <seealso cref="M:Microsoft.Z3.Context.MkSolver(Microsoft.Z3.Tactic)"/> + </member> + <member name="T:Microsoft.Z3.Tactic.DecRefQueue"> + <summary> + DecRefQueue + </summary> + </member> + <member name="T:Microsoft.Z3.TupleSort"> + <summary> + Tuple sorts. + </summary> + </member> + <member name="P:Microsoft.Z3.TupleSort.MkDecl"> + <summary> + The constructor function of the tuple. + </summary> + </member> + <member name="P:Microsoft.Z3.TupleSort.NumFields"> + <summary> + The number of fields in the tuple. + </summary> + </member> + <member name="P:Microsoft.Z3.TupleSort.FieldDecls"> + <summary> + The field declarations. + </summary> + </member> + <member name="T:Microsoft.Z3.UninterpretedSort"> + <summary> + Uninterpreted Sorts + </summary> + </member> + <member name="T:Microsoft.Z3.Version"> + <summary> + Version information. + </summary> + <remarks>Note that this class is static.</remarks> + </member> + <member name="M:Microsoft.Z3.Version.ToString"> + <summary> + A string representation of the version information. + </summary> + </member> + <member name="P:Microsoft.Z3.Version.Major"> + <summary> + The major version + </summary> + </member> + <member name="P:Microsoft.Z3.Version.Minor"> + <summary> + The minor version + </summary> + </member> + <member name="P:Microsoft.Z3.Version.Build"> + <summary> + The build version + </summary> + </member> + <member name="P:Microsoft.Z3.Version.Revision"> + <summary> + The revision + </summary> + </member> + <member name="P:Microsoft.Z3.Version.FullVersion"> + <summary> + A full version string + </summary> + </member> + </members> +</doc> diff --git a/rba.tool.core/lib32/z3/com.microsoft.z3.jar b/rba.tool.core/lib32/z3/com.microsoft.z3.jar Binary files differnew file mode 100644 index 0000000..ee1fc4e --- /dev/null +++ b/rba.tool.core/lib32/z3/com.microsoft.z3.jar diff --git a/rba.tool.core/lib32/z3/libz3.dll b/rba.tool.core/lib32/z3/libz3.dll Binary files differnew file mode 100644 index 0000000..e33549c --- /dev/null +++ b/rba.tool.core/lib32/z3/libz3.dll diff --git a/rba.tool.core/lib32/z3/libz3.lib b/rba.tool.core/lib32/z3/libz3.lib Binary files differnew file mode 100644 index 0000000..eb0d778 --- /dev/null +++ b/rba.tool.core/lib32/z3/libz3.lib diff --git a/rba.tool.core/lib32/z3/libz3java.dll b/rba.tool.core/lib32/z3/libz3java.dll Binary files differnew file mode 100644 index 0000000..385c13e --- /dev/null +++ b/rba.tool.core/lib32/z3/libz3java.dll diff --git a/rba.tool.core/lib32/z3/libz3java.lib b/rba.tool.core/lib32/z3/libz3java.lib Binary files differnew file mode 100644 index 0000000..bbd35df --- /dev/null +++ b/rba.tool.core/lib32/z3/libz3java.lib diff --git a/rba.tool.core/lib32/z3/msvcp110.dll b/rba.tool.core/lib32/z3/msvcp110.dll Binary files differnew file mode 100644 index 0000000..376b16e --- /dev/null +++ b/rba.tool.core/lib32/z3/msvcp110.dll diff --git a/rba.tool.core/lib32/z3/msvcr110.dll b/rba.tool.core/lib32/z3/msvcr110.dll Binary files differnew file mode 100644 index 0000000..1a3d79e --- /dev/null +++ b/rba.tool.core/lib32/z3/msvcr110.dll diff --git a/rba.tool.core/lib32/z3/python/example.py b/rba.tool.core/lib32/z3/python/example.py new file mode 100644 index 0000000..a176685 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/example.py @@ -0,0 +1,36 @@ +# Copyright (c) Microsoft Corporation 2015, 2016 + +# The Z3 Python API requires libz3.dll/.so/.dylib in the +# PATH/LD_LIBRARY_PATH/DYLD_LIBRARY_PATH +# environment variable and the PYTHON_PATH environment variable +# needs to point to the `python' directory that contains `z3/z3.py' +# (which is at bin/python in our binary releases). + +# If you obtained example.py as part of our binary release zip files, +# which you unzipped into a directory called `MYZ3', then follow these +# instructions to run the example: + +# Running this example on Windows: +# set PATH=%PATH%;MYZ3\bin +# set PYTHONPATH=MYZ3\bin\python +# python example.py + +# Running this example on Linux: +# export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:MYZ3/bin +# export PYTHONPATH=MYZ3/bin/python +# python example.py + +# Running this example on OSX: +# export DYLD_LIBRARY_PATH=$DYLD_LIBRARY_PATH:MYZ3/bin +# export PYTHONPATH=MYZ3/bin/python +# python example.py + + +from z3 import * + +x = Real('x') +y = Real('y') +s = Solver() +s.add(x + y > 5, x > 1, y > 1) +print(s.check()) +print(s.model()) diff --git a/rba.tool.core/lib32/z3/python/z3/__init__.py b/rba.tool.core/lib32/z3/python/z3/__init__.py new file mode 100644 index 0000000..f7aa29a --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/__init__.py @@ -0,0 +1,12 @@ +from .z3 import * + +from . import z3num +from . import z3poly +from . import z3printer +from . import z3rcf +from . import z3types +from . import z3util + +# generated files +from . import z3core +from . import z3consts diff --git a/rba.tool.core/lib32/z3/python/z3/__init__.pyc b/rba.tool.core/lib32/z3/python/z3/__init__.pyc Binary files differnew file mode 100644 index 0000000..a05ab44 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/__init__.pyc diff --git a/rba.tool.core/lib32/z3/python/z3/z3.py b/rba.tool.core/lib32/z3/python/z3/z3.py new file mode 100644 index 0000000..237f354 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3.py @@ -0,0 +1,10025 @@ + +############################################ +# Copyright (c) 2012 Microsoft Corporation +# +# Z3 Python interface +# +# Author: Leonardo de Moura (leonardo) +############################################ + +"""Z3 is a high performance theorem prover developed at Microsoft Research. Z3 is used in many applications such as: software/hardware verification and testing, constraint solving, analysis of hybrid systems, security, biology (in silico analysis), and geometrical problems. + +Several online tutorials for Z3Py are available at: +http://rise4fun.com/Z3Py/tutorial/guide + +Please send feedback, comments and/or corrections on the Issue tracker for https://github.com/Z3prover/z3.git. Your comments are very valuable. + +Small example: + +>>> x = Int('x') +>>> y = Int('y') +>>> s = Solver() +>>> s.add(x > 0) +>>> s.add(x < 2) +>>> s.add(y == x + 1) +>>> s.check() +sat +>>> m = s.model() +>>> m[x] +1 +>>> m[y] +2 + +Z3 exceptions: + +>>> try: +... x = BitVec('x', 32) +... y = Bool('y') +... # the expression x + y is type incorrect +... n = x + y +... except Z3Exception as ex: +... print("failed: %s" % ex) +failed: sort mismatch +""" +from . import z3core +from .z3core import * +from .z3types import * +from .z3consts import * +from .z3printer import * +from fractions import Fraction +import sys +import io +import math +import copy + +if sys.version < '3': + def _is_int(v): + return isinstance(v, (int, long)) +else: + def _is_int(v): + return isinstance(v, int) + +def enable_trace(msg): + Z3_enable_trace(msg) + +def disable_trace(msg): + Z3_disable_trace(msg) + +def get_version_string(): + major = ctypes.c_uint(0) + minor = ctypes.c_uint(0) + build = ctypes.c_uint(0) + rev = ctypes.c_uint(0) + Z3_get_version(major, minor, build, rev) + return "%s.%s.%s" % (major.value, minor.value, build.value) + +def get_version(): + major = ctypes.c_uint(0) + minor = ctypes.c_uint(0) + build = ctypes.c_uint(0) + rev = ctypes.c_uint(0) + Z3_get_version(major, minor, build, rev) + return (major.value, minor.value, build.value, rev.value) + +def get_full_version(): + return Z3_get_full_version() + +# We use _z3_assert instead of the assert command because we want to +# produce nice error messages in Z3Py at rise4fun.com +def _z3_assert(cond, msg): + if not cond: + raise Z3Exception(msg) + +def open_log(fname): + """Log interaction to a file. This function must be invoked immediately after init(). """ + Z3_open_log(fname) + +def append_log(s): + """Append user-defined string to interaction log. """ + Z3_append_log(s) + +def to_symbol(s, ctx=None): + """Convert an integer or string into a Z3 symbol.""" + if _is_int(s): + return Z3_mk_int_symbol(_get_ctx(ctx).ref(), s) + else: + return Z3_mk_string_symbol(_get_ctx(ctx).ref(), s) + +def _symbol2py(ctx, s): + """Convert a Z3 symbol back into a Python object. """ + if Z3_get_symbol_kind(ctx.ref(), s) == Z3_INT_SYMBOL: + return "k!%s" % Z3_get_symbol_int(ctx.ref(), s) + else: + return Z3_get_symbol_string(ctx.ref(), s) + +# Hack for having nary functions that can receive one argument that is the +# list of arguments. +def _get_args(args): + try: + if len(args) == 1 and (isinstance(args[0], tuple) or isinstance(args[0], list)): + return args[0] + elif len(args) == 1 and (isinstance(args[0], set) or isinstance(args[0], AstVector)): + return [arg for arg in args[0]] + else: + return args + except: # len is not necessarily defined when args is not a sequence (use reflection?) + return args + +def _to_param_value(val): + if isinstance(val, bool): + if val == True: + return "true" + else: + return "false" + else: + return str(val) + +def z3_error_handler(c, e): + # Do nothing error handler, just avoid exit(0) + # The wrappers in z3core.py will raise a Z3Exception if an error is detected + return + +class Context: + """A Context manages all other Z3 objects, global configuration options, etc. + + Z3Py uses a default global context. For most applications this is sufficient. + An application may use multiple Z3 contexts. Objects created in one context + cannot be used in another one. However, several objects may be "translated" from + one context to another. It is not safe to access Z3 objects from multiple threads. + The only exception is the method `interrupt()` that can be used to interrupt() a long + computation. + The initialization method receives global configuration options for the new context. + """ + def __init__(self, *args, **kws): + if __debug__: + _z3_assert(len(args) % 2 == 0, "Argument list must have an even number of elements.") + conf = Z3_mk_config() + for key in kws: + value = kws[key] + Z3_set_param_value(conf, str(key).upper(), _to_param_value(value)) + prev = None + for a in args: + if prev is None: + prev = a + else: + Z3_set_param_value(conf, str(prev), _to_param_value(a)) + prev = None + self.ctx = Z3_mk_context_rc(conf) + self.eh = Z3_set_error_handler(self.ctx, z3_error_handler) + Z3_set_ast_print_mode(self.ctx, Z3_PRINT_SMTLIB2_COMPLIANT) + Z3_del_config(conf) + + def __del__(self): + Z3_del_context(self.ctx) + self.ctx = None + self.eh = None + + def ref(self): + """Return a reference to the actual C pointer to the Z3 context.""" + return self.ctx + + def interrupt(self): + """Interrupt a solver performing a satisfiability test, a tactic processing a goal, or simplify functions. + + This method can be invoked from a thread different from the one executing the + interruptable procedure. + """ + Z3_interrupt(self.ref()) + + +# Global Z3 context +_main_ctx = None +def main_ctx(): + """Return a reference to the global Z3 context. + + >>> x = Real('x') + >>> x.ctx == main_ctx() + True + >>> c = Context() + >>> c == main_ctx() + False + >>> x2 = Real('x', c) + >>> x2.ctx == c + True + >>> eq(x, x2) + False + """ + global _main_ctx + if _main_ctx is None: + _main_ctx = Context() + return _main_ctx + +def _get_ctx(ctx): + if ctx is None: + return main_ctx() + else: + return ctx + +def set_param(*args, **kws): + """Set Z3 global (or module) parameters. + + >>> set_param(precision=10) + """ + if __debug__: + _z3_assert(len(args) % 2 == 0, "Argument list must have an even number of elements.") + new_kws = {} + for k in kws: + v = kws[k] + if not set_pp_option(k, v): + new_kws[k] = v + for key in new_kws: + value = new_kws[key] + Z3_global_param_set(str(key).upper(), _to_param_value(value)) + prev = None + for a in args: + if prev is None: + prev = a + else: + Z3_global_param_set(str(prev), _to_param_value(a)) + prev = None + +def reset_params(): + """Reset all global (or module) parameters. + """ + Z3_global_param_reset_all() + +def set_option(*args, **kws): + """Alias for 'set_param' for backward compatibility. + """ + return set_param(*args, **kws) + +def get_param(name): + """Return the value of a Z3 global (or module) parameter + + >>> get_param('nlsat.reorder') + 'true' + """ + ptr = (ctypes.c_char_p * 1)() + if Z3_global_param_get(str(name), ptr): + r = z3core._to_pystr(ptr[0]) + return r + raise Z3Exception("failed to retrieve value for '%s'" % name) + +######################################### +# +# ASTs base class +# +######################################### + +# Mark objects that use pretty printer +class Z3PPObject: + """Superclass for all Z3 objects that have support for pretty printing.""" + def use_pp(self): + return True + +class AstRef(Z3PPObject): + """AST are Direct Acyclic Graphs (DAGs) used to represent sorts, declarations and expressions.""" + def __init__(self, ast, ctx=None): + self.ast = ast + self.ctx = _get_ctx(ctx) + Z3_inc_ref(self.ctx.ref(), self.as_ast()) + + def __del__(self): + if self.ctx.ref() is not None: + Z3_dec_ref(self.ctx.ref(), self.as_ast()) + + def __deepcopy__(self, memo={}): + return _to_ast_ref(self.ast, self.ctx) + + def __str__(self): + return obj_to_string(self) + + def __repr__(self): + return obj_to_string(self) + + def __eq__(self, other): + return self.eq(other) + + def __hash__(self): + return self.hash() + + def __nonzero__(self): + return self.__bool__() + + def __bool__(self): + if is_true(self): + return True + elif is_false(self): + return False + elif is_eq(self) and self.num_args() == 2: + return self.arg(0).eq(self.arg(1)) + else: + raise Z3Exception("Symbolic expressions cannot be cast to concrete Boolean values.") + + def sexpr(self): + """Return a string representing the AST node in s-expression notation. + + >>> x = Int('x') + >>> ((x + 1)*x).sexpr() + '(* (+ x 1) x)' + """ + return Z3_ast_to_string(self.ctx_ref(), self.as_ast()) + + def as_ast(self): + """Return a pointer to the corresponding C Z3_ast object.""" + return self.ast + + def get_id(self): + """Return unique identifier for object. It can be used for hash-tables and maps.""" + return Z3_get_ast_id(self.ctx_ref(), self.as_ast()) + + def ctx_ref(self): + """Return a reference to the C context where this AST node is stored.""" + return self.ctx.ref() + + def eq(self, other): + """Return `True` if `self` and `other` are structurally identical. + + >>> x = Int('x') + >>> n1 = x + 1 + >>> n2 = 1 + x + >>> n1.eq(n2) + False + >>> n1 = simplify(n1) + >>> n2 = simplify(n2) + >>> n1.eq(n2) + True + """ + if __debug__: + _z3_assert(is_ast(other), "Z3 AST expected") + return Z3_is_eq_ast(self.ctx_ref(), self.as_ast(), other.as_ast()) + + def translate(self, target): + """Translate `self` to the context `target`. That is, return a copy of `self` in the context `target`. + + >>> c1 = Context() + >>> c2 = Context() + >>> x = Int('x', c1) + >>> y = Int('y', c2) + >>> # Nodes in different contexts can't be mixed. + >>> # However, we can translate nodes from one context to another. + >>> x.translate(c2) + y + x + y + """ + if __debug__: + _z3_assert(isinstance(target, Context), "argument must be a Z3 context") + return _to_ast_ref(Z3_translate(self.ctx.ref(), self.as_ast(), target.ref()), target) + + def hash(self): + """Return a hashcode for the `self`. + + >>> n1 = simplify(Int('x') + 1) + >>> n2 = simplify(2 + Int('x') - 1) + >>> n1.hash() == n2.hash() + True + """ + return Z3_get_ast_hash(self.ctx_ref(), self.as_ast()) + +def is_ast(a): + """Return `True` if `a` is an AST node. + + >>> is_ast(10) + False + >>> is_ast(IntVal(10)) + True + >>> is_ast(Int('x')) + True + >>> is_ast(BoolSort()) + True + >>> is_ast(Function('f', IntSort(), IntSort())) + True + >>> is_ast("x") + False + >>> is_ast(Solver()) + False + """ + return isinstance(a, AstRef) + +def eq(a, b): + """Return `True` if `a` and `b` are structurally identical AST nodes. + + >>> x = Int('x') + >>> y = Int('y') + >>> eq(x, y) + False + >>> eq(x + 1, x + 1) + True + >>> eq(x + 1, 1 + x) + False + >>> eq(simplify(x + 1), simplify(1 + x)) + True + """ + if __debug__: + _z3_assert(is_ast(a) and is_ast(b), "Z3 ASTs expected") + return a.eq(b) + +def _ast_kind(ctx, a): + if is_ast(a): + a = a.as_ast() + return Z3_get_ast_kind(ctx.ref(), a) + +def _ctx_from_ast_arg_list(args, default_ctx=None): + ctx = None + for a in args: + if is_ast(a) or is_probe(a): + if ctx is None: + ctx = a.ctx + else: + if __debug__: + _z3_assert(ctx == a.ctx, "Context mismatch") + if ctx is None: + ctx = default_ctx + return ctx + +def _ctx_from_ast_args(*args): + return _ctx_from_ast_arg_list(args) + +def _to_func_decl_array(args): + sz = len(args) + _args = (FuncDecl * sz)() + for i in range(sz): + _args[i] = args[i].as_func_decl() + return _args, sz + +def _to_ast_array(args): + sz = len(args) + _args = (Ast * sz)() + for i in range(sz): + _args[i] = args[i].as_ast() + return _args, sz + +def _to_ref_array(ref, args): + sz = len(args) + _args = (ref * sz)() + for i in range(sz): + _args[i] = args[i].as_ast() + return _args, sz + +def _to_ast_ref(a, ctx): + k = _ast_kind(ctx, a) + if k == Z3_SORT_AST: + return _to_sort_ref(a, ctx) + elif k == Z3_FUNC_DECL_AST: + return _to_func_decl_ref(a, ctx) + else: + return _to_expr_ref(a, ctx) + +######################################### +# +# Sorts +# +######################################### + +def _sort_kind(ctx, s): + return Z3_get_sort_kind(ctx.ref(), s) + +class SortRef(AstRef): + """A Sort is essentially a type. Every Z3 expression has a sort. A sort is an AST node.""" + def as_ast(self): + return Z3_sort_to_ast(self.ctx_ref(), self.ast) + + def get_id(self): + return Z3_get_ast_id(self.ctx_ref(), self.as_ast()) + + def kind(self): + """Return the Z3 internal kind of a sort. This method can be used to test if `self` is one of the Z3 builtin sorts. + + >>> b = BoolSort() + >>> b.kind() == Z3_BOOL_SORT + True + >>> b.kind() == Z3_INT_SORT + False + >>> A = ArraySort(IntSort(), IntSort()) + >>> A.kind() == Z3_ARRAY_SORT + True + >>> A.kind() == Z3_INT_SORT + False + """ + return _sort_kind(self.ctx, self.ast) + + def subsort(self, other): + """Return `True` if `self` is a subsort of `other`. + + >>> IntSort().subsort(RealSort()) + True + """ + return False + + def cast(self, val): + """Try to cast `val` as an element of sort `self`. + + This method is used in Z3Py to convert Python objects such as integers, + floats, longs and strings into Z3 expressions. + + >>> x = Int('x') + >>> RealSort().cast(x) + ToReal(x) + """ + if __debug__: + _z3_assert(is_expr(val), "Z3 expression expected") + _z3_assert(self.eq(val.sort()), "Sort mismatch") + return val + + def name(self): + """Return the name (string) of sort `self`. + + >>> BoolSort().name() + 'Bool' + >>> ArraySort(IntSort(), IntSort()).name() + 'Array' + """ + return _symbol2py(self.ctx, Z3_get_sort_name(self.ctx_ref(), self.ast)) + + def __eq__(self, other): + """Return `True` if `self` and `other` are the same Z3 sort. + + >>> p = Bool('p') + >>> p.sort() == BoolSort() + True + >>> p.sort() == IntSort() + False + """ + if other is None: + return False + return Z3_is_eq_sort(self.ctx_ref(), self.ast, other.ast) + + def __ne__(self, other): + """Return `True` if `self` and `other` are not the same Z3 sort. + + >>> p = Bool('p') + >>> p.sort() != BoolSort() + False + >>> p.sort() != IntSort() + True + """ + return not Z3_is_eq_sort(self.ctx_ref(), self.ast, other.ast) + + def __hash__(self): + """ Hash code. """ + return AstRef.__hash__(self) + +def is_sort(s): + """Return `True` if `s` is a Z3 sort. + + >>> is_sort(IntSort()) + True + >>> is_sort(Int('x')) + False + >>> is_expr(Int('x')) + True + """ + return isinstance(s, SortRef) + +def _to_sort_ref(s, ctx): + if __debug__: + _z3_assert(isinstance(s, Sort), "Z3 Sort expected") + k = _sort_kind(ctx, s) + if k == Z3_BOOL_SORT: + return BoolSortRef(s, ctx) + elif k == Z3_INT_SORT or k == Z3_REAL_SORT: + return ArithSortRef(s, ctx) + elif k == Z3_BV_SORT: + return BitVecSortRef(s, ctx) + elif k == Z3_ARRAY_SORT: + return ArraySortRef(s, ctx) + elif k == Z3_DATATYPE_SORT: + return DatatypeSortRef(s, ctx) + elif k == Z3_FINITE_DOMAIN_SORT: + return FiniteDomainSortRef(s, ctx) + elif k == Z3_FLOATING_POINT_SORT: + return FPSortRef(s, ctx) + elif k == Z3_ROUNDING_MODE_SORT: + return FPRMSortRef(s, ctx) + return SortRef(s, ctx) + +def _sort(ctx, a): + return _to_sort_ref(Z3_get_sort(ctx.ref(), a), ctx) + +def DeclareSort(name, ctx=None): + """Create a new uninterpred sort named `name`. + + If `ctx=None`, then the new sort is declared in the global Z3Py context. + + >>> A = DeclareSort('A') + >>> a = Const('a', A) + >>> b = Const('b', A) + >>> a.sort() == A + True + >>> b.sort() == A + True + >>> a == b + a == b + """ + ctx = _get_ctx(ctx) + return SortRef(Z3_mk_uninterpreted_sort(ctx.ref(), to_symbol(name, ctx)), ctx) + +######################################### +# +# Function Declarations +# +######################################### + +class FuncDeclRef(AstRef): + """Function declaration. Every constant and function have an associated declaration. + + The declaration assigns a name, a sort (i.e., type), and for function + the sort (i.e., type) of each of its arguments. Note that, in Z3, + a constant is a function with 0 arguments. + """ + def as_ast(self): + return Z3_func_decl_to_ast(self.ctx_ref(), self.ast) + + def get_id(self): + return Z3_get_ast_id(self.ctx_ref(), self.as_ast()) + + def as_func_decl(self): + return self.ast + + def name(self): + """Return the name of the function declaration `self`. + + >>> f = Function('f', IntSort(), IntSort()) + >>> f.name() + 'f' + >>> isinstance(f.name(), str) + True + """ + return _symbol2py(self.ctx, Z3_get_decl_name(self.ctx_ref(), self.ast)) + + def arity(self): + """Return the number of arguments of a function declaration. If `self` is a constant, then `self.arity()` is 0. + + >>> f = Function('f', IntSort(), RealSort(), BoolSort()) + >>> f.arity() + 2 + """ + return int(Z3_get_arity(self.ctx_ref(), self.ast)) + + def domain(self, i): + """Return the sort of the argument `i` of a function declaration. This method assumes that `0 <= i < self.arity()`. + + >>> f = Function('f', IntSort(), RealSort(), BoolSort()) + >>> f.domain(0) + Int + >>> f.domain(1) + Real + """ + if __debug__: + _z3_assert(i < self.arity(), "Index out of bounds") + return _to_sort_ref(Z3_get_domain(self.ctx_ref(), self.ast, i), self.ctx) + + def range(self): + """Return the sort of the range of a function declaration. For constants, this is the sort of the constant. + + >>> f = Function('f', IntSort(), RealSort(), BoolSort()) + >>> f.range() + Bool + """ + return _to_sort_ref(Z3_get_range(self.ctx_ref(), self.ast), self.ctx) + + def kind(self): + """Return the internal kind of a function declaration. It can be used to identify Z3 built-in functions such as addition, multiplication, etc. + + >>> x = Int('x') + >>> d = (x + 1).decl() + >>> d.kind() == Z3_OP_ADD + True + >>> d.kind() == Z3_OP_MUL + False + """ + return Z3_get_decl_kind(self.ctx_ref(), self.ast) + + def params(self): + ctx = self.ctx + n = Z3_get_decl_num_parameters(self.ctx_ref(), self.ast) + result = [ None for i in range(n) ] + for i in range(n): + k = Z3_get_decl_parameter_kind(self.ctx_ref(), self.ast, i) + if k == Z3_PARAMETER_INT: + result[i] = Z3_get_decl_int_parameter(self.ctx_ref(), self.ast, i) + elif k == Z3_PARAMETER_DOUBLE: + result[i] = Z3_get_decl_double_parameter(self.ctx_ref(), self.ast, i) + elif k == Z3_PARAMETER_RATIONAL: + result[i] = Z3_get_decl_rational_parameter(self.ctx_ref(), self.ast, i) + elif k == Z3_PARAMETER_SYMBOL: + result[i] = Z3_get_decl_symbol_parameter(self.ctx_ref(), self.ast, i) + elif k == Z3_PARAMETER_SORT: + result[i] = SortRef(Z3_get_decl_sort_parameter(self.ctx_ref(), self.ast, i), ctx) + elif k == Z3_PARAMETER_AST: + result[i] = ExprRef(Z3_get_decl_ast_parameter(self.ctx_ref(), self.ast, i), ctx) + elif k == Z3_PARAMETER_FUNC_DECL: + result[i] = FuncDeclRef(Z3_get_decl_func_decl_parameter(self.ctx_ref(), self.ast, i), ctx) + else: + assert(False) + return result + + def __call__(self, *args): + """Create a Z3 application expression using the function `self`, and the given arguments. + + The arguments must be Z3 expressions. This method assumes that + the sorts of the elements in `args` match the sorts of the + domain. Limited coersion is supported. For example, if + args[0] is a Python integer, and the function expects a Z3 + integer, then the argument is automatically converted into a + Z3 integer. + + >>> f = Function('f', IntSort(), RealSort(), BoolSort()) + >>> x = Int('x') + >>> y = Real('y') + >>> f(x, y) + f(x, y) + >>> f(x, x) + f(x, ToReal(x)) + """ + args = _get_args(args) + num = len(args) + if __debug__: + _z3_assert(num == self.arity(), "Incorrect number of arguments to %s" % self) + _args = (Ast * num)() + saved = [] + for i in range(num): + # self.domain(i).cast(args[i]) may create a new Z3 expression, + # then we must save in 'saved' to prevent it from being garbage collected. + tmp = self.domain(i).cast(args[i]) + saved.append(tmp) + _args[i] = tmp.as_ast() + return _to_expr_ref(Z3_mk_app(self.ctx_ref(), self.ast, len(args), _args), self.ctx) + +def is_func_decl(a): + """Return `True` if `a` is a Z3 function declaration. + + >>> f = Function('f', IntSort(), IntSort()) + >>> is_func_decl(f) + True + >>> x = Real('x') + >>> is_func_decl(x) + False + """ + return isinstance(a, FuncDeclRef) + +def Function(name, *sig): + """Create a new Z3 uninterpreted function with the given sorts. + + >>> f = Function('f', IntSort(), IntSort()) + >>> f(f(0)) + f(f(0)) + """ + sig = _get_args(sig) + if __debug__: + _z3_assert(len(sig) > 0, "At least two arguments expected") + arity = len(sig) - 1 + rng = sig[arity] + if __debug__: + _z3_assert(is_sort(rng), "Z3 sort expected") + dom = (Sort * arity)() + for i in range(arity): + if __debug__: + _z3_assert(is_sort(sig[i]), "Z3 sort expected") + dom[i] = sig[i].ast + ctx = rng.ctx + return FuncDeclRef(Z3_mk_func_decl(ctx.ref(), to_symbol(name, ctx), arity, dom, rng.ast), ctx) + +def _to_func_decl_ref(a, ctx): + return FuncDeclRef(a, ctx) + +######################################### +# +# Expressions +# +######################################### + +class ExprRef(AstRef): + """Constraints, formulas and terms are expressions in Z3. + + Expressions are ASTs. Every expression has a sort. + There are three main kinds of expressions: + function applications, quantifiers and bounded variables. + A constant is a function application with 0 arguments. + For quantifier free problems, all expressions are + function applications. + """ + def as_ast(self): + return self.ast + + def get_id(self): + return Z3_get_ast_id(self.ctx_ref(), self.as_ast()) + + def sort(self): + """Return the sort of expression `self`. + + >>> x = Int('x') + >>> (x + 1).sort() + Int + >>> y = Real('y') + >>> (x + y).sort() + Real + """ + return _sort(self.ctx, self.as_ast()) + + def sort_kind(self): + """Shorthand for `self.sort().kind()`. + + >>> a = Array('a', IntSort(), IntSort()) + >>> a.sort_kind() == Z3_ARRAY_SORT + True + >>> a.sort_kind() == Z3_INT_SORT + False + """ + return self.sort().kind() + + def __eq__(self, other): + """Return a Z3 expression that represents the constraint `self == other`. + + If `other` is `None`, then this method simply returns `False`. + + >>> a = Int('a') + >>> b = Int('b') + >>> a == b + a == b + >>> a is None + False + """ + if other is None: + return False + a, b = _coerce_exprs(self, other) + return BoolRef(Z3_mk_eq(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __hash__(self): + """ Hash code. """ + return AstRef.__hash__(self) + + def __ne__(self, other): + """Return a Z3 expression that represents the constraint `self != other`. + + If `other` is `None`, then this method simply returns `True`. + + >>> a = Int('a') + >>> b = Int('b') + >>> a != b + a != b + >>> a is not None + True + """ + if other is None: + return True + a, b = _coerce_exprs(self, other) + _args, sz = _to_ast_array((a, b)) + return BoolRef(Z3_mk_distinct(self.ctx_ref(), 2, _args), self.ctx) + + def params(self): + return self.decl().params() + + def decl(self): + """Return the Z3 function declaration associated with a Z3 application. + + >>> f = Function('f', IntSort(), IntSort()) + >>> a = Int('a') + >>> t = f(a) + >>> eq(t.decl(), f) + True + >>> (a + 1).decl() + + + """ + if __debug__: + _z3_assert(is_app(self), "Z3 application expected") + return FuncDeclRef(Z3_get_app_decl(self.ctx_ref(), self.as_ast()), self.ctx) + + def num_args(self): + """Return the number of arguments of a Z3 application. + + >>> a = Int('a') + >>> b = Int('b') + >>> (a + b).num_args() + 2 + >>> f = Function('f', IntSort(), IntSort(), IntSort(), IntSort()) + >>> t = f(a, b, 0) + >>> t.num_args() + 3 + """ + if __debug__: + _z3_assert(is_app(self), "Z3 application expected") + return int(Z3_get_app_num_args(self.ctx_ref(), self.as_ast())) + + def arg(self, idx): + """Return argument `idx` of the application `self`. + + This method assumes that `self` is a function application with at least `idx+1` arguments. + + >>> a = Int('a') + >>> b = Int('b') + >>> f = Function('f', IntSort(), IntSort(), IntSort(), IntSort()) + >>> t = f(a, b, 0) + >>> t.arg(0) + a + >>> t.arg(1) + b + >>> t.arg(2) + 0 + """ + if __debug__: + _z3_assert(is_app(self), "Z3 application expected") + _z3_assert(idx < self.num_args(), "Invalid argument index") + return _to_expr_ref(Z3_get_app_arg(self.ctx_ref(), self.as_ast(), idx), self.ctx) + + def children(self): + """Return a list containing the children of the given expression + + >>> a = Int('a') + >>> b = Int('b') + >>> f = Function('f', IntSort(), IntSort(), IntSort(), IntSort()) + >>> t = f(a, b, 0) + >>> t.children() + [a, b, 0] + """ + if is_app(self): + return [self.arg(i) for i in range(self.num_args())] + else: + return [] + +def _to_expr_ref(a, ctx): + if isinstance(a, Pattern): + return PatternRef(a, ctx) + ctx_ref = ctx.ref() + k = Z3_get_ast_kind(ctx_ref, a) + if k == Z3_QUANTIFIER_AST: + return QuantifierRef(a, ctx) + sk = Z3_get_sort_kind(ctx_ref, Z3_get_sort(ctx_ref, a)) + if sk == Z3_BOOL_SORT: + return BoolRef(a, ctx) + if sk == Z3_INT_SORT: + if k == Z3_NUMERAL_AST: + return IntNumRef(a, ctx) + return ArithRef(a, ctx) + if sk == Z3_REAL_SORT: + if k == Z3_NUMERAL_AST: + return RatNumRef(a, ctx) + if _is_algebraic(ctx, a): + return AlgebraicNumRef(a, ctx) + return ArithRef(a, ctx) + if sk == Z3_BV_SORT: + if k == Z3_NUMERAL_AST: + return BitVecNumRef(a, ctx) + else: + return BitVecRef(a, ctx) + if sk == Z3_ARRAY_SORT: + return ArrayRef(a, ctx) + if sk == Z3_DATATYPE_SORT: + return DatatypeRef(a, ctx) + if sk == Z3_FLOATING_POINT_SORT: + if k == Z3_APP_AST and _is_numeral(ctx, a): + return FPNumRef(a, ctx) + else: + return FPRef(a, ctx) + if sk == Z3_FINITE_DOMAIN_SORT: + if k == Z3_NUMERAL_AST: + return FiniteDomainNumRef(a, ctx) + else: + return FiniteDomainRef(a, ctx) + if sk == Z3_ROUNDING_MODE_SORT: + return FPRMRef(a, ctx) + if sk == Z3_SEQ_SORT: + return SeqRef(a, ctx) + if sk == Z3_RE_SORT: + return ReRef(a, ctx) + return ExprRef(a, ctx) + +def _coerce_expr_merge(s, a): + if is_expr(a): + s1 = a.sort() + if s is None: + return s1 + if s1.eq(s): + return s + elif s.subsort(s1): + return s1 + elif s1.subsort(s): + return s + else: + if __debug__: + _z3_assert(s1.ctx == s.ctx, "context mismatch") + _z3_assert(False, "sort mismatch") + else: + return s + +def _coerce_exprs(a, b, ctx=None): + if not is_expr(a) and not is_expr(b): + a = _py2expr(a, ctx) + b = _py2expr(b, ctx) + s = None + s = _coerce_expr_merge(s, a) + s = _coerce_expr_merge(s, b) + a = s.cast(a) + b = s.cast(b) + return (a, b) + + +def _reduce(f, l, a): + r = a + for e in l: + r = f(r, e) + return r + +def _coerce_expr_list(alist, ctx=None): + has_expr = False + for a in alist: + if is_expr(a): + has_expr = True + break + if not has_expr: + alist = [ _py2expr(a, ctx) for a in alist ] + s = _reduce(_coerce_expr_merge, alist, None) + return [ s.cast(a) for a in alist ] + +def is_expr(a): + """Return `True` if `a` is a Z3 expression. + + >>> a = Int('a') + >>> is_expr(a) + True + >>> is_expr(a + 1) + True + >>> is_expr(IntSort()) + False + >>> is_expr(1) + False + >>> is_expr(IntVal(1)) + True + >>> x = Int('x') + >>> is_expr(ForAll(x, x >= 0)) + True + >>> is_expr(FPVal(1.0)) + True + """ + return isinstance(a, ExprRef) + +def is_app(a): + """Return `True` if `a` is a Z3 function application. + + Note that, constants are function applications with 0 arguments. + + >>> a = Int('a') + >>> is_app(a) + True + >>> is_app(a + 1) + True + >>> is_app(IntSort()) + False + >>> is_app(1) + False + >>> is_app(IntVal(1)) + True + >>> x = Int('x') + >>> is_app(ForAll(x, x >= 0)) + False + """ + if not isinstance(a, ExprRef): + return False + k = _ast_kind(a.ctx, a) + return k == Z3_NUMERAL_AST or k == Z3_APP_AST + +def is_const(a): + """Return `True` if `a` is Z3 constant/variable expression. + + >>> a = Int('a') + >>> is_const(a) + True + >>> is_const(a + 1) + False + >>> is_const(1) + False + >>> is_const(IntVal(1)) + True + >>> x = Int('x') + >>> is_const(ForAll(x, x >= 0)) + False + """ + return is_app(a) and a.num_args() == 0 + +def is_var(a): + """Return `True` if `a` is variable. + + Z3 uses de-Bruijn indices for representing bound variables in + quantifiers. + + >>> x = Int('x') + >>> is_var(x) + False + >>> is_const(x) + True + >>> f = Function('f', IntSort(), IntSort()) + >>> # Z3 replaces x with bound variables when ForAll is executed. + >>> q = ForAll(x, f(x) == x) + >>> b = q.body() + >>> b + f(Var(0)) == Var(0) + >>> b.arg(1) + Var(0) + >>> is_var(b.arg(1)) + True + """ + return is_expr(a) and _ast_kind(a.ctx, a) == Z3_VAR_AST + +def get_var_index(a): + """Return the de-Bruijn index of the Z3 bounded variable `a`. + + >>> x = Int('x') + >>> y = Int('y') + >>> is_var(x) + False + >>> is_const(x) + True + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> # Z3 replaces x and y with bound variables when ForAll is executed. + >>> q = ForAll([x, y], f(x, y) == x + y) + >>> q.body() + f(Var(1), Var(0)) == Var(1) + Var(0) + >>> b = q.body() + >>> b.arg(0) + f(Var(1), Var(0)) + >>> v1 = b.arg(0).arg(0) + >>> v2 = b.arg(0).arg(1) + >>> v1 + Var(1) + >>> v2 + Var(0) + >>> get_var_index(v1) + 1 + >>> get_var_index(v2) + 0 + """ + if __debug__: + _z3_assert(is_var(a), "Z3 bound variable expected") + return int(Z3_get_index_value(a.ctx.ref(), a.as_ast())) + +def is_app_of(a, k): + """Return `True` if `a` is an application of the given kind `k`. + + >>> x = Int('x') + >>> n = x + 1 + >>> is_app_of(n, Z3_OP_ADD) + True + >>> is_app_of(n, Z3_OP_MUL) + False + """ + return is_app(a) and a.decl().kind() == k + +def If(a, b, c, ctx=None): + """Create a Z3 if-then-else expression. + + >>> x = Int('x') + >>> y = Int('y') + >>> max = If(x > y, x, y) + >>> max + If(x > y, x, y) + >>> simplify(max) + If(x <= y, y, x) + """ + if isinstance(a, Probe) or isinstance(b, Tactic) or isinstance(c, Tactic): + return Cond(a, b, c, ctx) + else: + ctx = _get_ctx(_ctx_from_ast_arg_list([a, b, c], ctx)) + s = BoolSort(ctx) + a = s.cast(a) + b, c = _coerce_exprs(b, c, ctx) + if __debug__: + _z3_assert(a.ctx == b.ctx, "Context mismatch") + return _to_expr_ref(Z3_mk_ite(ctx.ref(), a.as_ast(), b.as_ast(), c.as_ast()), ctx) + +def Distinct(*args): + """Create a Z3 distinct expression. + + >>> x = Int('x') + >>> y = Int('y') + >>> Distinct(x, y) + x != y + >>> z = Int('z') + >>> Distinct(x, y, z) + Distinct(x, y, z) + >>> simplify(Distinct(x, y, z)) + Distinct(x, y, z) + >>> simplify(Distinct(x, y, z), blast_distinct=True) + And(Not(x == y), Not(x == z), Not(y == z)) + """ + args = _get_args(args) + ctx = _ctx_from_ast_arg_list(args) + if __debug__: + _z3_assert(ctx is not None, "At least one of the arguments must be a Z3 expression") + args = _coerce_expr_list(args, ctx) + _args, sz = _to_ast_array(args) + return BoolRef(Z3_mk_distinct(ctx.ref(), sz, _args), ctx) + +def _mk_bin(f, a, b): + args = (Ast * 2)() + if __debug__: + _z3_assert(a.ctx == b.ctx, "Context mismatch") + args[0] = a.as_ast() + args[1] = b.as_ast() + return f(a.ctx.ref(), 2, args) + +def Const(name, sort): + """Create a constant of the given sort. + + >>> Const('x', IntSort()) + x + """ + if __debug__: + _z3_assert(isinstance(sort, SortRef), "Z3 sort expected") + ctx = sort.ctx + return _to_expr_ref(Z3_mk_const(ctx.ref(), to_symbol(name, ctx), sort.ast), ctx) + +def Consts(names, sort): + """Create a several constants of the given sort. + + `names` is a string containing the names of all constants to be created. + Blank spaces separate the names of different constants. + + >>> x, y, z = Consts('x y z', IntSort()) + >>> x + y + z + x + y + z + """ + if isinstance(names, str): + names = names.split(" ") + return [Const(name, sort) for name in names] + +def Var(idx, s): + """Create a Z3 free variable. Free variables are used to create quantified formulas. + + >>> Var(0, IntSort()) + Var(0) + >>> eq(Var(0, IntSort()), Var(0, BoolSort())) + False + """ + if __debug__: + _z3_assert(is_sort(s), "Z3 sort expected") + return _to_expr_ref(Z3_mk_bound(s.ctx_ref(), idx, s.ast), s.ctx) + +def RealVar(idx, ctx=None): + """ + Create a real free variable. Free variables are used to create quantified formulas. + They are also used to create polynomials. + + >>> RealVar(0) + Var(0) + """ + return Var(idx, RealSort(ctx)) + +def RealVarVector(n, ctx=None): + """ + Create a list of Real free variables. + The variables have ids: 0, 1, ..., n-1 + + >>> x0, x1, x2, x3 = RealVarVector(4) + >>> x2 + Var(2) + """ + return [ RealVar(i, ctx) for i in range(n) ] + +######################################### +# +# Booleans +# +######################################### + +class BoolSortRef(SortRef): + """Boolean sort.""" + def cast(self, val): + """Try to cast `val` as a Boolean. + + >>> x = BoolSort().cast(True) + >>> x + True + >>> is_expr(x) + True + >>> is_expr(True) + False + >>> x.sort() + Bool + """ + if isinstance(val, bool): + return BoolVal(val, self.ctx) + if __debug__: + if not is_expr(val): + _z3_assert(is_expr(val), "True, False or Z3 Boolean expression expected. Received %s" % val) + if not self.eq(val.sort()): + _z3_assert(self.eq(val.sort()), "Value cannot be converted into a Z3 Boolean value") + return val + + def subsort(self, other): + return isinstance(other, ArithSortRef) + + def is_int(self): + return True + + def is_bool(self): + return True + + +class BoolRef(ExprRef): + """All Boolean expressions are instances of this class.""" + def sort(self): + return BoolSortRef(Z3_get_sort(self.ctx_ref(), self.as_ast()), self.ctx) + + def __rmul__(self, other): + return self * other + + def __mul__(self, other): + """Create the Z3 expression `self * other`. + """ + if other == 1: + return self + if other == 0: + return 0 + return If(self, other, 0) + + +def is_bool(a): + """Return `True` if `a` is a Z3 Boolean expression. + + >>> p = Bool('p') + >>> is_bool(p) + True + >>> q = Bool('q') + >>> is_bool(And(p, q)) + True + >>> x = Real('x') + >>> is_bool(x) + False + >>> is_bool(x == 0) + True + """ + return isinstance(a, BoolRef) + +def is_true(a): + """Return `True` if `a` is the Z3 true expression. + + >>> p = Bool('p') + >>> is_true(p) + False + >>> is_true(simplify(p == p)) + True + >>> x = Real('x') + >>> is_true(x == 0) + False + >>> # True is a Python Boolean expression + >>> is_true(True) + False + """ + return is_app_of(a, Z3_OP_TRUE) + +def is_false(a): + """Return `True` if `a` is the Z3 false expression. + + >>> p = Bool('p') + >>> is_false(p) + False + >>> is_false(False) + False + >>> is_false(BoolVal(False)) + True + """ + return is_app_of(a, Z3_OP_FALSE) + +def is_and(a): + """Return `True` if `a` is a Z3 and expression. + + >>> p, q = Bools('p q') + >>> is_and(And(p, q)) + True + >>> is_and(Or(p, q)) + False + """ + return is_app_of(a, Z3_OP_AND) + +def is_or(a): + """Return `True` if `a` is a Z3 or expression. + + >>> p, q = Bools('p q') + >>> is_or(Or(p, q)) + True + >>> is_or(And(p, q)) + False + """ + return is_app_of(a, Z3_OP_OR) + +def is_not(a): + """Return `True` if `a` is a Z3 not expression. + + >>> p = Bool('p') + >>> is_not(p) + False + >>> is_not(Not(p)) + True + """ + return is_app_of(a, Z3_OP_NOT) + +def is_eq(a): + """Return `True` if `a` is a Z3 equality expression. + + >>> x, y = Ints('x y') + >>> is_eq(x == y) + True + """ + return is_app_of(a, Z3_OP_EQ) + +def is_distinct(a): + """Return `True` if `a` is a Z3 distinct expression. + + >>> x, y, z = Ints('x y z') + >>> is_distinct(x == y) + False + >>> is_distinct(Distinct(x, y, z)) + True + """ + return is_app_of(a, Z3_OP_DISTINCT) + +def BoolSort(ctx=None): + """Return the Boolean Z3 sort. If `ctx=None`, then the global context is used. + + >>> BoolSort() + Bool + >>> p = Const('p', BoolSort()) + >>> is_bool(p) + True + >>> r = Function('r', IntSort(), IntSort(), BoolSort()) + >>> r(0, 1) + r(0, 1) + >>> is_bool(r(0, 1)) + True + """ + ctx = _get_ctx(ctx) + return BoolSortRef(Z3_mk_bool_sort(ctx.ref()), ctx) + +def BoolVal(val, ctx=None): + """Return the Boolean value `True` or `False`. If `ctx=None`, then the global context is used. + + >>> BoolVal(True) + True + >>> is_true(BoolVal(True)) + True + >>> is_true(True) + False + >>> is_false(BoolVal(False)) + True + """ + ctx = _get_ctx(ctx) + if val == False: + return BoolRef(Z3_mk_false(ctx.ref()), ctx) + else: + return BoolRef(Z3_mk_true(ctx.ref()), ctx) + +def Bool(name, ctx=None): + """Return a Boolean constant named `name`. If `ctx=None`, then the global context is used. + + >>> p = Bool('p') + >>> q = Bool('q') + >>> And(p, q) + And(p, q) + """ + ctx = _get_ctx(ctx) + return BoolRef(Z3_mk_const(ctx.ref(), to_symbol(name, ctx), BoolSort(ctx).ast), ctx) + +def Bools(names, ctx=None): + """Return a tuple of Boolean constants. + + `names` is a single string containing all names separated by blank spaces. + If `ctx=None`, then the global context is used. + + >>> p, q, r = Bools('p q r') + >>> And(p, Or(q, r)) + And(p, Or(q, r)) + """ + ctx = _get_ctx(ctx) + if isinstance(names, str): + names = names.split(" ") + return [Bool(name, ctx) for name in names] + +def BoolVector(prefix, sz, ctx=None): + """Return a list of Boolean constants of size `sz`. + + The constants are named using the given prefix. + If `ctx=None`, then the global context is used. + + >>> P = BoolVector('p', 3) + >>> P + [p__0, p__1, p__2] + >>> And(P) + And(p__0, p__1, p__2) + """ + return [ Bool('%s__%s' % (prefix, i)) for i in range(sz) ] + +def FreshBool(prefix='b', ctx=None): + """Return a fresh Boolean constant in the given context using the given prefix. + + If `ctx=None`, then the global context is used. + + >>> b1 = FreshBool() + >>> b2 = FreshBool() + >>> eq(b1, b2) + False + """ + ctx = _get_ctx(ctx) + return BoolRef(Z3_mk_fresh_const(ctx.ref(), prefix, BoolSort(ctx).ast), ctx) + +def Implies(a, b, ctx=None): + """Create a Z3 implies expression. + + >>> p, q = Bools('p q') + >>> Implies(p, q) + Implies(p, q) + >>> simplify(Implies(p, q)) + Or(Not(p), q) + """ + ctx = _get_ctx(_ctx_from_ast_arg_list([a, b], ctx)) + s = BoolSort(ctx) + a = s.cast(a) + b = s.cast(b) + return BoolRef(Z3_mk_implies(ctx.ref(), a.as_ast(), b.as_ast()), ctx) + +def Xor(a, b, ctx=None): + """Create a Z3 Xor expression. + + >>> p, q = Bools('p q') + >>> Xor(p, q) + Xor(p, q) + >>> simplify(Xor(p, q)) + Not(p) == q + """ + ctx = _get_ctx(_ctx_from_ast_arg_list([a, b], ctx)) + s = BoolSort(ctx) + a = s.cast(a) + b = s.cast(b) + return BoolRef(Z3_mk_xor(ctx.ref(), a.as_ast(), b.as_ast()), ctx) + +def Not(a, ctx=None): + """Create a Z3 not expression or probe. + + >>> p = Bool('p') + >>> Not(Not(p)) + Not(Not(p)) + >>> simplify(Not(Not(p))) + p + """ + ctx = _get_ctx(_ctx_from_ast_arg_list([a], ctx)) + if is_probe(a): + # Not is also used to build probes + return Probe(Z3_probe_not(ctx.ref(), a.probe), ctx) + else: + s = BoolSort(ctx) + a = s.cast(a) + return BoolRef(Z3_mk_not(ctx.ref(), a.as_ast()), ctx) + +def _has_probe(args): + """Return `True` if one of the elements of the given collection is a Z3 probe.""" + for arg in args: + if is_probe(arg): + return True + return False + +def And(*args): + """Create a Z3 and-expression or and-probe. + + >>> p, q, r = Bools('p q r') + >>> And(p, q, r) + And(p, q, r) + >>> P = BoolVector('p', 5) + >>> And(P) + And(p__0, p__1, p__2, p__3, p__4) + """ + last_arg = None + if len(args) > 0: + last_arg = args[len(args)-1] + if isinstance(last_arg, Context): + ctx = args[len(args)-1] + args = args[:len(args)-1] + elif len(args) == 1 and isinstance(args[0], AstVector): + ctx = args[0].ctx + args = [a for a in args[0]] + else: + ctx = main_ctx() + args = _get_args(args) + ctx_args = _ctx_from_ast_arg_list(args, ctx) + if __debug__: + _z3_assert(ctx_args is None or ctx_args == ctx, "context mismatch") + _z3_assert(ctx is not None, "At least one of the arguments must be a Z3 expression or probe") + if _has_probe(args): + return _probe_and(args, ctx) + else: + args = _coerce_expr_list(args, ctx) + _args, sz = _to_ast_array(args) + return BoolRef(Z3_mk_and(ctx.ref(), sz, _args), ctx) + +def Or(*args): + """Create a Z3 or-expression or or-probe. + + >>> p, q, r = Bools('p q r') + >>> Or(p, q, r) + Or(p, q, r) + >>> P = BoolVector('p', 5) + >>> Or(P) + Or(p__0, p__1, p__2, p__3, p__4) + """ + last_arg = None + if len(args) > 0: + last_arg = args[len(args)-1] + if isinstance(last_arg, Context): + ctx = args[len(args)-1] + args = args[:len(args)-1] + else: + ctx = main_ctx() + args = _get_args(args) + ctx_args = _ctx_from_ast_arg_list(args, ctx) + if __debug__: + _z3_assert(ctx_args is None or ctx_args == ctx, "context mismatch") + _z3_assert(ctx is not None, "At least one of the arguments must be a Z3 expression or probe") + if _has_probe(args): + return _probe_or(args, ctx) + else: + args = _coerce_expr_list(args, ctx) + _args, sz = _to_ast_array(args) + return BoolRef(Z3_mk_or(ctx.ref(), sz, _args), ctx) + +######################################### +# +# Patterns +# +######################################### + +class PatternRef(ExprRef): + """Patterns are hints for quantifier instantiation. + + See http://rise4fun.com/Z3Py/tutorial/advanced for more details. + """ + def as_ast(self): + return Z3_pattern_to_ast(self.ctx_ref(), self.ast) + + def get_id(self): + return Z3_get_ast_id(self.ctx_ref(), self.as_ast()) + +def is_pattern(a): + """Return `True` if `a` is a Z3 pattern (hint for quantifier instantiation. + + See http://rise4fun.com/Z3Py/tutorial/advanced for more details. + + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> q = ForAll(x, f(x) == 0, patterns = [ f(x) ]) + >>> q + ForAll(x, f(x) == 0) + >>> q.num_patterns() + 1 + >>> is_pattern(q.pattern(0)) + True + >>> q.pattern(0) + f(Var(0)) + """ + return isinstance(a, PatternRef) + +def MultiPattern(*args): + """Create a Z3 multi-pattern using the given expressions `*args` + + See http://rise4fun.com/Z3Py/tutorial/advanced for more details. + + >>> f = Function('f', IntSort(), IntSort()) + >>> g = Function('g', IntSort(), IntSort()) + >>> x = Int('x') + >>> q = ForAll(x, f(x) != g(x), patterns = [ MultiPattern(f(x), g(x)) ]) + >>> q + ForAll(x, f(x) != g(x)) + >>> q.num_patterns() + 1 + >>> is_pattern(q.pattern(0)) + True + >>> q.pattern(0) + MultiPattern(f(Var(0)), g(Var(0))) + """ + if __debug__: + _z3_assert(len(args) > 0, "At least one argument expected") + _z3_assert(all([ is_expr(a) for a in args ]), "Z3 expressions expected") + ctx = args[0].ctx + args, sz = _to_ast_array(args) + return PatternRef(Z3_mk_pattern(ctx.ref(), sz, args), ctx) + +def _to_pattern(arg): + if is_pattern(arg): + return arg + else: + return MultiPattern(arg) + +######################################### +# +# Quantifiers +# +######################################### + +class QuantifierRef(BoolRef): + """Universally and Existentially quantified formulas.""" + + def as_ast(self): + return self.ast + + def get_id(self): + return Z3_get_ast_id(self.ctx_ref(), self.as_ast()) + + def sort(self): + """Return the Boolean sort.""" + return BoolSort(self.ctx) + + def is_forall(self): + """Return `True` if `self` is a universal quantifier. + + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> q = ForAll(x, f(x) == 0) + >>> q.is_forall() + True + >>> q = Exists(x, f(x) != 0) + >>> q.is_forall() + False + """ + return Z3_is_quantifier_forall(self.ctx_ref(), self.ast) + + def weight(self): + """Return the weight annotation of `self`. + + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> q = ForAll(x, f(x) == 0) + >>> q.weight() + 1 + >>> q = ForAll(x, f(x) == 0, weight=10) + >>> q.weight() + 10 + """ + return int(Z3_get_quantifier_weight(self.ctx_ref(), self.ast)) + + def num_patterns(self): + """Return the number of patterns (i.e., quantifier instantiation hints) in `self`. + + >>> f = Function('f', IntSort(), IntSort()) + >>> g = Function('g', IntSort(), IntSort()) + >>> x = Int('x') + >>> q = ForAll(x, f(x) != g(x), patterns = [ f(x), g(x) ]) + >>> q.num_patterns() + 2 + """ + return int(Z3_get_quantifier_num_patterns(self.ctx_ref(), self.ast)) + + def pattern(self, idx): + """Return a pattern (i.e., quantifier instantiation hints) in `self`. + + >>> f = Function('f', IntSort(), IntSort()) + >>> g = Function('g', IntSort(), IntSort()) + >>> x = Int('x') + >>> q = ForAll(x, f(x) != g(x), patterns = [ f(x), g(x) ]) + >>> q.num_patterns() + 2 + >>> q.pattern(0) + f(Var(0)) + >>> q.pattern(1) + g(Var(0)) + """ + if __debug__: + _z3_assert(idx < self.num_patterns(), "Invalid pattern idx") + return PatternRef(Z3_get_quantifier_pattern_ast(self.ctx_ref(), self.ast, idx), self.ctx) + + def num_no_patterns(self): + """Return the number of no-patterns.""" + return Z3_get_quantifier_num_no_patterns(self.ctx_ref(), self.ast) + + def no_pattern(self, idx): + """Return a no-pattern.""" + if __debug__: + _z3_assert(idx < self.num_no_patterns(), "Invalid no-pattern idx") + return _to_expr_ref(Z3_get_quantifier_no_pattern_ast(self.ctx_ref(), self.ast, idx), self.ctx) + + def body(self): + """Return the expression being quantified. + + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> q = ForAll(x, f(x) == 0) + >>> q.body() + f(Var(0)) == 0 + """ + return _to_expr_ref(Z3_get_quantifier_body(self.ctx_ref(), self.ast), self.ctx) + + def num_vars(self): + """Return the number of variables bounded by this quantifier. + + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> x = Int('x') + >>> y = Int('y') + >>> q = ForAll([x, y], f(x, y) >= x) + >>> q.num_vars() + 2 + """ + return int(Z3_get_quantifier_num_bound(self.ctx_ref(), self.ast)) + + def var_name(self, idx): + """Return a string representing a name used when displaying the quantifier. + + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> x = Int('x') + >>> y = Int('y') + >>> q = ForAll([x, y], f(x, y) >= x) + >>> q.var_name(0) + 'x' + >>> q.var_name(1) + 'y' + """ + if __debug__: + _z3_assert(idx < self.num_vars(), "Invalid variable idx") + return _symbol2py(self.ctx, Z3_get_quantifier_bound_name(self.ctx_ref(), self.ast, idx)) + + def var_sort(self, idx): + """Return the sort of a bound variable. + + >>> f = Function('f', IntSort(), RealSort(), IntSort()) + >>> x = Int('x') + >>> y = Real('y') + >>> q = ForAll([x, y], f(x, y) >= x) + >>> q.var_sort(0) + Int + >>> q.var_sort(1) + Real + """ + if __debug__: + _z3_assert(idx < self.num_vars(), "Invalid variable idx") + return _to_sort_ref(Z3_get_quantifier_bound_sort(self.ctx_ref(), self.ast, idx), self.ctx) + + def children(self): + """Return a list containing a single element self.body() + + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> q = ForAll(x, f(x) == 0) + >>> q.children() + [f(Var(0)) == 0] + """ + return [ self.body() ] + +def is_quantifier(a): + """Return `True` if `a` is a Z3 quantifier. + + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> q = ForAll(x, f(x) == 0) + >>> is_quantifier(q) + True + >>> is_quantifier(f(x)) + False + """ + return isinstance(a, QuantifierRef) + +def _mk_quantifier(is_forall, vs, body, weight=1, qid="", skid="", patterns=[], no_patterns=[]): + if __debug__: + _z3_assert(is_bool(body), "Z3 expression expected") + _z3_assert(is_const(vs) or (len(vs) > 0 and all([ is_const(v) for v in vs])), "Invalid bounded variable(s)") + _z3_assert(all([is_pattern(a) or is_expr(a) for a in patterns]), "Z3 patterns expected") + _z3_assert(all([is_expr(p) for p in no_patterns]), "no patterns are Z3 expressions") + ctx = body.ctx + if is_app(vs): + vs = [vs] + num_vars = len(vs) + if num_vars == 0: + return body + _vs = (Ast * num_vars)() + for i in range(num_vars): + ## TODO: Check if is constant + _vs[i] = vs[i].as_ast() + patterns = [ _to_pattern(p) for p in patterns ] + num_pats = len(patterns) + _pats = (Pattern * num_pats)() + for i in range(num_pats): + _pats[i] = patterns[i].ast + _no_pats, num_no_pats = _to_ast_array(no_patterns) + qid = to_symbol(qid, ctx) + skid = to_symbol(skid, ctx) + return QuantifierRef(Z3_mk_quantifier_const_ex(ctx.ref(), is_forall, weight, qid, skid, + num_vars, _vs, + num_pats, _pats, + num_no_pats, _no_pats, + body.as_ast()), ctx) + +def ForAll(vs, body, weight=1, qid="", skid="", patterns=[], no_patterns=[]): + """Create a Z3 forall formula. + + The parameters `weight`, `qif`, `skid`, `patterns` and `no_patterns` are optional annotations. + + See http://rise4fun.com/Z3Py/tutorial/advanced for more details. + + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> x = Int('x') + >>> y = Int('y') + >>> ForAll([x, y], f(x, y) >= x) + ForAll([x, y], f(x, y) >= x) + >>> ForAll([x, y], f(x, y) >= x, patterns=[ f(x, y) ]) + ForAll([x, y], f(x, y) >= x) + >>> ForAll([x, y], f(x, y) >= x, weight=10) + ForAll([x, y], f(x, y) >= x) + """ + return _mk_quantifier(True, vs, body, weight, qid, skid, patterns, no_patterns) + +def Exists(vs, body, weight=1, qid="", skid="", patterns=[], no_patterns=[]): + """Create a Z3 exists formula. + + The parameters `weight`, `qif`, `skid`, `patterns` and `no_patterns` are optional annotations. + + See http://rise4fun.com/Z3Py/tutorial/advanced for more details. + + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> x = Int('x') + >>> y = Int('y') + >>> q = Exists([x, y], f(x, y) >= x, skid="foo") + >>> q + Exists([x, y], f(x, y) >= x) + >>> is_quantifier(q) + True + >>> r = Tactic('nnf')(q).as_expr() + >>> is_quantifier(r) + False + """ + return _mk_quantifier(False, vs, body, weight, qid, skid, patterns, no_patterns) + +######################################### +# +# Arithmetic +# +######################################### + +class ArithSortRef(SortRef): + """Real and Integer sorts.""" + + def is_real(self): + """Return `True` if `self` is of the sort Real. + + >>> x = Real('x') + >>> x.is_real() + True + >>> (x + 1).is_real() + True + >>> x = Int('x') + >>> x.is_real() + False + """ + return self.kind() == Z3_REAL_SORT + + def is_int(self): + """Return `True` if `self` is of the sort Integer. + + >>> x = Int('x') + >>> x.is_int() + True + >>> (x + 1).is_int() + True + >>> x = Real('x') + >>> x.is_int() + False + """ + return self.kind() == Z3_INT_SORT + + def subsort(self, other): + """Return `True` if `self` is a subsort of `other`.""" + return self.is_int() and is_arith_sort(other) and other.is_real() + + def cast(self, val): + """Try to cast `val` as an Integer or Real. + + >>> IntSort().cast(10) + 10 + >>> is_int(IntSort().cast(10)) + True + >>> is_int(10) + False + >>> RealSort().cast(10) + 10 + >>> is_real(RealSort().cast(10)) + True + """ + if is_expr(val): + if __debug__: + _z3_assert(self.ctx == val.ctx, "Context mismatch") + val_s = val.sort() + if self.eq(val_s): + return val + if val_s.is_int() and self.is_real(): + return ToReal(val) + if val_s.is_bool() and self.is_int(): + return If(val, 1, 0) + if val_s.is_bool() and self.is_real(): + return ToReal(If(val, 1, 0)) + if __debug__: + _z3_assert(False, "Z3 Integer/Real expression expected" ) + else: + if self.is_int(): + return IntVal(val, self.ctx) + if self.is_real(): + return RealVal(val, self.ctx) + if __debug__: + _z3_assert(False, "int, long, float, string (numeral), or Z3 Integer/Real expression expected. Got %s" % self) + +def is_arith_sort(s): + """Return `True` if s is an arithmetical sort (type). + + >>> is_arith_sort(IntSort()) + True + >>> is_arith_sort(RealSort()) + True + >>> is_arith_sort(BoolSort()) + False + >>> n = Int('x') + 1 + >>> is_arith_sort(n.sort()) + True + """ + return isinstance(s, ArithSortRef) + +class ArithRef(ExprRef): + """Integer and Real expressions.""" + + def sort(self): + """Return the sort (type) of the arithmetical expression `self`. + + >>> Int('x').sort() + Int + >>> (Real('x') + 1).sort() + Real + """ + return ArithSortRef(Z3_get_sort(self.ctx_ref(), self.as_ast()), self.ctx) + + def is_int(self): + """Return `True` if `self` is an integer expression. + + >>> x = Int('x') + >>> x.is_int() + True + >>> (x + 1).is_int() + True + >>> y = Real('y') + >>> (x + y).is_int() + False + """ + return self.sort().is_int() + + def is_real(self): + """Return `True` if `self` is an real expression. + + >>> x = Real('x') + >>> x.is_real() + True + >>> (x + 1).is_real() + True + """ + return self.sort().is_real() + + def __add__(self, other): + """Create the Z3 expression `self + other`. + + >>> x = Int('x') + >>> y = Int('y') + >>> x + y + x + y + >>> (x + y).sort() + Int + """ + a, b = _coerce_exprs(self, other) + return ArithRef(_mk_bin(Z3_mk_add, a, b), self.ctx) + + def __radd__(self, other): + """Create the Z3 expression `other + self`. + + >>> x = Int('x') + >>> 10 + x + 10 + x + """ + a, b = _coerce_exprs(self, other) + return ArithRef(_mk_bin(Z3_mk_add, b, a), self.ctx) + + def __mul__(self, other): + """Create the Z3 expression `self * other`. + + >>> x = Real('x') + >>> y = Real('y') + >>> x * y + x*y + >>> (x * y).sort() + Real + """ + a, b = _coerce_exprs(self, other) + return ArithRef(_mk_bin(Z3_mk_mul, a, b), self.ctx) + + def __rmul__(self, other): + """Create the Z3 expression `other * self`. + + >>> x = Real('x') + >>> 10 * x + 10*x + """ + a, b = _coerce_exprs(self, other) + return ArithRef(_mk_bin(Z3_mk_mul, b, a), self.ctx) + + def __sub__(self, other): + """Create the Z3 expression `self - other`. + + >>> x = Int('x') + >>> y = Int('y') + >>> x - y + x - y + >>> (x - y).sort() + Int + """ + a, b = _coerce_exprs(self, other) + return ArithRef(_mk_bin(Z3_mk_sub, a, b), self.ctx) + + def __rsub__(self, other): + """Create the Z3 expression `other - self`. + + >>> x = Int('x') + >>> 10 - x + 10 - x + """ + a, b = _coerce_exprs(self, other) + return ArithRef(_mk_bin(Z3_mk_sub, b, a), self.ctx) + + def __pow__(self, other): + """Create the Z3 expression `self**other` (** is the power operator). + + >>> x = Real('x') + >>> x**3 + x**3 + >>> (x**3).sort() + Real + >>> simplify(IntVal(2)**8) + 256 + """ + a, b = _coerce_exprs(self, other) + return ArithRef(Z3_mk_power(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __rpow__(self, other): + """Create the Z3 expression `other**self` (** is the power operator). + + >>> x = Real('x') + >>> 2**x + 2**x + >>> (2**x).sort() + Real + >>> simplify(2**IntVal(8)) + 256 + """ + a, b = _coerce_exprs(self, other) + return ArithRef(Z3_mk_power(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __div__(self, other): + """Create the Z3 expression `other/self`. + + >>> x = Int('x') + >>> y = Int('y') + >>> x/y + x/y + >>> (x/y).sort() + Int + >>> (x/y).sexpr() + '(div x y)' + >>> x = Real('x') + >>> y = Real('y') + >>> x/y + x/y + >>> (x/y).sort() + Real + >>> (x/y).sexpr() + '(/ x y)' + """ + a, b = _coerce_exprs(self, other) + return ArithRef(Z3_mk_div(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __truediv__(self, other): + """Create the Z3 expression `other/self`.""" + return self.__div__(other) + + def __rdiv__(self, other): + """Create the Z3 expression `other/self`. + + >>> x = Int('x') + >>> 10/x + 10/x + >>> (10/x).sexpr() + '(div 10 x)' + >>> x = Real('x') + >>> 10/x + 10/x + >>> (10/x).sexpr() + '(/ 10.0 x)' + """ + a, b = _coerce_exprs(self, other) + return ArithRef(Z3_mk_div(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __rtruediv__(self, other): + """Create the Z3 expression `other/self`.""" + return self.__rdiv__(other) + + def __mod__(self, other): + """Create the Z3 expression `other%self`. + + >>> x = Int('x') + >>> y = Int('y') + >>> x % y + x%y + >>> simplify(IntVal(10) % IntVal(3)) + 1 + """ + a, b = _coerce_exprs(self, other) + if __debug__: + _z3_assert(a.is_int(), "Z3 integer expression expected") + return ArithRef(Z3_mk_mod(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __rmod__(self, other): + """Create the Z3 expression `other%self`. + + >>> x = Int('x') + >>> 10 % x + 10%x + """ + a, b = _coerce_exprs(self, other) + if __debug__: + _z3_assert(a.is_int(), "Z3 integer expression expected") + return ArithRef(Z3_mk_mod(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __neg__(self): + """Return an expression representing `-self`. + + >>> x = Int('x') + >>> -x + -x + >>> simplify(-(-x)) + x + """ + return ArithRef(Z3_mk_unary_minus(self.ctx_ref(), self.as_ast()), self.ctx) + + def __pos__(self): + """Return `self`. + + >>> x = Int('x') + >>> +x + x + """ + return self + + def __le__(self, other): + """Create the Z3 expression `other <= self`. + + >>> x, y = Ints('x y') + >>> x <= y + x <= y + >>> y = Real('y') + >>> x <= y + ToReal(x) <= y + """ + a, b = _coerce_exprs(self, other) + return BoolRef(Z3_mk_le(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __lt__(self, other): + """Create the Z3 expression `other < self`. + + >>> x, y = Ints('x y') + >>> x < y + x < y + >>> y = Real('y') + >>> x < y + ToReal(x) < y + """ + a, b = _coerce_exprs(self, other) + return BoolRef(Z3_mk_lt(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __gt__(self, other): + """Create the Z3 expression `other > self`. + + >>> x, y = Ints('x y') + >>> x > y + x > y + >>> y = Real('y') + >>> x > y + ToReal(x) > y + """ + a, b = _coerce_exprs(self, other) + return BoolRef(Z3_mk_gt(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __ge__(self, other): + """Create the Z3 expression `other >= self`. + + >>> x, y = Ints('x y') + >>> x >= y + x >= y + >>> y = Real('y') + >>> x >= y + ToReal(x) >= y + """ + a, b = _coerce_exprs(self, other) + return BoolRef(Z3_mk_ge(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + +def is_arith(a): + """Return `True` if `a` is an arithmetical expression. + + >>> x = Int('x') + >>> is_arith(x) + True + >>> is_arith(x + 1) + True + >>> is_arith(1) + False + >>> is_arith(IntVal(1)) + True + >>> y = Real('y') + >>> is_arith(y) + True + >>> is_arith(y + 1) + True + """ + return isinstance(a, ArithRef) + +def is_int(a): + """Return `True` if `a` is an integer expression. + + >>> x = Int('x') + >>> is_int(x + 1) + True + >>> is_int(1) + False + >>> is_int(IntVal(1)) + True + >>> y = Real('y') + >>> is_int(y) + False + >>> is_int(y + 1) + False + """ + return is_arith(a) and a.is_int() + +def is_real(a): + """Return `True` if `a` is a real expression. + + >>> x = Int('x') + >>> is_real(x + 1) + False + >>> y = Real('y') + >>> is_real(y) + True + >>> is_real(y + 1) + True + >>> is_real(1) + False + >>> is_real(RealVal(1)) + True + """ + return is_arith(a) and a.is_real() + +def _is_numeral(ctx, a): + return Z3_is_numeral_ast(ctx.ref(), a) + +def _is_algebraic(ctx, a): + return Z3_is_algebraic_number(ctx.ref(), a) + +def is_int_value(a): + """Return `True` if `a` is an integer value of sort Int. + + >>> is_int_value(IntVal(1)) + True + >>> is_int_value(1) + False + >>> is_int_value(Int('x')) + False + >>> n = Int('x') + 1 + >>> n + x + 1 + >>> n.arg(1) + 1 + >>> is_int_value(n.arg(1)) + True + >>> is_int_value(RealVal("1/3")) + False + >>> is_int_value(RealVal(1)) + False + """ + return is_arith(a) and a.is_int() and _is_numeral(a.ctx, a.as_ast()) + +def is_rational_value(a): + """Return `True` if `a` is rational value of sort Real. + + >>> is_rational_value(RealVal(1)) + True + >>> is_rational_value(RealVal("3/5")) + True + >>> is_rational_value(IntVal(1)) + False + >>> is_rational_value(1) + False + >>> n = Real('x') + 1 + >>> n.arg(1) + 1 + >>> is_rational_value(n.arg(1)) + True + >>> is_rational_value(Real('x')) + False + """ + return is_arith(a) and a.is_real() and _is_numeral(a.ctx, a.as_ast()) + +def is_algebraic_value(a): + """Return `True` if `a` is an algerbraic value of sort Real. + + >>> is_algebraic_value(RealVal("3/5")) + False + >>> n = simplify(Sqrt(2)) + >>> n + 1.4142135623? + >>> is_algebraic_value(n) + True + """ + return is_arith(a) and a.is_real() and _is_algebraic(a.ctx, a.as_ast()) + +def is_add(a): + """Return `True` if `a` is an expression of the form b + c. + + >>> x, y = Ints('x y') + >>> is_add(x + y) + True + >>> is_add(x - y) + False + """ + return is_app_of(a, Z3_OP_ADD) + +def is_mul(a): + """Return `True` if `a` is an expression of the form b * c. + + >>> x, y = Ints('x y') + >>> is_mul(x * y) + True + >>> is_mul(x - y) + False + """ + return is_app_of(a, Z3_OP_MUL) + +def is_sub(a): + """Return `True` if `a` is an expression of the form b - c. + + >>> x, y = Ints('x y') + >>> is_sub(x - y) + True + >>> is_sub(x + y) + False + """ + return is_app_of(a, Z3_OP_SUB) + +def is_div(a): + """Return `True` if `a` is an expression of the form b / c. + + >>> x, y = Reals('x y') + >>> is_div(x / y) + True + >>> is_div(x + y) + False + >>> x, y = Ints('x y') + >>> is_div(x / y) + False + >>> is_idiv(x / y) + True + """ + return is_app_of(a, Z3_OP_DIV) + +def is_idiv(a): + """Return `True` if `a` is an expression of the form b div c. + + >>> x, y = Ints('x y') + >>> is_idiv(x / y) + True + >>> is_idiv(x + y) + False + """ + return is_app_of(a, Z3_OP_IDIV) + +def is_mod(a): + """Return `True` if `a` is an expression of the form b % c. + + >>> x, y = Ints('x y') + >>> is_mod(x % y) + True + >>> is_mod(x + y) + False + """ + return is_app_of(a, Z3_OP_MOD) + +def is_le(a): + """Return `True` if `a` is an expression of the form b <= c. + + >>> x, y = Ints('x y') + >>> is_le(x <= y) + True + >>> is_le(x < y) + False + """ + return is_app_of(a, Z3_OP_LE) + +def is_lt(a): + """Return `True` if `a` is an expression of the form b < c. + + >>> x, y = Ints('x y') + >>> is_lt(x < y) + True + >>> is_lt(x == y) + False + """ + return is_app_of(a, Z3_OP_LT) + +def is_ge(a): + """Return `True` if `a` is an expression of the form b >= c. + + >>> x, y = Ints('x y') + >>> is_ge(x >= y) + True + >>> is_ge(x == y) + False + """ + return is_app_of(a, Z3_OP_GE) + +def is_gt(a): + """Return `True` if `a` is an expression of the form b > c. + + >>> x, y = Ints('x y') + >>> is_gt(x > y) + True + >>> is_gt(x == y) + False + """ + return is_app_of(a, Z3_OP_GT) + +def is_is_int(a): + """Return `True` if `a` is an expression of the form IsInt(b). + + >>> x = Real('x') + >>> is_is_int(IsInt(x)) + True + >>> is_is_int(x) + False + """ + return is_app_of(a, Z3_OP_IS_INT) + +def is_to_real(a): + """Return `True` if `a` is an expression of the form ToReal(b). + + >>> x = Int('x') + >>> n = ToReal(x) + >>> n + ToReal(x) + >>> is_to_real(n) + True + >>> is_to_real(x) + False + """ + return is_app_of(a, Z3_OP_TO_REAL) + +def is_to_int(a): + """Return `True` if `a` is an expression of the form ToInt(b). + + >>> x = Real('x') + >>> n = ToInt(x) + >>> n + ToInt(x) + >>> is_to_int(n) + True + >>> is_to_int(x) + False + """ + return is_app_of(a, Z3_OP_TO_INT) + +class IntNumRef(ArithRef): + """Integer values.""" + + def as_long(self): + """Return a Z3 integer numeral as a Python long (bignum) numeral. + + >>> v = IntVal(1) + >>> v + 1 + 1 + 1 + >>> v.as_long() + 1 + 2 + """ + if __debug__: + _z3_assert(self.is_int(), "Integer value expected") + return int(self.as_string()) + + def as_string(self): + """Return a Z3 integer numeral as a Python string. + >>> v = IntVal(100) + >>> v.as_string() + '100' + """ + return Z3_get_numeral_string(self.ctx_ref(), self.as_ast()) + +class RatNumRef(ArithRef): + """Rational values.""" + + def numerator(self): + """ Return the numerator of a Z3 rational numeral. + + >>> is_rational_value(RealVal("3/5")) + True + >>> n = RealVal("3/5") + >>> n.numerator() + 3 + >>> is_rational_value(Q(3,5)) + True + >>> Q(3,5).numerator() + 3 + """ + return IntNumRef(Z3_get_numerator(self.ctx_ref(), self.as_ast()), self.ctx) + + def denominator(self): + """ Return the denominator of a Z3 rational numeral. + + >>> is_rational_value(Q(3,5)) + True + >>> n = Q(3,5) + >>> n.denominator() + 5 + """ + return IntNumRef(Z3_get_denominator(self.ctx_ref(), self.as_ast()), self.ctx) + + def numerator_as_long(self): + """ Return the numerator as a Python long. + + >>> v = RealVal(10000000000) + >>> v + 10000000000 + >>> v + 1 + 10000000000 + 1 + >>> v.numerator_as_long() + 1 == 10000000001 + True + """ + return self.numerator().as_long() + + def denominator_as_long(self): + """ Return the denominator as a Python long. + + >>> v = RealVal("1/3") + >>> v + 1/3 + >>> v.denominator_as_long() + 3 + """ + return self.denominator().as_long() + + def is_int(self): + return False + + def is_real(self): + return True + + def is_int_value(self): + return self.denominator().is_int() and self.denominator_as_long() == 1 + + def as_long(self): + _z3_assert(self.is_int(), "Expected integer fraction") + return self.numerator_as_long() + + def as_decimal(self, prec): + """ Return a Z3 rational value as a string in decimal notation using at most `prec` decimal places. + + >>> v = RealVal("1/5") + >>> v.as_decimal(3) + '0.2' + >>> v = RealVal("1/3") + >>> v.as_decimal(3) + '0.333?' + """ + return Z3_get_numeral_decimal_string(self.ctx_ref(), self.as_ast(), prec) + + def as_string(self): + """Return a Z3 rational numeral as a Python string. + + >>> v = Q(3,6) + >>> v.as_string() + '1/2' + """ + return Z3_get_numeral_string(self.ctx_ref(), self.as_ast()) + + def as_fraction(self): + """Return a Z3 rational as a Python Fraction object. + + >>> v = RealVal("1/5") + >>> v.as_fraction() + Fraction(1, 5) + """ + return Fraction(self.numerator_as_long(), self.denominator_as_long()) + +class AlgebraicNumRef(ArithRef): + """Algebraic irrational values.""" + + def approx(self, precision=10): + """Return a Z3 rational number that approximates the algebraic number `self`. + The result `r` is such that |r - self| <= 1/10^precision + + >>> x = simplify(Sqrt(2)) + >>> x.approx(20) + 6838717160008073720548335/4835703278458516698824704 + >>> x.approx(5) + 2965821/2097152 + """ + return RatNumRef(Z3_get_algebraic_number_upper(self.ctx_ref(), self.as_ast(), precision), self.ctx) + def as_decimal(self, prec): + """Return a string representation of the algebraic number `self` in decimal notation using `prec` decimal places + + >>> x = simplify(Sqrt(2)) + >>> x.as_decimal(10) + '1.4142135623?' + >>> x.as_decimal(20) + '1.41421356237309504880?' + """ + return Z3_get_numeral_decimal_string(self.ctx_ref(), self.as_ast(), prec) + +def _py2expr(a, ctx=None): + if isinstance(a, bool): + return BoolVal(a, ctx) + if _is_int(a): + return IntVal(a, ctx) + if isinstance(a, float): + return RealVal(a, ctx) + if __debug__: + _z3_assert(False, "Python bool, int, long or float expected") + +def IntSort(ctx=None): + """Return the integer sort in the given context. If `ctx=None`, then the global context is used. + + >>> IntSort() + Int + >>> x = Const('x', IntSort()) + >>> is_int(x) + True + >>> x.sort() == IntSort() + True + >>> x.sort() == BoolSort() + False + """ + ctx = _get_ctx(ctx) + return ArithSortRef(Z3_mk_int_sort(ctx.ref()), ctx) + +def RealSort(ctx=None): + """Return the real sort in the given context. If `ctx=None`, then the global context is used. + + >>> RealSort() + Real + >>> x = Const('x', RealSort()) + >>> is_real(x) + True + >>> is_int(x) + False + >>> x.sort() == RealSort() + True + """ + ctx = _get_ctx(ctx) + return ArithSortRef(Z3_mk_real_sort(ctx.ref()), ctx) + +def _to_int_str(val): + if isinstance(val, float): + return str(int(val)) + elif isinstance(val, bool): + if val: + return "1" + else: + return "0" + elif _is_int(val): + return str(val) + elif isinstance(val, str): + return val + if __debug__: + _z3_assert(False, "Python value cannot be used as a Z3 integer") + +def IntVal(val, ctx=None): + """Return a Z3 integer value. If `ctx=None`, then the global context is used. + + >>> IntVal(1) + 1 + >>> IntVal("100") + 100 + """ + ctx = _get_ctx(ctx) + return IntNumRef(Z3_mk_numeral(ctx.ref(), _to_int_str(val), IntSort(ctx).ast), ctx) + +def RealVal(val, ctx=None): + """Return a Z3 real value. + + `val` may be a Python int, long, float or string representing a number in decimal or rational notation. + If `ctx=None`, then the global context is used. + + >>> RealVal(1) + 1 + >>> RealVal(1).sort() + Real + >>> RealVal("3/5") + 3/5 + >>> RealVal("1.5") + 3/2 + """ + ctx = _get_ctx(ctx) + return RatNumRef(Z3_mk_numeral(ctx.ref(), str(val), RealSort(ctx).ast), ctx) + +def RatVal(a, b, ctx=None): + """Return a Z3 rational a/b. + + If `ctx=None`, then the global context is used. + + >>> RatVal(3,5) + 3/5 + >>> RatVal(3,5).sort() + Real + """ + if __debug__: + _z3_assert(_is_int(a) or isinstance(a, str), "First argument cannot be converted into an integer") + _z3_assert(_is_int(b) or isinstance(b, str), "Second argument cannot be converted into an integer") + return simplify(RealVal(a, ctx)/RealVal(b, ctx)) + +def Q(a, b, ctx=None): + """Return a Z3 rational a/b. + + If `ctx=None`, then the global context is used. + + >>> Q(3,5) + 3/5 + >>> Q(3,5).sort() + Real + """ + return simplify(RatVal(a, b)) + +def Int(name, ctx=None): + """Return an integer constant named `name`. If `ctx=None`, then the global context is used. + + >>> x = Int('x') + >>> is_int(x) + True + >>> is_int(x + 1) + True + """ + ctx = _get_ctx(ctx) + return ArithRef(Z3_mk_const(ctx.ref(), to_symbol(name, ctx), IntSort(ctx).ast), ctx) + +def Ints(names, ctx=None): + """Return a tuple of Integer constants. + + >>> x, y, z = Ints('x y z') + >>> Sum(x, y, z) + x + y + z + """ + ctx = _get_ctx(ctx) + if isinstance(names, str): + names = names.split(" ") + return [Int(name, ctx) for name in names] + +def IntVector(prefix, sz, ctx=None): + """Return a list of integer constants of size `sz`. + + >>> X = IntVector('x', 3) + >>> X + [x__0, x__1, x__2] + >>> Sum(X) + x__0 + x__1 + x__2 + """ + return [ Int('%s__%s' % (prefix, i)) for i in range(sz) ] + +def FreshInt(prefix='x', ctx=None): + """Return a fresh integer constant in the given context using the given prefix. + + >>> x = FreshInt() + >>> y = FreshInt() + >>> eq(x, y) + False + >>> x.sort() + Int + """ + ctx = _get_ctx(ctx) + return ArithRef(Z3_mk_fresh_const(ctx.ref(), prefix, IntSort(ctx).ast), ctx) + +def Real(name, ctx=None): + """Return a real constant named `name`. If `ctx=None`, then the global context is used. + + >>> x = Real('x') + >>> is_real(x) + True + >>> is_real(x + 1) + True + """ + ctx = _get_ctx(ctx) + return ArithRef(Z3_mk_const(ctx.ref(), to_symbol(name, ctx), RealSort(ctx).ast), ctx) + +def Reals(names, ctx=None): + """Return a tuple of real constants. + + >>> x, y, z = Reals('x y z') + >>> Sum(x, y, z) + x + y + z + >>> Sum(x, y, z).sort() + Real + """ + ctx = _get_ctx(ctx) + if isinstance(names, str): + names = names.split(" ") + return [Real(name, ctx) for name in names] + +def RealVector(prefix, sz, ctx=None): + """Return a list of real constants of size `sz`. + + >>> X = RealVector('x', 3) + >>> X + [x__0, x__1, x__2] + >>> Sum(X) + x__0 + x__1 + x__2 + >>> Sum(X).sort() + Real + """ + return [ Real('%s__%s' % (prefix, i)) for i in range(sz) ] + +def FreshReal(prefix='b', ctx=None): + """Return a fresh real constant in the given context using the given prefix. + + >>> x = FreshReal() + >>> y = FreshReal() + >>> eq(x, y) + False + >>> x.sort() + Real + """ + ctx = _get_ctx(ctx) + return ArithRef(Z3_mk_fresh_const(ctx.ref(), prefix, RealSort(ctx).ast), ctx) + +def ToReal(a): + """ Return the Z3 expression ToReal(a). + + >>> x = Int('x') + >>> x.sort() + Int + >>> n = ToReal(x) + >>> n + ToReal(x) + >>> n.sort() + Real + """ + if __debug__: + _z3_assert(a.is_int(), "Z3 integer expression expected.") + ctx = a.ctx + return ArithRef(Z3_mk_int2real(ctx.ref(), a.as_ast()), ctx) + +def ToInt(a): + """ Return the Z3 expression ToInt(a). + + >>> x = Real('x') + >>> x.sort() + Real + >>> n = ToInt(x) + >>> n + ToInt(x) + >>> n.sort() + Int + """ + if __debug__: + _z3_assert(a.is_real(), "Z3 real expression expected.") + ctx = a.ctx + return ArithRef(Z3_mk_real2int(ctx.ref(), a.as_ast()), ctx) + +def IsInt(a): + """ Return the Z3 predicate IsInt(a). + + >>> x = Real('x') + >>> IsInt(x + "1/2") + IsInt(x + 1/2) + >>> solve(IsInt(x + "1/2"), x > 0, x < 1) + [x = 1/2] + >>> solve(IsInt(x + "1/2"), x > 0, x < 1, x != "1/2") + no solution + """ + if __debug__: + _z3_assert(a.is_real(), "Z3 real expression expected.") + ctx = a.ctx + return BoolRef(Z3_mk_is_int(ctx.ref(), a.as_ast()), ctx) + +def Sqrt(a, ctx=None): + """ Return a Z3 expression which represents the square root of a. + + >>> x = Real('x') + >>> Sqrt(x) + x**(1/2) + """ + if not is_expr(a): + ctx = _get_ctx(ctx) + a = RealVal(a, ctx) + return a ** "1/2" + +def Cbrt(a, ctx=None): + """ Return a Z3 expression which represents the cubic root of a. + + >>> x = Real('x') + >>> Cbrt(x) + x**(1/3) + """ + if not is_expr(a): + ctx = _get_ctx(ctx) + a = RealVal(a, ctx) + return a ** "1/3" + +######################################### +# +# Bit-Vectors +# +######################################### + +class BitVecSortRef(SortRef): + """Bit-vector sort.""" + + def size(self): + """Return the size (number of bits) of the bit-vector sort `self`. + + >>> b = BitVecSort(32) + >>> b.size() + 32 + """ + return int(Z3_get_bv_sort_size(self.ctx_ref(), self.ast)) + + def subsort(self, other): + return is_bv_sort(other) and self.size() < other.size() + + def cast(self, val): + """Try to cast `val` as a Bit-Vector. + + >>> b = BitVecSort(32) + >>> b.cast(10) + 10 + >>> b.cast(10).sexpr() + '#x0000000a' + """ + if is_expr(val): + if __debug__: + _z3_assert(self.ctx == val.ctx, "Context mismatch") + # Idea: use sign_extend if sort of val is a bitvector of smaller size + return val + else: + return BitVecVal(val, self) + +def is_bv_sort(s): + """Return True if `s` is a Z3 bit-vector sort. + + >>> is_bv_sort(BitVecSort(32)) + True + >>> is_bv_sort(IntSort()) + False + """ + return isinstance(s, BitVecSortRef) + +class BitVecRef(ExprRef): + """Bit-vector expressions.""" + + def sort(self): + """Return the sort of the bit-vector expression `self`. + + >>> x = BitVec('x', 32) + >>> x.sort() + BitVec(32) + >>> x.sort() == BitVecSort(32) + True + """ + return BitVecSortRef(Z3_get_sort(self.ctx_ref(), self.as_ast()), self.ctx) + + def size(self): + """Return the number of bits of the bit-vector expression `self`. + + >>> x = BitVec('x', 32) + >>> (x + 1).size() + 32 + >>> Concat(x, x).size() + 64 + """ + return self.sort().size() + + def __add__(self, other): + """Create the Z3 expression `self + other`. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> x + y + x + y + >>> (x + y).sort() + BitVec(32) + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvadd(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __radd__(self, other): + """Create the Z3 expression `other + self`. + + >>> x = BitVec('x', 32) + >>> 10 + x + 10 + x + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvadd(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __mul__(self, other): + """Create the Z3 expression `self * other`. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> x * y + x*y + >>> (x * y).sort() + BitVec(32) + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvmul(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __rmul__(self, other): + """Create the Z3 expression `other * self`. + + >>> x = BitVec('x', 32) + >>> 10 * x + 10*x + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvmul(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __sub__(self, other): + """Create the Z3 expression `self - other`. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> x - y + x - y + >>> (x - y).sort() + BitVec(32) + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvsub(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __rsub__(self, other): + """Create the Z3 expression `other - self`. + + >>> x = BitVec('x', 32) + >>> 10 - x + 10 - x + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvsub(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __or__(self, other): + """Create the Z3 expression bitwise-or `self | other`. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> x | y + x | y + >>> (x | y).sort() + BitVec(32) + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvor(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __ror__(self, other): + """Create the Z3 expression bitwise-or `other | self`. + + >>> x = BitVec('x', 32) + >>> 10 | x + 10 | x + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvor(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __and__(self, other): + """Create the Z3 expression bitwise-and `self & other`. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> x & y + x & y + >>> (x & y).sort() + BitVec(32) + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvand(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __rand__(self, other): + """Create the Z3 expression bitwise-or `other & self`. + + >>> x = BitVec('x', 32) + >>> 10 & x + 10 & x + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvand(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __xor__(self, other): + """Create the Z3 expression bitwise-xor `self ^ other`. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> x ^ y + x ^ y + >>> (x ^ y).sort() + BitVec(32) + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvxor(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __rxor__(self, other): + """Create the Z3 expression bitwise-xor `other ^ self`. + + >>> x = BitVec('x', 32) + >>> 10 ^ x + 10 ^ x + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvxor(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __pos__(self): + """Return `self`. + + >>> x = BitVec('x', 32) + >>> +x + x + """ + return self + + def __neg__(self): + """Return an expression representing `-self`. + + >>> x = BitVec('x', 32) + >>> -x + -x + >>> simplify(-(-x)) + x + """ + return BitVecRef(Z3_mk_bvneg(self.ctx_ref(), self.as_ast()), self.ctx) + + def __invert__(self): + """Create the Z3 expression bitwise-not `~self`. + + >>> x = BitVec('x', 32) + >>> ~x + ~x + >>> simplify(~(~x)) + x + """ + return BitVecRef(Z3_mk_bvnot(self.ctx_ref(), self.as_ast()), self.ctx) + + def __div__(self, other): + """Create the Z3 expression (signed) division `self / other`. + + Use the function UDiv() for unsigned division. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> x / y + x/y + >>> (x / y).sort() + BitVec(32) + >>> (x / y).sexpr() + '(bvsdiv x y)' + >>> UDiv(x, y).sexpr() + '(bvudiv x y)' + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvsdiv(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __truediv__(self, other): + """Create the Z3 expression (signed) division `self / other`.""" + return self.__div__(other) + + def __rdiv__(self, other): + """Create the Z3 expression (signed) division `other / self`. + + Use the function UDiv() for unsigned division. + + >>> x = BitVec('x', 32) + >>> 10 / x + 10/x + >>> (10 / x).sexpr() + '(bvsdiv #x0000000a x)' + >>> UDiv(10, x).sexpr() + '(bvudiv #x0000000a x)' + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvsdiv(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __rtruediv__(self, other): + """Create the Z3 expression (signed) division `other / self`.""" + return self.__rdiv__(other) + + def __mod__(self, other): + """Create the Z3 expression (signed) mod `self % other`. + + Use the function URem() for unsigned remainder, and SRem() for signed remainder. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> x % y + x%y + >>> (x % y).sort() + BitVec(32) + >>> (x % y).sexpr() + '(bvsmod x y)' + >>> URem(x, y).sexpr() + '(bvurem x y)' + >>> SRem(x, y).sexpr() + '(bvsrem x y)' + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvsmod(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __rmod__(self, other): + """Create the Z3 expression (signed) mod `other % self`. + + Use the function URem() for unsigned remainder, and SRem() for signed remainder. + + >>> x = BitVec('x', 32) + >>> 10 % x + 10%x + >>> (10 % x).sexpr() + '(bvsmod #x0000000a x)' + >>> URem(10, x).sexpr() + '(bvurem #x0000000a x)' + >>> SRem(10, x).sexpr() + '(bvsrem #x0000000a x)' + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvsmod(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __le__(self, other): + """Create the Z3 expression (signed) `other <= self`. + + Use the function ULE() for unsigned less than or equal to. + + >>> x, y = BitVecs('x y', 32) + >>> x <= y + x <= y + >>> (x <= y).sexpr() + '(bvsle x y)' + >>> ULE(x, y).sexpr() + '(bvule x y)' + """ + a, b = _coerce_exprs(self, other) + return BoolRef(Z3_mk_bvsle(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __lt__(self, other): + """Create the Z3 expression (signed) `other < self`. + + Use the function ULT() for unsigned less than. + + >>> x, y = BitVecs('x y', 32) + >>> x < y + x < y + >>> (x < y).sexpr() + '(bvslt x y)' + >>> ULT(x, y).sexpr() + '(bvult x y)' + """ + a, b = _coerce_exprs(self, other) + return BoolRef(Z3_mk_bvslt(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __gt__(self, other): + """Create the Z3 expression (signed) `other > self`. + + Use the function UGT() for unsigned greater than. + + >>> x, y = BitVecs('x y', 32) + >>> x > y + x > y + >>> (x > y).sexpr() + '(bvsgt x y)' + >>> UGT(x, y).sexpr() + '(bvugt x y)' + """ + a, b = _coerce_exprs(self, other) + return BoolRef(Z3_mk_bvsgt(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __ge__(self, other): + """Create the Z3 expression (signed) `other >= self`. + + Use the function UGE() for unsigned greater than or equal to. + + >>> x, y = BitVecs('x y', 32) + >>> x >= y + x >= y + >>> (x >= y).sexpr() + '(bvsge x y)' + >>> UGE(x, y).sexpr() + '(bvuge x y)' + """ + a, b = _coerce_exprs(self, other) + return BoolRef(Z3_mk_bvsge(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __rshift__(self, other): + """Create the Z3 expression (arithmetical) right shift `self >> other` + + Use the function LShR() for the right logical shift + + >>> x, y = BitVecs('x y', 32) + >>> x >> y + x >> y + >>> (x >> y).sexpr() + '(bvashr x y)' + >>> LShR(x, y).sexpr() + '(bvlshr x y)' + >>> BitVecVal(4, 3) + 4 + >>> BitVecVal(4, 3).as_signed_long() + -4 + >>> simplify(BitVecVal(4, 3) >> 1).as_signed_long() + -2 + >>> simplify(BitVecVal(4, 3) >> 1) + 6 + >>> simplify(LShR(BitVecVal(4, 3), 1)) + 2 + >>> simplify(BitVecVal(2, 3) >> 1) + 1 + >>> simplify(LShR(BitVecVal(2, 3), 1)) + 1 + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvashr(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __lshift__(self, other): + """Create the Z3 expression left shift `self << other` + + >>> x, y = BitVecs('x y', 32) + >>> x << y + x << y + >>> (x << y).sexpr() + '(bvshl x y)' + >>> simplify(BitVecVal(2, 3) << 1) + 4 + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvshl(self.ctx_ref(), a.as_ast(), b.as_ast()), self.ctx) + + def __rrshift__(self, other): + """Create the Z3 expression (arithmetical) right shift `other` >> `self`. + + Use the function LShR() for the right logical shift + + >>> x = BitVec('x', 32) + >>> 10 >> x + 10 >> x + >>> (10 >> x).sexpr() + '(bvashr #x0000000a x)' + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvashr(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + + def __rlshift__(self, other): + """Create the Z3 expression left shift `other << self`. + + Use the function LShR() for the right logical shift + + >>> x = BitVec('x', 32) + >>> 10 << x + 10 << x + >>> (10 << x).sexpr() + '(bvshl #x0000000a x)' + """ + a, b = _coerce_exprs(self, other) + return BitVecRef(Z3_mk_bvshl(self.ctx_ref(), b.as_ast(), a.as_ast()), self.ctx) + +class BitVecNumRef(BitVecRef): + """Bit-vector values.""" + + def as_long(self): + """Return a Z3 bit-vector numeral as a Python long (bignum) numeral. + + >>> v = BitVecVal(0xbadc0de, 32) + >>> v + 195936478 + >>> print("0x%.8x" % v.as_long()) + 0x0badc0de + """ + return int(self.as_string()) + + def as_signed_long(self): + """Return a Z3 bit-vector numeral as a Python long (bignum) numeral. The most significant bit is assumed to be the sign. + + >>> BitVecVal(4, 3).as_signed_long() + -4 + >>> BitVecVal(7, 3).as_signed_long() + -1 + >>> BitVecVal(3, 3).as_signed_long() + 3 + >>> BitVecVal(2**32 - 1, 32).as_signed_long() + -1 + >>> BitVecVal(2**64 - 1, 64).as_signed_long() + -1 + """ + sz = self.size() + val = self.as_long() + if val >= 2**(sz - 1): + val = val - 2**sz + if val < -2**(sz - 1): + val = val + 2**sz + return int(val) + + def as_string(self): + return Z3_get_numeral_string(self.ctx_ref(), self.as_ast()) + +def is_bv(a): + """Return `True` if `a` is a Z3 bit-vector expression. + + >>> b = BitVec('b', 32) + >>> is_bv(b) + True + >>> is_bv(b + 10) + True + >>> is_bv(Int('x')) + False + """ + return isinstance(a, BitVecRef) + +def is_bv_value(a): + """Return `True` if `a` is a Z3 bit-vector numeral value. + + >>> b = BitVec('b', 32) + >>> is_bv_value(b) + False + >>> b = BitVecVal(10, 32) + >>> b + 10 + >>> is_bv_value(b) + True + """ + return is_bv(a) and _is_numeral(a.ctx, a.as_ast()) + +def BV2Int(a, is_signed=False): + """Return the Z3 expression BV2Int(a). + + >>> b = BitVec('b', 3) + >>> BV2Int(b).sort() + Int + >>> x = Int('x') + >>> x > BV2Int(b) + x > BV2Int(b) + >>> x > BV2Int(b, is_signed=False) + x > BV2Int(b) + >>> x > BV2Int(b, is_signed=True) + x > If(b < 0, BV2Int(b) - 8, BV2Int(b)) + >>> solve(x > BV2Int(b), b == 1, x < 3) + [b = 1, x = 2] + """ + if __debug__: + _z3_assert(is_bv(a), "Z3 bit-vector expression expected") + ctx = a.ctx + ## investigate problem with bv2int + return ArithRef(Z3_mk_bv2int(ctx.ref(), a.as_ast(), is_signed), ctx) + +def BitVecSort(sz, ctx=None): + """Return a Z3 bit-vector sort of the given size. If `ctx=None`, then the global context is used. + + >>> Byte = BitVecSort(8) + >>> Word = BitVecSort(16) + >>> Byte + BitVec(8) + >>> x = Const('x', Byte) + >>> eq(x, BitVec('x', 8)) + True + """ + ctx = _get_ctx(ctx) + return BitVecSortRef(Z3_mk_bv_sort(ctx.ref(), sz), ctx) + +def BitVecVal(val, bv, ctx=None): + """Return a bit-vector value with the given number of bits. If `ctx=None`, then the global context is used. + + >>> v = BitVecVal(10, 32) + >>> v + 10 + >>> print("0x%.8x" % v.as_long()) + 0x0000000a + """ + if is_bv_sort(bv): + ctx = bv.ctx + return BitVecNumRef(Z3_mk_numeral(ctx.ref(), _to_int_str(val), bv.ast), ctx) + else: + ctx = _get_ctx(ctx) + return BitVecNumRef(Z3_mk_numeral(ctx.ref(), _to_int_str(val), BitVecSort(bv, ctx).ast), ctx) + +def BitVec(name, bv, ctx=None): + """Return a bit-vector constant named `name`. `bv` may be the number of bits of a bit-vector sort. + If `ctx=None`, then the global context is used. + + >>> x = BitVec('x', 16) + >>> is_bv(x) + True + >>> x.size() + 16 + >>> x.sort() + BitVec(16) + >>> word = BitVecSort(16) + >>> x2 = BitVec('x', word) + >>> eq(x, x2) + True + """ + if isinstance(bv, BitVecSortRef): + ctx = bv.ctx + else: + ctx = _get_ctx(ctx) + bv = BitVecSort(bv, ctx) + return BitVecRef(Z3_mk_const(ctx.ref(), to_symbol(name, ctx), bv.ast), ctx) + +def BitVecs(names, bv, ctx=None): + """Return a tuple of bit-vector constants of size bv. + + >>> x, y, z = BitVecs('x y z', 16) + >>> x.size() + 16 + >>> x.sort() + BitVec(16) + >>> Sum(x, y, z) + 0 + x + y + z + >>> Product(x, y, z) + 1*x*y*z + >>> simplify(Product(x, y, z)) + x*y*z + """ + ctx = _get_ctx(ctx) + if isinstance(names, str): + names = names.split(" ") + return [BitVec(name, bv, ctx) for name in names] + +def Concat(*args): + """Create a Z3 bit-vector concatenation expression. + + >>> v = BitVecVal(1, 4) + >>> Concat(v, v+1, v) + Concat(Concat(1, 1 + 1), 1) + >>> simplify(Concat(v, v+1, v)) + 289 + >>> print("%.3x" % simplify(Concat(v, v+1, v)).as_long()) + 121 + """ + args = _get_args(args) + sz = len(args) + if __debug__: + _z3_assert(sz >= 2, "At least two arguments expected.") + + ctx = None + for a in args: + if is_expr(a): + ctx = a.ctx + break + if is_seq(args[0]) or isinstance(args[0], str): + args = [_coerce_seq(s, ctx) for s in args] + if __debug__: + _z3_assert(all([is_seq(a) for a in args]), "All arguments must be sequence expressions.") + v = (Ast * sz)() + for i in range(sz): + v[i] = args[i].as_ast() + return SeqRef(Z3_mk_seq_concat(ctx.ref(), sz, v), ctx) + + if is_re(args[0]): + if __debug__: + _z3_assert(all([is_re(a) for a in args]), "All arguments must be regular expressions.") + v = (Ast * sz)() + for i in range(sz): + v[i] = args[i].as_ast() + return ReRef(Z3_mk_re_concat(ctx.ref(), sz, v), ctx) + + if __debug__: + _z3_assert(all([is_bv(a) for a in args]), "All arguments must be Z3 bit-vector expressions.") + r = args[0] + for i in range(sz - 1): + r = BitVecRef(Z3_mk_concat(ctx.ref(), r.as_ast(), args[i+1].as_ast()), ctx) + return r + +def Extract(high, low, a): + """Create a Z3 bit-vector extraction expression, or create a string extraction expression. + + >>> x = BitVec('x', 8) + >>> Extract(6, 2, x) + Extract(6, 2, x) + >>> Extract(6, 2, x).sort() + BitVec(5) + >>> simplify(Extract(StringVal("abcd"),2,1)) + "c" + """ + if isinstance(high, str): + high = StringVal(high) + if is_seq(high): + s = high + offset, length = _coerce_exprs(low, a, s.ctx) + return SeqRef(Z3_mk_seq_extract(s.ctx_ref(), s.as_ast(), offset.as_ast(), length.as_ast()), s.ctx) + if __debug__: + _z3_assert(low <= high, "First argument must be greater than or equal to second argument") + _z3_assert(_is_int(high) and high >= 0 and _is_int(low) and low >= 0, "First and second arguments must be non negative integers") + _z3_assert(is_bv(a), "Third argument must be a Z3 Bitvector expression") + return BitVecRef(Z3_mk_extract(a.ctx_ref(), high, low, a.as_ast()), a.ctx) + +def _check_bv_args(a, b): + if __debug__: + _z3_assert(is_bv(a) or is_bv(b), "At least one of the arguments must be a Z3 bit-vector expression") + +def ULE(a, b): + """Create the Z3 expression (unsigned) `other <= self`. + + Use the operator <= for signed less than or equal to. + + >>> x, y = BitVecs('x y', 32) + >>> ULE(x, y) + ULE(x, y) + >>> (x <= y).sexpr() + '(bvsle x y)' + >>> ULE(x, y).sexpr() + '(bvule x y)' + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvule(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def ULT(a, b): + """Create the Z3 expression (unsigned) `other < self`. + + Use the operator < for signed less than. + + >>> x, y = BitVecs('x y', 32) + >>> ULT(x, y) + ULT(x, y) + >>> (x < y).sexpr() + '(bvslt x y)' + >>> ULT(x, y).sexpr() + '(bvult x y)' + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvult(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def UGE(a, b): + """Create the Z3 expression (unsigned) `other >= self`. + + Use the operator >= for signed greater than or equal to. + + >>> x, y = BitVecs('x y', 32) + >>> UGE(x, y) + UGE(x, y) + >>> (x >= y).sexpr() + '(bvsge x y)' + >>> UGE(x, y).sexpr() + '(bvuge x y)' + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvuge(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def UGT(a, b): + """Create the Z3 expression (unsigned) `other > self`. + + Use the operator > for signed greater than. + + >>> x, y = BitVecs('x y', 32) + >>> UGT(x, y) + UGT(x, y) + >>> (x > y).sexpr() + '(bvsgt x y)' + >>> UGT(x, y).sexpr() + '(bvugt x y)' + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvugt(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def UDiv(a, b): + """Create the Z3 expression (unsigned) division `self / other`. + + Use the operator / for signed division. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> UDiv(x, y) + UDiv(x, y) + >>> UDiv(x, y).sort() + BitVec(32) + >>> (x / y).sexpr() + '(bvsdiv x y)' + >>> UDiv(x, y).sexpr() + '(bvudiv x y)' + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BitVecRef(Z3_mk_bvudiv(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def URem(a, b): + """Create the Z3 expression (unsigned) remainder `self % other`. + + Use the operator % for signed modulus, and SRem() for signed remainder. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> URem(x, y) + URem(x, y) + >>> URem(x, y).sort() + BitVec(32) + >>> (x % y).sexpr() + '(bvsmod x y)' + >>> URem(x, y).sexpr() + '(bvurem x y)' + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BitVecRef(Z3_mk_bvurem(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def SRem(a, b): + """Create the Z3 expression signed remainder. + + Use the operator % for signed modulus, and URem() for unsigned remainder. + + >>> x = BitVec('x', 32) + >>> y = BitVec('y', 32) + >>> SRem(x, y) + SRem(x, y) + >>> SRem(x, y).sort() + BitVec(32) + >>> (x % y).sexpr() + '(bvsmod x y)' + >>> SRem(x, y).sexpr() + '(bvsrem x y)' + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BitVecRef(Z3_mk_bvsrem(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def LShR(a, b): + """Create the Z3 expression logical right shift. + + Use the operator >> for the arithmetical right shift. + + >>> x, y = BitVecs('x y', 32) + >>> LShR(x, y) + LShR(x, y) + >>> (x >> y).sexpr() + '(bvashr x y)' + >>> LShR(x, y).sexpr() + '(bvlshr x y)' + >>> BitVecVal(4, 3) + 4 + >>> BitVecVal(4, 3).as_signed_long() + -4 + >>> simplify(BitVecVal(4, 3) >> 1).as_signed_long() + -2 + >>> simplify(BitVecVal(4, 3) >> 1) + 6 + >>> simplify(LShR(BitVecVal(4, 3), 1)) + 2 + >>> simplify(BitVecVal(2, 3) >> 1) + 1 + >>> simplify(LShR(BitVecVal(2, 3), 1)) + 1 + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BitVecRef(Z3_mk_bvlshr(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def RotateLeft(a, b): + """Return an expression representing `a` rotated to the left `b` times. + + >>> a, b = BitVecs('a b', 16) + >>> RotateLeft(a, b) + RotateLeft(a, b) + >>> simplify(RotateLeft(a, 0)) + a + >>> simplify(RotateLeft(a, 16)) + a + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BitVecRef(Z3_mk_ext_rotate_left(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def RotateRight(a, b): + """Return an expression representing `a` rotated to the right `b` times. + + >>> a, b = BitVecs('a b', 16) + >>> RotateRight(a, b) + RotateRight(a, b) + >>> simplify(RotateRight(a, 0)) + a + >>> simplify(RotateRight(a, 16)) + a + """ + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BitVecRef(Z3_mk_ext_rotate_right(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def SignExt(n, a): + """Return a bit-vector expression with `n` extra sign-bits. + + >>> x = BitVec('x', 16) + >>> n = SignExt(8, x) + >>> n.size() + 24 + >>> n + SignExt(8, x) + >>> n.sort() + BitVec(24) + >>> v0 = BitVecVal(2, 2) + >>> v0 + 2 + >>> v0.size() + 2 + >>> v = simplify(SignExt(6, v0)) + >>> v + 254 + >>> v.size() + 8 + >>> print("%.x" % v.as_long()) + fe + """ + if __debug__: + _z3_assert(_is_int(n), "First argument must be an integer") + _z3_assert(is_bv(a), "Second argument must be a Z3 Bitvector expression") + return BitVecRef(Z3_mk_sign_ext(a.ctx_ref(), n, a.as_ast()), a.ctx) + +def ZeroExt(n, a): + """Return a bit-vector expression with `n` extra zero-bits. + + >>> x = BitVec('x', 16) + >>> n = ZeroExt(8, x) + >>> n.size() + 24 + >>> n + ZeroExt(8, x) + >>> n.sort() + BitVec(24) + >>> v0 = BitVecVal(2, 2) + >>> v0 + 2 + >>> v0.size() + 2 + >>> v = simplify(ZeroExt(6, v0)) + >>> v + 2 + >>> v.size() + 8 + """ + if __debug__: + _z3_assert(_is_int(n), "First argument must be an integer") + _z3_assert(is_bv(a), "Second argument must be a Z3 Bitvector expression") + return BitVecRef(Z3_mk_zero_ext(a.ctx_ref(), n, a.as_ast()), a.ctx) + +def RepeatBitVec(n, a): + """Return an expression representing `n` copies of `a`. + + >>> x = BitVec('x', 8) + >>> n = RepeatBitVec(4, x) + >>> n + RepeatBitVec(4, x) + >>> n.size() + 32 + >>> v0 = BitVecVal(10, 4) + >>> print("%.x" % v0.as_long()) + a + >>> v = simplify(RepeatBitVec(4, v0)) + >>> v.size() + 16 + >>> print("%.x" % v.as_long()) + aaaa + """ + if __debug__: + _z3_assert(_is_int(n), "First argument must be an integer") + _z3_assert(is_bv(a), "Second argument must be a Z3 Bitvector expression") + return BitVecRef(Z3_mk_repeat(a.ctx_ref(), n, a.as_ast()), a.ctx) + +def BVRedAnd(a): + """Return the reduction-and expression of `a`.""" + if __debug__: + _z3_assert(is_bv(a), "First argument must be a Z3 Bitvector expression") + return BitVecRef(Z3_mk_bvredand(a.ctx_ref(), a.as_ast()), a.ctx) + +def BVRedOr(a): + """Return the reduction-or expression of `a`.""" + if __debug__: + _z3_assert(is_bv(a), "First argument must be a Z3 Bitvector expression") + return BitVecRef(Z3_mk_bvredor(a.ctx_ref(), a.as_ast()), a.ctx) + +def BVAddNoOverflow(a, b, signed): + """A predicate the determines that bit-vector addition does not overflow""" + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvadd_no_overflow(a.ctx_ref(), a.as_ast(), b.as_ast(), signed), a.ctx) + +def BVAddNoUnderflow(a, b): + """A predicate the determines that signed bit-vector addition does not underflow""" + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvadd_no_underflow(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def BVSubNoOverflow(a, b): + """A predicate the determines that bit-vector subtraction does not overflow""" + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvsub_no_overflow(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + + +def BVSubNoUnderflow(a, b, signed): + """A predicate the determines that bit-vector subtraction does not underflow""" + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvsub_no_underflow(a.ctx_ref(), a.as_ast(), b.as_ast(), signed), a.ctx) + +def BVSDivNoOverflow(a, b): + """A predicate the determines that bit-vector signed division does not overflow""" + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvsdiv_no_overflow(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def BVSNegNoOverflow(a): + """A predicate the determines that bit-vector unary negation does not overflow""" + if __debug__: + _z3_assert(is_bv(a), "Argument should be a bit-vector") + return BoolRef(Z3_mk_bvneg_no_overflow(a.ctx_ref(), a.as_ast()), a.ctx) + +def BVMulNoOverflow(a, b, signed): + """A predicate the determines that bit-vector multiplication does not overflow""" + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvmul_no_overflow(a.ctx_ref(), a.as_ast(), b.as_ast(), signed), a.ctx) + + +def BVMulNoUnderflow(a, b): + """A predicate the determines that bit-vector signed multiplication does not underflow""" + _check_bv_args(a, b) + a, b = _coerce_exprs(a, b) + return BoolRef(Z3_mk_bvmul_no_underflow(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + + + +######################################### +# +# Arrays +# +######################################### + +class ArraySortRef(SortRef): + """Array sorts.""" + + def domain(self): + """Return the domain of the array sort `self`. + + >>> A = ArraySort(IntSort(), BoolSort()) + >>> A.domain() + Int + """ + return _to_sort_ref(Z3_get_array_sort_domain(self.ctx_ref(), self.ast), self.ctx) + + def range(self): + """Return the range of the array sort `self`. + + >>> A = ArraySort(IntSort(), BoolSort()) + >>> A.range() + Bool + """ + return _to_sort_ref(Z3_get_array_sort_range(self.ctx_ref(), self.ast), self.ctx) + +class ArrayRef(ExprRef): + """Array expressions. """ + + def sort(self): + """Return the array sort of the array expression `self`. + + >>> a = Array('a', IntSort(), BoolSort()) + >>> a.sort() + Array(Int, Bool) + """ + return ArraySortRef(Z3_get_sort(self.ctx_ref(), self.as_ast()), self.ctx) + + def domain(self): + """Shorthand for `self.sort().domain()`. + + >>> a = Array('a', IntSort(), BoolSort()) + >>> a.domain() + Int + """ + return self.sort().domain() + + def range(self): + """Shorthand for `self.sort().range()`. + + >>> a = Array('a', IntSort(), BoolSort()) + >>> a.range() + Bool + """ + return self.sort().range() + + def __getitem__(self, arg): + """Return the Z3 expression `self[arg]`. + + >>> a = Array('a', IntSort(), BoolSort()) + >>> i = Int('i') + >>> a[i] + a[i] + >>> a[i].sexpr() + '(select a i)' + """ + arg = self.domain().cast(arg) + return _to_expr_ref(Z3_mk_select(self.ctx_ref(), self.as_ast(), arg.as_ast()), self.ctx) + + def default(self): + return _to_expr_ref(Z3_mk_array_default(self.ctx_ref(), self.as_ast()), self.ctx) + + +def is_array(a): + """Return `True` if `a` is a Z3 array expression. + + >>> a = Array('a', IntSort(), IntSort()) + >>> is_array(a) + True + >>> is_array(Store(a, 0, 1)) + True + >>> is_array(a[0]) + False + """ + return isinstance(a, ArrayRef) + +def is_const_array(a): + """Return `True` if `a` is a Z3 constant array. + + >>> a = K(IntSort(), 10) + >>> is_const_array(a) + True + >>> a = Array('a', IntSort(), IntSort()) + >>> is_const_array(a) + False + """ + return is_app_of(a, Z3_OP_CONST_ARRAY) + +def is_K(a): + """Return `True` if `a` is a Z3 constant array. + + >>> a = K(IntSort(), 10) + >>> is_K(a) + True + >>> a = Array('a', IntSort(), IntSort()) + >>> is_K(a) + False + """ + return is_app_of(a, Z3_OP_CONST_ARRAY) + +def is_map(a): + """Return `True` if `a` is a Z3 map array expression. + + >>> f = Function('f', IntSort(), IntSort()) + >>> b = Array('b', IntSort(), IntSort()) + >>> a = Map(f, b) + >>> a + Map(f, b) + >>> is_map(a) + True + >>> is_map(b) + False + """ + return is_app_of(a, Z3_OP_ARRAY_MAP) + +def is_default(a): + """Return `True` if `a` is a Z3 default array expression. + >>> d = Default(K(IntSort(), 10)) + >>> is_default(d) + True + """ + return is_app_of(a, Z3_OP_ARRAY_DEFAULT) + +def get_map_func(a): + """Return the function declaration associated with a Z3 map array expression. + + >>> f = Function('f', IntSort(), IntSort()) + >>> b = Array('b', IntSort(), IntSort()) + >>> a = Map(f, b) + >>> eq(f, get_map_func(a)) + True + >>> get_map_func(a) + f + >>> get_map_func(a)(0) + f(0) + """ + if __debug__: + _z3_assert(is_map(a), "Z3 array map expression expected.") + return FuncDeclRef(Z3_to_func_decl(a.ctx_ref(), Z3_get_decl_ast_parameter(a.ctx_ref(), a.decl().ast, 0)), a.ctx) + +def ArraySort(d, r): + """Return the Z3 array sort with the given domain and range sorts. + + >>> A = ArraySort(IntSort(), BoolSort()) + >>> A + Array(Int, Bool) + >>> A.domain() + Int + >>> A.range() + Bool + >>> AA = ArraySort(IntSort(), A) + >>> AA + Array(Int, Array(Int, Bool)) + """ + if __debug__: + _z3_assert(is_sort(d), "Z3 sort expected") + _z3_assert(is_sort(r), "Z3 sort expected") + _z3_assert(d.ctx == r.ctx, "Context mismatch") + ctx = d.ctx + return ArraySortRef(Z3_mk_array_sort(ctx.ref(), d.ast, r.ast), ctx) + +def Array(name, dom, rng): + """Return an array constant named `name` with the given domain and range sorts. + + >>> a = Array('a', IntSort(), IntSort()) + >>> a.sort() + Array(Int, Int) + >>> a[0] + a[0] + """ + s = ArraySort(dom, rng) + ctx = s.ctx + return ArrayRef(Z3_mk_const(ctx.ref(), to_symbol(name, ctx), s.ast), ctx) + +def Update(a, i, v): + """Return a Z3 store array expression. + + >>> a = Array('a', IntSort(), IntSort()) + >>> i, v = Ints('i v') + >>> s = Update(a, i, v) + >>> s.sort() + Array(Int, Int) + >>> prove(s[i] == v) + proved + >>> j = Int('j') + >>> prove(Implies(i != j, s[j] == a[j])) + proved + """ + if __debug__: + _z3_assert(is_array(a), "First argument must be a Z3 array expression") + i = a.domain().cast(i) + v = a.range().cast(v) + ctx = a.ctx + return _to_expr_ref(Z3_mk_store(ctx.ref(), a.as_ast(), i.as_ast(), v.as_ast()), ctx) + +def Default(a): + """ Return a default value for array expression. + >>> b = K(IntSort(), 1) + >>> prove(Default(b) == 1) + proved + """ + if __debug__: + _z3_assert(is_array(a), "First argument must be a Z3 array expression") + return a.default() + + +def Store(a, i, v): + """Return a Z3 store array expression. + + >>> a = Array('a', IntSort(), IntSort()) + >>> i, v = Ints('i v') + >>> s = Store(a, i, v) + >>> s.sort() + Array(Int, Int) + >>> prove(s[i] == v) + proved + >>> j = Int('j') + >>> prove(Implies(i != j, s[j] == a[j])) + proved + """ + return Update(a, i, v) + +def Select(a, i): + """Return a Z3 select array expression. + + >>> a = Array('a', IntSort(), IntSort()) + >>> i = Int('i') + >>> Select(a, i) + a[i] + >>> eq(Select(a, i), a[i]) + True + """ + if __debug__: + _z3_assert(is_array(a), "First argument must be a Z3 array expression") + return a[i] + + +def Map(f, *args): + """Return a Z3 map array expression. + + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> a1 = Array('a1', IntSort(), IntSort()) + >>> a2 = Array('a2', IntSort(), IntSort()) + >>> b = Map(f, a1, a2) + >>> b + Map(f, a1, a2) + >>> prove(b[0] == f(a1[0], a2[0])) + proved + """ + args = _get_args(args) + if __debug__: + _z3_assert(len(args) > 0, "At least one Z3 array expression expected") + _z3_assert(is_func_decl(f), "First argument must be a Z3 function declaration") + _z3_assert(all([is_array(a) for a in args]), "Z3 array expected expected") + _z3_assert(len(args) == f.arity(), "Number of arguments mismatch") + _args, sz = _to_ast_array(args) + ctx = f.ctx + return ArrayRef(Z3_mk_map(ctx.ref(), f.ast, sz, _args), ctx) + +def K(dom, v): + """Return a Z3 constant array expression. + + >>> a = K(IntSort(), 10) + >>> a + K(Int, 10) + >>> a.sort() + Array(Int, Int) + >>> i = Int('i') + >>> a[i] + K(Int, 10)[i] + >>> simplify(a[i]) + 10 + """ + if __debug__: + _z3_assert(is_sort(dom), "Z3 sort expected") + ctx = dom.ctx + if not is_expr(v): + v = _py2expr(v, ctx) + return ArrayRef(Z3_mk_const_array(ctx.ref(), dom.ast, v.as_ast()), ctx) + +def Ext(a, b): + """Return extensionality index for arrays. + """ + if __debug__: + _z3_assert(is_array(a) and is_array(b)) + return _to_expr_ref(Z3_mk_array_ext(ctx.ref(), a.as_ast(), b.as_ast())); + +def is_select(a): + """Return `True` if `a` is a Z3 array select application. + + >>> a = Array('a', IntSort(), IntSort()) + >>> is_select(a) + False + >>> i = Int('i') + >>> is_select(a[i]) + True + """ + return is_app_of(a, Z3_OP_SELECT) + +def is_store(a): + """Return `True` if `a` is a Z3 array store application. + + >>> a = Array('a', IntSort(), IntSort()) + >>> is_store(a) + False + >>> is_store(Store(a, 0, 1)) + True + """ + return is_app_of(a, Z3_OP_STORE) + +######################################### +# +# Datatypes +# +######################################### + +def _valid_accessor(acc): + """Return `True` if acc is pair of the form (String, Datatype or Sort). """ + return isinstance(acc, tuple) and len(acc) == 2 and isinstance(acc[0], str) and (isinstance(acc[1], Datatype) or is_sort(acc[1])) + +class Datatype: + """Helper class for declaring Z3 datatypes. + + >>> List = Datatype('List') + >>> List.declare('cons', ('car', IntSort()), ('cdr', List)) + >>> List.declare('nil') + >>> List = List.create() + >>> # List is now a Z3 declaration + >>> List.nil + nil + >>> List.cons(10, List.nil) + cons(10, nil) + >>> List.cons(10, List.nil).sort() + List + >>> cons = List.cons + >>> nil = List.nil + >>> car = List.car + >>> cdr = List.cdr + >>> n = cons(1, cons(0, nil)) + >>> n + cons(1, cons(0, nil)) + >>> simplify(cdr(n)) + cons(0, nil) + >>> simplify(car(n)) + 1 + """ + def __init__(self, name, ctx=None): + self.ctx = _get_ctx(ctx) + self.name = name + self.constructors = [] + + def __deepcopy__(self, memo={}): + r = Datatype(self.name, self.ctx) + r.constructors = copy.deepcopy(self.constructors) + return r + + def declare_core(self, name, rec_name, *args): + if __debug__: + _z3_assert(isinstance(name, str), "String expected") + _z3_assert(isinstance(rec_name, str), "String expected") + _z3_assert(all([_valid_accessor(a) for a in args]), "Valid list of accessors expected. An accessor is a pair of the form (String, Datatype|Sort)") + self.constructors.append((name, rec_name, args)) + + def declare(self, name, *args): + """Declare constructor named `name` with the given accessors `args`. + Each accessor is a pair `(name, sort)`, where `name` is a string and `sort` a Z3 sort or a reference to the datatypes being declared. + + In the followin example `List.declare('cons', ('car', IntSort()), ('cdr', List))` + declares the constructor named `cons` that builds a new List using an integer and a List. + It also declares the accessors `car` and `cdr`. The accessor `car` extracts the integer of a `cons` cell, + and `cdr` the list of a `cons` cell. After all constructors were declared, we use the method create() to create + the actual datatype in Z3. + + >>> List = Datatype('List') + >>> List.declare('cons', ('car', IntSort()), ('cdr', List)) + >>> List.declare('nil') + >>> List = List.create() + """ + if __debug__: + _z3_assert(isinstance(name, str), "String expected") + _z3_assert(name != "", "Constructor name cannot be empty") + return self.declare_core(name, "is_" + name, *args) + + def __repr__(self): + return "Datatype(%s, %s)" % (self.name, self.constructors) + + def create(self): + """Create a Z3 datatype based on the constructors declared using the mehtod `declare()`. + + The function `CreateDatatypes()` must be used to define mutually recursive datatypes. + + >>> List = Datatype('List') + >>> List.declare('cons', ('car', IntSort()), ('cdr', List)) + >>> List.declare('nil') + >>> List = List.create() + >>> List.nil + nil + >>> List.cons(10, List.nil) + cons(10, nil) + """ + return CreateDatatypes([self])[0] + +class ScopedConstructor: + """Auxiliary object used to create Z3 datatypes.""" + def __init__(self, c, ctx): + self.c = c + self.ctx = ctx + def __del__(self): + if self.ctx.ref() is not None: + Z3_del_constructor(self.ctx.ref(), self.c) + +class ScopedConstructorList: + """Auxiliary object used to create Z3 datatypes.""" + def __init__(self, c, ctx): + self.c = c + self.ctx = ctx + def __del__(self): + if self.ctx.ref() is not None: + Z3_del_constructor_list(self.ctx.ref(), self.c) + +def CreateDatatypes(*ds): + """Create mutually recursive Z3 datatypes using 1 or more Datatype helper objects. + + In the following example we define a Tree-List using two mutually recursive datatypes. + + >>> TreeList = Datatype('TreeList') + >>> Tree = Datatype('Tree') + >>> # Tree has two constructors: leaf and node + >>> Tree.declare('leaf', ('val', IntSort())) + >>> # a node contains a list of trees + >>> Tree.declare('node', ('children', TreeList)) + >>> TreeList.declare('nil') + >>> TreeList.declare('cons', ('car', Tree), ('cdr', TreeList)) + >>> Tree, TreeList = CreateDatatypes(Tree, TreeList) + >>> Tree.val(Tree.leaf(10)) + val(leaf(10)) + >>> simplify(Tree.val(Tree.leaf(10))) + 10 + >>> n1 = Tree.node(TreeList.cons(Tree.leaf(10), TreeList.cons(Tree.leaf(20), TreeList.nil))) + >>> n1 + node(cons(leaf(10), cons(leaf(20), nil))) + >>> n2 = Tree.node(TreeList.cons(n1, TreeList.nil)) + >>> simplify(n2 == n1) + False + >>> simplify(TreeList.car(Tree.children(n2)) == n1) + True + """ + ds = _get_args(ds) + if __debug__: + _z3_assert(len(ds) > 0, "At least one Datatype must be specified") + _z3_assert(all([isinstance(d, Datatype) for d in ds]), "Arguments must be Datatypes") + _z3_assert(all([d.ctx == ds[0].ctx for d in ds]), "Context mismatch") + _z3_assert(all([d.constructors != [] for d in ds]), "Non-empty Datatypes expected") + ctx = ds[0].ctx + num = len(ds) + names = (Symbol * num)() + out = (Sort * num)() + clists = (ConstructorList * num)() + to_delete = [] + for i in range(num): + d = ds[i] + names[i] = to_symbol(d.name, ctx) + num_cs = len(d.constructors) + cs = (Constructor * num_cs)() + for j in range(num_cs): + c = d.constructors[j] + cname = to_symbol(c[0], ctx) + rname = to_symbol(c[1], ctx) + fs = c[2] + num_fs = len(fs) + fnames = (Symbol * num_fs)() + sorts = (Sort * num_fs)() + refs = (ctypes.c_uint * num_fs)() + for k in range(num_fs): + fname = fs[k][0] + ftype = fs[k][1] + fnames[k] = to_symbol(fname, ctx) + if isinstance(ftype, Datatype): + if __debug__: + _z3_assert(ds.count(ftype) == 1, "One and only one occurrence of each datatype is expected") + sorts[k] = None + refs[k] = ds.index(ftype) + else: + if __debug__: + _z3_assert(is_sort(ftype), "Z3 sort expected") + sorts[k] = ftype.ast + refs[k] = 0 + cs[j] = Z3_mk_constructor(ctx.ref(), cname, rname, num_fs, fnames, sorts, refs) + to_delete.append(ScopedConstructor(cs[j], ctx)) + clists[i] = Z3_mk_constructor_list(ctx.ref(), num_cs, cs) + to_delete.append(ScopedConstructorList(clists[i], ctx)) + Z3_mk_datatypes(ctx.ref(), num, names, out, clists) + result = [] + ## Create a field for every constructor, recognizer and accessor + for i in range(num): + dref = DatatypeSortRef(out[i], ctx) + num_cs = dref.num_constructors() + for j in range(num_cs): + cref = dref.constructor(j) + cref_name = cref.name() + cref_arity = cref.arity() + if cref.arity() == 0: + cref = cref() + setattr(dref, cref_name, cref) + rref = dref.recognizer(j) + setattr(dref, rref.name(), rref) + for k in range(cref_arity): + aref = dref.accessor(j, k) + setattr(dref, aref.name(), aref) + result.append(dref) + return tuple(result) + +class DatatypeSortRef(SortRef): + """Datatype sorts.""" + def num_constructors(self): + """Return the number of constructors in the given Z3 datatype. + + >>> List = Datatype('List') + >>> List.declare('cons', ('car', IntSort()), ('cdr', List)) + >>> List.declare('nil') + >>> List = List.create() + >>> # List is now a Z3 declaration + >>> List.num_constructors() + 2 + """ + return int(Z3_get_datatype_sort_num_constructors(self.ctx_ref(), self.ast)) + + def constructor(self, idx): + """Return a constructor of the datatype `self`. + + >>> List = Datatype('List') + >>> List.declare('cons', ('car', IntSort()), ('cdr', List)) + >>> List.declare('nil') + >>> List = List.create() + >>> # List is now a Z3 declaration + >>> List.num_constructors() + 2 + >>> List.constructor(0) + cons + >>> List.constructor(1) + nil + """ + if __debug__: + _z3_assert(idx < self.num_constructors(), "Invalid constructor index") + return FuncDeclRef(Z3_get_datatype_sort_constructor(self.ctx_ref(), self.ast, idx), self.ctx) + + def recognizer(self, idx): + """In Z3, each constructor has an associated recognizer predicate. + + If the constructor is named `name`, then the recognizer `is_name`. + + >>> List = Datatype('List') + >>> List.declare('cons', ('car', IntSort()), ('cdr', List)) + >>> List.declare('nil') + >>> List = List.create() + >>> # List is now a Z3 declaration + >>> List.num_constructors() + 2 + >>> List.recognizer(0) + is_cons + >>> List.recognizer(1) + is_nil + >>> simplify(List.is_nil(List.cons(10, List.nil))) + False + >>> simplify(List.is_cons(List.cons(10, List.nil))) + True + >>> l = Const('l', List) + >>> simplify(List.is_cons(l)) + is_cons(l) + """ + if __debug__: + _z3_assert(idx < self.num_constructors(), "Invalid recognizer index") + return FuncDeclRef(Z3_get_datatype_sort_recognizer(self.ctx_ref(), self.ast, idx), self.ctx) + + def accessor(self, i, j): + """In Z3, each constructor has 0 or more accessor. The number of accessors is equal to the arity of the constructor. + + >>> List = Datatype('List') + >>> List.declare('cons', ('car', IntSort()), ('cdr', List)) + >>> List.declare('nil') + >>> List = List.create() + >>> List.num_constructors() + 2 + >>> List.constructor(0) + cons + >>> num_accs = List.constructor(0).arity() + >>> num_accs + 2 + >>> List.accessor(0, 0) + car + >>> List.accessor(0, 1) + cdr + >>> List.constructor(1) + nil + >>> num_accs = List.constructor(1).arity() + >>> num_accs + 0 + """ + if __debug__: + _z3_assert(i < self.num_constructors(), "Invalid constructor index") + _z3_assert(j < self.constructor(i).arity(), "Invalid accessor index") + return FuncDeclRef(Z3_get_datatype_sort_constructor_accessor(self.ctx_ref(), self.ast, i, j), self.ctx) + +class DatatypeRef(ExprRef): + """Datatype expressions.""" + def sort(self): + """Return the datatype sort of the datatype expression `self`.""" + return DatatypeSortRef(Z3_get_sort(self.ctx_ref(), self.as_ast()), self.ctx) + +def EnumSort(name, values, ctx=None): + """Return a new enumeration sort named `name` containing the given values. + + The result is a pair (sort, list of constants). + Example: + >>> Color, (red, green, blue) = EnumSort('Color', ['red', 'green', 'blue']) + """ + if __debug__: + _z3_assert(isinstance(name, str), "Name must be a string") + _z3_assert(all([isinstance(v, str) for v in values]), "Eumeration sort values must be strings") + _z3_assert(len(values) > 0, "At least one value expected") + ctx = _get_ctx(ctx) + num = len(values) + _val_names = (Symbol * num)() + for i in range(num): + _val_names[i] = to_symbol(values[i]) + _values = (FuncDecl * num)() + _testers = (FuncDecl * num)() + name = to_symbol(name) + S = DatatypeSortRef(Z3_mk_enumeration_sort(ctx.ref(), name, num, _val_names, _values, _testers), ctx) + V = [] + for i in range(num): + V.append(FuncDeclRef(_values[i], ctx)) + V = [a() for a in V] + return S, V + +######################################### +# +# Parameter Sets +# +######################################### + +class ParamsRef: + """Set of parameters used to configure Solvers, Tactics and Simplifiers in Z3. + + Consider using the function `args2params` to create instances of this object. + """ + def __init__(self, ctx=None, params=None): + self.ctx = _get_ctx(ctx) + if params is None: + self.params = Z3_mk_params(self.ctx.ref()) + else: + self.params = params + Z3_params_inc_ref(self.ctx.ref(), self.params) + + def __deepcopy__(self, memo={}): + return ParamsRef(self.ctx, self.params) + + def __del__(self): + if self.ctx.ref() is not None: + Z3_params_dec_ref(self.ctx.ref(), self.params) + + def set(self, name, val): + """Set parameter name with value val.""" + if __debug__: + _z3_assert(isinstance(name, str), "parameter name must be a string") + name_sym = to_symbol(name, self.ctx) + if isinstance(val, bool): + Z3_params_set_bool(self.ctx.ref(), self.params, name_sym, val) + elif _is_int(val): + Z3_params_set_uint(self.ctx.ref(), self.params, name_sym, val) + elif isinstance(val, float): + Z3_params_set_double(self.ctx.ref(), self.params, name_sym, val) + elif isinstance(val, str): + Z3_params_set_symbol(self.ctx.ref(), self.params, name_sym, to_symbol(val, self.ctx)) + else: + if __debug__: + _z3_assert(False, "invalid parameter value") + + def __repr__(self): + return Z3_params_to_string(self.ctx.ref(), self.params) + + def validate(self, ds): + _z3_assert(isinstance(ds, ParamDescrsRef), "parameter description set expected") + Z3_params_validate(self.ctx.ref(), self.params, ds.descr) + +def args2params(arguments, keywords, ctx=None): + """Convert python arguments into a Z3_params object. + A ':' is added to the keywords, and '_' is replaced with '-' + + >>> args2params(['model', True, 'relevancy', 2], {'elim_and' : True}) + (params model true relevancy 2 elim_and true) + """ + if __debug__: + _z3_assert(len(arguments) % 2 == 0, "Argument list must have an even number of elements.") + prev = None + r = ParamsRef(ctx) + for a in arguments: + if prev is None: + prev = a + else: + r.set(prev, a) + prev = None + for k in keywords: + v = keywords[k] + r.set(k, v) + return r + +class ParamDescrsRef: + """Set of parameter descriptions for Solvers, Tactics and Simplifiers in Z3. + """ + def __init__(self, descr, ctx=None): + _z3_assert(isinstance(descr, ParamDescrs), "parameter description object expected") + self.ctx = _get_ctx(ctx) + self.descr = descr + Z3_param_descrs_inc_ref(self.ctx.ref(), self.descr) + + def __deepcopy__(self, memo={}): + return ParamsDescrsRef(self.descr, self.ctx) + + def __del__(self): + if self.ctx.ref() is not None: + Z3_param_descrs_dec_ref(self.ctx.ref(), self.descr) + + def size(self): + """Return the size of in the parameter description `self`. + """ + return int(Z3_param_descrs_size(self.ctx.ref(), self.descr)) + + def __len__(self): + """Return the size of in the parameter description `self`. + """ + return self.size() + + def get_name(self, i): + """Return the i-th parameter name in the parameter description `self`. + """ + return _symbol2py(self.ctx, Z3_param_descrs_get_name(self.ctx.ref(), self.descr, i)) + + def get_kind(self, n): + """Return the kind of the parameter named `n`. + """ + return Z3_param_descrs_get_kind(self.ctx.ref(), self.descr, to_symbol(n, self.ctx)) + + def get_documentation(self, n): + """Return the documentation string of the parameter named `n`. + """ + return Z3_param_descrs_get_documentation(self.ctx.ref(), self.descr, to_symbol(n, self.ctx)) + + def __getitem__(self, arg): + if _is_int(arg): + return self.get_name(arg) + else: + return self.get_kind(arg) + + def __repr__(self): + return Z3_param_descrs_to_string(self.ctx.ref(), self.descr) + +######################################### +# +# Goals +# +######################################### + +class Goal(Z3PPObject): + """Goal is a collection of constraints we want to find a solution or show to be unsatisfiable (infeasible). + + Goals are processed using Tactics. A Tactic transforms a goal into a set of subgoals. + A goal has a solution if one of its subgoals has a solution. + A goal is unsatisfiable if all subgoals are unsatisfiable. + """ + + def __init__(self, models=True, unsat_cores=False, proofs=False, ctx=None, goal=None): + if __debug__: + _z3_assert(goal is None or ctx is not None, "If goal is different from None, then ctx must be also different from None") + self.ctx = _get_ctx(ctx) + self.goal = goal + if self.goal is None: + self.goal = Z3_mk_goal(self.ctx.ref(), models, unsat_cores, proofs) + Z3_goal_inc_ref(self.ctx.ref(), self.goal) + + def __deepcopy__(self, memo={}): + return Goal(False, False, False, self.ctx, self.goal) + + def __del__(self): + if self.goal is not None and self.ctx.ref() is not None: + Z3_goal_dec_ref(self.ctx.ref(), self.goal) + + def depth(self): + """Return the depth of the goal `self`. The depth corresponds to the number of tactics applied to `self`. + + >>> x, y = Ints('x y') + >>> g = Goal() + >>> g.add(x == 0, y >= x + 1) + >>> g.depth() + 0 + >>> r = Then('simplify', 'solve-eqs')(g) + >>> # r has 1 subgoal + >>> len(r) + 1 + >>> r[0].depth() + 2 + """ + return int(Z3_goal_depth(self.ctx.ref(), self.goal)) + + def inconsistent(self): + """Return `True` if `self` contains the `False` constraints. + + >>> x, y = Ints('x y') + >>> g = Goal() + >>> g.inconsistent() + False + >>> g.add(x == 0, x == 1) + >>> g + [x == 0, x == 1] + >>> g.inconsistent() + False + >>> g2 = Tactic('propagate-values')(g)[0] + >>> g2.inconsistent() + True + """ + return Z3_goal_inconsistent(self.ctx.ref(), self.goal) + + def prec(self): + """Return the precision (under-approximation, over-approximation, or precise) of the goal `self`. + + >>> g = Goal() + >>> g.prec() == Z3_GOAL_PRECISE + True + >>> x, y = Ints('x y') + >>> g.add(x == y + 1) + >>> g.prec() == Z3_GOAL_PRECISE + True + >>> t = With(Tactic('add-bounds'), add_bound_lower=0, add_bound_upper=10) + >>> g2 = t(g)[0] + >>> g2 + [x == y + 1, x <= 10, x >= 0, y <= 10, y >= 0] + >>> g2.prec() == Z3_GOAL_PRECISE + False + >>> g2.prec() == Z3_GOAL_UNDER + True + """ + return Z3_goal_precision(self.ctx.ref(), self.goal) + + def precision(self): + """Alias for `prec()`. + + >>> g = Goal() + >>> g.precision() == Z3_GOAL_PRECISE + True + """ + return self.prec() + + def size(self): + """Return the number of constraints in the goal `self`. + + >>> g = Goal() + >>> g.size() + 0 + >>> x, y = Ints('x y') + >>> g.add(x == 0, y > x) + >>> g.size() + 2 + """ + return int(Z3_goal_size(self.ctx.ref(), self.goal)) + + def __len__(self): + """Return the number of constraints in the goal `self`. + + >>> g = Goal() + >>> len(g) + 0 + >>> x, y = Ints('x y') + >>> g.add(x == 0, y > x) + >>> len(g) + 2 + """ + return self.size() + + def get(self, i): + """Return a constraint in the goal `self`. + + >>> g = Goal() + >>> x, y = Ints('x y') + >>> g.add(x == 0, y > x) + >>> g.get(0) + x == 0 + >>> g.get(1) + y > x + """ + return _to_expr_ref(Z3_goal_formula(self.ctx.ref(), self.goal, i), self.ctx) + + def __getitem__(self, arg): + """Return a constraint in the goal `self`. + + >>> g = Goal() + >>> x, y = Ints('x y') + >>> g.add(x == 0, y > x) + >>> g[0] + x == 0 + >>> g[1] + y > x + """ + if arg >= len(self): + raise IndexError + return self.get(arg) + + def assert_exprs(self, *args): + """Assert constraints into the goal. + + >>> x = Int('x') + >>> g = Goal() + >>> g.assert_exprs(x > 0, x < 2) + >>> g + [x > 0, x < 2] + """ + args = _get_args(args) + s = BoolSort(self.ctx) + for arg in args: + arg = s.cast(arg) + Z3_goal_assert(self.ctx.ref(), self.goal, arg.as_ast()) + + def append(self, *args): + """Add constraints. + + >>> x = Int('x') + >>> g = Goal() + >>> g.append(x > 0, x < 2) + >>> g + [x > 0, x < 2] + """ + self.assert_exprs(*args) + + def insert(self, *args): + """Add constraints. + + >>> x = Int('x') + >>> g = Goal() + >>> g.insert(x > 0, x < 2) + >>> g + [x > 0, x < 2] + """ + self.assert_exprs(*args) + + def add(self, *args): + """Add constraints. + + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 0, x < 2) + >>> g + [x > 0, x < 2] + """ + self.assert_exprs(*args) + + def __repr__(self): + return obj_to_string(self) + + def sexpr(self): + """Return a textual representation of the s-expression representing the goal.""" + return Z3_goal_to_string(self.ctx.ref(), self.goal) + + def translate(self, target): + """Copy goal `self` to context `target`. + + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 10) + >>> g + [x > 10] + >>> c2 = Context() + >>> g2 = g.translate(c2) + >>> g2 + [x > 10] + >>> g.ctx == main_ctx() + True + >>> g2.ctx == c2 + True + >>> g2.ctx == main_ctx() + False + """ + if __debug__: + _z3_assert(isinstance(target, Context), "target must be a context") + return Goal(goal=Z3_goal_translate(self.ctx.ref(), self.goal, target.ref()), ctx=target) + + def simplify(self, *arguments, **keywords): + """Return a new simplified goal. + + This method is essentially invoking the simplify tactic. + + >>> g = Goal() + >>> x = Int('x') + >>> g.add(x + 1 >= 2) + >>> g + [x + 1 >= 2] + >>> g2 = g.simplify() + >>> g2 + [x >= 1] + >>> # g was not modified + >>> g + [x + 1 >= 2] + """ + t = Tactic('simplify') + return t.apply(self, *arguments, **keywords)[0] + + def as_expr(self): + """Return goal `self` as a single Z3 expression. + + >>> x = Int('x') + >>> g = Goal() + >>> g.as_expr() + True + >>> g.add(x > 1) + >>> g.as_expr() + x > 1 + >>> g.add(x < 10) + >>> g.as_expr() + And(x > 1, x < 10) + """ + sz = len(self) + if sz == 0: + return BoolVal(True, self.ctx) + elif sz == 1: + return self.get(0) + else: + return And([ self.get(i) for i in range(len(self)) ], self.ctx) + +######################################### +# +# AST Vector +# +######################################### +class AstVector(Z3PPObject): + """A collection (vector) of ASTs.""" + + def __init__(self, v=None, ctx=None): + self.vector = None + if v is None: + self.ctx = _get_ctx(ctx) + self.vector = Z3_mk_ast_vector(self.ctx.ref()) + else: + self.vector = v + assert ctx is not None + self.ctx = ctx + Z3_ast_vector_inc_ref(self.ctx.ref(), self.vector) + + def __deepcopy__(self, memo={}): + return AstVector(self.vector, self.ctx) + + def __del__(self): + if self.vector is not None and self.ctx.ref() is not None: + Z3_ast_vector_dec_ref(self.ctx.ref(), self.vector) + + def __len__(self): + """Return the size of the vector `self`. + + >>> A = AstVector() + >>> len(A) + 0 + >>> A.push(Int('x')) + >>> A.push(Int('x')) + >>> len(A) + 2 + """ + return int(Z3_ast_vector_size(self.ctx.ref(), self.vector)) + + def __getitem__(self, i): + """Return the AST at position `i`. + + >>> A = AstVector() + >>> A.push(Int('x') + 1) + >>> A.push(Int('y')) + >>> A[0] + x + 1 + >>> A[1] + y + """ + if i >= self.__len__(): + raise IndexError + return _to_ast_ref(Z3_ast_vector_get(self.ctx.ref(), self.vector, i), self.ctx) + + def __setitem__(self, i, v): + """Update AST at position `i`. + + >>> A = AstVector() + >>> A.push(Int('x') + 1) + >>> A.push(Int('y')) + >>> A[0] + x + 1 + >>> A[0] = Int('x') + >>> A[0] + x + """ + if i >= self.__len__(): + raise IndexError + Z3_ast_vector_set(self.ctx.ref(), self.vector, i, v.as_ast()) + + def push(self, v): + """Add `v` in the end of the vector. + + >>> A = AstVector() + >>> len(A) + 0 + >>> A.push(Int('x')) + >>> len(A) + 1 + """ + Z3_ast_vector_push(self.ctx.ref(), self.vector, v.as_ast()) + + def resize(self, sz): + """Resize the vector to `sz` elements. + + >>> A = AstVector() + >>> A.resize(10) + >>> len(A) + 10 + >>> for i in range(10): A[i] = Int('x') + >>> A[5] + x + """ + Z3_ast_vector_resize(self.ctx.ref(), self.vector, sz) + + def __contains__(self, item): + """Return `True` if the vector contains `item`. + + >>> x = Int('x') + >>> A = AstVector() + >>> x in A + False + >>> A.push(x) + >>> x in A + True + >>> (x+1) in A + False + >>> A.push(x+1) + >>> (x+1) in A + True + >>> A + [x, x + 1] + """ + for elem in self: + if elem.eq(item): + return True + return False + + def translate(self, other_ctx): + """Copy vector `self` to context `other_ctx`. + + >>> x = Int('x') + >>> A = AstVector() + >>> A.push(x) + >>> c2 = Context() + >>> B = A.translate(c2) + >>> B + [x] + """ + return AstVector(Z3_ast_vector_translate(self.ctx.ref(), self.vector, other_ctx.ref()), other_ctx) + + def __repr__(self): + return obj_to_string(self) + + def sexpr(self): + """Return a textual representation of the s-expression representing the vector.""" + return Z3_ast_vector_to_string(self.ctx.ref(), self.vector) + +######################################### +# +# AST Map +# +######################################### +class AstMap: + """A mapping from ASTs to ASTs.""" + + def __init__(self, m=None, ctx=None): + self.map = None + if m is None: + self.ctx = _get_ctx(ctx) + self.map = Z3_mk_ast_map(self.ctx.ref()) + else: + self.map = m + assert ctx is not None + self.ctx = ctx + Z3_ast_map_inc_ref(self.ctx.ref(), self.map) + + def __deepcopy__(self, memo={}): + return AstMap(self.map, self.ctx) + + def __del__(self): + if self.map is not None and self.ctx.ref() is not None: + Z3_ast_map_dec_ref(self.ctx.ref(), self.map) + + def __len__(self): + """Return the size of the map. + + >>> M = AstMap() + >>> len(M) + 0 + >>> x = Int('x') + >>> M[x] = IntVal(1) + >>> len(M) + 1 + """ + return int(Z3_ast_map_size(self.ctx.ref(), self.map)) + + def __contains__(self, key): + """Return `True` if the map contains key `key`. + + >>> M = AstMap() + >>> x = Int('x') + >>> M[x] = x + 1 + >>> x in M + True + >>> x+1 in M + False + """ + return Z3_ast_map_contains(self.ctx.ref(), self.map, key.as_ast()) + + def __getitem__(self, key): + """Retrieve the value associated with key `key`. + + >>> M = AstMap() + >>> x = Int('x') + >>> M[x] = x + 1 + >>> M[x] + x + 1 + """ + return _to_ast_ref(Z3_ast_map_find(self.ctx.ref(), self.map, key.as_ast()), self.ctx) + + def __setitem__(self, k, v): + """Add/Update key `k` with value `v`. + + >>> M = AstMap() + >>> x = Int('x') + >>> M[x] = x + 1 + >>> len(M) + 1 + >>> M[x] + x + 1 + >>> M[x] = IntVal(1) + >>> M[x] + 1 + """ + Z3_ast_map_insert(self.ctx.ref(), self.map, k.as_ast(), v.as_ast()) + + def __repr__(self): + return Z3_ast_map_to_string(self.ctx.ref(), self.map) + + def erase(self, k): + """Remove the entry associated with key `k`. + + >>> M = AstMap() + >>> x = Int('x') + >>> M[x] = x + 1 + >>> len(M) + 1 + >>> M.erase(x) + >>> len(M) + 0 + """ + Z3_ast_map_erase(self.ctx.ref(), self.map, k.as_ast()) + + def reset(self): + """Remove all entries from the map. + + >>> M = AstMap() + >>> x = Int('x') + >>> M[x] = x + 1 + >>> M[x+x] = IntVal(1) + >>> len(M) + 2 + >>> M.reset() + >>> len(M) + 0 + """ + Z3_ast_map_reset(self.ctx.ref(), self.map) + + def keys(self): + """Return an AstVector containing all keys in the map. + + >>> M = AstMap() + >>> x = Int('x') + >>> M[x] = x + 1 + >>> M[x+x] = IntVal(1) + >>> M.keys() + [x, x + x] + """ + return AstVector(Z3_ast_map_keys(self.ctx.ref(), self.map), self.ctx) + +######################################### +# +# Model +# +######################################### + +class FuncEntry: + """Store the value of the interpretation of a function in a particular point.""" + + def __init__(self, entry, ctx): + self.entry = entry + self.ctx = ctx + Z3_func_entry_inc_ref(self.ctx.ref(), self.entry) + + def __deepcopy__(self, memo={}): + return FuncEntry(self.entry, self.ctx) + + def __del__(self): + if self.ctx.ref() is not None: + Z3_func_entry_dec_ref(self.ctx.ref(), self.entry) + + def num_args(self): + """Return the number of arguments in the given entry. + + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> s = Solver() + >>> s.add(f(0, 1) == 10, f(1, 2) == 20, f(1, 0) == 10) + >>> s.check() + sat + >>> m = s.model() + >>> f_i = m[f] + >>> f_i.num_entries() + 3 + >>> e = f_i.entry(0) + >>> e.num_args() + 2 + """ + return int(Z3_func_entry_get_num_args(self.ctx.ref(), self.entry)) + + def arg_value(self, idx): + """Return the value of argument `idx`. + + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> s = Solver() + >>> s.add(f(0, 1) == 10, f(1, 2) == 20, f(1, 0) == 10) + >>> s.check() + sat + >>> m = s.model() + >>> f_i = m[f] + >>> f_i.num_entries() + 3 + >>> e = f_i.entry(0) + >>> e + [0, 1, 10] + >>> e.num_args() + 2 + >>> e.arg_value(0) + 0 + >>> e.arg_value(1) + 1 + >>> try: + ... e.arg_value(2) + ... except IndexError: + ... print("index error") + index error + """ + if idx >= self.num_args(): + raise IndexError + return _to_expr_ref(Z3_func_entry_get_arg(self.ctx.ref(), self.entry, idx), self.ctx) + + def value(self): + """Return the value of the function at point `self`. + + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> s = Solver() + >>> s.add(f(0, 1) == 10, f(1, 2) == 20, f(1, 0) == 10) + >>> s.check() + sat + >>> m = s.model() + >>> f_i = m[f] + >>> f_i.num_entries() + 3 + >>> e = f_i.entry(0) + >>> e + [0, 1, 10] + >>> e.num_args() + 2 + >>> e.value() + 10 + """ + return _to_expr_ref(Z3_func_entry_get_value(self.ctx.ref(), self.entry), self.ctx) + + def as_list(self): + """Return entry `self` as a Python list. + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> s = Solver() + >>> s.add(f(0, 1) == 10, f(1, 2) == 20, f(1, 0) == 10) + >>> s.check() + sat + >>> m = s.model() + >>> f_i = m[f] + >>> f_i.num_entries() + 3 + >>> e = f_i.entry(0) + >>> e.as_list() + [0, 1, 10] + """ + args = [ self.arg_value(i) for i in range(self.num_args())] + args.append(self.value()) + return args + + def __repr__(self): + return repr(self.as_list()) + +class FuncInterp(Z3PPObject): + """Stores the interpretation of a function in a Z3 model.""" + + def __init__(self, f, ctx): + self.f = f + self.ctx = ctx + if self.f is not None: + Z3_func_interp_inc_ref(self.ctx.ref(), self.f) + + def __deepcopy__(self, memo={}): + return FuncInterp(self.f, self.ctx) + + def __del__(self): + if self.f is not None and self.ctx.ref() is not None: + Z3_func_interp_dec_ref(self.ctx.ref(), self.f) + + def else_value(self): + """ + Return the `else` value for a function interpretation. + Return None if Z3 did not specify the `else` value for + this object. + + >>> f = Function('f', IntSort(), IntSort()) + >>> s = Solver() + >>> s.add(f(0) == 1, f(1) == 1, f(2) == 0) + >>> s.check() + sat + >>> m = s.model() + >>> m[f] + [0 -> 1, 1 -> 1, 2 -> 0, else -> 1] + >>> m[f].else_value() + 1 + """ + r = Z3_func_interp_get_else(self.ctx.ref(), self.f) + if r: + return _to_expr_ref(r, self.ctx) + else: + return None + + def num_entries(self): + """Return the number of entries/points in the function interpretation `self`. + + >>> f = Function('f', IntSort(), IntSort()) + >>> s = Solver() + >>> s.add(f(0) == 1, f(1) == 1, f(2) == 0) + >>> s.check() + sat + >>> m = s.model() + >>> m[f] + [0 -> 1, 1 -> 1, 2 -> 0, else -> 1] + >>> m[f].num_entries() + 3 + """ + return int(Z3_func_interp_get_num_entries(self.ctx.ref(), self.f)) + + def arity(self): + """Return the number of arguments for each entry in the function interpretation `self`. + + >>> f = Function('f', IntSort(), IntSort()) + >>> s = Solver() + >>> s.add(f(0) == 1, f(1) == 1, f(2) == 0) + >>> s.check() + sat + >>> m = s.model() + >>> m[f].arity() + 1 + """ + return int(Z3_func_interp_get_arity(self.ctx.ref(), self.f)) + + def entry(self, idx): + """Return an entry at position `idx < self.num_entries()` in the function interpretation `self`. + + >>> f = Function('f', IntSort(), IntSort()) + >>> s = Solver() + >>> s.add(f(0) == 1, f(1) == 1, f(2) == 0) + >>> s.check() + sat + >>> m = s.model() + >>> m[f] + [0 -> 1, 1 -> 1, 2 -> 0, else -> 1] + >>> m[f].num_entries() + 3 + >>> m[f].entry(0) + [0, 1] + >>> m[f].entry(1) + [1, 1] + >>> m[f].entry(2) + [2, 0] + """ + if idx >= self.num_entries(): + raise IndexError + return FuncEntry(Z3_func_interp_get_entry(self.ctx.ref(), self.f, idx), self.ctx) + + def as_list(self): + """Return the function interpretation as a Python list. + >>> f = Function('f', IntSort(), IntSort()) + >>> s = Solver() + >>> s.add(f(0) == 1, f(1) == 1, f(2) == 0) + >>> s.check() + sat + >>> m = s.model() + >>> m[f] + [0 -> 1, 1 -> 1, 2 -> 0, else -> 1] + >>> m[f].as_list() + [[0, 1], [1, 1], [2, 0], 1] + """ + r = [ self.entry(i).as_list() for i in range(self.num_entries())] + r.append(self.else_value()) + return r + + def __repr__(self): + return obj_to_string(self) + +class ModelRef(Z3PPObject): + """Model/Solution of a satisfiability problem (aka system of constraints).""" + + def __init__(self, m, ctx): + assert ctx is not None + self.model = m + self.ctx = ctx + Z3_model_inc_ref(self.ctx.ref(), self.model) + + def __deepcopy__(self, memo={}): + return ModelRef(self.m, self.ctx) + + def __del__(self): + if self.ctx.ref() is not None: + Z3_model_dec_ref(self.ctx.ref(), self.model) + + def __repr__(self): + return obj_to_string(self) + + def sexpr(self): + """Return a textual representation of the s-expression representing the model.""" + return Z3_model_to_string(self.ctx.ref(), self.model) + + def eval(self, t, model_completion=False): + """Evaluate the expression `t` in the model `self`. If `model_completion` is enabled, then a default interpretation is automatically added for symbols that do not have an interpretation in the model `self`. + + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0, x < 2) + >>> s.check() + sat + >>> m = s.model() + >>> m.eval(x + 1) + 2 + >>> m.eval(x == 1) + True + >>> y = Int('y') + >>> m.eval(y + x) + 1 + y + >>> m.eval(y) + y + >>> m.eval(y, model_completion=True) + 0 + >>> # Now, m contains an interpretation for y + >>> m.eval(y + x) + 1 + """ + r = (Ast * 1)() + if Z3_model_eval(self.ctx.ref(), self.model, t.as_ast(), model_completion, r): + return _to_expr_ref(r[0], self.ctx) + raise Z3Exception("failed to evaluate expression in the model") + + def evaluate(self, t, model_completion=False): + """Alias for `eval`. + + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0, x < 2) + >>> s.check() + sat + >>> m = s.model() + >>> m.evaluate(x + 1) + 2 + >>> m.evaluate(x == 1) + True + >>> y = Int('y') + >>> m.evaluate(y + x) + 1 + y + >>> m.evaluate(y) + y + >>> m.evaluate(y, model_completion=True) + 0 + >>> # Now, m contains an interpretation for y + >>> m.evaluate(y + x) + 1 + """ + return self.eval(t, model_completion) + + def __len__(self): + """Return the number of constant and function declarations in the model `self`. + + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0, f(x) != x) + >>> s.check() + sat + >>> m = s.model() + >>> len(m) + 2 + """ + return int(Z3_model_get_num_consts(self.ctx.ref(), self.model)) + int(Z3_model_get_num_funcs(self.ctx.ref(), self.model)) + + def get_interp(self, decl): + """Return the interpretation for a given declaration or constant. + + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0, x < 2, f(x) == 0) + >>> s.check() + sat + >>> m = s.model() + >>> m[x] + 1 + >>> m[f] + [1 -> 0, else -> 0] + """ + if __debug__: + _z3_assert(isinstance(decl, FuncDeclRef) or is_const(decl), "Z3 declaration expected") + if is_const(decl): + decl = decl.decl() + try: + if decl.arity() == 0: + _r = Z3_model_get_const_interp(self.ctx.ref(), self.model, decl.ast) + if _r.value is None: + return None + r = _to_expr_ref(_r, self.ctx) + if is_as_array(r): + return self.get_interp(get_as_array_func(r)) + else: + return r + else: + return FuncInterp(Z3_model_get_func_interp(self.ctx.ref(), self.model, decl.ast), self.ctx) + except Z3Exception: + return None + + def num_sorts(self): + """Return the number of unintepreted sorts that contain an interpretation in the model `self`. + + >>> A = DeclareSort('A') + >>> a, b = Consts('a b', A) + >>> s = Solver() + >>> s.add(a != b) + >>> s.check() + sat + >>> m = s.model() + >>> m.num_sorts() + 1 + """ + return int(Z3_model_get_num_sorts(self.ctx.ref(), self.model)) + + def get_sort(self, idx): + """Return the unintepreted sort at position `idx` < self.num_sorts(). + + >>> A = DeclareSort('A') + >>> B = DeclareSort('B') + >>> a1, a2 = Consts('a1 a2', A) + >>> b1, b2 = Consts('b1 b2', B) + >>> s = Solver() + >>> s.add(a1 != a2, b1 != b2) + >>> s.check() + sat + >>> m = s.model() + >>> m.num_sorts() + 2 + >>> m.get_sort(0) + A + >>> m.get_sort(1) + B + """ + if idx >= self.num_sorts(): + raise IndexError + return _to_sort_ref(Z3_model_get_sort(self.ctx.ref(), self.model, idx), self.ctx) + + def sorts(self): + """Return all uninterpreted sorts that have an interpretation in the model `self`. + + >>> A = DeclareSort('A') + >>> B = DeclareSort('B') + >>> a1, a2 = Consts('a1 a2', A) + >>> b1, b2 = Consts('b1 b2', B) + >>> s = Solver() + >>> s.add(a1 != a2, b1 != b2) + >>> s.check() + sat + >>> m = s.model() + >>> m.sorts() + [A, B] + """ + return [ self.get_sort(i) for i in range(self.num_sorts()) ] + + def get_universe(self, s): + """Return the intepretation for the uninterpreted sort `s` in the model `self`. + + >>> A = DeclareSort('A') + >>> a, b = Consts('a b', A) + >>> s = Solver() + >>> s.add(a != b) + >>> s.check() + sat + >>> m = s.model() + >>> m.get_universe(A) + [A!val!0, A!val!1] + """ + if __debug__: + _z3_assert(isinstance(s, SortRef), "Z3 sort expected") + try: + return AstVector(Z3_model_get_sort_universe(self.ctx.ref(), self.model, s.ast), self.ctx) + except Z3Exception: + return None + + def __getitem__(self, idx): + """If `idx` is an integer, then the declaration at position `idx` in the model `self` is returned. If `idx` is a declaration, then the actual interpreation is returned. + + The elements can be retrieved using position or the actual declaration. + + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0, x < 2, f(x) == 0) + >>> s.check() + sat + >>> m = s.model() + >>> len(m) + 2 + >>> m[0] + x + >>> m[1] + f + >>> m[x] + 1 + >>> m[f] + [1 -> 0, else -> 0] + >>> for d in m: print("%s -> %s" % (d, m[d])) + x -> 1 + f -> [1 -> 0, else -> 0] + """ + if _is_int(idx): + if idx >= len(self): + raise IndexError + num_consts = Z3_model_get_num_consts(self.ctx.ref(), self.model) + if (idx < num_consts): + return FuncDeclRef(Z3_model_get_const_decl(self.ctx.ref(), self.model, idx), self.ctx) + else: + return FuncDeclRef(Z3_model_get_func_decl(self.ctx.ref(), self.model, idx - num_consts), self.ctx) + if isinstance(idx, FuncDeclRef): + return self.get_interp(idx) + if is_const(idx): + return self.get_interp(idx.decl()) + if isinstance(idx, SortRef): + return self.get_universe(idx) + if __debug__: + _z3_assert(False, "Integer, Z3 declaration, or Z3 constant expected") + return None + + def decls(self): + """Return a list with all symbols that have an interpreation in the model `self`. + >>> f = Function('f', IntSort(), IntSort()) + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0, x < 2, f(x) == 0) + >>> s.check() + sat + >>> m = s.model() + >>> m.decls() + [x, f] + """ + r = [] + for i in range(Z3_model_get_num_consts(self.ctx.ref(), self.model)): + r.append(FuncDeclRef(Z3_model_get_const_decl(self.ctx.ref(), self.model, i), self.ctx)) + for i in range(Z3_model_get_num_funcs(self.ctx.ref(), self.model)): + r.append(FuncDeclRef(Z3_model_get_func_decl(self.ctx.ref(), self.model, i), self.ctx)) + return r + +def is_as_array(n): + """Return true if n is a Z3 expression of the form (_ as-array f).""" + return isinstance(n, ExprRef) and Z3_is_as_array(n.ctx.ref(), n.as_ast()) + +def get_as_array_func(n): + """Return the function declaration f associated with a Z3 expression of the form (_ as-array f).""" + if __debug__: + _z3_assert(is_as_array(n), "as-array Z3 expression expected.") + return FuncDeclRef(Z3_get_as_array_func_decl(n.ctx.ref(), n.as_ast()), n.ctx) + +######################################### +# +# Statistics +# +######################################### +class Statistics: + """Statistics for `Solver.check()`.""" + + def __init__(self, stats, ctx): + self.stats = stats + self.ctx = ctx + Z3_stats_inc_ref(self.ctx.ref(), self.stats) + + def __deepcopy__(self, memo={}): + return Statistics(self.stats, self.ctx) + + def __del__(self): + if self.ctx.ref() is not None: + Z3_stats_dec_ref(self.ctx.ref(), self.stats) + + def __repr__(self): + if in_html_mode(): + out = io.StringIO() + even = True + out.write(u('<table border="1" cellpadding="2" cellspacing="0">')) + for k, v in self: + if even: + out.write(u('<tr style="background-color:#CFCFCF">')) + even = False + else: + out.write(u('<tr>')) + even = True + out.write(u('<td>%s</td><td>%s</td></tr>' % (k, v))) + out.write(u('</table>')) + return out.getvalue() + else: + return Z3_stats_to_string(self.ctx.ref(), self.stats) + + def __len__(self): + """Return the number of statistical counters. + + >>> x = Int('x') + >>> s = Then('simplify', 'nlsat').solver() + >>> s.add(x > 0) + >>> s.check() + sat + >>> st = s.statistics() + >>> len(st) + 6 + """ + return int(Z3_stats_size(self.ctx.ref(), self.stats)) + + def __getitem__(self, idx): + """Return the value of statistical counter at position `idx`. The result is a pair (key, value). + + >>> x = Int('x') + >>> s = Then('simplify', 'nlsat').solver() + >>> s.add(x > 0) + >>> s.check() + sat + >>> st = s.statistics() + >>> len(st) + 6 + >>> st[0] + ('nlsat propagations', 2) + >>> st[1] + ('nlsat stages', 2) + """ + if idx >= len(self): + raise IndexError + if Z3_stats_is_uint(self.ctx.ref(), self.stats, idx): + val = int(Z3_stats_get_uint_value(self.ctx.ref(), self.stats, idx)) + else: + val = Z3_stats_get_double_value(self.ctx.ref(), self.stats, idx) + return (Z3_stats_get_key(self.ctx.ref(), self.stats, idx), val) + + def keys(self): + """Return the list of statistical counters. + + >>> x = Int('x') + >>> s = Then('simplify', 'nlsat').solver() + >>> s.add(x > 0) + >>> s.check() + sat + >>> st = s.statistics() + """ + return [Z3_stats_get_key(self.ctx.ref(), self.stats, idx) for idx in range(len(self))] + + def get_key_value(self, key): + """Return the value of a particular statistical counter. + + >>> x = Int('x') + >>> s = Then('simplify', 'nlsat').solver() + >>> s.add(x > 0) + >>> s.check() + sat + >>> st = s.statistics() + >>> st.get_key_value('nlsat propagations') + 2 + """ + for idx in range(len(self)): + if key == Z3_stats_get_key(self.ctx.ref(), self.stats, idx): + if Z3_stats_is_uint(self.ctx.ref(), self.stats, idx): + return int(Z3_stats_get_uint_value(self.ctx.ref(), self.stats, idx)) + else: + return Z3_stats_get_double_value(self.ctx.ref(), self.stats, idx) + raise Z3Exception("unknown key") + + def __getattr__(self, name): + """Access the value of statistical using attributes. + + Remark: to access a counter containing blank spaces (e.g., 'nlsat propagations'), + we should use '_' (e.g., 'nlsat_propagations'). + + >>> x = Int('x') + >>> s = Then('simplify', 'nlsat').solver() + >>> s.add(x > 0) + >>> s.check() + sat + >>> st = s.statistics() + >>> st.nlsat_propagations + 2 + >>> st.nlsat_stages + 2 + """ + key = name.replace('_', ' ') + try: + return self.get_key_value(key) + except Z3Exception: + raise AttributeError + +######################################### +# +# Solver +# +######################################### +class CheckSatResult: + """Represents the result of a satisfiability check: sat, unsat, unknown. + + >>> s = Solver() + >>> s.check() + sat + >>> r = s.check() + >>> isinstance(r, CheckSatResult) + True + """ + + def __init__(self, r): + self.r = r + + def __deepcopy__(self, memo={}): + return CheckSatResult(self.r) + + def __eq__(self, other): + return isinstance(other, CheckSatResult) and self.r == other.r + + def __ne__(self, other): + return not self.__eq__(other) + + def __repr__(self): + if in_html_mode(): + if self.r == Z3_L_TRUE: + return "<b>sat</b>" + elif self.r == Z3_L_FALSE: + return "<b>unsat</b>" + else: + return "<b>unknown</b>" + else: + if self.r == Z3_L_TRUE: + return "sat" + elif self.r == Z3_L_FALSE: + return "unsat" + else: + return "unknown" + +sat = CheckSatResult(Z3_L_TRUE) +unsat = CheckSatResult(Z3_L_FALSE) +unknown = CheckSatResult(Z3_L_UNDEF) + +class Solver(Z3PPObject): + """Solver API provides methods for implementing the main SMT 2.0 commands: push, pop, check, get-model, etc.""" + + def __init__(self, solver=None, ctx=None): + assert solver is None or ctx is not None + self.ctx = _get_ctx(ctx) + self.solver = None + if solver is None: + self.solver = Z3_mk_solver(self.ctx.ref()) + else: + self.solver = solver + Z3_solver_inc_ref(self.ctx.ref(), self.solver) + + def __deepcopy__(self, memo={}): + return Solver(self.solver, self.ctx) + + def __del__(self): + if self.solver is not None and self.ctx.ref() is not None: + Z3_solver_dec_ref(self.ctx.ref(), self.solver) + + def set(self, *args, **keys): + """Set a configuration option. The method `help()` return a string containing all available options. + + >>> s = Solver() + >>> # The option MBQI can be set using three different approaches. + >>> s.set(mbqi=True) + >>> s.set('MBQI', True) + >>> s.set(':mbqi', True) + """ + p = args2params(args, keys, self.ctx) + Z3_solver_set_params(self.ctx.ref(), self.solver, p.params) + + def push(self): + """Create a backtracking point. + + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0) + >>> s + [x > 0] + >>> s.push() + >>> s.add(x < 1) + >>> s + [x > 0, x < 1] + >>> s.check() + unsat + >>> s.pop() + >>> s.check() + sat + >>> s + [x > 0] + """ + Z3_solver_push(self.ctx.ref(), self.solver) + + def pop(self, num=1): + """Backtrack \c num backtracking points. + + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0) + >>> s + [x > 0] + >>> s.push() + >>> s.add(x < 1) + >>> s + [x > 0, x < 1] + >>> s.check() + unsat + >>> s.pop() + >>> s.check() + sat + >>> s + [x > 0] + """ + Z3_solver_pop(self.ctx.ref(), self.solver, num) + + def num_scopes(self): + """Return the current number of backtracking points. + + >>> s = Solver() + >>> s.num_scopes() + 0L + >>> s.push() + >>> s.num_scopes() + 1L + >>> s.push() + >>> s.num_scopes() + 2L + >>> s.pop() + >>> s.num_scopes() + 1L + """ + return Z3_solver_get_num_scopes(self.ctx.ref(), self.solver) + + def reset(self): + """Remove all asserted constraints and backtracking points created using `push()`. + + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0) + >>> s + [x > 0] + >>> s.reset() + >>> s + [] + """ + Z3_solver_reset(self.ctx.ref(), self.solver) + + def assert_exprs(self, *args): + """Assert constraints into the solver. + + >>> x = Int('x') + >>> s = Solver() + >>> s.assert_exprs(x > 0, x < 2) + >>> s + [x > 0, x < 2] + """ + args = _get_args(args) + s = BoolSort(self.ctx) + for arg in args: + if isinstance(arg, Goal) or isinstance(arg, AstVector): + for f in arg: + Z3_solver_assert(self.ctx.ref(), self.solver, f.as_ast()) + else: + arg = s.cast(arg) + Z3_solver_assert(self.ctx.ref(), self.solver, arg.as_ast()) + + def add(self, *args): + """Assert constraints into the solver. + + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0, x < 2) + >>> s + [x > 0, x < 2] + """ + self.assert_exprs(*args) + + def __iadd__(self, fml): + self.add(fml) + return self + + def append(self, *args): + """Assert constraints into the solver. + + >>> x = Int('x') + >>> s = Solver() + >>> s.append(x > 0, x < 2) + >>> s + [x > 0, x < 2] + """ + self.assert_exprs(*args) + + def insert(self, *args): + """Assert constraints into the solver. + + >>> x = Int('x') + >>> s = Solver() + >>> s.insert(x > 0, x < 2) + >>> s + [x > 0, x < 2] + """ + self.assert_exprs(*args) + + def assert_and_track(self, a, p): + """Assert constraint `a` and track it in the unsat core using the Boolean constant `p`. + + If `p` is a string, it will be automatically converted into a Boolean constant. + + >>> x = Int('x') + >>> p3 = Bool('p3') + >>> s = Solver() + >>> s.set(unsat_core=True) + >>> s.assert_and_track(x > 0, 'p1') + >>> s.assert_and_track(x != 1, 'p2') + >>> s.assert_and_track(x < 0, p3) + >>> print(s.check()) + unsat + >>> c = s.unsat_core() + >>> len(c) + 2 + >>> Bool('p1') in c + True + >>> Bool('p2') in c + False + >>> p3 in c + True + """ + if isinstance(p, str): + p = Bool(p, self.ctx) + _z3_assert(isinstance(a, BoolRef), "Boolean expression expected") + _z3_assert(isinstance(p, BoolRef) and is_const(p), "Boolean expression expected") + Z3_solver_assert_and_track(self.ctx.ref(), self.solver, a.as_ast(), p.as_ast()) + + def check(self, *assumptions): + """Check whether the assertions in the given solver plus the optional assumptions are consistent or not. + + >>> x = Int('x') + >>> s = Solver() + >>> s.check() + sat + >>> s.add(x > 0, x < 2) + >>> s.check() + sat + >>> s.model() + [x = 1] + >>> s.add(x < 1) + >>> s.check() + unsat + >>> s.reset() + >>> s.add(2**x == 4) + >>> s.check() + unknown + """ + assumptions = _get_args(assumptions) + num = len(assumptions) + _assumptions = (Ast * num)() + for i in range(num): + _assumptions[i] = assumptions[i].as_ast() + r = Z3_solver_check_assumptions(self.ctx.ref(), self.solver, num, _assumptions) + return CheckSatResult(r) + + def model(self): + """Return a model for the last `check()`. + + This function raises an exception if + a model is not available (e.g., last `check()` returned unsat). + + >>> s = Solver() + >>> a = Int('a') + >>> s.add(a + 2 == 0) + >>> s.check() + sat + >>> s.model() + [a = -2] + """ + try: + return ModelRef(Z3_solver_get_model(self.ctx.ref(), self.solver), self.ctx) + except Z3Exception: + raise Z3Exception("model is not available") + + def unsat_core(self): + """Return a subset (as an AST vector) of the assumptions provided to the last check(). + + These are the assumptions Z3 used in the unsatisfiability proof. + Assumptions are available in Z3. They are used to extract unsatisfiable cores. + They may be also used to "retract" assumptions. Note that, assumptions are not really + "soft constraints", but they can be used to implement them. + + >>> p1, p2, p3 = Bools('p1 p2 p3') + >>> x, y = Ints('x y') + >>> s = Solver() + >>> s.add(Implies(p1, x > 0)) + >>> s.add(Implies(p2, y > x)) + >>> s.add(Implies(p2, y < 1)) + >>> s.add(Implies(p3, y > -3)) + >>> s.check(p1, p2, p3) + unsat + >>> core = s.unsat_core() + >>> len(core) + 2 + >>> p1 in core + True + >>> p2 in core + True + >>> p3 in core + False + >>> # "Retracting" p2 + >>> s.check(p1, p3) + sat + """ + return AstVector(Z3_solver_get_unsat_core(self.ctx.ref(), self.solver), self.ctx) + + def consequences(self, assumptions, variables): + """Determine fixed values for the variables based on the solver state and assumptions. + >>> s = Solver() + >>> a, b, c, d = Bools('a b c d') + >>> s.add(Implies(a,b), Implies(b, c)) + >>> s.consequences([a],[b,c,d]) + (sat, [Implies(a, b), Implies(a, c)]) + >>> s.consequences([Not(c),d],[a,b,c,d]) + (sat, [Implies(d, d), Implies(Not(c), Not(c)), Implies(Not(c), Not(b)), Implies(Not(c), Not(a))]) + """ + if isinstance(assumptions, list): + _asms = AstVector(None, self.ctx) + for a in assumptions: + _asms.push(a) + assumptions = _asms + if isinstance(variables, list): + _vars = AstVector(None, self.ctx) + for a in variables: + _vars.push(a) + variables = _vars + _z3_assert(isinstance(assumptions, AstVector), "ast vector expected") + _z3_assert(isinstance(variables, AstVector), "ast vector expected") + consequences = AstVector(None, self.ctx) + r = Z3_solver_get_consequences(self.ctx.ref(), self.solver, assumptions.vector, variables.vector, consequences.vector) + sz = len(consequences) + consequences = [ consequences[i] for i in range(sz) ] + return CheckSatResult(r), consequences + + def from_file(self, filename): + """Parse assertions from a file""" + try: + Z3_solver_from_file(self.ctx.ref(), self.solver, filename) + except Z3Exception as e: + _handle_parse_error(e, self.ctx) + + def from_string(self, s): + """Parse assertions from a string""" + try: + Z3_solver_from_string(self.ctx.ref(), self.solver, s) + except Z3Exception as e: + _handle_parse_error(e, self.ctx) + + def proof(self): + """Return a proof for the last `check()`. Proof construction must be enabled.""" + return _to_expr_ref(Z3_solver_get_proof(self.ctx.ref(), self.solver), self.ctx) + + def assertions(self): + """Return an AST vector containing all added constraints. + + >>> s = Solver() + >>> s.assertions() + [] + >>> a = Int('a') + >>> s.add(a > 0) + >>> s.add(a < 10) + >>> s.assertions() + [a > 0, a < 10] + """ + return AstVector(Z3_solver_get_assertions(self.ctx.ref(), self.solver), self.ctx) + + def statistics(self): + """Return statistics for the last `check()`. + + >>> s = SimpleSolver() + >>> x = Int('x') + >>> s.add(x > 0) + >>> s.check() + sat + >>> st = s.statistics() + >>> st.get_key_value('final checks') + 1 + >>> len(st) > 0 + True + >>> st[0] != 0 + True + """ + return Statistics(Z3_solver_get_statistics(self.ctx.ref(), self.solver), self.ctx) + + def reason_unknown(self): + """Return a string describing why the last `check()` returned `unknown`. + + >>> x = Int('x') + >>> s = SimpleSolver() + >>> s.add(2**x == 4) + >>> s.check() + unknown + >>> s.reason_unknown() + '(incomplete (theory arithmetic))' + """ + return Z3_solver_get_reason_unknown(self.ctx.ref(), self.solver) + + def help(self): + """Display a string describing all available options.""" + print(Z3_solver_get_help(self.ctx.ref(), self.solver)) + + def param_descrs(self): + """Return the parameter description set.""" + return ParamDescrsRef(Z3_solver_get_param_descrs(self.ctx.ref(), self.solver), self.ctx) + + def __repr__(self): + """Return a formatted string with all added constraints.""" + return obj_to_string(self) + + def translate(self, target): + """Translate `self` to the context `target`. That is, return a copy of `self` in the context `target`. + + >>> c1 = Context() + >>> c2 = Context() + >>> s1 = Solver(ctx=c1) + >>> s2 = s1.translate(c2) + """ + if __debug__: + _z3_assert(isinstance(target, Context), "argument must be a Z3 context") + solver = Z3_solver_translate(self.ctx.ref(), self.solver, target.ref()) + return Solver(solver, target) + + def sexpr(self): + """Return a formatted string (in Lisp-like format) with all added constraints. We say the string is in s-expression format. + + >>> x = Int('x') + >>> s = Solver() + >>> s.add(x > 0) + >>> s.add(x < 2) + >>> r = s.sexpr() + """ + return Z3_solver_to_string(self.ctx.ref(), self.solver) + + def to_smt2(self): + """return SMTLIB2 formatted benchmark for solver's assertions""" + es = self.assertions() + sz = len(es) + sz1 = sz + if sz1 > 0: + sz1 -= 1 + v = (Ast * sz1)() + for i in range(sz1): + v[i] = es[i].as_ast() + if sz > 0: + e = es[sz1].as_ast() + else: + e = BoolVal(True, self.ctx).as_ast() + return Z3_benchmark_to_smtlib_string(self.ctx.ref(), "benchmark generated from python API", "", "unknown", "", sz1, v, e) + +def SolverFor(logic, ctx=None): + """Create a solver customized for the given logic. + + The parameter `logic` is a string. It should be contains + the name of a SMT-LIB logic. + See http://www.smtlib.org/ for the name of all available logics. + + >>> s = SolverFor("QF_LIA") + >>> x = Int('x') + >>> s.add(x > 0) + >>> s.add(x < 2) + >>> s.check() + sat + >>> s.model() + [x = 1] + """ + ctx = _get_ctx(ctx) + logic = to_symbol(logic) + return Solver(Z3_mk_solver_for_logic(ctx.ref(), logic), ctx) + +def SimpleSolver(ctx=None): + """Return a simple general purpose solver with limited amount of preprocessing. + + >>> s = SimpleSolver() + >>> x = Int('x') + >>> s.add(x > 0) + >>> s.check() + sat + """ + ctx = _get_ctx(ctx) + return Solver(Z3_mk_simple_solver(ctx.ref()), ctx) + +######################################### +# +# Fixedpoint +# +######################################### + +class Fixedpoint(Z3PPObject): + """Fixedpoint API provides methods for solving with recursive predicates""" + + def __init__(self, fixedpoint=None, ctx=None): + assert fixedpoint is None or ctx is not None + self.ctx = _get_ctx(ctx) + self.fixedpoint = None + if fixedpoint is None: + self.fixedpoint = Z3_mk_fixedpoint(self.ctx.ref()) + else: + self.fixedpoint = fixedpoint + Z3_fixedpoint_inc_ref(self.ctx.ref(), self.fixedpoint) + self.vars = [] + + def __deepcopy__(self, memo={}): + return FixedPoint(self.fixedpoint, self.ctx) + + def __del__(self): + if self.fixedpoint is not None and self.ctx.ref() is not None: + Z3_fixedpoint_dec_ref(self.ctx.ref(), self.fixedpoint) + + def set(self, *args, **keys): + """Set a configuration option. The method `help()` return a string containing all available options. + """ + p = args2params(args, keys, self.ctx) + Z3_fixedpoint_set_params(self.ctx.ref(), self.fixedpoint, p.params) + + def help(self): + """Display a string describing all available options.""" + print(Z3_fixedpoint_get_help(self.ctx.ref(), self.fixedpoint)) + + def param_descrs(self): + """Return the parameter description set.""" + return ParamDescrsRef(Z3_fixedpoint_get_param_descrs(self.ctx.ref(), self.fixedpoint), self.ctx) + + def assert_exprs(self, *args): + """Assert constraints as background axioms for the fixedpoint solver.""" + args = _get_args(args) + s = BoolSort(self.ctx) + for arg in args: + if isinstance(arg, Goal) or isinstance(arg, AstVector): + for f in arg: + f = self.abstract(f) + Z3_fixedpoint_assert(self.ctx.ref(), self.fixedpoint, f.as_ast()) + else: + arg = s.cast(arg) + arg = self.abstract(arg) + Z3_fixedpoint_assert(self.ctx.ref(), self.fixedpoint, arg.as_ast()) + + def add(self, *args): + """Assert constraints as background axioms for the fixedpoint solver. Alias for assert_expr.""" + self.assert_exprs(*args) + + def __iadd__(self, fml): + self.add(fml) + return self + + def append(self, *args): + """Assert constraints as background axioms for the fixedpoint solver. Alias for assert_expr.""" + self.assert_exprs(*args) + + def insert(self, *args): + """Assert constraints as background axioms for the fixedpoint solver. Alias for assert_expr.""" + self.assert_exprs(*args) + + def add_rule(self, head, body = None, name = None): + """Assert rules defining recursive predicates to the fixedpoint solver. + >>> a = Bool('a') + >>> b = Bool('b') + >>> s = Fixedpoint() + >>> s.register_relation(a.decl()) + >>> s.register_relation(b.decl()) + >>> s.fact(a) + >>> s.rule(b, a) + >>> s.query(b) + sat + """ + if name is None: + name = "" + name = to_symbol(name, self.ctx) + if body is None: + head = self.abstract(head) + Z3_fixedpoint_add_rule(self.ctx.ref(), self.fixedpoint, head.as_ast(), name) + else: + body = _get_args(body) + f = self.abstract(Implies(And(body, self.ctx),head)) + Z3_fixedpoint_add_rule(self.ctx.ref(), self.fixedpoint, f.as_ast(), name) + + def rule(self, head, body = None, name = None): + """Assert rules defining recursive predicates to the fixedpoint solver. Alias for add_rule.""" + self.add_rule(head, body, name) + + def fact(self, head, name = None): + """Assert facts defining recursive predicates to the fixedpoint solver. Alias for add_rule.""" + self.add_rule(head, None, name) + + def query(self, *query): + """Query the fixedpoint engine whether formula is derivable. + You can also pass an tuple or list of recursive predicates. + """ + query = _get_args(query) + sz = len(query) + if sz >= 1 and isinstance(query[0], FuncDeclRef): + _decls = (FuncDecl * sz)() + i = 0 + for q in query: + _decls[i] = q.ast + i = i + 1 + r = Z3_fixedpoint_query_relations(self.ctx.ref(), self.fixedpoint, sz, _decls) + else: + if sz == 1: + query = query[0] + else: + query = And(query, self.ctx) + query = self.abstract(query, False) + r = Z3_fixedpoint_query(self.ctx.ref(), self.fixedpoint, query.as_ast()) + return CheckSatResult(r) + + def query_from_lvl (self, lvl, *query): + """Query the fixedpoint engine whether formula is derivable starting at the given query level. + """ + query = _get_args(query) + sz = len(query) + if sz >= 1 and isinstance(query[0], FuncDecl): + _z3_assert (False, "unsupported") + else: + if sz == 1: + query = query[0] + else: + query = And(query) + query = self.abstract(query, False) + r = Z3_fixedpoint_query_from_lvl (self.ctx.ref(), self.fixedpoint, query.as_ast(), lvl) + return CheckSatResult(r) + + def push(self): + """create a backtracking point for added rules, facts and assertions""" + Z3_fixedpoint_push(self.ctx.ref(), self.fixedpoint) + + def pop(self): + """restore to previously created backtracking point""" + Z3_fixedpoint_pop(self.ctx.ref(), self.fixedpoint) + + def update_rule(self, head, body, name): + """update rule""" + if name is None: + name = "" + name = to_symbol(name, self.ctx) + body = _get_args(body) + f = self.abstract(Implies(And(body, self.ctx),head)) + Z3_fixedpoint_update_rule(self.ctx.ref(), self.fixedpoint, f.as_ast(), name) + + def get_answer(self): + """Retrieve answer from last query call.""" + r = Z3_fixedpoint_get_answer(self.ctx.ref(), self.fixedpoint) + return _to_expr_ref(r, self.ctx) + + def get_ground_sat_answer(self): + """Retrieve a ground cex from last query call.""" + r = Z3_fixedpoint_get_ground_sat_answer(self.ctx.ref(), self.fixedpoint) + return _to_expr_ref(r, self.ctx) + + def get_rules_along_trace(self): + """retrieve rules along the counterexample trace""" + return AstVector(Z3_fixedpoint_get_rules_along_trace(self.ctx.ref(), self.fixedpoint), self.ctx) + + def get_rule_names_along_trace(self): + """retrieve rule names along the counterexample trace""" + # this is a hack as I don't know how to return a list of symbols from C++; + # obtain names as a single string separated by semicolons + names = _symbol2py (self.ctx, Z3_fixedpoint_get_rule_names_along_trace(self.ctx.ref(), self.fixedpoint)) + # split into individual names + return names.split (';') + + def get_num_levels(self, predicate): + """Retrieve number of levels used for predicate in PDR engine""" + return Z3_fixedpoint_get_num_levels(self.ctx.ref(), self.fixedpoint, predicate.ast) + + def get_cover_delta(self, level, predicate): + """Retrieve properties known about predicate for the level'th unfolding. -1 is treated as the limit (infinity)""" + r = Z3_fixedpoint_get_cover_delta(self.ctx.ref(), self.fixedpoint, level, predicate.ast) + return _to_expr_ref(r, self.ctx) + + def add_cover(self, level, predicate, property): + """Add property to predicate for the level'th unfolding. -1 is treated as infinity (infinity)""" + Z3_fixedpoint_add_cover(self.ctx.ref(), self.fixedpoint, level, predicate.ast, property.ast) + + def register_relation(self, *relations): + """Register relation as recursive""" + relations = _get_args(relations) + for f in relations: + Z3_fixedpoint_register_relation(self.ctx.ref(), self.fixedpoint, f.ast) + + def set_predicate_representation(self, f, *representations): + """Control how relation is represented""" + representations = _get_args(representations) + representations = [to_symbol(s) for s in representations] + sz = len(representations) + args = (Symbol * sz)() + for i in range(sz): + args[i] = representations[i] + Z3_fixedpoint_set_predicate_representation(self.ctx.ref(), self.fixedpoint, f.ast, sz, args) + + def parse_string(self, s): + """Parse rules and queries from a string""" + try: + return AstVector(Z3_fixedpoint_from_string(self.ctx.ref(), self.fixedpoint, s), self.ctx) + except Z3Exception as e: + _handle_parse_error(e, self.ctx) + + def parse_file(self, f): + """Parse rules and queries from a file""" + try: + return AstVector(Z3_fixedpoint_from_file(self.ctx.ref(), self.fixedpoint, f), self.ctx) + except Z3Exception as e: + _handle_parse_error(e, self.ctx) + + def get_rules(self): + """retrieve rules that have been added to fixedpoint context""" + return AstVector(Z3_fixedpoint_get_rules(self.ctx.ref(), self.fixedpoint), self.ctx) + + def get_assertions(self): + """retrieve assertions that have been added to fixedpoint context""" + return AstVector(Z3_fixedpoint_get_assertions(self.ctx.ref(), self.fixedpoint), self.ctx) + + def __repr__(self): + """Return a formatted string with all added rules and constraints.""" + return self.sexpr() + + def sexpr(self): + """Return a formatted string (in Lisp-like format) with all added constraints. We say the string is in s-expression format. + """ + return Z3_fixedpoint_to_string(self.ctx.ref(), self.fixedpoint, 0, (Ast * 0)()) + + def to_string(self, queries): + """Return a formatted string (in Lisp-like format) with all added constraints. + We say the string is in s-expression format. + Include also queries. + """ + args, len = _to_ast_array(queries) + return Z3_fixedpoint_to_string(self.ctx.ref(), self.fixedpoint, len, args) + + def statistics(self): + """Return statistics for the last `query()`. + """ + return Statistics(Z3_fixedpoint_get_statistics(self.ctx.ref(), self.fixedpoint), self.ctx) + + def reason_unknown(self): + """Return a string describing why the last `query()` returned `unknown`. + """ + return Z3_fixedpoint_get_reason_unknown(self.ctx.ref(), self.fixedpoint) + + def declare_var(self, *vars): + """Add variable or several variables. + The added variable or variables will be bound in the rules + and queries + """ + vars = _get_args(vars) + for v in vars: + self.vars += [v] + + def abstract(self, fml, is_forall=True): + if self.vars == []: + return fml + if is_forall: + return ForAll(self.vars, fml) + else: + return Exists(self.vars, fml) + + +######################################### +# +# Finite domains +# +######################################### + +class FiniteDomainSortRef(SortRef): + """Finite domain sort.""" + + def size(self): + """Return the size of the finite domain sort""" + r = (ctype.c_ulonglong * 1)() + if Z3_get_finite_domain_sort_size(self.ctx_ref(), self.ast(), r): + return r[0] + else: + raise Z3Exception("Failed to retrieve finite domain sort size") + +def FiniteDomainSort(name, sz, ctx=None): + """Create a named finite domain sort of a given size sz""" + if not isinstance(name, Symbol): + name = to_symbol(name) + ctx = _get_ctx(ctx) + return FiniteDomainSortRef(Z3_mk_finite_domain_sort(ctx.ref(), name, sz), ctx) + +def is_finite_domain_sort(s): + """Return True if `s` is a Z3 finite-domain sort. + + >>> is_finite_domain_sort(FiniteDomainSort('S', 100)) + True + >>> is_finite_domain_sort(IntSort()) + False + """ + return isinstance(s, FiniteDomainSortRef) + + +class FiniteDomainRef(ExprRef): + """Finite-domain expressions.""" + + def sort(self): + """Return the sort of the finite-domain expression `self`.""" + return FiniteDomainSortRef(Z3_get_sort(self.ctx_ref(), self.as_ast()), self.ctx) + + def as_string(self): + """Return a Z3 floating point expression as a Python string.""" + return Z3_ast_to_string(self.ctx_ref(), self.as_ast()) + +def is_finite_domain(a): + """Return `True` if `a` is a Z3 finite-domain expression. + + >>> s = FiniteDomainSort('S', 100) + >>> b = Const('b', s) + >>> is_finite_domain(b) + True + >>> is_finite_domain(Int('x')) + False + """ + return isinstance(a, FiniteDomainRef) + + +class FiniteDomainNumRef(FiniteDomainRef): + """Integer values.""" + + def as_long(self): + """Return a Z3 finite-domain numeral as a Python long (bignum) numeral. + + >>> s = FiniteDomainSort('S', 100) + >>> v = FiniteDomainVal(3, s) + >>> v + 3 + >>> v.as_long() + 1 + 4 + """ + return int(self.as_string()) + + def as_string(self): + """Return a Z3 finite-domain numeral as a Python string. + + >>> s = FiniteDomainSort('S', 100) + >>> v = FiniteDomainVal(42, s) + >>> v.as_string() + '42' + """ + return Z3_get_numeral_string(self.ctx_ref(), self.as_ast()) + + +def FiniteDomainVal(val, sort, ctx=None): + """Return a Z3 finite-domain value. If `ctx=None`, then the global context is used. + + >>> s = FiniteDomainSort('S', 256) + >>> FiniteDomainVal(255, s) + 255 + >>> FiniteDomainVal('100', s) + 100 + """ + if __debug__: + _z3_assert(is_finite_domain_sort(sort), "Expected finite-domain sort" ) + ctx = sort.ctx + return FiniteDomainNumRef(Z3_mk_numeral(ctx.ref(), _to_int_str(val), sort.ast), ctx) + +def is_finite_domain_value(a): + """Return `True` if `a` is a Z3 finite-domain value. + + >>> s = FiniteDomainSort('S', 100) + >>> b = Const('b', s) + >>> is_finite_domain_value(b) + False + >>> b = FiniteDomainVal(10, s) + >>> b + 10 + >>> is_finite_domain_value(b) + True + """ + return is_finite_domain(a) and _is_numeral(a.ctx, a.as_ast()) + + +######################################### +# +# Optimize +# +######################################### + +class OptimizeObjective: + def __init__(self, opt, value, is_max): + self._opt = opt + self._value = value + self._is_max = is_max + + def lower(self): + opt = self._opt + return _to_expr_ref(Z3_optimize_get_lower(opt.ctx.ref(), opt.optimize, self._value), opt.ctx) + + def upper(self): + opt = self._opt + return _to_expr_ref(Z3_optimize_get_upper(opt.ctx.ref(), opt.optimize, self._value), opt.ctx) + + def lower_values(self): + opt = self._opt + return AstVector(Z3_optimize_get_lower_as_vector(opt.ctx.ref(), opt.optimize, self._value), opt.ctx) + + def upper_values(self): + opt = self._opt + return AstVector(Z3_optimize_get_upper_as_vector(opt.ctx.ref(), opt.optimize, self._value), opt.ctx) + + def value(self): + if self._is_max: + return self.upper() + else: + return self.lower() + + def __str__(self): + return "%s:%s" % (self._value, self._is_max) + + +class Optimize(Z3PPObject): + """Optimize API provides methods for solving using objective functions and weighted soft constraints""" + + def __init__(self, ctx=None): + self.ctx = _get_ctx(ctx) + self.optimize = Z3_mk_optimize(self.ctx.ref()) + Z3_optimize_inc_ref(self.ctx.ref(), self.optimize) + + def __deepcopy__(self, memo={}): + return Optimize(self.optimize, self.ctx) + + def __del__(self): + if self.optimize is not None and self.ctx.ref() is not None: + Z3_optimize_dec_ref(self.ctx.ref(), self.optimize) + + def set(self, *args, **keys): + """Set a configuration option. The method `help()` return a string containing all available options. + """ + p = args2params(args, keys, self.ctx) + Z3_optimize_set_params(self.ctx.ref(), self.optimize, p.params) + + def help(self): + """Display a string describing all available options.""" + print(Z3_optimize_get_help(self.ctx.ref(), self.optimize)) + + def param_descrs(self): + """Return the parameter description set.""" + return ParamDescrsRef(Z3_optimize_get_param_descrs(self.ctx.ref(), self.optimize), self.ctx) + + def assert_exprs(self, *args): + """Assert constraints as background axioms for the optimize solver.""" + args = _get_args(args) + for arg in args: + if isinstance(arg, Goal) or isinstance(arg, AstVector): + for f in arg: + Z3_optimize_assert(self.ctx.ref(), self.optimize, f.as_ast()) + else: + Z3_optimize_assert(self.ctx.ref(), self.optimize, arg.as_ast()) + + def add(self, *args): + """Assert constraints as background axioms for the optimize solver. Alias for assert_expr.""" + self.assert_exprs(*args) + + def __iadd__(self, fml): + self.add(fml) + return self + + def add_soft(self, arg, weight = "1", id = None): + """Add soft constraint with optional weight and optional identifier. + If no weight is supplied, then the penalty for violating the soft constraint + is 1. + Soft constraints are grouped by identifiers. Soft constraints that are + added without identifiers are grouped by default. + """ + if _is_int(weight): + weight = "%d" % weight + elif isinstance(weight, float): + weight = "%f" % weight + if not isinstance(weight, str): + raise Z3Exception("weight should be a string or an integer") + if id is None: + id = "" + id = to_symbol(id, self.ctx) + v = Z3_optimize_assert_soft(self.ctx.ref(), self.optimize, arg.as_ast(), weight, id) + return OptimizeObjective(self, v, False) + + def maximize(self, arg): + """Add objective function to maximize.""" + return OptimizeObjective(self, Z3_optimize_maximize(self.ctx.ref(), self.optimize, arg.as_ast()), True) + + def minimize(self, arg): + """Add objective function to minimize.""" + return OptimizeObjective(self, Z3_optimize_minimize(self.ctx.ref(), self.optimize, arg.as_ast()), False) + + def push(self): + """create a backtracking point for added rules, facts and assertions""" + Z3_optimize_push(self.ctx.ref(), self.optimize) + + def pop(self): + """restore to previously created backtracking point""" + Z3_optimize_pop(self.ctx.ref(), self.optimize) + + def check(self): + """Check satisfiability while optimizing objective functions.""" + return CheckSatResult(Z3_optimize_check(self.ctx.ref(), self.optimize)) + + def reason_unknown(self): + """Return a string that describes why the last `check()` returned `unknown`.""" + return Z3_optimize_get_reason_unknown(self.ctx.ref(), self.optimize) + + def model(self): + """Return a model for the last check().""" + try: + return ModelRef(Z3_optimize_get_model(self.ctx.ref(), self.optimize), self.ctx) + except Z3Exception: + raise Z3Exception("model is not available") + + def lower(self, obj): + if not isinstance(obj, OptimizeObjective): + raise Z3Exception("Expecting objective handle returned by maximize/minimize") + return obj.lower() + + def upper(self, obj): + if not isinstance(obj, OptimizeObjective): + raise Z3Exception("Expecting objective handle returned by maximize/minimize") + return obj.upper() + + def lower_values(self, obj): + if not isinstance(obj, OptimizeObjective): + raise Z3Exception("Expecting objective handle returned by maximize/minimize") + return obj.lower_values() + + def upper_values(self, obj): + if not isinstance(obj, OptimizeObjective): + raise Z3Exception("Expecting objective handle returned by maximize/minimize") + return obj.upper_values() + + def from_file(self, filename): + """Parse assertions and objectives from a file""" + try: + Z3_optimize_from_file(self.ctx.ref(), self.optimize, filename) + except Z3Exception as e: + _handle_parse_error(e, self.ctx) + + def from_string(self, s): + """Parse assertions and objectives from a string""" + try: + Z3_optimize_from_string(self.ctx.ref(), self.optimize, s) + except Z3Exception as e: + _handle_parse_error(e, self.ctx) + + def assertions(self): + """Return an AST vector containing all added constraints.""" + return AstVector(Z3_optimize_get_assertions(self.ctx.ref(), self.optimize), self.ctx) + + def objectives(self): + """returns set of objective functions""" + return AstVector(Z3_optimize_get_objectives(self.ctx.ref(), self.optimize), self.ctx) + + def __repr__(self): + """Return a formatted string with all added rules and constraints.""" + return self.sexpr() + + def sexpr(self): + """Return a formatted string (in Lisp-like format) with all added constraints. We say the string is in s-expression format. + """ + return Z3_optimize_to_string(self.ctx.ref(), self.optimize) + + def statistics(self): + """Return statistics for the last check`. + """ + return Statistics(Z3_optimize_get_statistics(self.ctx.ref(), self.optimize), self.ctx) + + + + +######################################### +# +# ApplyResult +# +######################################### +class ApplyResult(Z3PPObject): + """An ApplyResult object contains the subgoals produced by a tactic when applied to a goal. It also contains model and proof converters.""" + + def __init__(self, result, ctx): + self.result = result + self.ctx = ctx + Z3_apply_result_inc_ref(self.ctx.ref(), self.result) + + def __deepcopy__(self, memo={}): + return ApplyResult(self.result, self.ctx) + + def __del__(self): + if self.ctx.ref() is not None: + Z3_apply_result_dec_ref(self.ctx.ref(), self.result) + + def __len__(self): + """Return the number of subgoals in `self`. + + >>> a, b = Ints('a b') + >>> g = Goal() + >>> g.add(Or(a == 0, a == 1), Or(b == 0, b == 1), a > b) + >>> t = Tactic('split-clause') + >>> r = t(g) + >>> len(r) + 2 + >>> t = Then(Tactic('split-clause'), Tactic('split-clause')) + >>> len(t(g)) + 4 + >>> t = Then(Tactic('split-clause'), Tactic('split-clause'), Tactic('propagate-values')) + >>> len(t(g)) + 1 + """ + return int(Z3_apply_result_get_num_subgoals(self.ctx.ref(), self.result)) + + def __getitem__(self, idx): + """Return one of the subgoals stored in ApplyResult object `self`. + + >>> a, b = Ints('a b') + >>> g = Goal() + >>> g.add(Or(a == 0, a == 1), Or(b == 0, b == 1), a > b) + >>> t = Tactic('split-clause') + >>> r = t(g) + >>> r[0] + [a == 0, Or(b == 0, b == 1), a > b] + >>> r[1] + [a == 1, Or(b == 0, b == 1), a > b] + """ + if idx >= len(self): + raise IndexError + return Goal(goal=Z3_apply_result_get_subgoal(self.ctx.ref(), self.result, idx), ctx=self.ctx) + + def __repr__(self): + return obj_to_string(self) + + def sexpr(self): + """Return a textual representation of the s-expression representing the set of subgoals in `self`.""" + return Z3_apply_result_to_string(self.ctx.ref(), self.result) + + def convert_model(self, model, idx=0): + """Convert a model for a subgoal into a model for the original goal. + + >>> a, b = Ints('a b') + >>> g = Goal() + >>> g.add(Or(a == 0, a == 1), Or(b == 0, b == 1), a > b) + >>> t = Then(Tactic('split-clause'), Tactic('solve-eqs')) + >>> r = t(g) + >>> r[0] + [Or(b == 0, b == 1), Not(0 <= b)] + >>> r[1] + [Or(b == 0, b == 1), Not(1 <= b)] + >>> # Remark: the subgoal r[0] is unsatisfiable + >>> # Creating a solver for solving the second subgoal + >>> s = Solver() + >>> s.add(r[1]) + >>> s.check() + sat + >>> s.model() + [b = 0] + >>> # Model s.model() does not assign a value to `a` + >>> # It is a model for subgoal `r[1]`, but not for goal `g` + >>> # The method convert_model creates a model for `g` from a model for `r[1]`. + >>> r.convert_model(s.model(), 1) + [b = 0, a = 1] + """ + if __debug__: + _z3_assert(idx < len(self), "index out of bounds") + _z3_assert(isinstance(model, ModelRef), "Z3 Model expected") + return ModelRef(Z3_apply_result_convert_model(self.ctx.ref(), self.result, idx, model.model), self.ctx) + + def as_expr(self): + """Return a Z3 expression consisting of all subgoals. + + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 1) + >>> g.add(Or(x == 2, x == 3)) + >>> r = Tactic('simplify')(g) + >>> r + [[Not(x <= 1), Or(x == 2, x == 3)]] + >>> r.as_expr() + And(Not(x <= 1), Or(x == 2, x == 3)) + >>> r = Tactic('split-clause')(g) + >>> r + [[x > 1, x == 2], [x > 1, x == 3]] + >>> r.as_expr() + Or(And(x > 1, x == 2), And(x > 1, x == 3)) + """ + sz = len(self) + if sz == 0: + return BoolVal(False, self.ctx) + elif sz == 1: + return self[0].as_expr() + else: + return Or([ self[i].as_expr() for i in range(len(self)) ]) + +######################################### +# +# Tactics +# +######################################### +class Tactic: + """Tactics transform, solver and/or simplify sets of constraints (Goal). A Tactic can be converted into a Solver using the method solver(). + + Several combinators are available for creating new tactics using the built-in ones: Then(), OrElse(), FailIf(), Repeat(), When(), Cond(). + """ + def __init__(self, tactic, ctx=None): + self.ctx = _get_ctx(ctx) + self.tactic = None + if isinstance(tactic, TacticObj): + self.tactic = tactic + else: + if __debug__: + _z3_assert(isinstance(tactic, str), "tactic name expected") + try: + self.tactic = Z3_mk_tactic(self.ctx.ref(), str(tactic)) + except Z3Exception: + raise Z3Exception("unknown tactic '%s'" % tactic) + Z3_tactic_inc_ref(self.ctx.ref(), self.tactic) + + def __deepcopy__(self, memo={}): + return Tactic(self.tactic, self.ctx) + + def __del__(self): + if self.tactic is not None and self.ctx.ref() is not None: + Z3_tactic_dec_ref(self.ctx.ref(), self.tactic) + + def solver(self): + """Create a solver using the tactic `self`. + + The solver supports the methods `push()` and `pop()`, but it + will always solve each `check()` from scratch. + + >>> t = Then('simplify', 'nlsat') + >>> s = t.solver() + >>> x = Real('x') + >>> s.add(x**2 == 2, x > 0) + >>> s.check() + sat + >>> s.model() + [x = 1.4142135623?] + """ + return Solver(Z3_mk_solver_from_tactic(self.ctx.ref(), self.tactic), self.ctx) + + def apply(self, goal, *arguments, **keywords): + """Apply tactic `self` to the given goal or Z3 Boolean expression using the given options. + + >>> x, y = Ints('x y') + >>> t = Tactic('solve-eqs') + >>> t.apply(And(x == 0, y >= x + 1)) + [[y >= 1]] + """ + if __debug__: + _z3_assert(isinstance(goal, Goal) or isinstance(goal, BoolRef), "Z3 Goal or Boolean expressions expected") + goal = _to_goal(goal) + if len(arguments) > 0 or len(keywords) > 0: + p = args2params(arguments, keywords, self.ctx) + return ApplyResult(Z3_tactic_apply_ex(self.ctx.ref(), self.tactic, goal.goal, p.params), self.ctx) + else: + return ApplyResult(Z3_tactic_apply(self.ctx.ref(), self.tactic, goal.goal), self.ctx) + + def __call__(self, goal, *arguments, **keywords): + """Apply tactic `self` to the given goal or Z3 Boolean expression using the given options. + + >>> x, y = Ints('x y') + >>> t = Tactic('solve-eqs') + >>> t(And(x == 0, y >= x + 1)) + [[y >= 1]] + """ + return self.apply(goal, *arguments, **keywords) + + def help(self): + """Display a string containing a description of the available options for the `self` tactic.""" + print(Z3_tactic_get_help(self.ctx.ref(), self.tactic)) + + def param_descrs(self): + """Return the parameter description set.""" + return ParamDescrsRef(Z3_tactic_get_param_descrs(self.ctx.ref(), self.tactic), self.ctx) + +def _to_goal(a): + if isinstance(a, BoolRef): + goal = Goal(ctx = a.ctx) + goal.add(a) + return goal + else: + return a + +def _to_tactic(t, ctx=None): + if isinstance(t, Tactic): + return t + else: + return Tactic(t, ctx) + +def _and_then(t1, t2, ctx=None): + t1 = _to_tactic(t1, ctx) + t2 = _to_tactic(t2, ctx) + if __debug__: + _z3_assert(t1.ctx == t2.ctx, "Context mismatch") + return Tactic(Z3_tactic_and_then(t1.ctx.ref(), t1.tactic, t2.tactic), t1.ctx) + +def _or_else(t1, t2, ctx=None): + t1 = _to_tactic(t1, ctx) + t2 = _to_tactic(t2, ctx) + if __debug__: + _z3_assert(t1.ctx == t2.ctx, "Context mismatch") + return Tactic(Z3_tactic_or_else(t1.ctx.ref(), t1.tactic, t2.tactic), t1.ctx) + +def AndThen(*ts, **ks): + """Return a tactic that applies the tactics in `*ts` in sequence. + + >>> x, y = Ints('x y') + >>> t = AndThen(Tactic('simplify'), Tactic('solve-eqs')) + >>> t(And(x == 0, y > x + 1)) + [[Not(y <= 1)]] + >>> t(And(x == 0, y > x + 1)).as_expr() + Not(y <= 1) + """ + if __debug__: + _z3_assert(len(ts) >= 2, "At least two arguments expected") + ctx = ks.get('ctx', None) + num = len(ts) + r = ts[0] + for i in range(num - 1): + r = _and_then(r, ts[i+1], ctx) + return r + +def Then(*ts, **ks): + """Return a tactic that applies the tactics in `*ts` in sequence. Shorthand for AndThen(*ts, **ks). + + >>> x, y = Ints('x y') + >>> t = Then(Tactic('simplify'), Tactic('solve-eqs')) + >>> t(And(x == 0, y > x + 1)) + [[Not(y <= 1)]] + >>> t(And(x == 0, y > x + 1)).as_expr() + Not(y <= 1) + """ + return AndThen(*ts, **ks) + +def OrElse(*ts, **ks): + """Return a tactic that applies the tactics in `*ts` until one of them succeeds (it doesn't fail). + + >>> x = Int('x') + >>> t = OrElse(Tactic('split-clause'), Tactic('skip')) + >>> # Tactic split-clause fails if there is no clause in the given goal. + >>> t(x == 0) + [[x == 0]] + >>> t(Or(x == 0, x == 1)) + [[x == 0], [x == 1]] + """ + if __debug__: + _z3_assert(len(ts) >= 2, "At least two arguments expected") + ctx = ks.get('ctx', None) + num = len(ts) + r = ts[0] + for i in range(num - 1): + r = _or_else(r, ts[i+1], ctx) + return r + +def ParOr(*ts, **ks): + """Return a tactic that applies the tactics in `*ts` in parallel until one of them succeeds (it doesn't fail). + + >>> x = Int('x') + >>> t = ParOr(Tactic('simplify'), Tactic('fail')) + >>> t(x + 1 == 2) + [[x == 1]] + """ + if __debug__: + _z3_assert(len(ts) >= 2, "At least two arguments expected") + ctx = _get_ctx(ks.get('ctx', None)) + ts = [ _to_tactic(t, ctx) for t in ts ] + sz = len(ts) + _args = (TacticObj * sz)() + for i in range(sz): + _args[i] = ts[i].tactic + return Tactic(Z3_tactic_par_or(ctx.ref(), sz, _args), ctx) + +def ParThen(t1, t2, ctx=None): + """Return a tactic that applies t1 and then t2 to every subgoal produced by t1. The subgoals are processed in parallel. + + >>> x, y = Ints('x y') + >>> t = ParThen(Tactic('split-clause'), Tactic('propagate-values')) + >>> t(And(Or(x == 1, x == 2), y == x + 1)) + [[x == 1, y == 2], [x == 2, y == 3]] + """ + t1 = _to_tactic(t1, ctx) + t2 = _to_tactic(t2, ctx) + if __debug__: + _z3_assert(t1.ctx == t2.ctx, "Context mismatch") + return Tactic(Z3_tactic_par_and_then(t1.ctx.ref(), t1.tactic, t2.tactic), t1.ctx) + +def ParAndThen(t1, t2, ctx=None): + """Alias for ParThen(t1, t2, ctx).""" + return ParThen(t1, t2, ctx) + +def With(t, *args, **keys): + """Return a tactic that applies tactic `t` using the given configuration options. + + >>> x, y = Ints('x y') + >>> t = With(Tactic('simplify'), som=True) + >>> t((x + 1)*(y + 2) == 0) + [[2*x + y + x*y == -2]] + """ + ctx = keys.pop('ctx', None) + t = _to_tactic(t, ctx) + p = args2params(args, keys, t.ctx) + return Tactic(Z3_tactic_using_params(t.ctx.ref(), t.tactic, p.params), t.ctx) + +def Repeat(t, max=4294967295, ctx=None): + """Return a tactic that keeps applying `t` until the goal is not modified anymore or the maximum number of iterations `max` is reached. + + >>> x, y = Ints('x y') + >>> c = And(Or(x == 0, x == 1), Or(y == 0, y == 1), x > y) + >>> t = Repeat(OrElse(Tactic('split-clause'), Tactic('skip'))) + >>> r = t(c) + >>> for subgoal in r: print(subgoal) + [x == 0, y == 0, x > y] + [x == 0, y == 1, x > y] + [x == 1, y == 0, x > y] + [x == 1, y == 1, x > y] + >>> t = Then(t, Tactic('propagate-values')) + >>> t(c) + [[x == 1, y == 0]] + """ + t = _to_tactic(t, ctx) + return Tactic(Z3_tactic_repeat(t.ctx.ref(), t.tactic, max), t.ctx) + +def TryFor(t, ms, ctx=None): + """Return a tactic that applies `t` to a given goal for `ms` milliseconds. + + If `t` does not terminate in `ms` milliseconds, then it fails. + """ + t = _to_tactic(t, ctx) + return Tactic(Z3_tactic_try_for(t.ctx.ref(), t.tactic, ms), t.ctx) + +def tactics(ctx=None): + """Return a list of all available tactics in Z3. + + >>> l = tactics() + >>> l.count('simplify') == 1 + True + """ + ctx = _get_ctx(ctx) + return [ Z3_get_tactic_name(ctx.ref(), i) for i in range(Z3_get_num_tactics(ctx.ref())) ] + +def tactic_description(name, ctx=None): + """Return a short description for the tactic named `name`. + + >>> d = tactic_description('simplify') + """ + ctx = _get_ctx(ctx) + return Z3_tactic_get_descr(ctx.ref(), name) + +def describe_tactics(): + """Display a (tabular) description of all available tactics in Z3.""" + if in_html_mode(): + even = True + print('<table border="1" cellpadding="2" cellspacing="0">') + for t in tactics(): + if even: + print('<tr style="background-color:#CFCFCF">') + even = False + else: + print('<tr>') + even = True + print('<td>%s</td><td>%s</td></tr>' % (t, insert_line_breaks(tactic_description(t), 40))) + print('</table>') + else: + for t in tactics(): + print('%s : %s' % (t, tactic_description(t))) + +class Probe: + """Probes are used to inspect a goal (aka problem) and collect information that may be used to decide which solver and/or preprocessing step will be used.""" + def __init__(self, probe, ctx=None): + self.ctx = _get_ctx(ctx) + self.probe = None + if isinstance(probe, ProbeObj): + self.probe = probe + elif isinstance(probe, float): + self.probe = Z3_probe_const(self.ctx.ref(), probe) + elif _is_int(probe): + self.probe = Z3_probe_const(self.ctx.ref(), float(probe)) + elif isinstance(probe, bool): + if probe: + self.probe = Z3_probe_const(self.ctx.ref(), 1.0) + else: + self.probe = Z3_probe_const(self.ctx.ref(), 0.0) + else: + if __debug__: + _z3_assert(isinstance(probe, str), "probe name expected") + try: + self.probe = Z3_mk_probe(self.ctx.ref(), probe) + except Z3Exception: + raise Z3Exception("unknown probe '%s'" % probe) + Z3_probe_inc_ref(self.ctx.ref(), self.probe) + + def __deepcopy__(self, memo={}): + return Probe(self.probe, self.ctx) + + def __del__(self): + if self.probe is not None and self.ctx.ref() is not None: + Z3_probe_dec_ref(self.ctx.ref(), self.probe) + + def __lt__(self, other): + """Return a probe that evaluates to "true" when the value returned by `self` is less than the value returned by `other`. + + >>> p = Probe('size') < 10 + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 0) + >>> g.add(x < 10) + >>> p(g) + 1.0 + """ + return Probe(Z3_probe_lt(self.ctx.ref(), self.probe, _to_probe(other, self.ctx).probe), self.ctx) + + def __gt__(self, other): + """Return a probe that evaluates to "true" when the value returned by `self` is greater than the value returned by `other`. + + >>> p = Probe('size') > 10 + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 0) + >>> g.add(x < 10) + >>> p(g) + 0.0 + """ + return Probe(Z3_probe_gt(self.ctx.ref(), self.probe, _to_probe(other, self.ctx).probe), self.ctx) + + def __le__(self, other): + """Return a probe that evaluates to "true" when the value returned by `self` is less than or equal to the value returned by `other`. + + >>> p = Probe('size') <= 2 + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 0) + >>> g.add(x < 10) + >>> p(g) + 1.0 + """ + return Probe(Z3_probe_le(self.ctx.ref(), self.probe, _to_probe(other, self.ctx).probe), self.ctx) + + def __ge__(self, other): + """Return a probe that evaluates to "true" when the value returned by `self` is greater than or equal to the value returned by `other`. + + >>> p = Probe('size') >= 2 + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 0) + >>> g.add(x < 10) + >>> p(g) + 1.0 + """ + return Probe(Z3_probe_ge(self.ctx.ref(), self.probe, _to_probe(other, self.ctx).probe), self.ctx) + + def __eq__(self, other): + """Return a probe that evaluates to "true" when the value returned by `self` is equal to the value returned by `other`. + + >>> p = Probe('size') == 2 + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 0) + >>> g.add(x < 10) + >>> p(g) + 1.0 + """ + return Probe(Z3_probe_eq(self.ctx.ref(), self.probe, _to_probe(other, self.ctx).probe), self.ctx) + + def __ne__(self, other): + """Return a probe that evaluates to "true" when the value returned by `self` is not equal to the value returned by `other`. + + >>> p = Probe('size') != 2 + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 0) + >>> g.add(x < 10) + >>> p(g) + 0.0 + """ + p = self.__eq__(other) + return Probe(Z3_probe_not(self.ctx.ref(), p.probe), self.ctx) + + def __call__(self, goal): + """Evaluate the probe `self` in the given goal. + + >>> p = Probe('size') + >>> x = Int('x') + >>> g = Goal() + >>> g.add(x > 0) + >>> g.add(x < 10) + >>> p(g) + 2.0 + >>> g.add(x < 20) + >>> p(g) + 3.0 + >>> p = Probe('num-consts') + >>> p(g) + 1.0 + >>> p = Probe('is-propositional') + >>> p(g) + 0.0 + >>> p = Probe('is-qflia') + >>> p(g) + 1.0 + """ + if __debug__: + _z3_assert(isinstance(goal, Goal) or isinstance(goal, BoolRef), "Z3 Goal or Boolean expression expected") + goal = _to_goal(goal) + return Z3_probe_apply(self.ctx.ref(), self.probe, goal.goal) + +def is_probe(p): + """Return `True` if `p` is a Z3 probe. + + >>> is_probe(Int('x')) + False + >>> is_probe(Probe('memory')) + True + """ + return isinstance(p, Probe) + +def _to_probe(p, ctx=None): + if is_probe(p): + return p + else: + return Probe(p, ctx) + +def probes(ctx=None): + """Return a list of all available probes in Z3. + + >>> l = probes() + >>> l.count('memory') == 1 + True + """ + ctx = _get_ctx(ctx) + return [ Z3_get_probe_name(ctx.ref(), i) for i in range(Z3_get_num_probes(ctx.ref())) ] + +def probe_description(name, ctx=None): + """Return a short description for the probe named `name`. + + >>> d = probe_description('memory') + """ + ctx = _get_ctx(ctx) + return Z3_probe_get_descr(ctx.ref(), name) + +def describe_probes(): + """Display a (tabular) description of all available probes in Z3.""" + if in_html_mode(): + even = True + print('<table border="1" cellpadding="2" cellspacing="0">') + for p in probes(): + if even: + print('<tr style="background-color:#CFCFCF">') + even = False + else: + print('<tr>') + even = True + print('<td>%s</td><td>%s</td></tr>' % (p, insert_line_breaks(probe_description(p), 40))) + print('</table>') + else: + for p in probes(): + print('%s : %s' % (p, probe_description(p))) + +def _probe_nary(f, args, ctx): + if __debug__: + _z3_assert(len(args) > 0, "At least one argument expected") + num = len(args) + r = _to_probe(args[0], ctx) + for i in range(num - 1): + r = Probe(f(ctx.ref(), r.probe, _to_probe(args[i+1], ctx).probe), ctx) + return r + +def _probe_and(args, ctx): + return _probe_nary(Z3_probe_and, args, ctx) + +def _probe_or(args, ctx): + return _probe_nary(Z3_probe_or, args, ctx) + +def FailIf(p, ctx=None): + """Return a tactic that fails if the probe `p` evaluates to true. Otherwise, it returns the input goal unmodified. + + In the following example, the tactic applies 'simplify' if and only if there are more than 2 constraints in the goal. + + >>> t = OrElse(FailIf(Probe('size') > 2), Tactic('simplify')) + >>> x, y = Ints('x y') + >>> g = Goal() + >>> g.add(x > 0) + >>> g.add(y > 0) + >>> t(g) + [[x > 0, y > 0]] + >>> g.add(x == y + 1) + >>> t(g) + [[Not(x <= 0), Not(y <= 0), x == 1 + y]] + """ + p = _to_probe(p, ctx) + return Tactic(Z3_tactic_fail_if(p.ctx.ref(), p.probe), p.ctx) + +def When(p, t, ctx=None): + """Return a tactic that applies tactic `t` only if probe `p` evaluates to true. Otherwise, it returns the input goal unmodified. + + >>> t = When(Probe('size') > 2, Tactic('simplify')) + >>> x, y = Ints('x y') + >>> g = Goal() + >>> g.add(x > 0) + >>> g.add(y > 0) + >>> t(g) + [[x > 0, y > 0]] + >>> g.add(x == y + 1) + >>> t(g) + [[Not(x <= 0), Not(y <= 0), x == 1 + y]] + """ + p = _to_probe(p, ctx) + t = _to_tactic(t, ctx) + return Tactic(Z3_tactic_when(t.ctx.ref(), p.probe, t.tactic), t.ctx) + +def Cond(p, t1, t2, ctx=None): + """Return a tactic that applies tactic `t1` to a goal if probe `p` evaluates to true, and `t2` otherwise. + + >>> t = Cond(Probe('is-qfnra'), Tactic('qfnra'), Tactic('smt')) + """ + p = _to_probe(p, ctx) + t1 = _to_tactic(t1, ctx) + t2 = _to_tactic(t2, ctx) + return Tactic(Z3_tactic_cond(t1.ctx.ref(), p.probe, t1.tactic, t2.tactic), t1.ctx) + +######################################### +# +# Utils +# +######################################### + +def simplify(a, *arguments, **keywords): + """Simplify the expression `a` using the given options. + + This function has many options. Use `help_simplify` to obtain the complete list. + + >>> x = Int('x') + >>> y = Int('y') + >>> simplify(x + 1 + y + x + 1) + 2 + 2*x + y + >>> simplify((x + 1)*(y + 1), som=True) + 1 + x + y + x*y + >>> simplify(Distinct(x, y, 1), blast_distinct=True) + And(Not(x == y), Not(x == 1), Not(y == 1)) + >>> simplify(And(x == 0, y == 1), elim_and=True) + Not(Or(Not(x == 0), Not(y == 1))) + """ + if __debug__: + _z3_assert(is_expr(a), "Z3 expression expected") + if len(arguments) > 0 or len(keywords) > 0: + p = args2params(arguments, keywords, a.ctx) + return _to_expr_ref(Z3_simplify_ex(a.ctx_ref(), a.as_ast(), p.params), a.ctx) + else: + return _to_expr_ref(Z3_simplify(a.ctx_ref(), a.as_ast()), a.ctx) + +def help_simplify(): + """Return a string describing all options available for Z3 `simplify` procedure.""" + print(Z3_simplify_get_help(main_ctx().ref())) + +def simplify_param_descrs(): + """Return the set of parameter descriptions for Z3 `simplify` procedure.""" + return ParamDescrsRef(Z3_simplify_get_param_descrs(main_ctx().ref()), main_ctx()) + +def substitute(t, *m): + """Apply substitution m on t, m is a list of pairs of the form (from, to). Every occurrence in t of from is replaced with to. + + >>> x = Int('x') + >>> y = Int('y') + >>> substitute(x + 1, (x, y + 1)) + y + 1 + 1 + >>> f = Function('f', IntSort(), IntSort()) + >>> substitute(f(x) + f(y), (f(x), IntVal(1)), (f(y), IntVal(1))) + 1 + 1 + """ + if isinstance(m, tuple): + m1 = _get_args(m) + if isinstance(m1, list): + m = m1 + if __debug__: + _z3_assert(is_expr(t), "Z3 expression expected") + _z3_assert(all([isinstance(p, tuple) and is_expr(p[0]) and is_expr(p[1]) and p[0].sort().eq(p[1].sort()) for p in m]), "Z3 invalid substitution, expression pairs expected.") + num = len(m) + _from = (Ast * num)() + _to = (Ast * num)() + for i in range(num): + _from[i] = m[i][0].as_ast() + _to[i] = m[i][1].as_ast() + return _to_expr_ref(Z3_substitute(t.ctx.ref(), t.as_ast(), num, _from, _to), t.ctx) + +def substitute_vars(t, *m): + """Substitute the free variables in t with the expression in m. + + >>> v0 = Var(0, IntSort()) + >>> v1 = Var(1, IntSort()) + >>> x = Int('x') + >>> f = Function('f', IntSort(), IntSort(), IntSort()) + >>> # replace v0 with x+1 and v1 with x + >>> substitute_vars(f(v0, v1), x + 1, x) + f(x + 1, x) + """ + if __debug__: + _z3_assert(is_expr(t), "Z3 expression expected") + _z3_assert(all([is_expr(n) for n in m]), "Z3 invalid substitution, list of expressions expected.") + num = len(m) + _to = (Ast * num)() + for i in range(num): + _to[i] = m[i].as_ast() + return _to_expr_ref(Z3_substitute_vars(t.ctx.ref(), t.as_ast(), num, _to), t.ctx) + +def Sum(*args): + """Create the sum of the Z3 expressions. + + >>> a, b, c = Ints('a b c') + >>> Sum(a, b, c) + a + b + c + >>> Sum([a, b, c]) + a + b + c + >>> A = IntVector('a', 5) + >>> Sum(A) + a__0 + a__1 + a__2 + a__3 + a__4 + """ + args = _get_args(args) + if len(args) == 0: + return 0 + ctx = _ctx_from_ast_arg_list(args) + if ctx is None: + return _reduce(lambda a, b: a + b, args, 0) + args = _coerce_expr_list(args, ctx) + if is_bv(args[0]): + return _reduce(lambda a, b: a + b, args, 0) + else: + _args, sz = _to_ast_array(args) + return ArithRef(Z3_mk_add(ctx.ref(), sz, _args), ctx) + + +def Product(*args): + """Create the product of the Z3 expressions. + + >>> a, b, c = Ints('a b c') + >>> Product(a, b, c) + a*b*c + >>> Product([a, b, c]) + a*b*c + >>> A = IntVector('a', 5) + >>> Product(A) + a__0*a__1*a__2*a__3*a__4 + """ + args = _get_args(args) + if len(args) == 0: + return 1 + ctx = _ctx_from_ast_arg_list(args) + if ctx is None: + return _reduce(lambda a, b: a * b, args, 1) + args = _coerce_expr_list(args, ctx) + if is_bv(args[0]): + return _reduce(lambda a, b: a * b, args, 1) + else: + _args, sz = _to_ast_array(args) + return ArithRef(Z3_mk_mul(ctx.ref(), sz, _args), ctx) + +def AtMost(*args): + """Create an at-most Pseudo-Boolean k constraint. + + >>> a, b, c = Bools('a b c') + >>> f = AtMost(a, b, c, 2) + """ + args = _get_args(args) + if __debug__: + _z3_assert(len(args) > 1, "Non empty list of arguments expected") + ctx = _ctx_from_ast_arg_list(args) + if __debug__: + _z3_assert(ctx is not None, "At least one of the arguments must be a Z3 expression") + args1 = _coerce_expr_list(args[:-1], ctx) + k = args[-1] + _args, sz = _to_ast_array(args1) + return BoolRef(Z3_mk_atmost(ctx.ref(), sz, _args, k), ctx) + +def AtLeast(*args): + """Create an at-most Pseudo-Boolean k constraint. + + >>> a, b, c = Bools('a b c') + >>> f = AtLeast(a, b, c, 2) + """ + args = _get_args(args) + if __debug__: + _z3_assert(len(args) > 1, "Non empty list of arguments expected") + ctx = _ctx_from_ast_arg_list(args) + if __debug__: + _z3_assert(ctx is not None, "At least one of the arguments must be a Z3 expression") + args1 = _coerce_expr_list(args[:-1], ctx) + k = args[-1] + _args, sz = _to_ast_array(args1) + return BoolRef(Z3_mk_atleast(ctx.ref(), sz, _args, k), ctx) + + +def _pb_args_coeffs(args): + args = _get_args(args) + args, coeffs = zip(*args) + if __debug__: + _z3_assert(len(args) > 0, "Non empty list of arguments expected") + ctx = _ctx_from_ast_arg_list(args) + if __debug__: + _z3_assert(ctx is not None, "At least one of the arguments must be a Z3 expression") + args = _coerce_expr_list(args, ctx) + _args, sz = _to_ast_array(args) + _coeffs = (ctypes.c_int * len(coeffs))() + for i in range(len(coeffs)): + _coeffs[i] = coeffs[i] + return ctx, sz, _args, _coeffs + +def PbLe(args, k): + """Create a Pseudo-Boolean inequality k constraint. + + >>> a, b, c = Bools('a b c') + >>> f = PbLe(((a,1),(b,3),(c,2)), 3) + """ + ctx, sz, _args, _coeffs = _pb_args_coeffs(args) + return BoolRef(Z3_mk_pble(ctx.ref(), sz, _args, _coeffs, k), ctx) + +def PbGe(args, k): + """Create a Pseudo-Boolean inequality k constraint. + + >>> a, b, c = Bools('a b c') + >>> f = PbGe(((a,1),(b,3),(c,2)), 3) + """ + ctx, sz, _args, _coeffs = _pb_args_coeffs(args) + return BoolRef(Z3_mk_pbge(ctx.ref(), sz, _args, _coeffs, k), ctx) + +def PbEq(args, k): + """Create a Pseudo-Boolean inequality k constraint. + + >>> a, b, c = Bools('a b c') + >>> f = PbEq(((a,1),(b,3),(c,2)), 3) + """ + ctx, sz, _args, _coeffs = _pb_args_coeffs(args) + return BoolRef(Z3_mk_pbeq(ctx.ref(), sz, _args, _coeffs, k), ctx) + + +def solve(*args, **keywords): + """Solve the constraints `*args`. + + This is a simple function for creating demonstrations. It creates a solver, + configure it using the options in `keywords`, adds the constraints + in `args`, and invokes check. + + >>> a = Int('a') + >>> solve(a > 0, a < 2) + [a = 1] + """ + s = Solver() + s.set(**keywords) + s.add(*args) + if keywords.get('show', False): + print(s) + r = s.check() + if r == unsat: + print("no solution") + elif r == unknown: + print("failed to solve") + try: + print(s.model()) + except Z3Exception: + return + else: + print(s.model()) + +def solve_using(s, *args, **keywords): + """Solve the constraints `*args` using solver `s`. + + This is a simple function for creating demonstrations. It is similar to `solve`, + but it uses the given solver `s`. + It configures solver `s` using the options in `keywords`, adds the constraints + in `args`, and invokes check. + """ + if __debug__: + _z3_assert(isinstance(s, Solver), "Solver object expected") + s.set(**keywords) + s.add(*args) + if keywords.get('show', False): + print("Problem:") + print(s) + r = s.check() + if r == unsat: + print("no solution") + elif r == unknown: + print("failed to solve") + try: + print(s.model()) + except Z3Exception: + return + else: + if keywords.get('show', False): + print("Solution:") + print(s.model()) + +def prove(claim, **keywords): + """Try to prove the given claim. + + This is a simple function for creating demonstrations. It tries to prove + `claim` by showing the negation is unsatisfiable. + + >>> p, q = Bools('p q') + >>> prove(Not(And(p, q)) == Or(Not(p), Not(q))) + proved + """ + if __debug__: + _z3_assert(is_bool(claim), "Z3 Boolean expression expected") + s = Solver() + s.set(**keywords) + s.add(Not(claim)) + if keywords.get('show', False): + print(s) + r = s.check() + if r == unsat: + print("proved") + elif r == unknown: + print("failed to prove") + print(s.model()) + else: + print("counterexample") + print(s.model()) + +def _solve_html(*args, **keywords): + """Version of funcion `solve` used in RiSE4Fun.""" + s = Solver() + s.set(**keywords) + s.add(*args) + if keywords.get('show', False): + print("<b>Problem:</b>") + print(s) + r = s.check() + if r == unsat: + print("<b>no solution</b>") + elif r == unknown: + print("<b>failed to solve</b>") + try: + print(s.model()) + except Z3Exception: + return + else: + if keywords.get('show', False): + print("<b>Solution:</b>") + print(s.model()) + +def _solve_using_html(s, *args, **keywords): + """Version of funcion `solve_using` used in RiSE4Fun.""" + if __debug__: + _z3_assert(isinstance(s, Solver), "Solver object expected") + s.set(**keywords) + s.add(*args) + if keywords.get('show', False): + print("<b>Problem:</b>") + print(s) + r = s.check() + if r == unsat: + print("<b>no solution</b>") + elif r == unknown: + print("<b>failed to solve</b>") + try: + print(s.model()) + except Z3Exception: + return + else: + if keywords.get('show', False): + print("<b>Solution:</b>") + print(s.model()) + +def _prove_html(claim, **keywords): + """Version of funcion `prove` used in RiSE4Fun.""" + if __debug__: + _z3_assert(is_bool(claim), "Z3 Boolean expression expected") + s = Solver() + s.set(**keywords) + s.add(Not(claim)) + if keywords.get('show', False): + print(s) + r = s.check() + if r == unsat: + print("<b>proved</b>") + elif r == unknown: + print("<b>failed to prove</b>") + print(s.model()) + else: + print("<b>counterexample</b>") + print(s.model()) + +def _dict2sarray(sorts, ctx): + sz = len(sorts) + _names = (Symbol * sz)() + _sorts = (Sort * sz) () + i = 0 + for k in sorts: + v = sorts[k] + if __debug__: + _z3_assert(isinstance(k, str), "String expected") + _z3_assert(is_sort(v), "Z3 sort expected") + _names[i] = to_symbol(k, ctx) + _sorts[i] = v.ast + i = i + 1 + return sz, _names, _sorts + +def _dict2darray(decls, ctx): + sz = len(decls) + _names = (Symbol * sz)() + _decls = (FuncDecl * sz) () + i = 0 + for k in decls: + v = decls[k] + if __debug__: + _z3_assert(isinstance(k, str), "String expected") + _z3_assert(is_func_decl(v) or is_const(v), "Z3 declaration or constant expected") + _names[i] = to_symbol(k, ctx) + if is_const(v): + _decls[i] = v.decl().ast + else: + _decls[i] = v.ast + i = i + 1 + return sz, _names, _decls + +def _handle_parse_error(ex, ctx): + msg = Z3_get_parser_error(ctx.ref()) + if msg != "": + raise Z3Exception(msg) + raise ex + +def parse_smt2_string(s, sorts={}, decls={}, ctx=None): + """Parse a string in SMT 2.0 format using the given sorts and decls. + + The arguments sorts and decls are Python dictionaries used to initialize + the symbol table used for the SMT 2.0 parser. + + >>> parse_smt2_string('(declare-const x Int) (assert (> x 0)) (assert (< x 10))') + And(x > 0, x < 10) + >>> x, y = Ints('x y') + >>> f = Function('f', IntSort(), IntSort()) + >>> parse_smt2_string('(assert (> (+ foo (g bar)) 0))', decls={ 'foo' : x, 'bar' : y, 'g' : f}) + x + f(y) > 0 + >>> parse_smt2_string('(declare-const a U) (assert (> a 0))', sorts={ 'U' : IntSort() }) + a > 0 + """ + ctx = _get_ctx(ctx) + ssz, snames, ssorts = _dict2sarray(sorts, ctx) + dsz, dnames, ddecls = _dict2darray(decls, ctx) + try: + return _to_expr_ref(Z3_parse_smtlib2_string(ctx.ref(), s, ssz, snames, ssorts, dsz, dnames, ddecls), ctx) + except Z3Exception as e: + _handle_parse_error(e, ctx) + +def parse_smt2_file(f, sorts={}, decls={}, ctx=None): + """Parse a file in SMT 2.0 format using the given sorts and decls. + + This function is similar to parse_smt2_string(). + """ + ctx = _get_ctx(ctx) + ssz, snames, ssorts = _dict2sarray(sorts, ctx) + dsz, dnames, ddecls = _dict2darray(decls, ctx) + try: + return _to_expr_ref(Z3_parse_smtlib2_file(ctx.ref(), f, ssz, snames, ssorts, dsz, dnames, ddecls), ctx) + except Z3Exception as e: + _handle_parse_error(e, ctx) + +def Interpolant(a,ctx=None): + """Create an interpolation operator. + + The argument is an interpolation pattern (see tree_interpolant). + + >>> x = Int('x') + >>> print(Interpolant(x>0)) + interp(x > 0) + """ + ctx = _get_ctx(_ctx_from_ast_arg_list([a], ctx)) + s = BoolSort(ctx) + a = s.cast(a) + return BoolRef(Z3_mk_interpolant(ctx.ref(), a.as_ast()), ctx) + +def tree_interpolant(pat,p=None,ctx=None): + """Compute interpolant for a tree of formulas. + + The input is an interpolation pattern over a set of formulas C. + The pattern pat is a formula combining the formulas in C using + logical conjunction and the "interp" operator (see Interp). This + interp operator is logically the identity operator. It marks the + sub-formulas of the pattern for which interpolants should be + computed. The interpolant is a map sigma from marked subformulas + to formulas, such that, for each marked subformula phi of pat + (where phi sigma is phi with sigma(psi) substituted for each + subformula psi of phi such that psi in dom(sigma)): + + 1) phi sigma implies sigma(phi), and + + 2) sigma(phi) is in the common uninterpreted vocabulary between + the formulas of C occurring in phi and those not occurring in + phi + + and moreover pat sigma implies false. In the simplest case + an interpolant for the pattern "(and (interp A) B)" maps A + to an interpolant for A /\ B. + + The return value is a vector of formulas representing sigma. This + vector contains sigma(phi) for each marked subformula of pat, in + pre-order traversal. This means that subformulas of phi occur before phi + in the vector. Also, subformulas that occur multiply in pat will + occur multiply in the result vector. + + If pat is satisfiable, raises an object of class ModelRef + that represents a model of pat. + + If neither a proof of unsatisfiability nor a model is obtained + (for example, because of a timeout, or because models are disabled) + then None is returned. + + If parameters p are supplied, these are used in creating the + solver that determines satisfiability. + + >>> x = Int('x') + >>> y = Int('y') + >>> print(tree_interpolant(And(Interpolant(x < 0), Interpolant(y > 2), x == y))) + [Not(x >= 0), Not(y <= 2)] + + # >>> g = And(Interpolant(x<0),x<2) + # >>> try: + # ... print tree_interpolant(g).sexpr() + # ... except ModelRef as m: + # ... print m.sexpr() + (define-fun x () Int + (- 1)) + """ + f = pat + ctx = _get_ctx(_ctx_from_ast_arg_list([f], ctx)) + ptr = (AstVectorObj * 1)() + mptr = (Model * 1)() + if p is None: + p = ParamsRef(ctx) + res = Z3_compute_interpolant(ctx.ref(),f.as_ast(),p.params,ptr,mptr) + if res == Z3_L_FALSE: + return AstVector(ptr[0],ctx) + if mptr[0]: + raise ModelRef(mptr[0], ctx) + return None + +def binary_interpolant(a,b,p=None,ctx=None): + """Compute an interpolant for a binary conjunction. + + If a & b is unsatisfiable, returns an interpolant for a & b. + This is a formula phi such that + + 1) a implies phi + 2) b implies not phi + 3) All the uninterpreted symbols of phi occur in both a and b. + + If a & b is satisfiable, raises an object of class ModelRef + that represents a model of a &b. + + If neither a proof of unsatisfiability nor a model is obtained + (for example, because of a timeout, or because models are disabled) + then None is returned. + + If parameters p are supplied, these are used in creating the + solver that determines satisfiability. + + x = Int('x') + print(binary_interpolant(x<0,x>2)) + Not(x >= 0) + """ + f = And(Interpolant(a),b) + ti = tree_interpolant(f,p,ctx) + return ti[0] if ti is not None else None + +def sequence_interpolant(v,p=None,ctx=None): + """Compute interpolant for a sequence of formulas. + + If len(v) == N, and if the conjunction of the formulas in v is + unsatisfiable, the interpolant is a sequence of formulas w + such that len(w) = N-1 and v[0] implies w[0] and for i in 0..N-1: + + 1) w[i] & v[i+1] implies w[i+1] (or false if i+1 = N) + 2) All uninterpreted symbols in w[i] occur in both v[0]..v[i] + and v[i+1]..v[n] + + Requires len(v) >= 1. + + If a & b is satisfiable, raises an object of class ModelRef + that represents a model of a & b. + + If neither a proof of unsatisfiability nor a model is obtained + (for example, because of a timeout, or because models are disabled) + then None is returned. + + If parameters p are supplied, these are used in creating the + solver that determines satisfiability. + + x = Int('x') + y = Int('y') + print(sequence_interpolant([x < 0, y == x , y > 2])) + [Not(x >= 0), Not(y >= 0)] + """ + f = v[0] + for i in range(1,len(v)): + f = And(Interpolant(f),v[i]) + return tree_interpolant(f,p,ctx) + + +######################################### +# +# Floating-Point Arithmetic +# +######################################### + + +# Global default rounding mode +_dflt_rounding_mode = Z3_OP_FPA_RM_TOWARD_ZERO +_dflt_fpsort_ebits = 11 +_dflt_fpsort_sbits = 53 + +def get_default_rounding_mode(ctx=None): + """Retrieves the global default rounding mode.""" + global _dflt_rounding_mode + if _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_ZERO: + return RTZ(ctx) + elif _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_NEGATIVE: + return RTN(ctx) + elif _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_POSITIVE: + return RTP(ctx) + elif _dflt_rounding_mode == Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN: + return RNE(ctx) + elif _dflt_rounding_mode == Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY: + return RNA(ctx) + +def set_default_rounding_mode(rm, ctx=None): + global _dflt_rounding_mode + if is_fprm_value(rm): + _dflt_rounding_mode = rm.decl().kind() + else: + _z3_assert(_dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_ZERO or + _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_NEGATIVE or + _dflt_rounding_mode == Z3_OP_FPA_RM_TOWARD_POSITIVE or + _dflt_rounding_mode == Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN or + _dflt_rounding_mode == Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY, + "illegal rounding mode") + _dflt_rounding_mode = rm + +def get_default_fp_sort(ctx=None): + return FPSort(_dflt_fpsort_ebits, _dflt_fpsort_sbits, ctx) + +def set_default_fp_sort(ebits, sbits, ctx=None): + global _dflt_fpsort_ebits + global _dflt_fpsort_sbits + _dflt_fpsort_ebits = ebits + _dflt_fpsort_sbits = sbits + +def _dflt_rm(ctx=None): + return get_default_rounding_mode(ctx) + +def _dflt_fps(ctx=None): + return get_default_fp_sort(ctx) + +def _coerce_fp_expr_list(alist, ctx): + first_fp_sort = None + for a in alist: + if is_fp(a): + if first_fp_sort is None: + first_fp_sort = a.sort() + elif first_fp_sort == a.sort(): + pass # OK, same as before + else: + # we saw at least 2 different float sorts; something will + # throw a sort mismatch later, for now assume None. + first_fp_sort = None + break + + r = [] + for i in range(len(alist)): + a = alist[i] + if (isinstance(a, str) and a.contains('2**(') and a.endswith(')')) or _is_int(a) or isinstance(a, float) or isinstance(a, bool): + r.append(FPVal(a, None, first_fp_sort, ctx)) + else: + r.append(a) + return _coerce_expr_list(r, ctx) + + +### FP Sorts + +class FPSortRef(SortRef): + """Floating-point sort.""" + + def ebits(self): + """Retrieves the number of bits reserved for the exponent in the FloatingPoint sort `self`. + >>> b = FPSort(8, 24) + >>> b.ebits() + 8 + """ + return int(Z3_fpa_get_ebits(self.ctx_ref(), self.ast)) + + def sbits(self): + """Retrieves the number of bits reserved for the significand in the FloatingPoint sort `self`. + >>> b = FPSort(8, 24) + >>> b.sbits() + 24 + """ + return int(Z3_fpa_get_sbits(self.ctx_ref(), self.ast)) + + def cast(self, val): + """Try to cast `val` as a floating-point expression. + >>> b = FPSort(8, 24) + >>> b.cast(1.0) + 1 + >>> b.cast(1.0).sexpr() + '(fp #b0 #x7f #b00000000000000000000000)' + """ + if is_expr(val): + if __debug__: + _z3_assert(self.ctx == val.ctx, "Context mismatch") + return val + else: + return FPVal(val, None, self, self.ctx) + + +def Float16(ctx=None): + """Floating-point 16-bit (half) sort.""" + ctx = _get_ctx(ctx) + return FPSortRef(Z3_mk_fpa_sort_16(ctx.ref()), ctx) + +def FloatHalf(ctx=None): + """Floating-point 16-bit (half) sort.""" + ctx = _get_ctx(ctx) + return FPSortRef(Z3_mk_fpa_sort_half(ctx.ref()), ctx) + +def Float32(ctx=None): + """Floating-point 32-bit (single) sort.""" + ctx = _get_ctx(ctx) + return FPSortRef(Z3_mk_fpa_sort_32(ctx.ref()), ctx) + +def FloatSingle(ctx=None): + """Floating-point 32-bit (single) sort.""" + ctx = _get_ctx(ctx) + return FPSortRef(Z3_mk_fpa_sort_single(ctx.ref()), ctx) + +def Float64(ctx=None): + """Floating-point 64-bit (double) sort.""" + ctx = _get_ctx(ctx) + return FPSortRef(Z3_mk_fpa_sort_64(ctx.ref()), ctx) + +def FloatDouble(ctx=None): + """Floating-point 64-bit (double) sort.""" + ctx = _get_ctx(ctx) + return FPSortRef(Z3_mk_fpa_sort_double(ctx.ref()), ctx) + +def Float128(ctx=None): + """Floating-point 128-bit (quadruple) sort.""" + ctx = _get_ctx(ctx) + return FPSortRef(Z3_mk_fpa_sort_128(ctx.ref()), ctx) + +def FloatQuadruple(ctx=None): + """Floating-point 128-bit (quadruple) sort.""" + ctx = _get_ctx(ctx) + return FPSortRef(Z3_mk_fpa_sort_quadruple(ctx.ref()), ctx) + +class FPRMSortRef(SortRef): + """"Floating-point rounding mode sort.""" + + +def is_fp_sort(s): + """Return True if `s` is a Z3 floating-point sort. + + >>> is_fp_sort(FPSort(8, 24)) + True + >>> is_fp_sort(IntSort()) + False + """ + return isinstance(s, FPSortRef) + +def is_fprm_sort(s): + """Return True if `s` is a Z3 floating-point rounding mode sort. + + >>> is_fprm_sort(FPSort(8, 24)) + False + >>> is_fprm_sort(RNE().sort()) + True + """ + return isinstance(s, FPRMSortRef) + +### FP Expressions + +class FPRef(ExprRef): + """Floating-point expressions.""" + + def sort(self): + """Return the sort of the floating-point expression `self`. + + >>> x = FP('1.0', FPSort(8, 24)) + >>> x.sort() + FPSort(8, 24) + >>> x.sort() == FPSort(8, 24) + True + """ + return FPSortRef(Z3_get_sort(self.ctx_ref(), self.as_ast()), self.ctx) + + def ebits(self): + """Retrieves the number of bits reserved for the exponent in the FloatingPoint expression `self`. + >>> b = FPSort(8, 24) + >>> b.ebits() + 8 + """ + return self.sort().ebits(); + + def sbits(self): + """Retrieves the number of bits reserved for the exponent in the FloatingPoint expression `self`. + >>> b = FPSort(8, 24) + >>> b.sbits() + 24 + """ + return self.sort().sbits(); + + def as_string(self): + """Return a Z3 floating point expression as a Python string.""" + return Z3_ast_to_string(self.ctx_ref(), self.as_ast()) + + def __le__(self, other): + return fpLEQ(self, other, self.ctx) + + def __lt__(self, other): + return fpLT(self, other, self.ctx) + + def __ge__(self, other): + return fpGEQ(self, other, self.ctx) + + def __gt__(self, other): + return fpGT(self, other, self.ctx) + + def __add__(self, other): + """Create the Z3 expression `self + other`. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = FP('y', FPSort(8, 24)) + >>> x + y + x + y + >>> (x + y).sort() + FPSort(8, 24) + """ + [a, b] = _coerce_fp_expr_list([self, other], self.ctx) + return fpAdd(_dflt_rm(), a, b, self.ctx) + + def __radd__(self, other): + """Create the Z3 expression `other + self`. + + >>> x = FP('x', FPSort(8, 24)) + >>> 10 + x + 1.25*(2**3) + x + """ + [a, b] = _coerce_fp_expr_list([other, self], self.ctx) + return fpAdd(_dflt_rm(), a, b, self.ctx) + + def __sub__(self, other): + """Create the Z3 expression `self - other`. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = FP('y', FPSort(8, 24)) + >>> x - y + x - y + >>> (x - y).sort() + FPSort(8, 24) + """ + [a, b] = _coerce_fp_expr_list([self, other], self.ctx) + return fpSub(_dflt_rm(), a, b, self.ctx) + + def __rsub__(self, other): + """Create the Z3 expression `other - self`. + + >>> x = FP('x', FPSort(8, 24)) + >>> 10 - x + 1.25*(2**3) - x + """ + [a, b] = _coerce_fp_expr_list([other, self], self.ctx) + return fpSub(_dflt_rm(), a, b, self.ctx) + + def __mul__(self, other): + """Create the Z3 expression `self * other`. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = FP('y', FPSort(8, 24)) + >>> x * y + x * y + >>> (x * y).sort() + FPSort(8, 24) + >>> 10 * y + 1.25*(2**3) * y + """ + [a, b] = _coerce_fp_expr_list([self, other], self.ctx) + return fpMul(_dflt_rm(), a, b, self.ctx) + + def __rmul__(self, other): + """Create the Z3 expression `other * self`. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = FP('y', FPSort(8, 24)) + >>> x * y + x * y + >>> x * 10 + x * 1.25*(2**3) + """ + [a, b] = _coerce_fp_expr_list([other, self], self.ctx) + return fpMul(_dflt_rm(), a, b, self.ctx) + + def __pos__(self): + """Create the Z3 expression `+self`.""" + return self + + def __neg__(self): + """Create the Z3 expression `-self`. + + >>> x = FP('x', Float32()) + >>> -x + -x + """ + return fpNeg(self) + + def __div__(self, other): + """Create the Z3 expression `self / other`. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = FP('y', FPSort(8, 24)) + >>> x / y + x / y + >>> (x / y).sort() + FPSort(8, 24) + >>> 10 / y + 1.25*(2**3) / y + """ + [a, b] = _coerce_fp_expr_list([self, other], self.ctx) + return fpDiv(_dflt_rm(), a, b, self.ctx) + + def __rdiv__(self, other): + """Create the Z3 expression `other / self`. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = FP('y', FPSort(8, 24)) + >>> x / y + x / y + >>> x / 10 + x / 1.25*(2**3) + """ + [a, b] = _coerce_fp_expr_list([other, self], self.ctx) + return fpDiv(_dflt_rm(), a, b, self.ctx) + + if not sys.version < '3': + def __truediv__(self, other): + """Create the Z3 expression division `self / other`.""" + return self.__div__(other) + + def __rtruediv__(self, other): + """Create the Z3 expression division `other / self`.""" + return self.__rdiv__(other) + + def __mod__(self, other): + """Create the Z3 expression mod `self % other`.""" + return fpRem(self, other) + + def __rmod__(self, other): + """Create the Z3 expression mod `other % self`.""" + return fpRem(other, self) + +class FPRMRef(ExprRef): + """Floating-point rounding mode expressions""" + + def as_string(self): + """Return a Z3 floating point expression as a Python string.""" + return Z3_ast_to_string(self.ctx_ref(), self.as_ast()) + + +def RoundNearestTiesToEven(ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_nearest_ties_to_even(ctx.ref()), ctx) + +def RNE (ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_nearest_ties_to_even(ctx.ref()), ctx) + +def RoundNearestTiesToAway(ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_nearest_ties_to_away(ctx.ref()), ctx) + +def RNA (ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_nearest_ties_to_away(ctx.ref()), ctx) + +def RoundTowardPositive(ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_toward_positive(ctx.ref()), ctx) + +def RTP(ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_toward_positive(ctx.ref()), ctx) + +def RoundTowardNegative(ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_toward_negative(ctx.ref()), ctx) + +def RTN(ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_toward_negative(ctx.ref()), ctx) + +def RoundTowardZero(ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_toward_zero(ctx.ref()), ctx) + +def RTZ(ctx=None): + ctx = _get_ctx(ctx) + return FPRMRef(Z3_mk_fpa_round_toward_zero(ctx.ref()), ctx) + +def is_fprm(a): + """Return `True` if `a` is a Z3 floating-point rounding mode expression. + + >>> rm = RNE() + >>> is_fprm(rm) + True + >>> rm = 1.0 + >>> is_fprm(rm) + False + """ + return isinstance(a, FPRMRef) + +def is_fprm_value(a): + """Return `True` if `a` is a Z3 floating-point rounding mode numeral value.""" + return is_fprm(a) and _is_numeral(a.ctx, a.ast) + +### FP Numerals + +class FPNumRef(FPRef): + """The sign of the numeral. + + >>> x = FPVal(+1.0, FPSort(8, 24)) + >>> x.sign() + False + >>> x = FPVal(-1.0, FPSort(8, 24)) + >>> x.sign() + True + """ + def sign(self): + l = (ctypes.c_int)() + if Z3_fpa_get_numeral_sign(self.ctx.ref(), self.as_ast(), byref(l)) == False: + raise Z3Exception("error retrieving the sign of a numeral.") + return l.value != 0 + + """The sign of a floating-point numeral as a bit-vector expression. + + Remark: NaN's are invalid arguments. + """ + def sign_as_bv(self): + return BitVecNumRef(Z3_fpa_get_numeral_sign_bv(self.ctx.ref(), self.as_ast()), self.ctx) + + """The significand of the numeral. + + >>> x = FPVal(2.5, FPSort(8, 24)) + >>> x.significand() + 1.25 + """ + def significand(self): + return Z3_fpa_get_numeral_significand_string(self.ctx.ref(), self.as_ast()) + + """The significand of the numeral as a long. + + >>> x = FPVal(2.5, FPSort(8, 24)) + >>> x.significand_as_long() + 1.25 + """ + def significand_as_long(self): + return Z3_fpa_get_numeral_significand_uint64(self.ctx.ref(), self.as_ast()) + + """The significand of the numeral as a bit-vector expression. + + Remark: NaN are invalid arguments. + """ + def significand_as_bv(self): + return BitVecNumRef(Z3_fpa_get_numeral_significand_bv(self.ctx.ref(), self.as_ast()), self.ctx) + + """The exponent of the numeral. + + >>> x = FPVal(2.5, FPSort(8, 24)) + >>> x.exponent() + 1 + """ + def exponent(self, biased=True): + return Z3_fpa_get_numeral_exponent_string(self.ctx.ref(), self.as_ast(), biased) + + """The exponent of the numeral as a long. + + >>> x = FPVal(2.5, FPSort(8, 24)) + >>> x.exponent_as_long() + 1 + """ + def exponent_as_long(self, biased=True): + ptr = (ctypes.c_longlong * 1)() + if not Z3_fpa_get_numeral_exponent_int64(self.ctx.ref(), self.as_ast(), ptr, biased): + raise Z3Exception("error retrieving the exponent of a numeral.") + return ptr[0] + + """The exponent of the numeral as a bit-vector expression. + + Remark: NaNs are invalid arguments. + """ + def exponent_as_bv(self, biased=True): + return BitVecNumRef(Z3_fpa_get_numeral_exponent_bv(self.ctx.ref(), self.as_ast(), biased), self.ctx) + + """Indicates whether the numeral is a NaN.""" + def isNaN(self): + return Z3_fpa_is_numeral_nan(self.ctx.ref(), self.as_ast()) + + """Indicates whether the numeral is +oo or -oo.""" + def isInf(self): + return Z3_fpa_is_numeral_inf(self.ctx.ref(), self.as_ast()) + + """Indicates whether the numeral is +zero or -zero.""" + def isZero(self): + return Z3_fpa_is_numeral_zero(self.ctx.ref(), self.as_ast()) + + """Indicates whether the numeral is normal.""" + def isNormal(self): + return Z3_fpa_is_numeral_normal(self.ctx.ref(), self.as_ast()) + + """Indicates whether the numeral is subnormal.""" + def isSubnormal(self): + return Z3_fpa_is_numeral_subnormal(self.ctx.ref(), self.as_ast()) + + """Indicates whether the numeral is postitive.""" + def isPositive(self): + return Z3_fpa_is_numeral_positive(self.ctx.ref(), self.as_ast()) + + """Indicates whether the numeral is negative.""" + def isNegative(self): + return Z3_fpa_is_numeral_negative(self.ctx.ref(), self.as_ast()) + + """ + The string representation of the numeral. + + >>> x = FPVal(20, FPSort(8, 24)) + >>> x.as_string() + 1.25*(2**4) + """ + def as_string(self): + s = Z3_get_numeral_string(self.ctx.ref(), self.as_ast()) + return ("FPVal(%s, %s)" % (s, self.sort())) + +def is_fp(a): + """Return `True` if `a` is a Z3 floating-point expression. + + >>> b = FP('b', FPSort(8, 24)) + >>> is_fp(b) + True + >>> is_fp(b + 1.0) + True + >>> is_fp(Int('x')) + False + """ + return isinstance(a, FPRef) + +def is_fp_value(a): + """Return `True` if `a` is a Z3 floating-point numeral value. + + >>> b = FP('b', FPSort(8, 24)) + >>> is_fp_value(b) + False + >>> b = FPVal(1.0, FPSort(8, 24)) + >>> b + 1 + >>> is_fp_value(b) + True + """ + return is_fp(a) and _is_numeral(a.ctx, a.ast) + +def FPSort(ebits, sbits, ctx=None): + """Return a Z3 floating-point sort of the given sizes. If `ctx=None`, then the global context is used. + + >>> Single = FPSort(8, 24) + >>> Double = FPSort(11, 53) + >>> Single + FPSort(8, 24) + >>> x = Const('x', Single) + >>> eq(x, FP('x', FPSort(8, 24))) + True + """ + ctx = _get_ctx(ctx) + return FPSortRef(Z3_mk_fpa_sort(ctx.ref(), ebits, sbits), ctx) + +def _to_float_str(val, exp=0): + if isinstance(val, float): + if math.isnan(val): + res = "NaN" + elif val == 0.0: + sone = math.copysign(1.0, val) + if sone < 0.0: + return "-0.0" + else: + return "+0.0" + elif val == float("+inf"): + res = "+oo" + elif val == float("-inf"): + res = "-oo" + else: + v = val.as_integer_ratio() + num = v[0] + den = v[1] + rvs = str(num) + '/' + str(den) + res = rvs + 'p' + _to_int_str(exp) + elif isinstance(val, bool): + if val: + res = "1.0" + else: + res = "0.0" + elif _is_int(val): + res = str(val) + elif isinstance(val, str): + inx = val.find('*(2**') + if inx == -1: + res = val + elif val[-1] == ')': + res = val[0:inx] + exp = str(int(val[inx+5:-1]) + int(exp)) + else: + _z3_assert(False, "String does not have floating-point numeral form.") + elif __debug__: + _z3_assert(False, "Python value cannot be used to create floating-point numerals.") + if exp == 0: + return res + else: + return res + 'p' + exp + + +def fpNaN(s): + """Create a Z3 floating-point NaN term. + + >>> s = FPSort(8, 24) + >>> set_fpa_pretty(True) + >>> fpNaN(s) + NaN + >>> pb = get_fpa_pretty() + >>> set_fpa_pretty(False) + >>> fpNaN(s) + fpNaN(FPSort(8, 24)) + >>> set_fpa_pretty(pb) + """ + _z3_assert(isinstance(s, FPSortRef), "sort mismatch") + return FPNumRef(Z3_mk_fpa_nan(s.ctx_ref(), s.ast), s.ctx) + +def fpPlusInfinity(s): + """Create a Z3 floating-point +oo term. + + >>> s = FPSort(8, 24) + >>> pb = get_fpa_pretty() + >>> set_fpa_pretty(True) + >>> fpPlusInfinity(s) + +oo + >>> set_fpa_pretty(False) + >>> fpPlusInfinity(s) + fpPlusInfinity(FPSort(8, 24)) + >>> set_fpa_pretty(pb) + """ + _z3_assert(isinstance(s, FPSortRef), "sort mismatch") + return FPNumRef(Z3_mk_fpa_inf(s.ctx_ref(), s.ast, False), s.ctx) + +def fpMinusInfinity(s): + """Create a Z3 floating-point -oo term.""" + _z3_assert(isinstance(s, FPSortRef), "sort mismatch") + return FPNumRef(Z3_mk_fpa_inf(s.ctx_ref(), s.ast, True), s.ctx) + +def fpInfinity(s, negative): + """Create a Z3 floating-point +oo or -oo term.""" + _z3_assert(isinstance(s, FPSortRef), "sort mismatch") + _z3_assert(isinstance(negative, bool), "expected Boolean flag") + return FPNumRef(Z3_mk_fpa_inf(s.ctx_ref(), s.ast, negative), s.ctx) + +def fpPlusZero(s): + """Create a Z3 floating-point +0.0 term.""" + _z3_assert(isinstance(s, FPSortRef), "sort mismatch") + return FPNumRef(Z3_mk_fpa_zero(s.ctx_ref(), s.ast, False), s.ctx) + +def fpMinusZero(s): + """Create a Z3 floating-point -0.0 term.""" + _z3_assert(isinstance(s, FPSortRef), "sort mismatch") + return FPNumRef(Z3_mk_fpa_zero(s.ctx_ref(), s.ast, True), s.ctx) + +def fpZero(s, negative): + """Create a Z3 floating-point +0.0 or -0.0 term.""" + _z3_assert(isinstance(s, FPSortRef), "sort mismatch") + _z3_assert(isinstance(negative, bool), "expected Boolean flag") + return FPNumRef(Z3_mk_fpa_zero(s.ctx_ref(), s.ast, negative), s.ctx) + +def FPVal(sig, exp=None, fps=None, ctx=None): + """Return a floating-point value of value `val` and sort `fps`. If `ctx=None`, then the global context is used. + + >>> v = FPVal(20.0, FPSort(8, 24)) + >>> v + 1.25*(2**4) + >>> print("0x%.8x" % v.exponent_as_long(False)) + 0x00000004 + >>> v = FPVal(2.25, FPSort(8, 24)) + >>> v + 1.125*(2**1) + >>> v = FPVal(-2.25, FPSort(8, 24)) + >>> v + -1.125*(2**1) + >>> FPVal(-0.0, FPSort(8, 24)) + -0.0 + >>> FPVal(0.0, FPSort(8, 24)) + +0.0 + >>> FPVal(+0.0, FPSort(8, 24)) + +0.0 + """ + ctx = _get_ctx(ctx) + if is_fp_sort(exp): + fps = exp + exp = None + elif fps is None: + fps = _dflt_fps(ctx) + _z3_assert(is_fp_sort(fps), "sort mismatch") + if exp is None: + exp = 0 + val = _to_float_str(sig) + if val == "NaN" or val == "nan": + return fpNaN(fps) + elif val == "-0.0": + return fpMinusZero(fps) + elif val == "0.0" or val == "+0.0": + return fpPlusZero(fps) + elif val == "+oo" or val == "+inf" or val == "+Inf": + return fpPlusInfinity(fps) + elif val == "-oo" or val == "-inf" or val == "-Inf": + return fpMinusInfinity(fps) + else: + return FPNumRef(Z3_mk_numeral(ctx.ref(), val, fps.ast), ctx) + +def FP(name, fpsort, ctx=None): + """Return a floating-point constant named `name`. + `fpsort` is the floating-point sort. + If `ctx=None`, then the global context is used. + + >>> x = FP('x', FPSort(8, 24)) + >>> is_fp(x) + True + >>> x.ebits() + 8 + >>> x.sort() + FPSort(8, 24) + >>> word = FPSort(8, 24) + >>> x2 = FP('x', word) + >>> eq(x, x2) + True + """ + if isinstance(fpsort, FPSortRef) and ctx is None: + ctx = fpsort.ctx + else: + ctx = _get_ctx(ctx) + return FPRef(Z3_mk_const(ctx.ref(), to_symbol(name, ctx), fpsort.ast), ctx) + +def FPs(names, fpsort, ctx=None): + """Return an array of floating-point constants. + + >>> x, y, z = FPs('x y z', FPSort(8, 24)) + >>> x.sort() + FPSort(8, 24) + >>> x.sbits() + 24 + >>> x.ebits() + 8 + >>> fpMul(RNE(), fpAdd(RNE(), x, y), z) + fpMul(RNE(), fpAdd(RNE(), x, y), z) + """ + ctx = _get_ctx(ctx) + if isinstance(names, str): + names = names.split(" ") + return [FP(name, fpsort, ctx) for name in names] + +def fpAbs(a, ctx=None): + """Create a Z3 floating-point absolute value expression. + + >>> s = FPSort(8, 24) + >>> rm = RNE() + >>> x = FPVal(1.0, s) + >>> fpAbs(x) + fpAbs(1) + >>> y = FPVal(-20.0, s) + >>> y + -1.25*(2**4) + >>> fpAbs(y) + fpAbs(-1.25*(2**4)) + >>> fpAbs(-1.25*(2**4)) + fpAbs(-1.25*(2**4)) + >>> fpAbs(x).sort() + FPSort(8, 24) + """ + ctx = _get_ctx(ctx) + [a] = _coerce_fp_expr_list([a], ctx) + return FPRef(Z3_mk_fpa_abs(ctx.ref(), a.as_ast()), ctx) + +def fpNeg(a, ctx=None): + """Create a Z3 floating-point addition expression. + + >>> s = FPSort(8, 24) + >>> rm = RNE() + >>> x = FP('x', s) + >>> fpNeg(x) + -x + >>> fpNeg(x).sort() + FPSort(8, 24) + """ + ctx = _get_ctx(ctx) + [a] = _coerce_fp_expr_list([a], ctx) + return FPRef(Z3_mk_fpa_neg(ctx.ref(), a.as_ast()), ctx) + +def _mk_fp_unary(f, rm, a, ctx): + ctx = _get_ctx(ctx) + [a] = _coerce_fp_expr_list([a], ctx) + if __debug__: + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression") + _z3_assert(is_fp(a), "Second argument must be a Z3 floating-point expression") + return FPRef(f(ctx.ref(), rm.as_ast(), a.as_ast()), ctx) + +def _mk_fp_unary_norm(f, a, ctx): + ctx = _get_ctx(ctx) + [a] = _coerce_fp_expr_list([a], ctx) + if __debug__: + _z3_assert(is_fp(a), "First argument must be a Z3 floating-point expression") + return FPRef(f(ctx.ref(), a.as_ast()), ctx) + +def _mk_fp_unary_pred(f, a, ctx): + ctx = _get_ctx(ctx) + [a] = _coerce_fp_expr_list([a], ctx) + if __debug__: + _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression") + return BoolRef(f(ctx.ref(), a.as_ast()), ctx) + +def _mk_fp_bin(f, rm, a, b, ctx): + ctx = _get_ctx(ctx) + [a, b] = _coerce_fp_expr_list([a, b], ctx) + if __debug__: + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression") + _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression") + return FPRef(f(ctx.ref(), rm.as_ast(), a.as_ast(), b.as_ast()), ctx) + +def _mk_fp_bin_norm(f, a, b, ctx): + ctx = _get_ctx(ctx) + [a, b] = _coerce_fp_expr_list([a, b], ctx) + if __debug__: + _z3_assert(is_fp(a) or is_fp(b), "First or second argument must be a Z3 floating-point expression") + return FPRef(f(ctx.ref(), a.as_ast(), b.as_ast()), ctx) + +def _mk_fp_bin_pred(f, a, b, ctx): + ctx = _get_ctx(ctx) + [a, b] = _coerce_fp_expr_list([a, b], ctx) + if __debug__: + _z3_assert(is_fp(a) or is_fp(b), "Second or third argument must be a Z3 floating-point expression") + return BoolRef(f(ctx.ref(), a.as_ast(), b.as_ast()), ctx) + +def _mk_fp_tern(f, rm, a, b, c, ctx): + ctx = _get_ctx(ctx) + [a, b, c] = _coerce_fp_expr_list([a, b, c], ctx) + if __debug__: + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression") + _z3_assert(is_fp(a) or is_fp(b) or is_fp(c), "At least one of the arguments must be a Z3 floating-point expression") + return FPRef(f(ctx.ref(), rm.as_ast(), a.as_ast(), b.as_ast(), c.as_ast()), ctx) + +def fpAdd(rm, a, b, ctx=None): + """Create a Z3 floating-point addition expression. + + >>> s = FPSort(8, 24) + >>> rm = RNE() + >>> x = FP('x', s) + >>> y = FP('y', s) + >>> fpAdd(rm, x, y) + fpAdd(RNE(), x, y) + >>> fpAdd(RTZ(), x, y) # default rounding mode is RTZ + x + y + >>> fpAdd(rm, x, y).sort() + FPSort(8, 24) + """ + return _mk_fp_bin(Z3_mk_fpa_add, rm, a, b, ctx) + +def fpSub(rm, a, b, ctx=None): + """Create a Z3 floating-point subtraction expression. + + >>> s = FPSort(8, 24) + >>> rm = RNE() + >>> x = FP('x', s) + >>> y = FP('y', s) + >>> fpSub(rm, x, y) + fpSub(RNE(), x, y) + >>> fpSub(rm, x, y).sort() + FPSort(8, 24) + """ + return _mk_fp_bin(Z3_mk_fpa_sub, rm, a, b, ctx) + +def fpMul(rm, a, b, ctx=None): + """Create a Z3 floating-point multiplication expression. + + >>> s = FPSort(8, 24) + >>> rm = RNE() + >>> x = FP('x', s) + >>> y = FP('y', s) + >>> fpMul(rm, x, y) + fpMul(RNE(), x, y) + >>> fpMul(rm, x, y).sort() + FPSort(8, 24) + """ + return _mk_fp_bin(Z3_mk_fpa_mul, rm, a, b, ctx) + +def fpDiv(rm, a, b, ctx=None): + """Create a Z3 floating-point divison expression. + + >>> s = FPSort(8, 24) + >>> rm = RNE() + >>> x = FP('x', s) + >>> y = FP('y', s) + >>> fpDiv(rm, x, y) + fpDiv(RNE(), x, y) + >>> fpDiv(rm, x, y).sort() + FPSort(8, 24) + """ + return _mk_fp_bin(Z3_mk_fpa_div, rm, a, b, ctx) + +def fpRem(a, b, ctx=None): + """Create a Z3 floating-point remainder expression. + + >>> s = FPSort(8, 24) + >>> x = FP('x', s) + >>> y = FP('y', s) + >>> fpRem(x, y) + fpRem(x, y) + >>> fpRem(x, y).sort() + FPSort(8, 24) + """ + return _mk_fp_bin_norm(Z3_mk_fpa_rem, a, b, ctx) + +def fpMin(a, b, ctx=None): + """Create a Z3 floating-point minimium expression. + + >>> s = FPSort(8, 24) + >>> rm = RNE() + >>> x = FP('x', s) + >>> y = FP('y', s) + >>> fpMin(x, y) + fpMin(x, y) + >>> fpMin(x, y).sort() + FPSort(8, 24) + """ + return _mk_fp_bin_norm(Z3_mk_fpa_min, a, b, ctx) + +def fpMax(a, b, ctx=None): + """Create a Z3 floating-point maximum expression. + + >>> s = FPSort(8, 24) + >>> rm = RNE() + >>> x = FP('x', s) + >>> y = FP('y', s) + >>> fpMax(x, y) + fpMax(x, y) + >>> fpMax(x, y).sort() + FPSort(8, 24) + """ + return _mk_fp_bin_norm(Z3_mk_fpa_max, a, b, ctx) + +def fpFMA(rm, a, b, c, ctx=None): + """Create a Z3 floating-point fused multiply-add expression. + """ + return _mk_fp_tern(Z3_mk_fpa_fma, rm, a, b, c, ctx) + +def fpSqrt(rm, a, ctx=None): + """Create a Z3 floating-point square root expression. + """ + return _mk_fp_unary(Z3_mk_fpa_sqrt, rm, a, ctx) + +def fpRoundToIntegral(rm, a, ctx=None): + """Create a Z3 floating-point roundToIntegral expression. + """ + return _mk_fp_unary(Z3_mk_fpa_round_to_integral, rm, a, ctx) + +def fpIsNaN(a, ctx=None): + """Create a Z3 floating-point isNaN expression. + + >>> s = FPSort(8, 24) + >>> x = FP('x', s) + >>> y = FP('y', s) + >>> fpIsNaN(x) + fpIsNaN(x) + """ + return _mk_fp_unary_norm(Z3_mk_fpa_is_nan, a, ctx) + +def fpIsInf(a, ctx=None): + """Create a Z3 floating-point isInfinite expression. + + >>> s = FPSort(8, 24) + >>> x = FP('x', s) + >>> fpIsInf(x) + fpIsInf(x) + """ + return _mk_fp_unary_norm(Z3_mk_fpa_is_infinite, a, ctx) + +def fpIsZero(a, ctx=None): + """Create a Z3 floating-point isZero expression. + """ + return _mk_fp_unary_norm(Z3_mk_fpa_is_zero, a, ctx) + +def fpIsNormal(a, ctx=None): + """Create a Z3 floating-point isNormal expression. + """ + return _mk_fp_unary_norm(Z3_mk_fpa_is_normal, a, ctx) + +def fpIsSubnormal(a, ctx=None): + """Create a Z3 floating-point isSubnormal expression. + """ + return _mk_fp_unary_norm(Z3_mk_fpa_is_subnormal, a, ctx) + +def fpIsNegative(a, ctx=None): + """Create a Z3 floating-point isNegative expression. + """ + return _mk_fp_unary_norm(Z3_mk_fpa_is_negative, a, ctx) + +def fpIsPositive(a, ctx=None): + """Create a Z3 floating-point isPositive expression. + """ + return _mk_fp_unary_norm(Z3_mk_fpa_is_positive, a, ctx) + return FPRef(Z3_mk_fpa_is_positive(a.ctx_ref(), a.as_ast()), a.ctx) + +def _check_fp_args(a, b): + if __debug__: + _z3_assert(is_fp(a) or is_fp(b), "At least one of the arguments must be a Z3 floating-point expression") + +def fpLT(a, b, ctx=None): + """Create the Z3 floating-point expression `other < self`. + + >>> x, y = FPs('x y', FPSort(8, 24)) + >>> fpLT(x, y) + x < y + >>> (x < y).sexpr() + '(fp.lt x y)' + """ + return _mk_fp_bin_pred(Z3_mk_fpa_lt, a, b, ctx) + +def fpLEQ(a, b, ctx=None): + """Create the Z3 floating-point expression `other <= self`. + + >>> x, y = FPs('x y', FPSort(8, 24)) + >>> fpLEQ(x, y) + x <= y + >>> (x <= y).sexpr() + '(fp.leq x y)' + """ + return _mk_fp_bin_pred(Z3_mk_fpa_leq, a, b, ctx) + +def fpGT(a, b, ctx=None): + """Create the Z3 floating-point expression `other > self`. + + >>> x, y = FPs('x y', FPSort(8, 24)) + >>> fpGT(x, y) + x > y + >>> (x > y).sexpr() + '(fp.gt x y)' + """ + return _mk_fp_bin_pred(Z3_mk_fpa_gt, a, b, ctx) + +def fpGEQ(a, b, ctx=None): + """Create the Z3 floating-point expression `other >= self`. + + >>> x, y = FPs('x y', FPSort(8, 24)) + >>> fpGEQ(x, y) + x >= y + >>> (x >= y).sexpr() + '(fp.geq x y)' + """ + return _mk_fp_bin_pred(Z3_mk_fpa_geq, a, b, ctx) + +def fpEQ(a, b, ctx=None): + """Create the Z3 floating-point expression `fpEQ(other, self)`. + + >>> x, y = FPs('x y', FPSort(8, 24)) + >>> fpEQ(x, y) + fpEQ(x, y) + >>> fpEQ(x, y).sexpr() + '(fp.eq x y)' + """ + return _mk_fp_bin_pred(Z3_mk_fpa_eq, a, b, ctx) + +def fpNEQ(a, b, ctx=None): + """Create the Z3 floating-point expression `Not(fpEQ(other, self))`. + + >>> x, y = FPs('x y', FPSort(8, 24)) + >>> fpNEQ(x, y) + Not(fpEQ(x, y)) + >>> (x != y).sexpr() + '(distinct x y)' + """ + return Not(fpEQ(a, b, ctx)) + +def fpFP(sgn, exp, sig, ctx=None): + """Create the Z3 floating-point value `fpFP(sgn, sig, exp)` from the three bit-vectors sgn, sig, and exp. + + >>> s = FPSort(8, 24) + >>> x = fpFP(BitVecVal(1, 1), BitVecVal(2**7-1, 8), BitVecVal(2**22, 23)) + >>> print(x) + fpFP(1, 127, 4194304) + >>> xv = FPVal(-1.5, s) + >>> print(xv) + -1.5 + >>> slvr = Solver() + >>> slvr.add(fpEQ(x, xv)) + >>> slvr.check() + sat + >>> xv = FPVal(+1.5, s) + >>> print(xv) + 1.5 + >>> slvr = Solver() + >>> slvr.add(fpEQ(x, xv)) + >>> slvr.check() + unsat + """ + _z3_assert(is_bv(sgn) and is_bv(exp) and is_bv(sig), "sort mismatch") + _z3_assert(sgn.sort().size() == 1, "sort mismatch") + ctx = _get_ctx(ctx) + _z3_assert(ctx == sgn.ctx == exp.ctx == sig.ctx, "context mismatch") + return FPRef(Z3_mk_fpa_fp(ctx.ref(), sgn.ast, exp.ast, sig.ast), ctx) + +def fpToFP(a1, a2=None, a3=None, ctx=None): + """Create a Z3 floating-point conversion expression from other term sorts + to floating-point. + + From a bit-vector term in IEEE 754-2008 format: + >>> x = FPVal(1.0, Float32()) + >>> x_bv = fpToIEEEBV(x) + >>> simplify(fpToFP(x_bv, Float32())) + 1 + + From a floating-point term with different precision: + >>> x = FPVal(1.0, Float32()) + >>> x_db = fpToFP(RNE(), x, Float64()) + >>> x_db.sort() + FPSort(11, 53) + + From a real term: + >>> x_r = RealVal(1.5) + >>> simplify(fpToFP(RNE(), x_r, Float32())) + 1.5 + + From a signed bit-vector term: + >>> x_signed = BitVecVal(-5, BitVecSort(32)) + >>> simplify(fpToFP(RNE(), x_signed, Float32())) + -1.25*(2**2) + """ + ctx = _get_ctx(ctx) + if is_bv(a1) and is_fp_sort(a2): + return FPRef(Z3_mk_fpa_to_fp_bv(ctx.ref(), a1.ast, a2.ast), ctx) + elif is_fprm(a1) and is_fp(a2) and is_fp_sort(a3): + return FPRef(Z3_mk_fpa_to_fp_float(ctx.ref(), a1.ast, a2.ast, a3.ast), ctx) + elif is_fprm(a1) and is_real(a2) and is_fp_sort(a3): + return FPRef(Z3_mk_fpa_to_fp_real(ctx.ref(), a1.ast, a2.ast, a3.ast), ctx) + elif is_fprm(a1) and is_bv(a2) and is_fp_sort(a3): + return FPRef(Z3_mk_fpa_to_fp_signed(ctx.ref(), a1.ast, a2.ast, a3.ast), ctx) + else: + raise Z3Exception("Unsupported combination of arguments for conversion to floating-point term.") + +def fpBVToFP(v, sort, ctx=None): + """Create a Z3 floating-point conversion expression that represents the + conversion from a bit-vector term to a floating-point term. + + >>> x_bv = BitVecVal(0x3F800000, 32) + >>> x_fp = fpBVToFP(x_bv, Float32()) + >>> x_fp + fpToFP(1065353216) + >>> simplify(x_fp) + 1 + """ + _z3_assert(is_bv(v), "First argument must be a Z3 floating-point rounding mode expression.") + _z3_assert(is_fp_sort(sort), "Second argument must be a Z3 floating-point sort.") + ctx = _get_ctx(ctx) + return FPRef(Z3_mk_fpa_to_fp_bv(ctx.ref(), v.ast, sort.ast), ctx) + +def fpFPToFP(rm, v, sort, ctx=None): + """Create a Z3 floating-point conversion expression that represents the + conversion from a floating-point term to a floating-point term of different precision. + + >>> x_sgl = FPVal(1.0, Float32()) + >>> x_dbl = fpFPToFP(RNE(), x_sgl, Float64()) + >>> x_dbl + fpToFP(RNE(), 1) + >>> simplify(x_dbl) + 1 + >>> x_dbl.sort() + FPSort(11, 53) + """ + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression.") + _z3_assert(is_fp(v), "Second argument must be a Z3 floating-point expression.") + _z3_assert(is_fp_sort(sort), "Third argument must be a Z3 floating-point sort.") + ctx = _get_ctx(ctx) + return FPRef(Z3_mk_fpa_to_fp_float(ctx.ref(), rm.ast, v.ast, sort.ast), ctx) + +def fpRealToFP(rm, v, sort, ctx=None): + """Create a Z3 floating-point conversion expression that represents the + conversion from a real term to a floating-point term. + + >>> x_r = RealVal(1.5) + >>> x_fp = fpRealToFP(RNE(), x_r, Float32()) + >>> x_fp + fpToFP(RNE(), 3/2) + >>> simplify(x_fp) + 1.5 + """ + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression.") + _z3_assert(is_real(v), "Second argument must be a Z3 expression or real sort.") + _z3_assert(is_fp_sort(sort), "Third argument must be a Z3 floating-point sort.") + ctx = _get_ctx(ctx) + return FPRef(Z3_mk_fpa_to_fp_real(ctx.ref(), rm.ast, v.ast, sort.ast), ctx) + +def fpSignedToFP(rm, v, sort, ctx=None): + """Create a Z3 floating-point conversion expression that represents the + conversion from a signed bit-vector term (encoding an integer) to a floating-point term. + + >>> x_signed = BitVecVal(-5, BitVecSort(32)) + >>> x_fp = fpSignedToFP(RNE(), x_signed, Float32()) + >>> x_fp + fpToFP(RNE(), 4294967291) + >>> simplify(x_fp) + -1.25*(2**2) + """ + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression.") + _z3_assert(is_bv(v), "Second argument must be a Z3 expression or real sort.") + _z3_assert(is_fp_sort(sort), "Third argument must be a Z3 floating-point sort.") + ctx = _get_ctx(ctx) + return FPRef(Z3_mk_fpa_to_fp_signed(ctx.ref(), rm.ast, v.ast, sort.ast), ctx) + +def fpUnsignedToFP(rm, v, sort, ctx=None): + """Create a Z3 floating-point conversion expression that represents the + conversion from an unsigned bit-vector term (encoding an integer) to a floating-point term. + + >>> x_signed = BitVecVal(-5, BitVecSort(32)) + >>> x_fp = fpUnsignedToFP(RNE(), x_signed, Float32()) + >>> x_fp + fpToFPUnsigned(RNE(), 4294967291) + >>> simplify(x_fp) + 1*(2**32) + """ + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression.") + _z3_assert(is_bv(v), "Second argument must be a Z3 expression or real sort.") + _z3_assert(is_fp_sort(sort), "Third argument must be a Z3 floating-point sort.") + ctx = _get_ctx(ctx) + return FPRef(Z3_mk_fpa_to_fp_unsigned(ctx.ref(), rm.ast, v.ast, sort.ast), ctx) + +def fpToFPUnsigned(rm, x, s, ctx=None): + """Create a Z3 floating-point conversion expression, from unsigned bit-vector to floating-point expression.""" + if __debug__: + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression") + _z3_assert(is_bv(x), "Second argument must be a Z3 bit-vector expression") + _z3_assert(is_fp_sort(s), "Third argument must be Z3 floating-point sort") + ctx = _get_ctx(ctx) + return FPRef(Z3_mk_fpa_to_fp_unsigned(ctx.ref(), rm.ast, x.ast, s.ast), ctx) + +def fpToSBV(rm, x, s, ctx=None): + """Create a Z3 floating-point conversion expression, from floating-point expression to signed bit-vector. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = fpToSBV(RTZ(), x, BitVecSort(32)) + >>> print(is_fp(x)) + True + >>> print(is_bv(y)) + True + >>> print(is_fp(y)) + False + >>> print(is_bv(x)) + False + """ + if __debug__: + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression") + _z3_assert(is_fp(x), "Second argument must be a Z3 floating-point expression") + _z3_assert(is_bv_sort(s), "Third argument must be Z3 bit-vector sort") + ctx = _get_ctx(ctx) + return BitVecRef(Z3_mk_fpa_to_sbv(ctx.ref(), rm.ast, x.ast, s.size()), ctx) + +def fpToUBV(rm, x, s, ctx=None): + """Create a Z3 floating-point conversion expression, from floating-point expression to unsigned bit-vector. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = fpToUBV(RTZ(), x, BitVecSort(32)) + >>> print(is_fp(x)) + True + >>> print(is_bv(y)) + True + >>> print(is_fp(y)) + False + >>> print(is_bv(x)) + False + """ + if __debug__: + _z3_assert(is_fprm(rm), "First argument must be a Z3 floating-point rounding mode expression") + _z3_assert(is_fp(x), "Second argument must be a Z3 floating-point expression") + _z3_assert(is_bv_sort(s), "Third argument must be Z3 bit-vector sort") + ctx = _get_ctx(ctx) + return BitVecRef(Z3_mk_fpa_to_ubv(ctx.ref(), rm.ast, x.ast, s.size()), ctx) + +def fpToReal(x, ctx=None): + """Create a Z3 floating-point conversion expression, from floating-point expression to real. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = fpToReal(x) + >>> print(is_fp(x)) + True + >>> print(is_real(y)) + True + >>> print(is_fp(y)) + False + >>> print(is_real(x)) + False + """ + if __debug__: + _z3_assert(is_fp(x), "First argument must be a Z3 floating-point expression") + ctx = _get_ctx(ctx) + return ArithRef(Z3_mk_fpa_to_real(ctx.ref(), x.ast), ctx) + +def fpToIEEEBV(x, ctx=None): + """\brief Conversion of a floating-point term into a bit-vector term in IEEE 754-2008 format. + + The size of the resulting bit-vector is automatically determined. + + Note that IEEE 754-2008 allows multiple different representations of NaN. This conversion + knows only one NaN and it will always produce the same bit-vector represenatation of + that NaN. + + >>> x = FP('x', FPSort(8, 24)) + >>> y = fpToIEEEBV(x) + >>> print(is_fp(x)) + True + >>> print(is_bv(y)) + True + >>> print(is_fp(y)) + False + >>> print(is_bv(x)) + False + """ + if __debug__: + _z3_assert(is_fp(x), "First argument must be a Z3 floating-point expression") + ctx = _get_ctx(ctx) + return BitVecRef(Z3_mk_fpa_to_ieee_bv(ctx.ref(), x.ast), ctx) + + + +######################################### +# +# Strings, Sequences and Regular expressions +# +######################################### + +class SeqSortRef(SortRef): + """Sequence sort.""" + + def is_string(self): + """Determine if sort is a string + >>> s = StringSort() + >>> s.is_string() + True + >>> s = SeqSort(IntSort()) + >>> s.is_string() + False + """ + return Z3_is_string_sort(self.ctx_ref(), self.ast) + + +def StringSort(ctx=None): + """Create a string sort + >>> s = StringSort() + >>> print(s) + String + """ + ctx = _get_ctx(ctx) + return SeqSortRef(Z3_mk_string_sort(ctx.ref()), ctx) + + +def SeqSort(s): + """Create a sequence sort over elements provided in the argument + >>> s = SeqSort(IntSort()) + >>> s == Unit(IntVal(1)).sort() + True + """ + return SeqSortRef(Z3_mk_seq_sort(s.ctx_ref(), s.ast), s.ctx) + +class SeqRef(ExprRef): + """Sequence expression.""" + + def sort(self): + return SeqSortRef(Z3_get_sort(self.ctx_ref(), self.as_ast()), self.ctx) + + def __add__(self, other): + return Concat(self, other) + + def __radd__(self, other): + return Concat(other, self) + + def __getitem__(self, i): + if _is_int(i): + i = IntVal(i, self.ctx) + return SeqRef(Z3_mk_seq_at(self.ctx_ref(), self.as_ast(), i.as_ast()), self.ctx) + + def is_string(self): + return Z3_is_string_sort(self.ctx_ref(), Z3_get_sort(self.ctx_ref(), self.as_ast())) + + def is_string_value(self): + return Z3_is_string(self.ctx_ref(), self.as_ast()) + + def as_string(self): + """Return a string representation of sequence expression.""" + return Z3_ast_to_string(self.ctx_ref(), self.as_ast()) + + +def _coerce_seq(s, ctx=None): + if isinstance(s, str): + ctx = _get_ctx(ctx) + s = StringVal(s, ctx) + if not is_expr(s): + raise Z3Exception("Non-expression passed as a sequence") + if not is_seq(s): + raise Z3Exception("Non-sequence passed as a sequence") + return s + +def _get_ctx2(a, b, ctx=None): + if is_expr(a): + return a.ctx + if is_expr(b): + return b.ctx + if ctx is None: + ctx = main_ctx() + return ctx + +def is_seq(a): + """Return `True` if `a` is a Z3 sequence expression. + >>> print (is_seq(Unit(IntVal(0)))) + True + >>> print (is_seq(StringVal("abc"))) + True + """ + return isinstance(a, SeqRef) + +def is_string(a): + """Return `True` if `a` is a Z3 string expression. + >>> print (is_string(StringVal("ab"))) + True + """ + return isinstance(a, SeqRef) and a.is_string() + +def is_string_value(a): + """return 'True' if 'a' is a Z3 string constant expression. + >>> print (is_string_value(StringVal("a"))) + True + >>> print (is_string_value(StringVal("a") + StringVal("b"))) + False + """ + return isinstance(a, SeqRef) and a.is_string_value() + + +def StringVal(s, ctx=None): + """create a string expression""" + ctx = _get_ctx(ctx) + return SeqRef(Z3_mk_string(ctx.ref(), s), ctx) + +def String(name, ctx=None): + """Return a string constant named `name`. If `ctx=None`, then the global context is used. + + >>> x = String('x') + """ + ctx = _get_ctx(ctx) + return SeqRef(Z3_mk_const(ctx.ref(), to_symbol(name, ctx), StringSort(ctx).ast), ctx) + +def Strings(names, ctx=None): + """Return a tuple of String constants. """ + ctx = _get_ctx(ctx) + if isinstance(names, str): + names = names.split(" ") + return [String(name, ctx) for name in names] + +def Empty(s): + """Create the empty sequence of the given sort + >>> e = Empty(StringSort()) + >>> print(e) + "" + >>> e2 = StringVal("") + >>> print(e.eq(e2)) + True + >>> e3 = Empty(SeqSort(IntSort())) + >>> print(e3) + seq.empty + >>> e4 = Empty(ReSort(SeqSort(IntSort()))) + >>> print(e4) + re.empty + """ + if isinstance(s, SeqSortRef): + return SeqRef(Z3_mk_seq_empty(s.ctx_ref(), s.ast), s.ctx) + if isinstance(s, ReSortRef): + return ReRef(Z3_mk_re_empty(s.ctx_ref(), s.ast), s.ctx) + raise Z3Exception("Non-sequence, non-regular expression sort passed to Empty") + +def Full(s): + """Create the regular expression that accepts the universal langauge + >>> e = Full(ReSort(SeqSort(IntSort()))) + >>> print(e) + re.all + >>> e1 = Full(ReSort(StringSort())) + >>> print(e1) + re.allchar + """ + if isinstance(s, ReSortRef): + return ReRef(Z3_mk_re_full(s.ctx_ref(), s.ast), s.ctx) + raise Z3Exception("Non-sequence, non-regular expression sort passed to Full") + + +def Unit(a): + """Create a singleton sequence""" + return SeqRef(Z3_mk_seq_unit(a.ctx_ref(), a.as_ast()), a.ctx) + +def PrefixOf(a, b): + """Check if 'a' is a prefix of 'b' + >>> s1 = PrefixOf("ab", "abc") + >>> simplify(s1) + True + >>> s2 = PrefixOf("bc", "abc") + >>> simplify(s2) + False + """ + ctx = _get_ctx2(a, b) + a = _coerce_seq(a, ctx) + b = _coerce_seq(b, ctx) + return BoolRef(Z3_mk_seq_prefix(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def SuffixOf(a, b): + """Check if 'a' is a suffix of 'b' + >>> s1 = SuffixOf("ab", "abc") + >>> simplify(s1) + False + >>> s2 = SuffixOf("bc", "abc") + >>> simplify(s2) + True + """ + ctx = _get_ctx2(a, b) + a = _coerce_seq(a, ctx) + b = _coerce_seq(b, ctx) + return BoolRef(Z3_mk_seq_suffix(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + +def Contains(a, b): + """Check if 'a' contains 'b' + >>> s1 = Contains("abc", "ab") + >>> simplify(s1) + True + >>> s2 = Contains("abc", "bc") + >>> simplify(s2) + True + >>> x, y, z = Strings('x y z') + >>> s3 = Contains(Concat(x,y,z), y) + >>> simplify(s3) + True + """ + ctx = _get_ctx2(a, b) + a = _coerce_seq(a, ctx) + b = _coerce_seq(b, ctx) + return BoolRef(Z3_mk_seq_contains(a.ctx_ref(), a.as_ast(), b.as_ast()), a.ctx) + + +def Replace(s, src, dst): + """Replace the first occurrence of 'src' by 'dst' in 's' + >>> r = Replace("aaa", "a", "b") + >>> simplify(r) + "baa" + """ + ctx = _get_ctx2(dst, s) + if ctx is None and is_expr(src): + ctx = src.ctx + src = _coerce_seq(src, ctx) + dst = _coerce_seq(dst, ctx) + s = _coerce_seq(s, ctx) + return SeqRef(Z3_mk_seq_replace(src.ctx_ref(), s.as_ast(), src.as_ast(), dst.as_ast()), s.ctx) + +def IndexOf(s, substr): + return IndexOf(s, substr, IntVal(0)) + +def IndexOf(s, substr, offset): + """Retrieve the index of substring within a string starting at a specified offset. + >>> simplify(IndexOf("abcabc", "bc", 0)) + 1 + >>> simplify(IndexOf("abcabc", "bc", 2)) + 4 + """ + ctx = None + if is_expr(offset): + ctx = offset.ctx + ctx = _get_ctx2(s, substr, ctx) + s = _coerce_seq(s, ctx) + substr = _coerce_seq(substr, ctx) + if _is_int(offset): + offset = IntVal(offset, ctx) + return SeqRef(Z3_mk_seq_index(s.ctx_ref(), s.as_ast(), substr.as_ast(), offset.as_ast()), s.ctx) + +def Length(s): + """Obtain the length of a sequence 's' + >>> l = Length(StringVal("abc")) + >>> simplify(l) + 3 + """ + s = _coerce_seq(s) + return ArithRef(Z3_mk_seq_length(s.ctx_ref(), s.as_ast()), s.ctx) + +def StrToInt(s): + """Convert string expression to integer + >>> a = StrToInt("1") + >>> simplify(1 == a) + True + >>> b = StrToInt("2") + >>> simplify(1 == b) + False + >>> c = StrToInt(IntToStr(2)) + >>> simplify(1 == c) + False + """ + s = _coerce_seq(s) + return ArithRef(Z3_mk_str_to_int(s.ctx_ref(), s.as_ast()), s.ctx) + + +def IntToStr(s): + """Convert integer expression to string""" + if not is_expr(s): + s = _py2expr(s) + return SeqRef(Z3_mk_int_to_str(s.ctx_ref(), s.as_ast()), s.ctx) + + +def Re(s, ctx=None): + """The regular expression that accepts sequence 's' + >>> s1 = Re("ab") + >>> s2 = Re(StringVal("ab")) + >>> s3 = Re(Unit(BoolVal(True))) + """ + s = _coerce_seq(s, ctx) + return ReRef(Z3_mk_seq_to_re(s.ctx_ref(), s.as_ast()), s.ctx) + + + + +## Regular expressions + +class ReSortRef(SortRef): + """Regular expression sort.""" + + +def ReSort(s): + if is_ast(s): + return ReSortRef(Z3_mk_re_sort(s.ctx.ref(), s.ast), s.ctx) + if s is None or isinstance(s, Context): + ctx = _get_ctx(s) + return ReSortRef(Z3_mk_re_sort(ctx.ref(), Z3_mk_string_sort(ctx.ref())), s.ctx) + raise Z3Exception("Regular expression sort constructor expects either a string or a context or no argument") + + +class ReRef(ExprRef): + """Regular expressions.""" + + def __add__(self, other): + return Union(self, other) + + +def is_re(s): + return isinstance(s, ReRef) + + +def InRe(s, re): + """Create regular expression membership test + >>> re = Union(Re("a"),Re("b")) + >>> print (simplify(InRe("a", re))) + True + >>> print (simplify(InRe("b", re))) + True + >>> print (simplify(InRe("c", re))) + False + """ + s = _coerce_seq(s, re.ctx) + return BoolRef(Z3_mk_seq_in_re(s.ctx_ref(), s.as_ast(), re.as_ast()), s.ctx) + +def Union(*args): + """Create union of regular expressions. + >>> re = Union(Re("a"), Re("b"), Re("c")) + >>> print (simplify(InRe("d", re))) + False + """ + args = _get_args(args) + sz = len(args) + if __debug__: + _z3_assert(sz > 0, "At least one argument expected.") + _z3_assert(all([is_re(a) for a in args]), "All arguments must be regular expressions.") + if sz == 1: + return args[0] + ctx = args[0].ctx + v = (Ast * sz)() + for i in range(sz): + v[i] = args[i].as_ast() + return ReRef(Z3_mk_re_union(ctx.ref(), sz, v), ctx) + +def Plus(re): + """Create the regular expression accepting one or more repetitions of argument. + >>> re = Plus(Re("a")) + >>> print(simplify(InRe("aa", re))) + True + >>> print(simplify(InRe("ab", re))) + False + >>> print(simplify(InRe("", re))) + False + """ + return ReRef(Z3_mk_re_plus(re.ctx_ref(), re.as_ast()), re.ctx) + +def Option(re): + """Create the regular expression that optionally accepts the argument. + >>> re = Option(Re("a")) + >>> print(simplify(InRe("a", re))) + True + >>> print(simplify(InRe("", re))) + True + >>> print(simplify(InRe("aa", re))) + False + """ + return ReRef(Z3_mk_re_option(re.ctx_ref(), re.as_ast()), re.ctx) + +def Complement(re): + """Create the complement regular expression.""" + return ReRef(Z3_mk_re_complement(re.ctx_ref(), re.as_ast()), re.ctx) + +def Star(re): + """Create the regular expression accepting zero or more repetitions of argument. + >>> re = Star(Re("a")) + >>> print(simplify(InRe("aa", re))) + True + >>> print(simplify(InRe("ab", re))) + False + >>> print(simplify(InRe("", re))) + True + """ + return ReRef(Z3_mk_re_star(re.ctx_ref(), re.as_ast()), re.ctx) + +def Loop(re, lo, hi=0): + """Create the regular expression accepting between a lower and upper bound repetitions + >>> re = Loop(Re("a"), 1, 3) + >>> print(simplify(InRe("aa", re))) + True + >>> print(simplify(InRe("aaaa", re))) + False + >>> print(simplify(InRe("", re))) + False + """ + return ReRef(Z3_mk_re_loop(re.ctx_ref(), re.as_ast(), lo, hi), re.ctx) diff --git a/rba.tool.core/lib32/z3/python/z3/z3.pyc b/rba.tool.core/lib32/z3/python/z3/z3.pyc Binary files differnew file mode 100644 index 0000000..1673a4c --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3.pyc diff --git a/rba.tool.core/lib32/z3/python/z3/z3consts.py b/rba.tool.core/lib32/z3/python/z3/z3consts.py new file mode 100644 index 0000000..c98a9fe --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3consts.py @@ -0,0 +1,323 @@ +# Automatically generated file + +# enum Z3_lbool +Z3_L_FALSE = -1 +Z3_L_UNDEF = 0 +Z3_L_TRUE = 1 + +# enum Z3_symbol_kind +Z3_INT_SYMBOL = 0 +Z3_STRING_SYMBOL = 1 + +# enum Z3_parameter_kind +Z3_PARAMETER_INT = 0 +Z3_PARAMETER_DOUBLE = 1 +Z3_PARAMETER_RATIONAL = 2 +Z3_PARAMETER_SYMBOL = 3 +Z3_PARAMETER_SORT = 4 +Z3_PARAMETER_AST = 5 +Z3_PARAMETER_FUNC_DECL = 6 + +# enum Z3_sort_kind +Z3_UNINTERPRETED_SORT = 0 +Z3_BOOL_SORT = 1 +Z3_INT_SORT = 2 +Z3_REAL_SORT = 3 +Z3_BV_SORT = 4 +Z3_ARRAY_SORT = 5 +Z3_DATATYPE_SORT = 6 +Z3_RELATION_SORT = 7 +Z3_FINITE_DOMAIN_SORT = 8 +Z3_FLOATING_POINT_SORT = 9 +Z3_ROUNDING_MODE_SORT = 10 +Z3_SEQ_SORT = 11 +Z3_RE_SORT = 12 +Z3_UNKNOWN_SORT = 1000 + +# enum Z3_ast_kind +Z3_NUMERAL_AST = 0 +Z3_APP_AST = 1 +Z3_VAR_AST = 2 +Z3_QUANTIFIER_AST = 3 +Z3_SORT_AST = 4 +Z3_FUNC_DECL_AST = 5 +Z3_UNKNOWN_AST = 1000 + +# enum Z3_decl_kind +Z3_OP_TRUE = 256 +Z3_OP_FALSE = 257 +Z3_OP_EQ = 258 +Z3_OP_DISTINCT = 259 +Z3_OP_ITE = 260 +Z3_OP_AND = 261 +Z3_OP_OR = 262 +Z3_OP_IFF = 263 +Z3_OP_XOR = 264 +Z3_OP_NOT = 265 +Z3_OP_IMPLIES = 266 +Z3_OP_OEQ = 267 +Z3_OP_INTERP = 268 +Z3_OP_ANUM = 512 +Z3_OP_AGNUM = 513 +Z3_OP_LE = 514 +Z3_OP_GE = 515 +Z3_OP_LT = 516 +Z3_OP_GT = 517 +Z3_OP_ADD = 518 +Z3_OP_SUB = 519 +Z3_OP_UMINUS = 520 +Z3_OP_MUL = 521 +Z3_OP_DIV = 522 +Z3_OP_IDIV = 523 +Z3_OP_REM = 524 +Z3_OP_MOD = 525 +Z3_OP_TO_REAL = 526 +Z3_OP_TO_INT = 527 +Z3_OP_IS_INT = 528 +Z3_OP_POWER = 529 +Z3_OP_STORE = 768 +Z3_OP_SELECT = 769 +Z3_OP_CONST_ARRAY = 770 +Z3_OP_ARRAY_MAP = 771 +Z3_OP_ARRAY_DEFAULT = 772 +Z3_OP_SET_UNION = 773 +Z3_OP_SET_INTERSECT = 774 +Z3_OP_SET_DIFFERENCE = 775 +Z3_OP_SET_COMPLEMENT = 776 +Z3_OP_SET_SUBSET = 777 +Z3_OP_AS_ARRAY = 778 +Z3_OP_ARRAY_EXT = 779 +Z3_OP_BNUM = 1024 +Z3_OP_BIT1 = 1025 +Z3_OP_BIT0 = 1026 +Z3_OP_BNEG = 1027 +Z3_OP_BADD = 1028 +Z3_OP_BSUB = 1029 +Z3_OP_BMUL = 1030 +Z3_OP_BSDIV = 1031 +Z3_OP_BUDIV = 1032 +Z3_OP_BSREM = 1033 +Z3_OP_BUREM = 1034 +Z3_OP_BSMOD = 1035 +Z3_OP_BSDIV0 = 1036 +Z3_OP_BUDIV0 = 1037 +Z3_OP_BSREM0 = 1038 +Z3_OP_BUREM0 = 1039 +Z3_OP_BSMOD0 = 1040 +Z3_OP_ULEQ = 1041 +Z3_OP_SLEQ = 1042 +Z3_OP_UGEQ = 1043 +Z3_OP_SGEQ = 1044 +Z3_OP_ULT = 1045 +Z3_OP_SLT = 1046 +Z3_OP_UGT = 1047 +Z3_OP_SGT = 1048 +Z3_OP_BAND = 1049 +Z3_OP_BOR = 1050 +Z3_OP_BNOT = 1051 +Z3_OP_BXOR = 1052 +Z3_OP_BNAND = 1053 +Z3_OP_BNOR = 1054 +Z3_OP_BXNOR = 1055 +Z3_OP_CONCAT = 1056 +Z3_OP_SIGN_EXT = 1057 +Z3_OP_ZERO_EXT = 1058 +Z3_OP_EXTRACT = 1059 +Z3_OP_REPEAT = 1060 +Z3_OP_BREDOR = 1061 +Z3_OP_BREDAND = 1062 +Z3_OP_BCOMP = 1063 +Z3_OP_BSHL = 1064 +Z3_OP_BLSHR = 1065 +Z3_OP_BASHR = 1066 +Z3_OP_ROTATE_LEFT = 1067 +Z3_OP_ROTATE_RIGHT = 1068 +Z3_OP_EXT_ROTATE_LEFT = 1069 +Z3_OP_EXT_ROTATE_RIGHT = 1070 +Z3_OP_BIT2BOOL = 1071 +Z3_OP_INT2BV = 1072 +Z3_OP_BV2INT = 1073 +Z3_OP_CARRY = 1074 +Z3_OP_XOR3 = 1075 +Z3_OP_BSMUL_NO_OVFL = 1076 +Z3_OP_BUMUL_NO_OVFL = 1077 +Z3_OP_BSMUL_NO_UDFL = 1078 +Z3_OP_BSDIV_I = 1079 +Z3_OP_BUDIV_I = 1080 +Z3_OP_BSREM_I = 1081 +Z3_OP_BUREM_I = 1082 +Z3_OP_BSMOD_I = 1083 +Z3_OP_PR_UNDEF = 1280 +Z3_OP_PR_TRUE = 1281 +Z3_OP_PR_ASSERTED = 1282 +Z3_OP_PR_GOAL = 1283 +Z3_OP_PR_MODUS_PONENS = 1284 +Z3_OP_PR_REFLEXIVITY = 1285 +Z3_OP_PR_SYMMETRY = 1286 +Z3_OP_PR_TRANSITIVITY = 1287 +Z3_OP_PR_TRANSITIVITY_STAR = 1288 +Z3_OP_PR_MONOTONICITY = 1289 +Z3_OP_PR_QUANT_INTRO = 1290 +Z3_OP_PR_DISTRIBUTIVITY = 1291 +Z3_OP_PR_AND_ELIM = 1292 +Z3_OP_PR_NOT_OR_ELIM = 1293 +Z3_OP_PR_REWRITE = 1294 +Z3_OP_PR_REWRITE_STAR = 1295 +Z3_OP_PR_PULL_QUANT = 1296 +Z3_OP_PR_PULL_QUANT_STAR = 1297 +Z3_OP_PR_PUSH_QUANT = 1298 +Z3_OP_PR_ELIM_UNUSED_VARS = 1299 +Z3_OP_PR_DER = 1300 +Z3_OP_PR_QUANT_INST = 1301 +Z3_OP_PR_HYPOTHESIS = 1302 +Z3_OP_PR_LEMMA = 1303 +Z3_OP_PR_UNIT_RESOLUTION = 1304 +Z3_OP_PR_IFF_TRUE = 1305 +Z3_OP_PR_IFF_FALSE = 1306 +Z3_OP_PR_COMMUTATIVITY = 1307 +Z3_OP_PR_DEF_AXIOM = 1308 +Z3_OP_PR_DEF_INTRO = 1309 +Z3_OP_PR_APPLY_DEF = 1310 +Z3_OP_PR_IFF_OEQ = 1311 +Z3_OP_PR_NNF_POS = 1312 +Z3_OP_PR_NNF_NEG = 1313 +Z3_OP_PR_NNF_STAR = 1314 +Z3_OP_PR_CNF_STAR = 1315 +Z3_OP_PR_SKOLEMIZE = 1316 +Z3_OP_PR_MODUS_PONENS_OEQ = 1317 +Z3_OP_PR_TH_LEMMA = 1318 +Z3_OP_PR_HYPER_RESOLVE = 1319 +Z3_OP_RA_STORE = 1536 +Z3_OP_RA_EMPTY = 1537 +Z3_OP_RA_IS_EMPTY = 1538 +Z3_OP_RA_JOIN = 1539 +Z3_OP_RA_UNION = 1540 +Z3_OP_RA_WIDEN = 1541 +Z3_OP_RA_PROJECT = 1542 +Z3_OP_RA_FILTER = 1543 +Z3_OP_RA_NEGATION_FILTER = 1544 +Z3_OP_RA_RENAME = 1545 +Z3_OP_RA_COMPLEMENT = 1546 +Z3_OP_RA_SELECT = 1547 +Z3_OP_RA_CLONE = 1548 +Z3_OP_FD_CONSTANT = 1549 +Z3_OP_FD_LT = 1550 +Z3_OP_SEQ_UNIT = 1551 +Z3_OP_SEQ_EMPTY = 1552 +Z3_OP_SEQ_CONCAT = 1553 +Z3_OP_SEQ_PREFIX = 1554 +Z3_OP_SEQ_SUFFIX = 1555 +Z3_OP_SEQ_CONTAINS = 1556 +Z3_OP_SEQ_EXTRACT = 1557 +Z3_OP_SEQ_REPLACE = 1558 +Z3_OP_SEQ_AT = 1559 +Z3_OP_SEQ_LENGTH = 1560 +Z3_OP_SEQ_INDEX = 1561 +Z3_OP_SEQ_TO_RE = 1562 +Z3_OP_SEQ_IN_RE = 1563 +Z3_OP_STR_TO_INT = 1564 +Z3_OP_INT_TO_STR = 1565 +Z3_OP_RE_PLUS = 1566 +Z3_OP_RE_STAR = 1567 +Z3_OP_RE_OPTION = 1568 +Z3_OP_RE_CONCAT = 1569 +Z3_OP_RE_UNION = 1570 +Z3_OP_RE_RANGE = 1571 +Z3_OP_RE_LOOP = 1572 +Z3_OP_RE_INTERSECT = 1573 +Z3_OP_RE_EMPTY_SET = 1574 +Z3_OP_RE_FULL_SET = 1575 +Z3_OP_RE_COMPLEMENT = 1576 +Z3_OP_LABEL = 1792 +Z3_OP_LABEL_LIT = 1793 +Z3_OP_DT_CONSTRUCTOR = 2048 +Z3_OP_DT_RECOGNISER = 2049 +Z3_OP_DT_ACCESSOR = 2050 +Z3_OP_DT_UPDATE_FIELD = 2051 +Z3_OP_PB_AT_MOST = 2304 +Z3_OP_PB_AT_LEAST = 2305 +Z3_OP_PB_LE = 2306 +Z3_OP_PB_GE = 2307 +Z3_OP_PB_EQ = 2308 +Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN = 2309 +Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY = 2310 +Z3_OP_FPA_RM_TOWARD_POSITIVE = 2311 +Z3_OP_FPA_RM_TOWARD_NEGATIVE = 2312 +Z3_OP_FPA_RM_TOWARD_ZERO = 2313 +Z3_OP_FPA_NUM = 2314 +Z3_OP_FPA_PLUS_INF = 2315 +Z3_OP_FPA_MINUS_INF = 2316 +Z3_OP_FPA_NAN = 2317 +Z3_OP_FPA_PLUS_ZERO = 2318 +Z3_OP_FPA_MINUS_ZERO = 2319 +Z3_OP_FPA_ADD = 2320 +Z3_OP_FPA_SUB = 2321 +Z3_OP_FPA_NEG = 2322 +Z3_OP_FPA_MUL = 2323 +Z3_OP_FPA_DIV = 2324 +Z3_OP_FPA_REM = 2325 +Z3_OP_FPA_ABS = 2326 +Z3_OP_FPA_MIN = 2327 +Z3_OP_FPA_MAX = 2328 +Z3_OP_FPA_FMA = 2329 +Z3_OP_FPA_SQRT = 2330 +Z3_OP_FPA_ROUND_TO_INTEGRAL = 2331 +Z3_OP_FPA_EQ = 2332 +Z3_OP_FPA_LT = 2333 +Z3_OP_FPA_GT = 2334 +Z3_OP_FPA_LE = 2335 +Z3_OP_FPA_GE = 2336 +Z3_OP_FPA_IS_NAN = 2337 +Z3_OP_FPA_IS_INF = 2338 +Z3_OP_FPA_IS_ZERO = 2339 +Z3_OP_FPA_IS_NORMAL = 2340 +Z3_OP_FPA_IS_SUBNORMAL = 2341 +Z3_OP_FPA_IS_NEGATIVE = 2342 +Z3_OP_FPA_IS_POSITIVE = 2343 +Z3_OP_FPA_FP = 2344 +Z3_OP_FPA_TO_FP = 2345 +Z3_OP_FPA_TO_FP_UNSIGNED = 2346 +Z3_OP_FPA_TO_UBV = 2347 +Z3_OP_FPA_TO_SBV = 2348 +Z3_OP_FPA_TO_REAL = 2349 +Z3_OP_FPA_TO_IEEE_BV = 2350 +Z3_OP_FPA_BVWRAP = 2351 +Z3_OP_FPA_BV2RM = 2352 +Z3_OP_INTERNAL = 2353 +Z3_OP_UNINTERPRETED = 2354 + +# enum Z3_param_kind +Z3_PK_UINT = 0 +Z3_PK_BOOL = 1 +Z3_PK_DOUBLE = 2 +Z3_PK_SYMBOL = 3 +Z3_PK_STRING = 4 +Z3_PK_OTHER = 5 +Z3_PK_INVALID = 6 + +# enum Z3_ast_print_mode +Z3_PRINT_SMTLIB_FULL = 0 +Z3_PRINT_LOW_LEVEL = 1 +Z3_PRINT_SMTLIB2_COMPLIANT = 2 + +# enum Z3_error_code +Z3_OK = 0 +Z3_SORT_ERROR = 1 +Z3_IOB = 2 +Z3_INVALID_ARG = 3 +Z3_PARSER_ERROR = 4 +Z3_NO_PARSER = 5 +Z3_INVALID_PATTERN = 6 +Z3_MEMOUT_FAIL = 7 +Z3_FILE_ACCESS_ERROR = 8 +Z3_INTERNAL_FATAL = 9 +Z3_INVALID_USAGE = 10 +Z3_DEC_REF_ERROR = 11 +Z3_EXCEPTION = 12 + +# enum Z3_goal_prec +Z3_GOAL_PRECISE = 0 +Z3_GOAL_UNDER = 1 +Z3_GOAL_OVER = 2 +Z3_GOAL_UNDER_OVER = 3 + diff --git a/rba.tool.core/lib32/z3/python/z3/z3consts.pyc b/rba.tool.core/lib32/z3/python/z3/z3consts.pyc Binary files differnew file mode 100644 index 0000000..5b99b94 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3consts.pyc diff --git a/rba.tool.core/lib32/z3/python/z3/z3core.py b/rba.tool.core/lib32/z3/python/z3/z3core.py new file mode 100644 index 0000000..ebb9f6f --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3core.py @@ -0,0 +1,4532 @@ + +# Automatically generated file +import sys, os +import ctypes +import pkg_resources +from .z3types import * +from .z3consts import * + +_ext = 'dll' if sys.platform in ('win32', 'cygwin') else 'dylib' if sys.platform == 'darwin' else 'so' +_lib = None +_default_dirs = ['.', + os.path.dirname(os.path.abspath(__file__)), + pkg_resources.resource_filename('z3', 'lib'), + os.path.join(sys.prefix, 'lib'), + None] +_all_dirs = [] + +if sys.version < '3': + import __builtin__ + if hasattr(__builtin__, "Z3_LIB_DIRS"): + _all_dirs = __builtin__.Z3_LIB_DIRS +else: + import builtins + if hasattr(builtins, "Z3_LIB_DIRS"): + _all_dirs = builtins.Z3_LIB_DIRS + +for v in ('Z3_LIBRARY_PATH', 'PATH'): + if v in os.environ: + lp = os.environ[v]; + lds = lp.split(';') if sys.platform in ('win32') else lp.split(':') + _all_dirs.extend(lds) + +_all_dirs.extend(_default_dirs) + +for d in _all_dirs: + try: + d = os.path.realpath(d) + if os.path.isdir(d): + d = os.path.join(d, 'libz3.%s' % _ext) + if os.path.isfile(d): + _lib = ctypes.CDLL(d) + break + except: + pass + +if _lib is None: + # If all else failed, ask the system to find it. + try: + _lib = ctypes.CDLL('libz3.%s' % _ext) + except: + pass + +if _lib is None: + print("Could not find libz3.%s; consider adding the directory containing it to" % _ext) + print(" - your system's PATH environment variable,") + print(" - the Z3_LIBRARY_PATH environment variable, or ") + print(" - to the custom Z3_LIBRARY_DIRS Python-builtin before importing the z3 module, e.g. via") + if sys.version < '3': + print(" import __builtin__") + print(" __builtin__.Z3_LIB_DIRS = [ '/path/to/libz3.%s' ] " % _ext) + else: + print(" import builtins") + print(" builtins.Z3_LIB_DIRS = [ '/path/to/libz3.%s' ] " % _ext) + raise Z3Exception("libz3.%s not found." % _ext) + +def _to_ascii(s): + if isinstance(s, str): + return s.encode('ascii') + else: + return s + +if sys.version < '3': + def _to_pystr(s): + return s +else: + def _to_pystr(s): + if s != None: + enc = sys.stdout.encoding + if enc != None: return s.decode(enc) + else: return s.decode('ascii') + else: + return "" + +_error_handler_type = ctypes.CFUNCTYPE(None, ctypes.c_void_p, ctypes.c_uint) + +_lib.Z3_set_error_handler.restype = None +_lib.Z3_set_error_handler.argtypes = [ContextObj, _error_handler_type] + +_lib.Z3_global_param_set.argtypes = [ctypes.c_char_p, ctypes.c_char_p] +_lib.Z3_global_param_reset_all.argtypes = [] +_lib.Z3_global_param_get.restype = ctypes.c_bool +_lib.Z3_global_param_get.argtypes = [ctypes.c_char_p, ctypes.POINTER(ctypes.c_char_p)] +_lib.Z3_mk_config.restype = Config +_lib.Z3_mk_config.argtypes = [] +_lib.Z3_del_config.argtypes = [Config] +_lib.Z3_set_param_value.argtypes = [Config, ctypes.c_char_p, ctypes.c_char_p] +_lib.Z3_mk_context.restype = ContextObj +_lib.Z3_mk_context.argtypes = [Config] +_lib.Z3_mk_context_rc.restype = ContextObj +_lib.Z3_mk_context_rc.argtypes = [Config] +_lib.Z3_del_context.argtypes = [ContextObj] +_lib.Z3_inc_ref.argtypes = [ContextObj, Ast] +_lib.Z3_dec_ref.argtypes = [ContextObj, Ast] +_lib.Z3_update_param_value.argtypes = [ContextObj, ctypes.c_char_p, ctypes.c_char_p] +_lib.Z3_interrupt.argtypes = [ContextObj] +_lib.Z3_mk_params.restype = Params +_lib.Z3_mk_params.argtypes = [ContextObj] +_lib.Z3_params_inc_ref.argtypes = [ContextObj, Params] +_lib.Z3_params_dec_ref.argtypes = [ContextObj, Params] +_lib.Z3_params_set_bool.argtypes = [ContextObj, Params, Symbol, ctypes.c_bool] +_lib.Z3_params_set_uint.argtypes = [ContextObj, Params, Symbol, ctypes.c_uint] +_lib.Z3_params_set_double.argtypes = [ContextObj, Params, Symbol, ctypes.c_double] +_lib.Z3_params_set_symbol.argtypes = [ContextObj, Params, Symbol, Symbol] +_lib.Z3_params_to_string.restype = ctypes.c_char_p +_lib.Z3_params_to_string.argtypes = [ContextObj, Params] +_lib.Z3_params_validate.argtypes = [ContextObj, Params, ParamDescrs] +_lib.Z3_param_descrs_inc_ref.argtypes = [ContextObj, ParamDescrs] +_lib.Z3_param_descrs_dec_ref.argtypes = [ContextObj, ParamDescrs] +_lib.Z3_param_descrs_get_kind.restype = ctypes.c_uint +_lib.Z3_param_descrs_get_kind.argtypes = [ContextObj, ParamDescrs, Symbol] +_lib.Z3_param_descrs_size.restype = ctypes.c_uint +_lib.Z3_param_descrs_size.argtypes = [ContextObj, ParamDescrs] +_lib.Z3_param_descrs_get_name.restype = Symbol +_lib.Z3_param_descrs_get_name.argtypes = [ContextObj, ParamDescrs, ctypes.c_uint] +_lib.Z3_param_descrs_get_documentation.restype = ctypes.c_char_p +_lib.Z3_param_descrs_get_documentation.argtypes = [ContextObj, ParamDescrs, Symbol] +_lib.Z3_param_descrs_to_string.restype = ctypes.c_char_p +_lib.Z3_param_descrs_to_string.argtypes = [ContextObj, ParamDescrs] +_lib.Z3_mk_int_symbol.restype = Symbol +_lib.Z3_mk_int_symbol.argtypes = [ContextObj, ctypes.c_int] +_lib.Z3_mk_string_symbol.restype = Symbol +_lib.Z3_mk_string_symbol.argtypes = [ContextObj, ctypes.c_char_p] +_lib.Z3_mk_uninterpreted_sort.restype = Sort +_lib.Z3_mk_uninterpreted_sort.argtypes = [ContextObj, Symbol] +_lib.Z3_mk_bool_sort.restype = Sort +_lib.Z3_mk_bool_sort.argtypes = [ContextObj] +_lib.Z3_mk_int_sort.restype = Sort +_lib.Z3_mk_int_sort.argtypes = [ContextObj] +_lib.Z3_mk_real_sort.restype = Sort +_lib.Z3_mk_real_sort.argtypes = [ContextObj] +_lib.Z3_mk_bv_sort.restype = Sort +_lib.Z3_mk_bv_sort.argtypes = [ContextObj, ctypes.c_uint] +_lib.Z3_mk_finite_domain_sort.restype = Sort +_lib.Z3_mk_finite_domain_sort.argtypes = [ContextObj, Symbol, ctypes.c_ulonglong] +_lib.Z3_mk_array_sort.restype = Sort +_lib.Z3_mk_array_sort.argtypes = [ContextObj, Sort, Sort] +_lib.Z3_mk_array_sort_n.restype = Sort +_lib.Z3_mk_array_sort_n.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Sort), Sort] +_lib.Z3_mk_tuple_sort.restype = Sort +_lib.Z3_mk_tuple_sort.argtypes = [ContextObj, Symbol, ctypes.c_uint, ctypes.POINTER(Symbol), ctypes.POINTER(Sort), ctypes.POINTER(FuncDecl), ctypes.POINTER(FuncDecl)] +_lib.Z3_mk_enumeration_sort.restype = Sort +_lib.Z3_mk_enumeration_sort.argtypes = [ContextObj, Symbol, ctypes.c_uint, ctypes.POINTER(Symbol), ctypes.POINTER(FuncDecl), ctypes.POINTER(FuncDecl)] +_lib.Z3_mk_list_sort.restype = Sort +_lib.Z3_mk_list_sort.argtypes = [ContextObj, Symbol, Sort, ctypes.POINTER(FuncDecl), ctypes.POINTER(FuncDecl), ctypes.POINTER(FuncDecl), ctypes.POINTER(FuncDecl), ctypes.POINTER(FuncDecl), ctypes.POINTER(FuncDecl)] +_lib.Z3_mk_constructor.restype = Constructor +_lib.Z3_mk_constructor.argtypes = [ContextObj, Symbol, Symbol, ctypes.c_uint, ctypes.POINTER(Symbol), ctypes.POINTER(Sort), ctypes.POINTER(ctypes.c_uint)] +_lib.Z3_del_constructor.argtypes = [ContextObj, Constructor] +_lib.Z3_mk_datatype.restype = Sort +_lib.Z3_mk_datatype.argtypes = [ContextObj, Symbol, ctypes.c_uint, ctypes.POINTER(Constructor)] +_lib.Z3_mk_constructor_list.restype = ConstructorList +_lib.Z3_mk_constructor_list.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Constructor)] +_lib.Z3_del_constructor_list.argtypes = [ContextObj, ConstructorList] +_lib.Z3_mk_datatypes.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Symbol), ctypes.POINTER(Sort), ctypes.POINTER(ConstructorList)] +_lib.Z3_query_constructor.argtypes = [ContextObj, Constructor, ctypes.c_uint, ctypes.POINTER(FuncDecl), ctypes.POINTER(FuncDecl), ctypes.POINTER(FuncDecl)] +_lib.Z3_mk_func_decl.restype = FuncDecl +_lib.Z3_mk_func_decl.argtypes = [ContextObj, Symbol, ctypes.c_uint, ctypes.POINTER(Sort), Sort] +_lib.Z3_mk_app.restype = Ast +_lib.Z3_mk_app.argtypes = [ContextObj, FuncDecl, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_const.restype = Ast +_lib.Z3_mk_const.argtypes = [ContextObj, Symbol, Sort] +_lib.Z3_mk_fresh_func_decl.restype = FuncDecl +_lib.Z3_mk_fresh_func_decl.argtypes = [ContextObj, ctypes.c_char_p, ctypes.c_uint, ctypes.POINTER(Sort), Sort] +_lib.Z3_mk_fresh_const.restype = Ast +_lib.Z3_mk_fresh_const.argtypes = [ContextObj, ctypes.c_char_p, Sort] +_lib.Z3_mk_true.restype = Ast +_lib.Z3_mk_true.argtypes = [ContextObj] +_lib.Z3_mk_false.restype = Ast +_lib.Z3_mk_false.argtypes = [ContextObj] +_lib.Z3_mk_eq.restype = Ast +_lib.Z3_mk_eq.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_distinct.restype = Ast +_lib.Z3_mk_distinct.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_not.restype = Ast +_lib.Z3_mk_not.argtypes = [ContextObj, Ast] +_lib.Z3_mk_ite.restype = Ast +_lib.Z3_mk_ite.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_iff.restype = Ast +_lib.Z3_mk_iff.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_implies.restype = Ast +_lib.Z3_mk_implies.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_xor.restype = Ast +_lib.Z3_mk_xor.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_and.restype = Ast +_lib.Z3_mk_and.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_or.restype = Ast +_lib.Z3_mk_or.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_add.restype = Ast +_lib.Z3_mk_add.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_mul.restype = Ast +_lib.Z3_mk_mul.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_sub.restype = Ast +_lib.Z3_mk_sub.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_unary_minus.restype = Ast +_lib.Z3_mk_unary_minus.argtypes = [ContextObj, Ast] +_lib.Z3_mk_div.restype = Ast +_lib.Z3_mk_div.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_mod.restype = Ast +_lib.Z3_mk_mod.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_rem.restype = Ast +_lib.Z3_mk_rem.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_power.restype = Ast +_lib.Z3_mk_power.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_lt.restype = Ast +_lib.Z3_mk_lt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_le.restype = Ast +_lib.Z3_mk_le.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_gt.restype = Ast +_lib.Z3_mk_gt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_ge.restype = Ast +_lib.Z3_mk_ge.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_int2real.restype = Ast +_lib.Z3_mk_int2real.argtypes = [ContextObj, Ast] +_lib.Z3_mk_real2int.restype = Ast +_lib.Z3_mk_real2int.argtypes = [ContextObj, Ast] +_lib.Z3_mk_is_int.restype = Ast +_lib.Z3_mk_is_int.argtypes = [ContextObj, Ast] +_lib.Z3_mk_bvnot.restype = Ast +_lib.Z3_mk_bvnot.argtypes = [ContextObj, Ast] +_lib.Z3_mk_bvredand.restype = Ast +_lib.Z3_mk_bvredand.argtypes = [ContextObj, Ast] +_lib.Z3_mk_bvredor.restype = Ast +_lib.Z3_mk_bvredor.argtypes = [ContextObj, Ast] +_lib.Z3_mk_bvand.restype = Ast +_lib.Z3_mk_bvand.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvor.restype = Ast +_lib.Z3_mk_bvor.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvxor.restype = Ast +_lib.Z3_mk_bvxor.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvnand.restype = Ast +_lib.Z3_mk_bvnand.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvnor.restype = Ast +_lib.Z3_mk_bvnor.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvxnor.restype = Ast +_lib.Z3_mk_bvxnor.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvneg.restype = Ast +_lib.Z3_mk_bvneg.argtypes = [ContextObj, Ast] +_lib.Z3_mk_bvadd.restype = Ast +_lib.Z3_mk_bvadd.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvsub.restype = Ast +_lib.Z3_mk_bvsub.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvmul.restype = Ast +_lib.Z3_mk_bvmul.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvudiv.restype = Ast +_lib.Z3_mk_bvudiv.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvsdiv.restype = Ast +_lib.Z3_mk_bvsdiv.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvurem.restype = Ast +_lib.Z3_mk_bvurem.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvsrem.restype = Ast +_lib.Z3_mk_bvsrem.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvsmod.restype = Ast +_lib.Z3_mk_bvsmod.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvult.restype = Ast +_lib.Z3_mk_bvult.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvslt.restype = Ast +_lib.Z3_mk_bvslt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvule.restype = Ast +_lib.Z3_mk_bvule.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvsle.restype = Ast +_lib.Z3_mk_bvsle.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvuge.restype = Ast +_lib.Z3_mk_bvuge.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvsge.restype = Ast +_lib.Z3_mk_bvsge.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvugt.restype = Ast +_lib.Z3_mk_bvugt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvsgt.restype = Ast +_lib.Z3_mk_bvsgt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_concat.restype = Ast +_lib.Z3_mk_concat.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_extract.restype = Ast +_lib.Z3_mk_extract.argtypes = [ContextObj, ctypes.c_uint, ctypes.c_uint, Ast] +_lib.Z3_mk_sign_ext.restype = Ast +_lib.Z3_mk_sign_ext.argtypes = [ContextObj, ctypes.c_uint, Ast] +_lib.Z3_mk_zero_ext.restype = Ast +_lib.Z3_mk_zero_ext.argtypes = [ContextObj, ctypes.c_uint, Ast] +_lib.Z3_mk_repeat.restype = Ast +_lib.Z3_mk_repeat.argtypes = [ContextObj, ctypes.c_uint, Ast] +_lib.Z3_mk_bvshl.restype = Ast +_lib.Z3_mk_bvshl.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvlshr.restype = Ast +_lib.Z3_mk_bvlshr.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvashr.restype = Ast +_lib.Z3_mk_bvashr.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_rotate_left.restype = Ast +_lib.Z3_mk_rotate_left.argtypes = [ContextObj, ctypes.c_uint, Ast] +_lib.Z3_mk_rotate_right.restype = Ast +_lib.Z3_mk_rotate_right.argtypes = [ContextObj, ctypes.c_uint, Ast] +_lib.Z3_mk_ext_rotate_left.restype = Ast +_lib.Z3_mk_ext_rotate_left.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_ext_rotate_right.restype = Ast +_lib.Z3_mk_ext_rotate_right.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_int2bv.restype = Ast +_lib.Z3_mk_int2bv.argtypes = [ContextObj, ctypes.c_uint, Ast] +_lib.Z3_mk_bv2int.restype = Ast +_lib.Z3_mk_bv2int.argtypes = [ContextObj, Ast, ctypes.c_bool] +_lib.Z3_mk_bvadd_no_overflow.restype = Ast +_lib.Z3_mk_bvadd_no_overflow.argtypes = [ContextObj, Ast, Ast, ctypes.c_bool] +_lib.Z3_mk_bvadd_no_underflow.restype = Ast +_lib.Z3_mk_bvadd_no_underflow.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvsub_no_overflow.restype = Ast +_lib.Z3_mk_bvsub_no_overflow.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvsub_no_underflow.restype = Ast +_lib.Z3_mk_bvsub_no_underflow.argtypes = [ContextObj, Ast, Ast, ctypes.c_bool] +_lib.Z3_mk_bvsdiv_no_overflow.restype = Ast +_lib.Z3_mk_bvsdiv_no_overflow.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_bvneg_no_overflow.restype = Ast +_lib.Z3_mk_bvneg_no_overflow.argtypes = [ContextObj, Ast] +_lib.Z3_mk_bvmul_no_overflow.restype = Ast +_lib.Z3_mk_bvmul_no_overflow.argtypes = [ContextObj, Ast, Ast, ctypes.c_bool] +_lib.Z3_mk_bvmul_no_underflow.restype = Ast +_lib.Z3_mk_bvmul_no_underflow.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_select.restype = Ast +_lib.Z3_mk_select.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_select_n.restype = Ast +_lib.Z3_mk_select_n.argtypes = [ContextObj, Ast, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_store.restype = Ast +_lib.Z3_mk_store.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_store_n.restype = Ast +_lib.Z3_mk_store_n.argtypes = [ContextObj, Ast, ctypes.c_uint, ctypes.POINTER(Ast), Ast] +_lib.Z3_mk_const_array.restype = Ast +_lib.Z3_mk_const_array.argtypes = [ContextObj, Sort, Ast] +_lib.Z3_mk_map.restype = Ast +_lib.Z3_mk_map.argtypes = [ContextObj, FuncDecl, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_array_default.restype = Ast +_lib.Z3_mk_array_default.argtypes = [ContextObj, Ast] +_lib.Z3_mk_as_array.restype = Ast +_lib.Z3_mk_as_array.argtypes = [ContextObj, FuncDecl] +_lib.Z3_mk_set_sort.restype = Sort +_lib.Z3_mk_set_sort.argtypes = [ContextObj, Sort] +_lib.Z3_mk_empty_set.restype = Ast +_lib.Z3_mk_empty_set.argtypes = [ContextObj, Sort] +_lib.Z3_mk_full_set.restype = Ast +_lib.Z3_mk_full_set.argtypes = [ContextObj, Sort] +_lib.Z3_mk_set_add.restype = Ast +_lib.Z3_mk_set_add.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_set_del.restype = Ast +_lib.Z3_mk_set_del.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_set_union.restype = Ast +_lib.Z3_mk_set_union.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_set_intersect.restype = Ast +_lib.Z3_mk_set_intersect.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_set_difference.restype = Ast +_lib.Z3_mk_set_difference.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_set_complement.restype = Ast +_lib.Z3_mk_set_complement.argtypes = [ContextObj, Ast] +_lib.Z3_mk_set_member.restype = Ast +_lib.Z3_mk_set_member.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_set_subset.restype = Ast +_lib.Z3_mk_set_subset.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_array_ext.restype = Ast +_lib.Z3_mk_array_ext.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_numeral.restype = Ast +_lib.Z3_mk_numeral.argtypes = [ContextObj, ctypes.c_char_p, Sort] +_lib.Z3_mk_real.restype = Ast +_lib.Z3_mk_real.argtypes = [ContextObj, ctypes.c_int, ctypes.c_int] +_lib.Z3_mk_int.restype = Ast +_lib.Z3_mk_int.argtypes = [ContextObj, ctypes.c_int, Sort] +_lib.Z3_mk_unsigned_int.restype = Ast +_lib.Z3_mk_unsigned_int.argtypes = [ContextObj, ctypes.c_uint, Sort] +_lib.Z3_mk_int64.restype = Ast +_lib.Z3_mk_int64.argtypes = [ContextObj, ctypes.c_longlong, Sort] +_lib.Z3_mk_unsigned_int64.restype = Ast +_lib.Z3_mk_unsigned_int64.argtypes = [ContextObj, ctypes.c_ulonglong, Sort] +_lib.Z3_mk_bv_numeral.restype = Ast +_lib.Z3_mk_bv_numeral.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(ctypes.c_bool)] +_lib.Z3_mk_seq_sort.restype = Sort +_lib.Z3_mk_seq_sort.argtypes = [ContextObj, Sort] +_lib.Z3_is_seq_sort.restype = ctypes.c_bool +_lib.Z3_is_seq_sort.argtypes = [ContextObj, Sort] +_lib.Z3_mk_re_sort.restype = Sort +_lib.Z3_mk_re_sort.argtypes = [ContextObj, Sort] +_lib.Z3_is_re_sort.restype = ctypes.c_bool +_lib.Z3_is_re_sort.argtypes = [ContextObj, Sort] +_lib.Z3_mk_string_sort.restype = Sort +_lib.Z3_mk_string_sort.argtypes = [ContextObj] +_lib.Z3_is_string_sort.restype = ctypes.c_bool +_lib.Z3_is_string_sort.argtypes = [ContextObj, Sort] +_lib.Z3_mk_string.restype = Ast +_lib.Z3_mk_string.argtypes = [ContextObj, ctypes.c_char_p] +_lib.Z3_is_string.restype = ctypes.c_bool +_lib.Z3_is_string.argtypes = [ContextObj, Ast] +_lib.Z3_get_string.restype = ctypes.c_char_p +_lib.Z3_get_string.argtypes = [ContextObj, Ast] +_lib.Z3_mk_seq_empty.restype = Ast +_lib.Z3_mk_seq_empty.argtypes = [ContextObj, Sort] +_lib.Z3_mk_seq_unit.restype = Ast +_lib.Z3_mk_seq_unit.argtypes = [ContextObj, Ast] +_lib.Z3_mk_seq_concat.restype = Ast +_lib.Z3_mk_seq_concat.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_seq_prefix.restype = Ast +_lib.Z3_mk_seq_prefix.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_seq_suffix.restype = Ast +_lib.Z3_mk_seq_suffix.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_seq_contains.restype = Ast +_lib.Z3_mk_seq_contains.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_seq_extract.restype = Ast +_lib.Z3_mk_seq_extract.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_seq_replace.restype = Ast +_lib.Z3_mk_seq_replace.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_seq_at.restype = Ast +_lib.Z3_mk_seq_at.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_seq_length.restype = Ast +_lib.Z3_mk_seq_length.argtypes = [ContextObj, Ast] +_lib.Z3_mk_seq_index.restype = Ast +_lib.Z3_mk_seq_index.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_str_to_int.restype = Ast +_lib.Z3_mk_str_to_int.argtypes = [ContextObj, Ast] +_lib.Z3_mk_int_to_str.restype = Ast +_lib.Z3_mk_int_to_str.argtypes = [ContextObj, Ast] +_lib.Z3_mk_seq_to_re.restype = Ast +_lib.Z3_mk_seq_to_re.argtypes = [ContextObj, Ast] +_lib.Z3_mk_seq_in_re.restype = Ast +_lib.Z3_mk_seq_in_re.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_re_plus.restype = Ast +_lib.Z3_mk_re_plus.argtypes = [ContextObj, Ast] +_lib.Z3_mk_re_star.restype = Ast +_lib.Z3_mk_re_star.argtypes = [ContextObj, Ast] +_lib.Z3_mk_re_option.restype = Ast +_lib.Z3_mk_re_option.argtypes = [ContextObj, Ast] +_lib.Z3_mk_re_union.restype = Ast +_lib.Z3_mk_re_union.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_re_concat.restype = Ast +_lib.Z3_mk_re_concat.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_re_range.restype = Ast +_lib.Z3_mk_re_range.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_re_loop.restype = Ast +_lib.Z3_mk_re_loop.argtypes = [ContextObj, Ast, ctypes.c_uint, ctypes.c_uint] +_lib.Z3_mk_re_intersect.restype = Ast +_lib.Z3_mk_re_intersect.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_re_complement.restype = Ast +_lib.Z3_mk_re_complement.argtypes = [ContextObj, Ast] +_lib.Z3_mk_re_empty.restype = Ast +_lib.Z3_mk_re_empty.argtypes = [ContextObj, Sort] +_lib.Z3_mk_re_full.restype = Ast +_lib.Z3_mk_re_full.argtypes = [ContextObj, Sort] +_lib.Z3_mk_pattern.restype = Pattern +_lib.Z3_mk_pattern.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_bound.restype = Ast +_lib.Z3_mk_bound.argtypes = [ContextObj, ctypes.c_uint, Sort] +_lib.Z3_mk_forall.restype = Ast +_lib.Z3_mk_forall.argtypes = [ContextObj, ctypes.c_uint, ctypes.c_uint, ctypes.POINTER(Pattern), ctypes.c_uint, ctypes.POINTER(Sort), ctypes.POINTER(Symbol), Ast] +_lib.Z3_mk_exists.restype = Ast +_lib.Z3_mk_exists.argtypes = [ContextObj, ctypes.c_uint, ctypes.c_uint, ctypes.POINTER(Pattern), ctypes.c_uint, ctypes.POINTER(Sort), ctypes.POINTER(Symbol), Ast] +_lib.Z3_mk_quantifier.restype = Ast +_lib.Z3_mk_quantifier.argtypes = [ContextObj, ctypes.c_bool, ctypes.c_uint, ctypes.c_uint, ctypes.POINTER(Pattern), ctypes.c_uint, ctypes.POINTER(Sort), ctypes.POINTER(Symbol), Ast] +_lib.Z3_mk_quantifier_ex.restype = Ast +_lib.Z3_mk_quantifier_ex.argtypes = [ContextObj, ctypes.c_bool, ctypes.c_uint, Symbol, Symbol, ctypes.c_uint, ctypes.POINTER(Pattern), ctypes.c_uint, ctypes.POINTER(Ast), ctypes.c_uint, ctypes.POINTER(Sort), ctypes.POINTER(Symbol), Ast] +_lib.Z3_mk_forall_const.restype = Ast +_lib.Z3_mk_forall_const.argtypes = [ContextObj, ctypes.c_uint, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.c_uint, ctypes.POINTER(Pattern), Ast] +_lib.Z3_mk_exists_const.restype = Ast +_lib.Z3_mk_exists_const.argtypes = [ContextObj, ctypes.c_uint, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.c_uint, ctypes.POINTER(Pattern), Ast] +_lib.Z3_mk_quantifier_const.restype = Ast +_lib.Z3_mk_quantifier_const.argtypes = [ContextObj, ctypes.c_bool, ctypes.c_uint, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.c_uint, ctypes.POINTER(Pattern), Ast] +_lib.Z3_mk_quantifier_const_ex.restype = Ast +_lib.Z3_mk_quantifier_const_ex.argtypes = [ContextObj, ctypes.c_bool, ctypes.c_uint, Symbol, Symbol, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.c_uint, ctypes.POINTER(Pattern), ctypes.c_uint, ctypes.POINTER(Ast), Ast] +_lib.Z3_get_symbol_kind.restype = ctypes.c_uint +_lib.Z3_get_symbol_kind.argtypes = [ContextObj, Symbol] +_lib.Z3_get_symbol_int.restype = ctypes.c_int +_lib.Z3_get_symbol_int.argtypes = [ContextObj, Symbol] +_lib.Z3_get_symbol_string.restype = ctypes.c_char_p +_lib.Z3_get_symbol_string.argtypes = [ContextObj, Symbol] +_lib.Z3_get_sort_name.restype = Symbol +_lib.Z3_get_sort_name.argtypes = [ContextObj, Sort] +_lib.Z3_get_sort_id.restype = ctypes.c_uint +_lib.Z3_get_sort_id.argtypes = [ContextObj, Sort] +_lib.Z3_sort_to_ast.restype = Ast +_lib.Z3_sort_to_ast.argtypes = [ContextObj, Sort] +_lib.Z3_is_eq_sort.restype = ctypes.c_bool +_lib.Z3_is_eq_sort.argtypes = [ContextObj, Sort, Sort] +_lib.Z3_get_sort_kind.restype = ctypes.c_uint +_lib.Z3_get_sort_kind.argtypes = [ContextObj, Sort] +_lib.Z3_get_bv_sort_size.restype = ctypes.c_uint +_lib.Z3_get_bv_sort_size.argtypes = [ContextObj, Sort] +_lib.Z3_get_finite_domain_sort_size.restype = ctypes.c_bool +_lib.Z3_get_finite_domain_sort_size.argtypes = [ContextObj, Sort, ctypes.POINTER(ctypes.c_ulonglong)] +_lib.Z3_get_array_sort_domain.restype = Sort +_lib.Z3_get_array_sort_domain.argtypes = [ContextObj, Sort] +_lib.Z3_get_array_sort_range.restype = Sort +_lib.Z3_get_array_sort_range.argtypes = [ContextObj, Sort] +_lib.Z3_get_tuple_sort_mk_decl.restype = FuncDecl +_lib.Z3_get_tuple_sort_mk_decl.argtypes = [ContextObj, Sort] +_lib.Z3_get_tuple_sort_num_fields.restype = ctypes.c_uint +_lib.Z3_get_tuple_sort_num_fields.argtypes = [ContextObj, Sort] +_lib.Z3_get_tuple_sort_field_decl.restype = FuncDecl +_lib.Z3_get_tuple_sort_field_decl.argtypes = [ContextObj, Sort, ctypes.c_uint] +_lib.Z3_get_datatype_sort_num_constructors.restype = ctypes.c_uint +_lib.Z3_get_datatype_sort_num_constructors.argtypes = [ContextObj, Sort] +_lib.Z3_get_datatype_sort_constructor.restype = FuncDecl +_lib.Z3_get_datatype_sort_constructor.argtypes = [ContextObj, Sort, ctypes.c_uint] +_lib.Z3_get_datatype_sort_recognizer.restype = FuncDecl +_lib.Z3_get_datatype_sort_recognizer.argtypes = [ContextObj, Sort, ctypes.c_uint] +_lib.Z3_get_datatype_sort_constructor_accessor.restype = FuncDecl +_lib.Z3_get_datatype_sort_constructor_accessor.argtypes = [ContextObj, Sort, ctypes.c_uint, ctypes.c_uint] +_lib.Z3_datatype_update_field.restype = Ast +_lib.Z3_datatype_update_field.argtypes = [ContextObj, FuncDecl, Ast, Ast] +_lib.Z3_get_relation_arity.restype = ctypes.c_uint +_lib.Z3_get_relation_arity.argtypes = [ContextObj, Sort] +_lib.Z3_get_relation_column.restype = Sort +_lib.Z3_get_relation_column.argtypes = [ContextObj, Sort, ctypes.c_uint] +_lib.Z3_mk_atmost.restype = Ast +_lib.Z3_mk_atmost.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.c_uint] +_lib.Z3_mk_atleast.restype = Ast +_lib.Z3_mk_atleast.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.c_uint] +_lib.Z3_mk_pble.restype = Ast +_lib.Z3_mk_pble.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.POINTER(ctypes.c_int), ctypes.c_int] +_lib.Z3_mk_pbge.restype = Ast +_lib.Z3_mk_pbge.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.POINTER(ctypes.c_int), ctypes.c_int] +_lib.Z3_mk_pbeq.restype = Ast +_lib.Z3_mk_pbeq.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.POINTER(ctypes.c_int), ctypes.c_int] +_lib.Z3_func_decl_to_ast.restype = Ast +_lib.Z3_func_decl_to_ast.argtypes = [ContextObj, FuncDecl] +_lib.Z3_is_eq_func_decl.restype = ctypes.c_bool +_lib.Z3_is_eq_func_decl.argtypes = [ContextObj, FuncDecl, FuncDecl] +_lib.Z3_get_func_decl_id.restype = ctypes.c_uint +_lib.Z3_get_func_decl_id.argtypes = [ContextObj, FuncDecl] +_lib.Z3_get_decl_name.restype = Symbol +_lib.Z3_get_decl_name.argtypes = [ContextObj, FuncDecl] +_lib.Z3_get_decl_kind.restype = ctypes.c_uint +_lib.Z3_get_decl_kind.argtypes = [ContextObj, FuncDecl] +_lib.Z3_get_domain_size.restype = ctypes.c_uint +_lib.Z3_get_domain_size.argtypes = [ContextObj, FuncDecl] +_lib.Z3_get_arity.restype = ctypes.c_uint +_lib.Z3_get_arity.argtypes = [ContextObj, FuncDecl] +_lib.Z3_get_domain.restype = Sort +_lib.Z3_get_domain.argtypes = [ContextObj, FuncDecl, ctypes.c_uint] +_lib.Z3_get_range.restype = Sort +_lib.Z3_get_range.argtypes = [ContextObj, FuncDecl] +_lib.Z3_get_decl_num_parameters.restype = ctypes.c_uint +_lib.Z3_get_decl_num_parameters.argtypes = [ContextObj, FuncDecl] +_lib.Z3_get_decl_parameter_kind.restype = ctypes.c_uint +_lib.Z3_get_decl_parameter_kind.argtypes = [ContextObj, FuncDecl, ctypes.c_uint] +_lib.Z3_get_decl_int_parameter.restype = ctypes.c_int +_lib.Z3_get_decl_int_parameter.argtypes = [ContextObj, FuncDecl, ctypes.c_uint] +_lib.Z3_get_decl_double_parameter.restype = ctypes.c_double +_lib.Z3_get_decl_double_parameter.argtypes = [ContextObj, FuncDecl, ctypes.c_uint] +_lib.Z3_get_decl_symbol_parameter.restype = Symbol +_lib.Z3_get_decl_symbol_parameter.argtypes = [ContextObj, FuncDecl, ctypes.c_uint] +_lib.Z3_get_decl_sort_parameter.restype = Sort +_lib.Z3_get_decl_sort_parameter.argtypes = [ContextObj, FuncDecl, ctypes.c_uint] +_lib.Z3_get_decl_ast_parameter.restype = Ast +_lib.Z3_get_decl_ast_parameter.argtypes = [ContextObj, FuncDecl, ctypes.c_uint] +_lib.Z3_get_decl_func_decl_parameter.restype = FuncDecl +_lib.Z3_get_decl_func_decl_parameter.argtypes = [ContextObj, FuncDecl, ctypes.c_uint] +_lib.Z3_get_decl_rational_parameter.restype = ctypes.c_char_p +_lib.Z3_get_decl_rational_parameter.argtypes = [ContextObj, FuncDecl, ctypes.c_uint] +_lib.Z3_app_to_ast.restype = Ast +_lib.Z3_app_to_ast.argtypes = [ContextObj, Ast] +_lib.Z3_get_app_decl.restype = FuncDecl +_lib.Z3_get_app_decl.argtypes = [ContextObj, Ast] +_lib.Z3_get_app_num_args.restype = ctypes.c_uint +_lib.Z3_get_app_num_args.argtypes = [ContextObj, Ast] +_lib.Z3_get_app_arg.restype = Ast +_lib.Z3_get_app_arg.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_is_eq_ast.restype = ctypes.c_bool +_lib.Z3_is_eq_ast.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_get_ast_id.restype = ctypes.c_uint +_lib.Z3_get_ast_id.argtypes = [ContextObj, Ast] +_lib.Z3_get_ast_hash.restype = ctypes.c_uint +_lib.Z3_get_ast_hash.argtypes = [ContextObj, Ast] +_lib.Z3_get_sort.restype = Sort +_lib.Z3_get_sort.argtypes = [ContextObj, Ast] +_lib.Z3_is_well_sorted.restype = ctypes.c_bool +_lib.Z3_is_well_sorted.argtypes = [ContextObj, Ast] +_lib.Z3_get_bool_value.restype = ctypes.c_int +_lib.Z3_get_bool_value.argtypes = [ContextObj, Ast] +_lib.Z3_get_ast_kind.restype = ctypes.c_uint +_lib.Z3_get_ast_kind.argtypes = [ContextObj, Ast] +_lib.Z3_is_app.restype = ctypes.c_bool +_lib.Z3_is_app.argtypes = [ContextObj, Ast] +_lib.Z3_is_numeral_ast.restype = ctypes.c_bool +_lib.Z3_is_numeral_ast.argtypes = [ContextObj, Ast] +_lib.Z3_is_algebraic_number.restype = ctypes.c_bool +_lib.Z3_is_algebraic_number.argtypes = [ContextObj, Ast] +_lib.Z3_to_app.restype = Ast +_lib.Z3_to_app.argtypes = [ContextObj, Ast] +_lib.Z3_to_func_decl.restype = FuncDecl +_lib.Z3_to_func_decl.argtypes = [ContextObj, Ast] +_lib.Z3_get_numeral_string.restype = ctypes.c_char_p +_lib.Z3_get_numeral_string.argtypes = [ContextObj, Ast] +_lib.Z3_get_numeral_decimal_string.restype = ctypes.c_char_p +_lib.Z3_get_numeral_decimal_string.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_get_numerator.restype = Ast +_lib.Z3_get_numerator.argtypes = [ContextObj, Ast] +_lib.Z3_get_denominator.restype = Ast +_lib.Z3_get_denominator.argtypes = [ContextObj, Ast] +_lib.Z3_get_numeral_small.restype = ctypes.c_bool +_lib.Z3_get_numeral_small.argtypes = [ContextObj, Ast, ctypes.POINTER(ctypes.c_longlong), ctypes.POINTER(ctypes.c_longlong)] +_lib.Z3_get_numeral_int.restype = ctypes.c_bool +_lib.Z3_get_numeral_int.argtypes = [ContextObj, Ast, ctypes.POINTER(ctypes.c_int)] +_lib.Z3_get_numeral_uint.restype = ctypes.c_bool +_lib.Z3_get_numeral_uint.argtypes = [ContextObj, Ast, ctypes.POINTER(ctypes.c_uint)] +_lib.Z3_get_numeral_uint64.restype = ctypes.c_bool +_lib.Z3_get_numeral_uint64.argtypes = [ContextObj, Ast, ctypes.POINTER(ctypes.c_ulonglong)] +_lib.Z3_get_numeral_int64.restype = ctypes.c_bool +_lib.Z3_get_numeral_int64.argtypes = [ContextObj, Ast, ctypes.POINTER(ctypes.c_longlong)] +_lib.Z3_get_numeral_rational_int64.restype = ctypes.c_bool +_lib.Z3_get_numeral_rational_int64.argtypes = [ContextObj, Ast, ctypes.POINTER(ctypes.c_longlong), ctypes.POINTER(ctypes.c_longlong)] +_lib.Z3_get_algebraic_number_lower.restype = Ast +_lib.Z3_get_algebraic_number_lower.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_get_algebraic_number_upper.restype = Ast +_lib.Z3_get_algebraic_number_upper.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_pattern_to_ast.restype = Ast +_lib.Z3_pattern_to_ast.argtypes = [ContextObj, Pattern] +_lib.Z3_get_pattern_num_terms.restype = ctypes.c_uint +_lib.Z3_get_pattern_num_terms.argtypes = [ContextObj, Pattern] +_lib.Z3_get_pattern.restype = Ast +_lib.Z3_get_pattern.argtypes = [ContextObj, Pattern, ctypes.c_uint] +_lib.Z3_get_index_value.restype = ctypes.c_uint +_lib.Z3_get_index_value.argtypes = [ContextObj, Ast] +_lib.Z3_is_quantifier_forall.restype = ctypes.c_bool +_lib.Z3_is_quantifier_forall.argtypes = [ContextObj, Ast] +_lib.Z3_get_quantifier_weight.restype = ctypes.c_uint +_lib.Z3_get_quantifier_weight.argtypes = [ContextObj, Ast] +_lib.Z3_get_quantifier_num_patterns.restype = ctypes.c_uint +_lib.Z3_get_quantifier_num_patterns.argtypes = [ContextObj, Ast] +_lib.Z3_get_quantifier_pattern_ast.restype = Pattern +_lib.Z3_get_quantifier_pattern_ast.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_get_quantifier_num_no_patterns.restype = ctypes.c_uint +_lib.Z3_get_quantifier_num_no_patterns.argtypes = [ContextObj, Ast] +_lib.Z3_get_quantifier_no_pattern_ast.restype = Ast +_lib.Z3_get_quantifier_no_pattern_ast.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_get_quantifier_num_bound.restype = ctypes.c_uint +_lib.Z3_get_quantifier_num_bound.argtypes = [ContextObj, Ast] +_lib.Z3_get_quantifier_bound_name.restype = Symbol +_lib.Z3_get_quantifier_bound_name.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_get_quantifier_bound_sort.restype = Sort +_lib.Z3_get_quantifier_bound_sort.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_get_quantifier_body.restype = Ast +_lib.Z3_get_quantifier_body.argtypes = [ContextObj, Ast] +_lib.Z3_simplify.restype = Ast +_lib.Z3_simplify.argtypes = [ContextObj, Ast] +_lib.Z3_simplify_ex.restype = Ast +_lib.Z3_simplify_ex.argtypes = [ContextObj, Ast, Params] +_lib.Z3_simplify_get_help.restype = ctypes.c_char_p +_lib.Z3_simplify_get_help.argtypes = [ContextObj] +_lib.Z3_simplify_get_param_descrs.restype = ParamDescrs +_lib.Z3_simplify_get_param_descrs.argtypes = [ContextObj] +_lib.Z3_update_term.restype = Ast +_lib.Z3_update_term.argtypes = [ContextObj, Ast, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_substitute.restype = Ast +_lib.Z3_substitute.argtypes = [ContextObj, Ast, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.POINTER(Ast)] +_lib.Z3_substitute_vars.restype = Ast +_lib.Z3_substitute_vars.argtypes = [ContextObj, Ast, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_translate.restype = Ast +_lib.Z3_translate.argtypes = [ContextObj, Ast, ContextObj] +_lib.Z3_mk_model.restype = Model +_lib.Z3_mk_model.argtypes = [ContextObj] +_lib.Z3_model_inc_ref.argtypes = [ContextObj, Model] +_lib.Z3_model_dec_ref.argtypes = [ContextObj, Model] +_lib.Z3_model_eval.restype = ctypes.c_bool +_lib.Z3_model_eval.argtypes = [ContextObj, Model, Ast, ctypes.c_bool, ctypes.POINTER(Ast)] +_lib.Z3_model_get_const_interp.restype = Ast +_lib.Z3_model_get_const_interp.argtypes = [ContextObj, Model, FuncDecl] +_lib.Z3_model_has_interp.restype = ctypes.c_bool +_lib.Z3_model_has_interp.argtypes = [ContextObj, Model, FuncDecl] +_lib.Z3_model_get_func_interp.restype = FuncInterpObj +_lib.Z3_model_get_func_interp.argtypes = [ContextObj, Model, FuncDecl] +_lib.Z3_model_get_num_consts.restype = ctypes.c_uint +_lib.Z3_model_get_num_consts.argtypes = [ContextObj, Model] +_lib.Z3_model_get_const_decl.restype = FuncDecl +_lib.Z3_model_get_const_decl.argtypes = [ContextObj, Model, ctypes.c_uint] +_lib.Z3_model_get_num_funcs.restype = ctypes.c_uint +_lib.Z3_model_get_num_funcs.argtypes = [ContextObj, Model] +_lib.Z3_model_get_func_decl.restype = FuncDecl +_lib.Z3_model_get_func_decl.argtypes = [ContextObj, Model, ctypes.c_uint] +_lib.Z3_model_get_num_sorts.restype = ctypes.c_uint +_lib.Z3_model_get_num_sorts.argtypes = [ContextObj, Model] +_lib.Z3_model_get_sort.restype = Sort +_lib.Z3_model_get_sort.argtypes = [ContextObj, Model, ctypes.c_uint] +_lib.Z3_model_get_sort_universe.restype = AstVectorObj +_lib.Z3_model_get_sort_universe.argtypes = [ContextObj, Model, Sort] +_lib.Z3_is_as_array.restype = ctypes.c_bool +_lib.Z3_is_as_array.argtypes = [ContextObj, Ast] +_lib.Z3_get_as_array_func_decl.restype = FuncDecl +_lib.Z3_get_as_array_func_decl.argtypes = [ContextObj, Ast] +_lib.Z3_add_func_interp.restype = FuncInterpObj +_lib.Z3_add_func_interp.argtypes = [ContextObj, Model, FuncDecl, Ast] +_lib.Z3_add_const_interp.argtypes = [ContextObj, Model, FuncDecl, Ast] +_lib.Z3_func_interp_inc_ref.argtypes = [ContextObj, FuncInterpObj] +_lib.Z3_func_interp_dec_ref.argtypes = [ContextObj, FuncInterpObj] +_lib.Z3_func_interp_get_num_entries.restype = ctypes.c_uint +_lib.Z3_func_interp_get_num_entries.argtypes = [ContextObj, FuncInterpObj] +_lib.Z3_func_interp_get_entry.restype = FuncEntryObj +_lib.Z3_func_interp_get_entry.argtypes = [ContextObj, FuncInterpObj, ctypes.c_uint] +_lib.Z3_func_interp_get_else.restype = Ast +_lib.Z3_func_interp_get_else.argtypes = [ContextObj, FuncInterpObj] +_lib.Z3_func_interp_set_else.argtypes = [ContextObj, FuncInterpObj, Ast] +_lib.Z3_func_interp_get_arity.restype = ctypes.c_uint +_lib.Z3_func_interp_get_arity.argtypes = [ContextObj, FuncInterpObj] +_lib.Z3_func_interp_add_entry.argtypes = [ContextObj, FuncInterpObj, AstVectorObj, Ast] +_lib.Z3_func_entry_inc_ref.argtypes = [ContextObj, FuncEntryObj] +_lib.Z3_func_entry_dec_ref.argtypes = [ContextObj, FuncEntryObj] +_lib.Z3_func_entry_get_value.restype = Ast +_lib.Z3_func_entry_get_value.argtypes = [ContextObj, FuncEntryObj] +_lib.Z3_func_entry_get_num_args.restype = ctypes.c_uint +_lib.Z3_func_entry_get_num_args.argtypes = [ContextObj, FuncEntryObj] +_lib.Z3_func_entry_get_arg.restype = Ast +_lib.Z3_func_entry_get_arg.argtypes = [ContextObj, FuncEntryObj, ctypes.c_uint] +_lib.Z3_open_log.restype = ctypes.c_int +_lib.Z3_open_log.argtypes = [ctypes.c_char_p] +_lib.Z3_append_log.argtypes = [ctypes.c_char_p] +_lib.Z3_close_log.argtypes = [] +_lib.Z3_toggle_warning_messages.argtypes = [ctypes.c_bool] +_lib.Z3_set_ast_print_mode.argtypes = [ContextObj, ctypes.c_uint] +_lib.Z3_ast_to_string.restype = ctypes.c_char_p +_lib.Z3_ast_to_string.argtypes = [ContextObj, Ast] +_lib.Z3_pattern_to_string.restype = ctypes.c_char_p +_lib.Z3_pattern_to_string.argtypes = [ContextObj, Pattern] +_lib.Z3_sort_to_string.restype = ctypes.c_char_p +_lib.Z3_sort_to_string.argtypes = [ContextObj, Sort] +_lib.Z3_func_decl_to_string.restype = ctypes.c_char_p +_lib.Z3_func_decl_to_string.argtypes = [ContextObj, FuncDecl] +_lib.Z3_model_to_string.restype = ctypes.c_char_p +_lib.Z3_model_to_string.argtypes = [ContextObj, Model] +_lib.Z3_benchmark_to_smtlib_string.restype = ctypes.c_char_p +_lib.Z3_benchmark_to_smtlib_string.argtypes = [ContextObj, ctypes.c_char_p, ctypes.c_char_p, ctypes.c_char_p, ctypes.c_char_p, ctypes.c_uint, ctypes.POINTER(Ast), Ast] +_lib.Z3_parse_smtlib2_string.restype = Ast +_lib.Z3_parse_smtlib2_string.argtypes = [ContextObj, ctypes.c_char_p, ctypes.c_uint, ctypes.POINTER(Symbol), ctypes.POINTER(Sort), ctypes.c_uint, ctypes.POINTER(Symbol), ctypes.POINTER(FuncDecl)] +_lib.Z3_parse_smtlib2_file.restype = Ast +_lib.Z3_parse_smtlib2_file.argtypes = [ContextObj, ctypes.c_char_p, ctypes.c_uint, ctypes.POINTER(Symbol), ctypes.POINTER(Sort), ctypes.c_uint, ctypes.POINTER(Symbol), ctypes.POINTER(FuncDecl)] +_lib.Z3_get_parser_error.restype = ctypes.c_char_p +_lib.Z3_get_parser_error.argtypes = [ContextObj] +_lib.Z3_get_error_code.restype = ctypes.c_uint +_lib.Z3_get_error_code.argtypes = [ContextObj] +_lib.Z3_set_error.argtypes = [ContextObj, ctypes.c_uint] +_lib.Z3_get_error_msg.restype = ctypes.c_char_p +_lib.Z3_get_error_msg.argtypes = [ContextObj, ctypes.c_uint] +_lib.Z3_get_version.argtypes = [ctypes.POINTER(ctypes.c_uint), ctypes.POINTER(ctypes.c_uint), ctypes.POINTER(ctypes.c_uint), ctypes.POINTER(ctypes.c_uint)] +_lib.Z3_get_full_version.restype = ctypes.c_char_p +_lib.Z3_get_full_version.argtypes = [] +_lib.Z3_enable_trace.argtypes = [ctypes.c_char_p] +_lib.Z3_disable_trace.argtypes = [ctypes.c_char_p] +_lib.Z3_reset_memory.argtypes = [] +_lib.Z3_finalize_memory.argtypes = [] +_lib.Z3_mk_goal.restype = GoalObj +_lib.Z3_mk_goal.argtypes = [ContextObj, ctypes.c_bool, ctypes.c_bool, ctypes.c_bool] +_lib.Z3_goal_inc_ref.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_dec_ref.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_precision.restype = ctypes.c_uint +_lib.Z3_goal_precision.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_assert.argtypes = [ContextObj, GoalObj, Ast] +_lib.Z3_goal_inconsistent.restype = ctypes.c_bool +_lib.Z3_goal_inconsistent.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_depth.restype = ctypes.c_uint +_lib.Z3_goal_depth.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_reset.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_size.restype = ctypes.c_uint +_lib.Z3_goal_size.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_formula.restype = Ast +_lib.Z3_goal_formula.argtypes = [ContextObj, GoalObj, ctypes.c_uint] +_lib.Z3_goal_num_exprs.restype = ctypes.c_uint +_lib.Z3_goal_num_exprs.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_is_decided_sat.restype = ctypes.c_bool +_lib.Z3_goal_is_decided_sat.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_is_decided_unsat.restype = ctypes.c_bool +_lib.Z3_goal_is_decided_unsat.argtypes = [ContextObj, GoalObj] +_lib.Z3_goal_translate.restype = GoalObj +_lib.Z3_goal_translate.argtypes = [ContextObj, GoalObj, ContextObj] +_lib.Z3_goal_to_string.restype = ctypes.c_char_p +_lib.Z3_goal_to_string.argtypes = [ContextObj, GoalObj] +_lib.Z3_mk_tactic.restype = TacticObj +_lib.Z3_mk_tactic.argtypes = [ContextObj, ctypes.c_char_p] +_lib.Z3_tactic_inc_ref.argtypes = [ContextObj, TacticObj] +_lib.Z3_tactic_dec_ref.argtypes = [ContextObj, TacticObj] +_lib.Z3_mk_probe.restype = ProbeObj +_lib.Z3_mk_probe.argtypes = [ContextObj, ctypes.c_char_p] +_lib.Z3_probe_inc_ref.argtypes = [ContextObj, ProbeObj] +_lib.Z3_probe_dec_ref.argtypes = [ContextObj, ProbeObj] +_lib.Z3_tactic_and_then.restype = TacticObj +_lib.Z3_tactic_and_then.argtypes = [ContextObj, TacticObj, TacticObj] +_lib.Z3_tactic_or_else.restype = TacticObj +_lib.Z3_tactic_or_else.argtypes = [ContextObj, TacticObj, TacticObj] +_lib.Z3_tactic_par_or.restype = TacticObj +_lib.Z3_tactic_par_or.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(TacticObj)] +_lib.Z3_tactic_par_and_then.restype = TacticObj +_lib.Z3_tactic_par_and_then.argtypes = [ContextObj, TacticObj, TacticObj] +_lib.Z3_tactic_try_for.restype = TacticObj +_lib.Z3_tactic_try_for.argtypes = [ContextObj, TacticObj, ctypes.c_uint] +_lib.Z3_tactic_when.restype = TacticObj +_lib.Z3_tactic_when.argtypes = [ContextObj, ProbeObj, TacticObj] +_lib.Z3_tactic_cond.restype = TacticObj +_lib.Z3_tactic_cond.argtypes = [ContextObj, ProbeObj, TacticObj, TacticObj] +_lib.Z3_tactic_repeat.restype = TacticObj +_lib.Z3_tactic_repeat.argtypes = [ContextObj, TacticObj, ctypes.c_uint] +_lib.Z3_tactic_skip.restype = TacticObj +_lib.Z3_tactic_skip.argtypes = [ContextObj] +_lib.Z3_tactic_fail.restype = TacticObj +_lib.Z3_tactic_fail.argtypes = [ContextObj] +_lib.Z3_tactic_fail_if.restype = TacticObj +_lib.Z3_tactic_fail_if.argtypes = [ContextObj, ProbeObj] +_lib.Z3_tactic_fail_if_not_decided.restype = TacticObj +_lib.Z3_tactic_fail_if_not_decided.argtypes = [ContextObj] +_lib.Z3_tactic_using_params.restype = TacticObj +_lib.Z3_tactic_using_params.argtypes = [ContextObj, TacticObj, Params] +_lib.Z3_probe_const.restype = ProbeObj +_lib.Z3_probe_const.argtypes = [ContextObj, ctypes.c_double] +_lib.Z3_probe_lt.restype = ProbeObj +_lib.Z3_probe_lt.argtypes = [ContextObj, ProbeObj, ProbeObj] +_lib.Z3_probe_gt.restype = ProbeObj +_lib.Z3_probe_gt.argtypes = [ContextObj, ProbeObj, ProbeObj] +_lib.Z3_probe_le.restype = ProbeObj +_lib.Z3_probe_le.argtypes = [ContextObj, ProbeObj, ProbeObj] +_lib.Z3_probe_ge.restype = ProbeObj +_lib.Z3_probe_ge.argtypes = [ContextObj, ProbeObj, ProbeObj] +_lib.Z3_probe_eq.restype = ProbeObj +_lib.Z3_probe_eq.argtypes = [ContextObj, ProbeObj, ProbeObj] +_lib.Z3_probe_and.restype = ProbeObj +_lib.Z3_probe_and.argtypes = [ContextObj, ProbeObj, ProbeObj] +_lib.Z3_probe_or.restype = ProbeObj +_lib.Z3_probe_or.argtypes = [ContextObj, ProbeObj, ProbeObj] +_lib.Z3_probe_not.restype = ProbeObj +_lib.Z3_probe_not.argtypes = [ContextObj, ProbeObj] +_lib.Z3_get_num_tactics.restype = ctypes.c_uint +_lib.Z3_get_num_tactics.argtypes = [ContextObj] +_lib.Z3_get_tactic_name.restype = ctypes.c_char_p +_lib.Z3_get_tactic_name.argtypes = [ContextObj, ctypes.c_uint] +_lib.Z3_get_num_probes.restype = ctypes.c_uint +_lib.Z3_get_num_probes.argtypes = [ContextObj] +_lib.Z3_get_probe_name.restype = ctypes.c_char_p +_lib.Z3_get_probe_name.argtypes = [ContextObj, ctypes.c_uint] +_lib.Z3_tactic_get_help.restype = ctypes.c_char_p +_lib.Z3_tactic_get_help.argtypes = [ContextObj, TacticObj] +_lib.Z3_tactic_get_param_descrs.restype = ParamDescrs +_lib.Z3_tactic_get_param_descrs.argtypes = [ContextObj, TacticObj] +_lib.Z3_tactic_get_descr.restype = ctypes.c_char_p +_lib.Z3_tactic_get_descr.argtypes = [ContextObj, ctypes.c_char_p] +_lib.Z3_probe_get_descr.restype = ctypes.c_char_p +_lib.Z3_probe_get_descr.argtypes = [ContextObj, ctypes.c_char_p] +_lib.Z3_probe_apply.restype = ctypes.c_double +_lib.Z3_probe_apply.argtypes = [ContextObj, ProbeObj, GoalObj] +_lib.Z3_tactic_apply.restype = ApplyResultObj +_lib.Z3_tactic_apply.argtypes = [ContextObj, TacticObj, GoalObj] +_lib.Z3_tactic_apply_ex.restype = ApplyResultObj +_lib.Z3_tactic_apply_ex.argtypes = [ContextObj, TacticObj, GoalObj, Params] +_lib.Z3_apply_result_inc_ref.argtypes = [ContextObj, ApplyResultObj] +_lib.Z3_apply_result_dec_ref.argtypes = [ContextObj, ApplyResultObj] +_lib.Z3_apply_result_to_string.restype = ctypes.c_char_p +_lib.Z3_apply_result_to_string.argtypes = [ContextObj, ApplyResultObj] +_lib.Z3_apply_result_get_num_subgoals.restype = ctypes.c_uint +_lib.Z3_apply_result_get_num_subgoals.argtypes = [ContextObj, ApplyResultObj] +_lib.Z3_apply_result_get_subgoal.restype = GoalObj +_lib.Z3_apply_result_get_subgoal.argtypes = [ContextObj, ApplyResultObj, ctypes.c_uint] +_lib.Z3_apply_result_convert_model.restype = Model +_lib.Z3_apply_result_convert_model.argtypes = [ContextObj, ApplyResultObj, ctypes.c_uint, Model] +_lib.Z3_mk_solver.restype = SolverObj +_lib.Z3_mk_solver.argtypes = [ContextObj] +_lib.Z3_mk_simple_solver.restype = SolverObj +_lib.Z3_mk_simple_solver.argtypes = [ContextObj] +_lib.Z3_mk_solver_for_logic.restype = SolverObj +_lib.Z3_mk_solver_for_logic.argtypes = [ContextObj, Symbol] +_lib.Z3_mk_solver_from_tactic.restype = SolverObj +_lib.Z3_mk_solver_from_tactic.argtypes = [ContextObj, TacticObj] +_lib.Z3_solver_translate.restype = SolverObj +_lib.Z3_solver_translate.argtypes = [ContextObj, SolverObj, ContextObj] +_lib.Z3_solver_get_help.restype = ctypes.c_char_p +_lib.Z3_solver_get_help.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_get_param_descrs.restype = ParamDescrs +_lib.Z3_solver_get_param_descrs.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_set_params.argtypes = [ContextObj, SolverObj, Params] +_lib.Z3_solver_inc_ref.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_dec_ref.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_push.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_pop.argtypes = [ContextObj, SolverObj, ctypes.c_uint] +_lib.Z3_solver_reset.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_get_num_scopes.restype = ctypes.c_uint +_lib.Z3_solver_get_num_scopes.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_assert.argtypes = [ContextObj, SolverObj, Ast] +_lib.Z3_solver_assert_and_track.argtypes = [ContextObj, SolverObj, Ast, Ast] +_lib.Z3_solver_get_assertions.restype = AstVectorObj +_lib.Z3_solver_get_assertions.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_from_file.argtypes = [ContextObj, SolverObj, ctypes.c_char_p] +_lib.Z3_solver_from_string.argtypes = [ContextObj, SolverObj, ctypes.c_char_p] +_lib.Z3_solver_check.restype = ctypes.c_int +_lib.Z3_solver_check.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_check_assumptions.restype = ctypes.c_int +_lib.Z3_solver_check_assumptions.argtypes = [ContextObj, SolverObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_get_implied_equalities.restype = ctypes.c_int +_lib.Z3_get_implied_equalities.argtypes = [ContextObj, SolverObj, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.POINTER(ctypes.c_uint)] +_lib.Z3_solver_get_consequences.restype = ctypes.c_int +_lib.Z3_solver_get_consequences.argtypes = [ContextObj, SolverObj, AstVectorObj, AstVectorObj, AstVectorObj] +_lib.Z3_solver_get_model.restype = Model +_lib.Z3_solver_get_model.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_get_proof.restype = Ast +_lib.Z3_solver_get_proof.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_get_unsat_core.restype = AstVectorObj +_lib.Z3_solver_get_unsat_core.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_get_reason_unknown.restype = ctypes.c_char_p +_lib.Z3_solver_get_reason_unknown.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_get_statistics.restype = StatsObj +_lib.Z3_solver_get_statistics.argtypes = [ContextObj, SolverObj] +_lib.Z3_solver_to_string.restype = ctypes.c_char_p +_lib.Z3_solver_to_string.argtypes = [ContextObj, SolverObj] +_lib.Z3_stats_to_string.restype = ctypes.c_char_p +_lib.Z3_stats_to_string.argtypes = [ContextObj, StatsObj] +_lib.Z3_stats_inc_ref.argtypes = [ContextObj, StatsObj] +_lib.Z3_stats_dec_ref.argtypes = [ContextObj, StatsObj] +_lib.Z3_stats_size.restype = ctypes.c_uint +_lib.Z3_stats_size.argtypes = [ContextObj, StatsObj] +_lib.Z3_stats_get_key.restype = ctypes.c_char_p +_lib.Z3_stats_get_key.argtypes = [ContextObj, StatsObj, ctypes.c_uint] +_lib.Z3_stats_is_uint.restype = ctypes.c_bool +_lib.Z3_stats_is_uint.argtypes = [ContextObj, StatsObj, ctypes.c_uint] +_lib.Z3_stats_is_double.restype = ctypes.c_bool +_lib.Z3_stats_is_double.argtypes = [ContextObj, StatsObj, ctypes.c_uint] +_lib.Z3_stats_get_uint_value.restype = ctypes.c_uint +_lib.Z3_stats_get_uint_value.argtypes = [ContextObj, StatsObj, ctypes.c_uint] +_lib.Z3_stats_get_double_value.restype = ctypes.c_double +_lib.Z3_stats_get_double_value.argtypes = [ContextObj, StatsObj, ctypes.c_uint] +_lib.Z3_get_estimated_alloc_size.restype = ctypes.c_ulonglong +_lib.Z3_get_estimated_alloc_size.argtypes = [] +_lib.Z3_mk_ast_vector.restype = AstVectorObj +_lib.Z3_mk_ast_vector.argtypes = [ContextObj] +_lib.Z3_ast_vector_inc_ref.argtypes = [ContextObj, AstVectorObj] +_lib.Z3_ast_vector_dec_ref.argtypes = [ContextObj, AstVectorObj] +_lib.Z3_ast_vector_size.restype = ctypes.c_uint +_lib.Z3_ast_vector_size.argtypes = [ContextObj, AstVectorObj] +_lib.Z3_ast_vector_get.restype = Ast +_lib.Z3_ast_vector_get.argtypes = [ContextObj, AstVectorObj, ctypes.c_uint] +_lib.Z3_ast_vector_set.argtypes = [ContextObj, AstVectorObj, ctypes.c_uint, Ast] +_lib.Z3_ast_vector_resize.argtypes = [ContextObj, AstVectorObj, ctypes.c_uint] +_lib.Z3_ast_vector_push.argtypes = [ContextObj, AstVectorObj, Ast] +_lib.Z3_ast_vector_translate.restype = AstVectorObj +_lib.Z3_ast_vector_translate.argtypes = [ContextObj, AstVectorObj, ContextObj] +_lib.Z3_ast_vector_to_string.restype = ctypes.c_char_p +_lib.Z3_ast_vector_to_string.argtypes = [ContextObj, AstVectorObj] +_lib.Z3_mk_ast_map.restype = AstMapObj +_lib.Z3_mk_ast_map.argtypes = [ContextObj] +_lib.Z3_ast_map_inc_ref.argtypes = [ContextObj, AstMapObj] +_lib.Z3_ast_map_dec_ref.argtypes = [ContextObj, AstMapObj] +_lib.Z3_ast_map_contains.restype = ctypes.c_bool +_lib.Z3_ast_map_contains.argtypes = [ContextObj, AstMapObj, Ast] +_lib.Z3_ast_map_find.restype = Ast +_lib.Z3_ast_map_find.argtypes = [ContextObj, AstMapObj, Ast] +_lib.Z3_ast_map_insert.argtypes = [ContextObj, AstMapObj, Ast, Ast] +_lib.Z3_ast_map_erase.argtypes = [ContextObj, AstMapObj, Ast] +_lib.Z3_ast_map_reset.argtypes = [ContextObj, AstMapObj] +_lib.Z3_ast_map_size.restype = ctypes.c_uint +_lib.Z3_ast_map_size.argtypes = [ContextObj, AstMapObj] +_lib.Z3_ast_map_keys.restype = AstVectorObj +_lib.Z3_ast_map_keys.argtypes = [ContextObj, AstMapObj] +_lib.Z3_ast_map_to_string.restype = ctypes.c_char_p +_lib.Z3_ast_map_to_string.argtypes = [ContextObj, AstMapObj] +_lib.Z3_algebraic_is_value.restype = ctypes.c_bool +_lib.Z3_algebraic_is_value.argtypes = [ContextObj, Ast] +_lib.Z3_algebraic_is_pos.restype = ctypes.c_bool +_lib.Z3_algebraic_is_pos.argtypes = [ContextObj, Ast] +_lib.Z3_algebraic_is_neg.restype = ctypes.c_bool +_lib.Z3_algebraic_is_neg.argtypes = [ContextObj, Ast] +_lib.Z3_algebraic_is_zero.restype = ctypes.c_bool +_lib.Z3_algebraic_is_zero.argtypes = [ContextObj, Ast] +_lib.Z3_algebraic_sign.restype = ctypes.c_int +_lib.Z3_algebraic_sign.argtypes = [ContextObj, Ast] +_lib.Z3_algebraic_add.restype = Ast +_lib.Z3_algebraic_add.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_sub.restype = Ast +_lib.Z3_algebraic_sub.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_mul.restype = Ast +_lib.Z3_algebraic_mul.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_div.restype = Ast +_lib.Z3_algebraic_div.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_root.restype = Ast +_lib.Z3_algebraic_root.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_algebraic_power.restype = Ast +_lib.Z3_algebraic_power.argtypes = [ContextObj, Ast, ctypes.c_uint] +_lib.Z3_algebraic_lt.restype = ctypes.c_bool +_lib.Z3_algebraic_lt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_gt.restype = ctypes.c_bool +_lib.Z3_algebraic_gt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_le.restype = ctypes.c_bool +_lib.Z3_algebraic_le.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_ge.restype = ctypes.c_bool +_lib.Z3_algebraic_ge.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_eq.restype = ctypes.c_bool +_lib.Z3_algebraic_eq.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_neq.restype = ctypes.c_bool +_lib.Z3_algebraic_neq.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_algebraic_roots.restype = AstVectorObj +_lib.Z3_algebraic_roots.argtypes = [ContextObj, Ast, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_algebraic_eval.restype = ctypes.c_int +_lib.Z3_algebraic_eval.argtypes = [ContextObj, Ast, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_polynomial_subresultants.restype = AstVectorObj +_lib.Z3_polynomial_subresultants.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_rcf_del.argtypes = [ContextObj, RCFNumObj] +_lib.Z3_rcf_mk_rational.restype = RCFNumObj +_lib.Z3_rcf_mk_rational.argtypes = [ContextObj, ctypes.c_char_p] +_lib.Z3_rcf_mk_small_int.restype = RCFNumObj +_lib.Z3_rcf_mk_small_int.argtypes = [ContextObj, ctypes.c_int] +_lib.Z3_rcf_mk_pi.restype = RCFNumObj +_lib.Z3_rcf_mk_pi.argtypes = [ContextObj] +_lib.Z3_rcf_mk_e.restype = RCFNumObj +_lib.Z3_rcf_mk_e.argtypes = [ContextObj] +_lib.Z3_rcf_mk_infinitesimal.restype = RCFNumObj +_lib.Z3_rcf_mk_infinitesimal.argtypes = [ContextObj] +_lib.Z3_rcf_mk_roots.restype = ctypes.c_uint +_lib.Z3_rcf_mk_roots.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(RCFNumObj), ctypes.POINTER(RCFNumObj)] +_lib.Z3_rcf_add.restype = RCFNumObj +_lib.Z3_rcf_add.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_sub.restype = RCFNumObj +_lib.Z3_rcf_sub.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_mul.restype = RCFNumObj +_lib.Z3_rcf_mul.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_div.restype = RCFNumObj +_lib.Z3_rcf_div.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_neg.restype = RCFNumObj +_lib.Z3_rcf_neg.argtypes = [ContextObj, RCFNumObj] +_lib.Z3_rcf_inv.restype = RCFNumObj +_lib.Z3_rcf_inv.argtypes = [ContextObj, RCFNumObj] +_lib.Z3_rcf_power.restype = RCFNumObj +_lib.Z3_rcf_power.argtypes = [ContextObj, RCFNumObj, ctypes.c_uint] +_lib.Z3_rcf_lt.restype = ctypes.c_bool +_lib.Z3_rcf_lt.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_gt.restype = ctypes.c_bool +_lib.Z3_rcf_gt.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_le.restype = ctypes.c_bool +_lib.Z3_rcf_le.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_ge.restype = ctypes.c_bool +_lib.Z3_rcf_ge.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_eq.restype = ctypes.c_bool +_lib.Z3_rcf_eq.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_neq.restype = ctypes.c_bool +_lib.Z3_rcf_neq.argtypes = [ContextObj, RCFNumObj, RCFNumObj] +_lib.Z3_rcf_num_to_string.restype = ctypes.c_char_p +_lib.Z3_rcf_num_to_string.argtypes = [ContextObj, RCFNumObj, ctypes.c_bool, ctypes.c_bool] +_lib.Z3_rcf_num_to_decimal_string.restype = ctypes.c_char_p +_lib.Z3_rcf_num_to_decimal_string.argtypes = [ContextObj, RCFNumObj, ctypes.c_uint] +_lib.Z3_rcf_get_numerator_denominator.argtypes = [ContextObj, RCFNumObj, ctypes.POINTER(RCFNumObj), ctypes.POINTER(RCFNumObj)] +_lib.Z3_mk_fixedpoint.restype = FixedpointObj +_lib.Z3_mk_fixedpoint.argtypes = [ContextObj] +_lib.Z3_fixedpoint_inc_ref.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_dec_ref.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_add_rule.argtypes = [ContextObj, FixedpointObj, Ast, Symbol] +_lib.Z3_fixedpoint_add_fact.argtypes = [ContextObj, FixedpointObj, FuncDecl, ctypes.c_uint, ctypes.POINTER(ctypes.c_uint)] +_lib.Z3_fixedpoint_assert.argtypes = [ContextObj, FixedpointObj, Ast] +_lib.Z3_fixedpoint_query.restype = ctypes.c_int +_lib.Z3_fixedpoint_query.argtypes = [ContextObj, FixedpointObj, Ast] +_lib.Z3_fixedpoint_query_relations.restype = ctypes.c_int +_lib.Z3_fixedpoint_query_relations.argtypes = [ContextObj, FixedpointObj, ctypes.c_uint, ctypes.POINTER(FuncDecl)] +_lib.Z3_fixedpoint_get_answer.restype = Ast +_lib.Z3_fixedpoint_get_answer.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_get_reason_unknown.restype = ctypes.c_char_p +_lib.Z3_fixedpoint_get_reason_unknown.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_update_rule.argtypes = [ContextObj, FixedpointObj, Ast, Symbol] +_lib.Z3_fixedpoint_get_num_levels.restype = ctypes.c_uint +_lib.Z3_fixedpoint_get_num_levels.argtypes = [ContextObj, FixedpointObj, FuncDecl] +_lib.Z3_fixedpoint_get_cover_delta.restype = Ast +_lib.Z3_fixedpoint_get_cover_delta.argtypes = [ContextObj, FixedpointObj, ctypes.c_int, FuncDecl] +_lib.Z3_fixedpoint_add_cover.argtypes = [ContextObj, FixedpointObj, ctypes.c_int, FuncDecl, Ast] +_lib.Z3_fixedpoint_get_statistics.restype = StatsObj +_lib.Z3_fixedpoint_get_statistics.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_register_relation.argtypes = [ContextObj, FixedpointObj, FuncDecl] +_lib.Z3_fixedpoint_set_predicate_representation.argtypes = [ContextObj, FixedpointObj, FuncDecl, ctypes.c_uint, ctypes.POINTER(Symbol)] +_lib.Z3_fixedpoint_get_rules.restype = AstVectorObj +_lib.Z3_fixedpoint_get_rules.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_get_assertions.restype = AstVectorObj +_lib.Z3_fixedpoint_get_assertions.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_set_params.argtypes = [ContextObj, FixedpointObj, Params] +_lib.Z3_fixedpoint_get_help.restype = ctypes.c_char_p +_lib.Z3_fixedpoint_get_help.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_get_param_descrs.restype = ParamDescrs +_lib.Z3_fixedpoint_get_param_descrs.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_to_string.restype = ctypes.c_char_p +_lib.Z3_fixedpoint_to_string.argtypes = [ContextObj, FixedpointObj, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_fixedpoint_from_string.restype = AstVectorObj +_lib.Z3_fixedpoint_from_string.argtypes = [ContextObj, FixedpointObj, ctypes.c_char_p] +_lib.Z3_fixedpoint_from_file.restype = AstVectorObj +_lib.Z3_fixedpoint_from_file.argtypes = [ContextObj, FixedpointObj, ctypes.c_char_p] +_lib.Z3_fixedpoint_push.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_pop.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_mk_optimize.restype = OptimizeObj +_lib.Z3_mk_optimize.argtypes = [ContextObj] +_lib.Z3_optimize_inc_ref.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_dec_ref.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_assert.argtypes = [ContextObj, OptimizeObj, Ast] +_lib.Z3_optimize_assert_soft.restype = ctypes.c_uint +_lib.Z3_optimize_assert_soft.argtypes = [ContextObj, OptimizeObj, Ast, ctypes.c_char_p, Symbol] +_lib.Z3_optimize_maximize.restype = ctypes.c_uint +_lib.Z3_optimize_maximize.argtypes = [ContextObj, OptimizeObj, Ast] +_lib.Z3_optimize_minimize.restype = ctypes.c_uint +_lib.Z3_optimize_minimize.argtypes = [ContextObj, OptimizeObj, Ast] +_lib.Z3_optimize_push.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_pop.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_check.restype = ctypes.c_int +_lib.Z3_optimize_check.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_get_reason_unknown.restype = ctypes.c_char_p +_lib.Z3_optimize_get_reason_unknown.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_get_model.restype = Model +_lib.Z3_optimize_get_model.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_set_params.argtypes = [ContextObj, OptimizeObj, Params] +_lib.Z3_optimize_get_param_descrs.restype = ParamDescrs +_lib.Z3_optimize_get_param_descrs.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_get_lower.restype = Ast +_lib.Z3_optimize_get_lower.argtypes = [ContextObj, OptimizeObj, ctypes.c_uint] +_lib.Z3_optimize_get_upper.restype = Ast +_lib.Z3_optimize_get_upper.argtypes = [ContextObj, OptimizeObj, ctypes.c_uint] +_lib.Z3_optimize_get_lower_as_vector.restype = AstVectorObj +_lib.Z3_optimize_get_lower_as_vector.argtypes = [ContextObj, OptimizeObj, ctypes.c_uint] +_lib.Z3_optimize_get_upper_as_vector.restype = AstVectorObj +_lib.Z3_optimize_get_upper_as_vector.argtypes = [ContextObj, OptimizeObj, ctypes.c_uint] +_lib.Z3_optimize_to_string.restype = ctypes.c_char_p +_lib.Z3_optimize_to_string.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_from_string.argtypes = [ContextObj, OptimizeObj, ctypes.c_char_p] +_lib.Z3_optimize_from_file.argtypes = [ContextObj, OptimizeObj, ctypes.c_char_p] +_lib.Z3_optimize_get_help.restype = ctypes.c_char_p +_lib.Z3_optimize_get_help.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_get_statistics.restype = StatsObj +_lib.Z3_optimize_get_statistics.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_get_assertions.restype = AstVectorObj +_lib.Z3_optimize_get_assertions.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_optimize_get_objectives.restype = AstVectorObj +_lib.Z3_optimize_get_objectives.argtypes = [ContextObj, OptimizeObj] +_lib.Z3_mk_interpolant.restype = Ast +_lib.Z3_mk_interpolant.argtypes = [ContextObj, Ast] +_lib.Z3_mk_interpolation_context.restype = ContextObj +_lib.Z3_mk_interpolation_context.argtypes = [Config] +_lib.Z3_get_interpolant.restype = AstVectorObj +_lib.Z3_get_interpolant.argtypes = [ContextObj, Ast, Ast, Params] +_lib.Z3_compute_interpolant.restype = ctypes.c_int +_lib.Z3_compute_interpolant.argtypes = [ContextObj, Ast, Params, ctypes.POINTER(AstVectorObj), ctypes.POINTER(Model)] +_lib.Z3_interpolation_profile.restype = ctypes.c_char_p +_lib.Z3_interpolation_profile.argtypes = [ContextObj] +_lib.Z3_read_interpolation_problem.restype = ctypes.c_int +_lib.Z3_read_interpolation_problem.argtypes = [ContextObj, ctypes.POINTER(ctypes.c_uint), Ast, ctypes.c_uint, ctypes.c_char_p, ctypes.POINTER(ctypes.c_char_p), ctypes.POINTER(ctypes.c_uint), Ast] +_lib.Z3_check_interpolant.restype = ctypes.c_int +_lib.Z3_check_interpolant.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.POINTER(ctypes.c_uint), ctypes.POINTER(Ast), ctypes.POINTER(ctypes.c_char_p), ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_write_interpolation_problem.argtypes = [ContextObj, ctypes.c_uint, ctypes.POINTER(Ast), ctypes.POINTER(ctypes.c_uint), ctypes.c_char_p, ctypes.c_uint, ctypes.POINTER(Ast)] +_lib.Z3_mk_fpa_rounding_mode_sort.restype = Sort +_lib.Z3_mk_fpa_rounding_mode_sort.argtypes = [ContextObj] +_lib.Z3_mk_fpa_round_nearest_ties_to_even.restype = Ast +_lib.Z3_mk_fpa_round_nearest_ties_to_even.argtypes = [ContextObj] +_lib.Z3_mk_fpa_rne.restype = Ast +_lib.Z3_mk_fpa_rne.argtypes = [ContextObj] +_lib.Z3_mk_fpa_round_nearest_ties_to_away.restype = Ast +_lib.Z3_mk_fpa_round_nearest_ties_to_away.argtypes = [ContextObj] +_lib.Z3_mk_fpa_rna.restype = Ast +_lib.Z3_mk_fpa_rna.argtypes = [ContextObj] +_lib.Z3_mk_fpa_round_toward_positive.restype = Ast +_lib.Z3_mk_fpa_round_toward_positive.argtypes = [ContextObj] +_lib.Z3_mk_fpa_rtp.restype = Ast +_lib.Z3_mk_fpa_rtp.argtypes = [ContextObj] +_lib.Z3_mk_fpa_round_toward_negative.restype = Ast +_lib.Z3_mk_fpa_round_toward_negative.argtypes = [ContextObj] +_lib.Z3_mk_fpa_rtn.restype = Ast +_lib.Z3_mk_fpa_rtn.argtypes = [ContextObj] +_lib.Z3_mk_fpa_round_toward_zero.restype = Ast +_lib.Z3_mk_fpa_round_toward_zero.argtypes = [ContextObj] +_lib.Z3_mk_fpa_rtz.restype = Ast +_lib.Z3_mk_fpa_rtz.argtypes = [ContextObj] +_lib.Z3_mk_fpa_sort.restype = Sort +_lib.Z3_mk_fpa_sort.argtypes = [ContextObj, ctypes.c_uint, ctypes.c_uint] +_lib.Z3_mk_fpa_sort_half.restype = Sort +_lib.Z3_mk_fpa_sort_half.argtypes = [ContextObj] +_lib.Z3_mk_fpa_sort_16.restype = Sort +_lib.Z3_mk_fpa_sort_16.argtypes = [ContextObj] +_lib.Z3_mk_fpa_sort_single.restype = Sort +_lib.Z3_mk_fpa_sort_single.argtypes = [ContextObj] +_lib.Z3_mk_fpa_sort_32.restype = Sort +_lib.Z3_mk_fpa_sort_32.argtypes = [ContextObj] +_lib.Z3_mk_fpa_sort_double.restype = Sort +_lib.Z3_mk_fpa_sort_double.argtypes = [ContextObj] +_lib.Z3_mk_fpa_sort_64.restype = Sort +_lib.Z3_mk_fpa_sort_64.argtypes = [ContextObj] +_lib.Z3_mk_fpa_sort_quadruple.restype = Sort +_lib.Z3_mk_fpa_sort_quadruple.argtypes = [ContextObj] +_lib.Z3_mk_fpa_sort_128.restype = Sort +_lib.Z3_mk_fpa_sort_128.argtypes = [ContextObj] +_lib.Z3_mk_fpa_nan.restype = Ast +_lib.Z3_mk_fpa_nan.argtypes = [ContextObj, Sort] +_lib.Z3_mk_fpa_inf.restype = Ast +_lib.Z3_mk_fpa_inf.argtypes = [ContextObj, Sort, ctypes.c_bool] +_lib.Z3_mk_fpa_zero.restype = Ast +_lib.Z3_mk_fpa_zero.argtypes = [ContextObj, Sort, ctypes.c_bool] +_lib.Z3_mk_fpa_fp.restype = Ast +_lib.Z3_mk_fpa_fp.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_fpa_numeral_float.restype = Ast +_lib.Z3_mk_fpa_numeral_float.argtypes = [ContextObj, ctypes.c_float, Sort] +_lib.Z3_mk_fpa_numeral_double.restype = Ast +_lib.Z3_mk_fpa_numeral_double.argtypes = [ContextObj, ctypes.c_double, Sort] +_lib.Z3_mk_fpa_numeral_int.restype = Ast +_lib.Z3_mk_fpa_numeral_int.argtypes = [ContextObj, ctypes.c_int, Sort] +_lib.Z3_mk_fpa_numeral_int_uint.restype = Ast +_lib.Z3_mk_fpa_numeral_int_uint.argtypes = [ContextObj, ctypes.c_bool, ctypes.c_int, ctypes.c_uint, Sort] +_lib.Z3_mk_fpa_numeral_int64_uint64.restype = Ast +_lib.Z3_mk_fpa_numeral_int64_uint64.argtypes = [ContextObj, ctypes.c_bool, ctypes.c_longlong, ctypes.c_ulonglong, Sort] +_lib.Z3_mk_fpa_abs.restype = Ast +_lib.Z3_mk_fpa_abs.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_neg.restype = Ast +_lib.Z3_mk_fpa_neg.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_add.restype = Ast +_lib.Z3_mk_fpa_add.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_fpa_sub.restype = Ast +_lib.Z3_mk_fpa_sub.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_fpa_mul.restype = Ast +_lib.Z3_mk_fpa_mul.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_fpa_div.restype = Ast +_lib.Z3_mk_fpa_div.argtypes = [ContextObj, Ast, Ast, Ast] +_lib.Z3_mk_fpa_fma.restype = Ast +_lib.Z3_mk_fpa_fma.argtypes = [ContextObj, Ast, Ast, Ast, Ast] +_lib.Z3_mk_fpa_sqrt.restype = Ast +_lib.Z3_mk_fpa_sqrt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_rem.restype = Ast +_lib.Z3_mk_fpa_rem.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_round_to_integral.restype = Ast +_lib.Z3_mk_fpa_round_to_integral.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_min.restype = Ast +_lib.Z3_mk_fpa_min.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_max.restype = Ast +_lib.Z3_mk_fpa_max.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_leq.restype = Ast +_lib.Z3_mk_fpa_leq.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_lt.restype = Ast +_lib.Z3_mk_fpa_lt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_geq.restype = Ast +_lib.Z3_mk_fpa_geq.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_gt.restype = Ast +_lib.Z3_mk_fpa_gt.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_eq.restype = Ast +_lib.Z3_mk_fpa_eq.argtypes = [ContextObj, Ast, Ast] +_lib.Z3_mk_fpa_is_normal.restype = Ast +_lib.Z3_mk_fpa_is_normal.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_is_subnormal.restype = Ast +_lib.Z3_mk_fpa_is_subnormal.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_is_zero.restype = Ast +_lib.Z3_mk_fpa_is_zero.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_is_infinite.restype = Ast +_lib.Z3_mk_fpa_is_infinite.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_is_nan.restype = Ast +_lib.Z3_mk_fpa_is_nan.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_is_negative.restype = Ast +_lib.Z3_mk_fpa_is_negative.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_is_positive.restype = Ast +_lib.Z3_mk_fpa_is_positive.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_to_fp_bv.restype = Ast +_lib.Z3_mk_fpa_to_fp_bv.argtypes = [ContextObj, Ast, Sort] +_lib.Z3_mk_fpa_to_fp_float.restype = Ast +_lib.Z3_mk_fpa_to_fp_float.argtypes = [ContextObj, Ast, Ast, Sort] +_lib.Z3_mk_fpa_to_fp_real.restype = Ast +_lib.Z3_mk_fpa_to_fp_real.argtypes = [ContextObj, Ast, Ast, Sort] +_lib.Z3_mk_fpa_to_fp_signed.restype = Ast +_lib.Z3_mk_fpa_to_fp_signed.argtypes = [ContextObj, Ast, Ast, Sort] +_lib.Z3_mk_fpa_to_fp_unsigned.restype = Ast +_lib.Z3_mk_fpa_to_fp_unsigned.argtypes = [ContextObj, Ast, Ast, Sort] +_lib.Z3_mk_fpa_to_ubv.restype = Ast +_lib.Z3_mk_fpa_to_ubv.argtypes = [ContextObj, Ast, Ast, ctypes.c_uint] +_lib.Z3_mk_fpa_to_sbv.restype = Ast +_lib.Z3_mk_fpa_to_sbv.argtypes = [ContextObj, Ast, Ast, ctypes.c_uint] +_lib.Z3_mk_fpa_to_real.restype = Ast +_lib.Z3_mk_fpa_to_real.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_get_ebits.restype = ctypes.c_uint +_lib.Z3_fpa_get_ebits.argtypes = [ContextObj, Sort] +_lib.Z3_fpa_get_sbits.restype = ctypes.c_uint +_lib.Z3_fpa_get_sbits.argtypes = [ContextObj, Sort] +_lib.Z3_fpa_is_numeral_nan.restype = ctypes.c_bool +_lib.Z3_fpa_is_numeral_nan.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_is_numeral_inf.restype = ctypes.c_bool +_lib.Z3_fpa_is_numeral_inf.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_is_numeral_zero.restype = ctypes.c_bool +_lib.Z3_fpa_is_numeral_zero.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_is_numeral_normal.restype = ctypes.c_bool +_lib.Z3_fpa_is_numeral_normal.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_is_numeral_subnormal.restype = ctypes.c_bool +_lib.Z3_fpa_is_numeral_subnormal.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_is_numeral_positive.restype = ctypes.c_bool +_lib.Z3_fpa_is_numeral_positive.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_is_numeral_negative.restype = ctypes.c_bool +_lib.Z3_fpa_is_numeral_negative.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_get_numeral_sign_bv.restype = Ast +_lib.Z3_fpa_get_numeral_sign_bv.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_get_numeral_significand_bv.restype = Ast +_lib.Z3_fpa_get_numeral_significand_bv.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_get_numeral_sign.restype = ctypes.c_bool +_lib.Z3_fpa_get_numeral_sign.argtypes = [ContextObj, Ast, ctypes.POINTER(ctypes.c_int)] +_lib.Z3_fpa_get_numeral_significand_string.restype = ctypes.c_char_p +_lib.Z3_fpa_get_numeral_significand_string.argtypes = [ContextObj, Ast] +_lib.Z3_fpa_get_numeral_significand_uint64.restype = ctypes.c_bool +_lib.Z3_fpa_get_numeral_significand_uint64.argtypes = [ContextObj, Ast, ctypes.POINTER(ctypes.c_ulonglong)] +_lib.Z3_fpa_get_numeral_exponent_string.restype = ctypes.c_char_p +_lib.Z3_fpa_get_numeral_exponent_string.argtypes = [ContextObj, Ast, ctypes.c_bool] +_lib.Z3_fpa_get_numeral_exponent_int64.restype = ctypes.c_bool +_lib.Z3_fpa_get_numeral_exponent_int64.argtypes = [ContextObj, Ast, ctypes.POINTER(ctypes.c_longlong), ctypes.c_bool] +_lib.Z3_fpa_get_numeral_exponent_bv.restype = Ast +_lib.Z3_fpa_get_numeral_exponent_bv.argtypes = [ContextObj, Ast, ctypes.c_bool] +_lib.Z3_mk_fpa_to_ieee_bv.restype = Ast +_lib.Z3_mk_fpa_to_ieee_bv.argtypes = [ContextObj, Ast] +_lib.Z3_mk_fpa_to_fp_int_real.restype = Ast +_lib.Z3_mk_fpa_to_fp_int_real.argtypes = [ContextObj, Ast, Ast, Ast, Sort] +_lib.Z3_fixedpoint_query_from_lvl.restype = ctypes.c_int +_lib.Z3_fixedpoint_query_from_lvl.argtypes = [ContextObj, FixedpointObj, Ast, ctypes.c_uint] +_lib.Z3_fixedpoint_get_ground_sat_answer.restype = Ast +_lib.Z3_fixedpoint_get_ground_sat_answer.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_get_rules_along_trace.restype = AstVectorObj +_lib.Z3_fixedpoint_get_rules_along_trace.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_get_rule_names_along_trace.restype = Symbol +_lib.Z3_fixedpoint_get_rule_names_along_trace.argtypes = [ContextObj, FixedpointObj] +_lib.Z3_fixedpoint_add_invariant.argtypes = [ContextObj, FixedpointObj, FuncDecl, Ast] +_lib.Z3_fixedpoint_get_reachable.restype = Ast +_lib.Z3_fixedpoint_get_reachable.argtypes = [ContextObj, FixedpointObj, FuncDecl] +_lib.Z3_qe_model_project.restype = Ast +_lib.Z3_qe_model_project.argtypes = [ContextObj, Model, ctypes.c_uint, ctypes.POINTER(Ast), Ast] +_lib.Z3_qe_model_project_skolem.restype = Ast +_lib.Z3_qe_model_project_skolem.argtypes = [ContextObj, Model, ctypes.c_uint, ctypes.POINTER(Ast), Ast, AstMapObj] +_lib.Z3_model_extrapolate.restype = Ast +_lib.Z3_model_extrapolate.argtypes = [ContextObj, Model, Ast] +_lib.Z3_qe_lite.restype = Ast +_lib.Z3_qe_lite.argtypes = [ContextObj, AstVectorObj, Ast] + +class Elementaries: + def __init__(self, f): + self.f = f + self.get_error_code = _lib.Z3_get_error_code + self.get_error_message = _lib.Z3_get_error_msg + self.OK = Z3_OK + self.Exception = Z3Exception + + def Check(self, ctx): + err = self.get_error_code(ctx) + if err != self.OK: + raise self.Exception(self.get_error_message(ctx, err)) + +def Z3_set_error_handler(ctx, hndlr, _elems=Elementaries(_lib.Z3_set_error_handler)): + ceh = _error_handler_type(hndlr) + _elems.f(ctx, ceh) + _elems.Check(ctx) + return ceh + +def Z3_global_param_set(a0, a1, _elems=Elementaries(_lib.Z3_global_param_set)): + _elems.f(_to_ascii(a0), _to_ascii(a1)) + +def Z3_global_param_reset_all(_elems=Elementaries(_lib.Z3_global_param_reset_all)): + _elems.f() + +def Z3_global_param_get(a0, a1, _elems=Elementaries(_lib.Z3_global_param_get)): + r = _elems.f(_to_ascii(a0), _to_ascii(a1)) + return r + +def Z3_mk_config(_elems=Elementaries(_lib.Z3_mk_config)): + r = _elems.f() + return r + +def Z3_del_config(a0, _elems=Elementaries(_lib.Z3_del_config)): + _elems.f(a0) + +def Z3_set_param_value(a0, a1, a2, _elems=Elementaries(_lib.Z3_set_param_value)): + _elems.f(a0, _to_ascii(a1), _to_ascii(a2)) + +def Z3_mk_context(a0, _elems=Elementaries(_lib.Z3_mk_context)): + r = _elems.f(a0) + return r + +def Z3_mk_context_rc(a0, _elems=Elementaries(_lib.Z3_mk_context_rc)): + r = _elems.f(a0) + return r + +def Z3_del_context(a0, _elems=Elementaries(_lib.Z3_del_context)): + _elems.f(a0) + +def Z3_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_update_param_value(a0, a1, a2, _elems=Elementaries(_lib.Z3_update_param_value)): + _elems.f(a0, _to_ascii(a1), _to_ascii(a2)) + _elems.Check(a0) + +def Z3_interrupt(a0, _elems=Elementaries(_lib.Z3_interrupt)): + _elems.f(a0) + _elems.Check(a0) + +def Z3_mk_params(a0, _elems=Elementaries(_lib.Z3_mk_params)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_params_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_params_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_params_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_params_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_params_set_bool(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_params_set_bool)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_params_set_uint(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_params_set_uint)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_params_set_double(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_params_set_double)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_params_set_symbol(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_params_set_symbol)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_params_to_string(a0, a1, _elems=Elementaries(_lib.Z3_params_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_params_validate(a0, a1, a2, _elems=Elementaries(_lib.Z3_params_validate)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_param_descrs_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_param_descrs_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_param_descrs_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_param_descrs_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_param_descrs_get_kind(a0, a1, a2, _elems=Elementaries(_lib.Z3_param_descrs_get_kind)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_param_descrs_size(a0, a1, _elems=Elementaries(_lib.Z3_param_descrs_size)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_param_descrs_get_name(a0, a1, a2, _elems=Elementaries(_lib.Z3_param_descrs_get_name)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_param_descrs_get_documentation(a0, a1, a2, _elems=Elementaries(_lib.Z3_param_descrs_get_documentation)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_param_descrs_to_string(a0, a1, _elems=Elementaries(_lib.Z3_param_descrs_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_mk_int_symbol(a0, a1, _elems=Elementaries(_lib.Z3_mk_int_symbol)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_string_symbol(a0, a1, _elems=Elementaries(_lib.Z3_mk_string_symbol)): + r = _elems.f(a0, _to_ascii(a1)) + _elems.Check(a0) + return r + +def Z3_mk_uninterpreted_sort(a0, a1, _elems=Elementaries(_lib.Z3_mk_uninterpreted_sort)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_bool_sort(a0, _elems=Elementaries(_lib.Z3_mk_bool_sort)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_int_sort(a0, _elems=Elementaries(_lib.Z3_mk_int_sort)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_real_sort(a0, _elems=Elementaries(_lib.Z3_mk_real_sort)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_bv_sort(a0, a1, _elems=Elementaries(_lib.Z3_mk_bv_sort)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_finite_domain_sort(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_finite_domain_sort)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_array_sort(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_array_sort)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_array_sort_n(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_array_sort_n)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_tuple_sort(a0, a1, a2, a3, a4, a5, a6, _elems=Elementaries(_lib.Z3_mk_tuple_sort)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6) + _elems.Check(a0) + return r + +def Z3_mk_enumeration_sort(a0, a1, a2, a3, a4, a5, _elems=Elementaries(_lib.Z3_mk_enumeration_sort)): + r = _elems.f(a0, a1, a2, a3, a4, a5) + _elems.Check(a0) + return r + +def Z3_mk_list_sort(a0, a1, a2, a3, a4, a5, a6, a7, a8, _elems=Elementaries(_lib.Z3_mk_list_sort)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6, a7, a8) + _elems.Check(a0) + return r + +def Z3_mk_constructor(a0, a1, a2, a3, a4, a5, a6, _elems=Elementaries(_lib.Z3_mk_constructor)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6) + _elems.Check(a0) + return r + +def Z3_del_constructor(a0, a1, _elems=Elementaries(_lib.Z3_del_constructor)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_mk_datatype(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_datatype)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_constructor_list(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_constructor_list)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_del_constructor_list(a0, a1, _elems=Elementaries(_lib.Z3_del_constructor_list)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_mk_datatypes(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_datatypes)): + _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + +def Z3_query_constructor(a0, a1, a2, a3, a4, a5, _elems=Elementaries(_lib.Z3_query_constructor)): + _elems.f(a0, a1, a2, a3, a4, a5) + _elems.Check(a0) + +def Z3_mk_func_decl(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_func_decl)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_mk_app(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_app)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_const(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_const)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fresh_func_decl(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_fresh_func_decl)): + r = _elems.f(a0, _to_ascii(a1), a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_mk_fresh_const(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fresh_const)): + r = _elems.f(a0, _to_ascii(a1), a2) + _elems.Check(a0) + return r + +def Z3_mk_true(a0, _elems=Elementaries(_lib.Z3_mk_true)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_false(a0, _elems=Elementaries(_lib.Z3_mk_false)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_eq(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_eq)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_distinct(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_distinct)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_not(a0, a1, _elems=Elementaries(_lib.Z3_mk_not)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_ite(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_ite)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_iff(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_iff)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_implies(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_implies)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_xor(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_xor)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_and(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_and)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_or(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_or)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_add(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_add)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_mul(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_mul)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_sub(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_sub)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_unary_minus(a0, a1, _elems=Elementaries(_lib.Z3_mk_unary_minus)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_div(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_div)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_mod(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_mod)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_rem(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_rem)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_power(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_power)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_lt(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_lt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_le(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_le)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_gt(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_gt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_ge(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_ge)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_int2real(a0, a1, _elems=Elementaries(_lib.Z3_mk_int2real)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_real2int(a0, a1, _elems=Elementaries(_lib.Z3_mk_real2int)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_is_int(a0, a1, _elems=Elementaries(_lib.Z3_mk_is_int)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_bvnot(a0, a1, _elems=Elementaries(_lib.Z3_mk_bvnot)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_bvredand(a0, a1, _elems=Elementaries(_lib.Z3_mk_bvredand)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_bvredor(a0, a1, _elems=Elementaries(_lib.Z3_mk_bvredor)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_bvand(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvand)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvor(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvor)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvxor(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvxor)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvnand(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvnand)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvnor(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvnor)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvxnor(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvxnor)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvneg(a0, a1, _elems=Elementaries(_lib.Z3_mk_bvneg)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_bvadd(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvadd)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvsub(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvsub)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvmul(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvmul)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvudiv(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvudiv)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvsdiv(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvsdiv)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvurem(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvurem)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvsrem(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvsrem)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvsmod(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvsmod)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvult(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvult)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvslt(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvslt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvule(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvule)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvsle(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvsle)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvuge(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvuge)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvsge(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvsge)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvugt(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvugt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvsgt(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvsgt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_concat(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_concat)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_extract(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_extract)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_sign_ext(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_sign_ext)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_zero_ext(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_zero_ext)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_repeat(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_repeat)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvshl(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvshl)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvlshr(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvlshr)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvashr(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvashr)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_rotate_left(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_rotate_left)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_rotate_right(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_rotate_right)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_ext_rotate_left(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_ext_rotate_left)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_ext_rotate_right(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_ext_rotate_right)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_int2bv(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_int2bv)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bv2int(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bv2int)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvadd_no_overflow(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_bvadd_no_overflow)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_bvadd_no_underflow(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvadd_no_underflow)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvsub_no_overflow(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvsub_no_overflow)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvsub_no_underflow(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_bvsub_no_underflow)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_bvsdiv_no_overflow(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvsdiv_no_overflow)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bvneg_no_overflow(a0, a1, _elems=Elementaries(_lib.Z3_mk_bvneg_no_overflow)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_bvmul_no_overflow(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_bvmul_no_overflow)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_bvmul_no_underflow(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bvmul_no_underflow)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_select(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_select)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_select_n(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_select_n)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_store(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_store)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_store_n(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_store_n)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_mk_const_array(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_const_array)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_map(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_map)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_array_default(a0, a1, _elems=Elementaries(_lib.Z3_mk_array_default)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_as_array(a0, a1, _elems=Elementaries(_lib.Z3_mk_as_array)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_set_sort(a0, a1, _elems=Elementaries(_lib.Z3_mk_set_sort)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_empty_set(a0, a1, _elems=Elementaries(_lib.Z3_mk_empty_set)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_full_set(a0, a1, _elems=Elementaries(_lib.Z3_mk_full_set)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_set_add(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_set_add)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_set_del(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_set_del)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_set_union(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_set_union)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_set_intersect(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_set_intersect)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_set_difference(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_set_difference)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_set_complement(a0, a1, _elems=Elementaries(_lib.Z3_mk_set_complement)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_set_member(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_set_member)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_set_subset(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_set_subset)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_array_ext(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_array_ext)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_numeral(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_numeral)): + r = _elems.f(a0, _to_ascii(a1), a2) + _elems.Check(a0) + return r + +def Z3_mk_real(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_real)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_int(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_int)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_unsigned_int(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_unsigned_int)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_int64(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_int64)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_unsigned_int64(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_unsigned_int64)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bv_numeral(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bv_numeral)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_seq_sort(a0, a1, _elems=Elementaries(_lib.Z3_mk_seq_sort)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_is_seq_sort(a0, a1, _elems=Elementaries(_lib.Z3_is_seq_sort)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_re_sort(a0, a1, _elems=Elementaries(_lib.Z3_mk_re_sort)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_is_re_sort(a0, a1, _elems=Elementaries(_lib.Z3_is_re_sort)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_string_sort(a0, _elems=Elementaries(_lib.Z3_mk_string_sort)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_is_string_sort(a0, a1, _elems=Elementaries(_lib.Z3_is_string_sort)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_string(a0, a1, _elems=Elementaries(_lib.Z3_mk_string)): + r = _elems.f(a0, _to_ascii(a1)) + _elems.Check(a0) + return r + +def Z3_is_string(a0, a1, _elems=Elementaries(_lib.Z3_is_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_string(a0, a1, _elems=Elementaries(_lib.Z3_get_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_mk_seq_empty(a0, a1, _elems=Elementaries(_lib.Z3_mk_seq_empty)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_seq_unit(a0, a1, _elems=Elementaries(_lib.Z3_mk_seq_unit)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_seq_concat(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_seq_concat)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_seq_prefix(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_seq_prefix)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_seq_suffix(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_seq_suffix)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_seq_contains(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_seq_contains)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_seq_extract(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_seq_extract)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_seq_replace(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_seq_replace)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_seq_at(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_seq_at)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_seq_length(a0, a1, _elems=Elementaries(_lib.Z3_mk_seq_length)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_seq_index(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_seq_index)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_str_to_int(a0, a1, _elems=Elementaries(_lib.Z3_mk_str_to_int)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_int_to_str(a0, a1, _elems=Elementaries(_lib.Z3_mk_int_to_str)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_seq_to_re(a0, a1, _elems=Elementaries(_lib.Z3_mk_seq_to_re)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_seq_in_re(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_seq_in_re)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_re_plus(a0, a1, _elems=Elementaries(_lib.Z3_mk_re_plus)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_re_star(a0, a1, _elems=Elementaries(_lib.Z3_mk_re_star)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_re_option(a0, a1, _elems=Elementaries(_lib.Z3_mk_re_option)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_re_union(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_re_union)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_re_concat(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_re_concat)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_re_range(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_re_range)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_re_loop(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_re_loop)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_re_intersect(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_re_intersect)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_re_complement(a0, a1, _elems=Elementaries(_lib.Z3_mk_re_complement)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_re_empty(a0, a1, _elems=Elementaries(_lib.Z3_mk_re_empty)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_re_full(a0, a1, _elems=Elementaries(_lib.Z3_mk_re_full)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_pattern(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_pattern)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_bound(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_bound)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_forall(a0, a1, a2, a3, a4, a5, a6, a7, _elems=Elementaries(_lib.Z3_mk_forall)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6, a7) + _elems.Check(a0) + return r + +def Z3_mk_exists(a0, a1, a2, a3, a4, a5, a6, a7, _elems=Elementaries(_lib.Z3_mk_exists)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6, a7) + _elems.Check(a0) + return r + +def Z3_mk_quantifier(a0, a1, a2, a3, a4, a5, a6, a7, a8, _elems=Elementaries(_lib.Z3_mk_quantifier)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6, a7, a8) + _elems.Check(a0) + return r + +def Z3_mk_quantifier_ex(a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, _elems=Elementaries(_lib.Z3_mk_quantifier_ex)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12) + _elems.Check(a0) + return r + +def Z3_mk_forall_const(a0, a1, a2, a3, a4, a5, a6, _elems=Elementaries(_lib.Z3_mk_forall_const)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6) + _elems.Check(a0) + return r + +def Z3_mk_exists_const(a0, a1, a2, a3, a4, a5, a6, _elems=Elementaries(_lib.Z3_mk_exists_const)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6) + _elems.Check(a0) + return r + +def Z3_mk_quantifier_const(a0, a1, a2, a3, a4, a5, a6, a7, _elems=Elementaries(_lib.Z3_mk_quantifier_const)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6, a7) + _elems.Check(a0) + return r + +def Z3_mk_quantifier_const_ex(a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, _elems=Elementaries(_lib.Z3_mk_quantifier_const_ex)): + r = _elems.f(a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11) + _elems.Check(a0) + return r + +def Z3_get_symbol_kind(a0, a1, _elems=Elementaries(_lib.Z3_get_symbol_kind)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_symbol_int(a0, a1, _elems=Elementaries(_lib.Z3_get_symbol_int)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_symbol_string(a0, a1, _elems=Elementaries(_lib.Z3_get_symbol_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_get_sort_name(a0, a1, _elems=Elementaries(_lib.Z3_get_sort_name)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_sort_id(a0, a1, _elems=Elementaries(_lib.Z3_get_sort_id)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_sort_to_ast(a0, a1, _elems=Elementaries(_lib.Z3_sort_to_ast)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_is_eq_sort(a0, a1, a2, _elems=Elementaries(_lib.Z3_is_eq_sort)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_sort_kind(a0, a1, _elems=Elementaries(_lib.Z3_get_sort_kind)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_bv_sort_size(a0, a1, _elems=Elementaries(_lib.Z3_get_bv_sort_size)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_finite_domain_sort_size(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_finite_domain_sort_size)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_array_sort_domain(a0, a1, _elems=Elementaries(_lib.Z3_get_array_sort_domain)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_array_sort_range(a0, a1, _elems=Elementaries(_lib.Z3_get_array_sort_range)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_tuple_sort_mk_decl(a0, a1, _elems=Elementaries(_lib.Z3_get_tuple_sort_mk_decl)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_tuple_sort_num_fields(a0, a1, _elems=Elementaries(_lib.Z3_get_tuple_sort_num_fields)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_tuple_sort_field_decl(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_tuple_sort_field_decl)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_datatype_sort_num_constructors(a0, a1, _elems=Elementaries(_lib.Z3_get_datatype_sort_num_constructors)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_datatype_sort_constructor(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_datatype_sort_constructor)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_datatype_sort_recognizer(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_datatype_sort_recognizer)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_datatype_sort_constructor_accessor(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_get_datatype_sort_constructor_accessor)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_datatype_update_field(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_datatype_update_field)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_get_relation_arity(a0, a1, _elems=Elementaries(_lib.Z3_get_relation_arity)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_relation_column(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_relation_column)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_atmost(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_atmost)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_atleast(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_atleast)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_pble(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_pble)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_mk_pbge(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_pbge)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_mk_pbeq(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_pbeq)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_func_decl_to_ast(a0, a1, _elems=Elementaries(_lib.Z3_func_decl_to_ast)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_is_eq_func_decl(a0, a1, a2, _elems=Elementaries(_lib.Z3_is_eq_func_decl)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_func_decl_id(a0, a1, _elems=Elementaries(_lib.Z3_get_func_decl_id)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_decl_name(a0, a1, _elems=Elementaries(_lib.Z3_get_decl_name)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_decl_kind(a0, a1, _elems=Elementaries(_lib.Z3_get_decl_kind)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_domain_size(a0, a1, _elems=Elementaries(_lib.Z3_get_domain_size)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_arity(a0, a1, _elems=Elementaries(_lib.Z3_get_arity)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_domain(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_domain)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_range(a0, a1, _elems=Elementaries(_lib.Z3_get_range)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_decl_num_parameters(a0, a1, _elems=Elementaries(_lib.Z3_get_decl_num_parameters)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_decl_parameter_kind(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_decl_parameter_kind)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_decl_int_parameter(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_decl_int_parameter)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_decl_double_parameter(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_decl_double_parameter)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_decl_symbol_parameter(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_decl_symbol_parameter)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_decl_sort_parameter(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_decl_sort_parameter)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_decl_ast_parameter(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_decl_ast_parameter)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_decl_func_decl_parameter(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_decl_func_decl_parameter)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_decl_rational_parameter(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_decl_rational_parameter)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_app_to_ast(a0, a1, _elems=Elementaries(_lib.Z3_app_to_ast)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_app_decl(a0, a1, _elems=Elementaries(_lib.Z3_get_app_decl)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_app_num_args(a0, a1, _elems=Elementaries(_lib.Z3_get_app_num_args)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_app_arg(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_app_arg)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_is_eq_ast(a0, a1, a2, _elems=Elementaries(_lib.Z3_is_eq_ast)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_ast_id(a0, a1, _elems=Elementaries(_lib.Z3_get_ast_id)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_ast_hash(a0, a1, _elems=Elementaries(_lib.Z3_get_ast_hash)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_sort(a0, a1, _elems=Elementaries(_lib.Z3_get_sort)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_is_well_sorted(a0, a1, _elems=Elementaries(_lib.Z3_is_well_sorted)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_bool_value(a0, a1, _elems=Elementaries(_lib.Z3_get_bool_value)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_ast_kind(a0, a1, _elems=Elementaries(_lib.Z3_get_ast_kind)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_is_app(a0, a1, _elems=Elementaries(_lib.Z3_is_app)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_is_numeral_ast(a0, a1, _elems=Elementaries(_lib.Z3_is_numeral_ast)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_is_algebraic_number(a0, a1, _elems=Elementaries(_lib.Z3_is_algebraic_number)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_to_app(a0, a1, _elems=Elementaries(_lib.Z3_to_app)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_to_func_decl(a0, a1, _elems=Elementaries(_lib.Z3_to_func_decl)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_numeral_string(a0, a1, _elems=Elementaries(_lib.Z3_get_numeral_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_get_numeral_decimal_string(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_numeral_decimal_string)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_get_numerator(a0, a1, _elems=Elementaries(_lib.Z3_get_numerator)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_denominator(a0, a1, _elems=Elementaries(_lib.Z3_get_denominator)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_numeral_small(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_get_numeral_small)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_get_numeral_int(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_numeral_int)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_numeral_uint(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_numeral_uint)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_numeral_uint64(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_numeral_uint64)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_numeral_int64(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_numeral_int64)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_numeral_rational_int64(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_get_numeral_rational_int64)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_get_algebraic_number_lower(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_algebraic_number_lower)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_algebraic_number_upper(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_algebraic_number_upper)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_pattern_to_ast(a0, a1, _elems=Elementaries(_lib.Z3_pattern_to_ast)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_pattern_num_terms(a0, a1, _elems=Elementaries(_lib.Z3_get_pattern_num_terms)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_pattern(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_pattern)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_index_value(a0, a1, _elems=Elementaries(_lib.Z3_get_index_value)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_is_quantifier_forall(a0, a1, _elems=Elementaries(_lib.Z3_is_quantifier_forall)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_quantifier_weight(a0, a1, _elems=Elementaries(_lib.Z3_get_quantifier_weight)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_quantifier_num_patterns(a0, a1, _elems=Elementaries(_lib.Z3_get_quantifier_num_patterns)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_quantifier_pattern_ast(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_quantifier_pattern_ast)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_quantifier_num_no_patterns(a0, a1, _elems=Elementaries(_lib.Z3_get_quantifier_num_no_patterns)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_quantifier_no_pattern_ast(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_quantifier_no_pattern_ast)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_quantifier_num_bound(a0, a1, _elems=Elementaries(_lib.Z3_get_quantifier_num_bound)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_quantifier_bound_name(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_quantifier_bound_name)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_quantifier_bound_sort(a0, a1, a2, _elems=Elementaries(_lib.Z3_get_quantifier_bound_sort)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_quantifier_body(a0, a1, _elems=Elementaries(_lib.Z3_get_quantifier_body)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_simplify(a0, a1, _elems=Elementaries(_lib.Z3_simplify)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_simplify_ex(a0, a1, a2, _elems=Elementaries(_lib.Z3_simplify_ex)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_simplify_get_help(a0, _elems=Elementaries(_lib.Z3_simplify_get_help)): + r = _elems.f(a0) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_simplify_get_param_descrs(a0, _elems=Elementaries(_lib.Z3_simplify_get_param_descrs)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_update_term(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_update_term)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_substitute(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_substitute)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_substitute_vars(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_substitute_vars)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_translate(a0, a1, a2, _elems=Elementaries(_lib.Z3_translate)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_model(a0, _elems=Elementaries(_lib.Z3_mk_model)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_model_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_model_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_model_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_model_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_model_eval(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_model_eval)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_model_get_const_interp(a0, a1, a2, _elems=Elementaries(_lib.Z3_model_get_const_interp)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_model_has_interp(a0, a1, a2, _elems=Elementaries(_lib.Z3_model_has_interp)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_model_get_func_interp(a0, a1, a2, _elems=Elementaries(_lib.Z3_model_get_func_interp)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_model_get_num_consts(a0, a1, _elems=Elementaries(_lib.Z3_model_get_num_consts)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_model_get_const_decl(a0, a1, a2, _elems=Elementaries(_lib.Z3_model_get_const_decl)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_model_get_num_funcs(a0, a1, _elems=Elementaries(_lib.Z3_model_get_num_funcs)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_model_get_func_decl(a0, a1, a2, _elems=Elementaries(_lib.Z3_model_get_func_decl)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_model_get_num_sorts(a0, a1, _elems=Elementaries(_lib.Z3_model_get_num_sorts)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_model_get_sort(a0, a1, a2, _elems=Elementaries(_lib.Z3_model_get_sort)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_model_get_sort_universe(a0, a1, a2, _elems=Elementaries(_lib.Z3_model_get_sort_universe)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_is_as_array(a0, a1, _elems=Elementaries(_lib.Z3_is_as_array)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_as_array_func_decl(a0, a1, _elems=Elementaries(_lib.Z3_get_as_array_func_decl)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_add_func_interp(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_add_func_interp)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_add_const_interp(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_add_const_interp)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_func_interp_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_func_interp_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_func_interp_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_func_interp_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_func_interp_get_num_entries(a0, a1, _elems=Elementaries(_lib.Z3_func_interp_get_num_entries)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_func_interp_get_entry(a0, a1, a2, _elems=Elementaries(_lib.Z3_func_interp_get_entry)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_func_interp_get_else(a0, a1, _elems=Elementaries(_lib.Z3_func_interp_get_else)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_func_interp_set_else(a0, a1, a2, _elems=Elementaries(_lib.Z3_func_interp_set_else)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_func_interp_get_arity(a0, a1, _elems=Elementaries(_lib.Z3_func_interp_get_arity)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_func_interp_add_entry(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_func_interp_add_entry)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_func_entry_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_func_entry_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_func_entry_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_func_entry_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_func_entry_get_value(a0, a1, _elems=Elementaries(_lib.Z3_func_entry_get_value)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_func_entry_get_num_args(a0, a1, _elems=Elementaries(_lib.Z3_func_entry_get_num_args)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_func_entry_get_arg(a0, a1, a2, _elems=Elementaries(_lib.Z3_func_entry_get_arg)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_open_log(a0, _elems=Elementaries(_lib.Z3_open_log)): + r = _elems.f(_to_ascii(a0)) + return r + +def Z3_append_log(a0, _elems=Elementaries(_lib.Z3_append_log)): + _elems.f(_to_ascii(a0)) + +def Z3_close_log(_elems=Elementaries(_lib.Z3_close_log)): + _elems.f() + +def Z3_toggle_warning_messages(a0, _elems=Elementaries(_lib.Z3_toggle_warning_messages)): + _elems.f(a0) + +def Z3_set_ast_print_mode(a0, a1, _elems=Elementaries(_lib.Z3_set_ast_print_mode)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_ast_to_string(a0, a1, _elems=Elementaries(_lib.Z3_ast_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_pattern_to_string(a0, a1, _elems=Elementaries(_lib.Z3_pattern_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_sort_to_string(a0, a1, _elems=Elementaries(_lib.Z3_sort_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_func_decl_to_string(a0, a1, _elems=Elementaries(_lib.Z3_func_decl_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_model_to_string(a0, a1, _elems=Elementaries(_lib.Z3_model_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_benchmark_to_smtlib_string(a0, a1, a2, a3, a4, a5, a6, a7, _elems=Elementaries(_lib.Z3_benchmark_to_smtlib_string)): + r = _elems.f(a0, _to_ascii(a1), _to_ascii(a2), _to_ascii(a3), _to_ascii(a4), a5, a6, a7) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_parse_smtlib2_string(a0, a1, a2, a3, a4, a5, a6, a7, _elems=Elementaries(_lib.Z3_parse_smtlib2_string)): + r = _elems.f(a0, _to_ascii(a1), a2, a3, a4, a5, a6, a7) + _elems.Check(a0) + return r + +def Z3_parse_smtlib2_file(a0, a1, a2, a3, a4, a5, a6, a7, _elems=Elementaries(_lib.Z3_parse_smtlib2_file)): + r = _elems.f(a0, _to_ascii(a1), a2, a3, a4, a5, a6, a7) + _elems.Check(a0) + return r + +def Z3_get_parser_error(a0, _elems=Elementaries(_lib.Z3_get_parser_error)): + r = _elems.f(a0) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_get_error_code(a0, _elems=Elementaries(_lib.Z3_get_error_code)): + r = _elems.f(a0) + return r + +def Z3_set_error(a0, a1, _elems=Elementaries(_lib.Z3_set_error)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_get_error_msg(a0, a1, _elems=Elementaries(_lib.Z3_get_error_msg)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_get_version(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_get_version)): + _elems.f(a0, a1, a2, a3) + +def Z3_get_full_version(_elems=Elementaries(_lib.Z3_get_full_version)): + r = _elems.f() + return _to_pystr(r) + +def Z3_enable_trace(a0, _elems=Elementaries(_lib.Z3_enable_trace)): + _elems.f(_to_ascii(a0)) + +def Z3_disable_trace(a0, _elems=Elementaries(_lib.Z3_disable_trace)): + _elems.f(_to_ascii(a0)) + +def Z3_reset_memory(_elems=Elementaries(_lib.Z3_reset_memory)): + _elems.f() + +def Z3_finalize_memory(_elems=Elementaries(_lib.Z3_finalize_memory)): + _elems.f() + +def Z3_mk_goal(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_goal)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_goal_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_goal_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_goal_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_goal_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_goal_precision(a0, a1, _elems=Elementaries(_lib.Z3_goal_precision)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_goal_assert(a0, a1, a2, _elems=Elementaries(_lib.Z3_goal_assert)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_goal_inconsistent(a0, a1, _elems=Elementaries(_lib.Z3_goal_inconsistent)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_goal_depth(a0, a1, _elems=Elementaries(_lib.Z3_goal_depth)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_goal_reset(a0, a1, _elems=Elementaries(_lib.Z3_goal_reset)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_goal_size(a0, a1, _elems=Elementaries(_lib.Z3_goal_size)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_goal_formula(a0, a1, a2, _elems=Elementaries(_lib.Z3_goal_formula)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_goal_num_exprs(a0, a1, _elems=Elementaries(_lib.Z3_goal_num_exprs)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_goal_is_decided_sat(a0, a1, _elems=Elementaries(_lib.Z3_goal_is_decided_sat)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_goal_is_decided_unsat(a0, a1, _elems=Elementaries(_lib.Z3_goal_is_decided_unsat)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_goal_translate(a0, a1, a2, _elems=Elementaries(_lib.Z3_goal_translate)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_goal_to_string(a0, a1, _elems=Elementaries(_lib.Z3_goal_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_mk_tactic(a0, a1, _elems=Elementaries(_lib.Z3_mk_tactic)): + r = _elems.f(a0, _to_ascii(a1)) + _elems.Check(a0) + return r + +def Z3_tactic_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_tactic_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_tactic_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_tactic_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_mk_probe(a0, a1, _elems=Elementaries(_lib.Z3_mk_probe)): + r = _elems.f(a0, _to_ascii(a1)) + _elems.Check(a0) + return r + +def Z3_probe_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_probe_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_probe_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_probe_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_tactic_and_then(a0, a1, a2, _elems=Elementaries(_lib.Z3_tactic_and_then)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_tactic_or_else(a0, a1, a2, _elems=Elementaries(_lib.Z3_tactic_or_else)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_tactic_par_or(a0, a1, a2, _elems=Elementaries(_lib.Z3_tactic_par_or)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_tactic_par_and_then(a0, a1, a2, _elems=Elementaries(_lib.Z3_tactic_par_and_then)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_tactic_try_for(a0, a1, a2, _elems=Elementaries(_lib.Z3_tactic_try_for)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_tactic_when(a0, a1, a2, _elems=Elementaries(_lib.Z3_tactic_when)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_tactic_cond(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_tactic_cond)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_tactic_repeat(a0, a1, a2, _elems=Elementaries(_lib.Z3_tactic_repeat)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_tactic_skip(a0, _elems=Elementaries(_lib.Z3_tactic_skip)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_tactic_fail(a0, _elems=Elementaries(_lib.Z3_tactic_fail)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_tactic_fail_if(a0, a1, _elems=Elementaries(_lib.Z3_tactic_fail_if)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_tactic_fail_if_not_decided(a0, _elems=Elementaries(_lib.Z3_tactic_fail_if_not_decided)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_tactic_using_params(a0, a1, a2, _elems=Elementaries(_lib.Z3_tactic_using_params)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_probe_const(a0, a1, _elems=Elementaries(_lib.Z3_probe_const)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_probe_lt(a0, a1, a2, _elems=Elementaries(_lib.Z3_probe_lt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_probe_gt(a0, a1, a2, _elems=Elementaries(_lib.Z3_probe_gt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_probe_le(a0, a1, a2, _elems=Elementaries(_lib.Z3_probe_le)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_probe_ge(a0, a1, a2, _elems=Elementaries(_lib.Z3_probe_ge)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_probe_eq(a0, a1, a2, _elems=Elementaries(_lib.Z3_probe_eq)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_probe_and(a0, a1, a2, _elems=Elementaries(_lib.Z3_probe_and)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_probe_or(a0, a1, a2, _elems=Elementaries(_lib.Z3_probe_or)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_probe_not(a0, a1, _elems=Elementaries(_lib.Z3_probe_not)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_get_num_tactics(a0, _elems=Elementaries(_lib.Z3_get_num_tactics)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_get_tactic_name(a0, a1, _elems=Elementaries(_lib.Z3_get_tactic_name)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_get_num_probes(a0, _elems=Elementaries(_lib.Z3_get_num_probes)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_get_probe_name(a0, a1, _elems=Elementaries(_lib.Z3_get_probe_name)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_tactic_get_help(a0, a1, _elems=Elementaries(_lib.Z3_tactic_get_help)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_tactic_get_param_descrs(a0, a1, _elems=Elementaries(_lib.Z3_tactic_get_param_descrs)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_tactic_get_descr(a0, a1, _elems=Elementaries(_lib.Z3_tactic_get_descr)): + r = _elems.f(a0, _to_ascii(a1)) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_probe_get_descr(a0, a1, _elems=Elementaries(_lib.Z3_probe_get_descr)): + r = _elems.f(a0, _to_ascii(a1)) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_probe_apply(a0, a1, a2, _elems=Elementaries(_lib.Z3_probe_apply)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_tactic_apply(a0, a1, a2, _elems=Elementaries(_lib.Z3_tactic_apply)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_tactic_apply_ex(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_tactic_apply_ex)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_apply_result_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_apply_result_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_apply_result_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_apply_result_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_apply_result_to_string(a0, a1, _elems=Elementaries(_lib.Z3_apply_result_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_apply_result_get_num_subgoals(a0, a1, _elems=Elementaries(_lib.Z3_apply_result_get_num_subgoals)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_apply_result_get_subgoal(a0, a1, a2, _elems=Elementaries(_lib.Z3_apply_result_get_subgoal)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_apply_result_convert_model(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_apply_result_convert_model)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_solver(a0, _elems=Elementaries(_lib.Z3_mk_solver)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_simple_solver(a0, _elems=Elementaries(_lib.Z3_mk_simple_solver)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_solver_for_logic(a0, a1, _elems=Elementaries(_lib.Z3_mk_solver_for_logic)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_solver_from_tactic(a0, a1, _elems=Elementaries(_lib.Z3_mk_solver_from_tactic)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_solver_translate(a0, a1, a2, _elems=Elementaries(_lib.Z3_solver_translate)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_solver_get_help(a0, a1, _elems=Elementaries(_lib.Z3_solver_get_help)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_solver_get_param_descrs(a0, a1, _elems=Elementaries(_lib.Z3_solver_get_param_descrs)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_solver_set_params(a0, a1, a2, _elems=Elementaries(_lib.Z3_solver_set_params)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_solver_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_solver_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_solver_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_solver_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_solver_push(a0, a1, _elems=Elementaries(_lib.Z3_solver_push)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_solver_pop(a0, a1, a2, _elems=Elementaries(_lib.Z3_solver_pop)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_solver_reset(a0, a1, _elems=Elementaries(_lib.Z3_solver_reset)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_solver_get_num_scopes(a0, a1, _elems=Elementaries(_lib.Z3_solver_get_num_scopes)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_solver_assert(a0, a1, a2, _elems=Elementaries(_lib.Z3_solver_assert)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_solver_assert_and_track(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_solver_assert_and_track)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_solver_get_assertions(a0, a1, _elems=Elementaries(_lib.Z3_solver_get_assertions)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_solver_from_file(a0, a1, a2, _elems=Elementaries(_lib.Z3_solver_from_file)): + _elems.f(a0, a1, _to_ascii(a2)) + _elems.Check(a0) + +def Z3_solver_from_string(a0, a1, a2, _elems=Elementaries(_lib.Z3_solver_from_string)): + _elems.f(a0, a1, _to_ascii(a2)) + _elems.Check(a0) + +def Z3_solver_check(a0, a1, _elems=Elementaries(_lib.Z3_solver_check)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_solver_check_assumptions(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_solver_check_assumptions)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_get_implied_equalities(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_get_implied_equalities)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_solver_get_consequences(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_solver_get_consequences)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_solver_get_model(a0, a1, _elems=Elementaries(_lib.Z3_solver_get_model)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_solver_get_proof(a0, a1, _elems=Elementaries(_lib.Z3_solver_get_proof)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_solver_get_unsat_core(a0, a1, _elems=Elementaries(_lib.Z3_solver_get_unsat_core)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_solver_get_reason_unknown(a0, a1, _elems=Elementaries(_lib.Z3_solver_get_reason_unknown)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_solver_get_statistics(a0, a1, _elems=Elementaries(_lib.Z3_solver_get_statistics)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_solver_to_string(a0, a1, _elems=Elementaries(_lib.Z3_solver_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_stats_to_string(a0, a1, _elems=Elementaries(_lib.Z3_stats_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_stats_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_stats_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_stats_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_stats_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_stats_size(a0, a1, _elems=Elementaries(_lib.Z3_stats_size)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_stats_get_key(a0, a1, a2, _elems=Elementaries(_lib.Z3_stats_get_key)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_stats_is_uint(a0, a1, a2, _elems=Elementaries(_lib.Z3_stats_is_uint)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_stats_is_double(a0, a1, a2, _elems=Elementaries(_lib.Z3_stats_is_double)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_stats_get_uint_value(a0, a1, a2, _elems=Elementaries(_lib.Z3_stats_get_uint_value)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_stats_get_double_value(a0, a1, a2, _elems=Elementaries(_lib.Z3_stats_get_double_value)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_get_estimated_alloc_size(_elems=Elementaries(_lib.Z3_get_estimated_alloc_size)): + r = _elems.f() + return r + +def Z3_mk_ast_vector(a0, _elems=Elementaries(_lib.Z3_mk_ast_vector)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_ast_vector_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_ast_vector_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_ast_vector_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_ast_vector_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_ast_vector_size(a0, a1, _elems=Elementaries(_lib.Z3_ast_vector_size)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_ast_vector_get(a0, a1, a2, _elems=Elementaries(_lib.Z3_ast_vector_get)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_ast_vector_set(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_ast_vector_set)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_ast_vector_resize(a0, a1, a2, _elems=Elementaries(_lib.Z3_ast_vector_resize)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_ast_vector_push(a0, a1, a2, _elems=Elementaries(_lib.Z3_ast_vector_push)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_ast_vector_translate(a0, a1, a2, _elems=Elementaries(_lib.Z3_ast_vector_translate)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_ast_vector_to_string(a0, a1, _elems=Elementaries(_lib.Z3_ast_vector_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_mk_ast_map(a0, _elems=Elementaries(_lib.Z3_mk_ast_map)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_ast_map_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_ast_map_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_ast_map_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_ast_map_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_ast_map_contains(a0, a1, a2, _elems=Elementaries(_lib.Z3_ast_map_contains)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_ast_map_find(a0, a1, a2, _elems=Elementaries(_lib.Z3_ast_map_find)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_ast_map_insert(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_ast_map_insert)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_ast_map_erase(a0, a1, a2, _elems=Elementaries(_lib.Z3_ast_map_erase)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_ast_map_reset(a0, a1, _elems=Elementaries(_lib.Z3_ast_map_reset)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_ast_map_size(a0, a1, _elems=Elementaries(_lib.Z3_ast_map_size)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_ast_map_keys(a0, a1, _elems=Elementaries(_lib.Z3_ast_map_keys)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_ast_map_to_string(a0, a1, _elems=Elementaries(_lib.Z3_ast_map_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_algebraic_is_value(a0, a1, _elems=Elementaries(_lib.Z3_algebraic_is_value)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_algebraic_is_pos(a0, a1, _elems=Elementaries(_lib.Z3_algebraic_is_pos)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_algebraic_is_neg(a0, a1, _elems=Elementaries(_lib.Z3_algebraic_is_neg)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_algebraic_is_zero(a0, a1, _elems=Elementaries(_lib.Z3_algebraic_is_zero)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_algebraic_sign(a0, a1, _elems=Elementaries(_lib.Z3_algebraic_sign)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_algebraic_add(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_add)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_sub(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_sub)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_mul(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_mul)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_div(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_div)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_root(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_root)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_power(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_power)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_lt(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_lt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_gt(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_gt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_le(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_le)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_ge(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_ge)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_eq(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_eq)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_neq(a0, a1, a2, _elems=Elementaries(_lib.Z3_algebraic_neq)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_algebraic_roots(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_algebraic_roots)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_algebraic_eval(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_algebraic_eval)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_polynomial_subresultants(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_polynomial_subresultants)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_rcf_del(a0, a1, _elems=Elementaries(_lib.Z3_rcf_del)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_rcf_mk_rational(a0, a1, _elems=Elementaries(_lib.Z3_rcf_mk_rational)): + r = _elems.f(a0, _to_ascii(a1)) + _elems.Check(a0) + return r + +def Z3_rcf_mk_small_int(a0, a1, _elems=Elementaries(_lib.Z3_rcf_mk_small_int)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_rcf_mk_pi(a0, _elems=Elementaries(_lib.Z3_rcf_mk_pi)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_rcf_mk_e(a0, _elems=Elementaries(_lib.Z3_rcf_mk_e)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_rcf_mk_infinitesimal(a0, _elems=Elementaries(_lib.Z3_rcf_mk_infinitesimal)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_rcf_mk_roots(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_rcf_mk_roots)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_rcf_add(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_add)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_sub(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_sub)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_mul(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_mul)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_div(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_div)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_neg(a0, a1, _elems=Elementaries(_lib.Z3_rcf_neg)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_rcf_inv(a0, a1, _elems=Elementaries(_lib.Z3_rcf_inv)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_rcf_power(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_power)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_lt(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_lt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_gt(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_gt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_le(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_le)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_ge(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_ge)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_eq(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_eq)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_neq(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_neq)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_rcf_num_to_string(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_rcf_num_to_string)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_rcf_num_to_decimal_string(a0, a1, a2, _elems=Elementaries(_lib.Z3_rcf_num_to_decimal_string)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_rcf_get_numerator_denominator(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_rcf_get_numerator_denominator)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_mk_fixedpoint(a0, _elems=Elementaries(_lib.Z3_mk_fixedpoint)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_fixedpoint_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_fixedpoint_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_fixedpoint_add_rule(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_fixedpoint_add_rule)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_fixedpoint_add_fact(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_fixedpoint_add_fact)): + _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + +def Z3_fixedpoint_assert(a0, a1, a2, _elems=Elementaries(_lib.Z3_fixedpoint_assert)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_fixedpoint_query(a0, a1, a2, _elems=Elementaries(_lib.Z3_fixedpoint_query)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_fixedpoint_query_relations(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_fixedpoint_query_relations)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_fixedpoint_get_answer(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_answer)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fixedpoint_get_reason_unknown(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_reason_unknown)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_fixedpoint_update_rule(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_fixedpoint_update_rule)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_fixedpoint_get_num_levels(a0, a1, a2, _elems=Elementaries(_lib.Z3_fixedpoint_get_num_levels)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_fixedpoint_get_cover_delta(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_fixedpoint_get_cover_delta)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_fixedpoint_add_cover(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_fixedpoint_add_cover)): + _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + +def Z3_fixedpoint_get_statistics(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_statistics)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fixedpoint_register_relation(a0, a1, a2, _elems=Elementaries(_lib.Z3_fixedpoint_register_relation)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_fixedpoint_set_predicate_representation(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_fixedpoint_set_predicate_representation)): + _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + +def Z3_fixedpoint_get_rules(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_rules)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fixedpoint_get_assertions(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_assertions)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fixedpoint_set_params(a0, a1, a2, _elems=Elementaries(_lib.Z3_fixedpoint_set_params)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_fixedpoint_get_help(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_help)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_fixedpoint_get_param_descrs(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_param_descrs)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fixedpoint_to_string(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_fixedpoint_to_string)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_fixedpoint_from_string(a0, a1, a2, _elems=Elementaries(_lib.Z3_fixedpoint_from_string)): + r = _elems.f(a0, a1, _to_ascii(a2)) + _elems.Check(a0) + return r + +def Z3_fixedpoint_from_file(a0, a1, a2, _elems=Elementaries(_lib.Z3_fixedpoint_from_file)): + r = _elems.f(a0, a1, _to_ascii(a2)) + _elems.Check(a0) + return r + +def Z3_fixedpoint_push(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_push)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_fixedpoint_pop(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_pop)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_mk_optimize(a0, _elems=Elementaries(_lib.Z3_mk_optimize)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_optimize_inc_ref(a0, a1, _elems=Elementaries(_lib.Z3_optimize_inc_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_optimize_dec_ref(a0, a1, _elems=Elementaries(_lib.Z3_optimize_dec_ref)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_optimize_assert(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_assert)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_optimize_assert_soft(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_optimize_assert_soft)): + r = _elems.f(a0, a1, a2, _to_ascii(a3), a4) + _elems.Check(a0) + return r + +def Z3_optimize_maximize(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_maximize)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_optimize_minimize(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_minimize)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_optimize_push(a0, a1, _elems=Elementaries(_lib.Z3_optimize_push)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_optimize_pop(a0, a1, _elems=Elementaries(_lib.Z3_optimize_pop)): + _elems.f(a0, a1) + _elems.Check(a0) + +def Z3_optimize_check(a0, a1, _elems=Elementaries(_lib.Z3_optimize_check)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_optimize_get_reason_unknown(a0, a1, _elems=Elementaries(_lib.Z3_optimize_get_reason_unknown)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_optimize_get_model(a0, a1, _elems=Elementaries(_lib.Z3_optimize_get_model)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_optimize_set_params(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_set_params)): + _elems.f(a0, a1, a2) + _elems.Check(a0) + +def Z3_optimize_get_param_descrs(a0, a1, _elems=Elementaries(_lib.Z3_optimize_get_param_descrs)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_optimize_get_lower(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_get_lower)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_optimize_get_upper(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_get_upper)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_optimize_get_lower_as_vector(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_get_lower_as_vector)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_optimize_get_upper_as_vector(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_get_upper_as_vector)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_optimize_to_string(a0, a1, _elems=Elementaries(_lib.Z3_optimize_to_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_optimize_from_string(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_from_string)): + _elems.f(a0, a1, _to_ascii(a2)) + _elems.Check(a0) + +def Z3_optimize_from_file(a0, a1, a2, _elems=Elementaries(_lib.Z3_optimize_from_file)): + _elems.f(a0, a1, _to_ascii(a2)) + _elems.Check(a0) + +def Z3_optimize_get_help(a0, a1, _elems=Elementaries(_lib.Z3_optimize_get_help)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_optimize_get_statistics(a0, a1, _elems=Elementaries(_lib.Z3_optimize_get_statistics)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_optimize_get_assertions(a0, a1, _elems=Elementaries(_lib.Z3_optimize_get_assertions)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_optimize_get_objectives(a0, a1, _elems=Elementaries(_lib.Z3_optimize_get_objectives)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_interpolant(a0, a1, _elems=Elementaries(_lib.Z3_mk_interpolant)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_interpolation_context(a0, _elems=Elementaries(_lib.Z3_mk_interpolation_context)): + r = _elems.f(a0) + return r + +def Z3_get_interpolant(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_get_interpolant)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_compute_interpolant(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_compute_interpolant)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_interpolation_profile(a0, _elems=Elementaries(_lib.Z3_interpolation_profile)): + r = _elems.f(a0) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_read_interpolation_problem(a0, a1, a2, a3, a4, a5, a6, a7, _elems=Elementaries(_lib.Z3_read_interpolation_problem)): + r = _elems.f(a0, a1, a2, a3, _to_ascii(a4), _to_ascii(a5), a6, a7) + _elems.Check(a0) + return r + +def Z3_check_interpolant(a0, a1, a2, a3, a4, a5, a6, a7, _elems=Elementaries(_lib.Z3_check_interpolant)): + r = _elems.f(a0, a1, a2, a3, a4, _to_ascii(a5), a6, a7) + _elems.Check(a0) + return r + +def Z3_write_interpolation_problem(a0, a1, a2, a3, a4, a5, a6, _elems=Elementaries(_lib.Z3_write_interpolation_problem)): + _elems.f(a0, a1, a2, a3, _to_ascii(a4), a5, a6) + _elems.Check(a0) + +def Z3_mk_fpa_rounding_mode_sort(a0, _elems=Elementaries(_lib.Z3_mk_fpa_rounding_mode_sort)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_round_nearest_ties_to_even(a0, _elems=Elementaries(_lib.Z3_mk_fpa_round_nearest_ties_to_even)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_rne(a0, _elems=Elementaries(_lib.Z3_mk_fpa_rne)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_round_nearest_ties_to_away(a0, _elems=Elementaries(_lib.Z3_mk_fpa_round_nearest_ties_to_away)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_rna(a0, _elems=Elementaries(_lib.Z3_mk_fpa_rna)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_round_toward_positive(a0, _elems=Elementaries(_lib.Z3_mk_fpa_round_toward_positive)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_rtp(a0, _elems=Elementaries(_lib.Z3_mk_fpa_rtp)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_round_toward_negative(a0, _elems=Elementaries(_lib.Z3_mk_fpa_round_toward_negative)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_rtn(a0, _elems=Elementaries(_lib.Z3_mk_fpa_rtn)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_round_toward_zero(a0, _elems=Elementaries(_lib.Z3_mk_fpa_round_toward_zero)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_rtz(a0, _elems=Elementaries(_lib.Z3_mk_fpa_rtz)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sort(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_sort)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sort_half(a0, _elems=Elementaries(_lib.Z3_mk_fpa_sort_half)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sort_16(a0, _elems=Elementaries(_lib.Z3_mk_fpa_sort_16)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sort_single(a0, _elems=Elementaries(_lib.Z3_mk_fpa_sort_single)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sort_32(a0, _elems=Elementaries(_lib.Z3_mk_fpa_sort_32)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sort_double(a0, _elems=Elementaries(_lib.Z3_mk_fpa_sort_double)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sort_64(a0, _elems=Elementaries(_lib.Z3_mk_fpa_sort_64)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sort_quadruple(a0, _elems=Elementaries(_lib.Z3_mk_fpa_sort_quadruple)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sort_128(a0, _elems=Elementaries(_lib.Z3_mk_fpa_sort_128)): + r = _elems.f(a0) + _elems.Check(a0) + return r + +def Z3_mk_fpa_nan(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_nan)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_inf(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_inf)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_zero(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_zero)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_fp(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_fp)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_numeral_float(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_numeral_float)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_numeral_double(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_numeral_double)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_numeral_int(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_numeral_int)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_numeral_int_uint(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_fpa_numeral_int_uint)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_mk_fpa_numeral_int64_uint64(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_fpa_numeral_int64_uint64)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_mk_fpa_abs(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_abs)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_neg(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_neg)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_add(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_add)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sub(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_sub)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_mul(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_mul)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_div(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_div)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_fma(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_fpa_fma)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_mk_fpa_sqrt(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_sqrt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_rem(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_rem)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_round_to_integral(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_round_to_integral)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_min(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_min)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_max(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_max)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_leq(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_leq)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_lt(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_lt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_geq(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_geq)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_gt(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_gt)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_eq(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_eq)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_is_normal(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_is_normal)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_is_subnormal(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_is_subnormal)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_is_zero(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_is_zero)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_is_infinite(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_is_infinite)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_is_nan(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_is_nan)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_is_negative(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_is_negative)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_is_positive(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_is_positive)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_fp_bv(a0, a1, a2, _elems=Elementaries(_lib.Z3_mk_fpa_to_fp_bv)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_fp_float(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_to_fp_float)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_fp_real(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_to_fp_real)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_fp_signed(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_to_fp_signed)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_fp_unsigned(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_to_fp_unsigned)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_ubv(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_to_ubv)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_sbv(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_mk_fpa_to_sbv)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_real(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_to_real)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_get_ebits(a0, a1, _elems=Elementaries(_lib.Z3_fpa_get_ebits)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_get_sbits(a0, a1, _elems=Elementaries(_lib.Z3_fpa_get_sbits)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_is_numeral_nan(a0, a1, _elems=Elementaries(_lib.Z3_fpa_is_numeral_nan)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_is_numeral_inf(a0, a1, _elems=Elementaries(_lib.Z3_fpa_is_numeral_inf)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_is_numeral_zero(a0, a1, _elems=Elementaries(_lib.Z3_fpa_is_numeral_zero)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_is_numeral_normal(a0, a1, _elems=Elementaries(_lib.Z3_fpa_is_numeral_normal)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_is_numeral_subnormal(a0, a1, _elems=Elementaries(_lib.Z3_fpa_is_numeral_subnormal)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_is_numeral_positive(a0, a1, _elems=Elementaries(_lib.Z3_fpa_is_numeral_positive)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_is_numeral_negative(a0, a1, _elems=Elementaries(_lib.Z3_fpa_is_numeral_negative)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_get_numeral_sign_bv(a0, a1, _elems=Elementaries(_lib.Z3_fpa_get_numeral_sign_bv)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_get_numeral_significand_bv(a0, a1, _elems=Elementaries(_lib.Z3_fpa_get_numeral_significand_bv)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fpa_get_numeral_sign(a0, a1, a2, _elems=Elementaries(_lib.Z3_fpa_get_numeral_sign)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_fpa_get_numeral_significand_string(a0, a1, _elems=Elementaries(_lib.Z3_fpa_get_numeral_significand_string)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_fpa_get_numeral_significand_uint64(a0, a1, a2, _elems=Elementaries(_lib.Z3_fpa_get_numeral_significand_uint64)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_fpa_get_numeral_exponent_string(a0, a1, a2, _elems=Elementaries(_lib.Z3_fpa_get_numeral_exponent_string)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return _to_pystr(r) + +def Z3_fpa_get_numeral_exponent_int64(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_fpa_get_numeral_exponent_int64)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_fpa_get_numeral_exponent_bv(a0, a1, a2, _elems=Elementaries(_lib.Z3_fpa_get_numeral_exponent_bv)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_ieee_bv(a0, a1, _elems=Elementaries(_lib.Z3_mk_fpa_to_ieee_bv)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_mk_fpa_to_fp_int_real(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_mk_fpa_to_fp_int_real)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_fixedpoint_query_from_lvl(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_fixedpoint_query_from_lvl)): + r = _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + return r + +def Z3_fixedpoint_get_ground_sat_answer(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_ground_sat_answer)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fixedpoint_get_rules_along_trace(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_rules_along_trace)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fixedpoint_get_rule_names_along_trace(a0, a1, _elems=Elementaries(_lib.Z3_fixedpoint_get_rule_names_along_trace)): + r = _elems.f(a0, a1) + _elems.Check(a0) + return r + +def Z3_fixedpoint_add_invariant(a0, a1, a2, a3, _elems=Elementaries(_lib.Z3_fixedpoint_add_invariant)): + _elems.f(a0, a1, a2, a3) + _elems.Check(a0) + +def Z3_fixedpoint_get_reachable(a0, a1, a2, _elems=Elementaries(_lib.Z3_fixedpoint_get_reachable)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_qe_model_project(a0, a1, a2, a3, a4, _elems=Elementaries(_lib.Z3_qe_model_project)): + r = _elems.f(a0, a1, a2, a3, a4) + _elems.Check(a0) + return r + +def Z3_qe_model_project_skolem(a0, a1, a2, a3, a4, a5, _elems=Elementaries(_lib.Z3_qe_model_project_skolem)): + r = _elems.f(a0, a1, a2, a3, a4, a5) + _elems.Check(a0) + return r + +def Z3_model_extrapolate(a0, a1, a2, _elems=Elementaries(_lib.Z3_model_extrapolate)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + +def Z3_qe_lite(a0, a1, a2, _elems=Elementaries(_lib.Z3_qe_lite)): + r = _elems.f(a0, a1, a2) + _elems.Check(a0) + return r + + +# Clean up +del _lib +del _default_dirs +del _all_dirs +del _ext diff --git a/rba.tool.core/lib32/z3/python/z3/z3core.pyc b/rba.tool.core/lib32/z3/python/z3/z3core.pyc Binary files differnew file mode 100644 index 0000000..9f5b216 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3core.pyc diff --git a/rba.tool.core/lib32/z3/python/z3/z3num.py b/rba.tool.core/lib32/z3/python/z3/z3num.py new file mode 100644 index 0000000..b1af58d --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3num.py @@ -0,0 +1,577 @@ +############################################ +# Copyright (c) 2012 Microsoft Corporation +# +# Z3 Python interface for Z3 numerals +# +# Author: Leonardo de Moura (leonardo) +############################################ +from .z3 import * +from .z3core import * +from .z3printer import * +from fractions import Fraction + +from .z3 import _get_ctx + +def _to_numeral(num, ctx=None): + if isinstance(num, Numeral): + return num + else: + return Numeral(num, ctx) + +class Numeral: + """ + A Z3 numeral can be used to perform computations over arbitrary + precision integers, rationals and real algebraic numbers. + It also automatically converts python numeric values. + + >>> Numeral(2) + 2 + >>> Numeral("3/2") + 1 + 5/2 + >>> Numeral(Sqrt(2)) + 1.4142135623? + >>> Numeral(Sqrt(2)) + 2 + 3.4142135623? + >>> Numeral(Sqrt(2)) + Numeral(Sqrt(3)) + 3.1462643699? + + Z3 numerals can be used to perform computations with + values in a Z3 model. + + >>> s = Solver() + >>> x = Real('x') + >>> s.add(x*x == 2) + >>> s.add(x > 0) + >>> s.check() + sat + >>> m = s.model() + >>> m[x] + 1.4142135623? + >>> m[x] + 1 + 1.4142135623? + 1 + + The previous result is a Z3 expression. + + >>> (m[x] + 1).sexpr() + '(+ (root-obj (+ (^ x 2) (- 2)) 2) 1.0)' + + >>> Numeral(m[x]) + 1 + 2.4142135623? + >>> Numeral(m[x]).is_pos() + True + >>> Numeral(m[x])**2 + 2 + + We can also isolate the roots of polynomials. + + >>> x0, x1, x2 = RealVarVector(3) + >>> r0 = isolate_roots(x0**5 - x0 - 1) + >>> r0 + [1.1673039782?] + + In the following example, we are isolating the roots + of a univariate polynomial (on x1) obtained after substituting + x0 -> r0[0] + + >>> r1 = isolate_roots(x1**2 - x0 + 1, [ r0[0] ]) + >>> r1 + [-0.4090280898?, 0.4090280898?] + + Similarly, in the next example we isolate the roots of + a univariate polynomial (on x2) obtained after substituting + x0 -> r0[0] and x1 -> r1[0] + + >>> isolate_roots(x1*x2 + x0, [ r0[0], r1[0] ]) + [2.8538479564?] + + """ + def __init__(self, num, ctx=None): + if isinstance(num, Ast): + self.ast = num + self.ctx = _get_ctx(ctx) + elif isinstance(num, RatNumRef) or isinstance(num, AlgebraicNumRef): + self.ast = num.ast + self.ctx = num.ctx + elif isinstance(num, ArithRef): + r = simplify(num) + self.ast = r.ast + self.ctx = r.ctx + else: + v = RealVal(num, ctx) + self.ast = v.ast + self.ctx = v.ctx + Z3_inc_ref(self.ctx_ref(), self.as_ast()) + assert Z3_algebraic_is_value(self.ctx_ref(), self.ast) + + def __del__(self): + Z3_dec_ref(self.ctx_ref(), self.as_ast()) + + def is_integer(self): + """ Return True if the numeral is integer. + + >>> Numeral(2).is_integer() + True + >>> (Numeral(Sqrt(2)) * Numeral(Sqrt(2))).is_integer() + True + >>> Numeral(Sqrt(2)).is_integer() + False + >>> Numeral("2/3").is_integer() + False + """ + return self.is_rational() and self.denominator() == 1 + + def is_rational(self): + """ Return True if the numeral is rational. + + >>> Numeral(2).is_rational() + True + >>> Numeral("2/3").is_rational() + True + >>> Numeral(Sqrt(2)).is_rational() + False + + """ + return Z3_get_ast_kind(self.ctx_ref(), self.as_ast()) == Z3_NUMERAL_AST + + def denominator(self): + """ Return the denominator if `self` is rational. + + >>> Numeral("2/3").denominator() + 3 + """ + assert(self.is_rational()) + return Numeral(Z3_get_denominator(self.ctx_ref(), self.as_ast()), self.ctx) + + def numerator(self): + """ Return the numerator if `self` is rational. + + >>> Numeral("2/3").numerator() + 2 + """ + assert(self.is_rational()) + return Numeral(Z3_get_numerator(self.ctx_ref(), self.as_ast()), self.ctx) + + + def is_irrational(self): + """ Return True if the numeral is irrational. + + >>> Numeral(2).is_irrational() + False + >>> Numeral("2/3").is_irrational() + False + >>> Numeral(Sqrt(2)).is_irrational() + True + """ + return not self.is_rational() + + def as_long(self): + """ Return a numeral (that is an integer) as a Python long. + + """ + assert(self.is_integer()) + if sys.version_info[0] >= 3: + return int(Z3_get_numeral_string(self.ctx_ref(), self.as_ast())) + else: + return long(Z3_get_numeral_string(self.ctx_ref(), self.as_ast())) + + def as_fraction(self): + """ Return a numeral (that is a rational) as a Python Fraction. + >>> Numeral("1/5").as_fraction() + Fraction(1, 5) + """ + assert(self.is_rational()) + return Fraction(self.numerator().as_long(), self.denominator().as_long()) + + def approx(self, precision=10): + """Return a numeral that approximates the numeral `self`. + The result `r` is such that |r - self| <= 1/10^precision + + If `self` is rational, then the result is `self`. + + >>> x = Numeral(2).root(2) + >>> x.approx(20) + 6838717160008073720548335/4835703278458516698824704 + >>> x.approx(5) + 2965821/2097152 + >>> Numeral(2).approx(10) + 2 + """ + return self.upper(precision) + + def upper(self, precision=10): + """Return a upper bound that approximates the numeral `self`. + The result `r` is such that r - self <= 1/10^precision + + If `self` is rational, then the result is `self`. + + >>> x = Numeral(2).root(2) + >>> x.upper(20) + 6838717160008073720548335/4835703278458516698824704 + >>> x.upper(5) + 2965821/2097152 + >>> Numeral(2).upper(10) + 2 + """ + if self.is_rational(): + return self + else: + return Numeral(Z3_get_algebraic_number_upper(self.ctx_ref(), self.as_ast(), precision), self.ctx) + + def lower(self, precision=10): + """Return a lower bound that approximates the numeral `self`. + The result `r` is such that self - r <= 1/10^precision + + If `self` is rational, then the result is `self`. + + >>> x = Numeral(2).root(2) + >>> x.lower(20) + 1709679290002018430137083/1208925819614629174706176 + >>> Numeral("2/3").lower(10) + 2/3 + """ + if self.is_rational(): + return self + else: + return Numeral(Z3_get_algebraic_number_lower(self.ctx_ref(), self.as_ast(), precision), self.ctx) + + def sign(self): + """ Return the sign of the numeral. + + >>> Numeral(2).sign() + 1 + >>> Numeral(-3).sign() + -1 + >>> Numeral(0).sign() + 0 + """ + return Z3_algebraic_sign(self.ctx_ref(), self.ast) + + def is_pos(self): + """ Return True if the numeral is positive. + + >>> Numeral(2).is_pos() + True + >>> Numeral(-3).is_pos() + False + >>> Numeral(0).is_pos() + False + """ + return Z3_algebraic_is_pos(self.ctx_ref(), self.ast) + + def is_neg(self): + """ Return True if the numeral is negative. + + >>> Numeral(2).is_neg() + False + >>> Numeral(-3).is_neg() + True + >>> Numeral(0).is_neg() + False + """ + return Z3_algebraic_is_neg(self.ctx_ref(), self.ast) + + def is_zero(self): + """ Return True if the numeral is zero. + + >>> Numeral(2).is_zero() + False + >>> Numeral(-3).is_zero() + False + >>> Numeral(0).is_zero() + True + >>> sqrt2 = Numeral(2).root(2) + >>> sqrt2.is_zero() + False + >>> (sqrt2 - sqrt2).is_zero() + True + """ + return Z3_algebraic_is_zero(self.ctx_ref(), self.ast) + + def __add__(self, other): + """ Return the numeral `self + other`. + + >>> Numeral(2) + 3 + 5 + >>> Numeral(2) + Numeral(4) + 6 + >>> Numeral("2/3") + 1 + 5/3 + """ + return Numeral(Z3_algebraic_add(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast), self.ctx) + + def __radd__(self, other): + """ Return the numeral `other + self`. + + >>> 3 + Numeral(2) + 5 + """ + return Numeral(Z3_algebraic_add(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast), self.ctx) + + def __sub__(self, other): + """ Return the numeral `self - other`. + + >>> Numeral(2) - 3 + -1 + """ + return Numeral(Z3_algebraic_sub(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast), self.ctx) + + def __rsub__(self, other): + """ Return the numeral `other - self`. + + >>> 3 - Numeral(2) + 1 + """ + return Numeral(Z3_algebraic_sub(self.ctx_ref(), _to_numeral(other, self.ctx).ast, self.ast), self.ctx) + + def __mul__(self, other): + """ Return the numeral `self * other`. + >>> Numeral(2) * 3 + 6 + """ + return Numeral(Z3_algebraic_mul(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast), self.ctx) + + def __rmul__(self, other): + """ Return the numeral `other * mul`. + >>> 3 * Numeral(2) + 6 + """ + return Numeral(Z3_algebraic_mul(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast), self.ctx) + + def __div__(self, other): + """ Return the numeral `self / other`. + >>> Numeral(2) / 3 + 2/3 + >>> Numeral(2).root(2) / 3 + 0.4714045207? + >>> Numeral(Sqrt(2)) / Numeral(Sqrt(3)) + 0.8164965809? + """ + return Numeral(Z3_algebraic_div(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast), self.ctx) + + def __truediv__(self, other): + return self.__div__(other) + + def __rdiv__(self, other): + """ Return the numeral `other / self`. + >>> 3 / Numeral(2) + 3/2 + >>> 3 / Numeral(2).root(2) + 2.1213203435? + """ + return Numeral(Z3_algebraic_div(self.ctx_ref(), _to_numeral(other, self.ctx).ast, self.ast), self.ctx) + + def __rtruediv__(self, other): + return self.__rdiv__(other) + + def root(self, k): + """ Return the numeral `self^(1/k)`. + + >>> sqrt2 = Numeral(2).root(2) + >>> sqrt2 + 1.4142135623? + >>> sqrt2 * sqrt2 + 2 + >>> sqrt2 * 2 + 1 + 3.8284271247? + >>> (sqrt2 * 2 + 1).sexpr() + '(root-obj (+ (^ x 2) (* (- 2) x) (- 7)) 2)' + """ + return Numeral(Z3_algebraic_root(self.ctx_ref(), self.ast, k), self.ctx) + + def power(self, k): + """ Return the numeral `self^k`. + + >>> sqrt3 = Numeral(3).root(2) + >>> sqrt3 + 1.7320508075? + >>> sqrt3.power(2) + 3 + """ + return Numeral(Z3_algebraic_power(self.ctx_ref(), self.ast, k), self.ctx) + + def __pow__(self, k): + """ Return the numeral `self^k`. + + >>> sqrt3 = Numeral(3).root(2) + >>> sqrt3 + 1.7320508075? + >>> sqrt3**2 + 3 + """ + return self.power(k) + + def __lt__(self, other): + """ Return True if `self < other`. + + >>> Numeral(Sqrt(2)) < 2 + True + >>> Numeral(Sqrt(3)) < Numeral(Sqrt(2)) + False + >>> Numeral(Sqrt(2)) < Numeral(Sqrt(2)) + False + """ + return Z3_algebraic_lt(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast) + + def __rlt__(self, other): + """ Return True if `other < self`. + + >>> 2 < Numeral(Sqrt(2)) + False + """ + return self > other + + def __gt__(self, other): + """ Return True if `self > other`. + + >>> Numeral(Sqrt(2)) > 2 + False + >>> Numeral(Sqrt(3)) > Numeral(Sqrt(2)) + True + >>> Numeral(Sqrt(2)) > Numeral(Sqrt(2)) + False + """ + return Z3_algebraic_gt(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast) + + def __rgt__(self, other): + """ Return True if `other > self`. + + >>> 2 > Numeral(Sqrt(2)) + True + """ + return self < other + + + def __le__(self, other): + """ Return True if `self <= other`. + + >>> Numeral(Sqrt(2)) <= 2 + True + >>> Numeral(Sqrt(3)) <= Numeral(Sqrt(2)) + False + >>> Numeral(Sqrt(2)) <= Numeral(Sqrt(2)) + True + """ + return Z3_algebraic_le(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast) + + def __rle__(self, other): + """ Return True if `other <= self`. + + >>> 2 <= Numeral(Sqrt(2)) + False + """ + return self >= other + + def __ge__(self, other): + """ Return True if `self >= other`. + + >>> Numeral(Sqrt(2)) >= 2 + False + >>> Numeral(Sqrt(3)) >= Numeral(Sqrt(2)) + True + >>> Numeral(Sqrt(2)) >= Numeral(Sqrt(2)) + True + """ + return Z3_algebraic_ge(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast) + + def __rge__(self, other): + """ Return True if `other >= self`. + + >>> 2 >= Numeral(Sqrt(2)) + True + """ + return self <= other + + def __eq__(self, other): + """ Return True if `self == other`. + + >>> Numeral(Sqrt(2)) == 2 + False + >>> Numeral(Sqrt(3)) == Numeral(Sqrt(2)) + False + >>> Numeral(Sqrt(2)) == Numeral(Sqrt(2)) + True + """ + return Z3_algebraic_eq(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast) + + def __ne__(self, other): + """ Return True if `self != other`. + + >>> Numeral(Sqrt(2)) != 2 + True + >>> Numeral(Sqrt(3)) != Numeral(Sqrt(2)) + True + >>> Numeral(Sqrt(2)) != Numeral(Sqrt(2)) + False + """ + return Z3_algebraic_neq(self.ctx_ref(), self.ast, _to_numeral(other, self.ctx).ast) + + def __str__(self): + if Z3_is_numeral_ast(self.ctx_ref(), self.ast): + return str(RatNumRef(self.ast, self.ctx)) + else: + return str(AlgebraicNumRef(self.ast, self.ctx)) + + def __repr__(self): + return self.__str__() + + def sexpr(self): + return Z3_ast_to_string(self.ctx_ref(), self.as_ast()) + + def as_ast(self): + return self.ast + + def ctx_ref(self): + return self.ctx.ref() + +def eval_sign_at(p, vs): + """ + Evaluate the sign of the polynomial `p` at `vs`. `p` is a Z3 + Expression containing arithmetic operators: +, -, *, ^k where k is + an integer; and free variables x that is_var(x) is True. Moreover, + all variables must be real. + + The result is 1 if the polynomial is positive at the given point, + -1 if negative, and 0 if zero. + + >>> x0, x1, x2 = RealVarVector(3) + >>> eval_sign_at(x0**2 + x1*x2 + 1, (Numeral(0), Numeral(1), Numeral(2))) + 1 + >>> eval_sign_at(x0**2 - 2, [ Numeral(Sqrt(2)) ]) + 0 + >>> eval_sign_at((x0 + x1)*(x0 + x2), (Numeral(0), Numeral(Sqrt(2)), Numeral(Sqrt(3)))) + 1 + """ + num = len(vs) + _vs = (Ast * num)() + for i in range(num): + _vs[i] = vs[i].ast + return Z3_algebraic_eval(p.ctx_ref(), p.as_ast(), num, _vs) + +def isolate_roots(p, vs=[]): + """ + Given a multivariate polynomial p(x_0, ..., x_{n-1}, x_n), returns the + roots of the univariate polynomial p(vs[0], ..., vs[len(vs)-1], x_n). + + Remarks: + * p is a Z3 expression that contains only arithmetic terms and free variables. + * forall i in [0, n) vs is a numeral. + + The result is a list of numerals + + >>> x0 = RealVar(0) + >>> isolate_roots(x0**5 - x0 - 1) + [1.1673039782?] + >>> x1 = RealVar(1) + >>> isolate_roots(x0**2 - x1**4 - 1, [ Numeral(Sqrt(3)) ]) + [-1.1892071150?, 1.1892071150?] + >>> x2 = RealVar(2) + >>> isolate_roots(x2**2 + x0 - x1, [ Numeral(Sqrt(3)), Numeral(Sqrt(2)) ]) + [] + """ + num = len(vs) + _vs = (Ast * num)() + for i in range(num): + _vs[i] = vs[i].ast + _roots = AstVector(Z3_algebraic_roots(p.ctx_ref(), p.as_ast(), num, _vs), p.ctx) + return [ Numeral(r) for r in _roots ] + diff --git a/rba.tool.core/lib32/z3/python/z3/z3num.pyc b/rba.tool.core/lib32/z3/python/z3/z3num.pyc Binary files differnew file mode 100644 index 0000000..c97ae33 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3num.pyc diff --git a/rba.tool.core/lib32/z3/python/z3/z3poly.py b/rba.tool.core/lib32/z3/python/z3/z3poly.py new file mode 100644 index 0000000..1699442 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3poly.py @@ -0,0 +1,35 @@ +############################################ +# Copyright (c) 2012 Microsoft Corporation +# +# Z3 Python interface for Z3 polynomials +# +# Author: Leonardo de Moura (leonardo) +############################################ + +from .z3 import * + +def subresultants(p, q, x): + """ + Return the non-constant subresultants of 'p' and 'q' with respect to the "variable" 'x'. + + 'p', 'q' and 'x' are Z3 expressions where 'p' and 'q' are arithmetic terms. + Note that, any subterm that cannot be viewed as a polynomial is assumed to be a variable. + Example: f(a) is a considered to be a variable b in the polynomial + + f(a)*f(a) + 2*f(a) + 1 + + >>> x, y = Reals('x y') + >>> subresultants(2*x + y, 3*x - 2*y + 2, x) + [-7*y + 4] + >>> r = subresultants(3*y*x**2 + y**3 + 1, 2*x**3 + y + 3, x) + >>> r[0] + 4*y**9 + 12*y**6 + 27*y**5 + 162*y**4 + 255*y**3 + 4 + >>> r[1] + -6*y**4 + -6*y + """ + return AstVector(Z3_polynomial_subresultants(p.ctx_ref(), p.as_ast(), q.as_ast(), x.as_ast()), p.ctx) + +if __name__ == "__main__": + import doctest + if doctest.testmod().failed: + exit(1) diff --git a/rba.tool.core/lib32/z3/python/z3/z3poly.pyc b/rba.tool.core/lib32/z3/python/z3/z3poly.pyc Binary files differnew file mode 100644 index 0000000..8828041 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3poly.pyc diff --git a/rba.tool.core/lib32/z3/python/z3/z3printer.py b/rba.tool.core/lib32/z3/python/z3/z3printer.py new file mode 100644 index 0000000..aef71be --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3printer.py @@ -0,0 +1,1253 @@ +############################################ +# Copyright (c) 2012 Microsoft Corporation +# +# Z3 Python interface +# +# Author: Leonardo de Moura (leonardo) +############################################ +import sys, io, z3 +from .z3consts import * +from .z3core import * +from ctypes import * + +def _z3_assert(cond, msg): + if not cond: + raise Z3Exception(msg) + +############################## +# +# Configuration +# +############################## + +# Z3 operator names to Z3Py +_z3_op_to_str = { + Z3_OP_TRUE : 'True', Z3_OP_FALSE : 'False', Z3_OP_EQ : '==', Z3_OP_DISTINCT : 'Distinct', + Z3_OP_ITE : 'If', Z3_OP_AND : 'And', Z3_OP_OR : 'Or', Z3_OP_IFF : '==', Z3_OP_XOR : 'Xor', + Z3_OP_NOT : 'Not', Z3_OP_IMPLIES : 'Implies', Z3_OP_IDIV : '/', Z3_OP_MOD : '%', + Z3_OP_TO_REAL : 'ToReal', Z3_OP_TO_INT : 'ToInt', Z3_OP_POWER : '**', Z3_OP_IS_INT : 'IsInt', + Z3_OP_BADD : '+', Z3_OP_BSUB : '-', Z3_OP_BMUL : '*', Z3_OP_BOR : '|', Z3_OP_BAND : '&', + Z3_OP_BNOT : '~', Z3_OP_BXOR : '^', Z3_OP_BNEG : '-', Z3_OP_BUDIV : 'UDiv', Z3_OP_BSDIV : '/', Z3_OP_BSMOD : '%', + Z3_OP_BSREM : 'SRem', Z3_OP_BUREM : 'URem', Z3_OP_EXT_ROTATE_LEFT : 'RotateLeft', Z3_OP_EXT_ROTATE_RIGHT : 'RotateRight', + Z3_OP_SLEQ : '<=', Z3_OP_SLT : '<', Z3_OP_SGEQ : '>=', Z3_OP_SGT : '>', + Z3_OP_ULEQ : 'ULE', Z3_OP_ULT : 'ULT', Z3_OP_UGEQ : 'UGE', Z3_OP_UGT : 'UGT', + Z3_OP_SIGN_EXT : 'SignExt', Z3_OP_ZERO_EXT : 'ZeroExt', Z3_OP_REPEAT : 'RepeatBitVec', + Z3_OP_BASHR : '>>', Z3_OP_BSHL : '<<', Z3_OP_BLSHR : 'LShR', + Z3_OP_CONCAT : 'Concat', Z3_OP_EXTRACT : 'Extract', Z3_OP_BV2INT : 'BV2Int', + Z3_OP_ARRAY_MAP : 'Map', Z3_OP_SELECT : 'Select', Z3_OP_STORE : 'Store', + Z3_OP_CONST_ARRAY : 'K', Z3_OP_ARRAY_EXT : 'Ext', + Z3_OP_PB_AT_MOST : 'AtMost', Z3_OP_PB_LE : 'PbLe', Z3_OP_PB_GE : 'PbGe' + } + +# List of infix operators +_z3_infix = [ + Z3_OP_EQ, Z3_OP_IFF, Z3_OP_ADD, Z3_OP_SUB, Z3_OP_MUL, Z3_OP_DIV, Z3_OP_IDIV, Z3_OP_MOD, Z3_OP_POWER, + Z3_OP_LE, Z3_OP_LT, Z3_OP_GE, Z3_OP_GT, Z3_OP_BADD, Z3_OP_BSUB, Z3_OP_BMUL, Z3_OP_BSDIV, Z3_OP_BSMOD, Z3_OP_BOR, Z3_OP_BAND, + Z3_OP_BXOR, Z3_OP_BSDIV, Z3_OP_SLEQ, Z3_OP_SLT, Z3_OP_SGEQ, Z3_OP_SGT, Z3_OP_BASHR, Z3_OP_BSHL + ] + +_z3_unary = [ Z3_OP_UMINUS, Z3_OP_BNOT, Z3_OP_BNEG ] + +# Precedence +_z3_precedence = { + Z3_OP_POWER : 0, + Z3_OP_UMINUS : 1, Z3_OP_BNEG : 1, Z3_OP_BNOT : 1, + Z3_OP_MUL : 2, Z3_OP_DIV : 2, Z3_OP_IDIV : 2, Z3_OP_MOD : 2, Z3_OP_BMUL : 2, Z3_OP_BSDIV : 2, Z3_OP_BSMOD : 2, + Z3_OP_ADD : 3, Z3_OP_SUB : 3, Z3_OP_BADD : 3, Z3_OP_BSUB : 3, + Z3_OP_BASHR : 4, Z3_OP_BSHL : 4, + Z3_OP_BAND : 5, + Z3_OP_BXOR : 6, + Z3_OP_BOR : 7, + Z3_OP_LE : 8, Z3_OP_LT : 8, Z3_OP_GE : 8, Z3_OP_GT : 8, Z3_OP_EQ : 8, Z3_OP_SLEQ : 8, Z3_OP_SLT : 8, Z3_OP_SGEQ : 8, Z3_OP_SGT : 8, + Z3_OP_IFF : 8, + + Z3_OP_FPA_NEG : 1, + Z3_OP_FPA_MUL : 2, Z3_OP_FPA_DIV : 2, Z3_OP_FPA_REM : 2, Z3_OP_FPA_FMA : 2, + Z3_OP_FPA_ADD: 3, Z3_OP_FPA_SUB : 3, + Z3_OP_FPA_LE : 8, Z3_OP_FPA_LT : 8, Z3_OP_FPA_GE : 8, Z3_OP_FPA_GT : 8, Z3_OP_FPA_EQ : 8 + } + +# FPA operators +_z3_op_to_fpa_normal_str = { + Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN : 'RoundNearestTiesToEven()', Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY : 'RoundNearestTiesToAway()', + Z3_OP_FPA_RM_TOWARD_POSITIVE : 'RoundTowardPositive()', Z3_OP_FPA_RM_TOWARD_NEGATIVE : 'RoundTowardNegative()', + Z3_OP_FPA_RM_TOWARD_ZERO : 'RoundTowardZero()', + Z3_OP_FPA_PLUS_INF : 'fpPlusInfinity', Z3_OP_FPA_MINUS_INF : 'fpMinusInfinity', + Z3_OP_FPA_NAN : 'fpNaN', Z3_OP_FPA_PLUS_ZERO : 'fpPZero', Z3_OP_FPA_MINUS_ZERO : 'fpNZero', + Z3_OP_FPA_ADD : 'fpAdd', Z3_OP_FPA_SUB : 'fpSub', Z3_OP_FPA_NEG : 'fpNeg', Z3_OP_FPA_MUL : 'fpMul', + Z3_OP_FPA_DIV : 'fpDiv', Z3_OP_FPA_REM : 'fpRem', Z3_OP_FPA_ABS : 'fpAbs', + Z3_OP_FPA_MIN : 'fpMin', Z3_OP_FPA_MAX : 'fpMax', + Z3_OP_FPA_FMA : 'fpFMA', Z3_OP_FPA_SQRT : 'fpSqrt', Z3_OP_FPA_ROUND_TO_INTEGRAL : 'fpRoundToIntegral', + + Z3_OP_FPA_EQ : 'fpEQ', Z3_OP_FPA_LT : 'fpLT', Z3_OP_FPA_GT : 'fpGT', Z3_OP_FPA_LE : 'fpLEQ', + Z3_OP_FPA_GE : 'fpGEQ', + + Z3_OP_FPA_IS_NAN : 'fpIsNaN', Z3_OP_FPA_IS_INF : 'fpIsInf', Z3_OP_FPA_IS_ZERO : 'fpIsZero', + Z3_OP_FPA_IS_NORMAL : 'fpIsNormal', Z3_OP_FPA_IS_SUBNORMAL : 'fpIsSubnormal', + Z3_OP_FPA_IS_NEGATIVE : 'fpIsNegative', Z3_OP_FPA_IS_POSITIVE : 'fpIsPositive', + + Z3_OP_FPA_FP : 'fpFP', Z3_OP_FPA_TO_FP : 'fpToFP', Z3_OP_FPA_TO_FP_UNSIGNED: 'fpToFPUnsigned', + Z3_OP_FPA_TO_UBV : 'fpToUBV', Z3_OP_FPA_TO_SBV : 'fpToSBV', Z3_OP_FPA_TO_REAL: 'fpToReal', + Z3_OP_FPA_TO_IEEE_BV : 'fpToIEEEBV' + } + +_z3_op_to_fpa_pretty_str = { + Z3_OP_FPA_RM_NEAREST_TIES_TO_EVEN : 'RNE()', Z3_OP_FPA_RM_NEAREST_TIES_TO_AWAY : 'RNA()', + Z3_OP_FPA_RM_TOWARD_POSITIVE : 'RTP()', Z3_OP_FPA_RM_TOWARD_NEGATIVE : 'RTN()', + Z3_OP_FPA_RM_TOWARD_ZERO : 'RTZ()', + Z3_OP_FPA_PLUS_INF : '+oo', Z3_OP_FPA_MINUS_INF : '-oo', + Z3_OP_FPA_NAN : 'NaN', Z3_OP_FPA_PLUS_ZERO : '+0.0', Z3_OP_FPA_MINUS_ZERO : '-0.0', + + Z3_OP_FPA_ADD : '+', Z3_OP_FPA_SUB : '-', Z3_OP_FPA_MUL : '*', Z3_OP_FPA_DIV : '/', + Z3_OP_FPA_REM : '%', Z3_OP_FPA_NEG : '-', + + Z3_OP_FPA_EQ : 'fpEQ', Z3_OP_FPA_LT : '<', Z3_OP_FPA_GT : '>', Z3_OP_FPA_LE : '<=', Z3_OP_FPA_GE : '>=' +} + +_z3_fpa_infix = [ + Z3_OP_FPA_ADD, Z3_OP_FPA_SUB, Z3_OP_FPA_MUL, Z3_OP_FPA_DIV, Z3_OP_FPA_REM, + Z3_OP_FPA_LT, Z3_OP_FPA_GT, Z3_OP_FPA_LE, Z3_OP_FPA_GE +] + +def _is_assoc(k): + return k == Z3_OP_BOR or k == Z3_OP_BXOR or k == Z3_OP_BAND or k == Z3_OP_ADD or k == Z3_OP_BADD or k == Z3_OP_MUL or k == Z3_OP_BMUL + +def _is_left_assoc(k): + return _is_assoc(k) or k == Z3_OP_SUB or k == Z3_OP_BSUB + +def _is_html_assoc(k): + return k == Z3_OP_AND or k == Z3_OP_OR or k == Z3_OP_IFF or _is_assoc(k) + +def _is_html_left_assoc(k): + return _is_html_assoc(k) or k == Z3_OP_SUB or k == Z3_OP_BSUB + +def _is_add(k): + return k == Z3_OP_ADD or k == Z3_OP_BADD + +def _is_sub(k): + return k == Z3_OP_SUB or k == Z3_OP_BSUB + +import sys +if sys.version < '3': + import codecs + def u(x): + return codecs.unicode_escape_decode(x)[0] +else: + def u(x): + return x + +_z3_infix_compact = [ Z3_OP_MUL, Z3_OP_BMUL, Z3_OP_POWER, Z3_OP_DIV, Z3_OP_IDIV, Z3_OP_MOD, Z3_OP_BSDIV, Z3_OP_BSMOD ] + +_ellipses = '...' + +_html_ellipses = '…' +# Overwrite some of the operators for HTML +_z3_pre_html_op_to_str = { Z3_OP_EQ : '=', Z3_OP_IFF : '=', Z3_OP_NOT : '¬', + Z3_OP_AND : '∧', Z3_OP_OR : '∨', Z3_OP_IMPLIES : '⇒', + Z3_OP_LT : '<', Z3_OP_GT : '>', Z3_OP_LE : '≤', Z3_OP_GE : '≥', + Z3_OP_MUL : '·', + Z3_OP_SLEQ : '≤', Z3_OP_SLT : '<', Z3_OP_SGEQ : '≥', Z3_OP_SGT : '>', + Z3_OP_ULEQ : '≤<sub>u</sub>', Z3_OP_ULT : '<<sub>u</sub>', + Z3_OP_UGEQ : '≥<sub>u</sub>', Z3_OP_UGT : '><sub>u</sub>', + Z3_OP_BMUL : '·', + Z3_OP_BUDIV : '/<sub>u</sub>', Z3_OP_BUREM : '%<sub>u</sub>', + Z3_OP_BASHR : '>>', Z3_OP_BSHL : '<<', + Z3_OP_BLSHR : '>><sub>u</sub>' + } + +# Extra operators that are infix/unary for HTML +_z3_html_infix = [ Z3_OP_AND, Z3_OP_OR, Z3_OP_IMPLIES, + Z3_OP_ULEQ, Z3_OP_ULT, Z3_OP_UGEQ, Z3_OP_UGT, Z3_OP_BUDIV, Z3_OP_BUREM, Z3_OP_BLSHR + ] + +_z3_html_unary = [ Z3_OP_NOT ] + +# Extra Precedence for HTML +_z3_pre_html_precedence = { Z3_OP_BUDIV : 2, Z3_OP_BUREM : 2, + Z3_OP_BLSHR : 4, + Z3_OP_ULEQ : 8, Z3_OP_ULT : 8, + Z3_OP_UGEQ : 8, Z3_OP_UGT : 8, + Z3_OP_ULEQ : 8, Z3_OP_ULT : 8, + Z3_OP_UGEQ : 8, Z3_OP_UGT : 8, + Z3_OP_NOT : 1, + Z3_OP_AND : 10, + Z3_OP_OR : 11, + Z3_OP_IMPLIES : 12 } + +############################## +# +# End of Configuration +# +############################## + +def _support_pp(a): + return isinstance(a, z3.Z3PPObject) or isinstance(a, list) or isinstance(a, tuple) + +_infix_map = {} +_unary_map = {} +_infix_compact_map = {} + +for _k in _z3_infix: + _infix_map[_k] = True +for _k in _z3_unary: + _unary_map[_k] = True + +for _k in _z3_infix_compact: + _infix_compact_map[_k] = True + +def _is_infix(k): + global _infix_map + return _infix_map.get(k, False) + +def _is_infix_compact(k): + global _infix_compact_map + return _infix_compact_map.get(k, False) + +def _is_unary(k): + global _unary_map + return _unary_map.get(k, False) + +def _op_name(a): + if isinstance(a, z3.FuncDeclRef): + f = a + else: + f = a.decl() + k = f.kind() + n = _z3_op_to_str.get(k, None) + if n == None: + return f.name() + else: + return n + +def _get_precedence(k): + global _z3_precedence + return _z3_precedence.get(k, 100000) + +_z3_html_op_to_str = {} +for _k in _z3_op_to_str: + _v = _z3_op_to_str[_k] + _z3_html_op_to_str[_k] = _v +for _k in _z3_pre_html_op_to_str: + _v = _z3_pre_html_op_to_str[_k] + _z3_html_op_to_str[_k] = _v + +_z3_html_precedence = {} +for _k in _z3_precedence: + _v = _z3_precedence[_k] + _z3_html_precedence[_k] = _v +for _k in _z3_pre_html_precedence: + _v = _z3_pre_html_precedence[_k] + _z3_html_precedence[_k] = _v + +_html_infix_map = {} +_html_unary_map = {} +for _k in _z3_infix: + _html_infix_map[_k] = True +for _k in _z3_html_infix: + _html_infix_map[_k] = True +for _k in _z3_unary: + _html_unary_map[_k] = True +for _k in _z3_html_unary: + _html_unary_map[_k] = True + +def _is_html_infix(k): + global _html_infix_map + return _html_infix_map.get(k, False) + +def _is_html_unary(k): + global _html_unary_map + return _html_unary_map.get(k, False) + +def _html_op_name(a): + global _z3_html_op_to_str + if isinstance(a, z3.FuncDeclRef): + f = a + else: + f = a.decl() + k = f.kind() + n = _z3_html_op_to_str.get(k, None) + if n == None: + sym = Z3_get_decl_name(f.ctx_ref(), f.ast) + if Z3_get_symbol_kind(f.ctx_ref(), sym) == Z3_INT_SYMBOL: + return "ζ<sub>%s</sub>" % Z3_get_symbol_int(f.ctx_ref(), sym) + else: + # Sanitize the string + return f.name() + else: + return n + +def _get_html_precedence(k): + global _z3_html_predence + return _z3_html_precedence.get(k, 100000) + +class FormatObject: + def is_compose(self): + return False + def is_choice(self): + return False + def is_indent(self): + return False + def is_string(self): + return False + def is_linebreak(self): + return False + def is_nil(self): + return True + def children(self): + return [] + def as_tuple(self): + return None + def space_upto_nl(self): + return (0, False) + def flat(self): + return self + +class NAryFormatObject(FormatObject): + def __init__(self, fs): + assert all([isinstance(a, FormatObject) for a in fs]) + self.children = fs + def children(self): + return self.children + +class ComposeFormatObject(NAryFormatObject): + def is_compose(sef): + return True + def as_tuple(self): + return ('compose', [ a.as_tuple() for a in self.children ]) + def space_upto_nl(self): + r = 0 + for child in self.children: + s, nl = child.space_upto_nl() + r = r + s + if nl: + return (r, True) + return (r, False) + def flat(self): + return compose([a.flat() for a in self.children ]) + +class ChoiceFormatObject(NAryFormatObject): + def is_choice(sef): + return True + def as_tuple(self): + return ('choice', [ a.as_tuple() for a in self.children ]) + def space_upto_nl(self): + return self.children[0].space_upto_nl() + def flat(self): + return self.children[0].flat() + +class IndentFormatObject(FormatObject): + def __init__(self, indent, child): + assert isinstance(child, FormatObject) + self.indent = indent + self.child = child + def children(self): + return [self.child] + def as_tuple(self): + return ('indent', self.indent, self.child.as_tuple()) + def space_upto_nl(self): + return self.child.space_upto_nl() + def flat(self): + return indent(self.indent, self.child.flat()) + def is_indent(self): + return True + +class LineBreakFormatObject(FormatObject): + def __init__(self): + self.space = ' ' + def is_linebreak(self): + return True + def as_tuple(self): + return '<line-break>' + def space_upto_nl(self): + return (0, True) + def flat(self): + return to_format(self.space) + +class StringFormatObject(FormatObject): + def __init__(self, string): + assert isinstance(string, str) + self.string = string + def is_string(self): + return True + def as_tuple(self): + return self.string + def space_upto_nl(self): + return (getattr(self, 'size', len(self.string)), False) + +def fits(f, space_left): + s, nl = f.space_upto_nl() + return s <= space_left + +def to_format(arg, size=None): + if isinstance(arg, FormatObject): + return arg + else: + r = StringFormatObject(str(arg)) + if size != None: + r.size = size + return r + +def compose(*args): + if len(args) == 1 and (isinstance(args[0], list) or isinstance(args[0], tuple)): + args = args[0] + return ComposeFormatObject(args) + +def indent(i, arg): + return IndentFormatObject(i, arg) + +def group(arg): + return ChoiceFormatObject([arg.flat(), arg]) + +def line_break(): + return LineBreakFormatObject() + +def _len(a): + if isinstance(a, StringFormatObject): + return getattr(a, 'size', len(a.string)) + else: + return len(a) + +def seq(args, sep=',', space=True): + nl = line_break() + if not space: + nl.space = '' + r = [] + r.append(args[0]) + num = len(args) + for i in range(num - 1): + r.append(to_format(sep)) + r.append(nl) + r.append(args[i+1]) + return compose(r) + +def seq1(header, args, lp='(', rp=')'): + return group(compose(to_format(header), + to_format(lp), + indent(len(lp) + _len(header), + seq(args)), + to_format(rp))) + +def seq2(header, args, i=4, lp='(', rp=')'): + if len(args) == 0: + return compose(to_format(header), to_format(lp), to_format(rp)) + else: + return group(compose(indent(len(lp), compose(to_format(lp), to_format(header))), + indent(i, compose(seq(args), to_format(rp))))) + +def seq3(args, lp='(', rp=')'): + if len(args) == 0: + return compose(to_format(lp), to_format(rp)) + else: + return group(indent(len(lp), compose(to_format(lp), seq(args), to_format(rp)))) + +class StopPPException(Exception): + def __str__(self): + return 'pp-interrupted' + +class PP: + def __init__(self): + self.max_lines = 200 + self.max_width = 60 + self.bounded = False + self.max_indent = 40 + + def pp_string(self, f, indent): + if not self.bounded or self.pos <= self.max_width: + sz = _len(f) + if self.bounded and self.pos + sz > self.max_width: + self.out.write(u(_ellipses)) + else: + self.pos = self.pos + sz + self.ribbon_pos = self.ribbon_pos + sz + self.out.write(u(f.string)) + + def pp_compose(self, f, indent): + for c in f.children: + self.pp(c, indent) + + def pp_choice(self, f, indent): + space_left = self.max_width - self.pos + if space_left > 0 and fits(f.children[0], space_left): + self.pp(f.children[0], indent) + else: + self.pp(f.children[1], indent) + + def pp_line_break(self, f, indent): + self.pos = indent + self.ribbon_pos = 0 + self.line = self.line + 1 + if self.line < self.max_lines: + self.out.write(u('\n')) + for i in range(indent): + self.out.write(u(' ')) + else: + self.out.write(u('\n...')) + raise StopPPException() + + def pp(self, f, indent): + if f.is_string(): + self.pp_string(f, indent) + elif f.is_indent(): + self.pp(f.child, min(indent + f.indent, self.max_indent)) + elif f.is_compose(): + self.pp_compose(f, indent) + elif f.is_choice(): + self.pp_choice(f, indent) + elif f.is_linebreak(): + self.pp_line_break(f, indent) + else: + return + + def __call__(self, out, f): + try: + self.pos = 0 + self.ribbon_pos = 0 + self.line = 0 + self.out = out + self.pp(f, 0) + except StopPPException: + return + +class Formatter: + def __init__(self): + global _ellipses + self.max_depth = 20 + self.max_args = 128 + self.rational_to_decimal = False + self.precision = 10 + self.ellipses = to_format(_ellipses) + self.max_visited = 10000 + self.fpa_pretty = True + + def pp_ellipses(self): + return self.ellipses + + def pp_arrow(self): + return ' ->' + + def pp_unknown(self): + return '<unknown>' + + def pp_name(self, a): + return to_format(_op_name(a)) + + def is_infix(self, a): + return _is_infix(a) + + def is_unary(self, a): + return _is_unary(a) + + def get_precedence(self, a): + return _get_precedence(a) + + def is_infix_compact(self, a): + return _is_infix_compact(a) + + def is_infix_unary(self, a): + return self.is_infix(a) or self.is_unary(a) + + def add_paren(self, a): + return compose(to_format('('), indent(1, a), to_format(')')) + + def pp_sort(self, s): + if isinstance(s, z3.ArraySortRef): + return seq1('Array', (self.pp_sort(s.domain()), self.pp_sort(s.range()))) + elif isinstance(s, z3.BitVecSortRef): + return seq1('BitVec', (to_format(s.size()), )) + elif isinstance(s, z3.FPSortRef): + return seq1('FPSort', (to_format(s.ebits()), to_format(s.sbits()))) + else: + return to_format(s.name()) + + def pp_const(self, a): + return self.pp_name(a) + + def pp_int(self, a): + return to_format(a.as_string()) + + def pp_rational(self, a): + if not self.rational_to_decimal: + return to_format(a.as_string()) + else: + return to_format(a.as_decimal(self.precision)) + + def pp_algebraic(self, a): + return to_format(a.as_decimal(self.precision)) + + def pp_string(self, a): + return to_format(a.as_string()) + + def pp_bv(self, a): + return to_format(a.as_string()) + + def pp_fd(self, a): + return to_format(a.as_string()) + + def pp_fprm_value(self, a): + _z3_assert(z3.is_fprm_value(a), 'expected FPRMNumRef') + if self.fpa_pretty and (a.decl().kind() in _z3_op_to_fpa_pretty_str): + return to_format(_z3_op_to_fpa_pretty_str.get(a.decl().kind())) + else: + return to_format(_z3_op_to_fpa_normal_str.get(a.decl().kind())) + + def pp_fp_value(self, a): + _z3_assert(isinstance(a, z3.FPNumRef), 'type mismatch') + if not self.fpa_pretty: + r = [] + if (a.isNaN()): + r.append(to_format(_z3_op_to_fpa_normal_str[Z3_OP_FPA_NAN])) + r.append(to_format('(')) + r.append(to_format(a.sort())) + r.append(to_format(')')) + return compose(r) + elif (a.isInf()): + if (a.isNegative()): + r.append(to_format(_z3_op_to_fpa_normal_str[Z3_OP_FPA_MINUS_INF])) + else: + r.append(to_format(_z3_op_to_fpa_normal_str[Z3_OP_FPA_PLUS_INF])) + r.append(to_format('(')) + r.append(to_format(a.sort())) + r.append(to_format(')')) + return compose(r) + + elif (a.isZero()): + if (a.isNegative()): + return to_format('-zero') + else: + return to_format('+zero') + else: + _z3_assert(z3.is_fp_value(a), 'expecting FP num ast') + r = [] + sgn = c_int(0) + sgnb = Z3_fpa_get_numeral_sign(a.ctx_ref(), a.ast, byref(sgn)) + exp = Z3_fpa_get_numeral_exponent_string(a.ctx_ref(), a.ast, False) + sig = Z3_fpa_get_numeral_significand_string(a.ctx_ref(), a.ast) + r.append(to_format('FPVal(')) + if sgnb and sgn.value != 0: + r.append(to_format('-')) + r.append(to_format(sig)) + r.append(to_format('*(2**')) + r.append(to_format(exp)) + r.append(to_format(', ')) + r.append(to_format(a.sort())) + r.append(to_format('))')) + return compose(r) + else: + if (a.isNaN()): + return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_NAN]) + elif (a.isInf()): + if (a.isNegative()): + return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_MINUS_INF]) + else: + return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_PLUS_INF]) + elif (a.isZero()): + if (a.isNegative()): + return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_MINUS_ZERO]) + else: + return to_format(_z3_op_to_fpa_pretty_str[Z3_OP_FPA_PLUS_ZERO]) + else: + _z3_assert(z3.is_fp_value(a), 'expecting FP num ast') + r = [] + sgn = (ctypes.c_int)(0) + sgnb = Z3_fpa_get_numeral_sign(a.ctx_ref(), a.ast, byref(sgn)) + exp = Z3_fpa_get_numeral_exponent_string(a.ctx_ref(), a.ast, False) + sig = Z3_fpa_get_numeral_significand_string(a.ctx_ref(), a.ast) + if sgnb and sgn.value != 0: + r.append(to_format('-')) + r.append(to_format(sig)) + if (exp != '0'): + r.append(to_format('*(2**')) + r.append(to_format(exp)) + r.append(to_format(')')) + return compose(r) + + + def pp_fp(self, a, d, xs): + _z3_assert(isinstance(a, z3.FPRef), "type mismatch") + k = a.decl().kind() + op = '?' + if (self.fpa_pretty and k in _z3_op_to_fpa_pretty_str): + op = _z3_op_to_fpa_pretty_str[k] + elif k in _z3_op_to_fpa_normal_str: + op = _z3_op_to_fpa_normal_str[k] + elif k in _z3_op_to_str: + op = _z3_op_to_str[k] + + n = a.num_args() + + if self.fpa_pretty: + if self.is_infix(k) and n >= 3: + rm = a.arg(0) + if z3.is_fprm_value(rm) and z3.get_default_rounding_mode(a.ctx).eq(rm): + arg1 = to_format(self.pp_expr(a.arg(1), d+1, xs)) + arg2 = to_format(self.pp_expr(a.arg(2), d+1, xs)) + r = [] + r.append(arg1) + r.append(to_format(' ')) + r.append(to_format(op)) + r.append(to_format(' ')) + r.append(arg2) + return compose(r) + elif k == Z3_OP_FPA_NEG: + return compose([to_format('-') , to_format(self.pp_expr(a.arg(0), d+1, xs))]) + + if k in _z3_op_to_fpa_normal_str: + op = _z3_op_to_fpa_normal_str[k] + + r = [] + r.append(to_format(op)) + if not z3.is_const(a): + r.append(to_format('(')) + first = True + for c in a.children(): + if first: + first = False + else: + r.append(to_format(', ')) + r.append(self.pp_expr(c, d+1, xs)) + r.append(to_format(')')) + return compose(r) + else: + return to_format(a.as_string()) + + def pp_prefix(self, a, d, xs): + r = [] + sz = 0 + for child in a.children(): + r.append(self.pp_expr(child, d+1, xs)) + sz = sz + 1 + if sz > self.max_args: + r.append(self.pp_ellipses()) + break + return seq1(self.pp_name(a), r) + + def is_assoc(self, k): + return _is_assoc(k) + + def is_left_assoc(self, k): + return _is_left_assoc(k) + + def infix_args_core(self, a, d, xs, r): + sz = len(r) + k = a.decl().kind() + p = self.get_precedence(k) + first = True + for child in a.children(): + child_pp = self.pp_expr(child, d+1, xs) + child_k = None + if z3.is_app(child): + child_k = child.decl().kind() + if k == child_k and (self.is_assoc(k) or (first and self.is_left_assoc(k))): + self.infix_args_core(child, d, xs, r) + sz = len(r) + if sz > self.max_args: + return + elif self.is_infix_unary(child_k): + child_p = self.get_precedence(child_k) + if p > child_p or (_is_add(k) and _is_sub(child_k)) or (_is_sub(k) and first and _is_add(child_k)): + r.append(child_pp) + else: + r.append(self.add_paren(child_pp)) + sz = sz + 1 + elif z3.is_quantifier(child): + r.append(self.add_paren(child_pp)) + else: + r.append(child_pp) + sz = sz + 1 + if sz > self.max_args: + r.append(self.pp_ellipses()) + return + first = False + + def infix_args(self, a, d, xs): + r = [] + self.infix_args_core(a, d, xs, r) + return r + + def pp_infix(self, a, d, xs): + k = a.decl().kind() + if self.is_infix_compact(k): + op = self.pp_name(a) + return group(seq(self.infix_args(a, d, xs), op, False)) + else: + op = self.pp_name(a) + sz = _len(op) + op.string = ' ' + op.string + op.size = sz + 1 + return group(seq(self.infix_args(a, d, xs), op)) + + def pp_unary(self, a, d, xs): + k = a.decl().kind() + p = self.get_precedence(k) + child = a.children()[0] + child_k = None + if z3.is_app(child): + child_k = child.decl().kind() + child_pp = self.pp_expr(child, d+1, xs) + if k != child_k and self.is_infix_unary(child_k): + child_p = self.get_precedence(child_k) + if p <= child_p: + child_pp = self.add_paren(child_pp) + if z3.is_quantifier(child): + child_pp = self.add_paren(child_pp) + name = self.pp_name(a) + return compose(to_format(name), indent(_len(name), child_pp)) + + def pp_power_arg(self, arg, d, xs): + r = self.pp_expr(arg, d+1, xs) + k = None + if z3.is_app(arg): + k = arg.decl().kind() + if self.is_infix_unary(k) or (z3.is_rational_value(arg) and arg.denominator_as_long() != 1): + return self.add_paren(r) + else: + return r + + def pp_power(self, a, d, xs): + arg1_pp = self.pp_power_arg(a.arg(0), d+1, xs) + arg2_pp = self.pp_power_arg(a.arg(1), d+1, xs) + return group(seq((arg1_pp, arg2_pp), '**', False)) + + def pp_neq(self): + return to_format("!=") + + def pp_distinct(self, a, d, xs): + if a.num_args() == 2: + op = self.pp_neq() + sz = _len(op) + op.string = ' ' + op.string + op.size = sz + 1 + return group(seq(self.infix_args(a, d, xs), op)) + else: + return self.pp_prefix(a, d, xs) + + def pp_select(self, a, d, xs): + if a.num_args() != 2: + return self.pp_prefix(a, d, xs) + else: + arg1_pp = self.pp_expr(a.arg(0), d+1, xs) + arg2_pp = self.pp_expr(a.arg(1), d+1, xs) + return compose(arg1_pp, indent(2, compose(to_format('['), arg2_pp, to_format(']')))) + + def pp_unary_param(self, a, d, xs): + p = Z3_get_decl_int_parameter(a.ctx_ref(), a.decl().ast, 0) + arg = self.pp_expr(a.arg(0), d+1, xs) + return seq1(self.pp_name(a), [ to_format(p), arg ]) + + def pp_extract(self, a, d, xs): + h = Z3_get_decl_int_parameter(a.ctx_ref(), a.decl().ast, 0) + l = Z3_get_decl_int_parameter(a.ctx_ref(), a.decl().ast, 1) + arg = self.pp_expr(a.arg(0), d+1, xs) + return seq1(self.pp_name(a), [ to_format(h), to_format(l), arg ]) + + def pp_pattern(self, a, d, xs): + if a.num_args() == 1: + return self.pp_expr(a.arg(0), d, xs) + else: + return seq1('MultiPattern', [ self.pp_expr(arg, d+1, xs) for arg in a.children() ]) + + def pp_map(self, a, d, xs): + r = [] + sz = 0 + f = z3.get_map_func(a) + r.append(to_format(f.name())) + for child in a.children(): + r.append(self.pp_expr(child, d+1, xs)) + sz = sz + 1 + if sz > self.max_args: + r.append(self.pp_ellipses()) + break + return seq1(self.pp_name(a), r) + + def pp_K(self, a, d, xs): + return seq1(self.pp_name(a), [ self.pp_sort(a.domain()), self.pp_expr(a.arg(0), d+1, xs) ]) + + def pp_atmost(self, a, d, f, xs): + k = Z3_get_decl_int_parameter(a.ctx_ref(), a.decl().ast, 0) + return seq1(self.pp_name(a), [seq3([ self.pp_expr(ch, d+1, xs) for ch in a.children()]), to_format(k)]) + + def pp_pbcmp(self, a, d, f, xs): + chs = a.children() + rchs = range(len(chs)) + k = Z3_get_decl_int_parameter(a.ctx_ref(), a.decl().ast, 0) + ks = [Z3_get_decl_int_parameter(a.ctx_ref(), a.decl().ast, i+1) for i in rchs] + ls = [ seq3([self.pp_expr(chs[i], d+1,xs), to_format(ks[i])]) for i in rchs] + return seq1(self.pp_name(a), [seq3(ls), to_format(k)]) + + + def pp_app(self, a, d, xs): + if z3.is_int_value(a): + return self.pp_int(a) + elif z3.is_rational_value(a): + return self.pp_rational(a) + elif z3.is_algebraic_value(a): + return self.pp_algebraic(a) + elif z3.is_bv_value(a): + return self.pp_bv(a) + elif z3.is_finite_domain_value(a): + return self.pp_fd(a) + elif z3.is_fprm_value(a): + return self.pp_fprm_value(a) + elif z3.is_fp_value(a): + return self.pp_fp_value(a) + elif z3.is_fp(a): + return self.pp_fp(a, d, xs) + elif z3.is_string_value(a): + return self.pp_string(a) + elif z3.is_const(a): + return self.pp_const(a) + else: + f = a.decl() + k = f.kind() + if k == Z3_OP_POWER: + return self.pp_power(a, d, xs) + elif k == Z3_OP_DISTINCT: + return self.pp_distinct(a, d, xs) + elif k == Z3_OP_SELECT: + return self.pp_select(a, d, xs) + elif k == Z3_OP_SIGN_EXT or k == Z3_OP_ZERO_EXT or k == Z3_OP_REPEAT: + return self.pp_unary_param(a, d, xs) + elif k == Z3_OP_EXTRACT: + return self.pp_extract(a, d, xs) + elif k == Z3_OP_ARRAY_MAP: + return self.pp_map(a, d, xs) + elif k == Z3_OP_CONST_ARRAY: + return self.pp_K(a, d, xs) + elif k == Z3_OP_PB_AT_MOST: + return self.pp_atmost(a, d, f, xs) + elif k == Z3_OP_PB_LE: + return self.pp_pbcmp(a, d, f, xs) + elif k == Z3_OP_PB_GE: + return self.pp_pbcmp(a, d, f, xs) + elif z3.is_pattern(a): + return self.pp_pattern(a, d, xs) + elif self.is_infix(k): + return self.pp_infix(a, d, xs) + elif self.is_unary(k): + return self.pp_unary(a, d, xs) + else: + return self.pp_prefix(a, d, xs) + + def pp_var(self, a, d, xs): + idx = z3.get_var_index(a) + sz = len(xs) + if idx >= sz: + return seq1('Var', (to_format(idx),)) + else: + return to_format(xs[sz - idx - 1]) + + def pp_quantifier(self, a, d, xs): + ys = [ to_format(a.var_name(i)) for i in range(a.num_vars()) ] + new_xs = xs + ys + body_pp = self.pp_expr(a.body(), d+1, new_xs) + if len(ys) == 1: + ys_pp = ys[0] + else: + ys_pp = seq3(ys, '[', ']') + if a.is_forall(): + header = 'ForAll' + else: + header = 'Exists' + return seq1(header, (ys_pp, body_pp)) + + def pp_expr(self, a, d, xs): + self.visited = self.visited + 1 + if d > self.max_depth or self.visited > self.max_visited: + return self.pp_ellipses() + if z3.is_app(a): + return self.pp_app(a, d, xs) + elif z3.is_quantifier(a): + return self.pp_quantifier(a, d, xs) + elif z3.is_var(a): + return self.pp_var(a, d, xs) + else: + return to_format(self.pp_unknown()) + + def pp_seq_core(self, f, a, d, xs): + self.visited = self.visited + 1 + if d > self.max_depth or self.visited > self.max_visited: + return self.pp_ellipses() + r = [] + sz = 0 + for elem in a: + r.append(f(elem, d+1, xs)) + sz = sz + 1 + if sz > self.max_args: + r.append(self.pp_ellipses()) + break + return seq3(r, '[', ']') + + def pp_seq(self, a, d, xs): + return self.pp_seq_core(self.pp_expr, a, d, xs) + + def pp_seq_seq(self, a, d, xs): + return self.pp_seq_core(self.pp_seq, a, d, xs) + + def pp_model(self, m): + r = [] + sz = 0 + for d in m: + i = m[d] + if isinstance(i, z3.FuncInterp): + i_pp = self.pp_func_interp(i) + else: + i_pp = self.pp_expr(i, 0, []) + name = self.pp_name(d) + r.append(compose(name, to_format(' = '), indent(_len(name) + 3, i_pp))) + sz = sz + 1 + if sz > self.max_args: + r.append(self.pp_ellipses()) + break + return seq3(r, '[', ']') + + def pp_func_entry(self, e): + num = e.num_args() + if num > 1: + args = [] + for i in range(num): + args.append(self.pp_expr(e.arg_value(i), 0, [])) + args_pp = group(seq3(args)) + else: + args_pp = self.pp_expr(e.arg_value(0), 0, []) + value_pp = self.pp_expr(e.value(), 0, []) + return group(seq((args_pp, value_pp), self.pp_arrow())) + + def pp_func_interp(self, f): + r = [] + sz = 0 + num = f.num_entries() + for i in range(num): + r.append(self.pp_func_entry(f.entry(i))) + sz = sz + 1 + if sz > self.max_args: + r.append(self.pp_ellipses()) + break + if sz <= self.max_args: + else_val = f.else_value() + if else_val == None: + else_pp = to_format('#unspecified') + else: + else_pp = self.pp_expr(else_val, 0, []) + r.append(group(seq((to_format('else'), else_pp), self.pp_arrow()))) + return seq3(r, '[', ']') + + def pp_list(self, a): + r = [] + sz = 0 + for elem in a: + if _support_pp(elem): + r.append(self.main(elem)) + else: + r.append(to_format(str(elem))) + sz = sz + 1 + if sz > self.max_args: + r.append(self.pp_ellipses()) + break + if isinstance(a, tuple): + return seq3(r) + else: + return seq3(r, '[', ']') + + def main(self, a): + if z3.is_expr(a): + return self.pp_expr(a, 0, []) + elif z3.is_sort(a): + return self.pp_sort(a) + elif z3.is_func_decl(a): + return self.pp_name(a) + elif isinstance(a, z3.Goal) or isinstance(a, z3.AstVector): + return self.pp_seq(a, 0, []) + elif isinstance(a, z3.Solver): + return self.pp_seq(a.assertions(), 0, []) + elif isinstance(a, z3.Fixedpoint): + return a.sexpr() + elif isinstance(a, z3.Optimize): + return a.sexpr() + elif isinstance(a, z3.ApplyResult): + return self.pp_seq_seq(a, 0, []) + elif isinstance(a, z3.ModelRef): + return self.pp_model(a) + elif isinstance(a, z3.FuncInterp): + return self.pp_func_interp(a) + elif isinstance(a, list) or isinstance(a, tuple): + return self.pp_list(a) + else: + return to_format(self.pp_unknown()) + + def __call__(self, a): + self.visited = 0 + return self.main(a) + +class HTMLFormatter(Formatter): + def __init__(self): + Formatter.__init__(self) + global _html_ellipses + self.ellipses = to_format(_html_ellipses) + + def pp_arrow(self): + return to_format(' →', 1) + + def pp_unknown(self): + return '<b>unknown</b>' + + def pp_name(self, a): + r = _html_op_name(a) + if r[0] == '&' or r[0] == '/' or r[0] == '%': + return to_format(r, 1) + else: + pos = r.find('__') + if pos == -1 or pos == 0: + return to_format(r) + else: + sz = len(r) + if pos + 2 == sz: + return to_format(r) + else: + return to_format('%s<sub>%s</sub>' % (r[0:pos], r[pos+2:sz]), sz - 2) + + def is_assoc(self, k): + return _is_html_assoc(k) + + def is_left_assoc(self, k): + return _is_html_left_assoc(k) + + def is_infix(self, a): + return _is_html_infix(a) + + def is_unary(self, a): + return _is_html_unary(a) + + def get_precedence(self, a): + return _get_html_precedence(a) + + def pp_neq(self): + return to_format("≠") + + def pp_power(self, a, d, xs): + arg1_pp = self.pp_power_arg(a.arg(0), d+1, xs) + arg2_pp = self.pp_expr(a.arg(1), d+1, xs) + return compose(arg1_pp, to_format('<sup>', 1), arg2_pp, to_format('</sup>', 1)) + + def pp_var(self, a, d, xs): + idx = z3.get_var_index(a) + sz = len(xs) + if idx >= sz: + # 957 is the greek letter nu + return to_format('ν<sub>%s</sub>' % idx, 1) + else: + return to_format(xs[sz - idx - 1]) + + def pp_quantifier(self, a, d, xs): + ys = [ to_format(a.var_name(i)) for i in range(a.num_vars()) ] + new_xs = xs + ys + body_pp = self.pp_expr(a.body(), d+1, new_xs) + ys_pp = group(seq(ys)) + if a.is_forall(): + header = '∀' + else: + header = '∃' + return group(compose(to_format(header, 1), + indent(1, compose(ys_pp, to_format(' :'), line_break(), body_pp)))) + + +_PP = PP() +_Formatter = Formatter() + +def set_pp_option(k, v): + if k == 'html_mode': + if v: + set_html_mode(True) + else: + set_html_mode(False) + return True + if k == 'fpa_pretty': + if v: + set_fpa_pretty(True) + else: + set_fpa_pretty(False) + return True + val = getattr(_PP, k, None) + if val != None: + _z3_assert(type(v) == type(val), "Invalid pretty print option value") + setattr(_PP, k, v) + return True + val = getattr(_Formatter, k, None) + if val != None: + _z3_assert(type(v) == type(val), "Invalid pretty print option value") + setattr(_Formatter, k, v) + return True + return False + +def obj_to_string(a): + out = io.StringIO() + _PP(out, _Formatter(a)) + return out.getvalue() + +_html_out = None + +def set_html_mode(flag=True): + global _Formatter + if flag: + _Formatter = HTMLFormatter() + else: + _Formatter = Formatter() + +def set_fpa_pretty(flag=True): + global _Formatter + global _z3_op_to_str + _Formatter.fpa_pretty = flag + if flag: + for (_k,_v) in _z3_op_to_fpa_pretty_str.items(): + _z3_op_to_str[_k] = _v + for _k in _z3_fpa_infix: + _infix_map[_k] = True + else: + for (_k,_v) in _z3_op_to_fpa_normal_str.items(): + _z3_op_to_str[_k] = _v + for _k in _z3_fpa_infix: + _infix_map[_k] = False + +set_fpa_pretty(True) + +def get_fpa_pretty(): + global Formatter + return _Formatter.fpa_pretty + +def in_html_mode(): + return isinstance(_Formatter, HTMLFormatter) + +def pp(a): + if _support_pp(a): + print(obj_to_string(a)) + else: + print(a) + +def print_matrix(m): + _z3_assert(isinstance(m, list) or isinstance(m, tuple), "matrix expected") + if not in_html_mode(): + print(obj_to_string(m)) + else: + print('<table cellpadding="2", cellspacing="0", border="1">') + for r in m: + _z3_assert(isinstance(r, list) or isinstance(r, tuple), "matrix expected") + print('<tr>') + for c in r: + print('<td>%s</td>' % c) + print('</tr>') + print('</table>') + +def insert_line_breaks(s, width): + """Break s in lines of size width (approx)""" + sz = len(s) + if sz <= width: + return s + new_str = io.StringIO() + w = 0 + for i in range(sz): + if w > width and s[i] == ' ': + new_str.write(u('<br />')) + w = 0 + else: + new_str.write(u(s[i])) + w = w + 1 + return new_str.getvalue() diff --git a/rba.tool.core/lib32/z3/python/z3/z3printer.pyc b/rba.tool.core/lib32/z3/python/z3/z3printer.pyc Binary files differnew file mode 100644 index 0000000..980abc3 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3printer.pyc diff --git a/rba.tool.core/lib32/z3/python/z3/z3rcf.py b/rba.tool.core/lib32/z3/python/z3/z3rcf.py new file mode 100644 index 0000000..9d6f2f6 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3rcf.py @@ -0,0 +1,163 @@ +############################################ +# Copyright (c) 2013 Microsoft Corporation +# +# Z3 Python interface for Z3 Real Closed Fields +# that may contain +# - computable transcendentals +# - infinitesimals +# - algebraic extensions +# +# Author: Leonardo de Moura (leonardo) +############################################ +from .z3 import * +from .z3core import * +from .z3printer import * +from fractions import Fraction + +def _to_rcfnum(num, ctx=None): + if isinstance(num, RCFNum): + return num + else: + return RCFNum(num, ctx) + +def Pi(ctx=None): + ctx = z3._get_ctx(ctx) + return RCFNum(Z3_rcf_mk_pi(ctx.ref()), ctx) + +def E(ctx=None): + ctx = z3._get_ctx(ctx) + return RCFNum(Z3_rcf_mk_e(ctx.ref()), ctx) + +def MkInfinitesimal(name="eps", ctx=None): + # Todo: remove parameter name. + # For now, we keep it for backward compatibility. + ctx = z3._get_ctx(ctx) + return RCFNum(Z3_rcf_mk_infinitesimal(ctx.ref()), ctx) + +def MkRoots(p, ctx=None): + ctx = z3._get_ctx(ctx) + num = len(p) + _tmp = [] + _as = (RCFNumObj * num)() + _rs = (RCFNumObj * num)() + for i in range(num): + _a = _to_rcfnum(p[i], ctx) + _tmp.append(_a) # prevent GC + _as[i] = _a.num + nr = Z3_rcf_mk_roots(ctx.ref(), num, _as, _rs) + r = [] + for i in range(nr): + r.append(RCFNum(_rs[i], ctx)) + return r + +class RCFNum: + def __init__(self, num, ctx=None): + # TODO: add support for converting AST numeral values into RCFNum + if isinstance(num, RCFNumObj): + self.num = num + self.ctx = z3._get_ctx(ctx) + else: + self.ctx = z3._get_ctx(ctx) + self.num = Z3_rcf_mk_rational(self.ctx_ref(), str(num)) + + def __del__(self): + Z3_rcf_del(self.ctx_ref(), self.num) + + def ctx_ref(self): + return self.ctx.ref() + + def __repr__(self): + return Z3_rcf_num_to_string(self.ctx_ref(), self.num, False, in_html_mode()) + + def compact_str(self): + return Z3_rcf_num_to_string(self.ctx_ref(), self.num, True, in_html_mode()) + + def __add__(self, other): + v = _to_rcfnum(other, self.ctx) + return RCFNum(Z3_rcf_add(self.ctx_ref(), self.num, v.num), self.ctx) + + def __radd__(self, other): + v = _to_rcfnum(other, self.ctx) + return RCFNum(Z3_rcf_add(self.ctx_ref(), v.num, self.num), self.ctx) + + def __mul__(self, other): + v = _to_rcfnum(other, self.ctx) + return RCFNum(Z3_rcf_mul(self.ctx_ref(), self.num, v.num), self.ctx) + + def __rmul__(self, other): + v = _to_rcfnum(other, self.ctx) + return RCFNum(Z3_rcf_mul(self.ctx_ref(), v.num, self.num), self.ctx) + + def __sub__(self, other): + v = _to_rcfnum(other, self.ctx) + return RCFNum(Z3_rcf_sub(self.ctx_ref(), self.num, v.num), self.ctx) + + def __rsub__(self, other): + v = _to_rcfnum(other, self.ctx) + return RCFNum(Z3_rcf_sub(self.ctx_ref(), v.num, self.num), self.ctx) + + def __div__(self, other): + v = _to_rcfnum(other, self.ctx) + return RCFNum(Z3_rcf_div(self.ctx_ref(), self.num, v.num), self.ctx) + + def __rdiv__(self, other): + v = _to_rcfnum(other, self.ctx) + return RCFNum(Z3_rcf_div(self.ctx_ref(), v.num, self.num), self.ctx) + + def __neg__(self): + return self.__rsub__(0) + + def power(self, k): + return RCFNum(Z3_rcf_power(self.ctx_ref(), self.num, k), self.ctx) + + def __pow__(self, k): + return self.power(k) + + def decimal(self, prec=5): + return Z3_rcf_num_to_decimal_string(self.ctx_ref(), self.num, prec) + + def __lt__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_lt(self.ctx_ref(), self.num, v.num) + + def __rlt__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_lt(self.ctx_ref(), v.num, self.num) + + def __gt__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_gt(self.ctx_ref(), self.num, v.num) + + def __rgt__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_gt(self.ctx_ref(), v.num, self.num) + + def __le__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_le(self.ctx_ref(), self.num, v.num) + + def __rle__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_le(self.ctx_ref(), v.num, self.num) + + def __ge__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_ge(self.ctx_ref(), self.num, v.num) + + def __rge__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_ge(self.ctx_ref(), v.num, self.num) + + def __eq__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_eq(self.ctx_ref(), self.num, v.num) + + def __ne__(self, other): + v = _to_rcfnum(other, self.ctx) + return Z3_rcf_neq(self.ctx_ref(), self.num, v.num) + + def split(self): + n = (RCFNumObj * 1)() + d = (RCFNumObj * 1)() + Z3_rcf_get_numerator_denominator(self.ctx_ref(), self.num, n, d) + return (RCFNum(n[0], self.ctx), RCFNum(d[0], self.ctx)) diff --git a/rba.tool.core/lib32/z3/python/z3/z3rcf.pyc b/rba.tool.core/lib32/z3/python/z3/z3rcf.pyc Binary files differnew file mode 100644 index 0000000..c18977d --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3rcf.pyc diff --git a/rba.tool.core/lib32/z3/python/z3/z3types.py b/rba.tool.core/lib32/z3/python/z3/z3types.py new file mode 100644 index 0000000..7cf61f4 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3types.py @@ -0,0 +1,123 @@ +############################################ +# Copyright (c) 2012 Microsoft Corporation +# +# Z3 Python interface +# +# Author: Leonardo de Moura (leonardo) +############################################ + +import ctypes + +class Z3Exception(Exception): + def __init__(self, value): + self.value = value + def __str__(self): + return str(self.value) + +class ContextObj(ctypes.c_void_p): + def __init__(self, context): self._as_parameter_ = context + def from_param(obj): return obj + +class Config(ctypes.c_void_p): + def __init__(self, config): self._as_parameter_ = config + def from_param(obj): return obj + +class Symbol(ctypes.c_void_p): + def __init__(self, symbol): self._as_parameter_ = symbol + def from_param(obj): return obj + +class Sort(ctypes.c_void_p): + def __init__(self, sort): self._as_parameter_ = sort + def from_param(obj): return obj + +class FuncDecl(ctypes.c_void_p): + def __init__(self, decl): self._as_parameter_ = decl + def from_param(obj): return obj + +class Ast(ctypes.c_void_p): + def __init__(self, ast): self._as_parameter_ = ast + def from_param(obj): return obj + +class Pattern(ctypes.c_void_p): + def __init__(self, pattern): self._as_parameter_ = pattern + def from_param(obj): return obj + +class Model(ctypes.c_void_p): + def __init__(self, model): self._as_parameter_ = model + def from_param(obj): return obj + +class Literals(ctypes.c_void_p): + def __init__(self, literals): self._as_parameter_ = literals + def from_param(obj): return obj + +class Constructor(ctypes.c_void_p): + def __init__(self, constructor): self._as_parameter_ = constructor + def from_param(obj): return obj + +class ConstructorList(ctypes.c_void_p): + def __init__(self, constructor_list): self._as_parameter_ = constructor_list + def from_param(obj): return obj + +class GoalObj(ctypes.c_void_p): + def __init__(self, goal): self._as_parameter_ = goal + def from_param(obj): return obj + +class TacticObj(ctypes.c_void_p): + def __init__(self, tactic): self._as_parameter_ = tactic + def from_param(obj): return obj + +class ProbeObj(ctypes.c_void_p): + def __init__(self, probe): self._as_parameter_ = probe + def from_param(obj): return obj + +class ApplyResultObj(ctypes.c_void_p): + def __init__(self, obj): self._as_parameter_ = obj + def from_param(obj): return obj + +class StatsObj(ctypes.c_void_p): + def __init__(self, statistics): self._as_parameter_ = statistics + def from_param(obj): return obj + +class SolverObj(ctypes.c_void_p): + def __init__(self, solver): self._as_parameter_ = solver + def from_param(obj): return obj + +class FixedpointObj(ctypes.c_void_p): + def __init__(self, fixedpoint): self._as_parameter_ = fixedpoint + def from_param(obj): return obj + +class OptimizeObj(ctypes.c_void_p): + def __init__(self, optimize): self._as_parameter_ = optimize + def from_param(obj): return obj + +class ModelObj(ctypes.c_void_p): + def __init__(self, model): self._as_parameter_ = model + def from_param(obj): return obj + +class AstVectorObj(ctypes.c_void_p): + def __init__(self, vector): self._as_parameter_ = vector + def from_param(obj): return obj + +class AstMapObj(ctypes.c_void_p): + def __init__(self, ast_map): self._as_parameter_ = ast_map + def from_param(obj): return obj + +class Params(ctypes.c_void_p): + def __init__(self, params): self._as_parameter_ = params + def from_param(obj): return obj + +class ParamDescrs(ctypes.c_void_p): + def __init__(self, paramdescrs): self._as_parameter_ = paramdescrs + def from_param(obj): return obj + +class FuncInterpObj(ctypes.c_void_p): + def __init__(self, f): self._as_parameter_ = f + def from_param(obj): return obj + +class FuncEntryObj(ctypes.c_void_p): + def __init__(self, e): self._as_parameter_ = e + def from_param(obj): return obj + +class RCFNumObj(ctypes.c_void_p): + def __init__(self, e): self._as_parameter_ = e + def from_param(obj): return obj diff --git a/rba.tool.core/lib32/z3/python/z3/z3types.pyc b/rba.tool.core/lib32/z3/python/z3/z3types.pyc Binary files differnew file mode 100644 index 0000000..3dfec40 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3types.pyc diff --git a/rba.tool.core/lib32/z3/python/z3/z3util.py b/rba.tool.core/lib32/z3/python/z3/z3util.py new file mode 100644 index 0000000..fe7e76b --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3util.py @@ -0,0 +1,508 @@ +############################################ +# Copyright (c) 2012 Microsoft Corporation +# +# Z3 Python interface +# +# Authors: Leonardo de Moura (leonardo) +# ThanhVu (Vu) Nguyen <tnguyen@cs.unm.edu> +############################################ +""" +Usage: +import common_z3 as CM_Z3 +""" + +from .z3 import * + +def vset(seq, idfun=None, as_list=True): + # This functions preserves the order of arguments while removing duplicates. + # This function is from https://code.google.com/p/common-python-vu/source/browse/vu_common.py + # (Thanhu's personal code). It has been copied here to avoid a dependency on vu_common.py. + """ + order preserving + + >>> vset([[11,2],1, [10,['9',1]],2, 1, [11,2],[3,3],[10,99],1,[10,['9',1]]],idfun=repr) + [[11, 2], 1, [10, ['9', 1]], 2, [3, 3], [10, 99]] + """ + + def _uniq_normal(seq): + d_ = {} + for s in seq: + if s not in d_: + d_[s] = None + yield s + + def _uniq_idfun(seq,idfun): + d_ = {} + for s in seq: + h_ = idfun(s) + if h_ not in d_: + d_[h_] = None + yield s + + if idfun is None: + res = _uniq_normal(seq) + else: + res = _uniq_idfun(seq,idfun) + + return list(res) if as_list else res + + +def get_z3_version(as_str=False): + major = ctypes.c_uint(0) + minor = ctypes.c_uint(0) + build = ctypes.c_uint(0) + rev = ctypes.c_uint(0) + Z3_get_version(major,minor,build,rev) + rs = map(int,(major.value,minor.value,build.value,rev.value)) + if as_str: + return "{}.{}.{}.{}".format(*rs) + else: + return rs + + +def ehash(v): + """ + Returns a 'stronger' hash value than the default hash() method. + The result from hash() is not enough to distinguish between 2 + z3 expressions in some cases. + + Note: the following doctests will fail with Python 2.x as the + default formatting doesn't match that of 3.x. + >>> x1 = Bool('x'); x2 = Bool('x'); x3 = Int('x') + >>> print(x1.hash(),x2.hash(),x3.hash()) #BAD: all same hash values + 783810685 783810685 783810685 + >>> print(ehash(x1), ehash(x2), ehash(x3)) + x_783810685_1 x_783810685_1 x_783810685_2 + + """ + if __debug__: + assert is_expr(v) + + return "{}_{}_{}".format(str(v),v.hash(),v.sort_kind()) + + +""" +In Z3, variables are called *uninterpreted* consts and +variables are *interpreted* consts. +""" + +def is_expr_var(v): + """ + EXAMPLES: + + >>> is_expr_var(Int('7')) + True + >>> is_expr_var(IntVal('7')) + False + >>> is_expr_var(Bool('y')) + True + >>> is_expr_var(Int('x') + 7 == Int('y')) + False + >>> LOnOff, (On,Off) = EnumSort("LOnOff",['On','Off']) + >>> Block,Reset,SafetyInjection=Consts("Block Reset SafetyInjection",LOnOff) + >>> is_expr_var(LOnOff) + False + >>> is_expr_var(On) + False + >>> is_expr_var(Block) + True + >>> is_expr_var(SafetyInjection) + True + """ + + return is_const(v) and v.decl().kind()==Z3_OP_UNINTERPRETED + +def is_expr_val(v): + """ + EXAMPLES: + + >>> is_expr_val(Int('7')) + False + >>> is_expr_val(IntVal('7')) + True + >>> is_expr_val(Bool('y')) + False + >>> is_expr_val(Int('x') + 7 == Int('y')) + False + >>> LOnOff, (On,Off) = EnumSort("LOnOff",['On','Off']) + >>> Block,Reset,SafetyInjection=Consts("Block Reset SafetyInjection",LOnOff) + >>> is_expr_val(LOnOff) + False + >>> is_expr_val(On) + True + >>> is_expr_val(Block) + False + >>> is_expr_val(SafetyInjection) + False + """ + return is_const(v) and v.decl().kind()!=Z3_OP_UNINTERPRETED + + + + +def get_vars(f,rs=[]): + """ + >>> x,y = Ints('x y') + >>> a,b = Bools('a b') + >>> get_vars(Implies(And(x+y==0,x*2==10),Or(a,Implies(a,b==False)))) + [x, y, a, b] + + """ + if __debug__: + assert is_expr(f) + + if is_const(f): + if is_expr_val(f): + return rs + else: #variable + return vset(rs + [f],str) + + else: + for f_ in f.children(): + rs = get_vars(f_,rs) + + return vset(rs,str) + + + +def mk_var(name,vsort): + if vsort.kind() == Z3_INT_SORT: + v = Int(name) + elif vsort.kind() == Z3_REAL_SORT: + v = Real(name) + elif vsort.kind() == Z3_BOOL_SORT: + v = Bool(name) + elif vsort.kind() == Z3_DATATYPE_SORT: + v = Const(name,vsort) + + else: + assert False, 'Cannot handle this sort (s: %sid: %d)'\ + %(vsort,vsort.kind()) + + return v + + + +def prove(claim,assume=None,verbose=0): + """ + >>> r,m = prove(BoolVal(True),verbose=0); r,model_str(m,as_str=False) + (True, None) + + #infinite counter example when proving contradiction + >>> r,m = prove(BoolVal(False)); r,model_str(m,as_str=False) + (False, []) + + >>> x,y,z=Bools('x y z') + >>> r,m = prove(And(x,Not(x))); r,model_str(m,as_str=True) + (False, '[]') + + >>> r,m = prove(True,assume=And(x,Not(x)),verbose=0) + Traceback (most recent call last): + ... + AssertionError: Assumption is alway False! + + >>> r,m = prove(Implies(x,x),assume=y,verbose=2); r,model_str(m,as_str=False) + assume: + y + claim: + Implies(x, x) + to_prove: + Implies(y, Implies(x, x)) + (True, None) + + >>> r,m = prove(And(x,True),assume=y,verbose=0); r,model_str(m,as_str=False) + (False, [(x, False), (y, True)]) + + >>> r,m = prove(And(x,y),assume=y,verbose=0) + >>> print(r) + False + >>> print(model_str(m,as_str=True)) + x = False + y = True + + >>> a,b = Ints('a b') + >>> r,m = prove(a**b == b**a,assume=None,verbose=0) + E: cannot solve ! + >>> r is None and m is None + True + + """ + + if __debug__: + assert not assume or is_expr(assume) + + + to_prove = claim + if assume: + if __debug__: + is_proved,_ = prove(Not(assume)) + + def _f(): + emsg = "Assumption is alway False!" + if verbose >= 2: + emsg = "{}\n{}".format(assume,emsg) + return emsg + + assert is_proved==False, _f() + + to_prove = Implies(assume,to_prove) + + + + if verbose >= 2: + print('assume: ') + print(assume) + print('claim: ') + print(claim) + print('to_prove: ') + print(to_prove) + + f = Not(to_prove) + + models = get_models(f,k=1) + if models is None: #unknown + print('E: cannot solve !') + return None, None + elif models == False: #unsat + return True,None + else: #sat + if __debug__: + assert isinstance(models,list) + + if models: + return False, models[0] #the first counterexample + else: + return False, [] #infinite counterexample,models + + +def get_models(f,k): + """ + Returns the first k models satisfiying f. + If f is not satisfiable, returns False. + If f cannot be solved, returns None + If f is satisfiable, returns the first k models + Note that if f is a tautology, e.g.\ True, then the result is [] + + Based on http://stackoverflow.com/questions/11867611/z3py-checking-all-solutions-for-equation + + EXAMPLES: + >>> x, y = Ints('x y') + >>> len(get_models(And(0<=x,x <= 4),k=11)) + 5 + >>> get_models(And(0<=x**y,x <= 1),k=2) is None + True + >>> get_models(And(0<=x,x <= -1),k=2) + False + >>> len(get_models(x+y==7,5)) + 5 + >>> len(get_models(And(x<=5,x>=1),7)) + 5 + >>> get_models(And(x<=0,x>=5),7) + False + + >>> x = Bool('x') + >>> get_models(And(x,Not(x)),k=1) + False + >>> get_models(Implies(x,x),k=1) + [] + >>> get_models(BoolVal(True),k=1) + [] + + + + """ + + if __debug__: + assert is_expr(f) + assert k>=1 + + + + s = Solver() + s.add(f) + + models = [] + i = 0 + while s.check() == sat and i < k: + i = i + 1 + + m = s.model() + + if not m: #if m == [] + break + + models.append(m) + + + #create new constraint to block the current model + block = Not(And([v() == m[v] for v in m])) + s.add(block) + + + if s.check() == unknown: + return None + elif s.check() == unsat and i==0: + return False + else: + return models + +def is_tautology(claim,verbose=0): + """ + >>> is_tautology(Implies(Bool('x'),Bool('x'))) + True + + >>> is_tautology(Implies(Bool('x'),Bool('y'))) + False + + >>> is_tautology(BoolVal(True)) + True + + >>> is_tautology(BoolVal(False)) + False + + """ + return prove(claim=claim,assume=None,verbose=verbose)[0] + + +def is_contradiction(claim,verbose=0): + """ + >>> x,y=Bools('x y') + >>> is_contradiction(BoolVal(False)) + True + + >>> is_contradiction(BoolVal(True)) + False + + >>> is_contradiction(x) + False + + >>> is_contradiction(Implies(x,y)) + False + + >>> is_contradiction(Implies(x,x)) + False + + >>> is_contradiction(And(x,Not(x))) + True + """ + + return prove(claim=Not(claim),assume=None,verbose=verbose)[0] + + +def exact_one_model(f): + """ + return True if f has exactly 1 model, False otherwise. + + EXAMPLES: + + >>> x, y = Ints('x y') + >>> exact_one_model(And(0<=x**y,x <= 0)) + False + + >>> exact_one_model(And(0<=x,x <= 0)) + True + + >>> exact_one_model(And(0<=x,x <= 1)) + False + + >>> exact_one_model(And(0<=x,x <= -1)) + False + """ + + models = get_models(f,k=2) + if isinstance(models,list): + return len(models)==1 + else: + return False + + + +def myBinOp(op,*L): + """ + >>> myAnd(*[Bool('x'),Bool('y')]) + And(x, y) + + >>> myAnd(*[Bool('x'),None]) + x + + >>> myAnd(*[Bool('x')]) + x + + >>> myAnd(*[]) + + >>> myAnd(Bool('x'),Bool('y')) + And(x, y) + + >>> myAnd(*[Bool('x'),Bool('y')]) + And(x, y) + + >>> myAnd([Bool('x'),Bool('y')]) + And(x, y) + + >>> myAnd((Bool('x'),Bool('y'))) + And(x, y) + + >>> myAnd(*[Bool('x'),Bool('y'),True]) + Traceback (most recent call last): + ... + AssertionError + """ + + if __debug__: + assert op == Z3_OP_OR or op == Z3_OP_AND or op == Z3_OP_IMPLIES + + if len(L)==1 and (isinstance(L[0],list) or isinstance(L[0],tuple)): + L = L[0] + + if __debug__: + assert all(not isinstance(l,bool) for l in L) + + L = [l for l in L if is_expr(l)] + if L: + if len(L)==1: + return L[0] + else: + if op == Z3_OP_OR: + return Or(L) + elif op == Z3_OP_AND: + return And(L) + else: #IMPLIES + return Implies(L[0],L[1]) + else: + return None + + +def myAnd(*L): return myBinOp(Z3_OP_AND,*L) +def myOr(*L): return myBinOp(Z3_OP_OR,*L) +def myImplies(a,b):return myBinOp(Z3_OP_IMPLIES,[a,b]) + + + +Iff = lambda f: And(Implies(f[0],f[1]),Implies(f[1],f[0])) + + + +def model_str(m,as_str=True): + """ + Returned a 'sorted' model (so that it's easier to see) + The model is sorted by its key, + e.g. if the model is y = 3 , x = 10, then the result is + x = 10, y = 3 + + EXAMPLES: + see doctest exampels from function prove() + + """ + if __debug__: + assert m is None or m == [] or isinstance(m,ModelRef) + + if m : + vs = [(v,m[v]) for v in m] + vs = sorted(vs,key=lambda a,_: str(a)) + if as_str: + return '\n'.join(['{} = {}'.format(k,v) for (k,v) in vs]) + else: + return vs + else: + return str(m) if as_str else m + diff --git a/rba.tool.core/lib32/z3/python/z3/z3util.pyc b/rba.tool.core/lib32/z3/python/z3/z3util.pyc Binary files differnew file mode 100644 index 0000000..99ac672 --- /dev/null +++ b/rba.tool.core/lib32/z3/python/z3/z3util.pyc diff --git a/rba.tool.core/lib32/z3/vcomp110.dll b/rba.tool.core/lib32/z3/vcomp110.dll Binary files differnew file mode 100644 index 0000000..d4c56c3 --- /dev/null +++ b/rba.tool.core/lib32/z3/vcomp110.dll diff --git a/rba.tool.core/lib32/z3/z3.exe b/rba.tool.core/lib32/z3/z3.exe Binary files differnew file mode 100644 index 0000000..02381cb --- /dev/null +++ b/rba.tool.core/lib32/z3/z3.exe |