mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 17:15:31 +00:00
Code Activity

Fix some typos.

Browse source
This commit is contained in:
Bruce Mitchener 2024-02-08 00:44:52 +07:00
parent 937d4aa8f4
commit c81504864c
22 changed files with 33 additions and 33 deletions
Download patch file Download diff file Expand all files Collapse all files

2
examples/SMT-LIB2/bounded model checking/loop_unrolling.smt2
View file

@ -50,7 +50,7 @@
)
)
; Transition funcion
; Transition function
(define-fun body ((f_0 Int) (f Int) (i_0 Int) (i_1 Int)(_A (Array Int Int)) (_x Int)) Bool
(and
(= f (ite (= _x (select _A i_0)) 1 f_0))

2
examples/SMT-LIB2/bounded model checking/loop_unrolling_bitvec.smt2
View file

@ -52,7 +52,7 @@
)
)
; Transition funcion
; Transition function
(define-fun body ((f_0 IntValue) (f IntValue) (i_0 IntValue) (i_1 IntValue)(_A (Array IntValue IntValue)) (_x IntValue)) Bool
(and
(= f (ite (= _x (select _A i_0)) #x00000001 f_0))

2
examples/python/proofreplay.py
View file

@ -86,7 +86,7 @@ if __name__ == "__main__":
# The pair -inst 2 indicates that two quantifier instantiations were not self-validated
# They were instead validated using a call to SMT solving. A log for an smt invocation
# is exemplified in the next line.
# Note that the pair +inst 6 indicates that 6 quantifier instantations were validated
# Note that the pair +inst 6 indicates that 6 quantifier instantiations were validated
# using a syntactic (cheap) check. Some quantifier instantiations based on quantifier elimination
# are not simple substitutions and therefore a simple syntactic check does not suffice.
set_param("solver.proof.check", True)