n%B0      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ 7(c) Iago Abal, 2012 (c) David Castro, 2012BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com> Safe-Inferred +24An alternative to  to fake type parameters. Example: TY :: TY Integer instead of undefined :: Integer A(c) Iago Abal, 2012-2013 (c) David Castro, 2012-2013BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com>None 24<Z3 error codesZ3 pretty-printing modesZ3 String typeZ3 custom error handler*Boolean type. It is just an alias for int.,Lifted Boolean type: false, undefined, true.A parameter set for Z3.|A solver for Z3, that is, an engine for collecting and solving constraints using a specific algorithm or set of algorithms.&An entry in a function interpretation.9The interpretation of a function returned from the model.>A model for the constraints asserted into the logical context.cA kind of AST used to represent pattern and multi-patterns used to guide quantifier instantiation.CA kind of AST used to represent constant and function declarations.1A kind of AST used to represent function symbols.&A kind of AST used to represent types.jAbstract syntax tree node. That is, the data-structure used in Z3 to represent terms, formulas and types.zA Lisp-link symbol. It is used to name types, constants, and functions. A symbol can be created using string or integers.4Logical context. This is the main Z3 data-structure.;A configuration object used to initialize logical contexts.0Return a string describing the given error code. Reference : nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae0aba52b5738b2ea78e0d6ad67ef1f920Return a string describing the given error code. Reference : nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf06357c49299efb8a0bdaeb3bc96c6d6 Set an error. Reference : nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga41cf70319c4802ab7301dd168d6f5e45Register a Z3 error handler. Reference : nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gadaa12e9990f37b0c1e2bf1dd502dbf39,Return the error code for the last API call. Reference : nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8ac771e68b28d2c86f40aa84889b3807:Convert the given benchmark into SMT-LIB formatted string. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf93844a5964ad8dee609fac3470d86e4?Convert a func_decl into a string using the current print mode. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga15243dcad77f5571e28e8aa1da465675:Convert a sort into a string using the current print mode. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf90c72f63eab298e1dd750f6a26fb945=Convert a pattern into a string using the current print mode. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga51b048ddbbcd88708e7aa4fe1c2462d6:Convert an AST into a string using the current print mode. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab1aa4b78298fe00b3167bf7bfd88aea3dSet the pretty-printing mode for converting ASTs to strings. The mode can be one of the following:?z3_print_smtlib_full: Print AST nodes in SMTLIB verbose format.=z3_print_low_level: Print AST nodes using a low-level format.Kz3_print_smtlib_compliant: Print AST nodes in SMTLIB 1.x compliant format.Lz3_print_smtlib2_compliant: Print AST nodes in SMTLIB 2.x compliant format. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga20d66dac19b6d6a06537843d0e25f761Return a brief justification for an "unknown" result (i.e., Z3_L_UNDEF) for the last call to Z3_solver_check or Z3_solver_check_assumptions on the given solver. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaed5d19000004b43dd75e487682e91b55lRetrieve the model for the last call to Z3_solver_check or Z3_solver_check_assumptions on the given solver. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf14a54d904a7e45eecc00c5fb8a9d5c9>Check whether the assertions in a given solver are consistent. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga000e369de7b71caa4ee701089709c526`Add a constraint to a solver and track it using a Boolean constant, given as the last argument. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf46fb6f3aa3ef451d6be01a737697810Add a constraint to a solver. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga72afadf5e8b216f2c6ae675e872b8be4$Remove all assertions from a solver. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4a4a215b9130d7980e3c393fe857335f4Backtrack to the nth-most recent backtracking point. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga40aa98e15aceffa5be3afad2e065478a(Create a backtracking point in a solver. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae41bebe15b1b1105f9abb8690188d1e24Decrement the reference counter of the given solver. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga2362dcef4e9b8ede41298a50428902ff4Increment the reference counter of the given solver. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga388e25a8b477abbd49f08c6c29dfa12d Set the parameters for a solver. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga887441b3468a1bc605bbf564ddebf2aeNCreate a solver for a particular logic, as given by the SMTLIB standard here: &http://smtlib.cs.uiowa.edu/logics.html Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga54244cfc9d9cd2ca8f08c3909d700628Create a simple solver. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5735499ef0b46846c5d45982eaa0e74c8Create an SMT solver that uses a set of builtin tactics. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5735499ef0b46846c5d45982eaa0e74crConvert a parameter set into a string. This function is mainly used for printing the contents of a parameter set. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga624e692e180a8b2f617156b1e1ae9722=Add a symbol parameter k with value v to the parameter set p. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac2e899a4906b6133a23fdb60ef992ec9=Add a double parameter k with value v to the parameter set p. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga11498ce4b25d294f5f89ab7ac1b74c62@Add an unsigned parameter k with value v to the parameter set p. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4974397cb652c7f7f479012eb465e250>Add a Boolean parameter k with value v to the parameter set p. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga39e3df967eaad45b343256d56c54e91c;Decrement the reference counter of the given parameter set. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae4df28ba713b81ee99abd929e32484ea;Increment the reference counter of the given parameter set. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga3a91c9f749b89e1dcf1493177d395d0cCreate a Z3 (empty) parameter set. Starting at Z3 4.0, parameter sets are used to configure many components such as: simplifiers, tactics, solvers, etc. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac7f883536538ab0ad234fde58988e673Delete a model object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0cc98d3ce68047f873e119bccaabdbee=Check whether the given logical context is consistent or not. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga72055cfbae81bd174abed32a83e50b03=Check whether the given logical context is consistent or not. Reference : nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaff310fef80ac8a82d0a51417e073ec0a-Assert a constraing into the logical context. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1a05ff73a564ae7256a2257048a4680a-Return an argument of a Z3_func_entry object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6fe03fe3c824fceb52766a4d8c2cbeab9Return the number of arguments in a Z3_func_entry object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga51aed8c5bc4b1f53f0c371312de3ce1aReturn the value of this point. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga9fd65e2ab039aa8e40608c2ecf7084daLReturn the arity (number of arguments) of the given function interpretation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaca22cbdb6f7787aaae5d814f2ab383d8 Return the 'else', value of the given function interpretation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga46de7559826ba71b8488d727cba1fb64jReturn a "point" of the given function intepretation. It represents the value of f in a particular point. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf157e1e1cd8c0cfe6a21be6370f659daBReturn the number of entries in the given function interpretation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga2bab9ae1444940e7593729beec279844Return the interpretation of the function f in the model m. Return NULL, if the model does not assign an interpretation for f. That should be interpreted as: the f does not matter. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafb9cc5eca9564d8a849c154c5a4a8633HReturn the function declaration f associated with a (_ as_array f) node. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7d9262dc6e79f2aeb23fd4a383589ddaThe (_ as-array f) AST node is a construct for assigning interpretations for arrays in Z3. It is the array such that forall indices i we have that (select (_ as-array f) i) is equal to (f i). This procedure returns Z3_TRUE if the a is an as-array AST node. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4674da67d226bfb16861829b9f129cfadEvaluate the AST node t in the given model. Return Z3_TRUE if succeeded, and store the result in v. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga47d3655283564918c85bda0b423b7f67=Return numeral value, as a string of a numeric constant term. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga94617ef18fa7157e1a3f85db625d2f4bTReturn Z3_L_TRUE if a is true, Z3_L_FALSE if it is false, and Z3_L_UNDEF otherwise. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga133aaa1ec31af9b570ed7627a3c8c5a4Return the sort of an AST node. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0a4dac7e9397ff067136354cd33cb933-Return the size of the given bit-vector sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8fc3550edace7bc046e16d1f96ddb419Create an exists formula. Referece: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4ffce34ff9117e6243283f11d87c1407Create a forall formula. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7e975b7d7ac96de1db73d8f71166c663Create a bound variable. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1d4da8849fca699b345322f8ee1fa31e.Create a pattern for quantifier instantiation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf15c95b66dc3b0af735774ee401a6f85!Create a numeral of a given sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga88a165138162a8bac401672f0a1b7891!Create a numeral of a given sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga42cc319787d485d9cb665d80e02d206f!Create a numeral of a given sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7201b6231b61421c005457206760a121!Create a numeral of a given sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8779204998136569c3e166c34cfd3e2cCreate a real from a fraction. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gabe0bbc1e01a084a75506a62e5e6900b3!Create a numeral of a given sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac8aca397e32ca33618d8024bff32948cAccess the array default value. Produces the default range value, for arrays that can be represented as finite maps with a default range value. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga78e89cca82f0ab4d5f4e662e5e5fba7d !map f on the the argument arrays. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga9150242d9430a8c3d55d2ca3b9a4362d Create the constant array. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga84ea6f0c32b99c70033feaa8f00e8f2d Array update.  Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae305a4f54b4a64f7e5973ae6ccb13593 XArray read. The argument a is the array and i is the index of the array that gets read. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga38f423f3683379e7f597a7fe59eccb67 KCreate a predicate that checks that the bit-wise signed multiplication of t1 and t2 does not underflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga501ccc01d737aad3ede5699741717fdaCCreate a predicate that checks that the bit-wise multiplication of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga86f4415719d295a2f6845c70b3aaa1df4Check that bit-wise negation does not overflow when t1( is interpreted as a signed bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae9c5d72605ddcd0e76657341eaccb6c7DCreate a predicate that checks that the bit-wise signed division of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaa17e7b2c33dfe2abbd74d390927ae83e@Create a predicate that checks that the bit-wise subtraction of t1 and t2 does not underflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6480850f9fa01e14aea936c88ff184c4GCreate a predicate that checks that the bit-wise signed subtraction of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga785f8127b87e0b42130e6d8f52167d7cDCreate a predicate that checks that the bit-wise signed addition of t1 and t2 does not underflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1e2b1927cf4e50000c1600d47a152947=Create a predicate that checks that the bit-wise addition of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga88f6b5ec876f05e0d7ba51e96c4b077f/Create an integer from the bit-vector argument t1. If  is_signed is false, then the bit-vector t1O is treated as unsigned. So the result is non-negative and in the range [0..2^N -1], where N are the number of bits in t1. If  is_signed is true, t1# is treated as a signed bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac87b227dc3821d57258d7f53a28323d4 Create an n* bit bit-vector from the integer argument t1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga35f89eb05df43fbd9cce7200cc1f30b5Rotate bits of t1 to the right t2 times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gabb227526c592b523879083f12aab281fRotate bits of t1 to the left t2 times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf46f1cb80e5a56044591a76e7c89e5e7Rotate bits of t1 to the right i times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga3b94e1bf87ecd1a1858af8ebc1da4a1cRotate bits of t1 to the left i times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4932b7d08fea079dd903cd857a52dcdaArithmetic shift right. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga674b580ad605ba1c2c9f9d3748be87c4Logical shift right. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac59645a6edadad79a201f417e4e0c512 Shift left. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac8d5e776c786c1172fa0d7dfede454e1&Repeat the given bit-vector up length i. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga03e81721502ea225c264d1f556c9119dWExtend the given bit-vector with zeros to the (unsigned) equivalent bitvector of size m+i, where m% is the size of the given bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac9322fae11365a78640baf9078c428b3 RSign-extend of the given bit-vector to the (signed) equivalent bitvector of size m+i, where m% is the size of the given bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad29099270b36d0680bb54b560353c10e!_Extract the bits high down to low from a bitvector of size m to yield a new bitvector of size n, where n = high - low + 1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga32d2fe7563f3e6b114c1b97b205d4317""Concatenate the given bit-vectors. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae774128fa5e9ff7458a36bd10e6ca0fa#%Two's complement signed greater than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4e93a985aa2a7812c7c11a2c65d7c5f0$Unsigned greater than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga063ab9f16246c99e5c1c893613927ee3%1Two's complement signed greater than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaeec3414c0e8a90a6aa5a23af36bf6dc5&"Unsigned greater than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gade58fbfcf61b67bf8c4a441490d3c4df'.Two's complement signed less than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab7c026feb93e7d2eab180e96f1e6255d(Unsigned less than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab738b89de0410e70c089d3ac9e696e87)"Two's complement signed less than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8ce08af4ed1fbdf08d4d6e63d171663a*Unsigned less than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5774b22e93abcaf9b594672af6c7c3c4+9Two's complement signed remainder (sign follows divisor). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga95dac8e6eecb50f63cb82038560e0879,:Two's complement signed remainder (sign follows dividend). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga46c18a3042fca174fe659d3185693db1-Unsigned remainder. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5df4298ec835e43ddc9e3e0bae690c8d.!Two's complement signed division. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad240fedb2fda1c1005b8e9d3c7f3d5a0/Unsigned division. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga56ce0cd61666c6f8cf5777286f5905440)Standard two's complement multiplication. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6abd3dde2a1ceff1704cf7221a72258c1&Standard two's complement subtraction. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga688c9aa1347888c7a51be4e46c19178e2#Standard two's complement addition. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga819814e33573f3f9948b32fdc53111583&Standard two's complement unary minus. Reference: < nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0c78be00c03eda4ed6a983224ed5c7b74 Bitwise xnor. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga784f5ca36a4b03b93c67242cc94b21d65 Bitwise nor. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gabf15059e9e8a2eafe4929fdfd259aadb6 Bitwise nand. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga96dc37d36efd658fff5b2b4df49b0e617Bitwise exclusive-or. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0a3821ea00b1c762205f73e4bc29e7d88 Bitwise or. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga77a6ae233fb3371d187c6d559b2843f59 Bitwise and. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab96e0ea55334cbcd5a0e79323b57615d:>Take disjunction of bits in vector, return vector of length 1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafd18e127c0586abf47ad9cd96895f7d2;>Take conjunction of bits in vector, return vector of length 1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaccc04f2b58903279b1b3be589b00a7d8<Bitwise negation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga36cf75c92c54c1ca633a230344f23080=%Check if a real number is an integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaac2ad0fb04e4900fdb4add438d137ad3>Coerce a real to an integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga759b6563ba1204aae55289009a3fdc6d?Coerce an integer to a real. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7130641e614c7ebafd28ae16a7681a21@ Create greater than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad9245cbadb80b192323d01a8360fb942ACreate greater than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga46167b86067586bb742c0557d7babfd3BCreate less than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaa9a33d11096841f4e8c407f1578bc0bfCCreate less than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga58a3dc67c5de52cf599c346803ba1534D.Create an AST node representing arg1 rem arg2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga2fcdb17f9039bbdaddf8a30d037bd9ffE.Create an AST node representing arg1 mod arg2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8e350ac77e6b8fe805f57efe196e7713F.Create an AST node representing arg1 div arg2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1ac60ee8307af8d0b900375914194ff3G%Create an AST node representing -arg. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gadcd2929ad732937e25f34277ce4988eaHCCreate an AST node representing args[0] - ... - args[num_args - 1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4f5fea9b683f9e674fd8f14d676cc9a9IACreate an AST node representing args[0] * ... * args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab9affbf8401a18eea474b59ad4adc890JACreate an AST node representing args[0] + ... + args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4e4ac0a4e53eee0b4b0ef159ed7d0cd5KCCreate an AST node representing args[0] or ... or args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga00866d16331d505620a6c515302021f9LECreate an AST node representing args[0] and ... and args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gacde98ce4a8ed1dde50b9669db4838c61M*Create an AST node representing t1 xor t2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gacc6d1b848032dec0c4617b594d4229ecN.Create an AST node representing t1 implies t2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac829c0e25bbbd30343bf073f7b524517O*Create an AST node representing t1 iff t2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga930a8e844d345fbebc498ac43a696042PACreate an AST node representing an if-then-else: ite(t1, t2, t3). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga94417eed5c36e1ad48bcfc8ad6e83547Q'Create an AST node representing not(a). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga3329538091996eb7b3dc677760a61072R&Create an AST node representing l = r. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga95a19ce675b70e22bb0401f7137af37cS Create an AST node representing false. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5952ac17671117a02001fed6575c778dT Create an AST node representing true. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae898e7380409bbc57b56cc5205ef1db7UDeclare and create a constant. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga093c9703393f33ae282ec5e8729354efV*Create a constant or function application. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga33a202d86bf628bfab9b6f437536cebeWDeclare a constant or function. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaa5c5e2602a44d5f1373f077434859ca2XCreate a tuple type Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7156b9c0a76a28fae46c81f8e3cdf0f1YCreate an array type Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafe617994cce1b516f46128e448c84445Z+Create a bit-vector type of the given size.0This type can also be seen as a machine integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaeed000a1bbb84b6ca6fdaac6cf0c1688[Create a real type. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga40ef93b9738485caed6dc84631c3c1a0\Create an integer type. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6cd426ab5748653b77d389fd3eac1015]Create the Boolean type. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gacdc73510b69a010b71793d429015f342^ACreate a free (uninterpreted) type using the given name (symbol). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga736e88741af1c178cbebf94c49aa42de_$Create a Z3 symbol using a C string. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafebb0d3c212927cf7834c3a20a84ecae`$Create a Z3 symbol using an integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga3df806baf6124df3e63a58cf23e12411a!Delete the given logical context. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga556eae80ed43ab13e1e7dc3b38c35200b/Create a context using the given configuration. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0bd93cfab4d749dd3e2f2a4416820a46cSet a configuration parameter. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga001ade87a1671fe77d7e53ed0f4f1ec3d&Delete the given configuration object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5e620acf5d55d0271097c9bb97219774eValues of lifted boolean typefValues of lifted boolean typegValues of lifted boolean typehZ3_bool valuesiZ3_bool valuesjCreate a configuration. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7d6c40d9b79fe8a8851cc8540970787fnamelogicstatus attributes assumptions# assumptionsformulaklmn      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQoRSTUVWXYZ[\]^_`abcdpefghiqrstuvwxyz{|}~jklmn      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQoRSTUVWXYZ[\]^_`abcdpefghiqrstuvwxyz{|}~jklmn      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQoRSTUVWXYZ[\]^_`abcdpefghiqrstuvwxyz{|}~jA(c) Iago Abal, 2012-2013 (c) David Castro, 2012-2013BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com>None +24BEF\Pretty-printing mode for converting ASTs to strings. The mode can be one of the following:?Z3_PRINT_SMTLIB_FULL: Print AST nodes in SMTLIB verbose format.=Z3_PRINT_LOW_LEVEL: Print AST nodes using a low-level format.KZ3_PRINT_SMTLIB_COMPLIANT: Print AST nodes in SMTLIB 1.x compliant format.LZ3_PRINT_SMTLIB2_COMPLIANT: Print AST nodes in SMTLIB 2.x compliant format.Solvers available in Z3.These are described at &http://smtlib.cs.uiowa.edu/logics.htmlWARNINGJ: Support for solvers is fragile, you may experience segmentation faults!LNon-linear integer arithmetic with uninterpreted sort and function symbols.ELinear real arithmetic with uninterpreted sort and function symbols. VUnquantified non-linear real arithmetic with uninterpreted sort and function symbols. RUnquantified linear real arithmetic with uninterpreted sort and function symbols. UUnquantified linear integer arithmetic with uninterpreted sort and function symbols. bDifference Logic over the integers (in essence) but with uninterpreted sort and function symbols. TUnquantified formulas over bitvectors with uninterpreted sort function and symbols.fUnquantified formulas built over a signature of uninterpreted (i.e., free) sort and function symbols.Difference Logic over the reals. In essence, Boolean combinations of inequations of the form x - y < b where x and y are real variables and b is a rational constant. Quantifier-free real arithmetic.#Quantifier-free integer arithmetic.Unquantified linear real arithmetic. In essence, Boolean combinations of inequations between linear polynomials over real variables.Unquantified linear integer arithmetic. In essence, Boolean combinations of inequations between linear polynomials over integer variables.Difference Logic over the integers. In essence, Boolean combinations of inequations of the form x - y < b where x and y are integer variables and b is an integer constant.JClosed quantifier-free formulas over the theory of fixed-size bitvectors.OClosed quantifier-free formulas over the theory of arrays with extensionality.wClosed quantifier-free linear formulas over the theory of integer arrays extended with free sort and function symbols.Closed quantifier-free formulas over the theory of bitvectors and bitvector arrays extended with free sort and function symbols.TClosed quantifier-free formulas over the theory of bitvectors and bitvector arrays.1Closed linear formulas in linear real arithmetic.|Closed formulas with free function and predicate symbols over a theory of arrays of arrays of integer index and real value.Closed linear formulas with free sort and function symbols over one- and two-dimentional arrays of integer index and real value.Closed formulas over the theory of linear integer arithmetic and arrays extended with free sort and function symbols but restricted to arrays with integer indices and values.QThe interpretation of a function is a mapping part (arguments to values) and an 'else' part./Z3 exceptions.3!Result of a satisfiability check.7A Z3 solver engine8A Z3 parameter set. Starting at Z3 4.0, parameter sets are used to configure many components such as: simplifiers, tactics, solvers, etc.:A interpretation of a function.;>A model for the constraints asserted into the logical context.<eA kind of AST used to represent pattern and multi-patterns used to guide quantifier instantiation.=FA kind of Z3 AST used to represent constant and function declarations.>/Kind of AST used to represent function symbols.?Kind of Z3 AST representing types.@A Z3 AST node.AA Z3 Lisp-link symbol.BA Z3 logical context.CA Z3 configuration object.Convert  from Z3.Base.C to 3Convert  to . * should be OK but this is more convenient.Convert  to .Throws a z3 error)Throw an exception if a Z3 error happenedDCreate a configuration. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7d6c40d9b79fe8a8851cc8540970787fEDelete a configuration. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5e620acf5d55d0271097c9bb97219774F;Run a computation using a temporally created configuration.GSet a configuration parameter. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga001ade87a1671fe77d7e53ed0f4f1ec3See: Fhttp://research.microsoft.com/en-us/um/redmond/projects/z3/config.htmlH/Create a context using the given configuration. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0bd93cfab4d749dd3e2f2a4416820a46I!Delete the given logical context. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga556eae80ed43ab13e1e7dc3b38c35200J5Run a computation using a temporally created context.K0Convert the given logical context into a string. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga165e38ddfc928f586cb738cdf6c5f216L Alias for K.M$Create a Z3 symbol using an integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga3df806baf6124df3e63a58cf23e12411N"Create a Z3 symbol using a string. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafebb0d3c212927cf7834c3a20a84ecaeOACreate a free (uninterpreted) type using the given name (symbol). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga736e88741af1c178cbebf94c49aa42deP Create the Boolean type. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gacdc73510b69a010b71793d429015f342Q Create an integer type. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6cd426ab5748653b77d389fd3eac1015R Create a real type. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga40ef93b9738485caed6dc84631c3c1a0S+Create a bit-vector type of the given size.0This type can also be seen as a machine integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaeed000a1bbb84b6ca6fdaac6cf0c1688TCreate an array type Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafe617994cce1b516f46128e448c84445UCreate a tuple type Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7156b9c0a76a28fae46c81f8e3cdf0f1V A Z3 functionW*Create a constant or function application. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga33a202d86bf628bfab9b6f437536cebeXDeclare and create a constant. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga093c9703393f33ae282ec5e8729354efY Create an AST node representing true. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae898e7380409bbc57b56cc5205ef1db7Z Create an AST node representing false. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5952ac17671117a02001fed6575c778d[ Create an AST node representing l = r. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga95a19ce675b70e22bb0401f7137af37c\NThe distinct construct is used for declaring the arguments pairwise distinct. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaa076d3a668e0ec97d61744403153ecf7] Create an AST node representing not(a). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga3329538091996eb7b3dc677760a61072^1Create an AST node representing an if-then-else: ite(t1, t2, t3). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga94417eed5c36e1ad48bcfc8ad6e83547_ Create an AST node representing  t1 iff t2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga930a8e844d345fbebc498ac43a696042` Create an AST node representing  t1 implies t2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac829c0e25bbbd30343bf073f7b524517a Create an AST node representing  t1 xor t2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gacc6d1b848032dec0c4617b594d4229ecbECreate an AST node representing args[0] and ... and args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gacde98ce4a8ed1dde50b9669db4838c61cCCreate an AST node representing args[0] or ... or args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga00866d16331d505620a6c515302021f9dACreate an AST node representing args[0] + ... + args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4e4ac0a4e53eee0b4b0ef159ed7d0cd5eACreate an AST node representing args[0] * ... * args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab9affbf8401a18eea474b59ad4adc890fCCreate an AST node representing args[0] - ... - args[num_args - 1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4f5fea9b683f9e674fd8f14d676cc9a9g%Create an AST node representing -arg. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gadcd2929ad732937e25f34277ce4988eah.Create an AST node representing arg1 div arg2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1ac60ee8307af8d0b900375914194ff3i.Create an AST node representing arg1 mod arg2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8e350ac77e6b8fe805f57efe196e7713j.Create an AST node representing arg1 rem arg2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga2fcdb17f9039bbdaddf8a30d037bd9ffkCreate less than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga58a3dc67c5de52cf599c346803ba1534lCreate less than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaa9a33d11096841f4e8c407f1578bc0bfmCreate greater than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga46167b86067586bb742c0557d7babfd3n Create greater than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad9245cbadb80b192323d01a8360fb942oCoerce an integer to a real. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7130641e614c7ebafd28ae16a7681a21pCoerce a real to an integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga759b6563ba1204aae55289009a3fdc6dq%Check if a real number is an integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaac2ad0fb04e4900fdb4add438d137ad3rBitwise negation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga36cf75c92c54c1ca633a230344f23080s>Take conjunction of bits in vector, return vector of length 1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaccc04f2b58903279b1b3be589b00a7d8t>Take disjunction of bits in vector, return vector of length 1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafd18e127c0586abf47ad9cd96895f7d2u Bitwise and. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab96e0ea55334cbcd5a0e79323b57615dv Bitwise or. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga77a6ae233fb3371d187c6d559b2843f5wBitwise exclusive-or. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0a3821ea00b1c762205f73e4bc29e7d8x Bitwise nand. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga96dc37d36efd658fff5b2b4df49b0e61y Bitwise nor. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gabf15059e9e8a2eafe4929fdfd259aadbz Bitwise xnor. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga784f5ca36a4b03b93c67242cc94b21d6{&Standard two's complement unary minus. Reference: < nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0c78be00c03eda4ed6a983224ed5c7b7|#Standard two's complement addition. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga819814e33573f3f9948b32fdc5311158}&Standard two's complement subtraction. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga688c9aa1347888c7a51be4e46c19178e~)Standard two's complement multiplication. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6abd3dde2a1ceff1704cf7221a72258cUnsigned division. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga56ce0cd61666c6f8cf5777286f590544!Two's complement signed division. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad240fedb2fda1c1005b8e9d3c7f3d5a0Unsigned remainder. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5df4298ec835e43ddc9e3e0bae690c8d:Two's complement signed remainder (sign follows dividend). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga46c18a3042fca174fe659d3185693db19Two's complement signed remainder (sign follows divisor). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga95dac8e6eecb50f63cb82038560e0879Unsigned less than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5774b22e93abcaf9b594672af6c7c3c4"Two's complement signed less than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8ce08af4ed1fbdf08d4d6e63d171663aUnsigned less than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab738b89de0410e70c089d3ac9e696e87.Two's complement signed less than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab7c026feb93e7d2eab180e96f1e6255d"Unsigned greater than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gade58fbfcf61b67bf8c4a441490d3c4df1Two's complement signed greater than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaeec3414c0e8a90a6aa5a23af36bf6dc5Unsigned greater than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga063ab9f16246c99e5c1c893613927ee3%Two's complement signed greater than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4e93a985aa2a7812c7c11a2c65d7c5f0"Concatenate the given bit-vectors. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae774128fa5e9ff7458a36bd10e6ca0fa_Extract the bits high down to low from a bitvector of size m to yield a new bitvector of size n, where n = high - low + 1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga32d2fe7563f3e6b114c1b97b205d4317RSign-extend of the given bit-vector to the (signed) equivalent bitvector of size m+i, where m% is the size of the given bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad29099270b36d0680bb54b560353c10eWExtend the given bit-vector with zeros to the (unsigned) equivalent bitvector of size m+i, where m% is the size of the given bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac9322fae11365a78640baf9078c428b3&Repeat the given bit-vector up length i. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga03e81721502ea225c264d1f556c9119d Shift left. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac8d5e776c786c1172fa0d7dfede454e1Logical shift right. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac59645a6edadad79a201f417e4e0c512Arithmetic shift right. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga674b580ad605ba1c2c9f9d3748be87c4Rotate bits of t1 to the left i times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4932b7d08fea079dd903cd857a52dcdaRotate bits of t1 to the right i times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga3b94e1bf87ecd1a1858af8ebc1da4a1cRotate bits of t1 to the left t2 times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf46f1cb80e5a56044591a76e7c89e5e7Rotate bits of t1 to the right t2 times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gabb227526c592b523879083f12aab281f Create an n* bit bit-vector from the integer argument t1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga35f89eb05df43fbd9cce7200cc1f30b5/Create an integer from the bit-vector argument t1. If  is_signed is false, then the bit-vector t1O is treated as unsigned. So the result is non-negative and in the range [0..2^N -1], where N are the number of bits in t1. If  is_signed is true, t1# is treated as a signed bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac87b227dc3821d57258d7f53a28323d4=Create a predicate that checks that the bit-wise addition of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga88f6b5ec876f05e0d7ba51e96c4b077fDCreate a predicate that checks that the bit-wise signed addition of t1 and t2 does not underflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1e2b1927cf4e50000c1600d47a152947GCreate a predicate that checks that the bit-wise signed subtraction of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga785f8127b87e0b42130e6d8f52167d7c@Create a predicate that checks that the bit-wise subtraction of t1 and t2 does not underflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6480850f9fa01e14aea936c88ff184c4DCreate a predicate that checks that the bit-wise signed division of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaa17e7b2c33dfe2abbd74d390927ae83e4Check that bit-wise negation does not overflow when t1( is interpreted as a signed bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae9c5d72605ddcd0e76657341eaccb6c7CCreate a predicate that checks that the bit-wise multiplication of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga86f4415719d295a2f6845c70b3aaa1dfKCreate a predicate that checks that the bit-wise signed multiplication of t1 and t2 does not underflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga501ccc01d737aad3ede5699741717fdaXArray read. The argument a is the array and i is the index of the array that gets read. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga38f423f3683379e7f597a7fe59eccb67Array update.  Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae305a4f54b4a64f7e5973ae6ccb13593Create the constant array. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga84ea6f0c32b99c70033feaa8f00e8f2d!map f on the the argument arrays. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga9150242d9430a8c3d55d2ca3b9a4362dAccess the array default value. Produces the default range value, for arrays that can be represented as finite maps with a default range value. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga78e89cca82f0ab4d5f4e662e5e5fba7d!Create a numeral of a given sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac8aca397e32ca33618d8024bff32948cCreate a numeral of sort int.Create a numeral of sort real.-Return the size of the given bit-vector sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8fc3550edace7bc046e16d1f96ddb419Return the sort of an AST node. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0a4dac7e9397ff067136354cd33cb933Cast a  from Z3.Base.C to Bool.TReturn Z3_L_TRUE if a is true, Z3_L_FALSE if it is false, and Z3_L_UNDEF otherwise. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga133aaa1ec31af9b570ed7627a3c8c5a4=Return numeral value, as a string of a numeric constant term. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga94617ef18fa7157e1a3f85db625d2f4bReturn Z3Int valueReturn Z3Real value(Evaluate an AST node in the given model.6Evaluate a collection of AST nodes in the given model.BEvaluate a function declaration to a list of argument/value pairs.-Evaluate an array as a function, if possible.HReturn the function declaration f associated with a (_ as_array f) node. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7d9262dc6e79f2aeb23fd4a383589ddaThe (_ as-array f) AST node is a construct for assigning interpretations for arrays in Z3. It is the array such that forall indices i we have that (select (_ as-array f) i) is equal to (f i). This procedure returns Z3_TRUE if the a is an as-array AST node. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4674da67d226bfb16861829b9f129cfaReturn the interpretation of the function f in the model m. Return NULL, if the model does not assign an interpretation for f. That should be interpreted as: the f does not matter. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafb9cc5eca9564d8a849c154c5a4a8633BReturn the number of entries in the given function interpretation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga2bab9ae1444940e7593729beec279844jReturn a _point_ of the given function intepretation. It represents the value of f in a particular point. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf157e1e1cd8c0cfe6a21be6370f659da Return the 'else', value of the given function interpretation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga46de7559826ba71b8488d727cba1fb64MReturn the arity (number of arguments) of the given function interpretation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaca22cbdb6f7787aaae5d814f2ab383d8Return the value of this point. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga9fd65e2ab039aa8e40608c2ecf7084da9Return the number of arguments in a Z3_func_entry object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga51aed8c5bc4b1f53f0c371312de3ce1a-Return an argument of a Z3_func_entry object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6fe03fe3c824fceb52766a4d8c2cbeab&Convert the given model into a string. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf36d49862a8c0d20dd5e6508eef5f8af Alias for .Create a backtracking point. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad651ad68c7a060cbb5616349233cb10f Backtrack n backtracking points. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab2b3a542006c86c8d86dc37872f88b61-Assert a constraing into the logical context. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1a05ff73a564ae7256a2257048a4680a)Get model (logical context is consistent) Reference : nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaff310fef80ac8a82d0a51417e073ec0aDelete a model object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0cc98d3ce68047f873e119bccaabdbee=Check whether the given logical context is consistent or not. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga72055cfbae81bd174abed32a83e50b03<Set the pretty-printing mode for converting ASTs to strings.Convert an AST to a string.Convert a pattern to a string.Convert a sort to a string.Convert a FuncDecl to a string.:Convert the given benchmark into SMT-LIB formatted string.(The output format can be configured via . Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf93844a5964ad8dee609fac3470d86e4Wraps a non-null pointer with , or else returns .  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUContextName of the sortName and sort of each fieldPResulting sort, and function declarations for the constructor and projections.VWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~namelogicstatus attributes assumptionsformula  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~CBA@?>=<;:9873654DEFGHIJKLMNOPQRSTUVWXYZ[]^_`abc\defghijklmnopqrstuvwxyz{|}~ ! /012".-,+*)('&%$#  !" .-,+*)('&%$#/0123654789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~7(c) Iago Abal, 2013 (c) David Castro, 2013BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com>None 24Values for Z3 options.Configuration option.Z3 configuration.Default configuration.Append configurations.Set a configuration option.Set configuration.Set an option.7(c) Iago Abal, 2013 (c) David Castro, 2013BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com>None 24BEval a Z3 script.4Eval a Z3 script with default configuration options.+Convert Z3's logical context into a string. Alias for .$Create a Z3 symbol using an integer."Create a Z3 symbol using a string. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafebb0d3c212927cf7834c3a20a84ecaeACreate a free (uninterpreted) type using the given name (symbol). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga736e88741af1c178cbebf94c49aa42de Create the boolean type. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gacdc73510b69a010b71793d429015f342 Create the integer type. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6cd426ab5748653b77d389fd3eac1015 Create the real type. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga40ef93b9738485caed6dc84631c3c1a0+Create a bit-vector type of the given size.0This type can also be seen as a machine integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaeed000a1bbb84b6ca6fdaac6cf0c1688Create an array type Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafe617994cce1b516f46128e448c84445Create a tuple type Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7156b9c0a76a28fae46c81f8e3cdf0f1 A Z3 function*Create a constant or function application. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga33a202d86bf628bfab9b6f437536cebeDeclare and create a constant. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga093c9703393f33ae282ec5e8729354ef Create an AST node representing true. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae898e7380409bbc57b56cc5205ef1db7 Create an AST node representing false. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5952ac17671117a02001fed6575c778d Create an AST node representing l = r. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga95a19ce675b70e22bb0401f7137af37cNThe distinct construct is used for declaring the arguments pairwise distinct. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaa076d3a668e0ec97d61744403153ecf7 Create an AST node representing not(a). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga3329538091996eb7b3dc677760a610721Create an AST node representing an if-then-else: ite(t1, t2, t3). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga94417eed5c36e1ad48bcfc8ad6e83547 Create an AST node representing  t1 iff t2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga930a8e844d345fbebc498ac43a696042 Create an AST node representing  t1 implies t2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac829c0e25bbbd30343bf073f7b524517 Create an AST node representing  t1 xor t2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gacc6d1b848032dec0c4617b594d4229ecECreate an AST node representing args[0] and ... and args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gacde98ce4a8ed1dde50b9669db4838c61CCreate an AST node representing args[0] or ... or args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga00866d16331d505620a6c515302021f9ACreate an AST node representing args[0] + ... + args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4e4ac0a4e53eee0b4b0ef159ed7d0cd5ACreate an AST node representing args[0] * ... * args[num_args-1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab9affbf8401a18eea474b59ad4adc890CCreate an AST node representing args[0] - ... - args[num_args - 1]. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4f5fea9b683f9e674fd8f14d676cc9a9 %Create an AST node representing -arg. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gadcd2929ad732937e25f34277ce4988ea .Create an AST node representing arg1 div arg2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1ac60ee8307af8d0b900375914194ff3 .Create an AST node representing arg1 mod arg2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8e350ac77e6b8fe805f57efe196e7713 .Create an AST node representing arg1 rem arg2. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga2fcdb17f9039bbdaddf8a30d037bd9ff Create less than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga58a3dc67c5de52cf599c346803ba1534Create less than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaa9a33d11096841f4e8c407f1578bc0bfCreate greater than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga46167b86067586bb742c0557d7babfd3 Create greater than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad9245cbadb80b192323d01a8360fb942Coerce an integer to a real. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7130641e614c7ebafd28ae16a7681a21Coerce a real to an integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga759b6563ba1204aae55289009a3fdc6d%Check if a real number is an integer. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaac2ad0fb04e4900fdb4add438d137ad3Bitwise negation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga36cf75c92c54c1ca633a230344f23080>Take conjunction of bits in vector, return vector of length 1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaccc04f2b58903279b1b3be589b00a7d8>Take disjunction of bits in vector, return vector of length 1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafd18e127c0586abf47ad9cd96895f7d2 Bitwise and. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab96e0ea55334cbcd5a0e79323b57615d Bitwise or. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga77a6ae233fb3371d187c6d559b2843f5Bitwise exclusive-or. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0a3821ea00b1c762205f73e4bc29e7d8 Bitwise nand. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga96dc37d36efd658fff5b2b4df49b0e61 Bitwise nor. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gabf15059e9e8a2eafe4929fdfd259aadb Bitwise xnor. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga784f5ca36a4b03b93c67242cc94b21d6&Standard two's complement unary minus. Reference: < nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0c78be00c03eda4ed6a983224ed5c7b7#Standard two's complement addition. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga819814e33573f3f9948b32fdc5311158&Standard two's complement subtraction. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga688c9aa1347888c7a51be4e46c19178e )Standard two's complement multiplication. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6abd3dde2a1ceff1704cf7221a72258c!Unsigned division. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga56ce0cd61666c6f8cf5777286f590544"!Two's complement signed division. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad240fedb2fda1c1005b8e9d3c7f3d5a0#Unsigned remainder. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5df4298ec835e43ddc9e3e0bae690c8d$:Two's complement signed remainder (sign follows dividend). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga46c18a3042fca174fe659d3185693db1%9Two's complement signed remainder (sign follows divisor). Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga95dac8e6eecb50f63cb82038560e0879&Unsigned less than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga5774b22e93abcaf9b594672af6c7c3c4'"Two's complement signed less than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8ce08af4ed1fbdf08d4d6e63d171663a(Unsigned less than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab738b89de0410e70c089d3ac9e696e87).Two's complement signed less than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gab7c026feb93e7d2eab180e96f1e6255d*"Unsigned greater than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gade58fbfcf61b67bf8c4a441490d3c4df+1Two's complement signed greater than or equal to. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaeec3414c0e8a90a6aa5a23af36bf6dc5,Unsigned greater than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga063ab9f16246c99e5c1c893613927ee3-%Two's complement signed greater than. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4e93a985aa2a7812c7c11a2c65d7c5f0."Concatenate the given bit-vectors. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae774128fa5e9ff7458a36bd10e6ca0fa/_Extract the bits high down to low from a bitvector of size m to yield a new bitvector of size n, where n = high - low + 1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga32d2fe7563f3e6b114c1b97b205d43170RSign-extend of the given bit-vector to the (signed) equivalent bitvector of size m+i, where m% is the size of the given bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gad29099270b36d0680bb54b560353c10e1WExtend the given bit-vector with zeros to the (unsigned) equivalent bitvector of size m+i, where m% is the size of the given bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac9322fae11365a78640baf9078c428b32&Repeat the given bit-vector up length i. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga03e81721502ea225c264d1f556c9119d3 Shift left. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac8d5e776c786c1172fa0d7dfede454e14Logical shift right. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac59645a6edadad79a201f417e4e0c5125Arithmetic shift right. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga674b580ad605ba1c2c9f9d3748be87c46Rotate bits of t1 to the left i times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4932b7d08fea079dd903cd857a52dcda7Rotate bits of t1 to the right i times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga3b94e1bf87ecd1a1858af8ebc1da4a1c8Rotate bits of t1 to the left t2 times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf46f1cb80e5a56044591a76e7c89e5e79Rotate bits of t1 to the right t2 times. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gabb227526c592b523879083f12aab281f: Create an n* bit bit-vector from the integer argument t1. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga35f89eb05df43fbd9cce7200cc1f30b5;/Create an integer from the bit-vector argument t1. If  is_signed is false, then the bit-vector t1O is treated as unsigned. So the result is non-negative and in the range [0..2^N -1], where N are the number of bits in t1. If  is_signed is true, t1# is treated as a signed bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac87b227dc3821d57258d7f53a28323d4<=Create a predicate that checks that the bit-wise addition of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga88f6b5ec876f05e0d7ba51e96c4b077f=DCreate a predicate that checks that the bit-wise signed addition of t1 and t2 does not underflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1e2b1927cf4e50000c1600d47a152947>GCreate a predicate that checks that the bit-wise signed subtraction of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga785f8127b87e0b42130e6d8f52167d7c?@Create a predicate that checks that the bit-wise subtraction of t1 and t2 does not underflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6480850f9fa01e14aea936c88ff184c4@DCreate a predicate that checks that the bit-wise signed division of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaa17e7b2c33dfe2abbd74d390927ae83eA4Check that bit-wise negation does not overflow when t1( is interpreted as a signed bit-vector. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae9c5d72605ddcd0e76657341eaccb6c7BCCreate a predicate that checks that the bit-wise multiplication of t1 and t2 does not overflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga86f4415719d295a2f6845c70b3aaa1dfCKCreate a predicate that checks that the bit-wise signed multiplication of t1 and t2 does not underflow. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga501ccc01d737aad3ede5699741717fdaDXArray read. The argument a is the array and i is the index of the array that gets read. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga38f423f3683379e7f597a7fe59eccb67EArray update.  Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gae305a4f54b4a64f7e5973ae6ccb13593FCreate the constant array. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga84ea6f0c32b99c70033feaa8f00e8f2dG!map f on the the argument arrays. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga9150242d9430a8c3d55d2ca3b9a4362dHAccess the array default value. Produces the default range value, for arrays that can be represented as finite maps with a default range value. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga78e89cca82f0ab4d5f4e662e5e5fba7dI!Create a numeral of a given sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gac8aca397e32ca33618d8024bff32948cJCreate a numeral of sort int.KCreate a numeral of sort real.P-Return the size of the given bit-vector sort. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga8fc3550edace7bc046e16d1f96ddb419QReturns  Just True,  Just False, or Nothing for  undefined. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga133aaa1ec31af9b570ed7627a3c8c5a4RReturn the integer valueSReturn rational valueT(Evaluate an AST node in the given model.U6Evaluate a collection of AST nodes in the given model.V/Get function as a list of argument/value pairs.WfGet array as a list of argument/value pairs, if it is represented as a function (ie, using as-array).XReturn the interpretation of the function f in the model m. Return NULL, if the model does not assign an interpretation for f. That should be interpreted as: the f does not matter. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gafb9cc5eca9564d8a849c154c5a4a8633YThe (_ as-array f) AST node is a construct for assigning interpretations for arrays in Z3. It is the array such that forall indices i we have that (select (_ as-array f) i) is equal to (f i). This procedure returns Z3_TRUE if the a is an as-array AST node. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga4674da67d226bfb16861829b9f129cfaZHReturn the function declaration f associated with a (_ as_array f) node. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga7d9262dc6e79f2aeb23fd4a383589dda[BReturn the number of entries in the given function interpretation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga2bab9ae1444940e7593729beec279844\jReturn a "point" of the given function intepretation. It represents the value of f in a particular point. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaf157e1e1cd8c0cfe6a21be6370f659da] Return the 'else', value of the given function interpretation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga46de7559826ba71b8488d727cba1fb64^MReturn the arity (number of arguments) of the given function interpretation. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaca22cbdb6f7787aaae5d814f2ab383d8_Return the value of this point. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga9fd65e2ab039aa8e40608c2ecf7084da`9Return the number of arguments in a Z3_func_entry object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga51aed8c5bc4b1f53f0c371312de3ce1aa-Return an argument of a Z3_func_entry object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga6fe03fe3c824fceb52766a4d8c2cbeabb&Convert the given model into a string.c Alias for b.dCreate a backtracking point.e Backtrack n backtracking points.f-Assert a constraing into the logical context. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga1a05ff73a564ae7256a2257048a4680ag Get model. Reference : nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#gaff310fef80ac8a82d0a51417e073ec0ahDelete a model object. Reference: nhttp://research.microsoft.com/en-us/um/redmond/projects/z3/group__capi.html#ga0cc98d3ce68047f873e119bccaabdbeej=Check whether the given logical context is consistent or not.k3Set the mode for converting expressions to strings.lConvert an AST to a string.mConvert a pattern to a string.nConvert a sort to a string.oConvert a FuncDecl to a string.p:Convert the given benchmark into SMT-LIB formatted string.(The output format can be configured via k.Name of the sortName and sort of each fieldPResulting sort, and function declarations for the constructor and projections.      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopnamelogicstatus attributes assumptions1formula  !34569:;<=>?@A      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnop A@?>=<;:9 !3654      !"#$%&'()*+,-./0123456789:;A<=>?BC@DEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcfjghideklmnop      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnop 7(c) Iago Abal, 2012 (c) David Castro, 2012BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com> experimentalNone  !"+2346=BKOrdering comparisons.Equality testing.Operations for sort real.Operations for sort int.Commutative ring operations.Boolean variadic operations.Boolean binary operations. Z3 function QuantifiersqQuantifier pattern.sConvertible types.Quantifiable expressions.t Expressions.Quantifier layout level.Unique identifiers.u$Typeclass for Haskell Z3 numbers of real sort in Z3.v$Typeclass for Haskell Z3 numbers of int sort in Z3.wNumeric types.Function types.xTypes for expressions.5Type invariant. Introduced when creating a variable.Typecheck an expression.(Create a sort of the underlying Z3 type.Create a value of the .Value extractor Compilable things.Pqrst     uvwxMqrst     uvwxqrst     uvwx 7(c) Iago Abal, 2012 (c) David Castro, 2012BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com> experimentalNone 246:BM Z3 monad.Internal state of Z3 monad.{the logic to use; see &http://smtlib.cs.uiowa.edu/logics.html|soft timeout (in milliseconds)} Z3 options~Eval a Z3 script.Eval a Z3 script.Fresh symbol name.yz{|} !"#~$%&'()*+,-./0< 3yz{|} !"#~&'()*+,-./ !"#yz{|}~$%&'()*+,-./0A(c) Iago Abal, 2012-2013 (c) David Castro, 2012-2013BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com> experimentalNone !"*+2346=BKM2#A computation derived from a model.1/Compile while introducing TCCs into the script.Declare skolem variables.4Declare skolem variables with a user specified name.*Declare uninterpreted function of arity 1.*Declare uninterpreted function of arity 2.*Declare uninterpreted function of arity 3.*Declare uninterpreted function of arity 4.*Declare uninterpreted function of arity 5.2Declare uninterpreted function"Make assertion in current context.>Introduce an auxiliary declaration to name a given expression.9If you really want sharing use this instead of Haskell's let.Convert an Expr to a string.9Check satisfiability and evaluate a model if some exists.9Check satisfiability and evaluate a model if some exists.LCheck satisfiability and evaluate a model if some exists, also returning a 3 to the reason for any failure.Show Z3's internal model.&Evaluate an expression within a model.4Evaluate a collection of expressions within a model.literal constructor.Boolean literals.Boolean literals.Boolean negationBoolean binary xor.Boolean implication An alias for .Boolean if and only if. An alias for .Boolean variadic and.Boolean variadic or.Boolean variadic distinct.Boolean binary and.Boolean binary or.Universally quantified formula.!Existentially quantified formula.Pattern-based instantiation. Casting between compatible typesInteger division.Integer modulo.Integer remainder. k  n == n %* k ==* 0Equals. Not equals.Less or equals than. Less than.Greater or equals than. Greater than.Minimum.Maximum. if-then-else.T345617289:;<=>?@ABCDEFGHIJKLMNOPQRST^ 3dejqrstuvwxyz{|}~^3~yz{|} jdetqrxwvusQ345617289:;<=>?@ABCDEFGHIJKLMNOPQRST7(c) Iago Abal, 2012 (c) David Castro, 2012BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com>None 24M3Ceiling logarithm base two. Axiomatization of the lg2: function. Most likely Z3 is going to diverge if you use lg2X to specify a satisfiable problem since it cannot construct a recursive definition for lg27, but it should work fine for unsatisfiable instances.7(c) Iago Abal, 2012 (c) David Castro, 2012BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com>None 24M0Raise to the power of 2. Axiomatization of the 2^n: function. Most likely Z3 is going to diverge if you use 2^nY to specify a satisfiable problem, since it cannot construct a recursive definition for 2^n7, but it should work fine for unsatisfiable instances.7(c) Iago Abal, 2012 (c) David Castro, 2012BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com>None  +246=BKM1This type allows to reason about natural numbers."Naturals are just integers plus a (>= 0)z invariant, and we ensure that this invariant is always preserved by transparently adding new assertions to the context.`Note that arithmetic on naturals must result in natural numbers, otherwise the problem becomes  unsatisfiable. UVWXYZ[\]^_` UVWXYZ[\]^_`7(c) Iago Abal, 2012 (c) David Castro, 2012BSD3WIago Abal <iago.abal@gmail.com>, David Castro <david.castro.dcp@gmail.com> experimentalNone 24_ 3dejqrstuvwxyz{|}~a  !"#$%&'()*+,--./0123456789:;<==>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~XYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ I             H      !"#$%&'()*+,-./0123456785 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                                                                                                                         6 6 DEFGHIJKLMNOP !"#$%&'()*+,-./01231456789::;<=>?@ABCDEF G H I J K L M N O P Q R S T U V W X Y O Z [ [ \ ] ^ _ ` a b c d e f g h i j k l m n o K p q r s t J u v w x y z { | } ~                            h     FH4z3-0.3.1Z3.Lang.PreludeZ3.BaseZ3.OptsZ3.Monad Z3.Lang.Lg2 Z3.Lang.Pow2 Z3.Lang.Nat Z3.Lang.TY Z3.Base.CForeigntoBool Z3.Lang.Exprs Z3.Lang.MonadZ3.LangZ3 ASTPrintModeZ3_PRINT_SMTLIB2_COMPLIANTZ3_PRINT_SMTLIB_COMPLIANTZ3_PRINT_LOW_LEVELZ3_PRINT_SMTLIB_FULLLogicUFNIAUFLRAQF_UFNRAQF_UFLRAQF_UFLIAQF_UFIDLQF_UFBVQF_UFQF_RDLQF_NRAQF_NIAQF_LRAQF_LIAQF_IDLQF_BVQF_AX QF_AUFLIAQF_AUFBVQF_ABVLRAAUFNIRAAUFLIRAAUFLIA FuncModel interpMap interpElse Z3ErrorCode Z3Exception DecRefError InvalidUsage InternalFatalFileAccessError MemoutFailInvalidPatternNoParser ParserError InvalidArgIOB SortErrorZ3ErrorerrCodeerrMsgResultUndefUnsatSatSolverParams FuncEntry FuncInterpModelPatternAppFuncDeclSortASTSymbolContextConfigmkConfig delConfig withConfig setParamValue mkContext delContext withContextcontextToString showContext mkIntSymbolmkStringSymbolmkUninterpretedSort mkBoolSort mkIntSort mkRealSortmkBvSort mkArraySort mkTupleSort mkFuncDeclmkAppmkConstmkTruemkFalsemkEq mkDistinctmkNotmkItemkIff mkImpliesmkXormkAndmkOrmkAddmkMulmkSub mkUnaryMinusmkDivmkModmkRemmkLtmkLemkGtmkGe mkInt2Real mkReal2IntmkIsIntmkBvnot mkBvredand mkBvredormkBvandmkBvormkBvxormkBvnandmkBvnormkBvxnormkBvnegmkBvaddmkBvsubmkBvmulmkBvudivmkBvsdivmkBvuremmkBvsremmkBvsmodmkBvultmkBvsltmkBvulemkBvslemkBvugemkBvsgemkBvugtmkBvsgtmkConcat mkExtract mkSignExt mkZeroExtmkRepeatmkBvshlmkBvlshrmkBvashr mkRotateLeft mkRotateRightmkExtRotateLeftmkExtRotateRightmkInt2bvmkBv2intmkBvaddNoOverflowmkBvaddNoUnderflowmkBvsubNoOverflowmkBvsubNoUnderflowmkBvsdivNoOverflowmkBvnegNoOverflowmkBvmulNoOverflowmkBvmulNoUnderflowmkSelectmkStore mkConstArraymkMapmkArrayDefault mkNumeralmkIntmkReal mkPatternmkBoundmkForallmkExists getBvSortSizegetSortgetBoolgetIntgetRealevalevalTevalFunc evalArraygetAsArrayFuncDecl isAsArray getFuncInterpfuncInterpGetNumEntriesfuncInterpGetEntryfuncInterpGetElsefuncInterpGetArityfuncEntryGetValuefuncEntryGetNumArgsfuncEntryGetArg modelToString showModelpushpop assertCnstrgetModeldelModelcheckmkParams paramsSetBool paramsSetUIntparamsSetDoubleparamsSetSymbolparamsToStringmkSolvermkSimpleSolvermkSolverForLogicsolverSetParams solverPush solverPop solverResetsolverAssertCnstrsolverAssertAndTrack solverChecksolverCheckAndGetModelsolverGetReasonUnknownsetASTPrintMode astToStringpatternToString sortToStringfuncDeclToStringbenchmarkToSMTLibStringOptValueOptsstdOpts+?optsetOptsMonadZ3 getSolver getContext evalZ3WithevalZ3 withModelPatCastableExprIsRealIsIntIsNumIsTyArgslogic softTimeoutoptionsstdArgsvarnamedVarfun1fun2fun3fun4fun5assertlet_ exprToString checkModelcheckModelWithcheckModelWithResultliteraltruefalsenot_xorimplies==>iff<=>and_or_distinct&&*||*forallexists instanceWhencast//%*%%divides==*/=*<=*<*>=*>*min_max_ite declareLg2 declarePow2NatTYbaseGHC.Err undefined Z3_error_codeZ3_ast_print_mode Z3_stringZ3_error_handlerZ3_boolZ3_lbool Z3_params Z3_solver Z3_func_entryZ3_func_interpZ3_model Z3_patternZ3_app Z3_func_declZ3_sortZ3_ast Z3_symbol Z3_context Z3_configz3_get_error_msg_exz3_get_error_msg z3_set_errorz3_set_error_handlerz3_get_error_codez3_benchmark_to_smtlib_stringz3_func_decl_to_stringz3_sort_to_stringz3_pattern_to_stringz3_ast_to_stringz3_set_ast_print_modez3_solver_get_reason_unknownz3_solver_get_modelz3_solver_checkz3_solver_assert_and_trackz3_solver_assertz3_solver_reset z3_solver_popz3_solver_pushz3_solver_dec_refz3_solver_inc_refz3_solver_set_paramsz3_mk_solver_for_logicz3_mk_simple_solver z3_mk_solverz3_params_to_stringz3_params_set_symbolz3_params_set_doublez3_params_set_uintz3_params_set_boolz3_params_dec_refz3_params_inc_ref z3_mk_params z3_del_modelz3_checkz3_check_and_get_modelz3_assert_cnstrz3_func_entry_get_argz3_func_entry_get_num_argsz3_func_entry_get_valuez3_func_interp_get_arityz3_func_interp_get_elsez3_func_interp_get_entryz3_func_interp_get_num_entriesz3_model_get_func_interpz3_get_as_array_func_declz3_is_as_arrayz3_evalz3_get_numeral_stringz3_get_bool_value z3_get_sortz3_get_bv_sort_size z3_mk_exists z3_mk_forall z3_mk_bound z3_mk_patternz3_mk_unsigned_int64 z3_mk_int64z3_mk_unsigned_int z3_mk_int z3_mk_real z3_mk_numeralz3_mk_array_default z3_mk_mapz3_mk_const_array z3_mk_store z3_mk_selectz3_mk_bvmul_no_underflowz3_mk_bvmul_no_overflowz3_mk_bvneg_no_overflowz3_mk_bvsdiv_no_overflowz3_mk_bvsub_no_underflowz3_mk_bvsub_no_overflowz3_mk_bvadd_no_underflowz3_mk_bvadd_no_overflow z3_mk_bv2int z3_mk_int2bvz3_mk_ext_rotate_rightz3_mk_ext_rotate_leftz3_mk_rotate_rightz3_mk_rotate_left z3_mk_bvashr z3_mk_bvlshr z3_mk_bvshl z3_mk_repeatz3_mk_zero_extz3_mk_sign_ext z3_mk_extract z3_mk_concat z3_mk_bvsgt z3_mk_bvugt z3_mk_bvsge z3_mk_bvuge z3_mk_bvsle z3_mk_bvule z3_mk_bvslt z3_mk_bvult z3_mk_bvsmod z3_mk_bvsrem z3_mk_bvurem z3_mk_bvsdiv z3_mk_bvudiv z3_mk_bvmul z3_mk_bvsub z3_mk_bvadd z3_mk_bvneg z3_mk_bvxnor z3_mk_bvnor z3_mk_bvnand z3_mk_bvxor z3_mk_bvor z3_mk_bvand z3_mk_bvredorz3_mk_bvredand z3_mk_bvnot z3_mk_is_intz3_mk_real2intz3_mk_int2realz3_mk_gez3_mk_gtz3_mk_lez3_mk_lt z3_mk_rem z3_mk_mod z3_mk_divz3_mk_unary_minus z3_mk_sub z3_mk_mul z3_mk_addz3_mk_or z3_mk_and z3_mk_xor z3_mk_implies z3_mk_iff z3_mk_ite z3_mk_notz3_mk_eq z3_mk_false z3_mk_true z3_mk_const z3_mk_appz3_mk_func_declz3_mk_tuple_sortz3_mk_array_sort z3_mk_bv_sortz3_mk_real_sortz3_mk_int_sortz3_mk_bool_sortz3_mk_uninterpreted_sortz3_mk_string_symbolz3_mk_int_symbolz3_del_context z3_mk_contextz3_set_param_value z3_del_config z3_l_true z3_l_false z3_l_undefz3_truez3_falsez3_invalid_usagez3_context_to_stringz3_model_to_stringz3_popz3_pushz3_mk_distinct z3_mk_configz3_print_smtlib_fullz3_print_low_levelz3_print_smtlib_compliantz3_print_smtlib2_compliantz3_ok z3_sort_errorz3_iobz3_invalid_argz3_parser_error z3_no_parserz3_invalid_patternz3_memout_failz3_file_access_errorz3_internal_fatalz3_dec_ref_error z3_exceptiontoResultghc-prim GHC.TypesBoolunBoolz3Error checkError castLBoolgetNumeralString ptrToMaybe Data.MaybeJustNothingunSolverunParams unFuncEntry unFuncInterpunModel unPattern_unApp unFuncDeclunSortunASTunSymbol unContextunConfig toZ3ErrormkIntZ3mkUnsignedIntZ3 mkInt64Z3mkUnsignedInt64Z3 mkInt_IntZ3mkInt_UnsignedIntZ3 mkInt_Int64Z3mkInt_UnsignedInt64Z3mkRealZ3 mkReal_IntZ3mkReal_UnsignedIntZ3mkReal_Int64Z3mkReal_UnsignedInt64Z3getMapFromInterpgetEntry getEntryArgs $fShowLogic$fExceptionZ3Error $fShowZ3ErrorOptsetOptoption $fOptValue[]$fOptValueDouble$fOptValueInteger $fOptValueInt$fOptValueBool $fMonoidOptsZ3Env envSolver envContext_unZ3 liftScalarliftFun1liftFun2liftFun3liftFun4liftFun6 liftSolver0 liftSolver1 $fMonadZ3Z3CmpOpICmpOpERealOpIntOpCRingOp BoolMultiOp BoolBinOpFunApp QuantifierQExprLayoutUniqIsFuntypeInvtcmkSort mkLiteralgetValue CompilableTCCTCMunTCMGtGeLtLeDistinctEqDivRemModQuotSubMulAddOrAndIffImpliesXorPAppExistsForAll compileCast compileQuantCastIteCmpICmpE RealArithIntArith CRingArithNegQuant BoolMultiBoolBinNotTagConstLitdomainrangecompileokwithHyponewTCCevalTCM typecheckZ3StatefreshuniqValcontextsolverqLayoutsetArgs getQLayout deBruijnIx newQLayout mkBoolBin mkBoolMultimkQuantmkCmp mkCRingArith mkIntArith mkRealArithcompileWithTCCfunDeclQBody createVartcBool compileBoolwithSortedSymbol tcIntegercompileInteger tcRationalcompileRationalapp2AST$fCompilablePattern$fCompilableFunApp $fIsFun(->) $fIsFun(->)0 $fIsRealRatio $fIsNumRatio $fIsTyRatio$fCompilableExpr$fIsIntInteger$fIsNumInteger $fIsTyInteger$fCompilableExpr0 $fQExpr(->) $fQExpr(->)0 $fQExpr(->)1 $fIsTyBool$fCompilableExpr1$fCastableRatioInteger$fCastableIntegerRatio$fFractionalExpr $fNumExprunNattcNat compileNat$fCastableNatInteger $fIsIntNat $fIsNumNat $fIsTyNat $fIntegralNat$fNumNat $fShowNat