tla-ts 0.0.10-dev.8aec06f77 → 0.0.10-dev.8be00045c
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/deciders.cjs +37 -36
- package/dist/deciders.js +55 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +146 -58
- package/dist/prove.js +143 -55
- package/dist/run.cjs +43 -43
- package/dist/run.js +45 -45
- package/dist/transfer.cjs +29 -26
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +1 -1
- package/dist/worker.js +1 -1
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +336 -88
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +261 -68
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/dependencies.ts +23 -2
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +1 -1
- package/src/evaluate.ts +9 -3
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +134 -86
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +0 -2
- package/src/obligations/anonymize.ts +2 -6
- package/src/obligations/equality.ts +0 -2
- package/src/obligations/expression.ts +0 -2
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +0 -2
- package/src/obligations/index.ts +5 -3
- package/src/obligations/levels.ts +0 -2
- package/src/obligations/module.ts +0 -2
- package/src/obligations/normalize.ts +0 -2
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +2 -2
- package/src/obligations/printer.ts +0 -2
- package/src/obligations/proof.ts +0 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +0 -2
- package/src/obligations/subexpression.ts +0 -2
- package/src/obligations/substitution.ts +0 -2
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +224 -82
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +1 -8
- package/src/prover/isabelle/encode.ts +0 -2
- package/src/prover/isabelle/isar/attrib.ts +86 -49
- package/src/prover/isabelle/isar/context.ts +25 -26
- package/src/prover/isabelle/isar/induct.ts +2 -9
- package/src/prover/isabelle/isar/method.ts +5 -9
- package/src/prover/isabelle/isar/proof.ts +33 -18
- package/src/prover/isabelle/isar/rule-cases.ts +14 -22
- package/src/prover/isabelle/isar/theory.ts +16 -17
- package/src/prover/isabelle/isar/toplevel.ts +46 -56
- package/src/prover/isabelle/isar/type-check.ts +0 -2
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +1 -3
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +0 -2
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +0 -2
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +0 -2
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +0 -2
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +0 -2
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +0 -2
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +1 -0
- package/src/prover/prep/methods.ts +50 -3
- package/src/prover/prep/normalize.ts +4 -1
- package/src/prover/prove.ts +58 -32
- package/src/prover/ptl/decide.ts +43 -63
- package/src/prover/smt/data.ts +51 -45
- package/src/prover/smt/encode.ts +1 -2
- package/src/prover/smt/rewrite.ts +3 -7
- package/src/prover/smt/simplify.ts +1 -1
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
- package/src/prover/smt/solver/ackr-helper.ts +0 -3
- package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
- package/src/prover/smt/solver/aig-tactic.ts +25 -16
- package/src/prover/smt/solver/aig.ts +2 -3
- package/src/prover/smt/solver/arith-rewriter.ts +3 -6
- package/src/prover/smt/solver/arith-terms.ts +0 -2
- package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/array-rewriter.ts +0 -1
- package/src/prover/smt/solver/asserted-formulas.ts +9 -3
- package/src/prover/smt/solver/ast-lt.ts +1 -2
- package/src/prover/smt/solver/ast-util.ts +3 -3
- package/src/prover/smt/solver/ast.ts +112 -156
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
- package/src/prover/smt/solver/bit-blaster.ts +0 -3
- package/src/prover/smt/solver/bound-manager.ts +39 -29
- package/src/prover/smt/solver/bound-simplifier.ts +0 -2
- package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
- package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
- package/src/prover/smt/solver/bv-rewriter.ts +15 -19
- package/src/prover/smt/solver/bv1-blast.ts +1 -11
- package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
- package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
- package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
- package/src/prover/smt/solver/card2bv.ts +1 -4
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +19 -16
- package/src/prover/smt/solver/check-logic.ts +6 -2
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
- package/src/prover/smt/solver/conflict-resolution.ts +0 -1
- package/src/prover/smt/solver/context.ts +41 -14
- package/src/prover/smt/solver/ctx-simplify.ts +1 -3
- package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
- package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
- package/src/prover/smt/solver/demodulator.ts +2 -5
- package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
- package/src/prover/smt/solver/der.ts +0 -1
- package/src/prover/smt/solver/diff-neq.ts +1 -3
- package/src/prover/smt/solver/distribute-forall.ts +1 -11
- package/src/prover/smt/solver/dom-simplify.ts +1 -3
- package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
- package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
- package/src/prover/smt/solver/enode.ts +15 -2
- package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/arith-internalize.ts +1 -3
- package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
- package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
- package/src/prover/smt/solver/euf/array-solver.ts +0 -2
- package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
- package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
- package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
- package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
- package/src/prover/smt/solver/euf/egraph.ts +68 -43
- package/src/prover/smt/solver/euf/euf-solver.ts +36 -23
- package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
- package/src/prover/smt/solver/euf/mam.ts +7 -55
- package/src/prover/smt/solver/euf/q-ematch.ts +21 -97
- package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
- package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
- package/src/prover/smt/solver/euf/q-solver.ts +2 -2
- package/src/prover/smt/solver/euf/th-solver.ts +1 -10
- package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
- package/src/prover/smt/solver/expr2polynomial.ts +204 -80
- package/src/prover/smt/solver/factor.ts +37 -26
- package/src/prover/smt/solver/fd-solver.ts +3 -5
- package/src/prover/smt/solver/fingerprints.ts +0 -1
- package/src/prover/smt/solver/fix-dl-var.ts +1 -3
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +19 -14
- package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/fpa-rewriter.ts +2 -2
- package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/goal.ts +3 -2
- package/src/prover/smt/solver/goal2nlsat.ts +57 -32
- package/src/prover/smt/solver/guard-set.ts +0 -1
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +0 -1
- package/src/prover/smt/solver/inf-eps.ts +1 -2
- package/src/prover/smt/solver/inj-axiom.ts +0 -1
- package/src/prover/smt/solver/internalizer.ts +41 -3
- package/src/prover/smt/solver/lackr.ts +0 -2
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +0 -1
- package/src/prover/smt/solver/lia2pb.ts +18 -5
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +0 -4
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +0 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +0 -1
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +26 -7
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +1 -2
- package/src/prover/smt/solver/macro-finder.ts +1 -4
- package/src/prover/smt/solver/mam-compiler.ts +14 -15
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
- package/src/prover/smt/solver/max-cliques.ts +0 -2
- package/src/prover/smt/solver/maxcore.ts +5 -14
- package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
- package/src/prover/smt/solver/maxlex.ts +0 -8
- package/src/prover/smt/solver/maxsmt-base.ts +7 -1
- package/src/prover/smt/solver/maxsmt.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +9 -2
- package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
- package/src/prover/smt/solver/model-based-opt.ts +1 -2
- package/src/prover/smt/solver/model-checker.ts +0 -1
- package/src/prover/smt/solver/model-evaluator.ts +9 -6
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +3 -2
- package/src/prover/smt/solver/model-macro-solver.ts +3 -4
- package/src/prover/smt/solver/model-printer.ts +0 -1
- package/src/prover/smt/solver/mpf.ts +2 -5
- package/src/prover/smt/solver/mus.ts +1 -3
- package/src/prover/smt/solver/muz/dl-context.ts +67 -9
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
- package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
- package/src/prover/smt/solver/muz/dl-rule.ts +95 -33
- package/src/prover/smt/solver/muz/hnf.ts +6 -6
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
- package/src/prover/smt/solver/muz/rule-properties.ts +194 -37
- package/src/prover/smt/solver/muz/spacer-context.ts +104 -89
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -3
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
- package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
- package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +3 -9
- package/src/prover/smt/solver/muz/spacer-util.ts +2 -3
- package/src/prover/smt/solver/muz/substitution.ts +88 -39
- package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/nlqsat.ts +4 -4
- package/src/prover/smt/solver/nlsat/algebraic.ts +194 -93
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +379 -217
- package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +112 -99
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
- package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
- package/src/prover/smt/solver/nnf.ts +0 -1
- package/src/prover/smt/solver/normalize-bounds.ts +0 -1
- package/src/prover/smt/solver/occf.ts +0 -1
- package/src/prover/smt/solver/opt-context.ts +15 -10
- package/src/prover/smt/solver/opt-nlsat.ts +97 -77
- package/src/prover/smt/solver/opt-pareto.ts +0 -2
- package/src/prover/smt/solver/opt-preprocess.ts +0 -1
- package/src/prover/smt/solver/opt-solver.ts +22 -11
- package/src/prover/smt/solver/opt-value.ts +0 -1
- package/src/prover/smt/solver/optsmt.ts +13 -12
- package/src/prover/smt/solver/parallel-tactic.ts +0 -2
- package/src/prover/smt/solver/pattern-inference.ts +2 -3
- package/src/prover/smt/solver/pb-rewriter.ts +14 -20
- package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/poly-rewriter.ts +2 -3
- package/src/prover/smt/solver/probes.ts +4 -7
- package/src/prover/smt/solver/propagate-values.ts +4 -1
- package/src/prover/smt/solver/proto-model.ts +6 -7
- package/src/prover/smt/solver/pull-quant.ts +0 -1
- package/src/prover/smt/solver/purify-arith.ts +50 -16
- package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
- package/src/prover/smt/solver/qe-lite-der.ts +0 -1
- package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
- package/src/prover/smt/solver/qe-lite.ts +0 -1
- package/src/prover/smt/solver/qe-mbp.ts +13 -24
- package/src/prover/smt/solver/qe.ts +48 -57
- package/src/prover/smt/solver/qel.ts +0 -1
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +70 -91
- package/src/prover/smt/solver/quant-hoist.ts +0 -1
- package/src/prover/smt/solver/quant-tactics.ts +0 -1
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +14 -10
- package/src/prover/smt/solver/quasi-macros.ts +9 -20
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +17 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
- package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
- package/src/prover/smt/solver/reduce-args.ts +0 -1
- package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +0 -1
- package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
- package/src/prover/smt/solver/rewriter.ts +1 -2
- package/src/prover/smt/solver/rlimit.ts +13 -1
- package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
- package/src/prover/smt/solver/sat/big.ts +0 -1
- package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
- package/src/prover/smt/solver/sat/clause.ts +1 -6
- package/src/prover/smt/solver/sat/cleaner.ts +0 -2
- package/src/prover/smt/solver/sat/config.ts +4 -7
- package/src/prover/smt/solver/sat/consequences.ts +1 -2
- package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
- package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -13
- package/src/prover/smt/solver/sat/model-converter.ts +2 -18
- package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
- package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
- package/src/prover/smt/solver/sat/probing.ts +22 -21
- package/src/prover/smt/solver/sat/sat-tactic.ts +2 -2
- package/src/prover/smt/solver/sat/sat2goal.ts +9 -12
- package/src/prover/smt/solver/sat/scc.ts +0 -1
- package/src/prover/smt/solver/sat/simplifier.ts +16 -60
- package/src/prover/smt/solver/sat/solver.ts +45 -68
- package/src/prover/smt/solver/sat/var-queue.ts +0 -2
- package/src/prover/smt/solver/sat/watch-list.ts +7 -3
- package/src/prover/smt/solver/search-tree.ts +0 -1
- package/src/prover/smt/solver/seq-axioms.ts +20 -36
- package/src/prover/smt/solver/seq-decl-plugin.ts +7 -8
- package/src/prover/smt/solver/seq-derive.ts +9 -15
- package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
- package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
- package/src/prover/smt/solver/seq-factory.ts +0 -1
- package/src/prover/smt/solver/seq-monadic.ts +7 -7
- package/src/prover/smt/solver/seq-range-predicate.ts +14 -3
- package/src/prover/smt/solver/seq-re-rewriter.ts +3 -12
- package/src/prover/smt/solver/seq-re-util.ts +2 -5
- package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
- package/src/prover/smt/solver/seq-regex-live.ts +6 -8
- package/src/prover/smt/solver/seq-rewriter.ts +31 -34
- package/src/prover/smt/solver/seq-skolem.ts +0 -24
- package/src/prover/smt/solver/seq-subset.ts +0 -1
- package/src/prover/smt/solver/seq-view-witness.ts +4 -6
- package/src/prover/smt/solver/smt-consequences.ts +0 -2
- package/src/prover/smt/solver/smt-kernel.ts +8 -3
- package/src/prover/smt/solver/smt-logics.ts +0 -1
- package/src/prover/smt/solver/smt-setup.ts +18 -14
- package/src/prover/smt/solver/smt2-printer.ts +0 -2
- package/src/prover/smt/solver/smtlib-parser.ts +1187 -592
- package/src/prover/smt/solver/smtlib-script.ts +957 -750
- package/src/prover/smt/solver/solve-eqs.ts +11 -19
- package/src/prover/smt/solver/solver.ts +1 -2
- package/src/prover/smt/solver/static-features.ts +0 -2
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +77 -18
- package/src/prover/smt/solver/term-enumeration.ts +0 -1
- package/src/prover/smt/solver/theory-array.ts +25 -60
- package/src/prover/smt/solver/theory-bv.ts +15 -54
- package/src/prover/smt/solver/theory-char.ts +0 -1
- package/src/prover/smt/solver/theory-datatype.ts +0 -1
- package/src/prover/smt/solver/theory-finite-set.ts +2 -2
- package/src/prover/smt/solver/theory-fpa.ts +46 -79
- package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +0 -2
- package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
- package/src/prover/smt/solver/theory-lra-model.ts +0 -1
- package/src/prover/smt/solver/theory-lra-propagate.ts +0 -3
- package/src/prover/smt/solver/theory-lra-state.ts +0 -1
- package/src/prover/smt/solver/theory-lra.ts +0 -2
- package/src/prover/smt/solver/theory-pb.ts +12 -11
- package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
- package/src/prover/smt/solver/theory-recfun.ts +2 -3
- package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
- package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
- package/src/prover/smt/solver/theory-seq-state.ts +8 -26
- package/src/prover/smt/solver/theory-seq.ts +32 -55
- package/src/prover/smt/solver/theory.ts +16 -2
- package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
- package/src/prover/smt/solver/var-subst.ts +2 -3
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/zenon/decide.ts +9 -13
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +12 -13
- package/src/prover/zenon/parse.ts +0 -2
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +0 -2
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +1 -3
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +264 -77
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +2 -1
- package/src/sany/generator-expressions.ts +30 -27
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +6 -5
- package/src/search.ts +198 -45
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +165 -78
- package/src/successors.ts +1 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +1 -1
- package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/cmd_context/cmd_context.cpp, src/cmd_context/basic_cmds.cpp), MIT license,
|
|
2
|
-
// see z3-license.txt.
|
|
3
1
|
import { ENCODINGS, UNICODE_ENCODING } from "./seq-decl-plugin";
|
|
4
2
|
import {
|
|
5
3
|
isStackOverflow,
|
|
@@ -71,6 +69,7 @@ import {
|
|
|
71
69
|
compileTactic,
|
|
72
70
|
getRewriterOptions,
|
|
73
71
|
getSatParams,
|
|
72
|
+
getSmtTacticFailure,
|
|
74
73
|
type TacticParam,
|
|
75
74
|
} from "./tactic";
|
|
76
75
|
|
|
@@ -276,6 +275,14 @@ interface CheckResult {
|
|
|
276
275
|
isOptimizing: boolean;
|
|
277
276
|
model: ProtoModel | undefined;
|
|
278
277
|
core: number[] | undefined;
|
|
278
|
+
// check_sat_result::reason_unknown, where the port tracks it.
|
|
279
|
+
reasonUnknown?: string;
|
|
280
|
+
}
|
|
281
|
+
|
|
282
|
+
interface SolverAnswer {
|
|
283
|
+
result: number;
|
|
284
|
+
context: Context | undefined;
|
|
285
|
+
reasonUnknown: string | undefined;
|
|
279
286
|
}
|
|
280
287
|
|
|
281
288
|
interface ScriptState {
|
|
@@ -311,15 +318,22 @@ const MANAGERLESS_COMMANDS = new Set([
|
|
|
311
318
|
"set-logic",
|
|
312
319
|
"get-option",
|
|
313
320
|
"get-info",
|
|
321
|
+
"get-assertions",
|
|
314
322
|
"echo",
|
|
315
323
|
]);
|
|
316
324
|
|
|
317
325
|
export const runSmtlibScript = (
|
|
318
326
|
text: string,
|
|
319
327
|
options: DecideOptions,
|
|
320
|
-
|
|
328
|
+
printLine: (line: string, isDiagnostic?: boolean) => void,
|
|
321
329
|
) => {
|
|
322
330
|
const commands = createCommandReader(text);
|
|
331
|
+
// Z3 writes to a stream: text left without a newline starts the next line.
|
|
332
|
+
let pendingText = "";
|
|
333
|
+
const print = (line: string, isDiagnostic?: boolean) => {
|
|
334
|
+
printLine(pendingText + line, isDiagnostic);
|
|
335
|
+
pendingText = "";
|
|
336
|
+
};
|
|
323
337
|
const settings = {
|
|
324
338
|
isPrintingSuccess: false,
|
|
325
339
|
isProducingModels: true,
|
|
@@ -339,9 +353,7 @@ export const runSmtlibScript = (
|
|
|
339
353
|
parserOptions: { isIgnoringBadPatterns: true },
|
|
340
354
|
};
|
|
341
355
|
const createState = (): ScriptState => {
|
|
342
|
-
const manager = new AstManager(
|
|
343
|
-
new ResourceLimit(Date.now() + options.timeLimitMs, options.signal),
|
|
344
|
-
);
|
|
356
|
+
const manager = new AstManager(new ResourceLimit(Infinity, options.signal));
|
|
345
357
|
manager.isHiDiv0 = settings.isHiDiv0;
|
|
346
358
|
manager.maxChar = settings.encoding.maxChar;
|
|
347
359
|
manager.charBits = settings.encoding.charBits;
|
|
@@ -365,18 +377,17 @@ export const runSmtlibScript = (
|
|
|
365
377
|
eufSolver: undefined,
|
|
366
378
|
};
|
|
367
379
|
};
|
|
368
|
-
|
|
380
|
+
let state = createState();
|
|
369
381
|
const getPrintEnvironment = () => ({
|
|
370
382
|
options: settings.printOptions,
|
|
371
|
-
isUsed:
|
|
372
|
-
isClashing:
|
|
383
|
+
isUsed: state.reader.isUsed,
|
|
384
|
+
isClashing: state.reader.isClashing,
|
|
373
385
|
});
|
|
374
|
-
const format = (expr: number) => printExpr(
|
|
386
|
+
const format = (expr: number) => printExpr(state.manager, getPrintEnvironment(), expr);
|
|
375
387
|
const display = (expr: number) => print(format(expr));
|
|
376
388
|
const report = (error: SmtParseError) =>
|
|
377
389
|
print(`(error "line ${error.line} column ${error.column}: ${error.message}")`);
|
|
378
390
|
const getNamedAssertions = () => {
|
|
379
|
-
const state = script.state;
|
|
380
391
|
const manager = state.manager;
|
|
381
392
|
const isNamed = hasNames();
|
|
382
393
|
return state.assertions.map((assertion, index) =>
|
|
@@ -405,7 +416,6 @@ export const runSmtlibScript = (
|
|
|
405
416
|
};
|
|
406
417
|
};
|
|
407
418
|
const optimize = (extra: number[]) => {
|
|
408
|
-
const state = script.state;
|
|
409
419
|
const manager = state.manager;
|
|
410
420
|
const objectives = state.objectives;
|
|
411
421
|
const hard = [...getNamedAssertions(), ...state.names.filter((name) => name !== -1), ...extra];
|
|
@@ -423,7 +433,7 @@ export const runSmtlibScript = (
|
|
|
423
433
|
setup: getSetup(),
|
|
424
434
|
write: () => {},
|
|
425
435
|
parameters: settings.parameters,
|
|
426
|
-
hasDefinitions: () =>
|
|
436
|
+
hasDefinitions: () => state.reader.hasDefinitions(),
|
|
427
437
|
},
|
|
428
438
|
objectives,
|
|
429
439
|
);
|
|
@@ -448,14 +458,11 @@ export const runSmtlibScript = (
|
|
|
448
458
|
!hasAssumptions &&
|
|
449
459
|
settings.parameters.get("opt.incremental") !== "true",
|
|
450
460
|
});
|
|
451
|
-
|
|
452
|
-
state.check = {
|
|
453
|
-
status,
|
|
454
|
-
context: undefined,
|
|
461
|
+
setCheck(status, {
|
|
455
462
|
isOptimizing: true,
|
|
456
463
|
model: optimizer.model ?? undefined,
|
|
457
|
-
|
|
458
|
-
};
|
|
464
|
+
reasonUnknown: optimizer.getReasonUnknown(),
|
|
465
|
+
});
|
|
459
466
|
print(getVerdict(status));
|
|
460
467
|
return true;
|
|
461
468
|
} catch (error) {
|
|
@@ -465,14 +472,9 @@ export const runSmtlibScript = (
|
|
|
465
472
|
return false;
|
|
466
473
|
}
|
|
467
474
|
if (!(error instanceof SmtCanceledError || isStackOverflow(error))) throw error;
|
|
475
|
+
const reasonUnknown = optimizer.getReasonUnknown();
|
|
468
476
|
optimizer.release();
|
|
469
|
-
|
|
470
|
-
status: L_UNDEF,
|
|
471
|
-
context: undefined,
|
|
472
|
-
isOptimizing: true,
|
|
473
|
-
model: undefined,
|
|
474
|
-
core: undefined,
|
|
475
|
-
};
|
|
477
|
+
setCheck(L_UNDEF, { isOptimizing: true, reasonUnknown });
|
|
476
478
|
print("unknown");
|
|
477
479
|
return true;
|
|
478
480
|
} finally {
|
|
@@ -481,67 +483,89 @@ export const runSmtlibScript = (
|
|
|
481
483
|
}
|
|
482
484
|
};
|
|
483
485
|
const resetOptimizer = () => {
|
|
484
|
-
|
|
485
|
-
|
|
486
|
+
state.optimizer?.release();
|
|
487
|
+
state.optimizer = undefined;
|
|
486
488
|
};
|
|
487
489
|
// The port keeps answering with the smt kernel where it lacks a piece of the logic's strategy.
|
|
488
490
|
const solveWithStrategy = () => {
|
|
489
|
-
const state = script.state;
|
|
490
491
|
const goal = getGoal();
|
|
491
492
|
const strategy =
|
|
492
493
|
settings.parameters.get("tactic.default_tactic") ??
|
|
493
494
|
getLogicStrategy(state.logic, goal.isProofsEnabled);
|
|
494
495
|
try {
|
|
495
496
|
const checked = checkSatUsing(compileInternalTactic(getTacticEnvironment(), strategy), goal);
|
|
496
|
-
return {
|
|
497
|
+
return {
|
|
498
|
+
result: checked.status,
|
|
499
|
+
context: undefined,
|
|
500
|
+
model: checked.model,
|
|
501
|
+
reasonUnknown: checked.reasonUnknown,
|
|
502
|
+
};
|
|
497
503
|
} catch (error) {
|
|
498
504
|
if (!(error instanceof SmtUnsupportedError)) throw error;
|
|
499
505
|
const hasQuantifiers = state.assertions.some(
|
|
500
506
|
(assertion) => state.manager.hasQuantifierFlags[assertion],
|
|
501
507
|
);
|
|
508
|
+
const solved = solveAssertions(state.manager, state.assertions, {
|
|
509
|
+
isMbqi: settings.isMbqi || isMbqiByFeatures(getSetup(), hasQuantifiers),
|
|
510
|
+
mbqiMaxIterations: settings.mbqiMaxIterations,
|
|
511
|
+
isFindingMacros: settings.isFindingMacros,
|
|
512
|
+
setup: getSetup(),
|
|
513
|
+
});
|
|
502
514
|
return {
|
|
503
|
-
...
|
|
504
|
-
isMbqi: settings.isMbqi || isMbqiByFeatures(getSetup(), hasQuantifiers),
|
|
505
|
-
mbqiMaxIterations: settings.mbqiMaxIterations,
|
|
506
|
-
isFindingMacros: settings.isFindingMacros,
|
|
507
|
-
setup: getSetup(),
|
|
508
|
-
}),
|
|
515
|
+
...solved,
|
|
509
516
|
model: undefined,
|
|
517
|
+
reasonUnknown:
|
|
518
|
+
solved.result === L_UNDEF && solved.context !== undefined
|
|
519
|
+
? getSmtTacticFailure(solved.context)
|
|
520
|
+
: "",
|
|
510
521
|
};
|
|
511
522
|
}
|
|
512
523
|
};
|
|
513
|
-
|
|
514
|
-
|
|
524
|
+
// Deviation from Z3: the heap guard and a stack overflow, which Z3 lacks, read as an exhausted rlimit.
|
|
525
|
+
const getCancelMessage = (deadline: number) =>
|
|
526
|
+
Date.now() > deadline || options.signal?.aborted === true
|
|
527
|
+
? "canceled"
|
|
528
|
+
: "max. resource limit exceeded";
|
|
529
|
+
// As in Z3, a timeout leaves "timeout" in the kernel, which reports it while its last search hasn't failed.
|
|
530
|
+
const getReasonUnknown = (solved: SolverAnswer, deadline: number) => {
|
|
531
|
+
const isTimedOut = solved.result === L_UNDEF && Date.now() > deadline;
|
|
532
|
+
const context = state.kernel?.context;
|
|
533
|
+
if (isTimedOut && context !== undefined) context.reasonUnknown = "timeout";
|
|
534
|
+
if (context !== undefined && solved.context === context) return context.getLastFailureMessage();
|
|
535
|
+
return isTimedOut ? "timeout" : (solved.reasonUnknown ?? getCancelMessage(deadline));
|
|
536
|
+
};
|
|
537
|
+
// As in Z3, a kernel loses the mbqi its logic turned on once it reads the parameters again.
|
|
538
|
+
const getKernelParams = (isSetUp = false) => ({
|
|
539
|
+
isMbqi: settings.isMbqi || (!isSetUp && isMbqiByLogic(getSetup())),
|
|
515
540
|
mbqiMaxIterations: settings.mbqiMaxIterations,
|
|
516
541
|
isFindingMacros: settings.isFindingMacros,
|
|
517
542
|
setup: getSetup(),
|
|
518
543
|
});
|
|
544
|
+
// mk_special_solver_for_logic gives these logics the finite-domain solver, incremental or not.
|
|
545
|
+
const isUsingFdSolver = () =>
|
|
546
|
+
(state.logic === "QF_FD" || state.logic === "SAT") &&
|
|
547
|
+
!settings.isProducingProofs &&
|
|
548
|
+
!settings.parameters.has("tactic.default_tactic");
|
|
519
549
|
const checkSat = (extra: number[]) => {
|
|
520
|
-
const
|
|
521
|
-
state.manager.limit.restart(
|
|
550
|
+
const deadline = Date.now() + options.timeLimitMs;
|
|
551
|
+
state.manager.limit.restart(deadline);
|
|
522
552
|
// opt::context::optimize answers as the search of the hard constraints does: once they are
|
|
523
553
|
// satisfiable, optsmt and maxsmt only improve the model. The unported parts of optimization
|
|
524
554
|
// only get that answer.
|
|
525
555
|
if (state.objectives.length > 0 && optimize(extra)) return;
|
|
526
556
|
state.manager.limit.push(settings.rlimit);
|
|
527
557
|
const isOptimizing = state.objectives.length > 0;
|
|
558
|
+
const manager = state.manager;
|
|
559
|
+
const names = state.names.filter((name) => name !== -1);
|
|
560
|
+
const isNamed = names.length > 0;
|
|
561
|
+
const isAssuming = isNamed || extra.length > 0;
|
|
562
|
+
if (isAssuming) state.isIncremental = true;
|
|
563
|
+
if (!isOptimizing) state.hasChecked = true;
|
|
564
|
+
const isKernelChecking =
|
|
565
|
+
isAssuming || (state.isIncremental && !isOptimizing && !isUsingFdSolver());
|
|
528
566
|
try {
|
|
529
|
-
const manager = state.manager;
|
|
530
|
-
const names = state.names.filter((name) => name !== -1);
|
|
531
|
-
const isNamed = names.length > 0;
|
|
532
|
-
const isAssuming = isNamed || extra.length > 0;
|
|
533
|
-
if (isAssuming) state.isIncremental = true;
|
|
534
|
-
if (!isOptimizing) state.hasChecked = true;
|
|
535
|
-
// mk_special_solver_for_logic gives these logics the finite-domain solver, incremental or not.
|
|
536
|
-
const isFd =
|
|
537
|
-
(state.logic === "QF_FD" || state.logic === "SAT") &&
|
|
538
|
-
!settings.isProducingProofs &&
|
|
539
|
-
!settings.parameters.has("tactic.default_tactic");
|
|
540
567
|
const assumptions = isNamed ? [...names, ...extra] : extra;
|
|
541
|
-
const kernel =
|
|
542
|
-
isAssuming || (state.isIncremental && !isOptimizing && !isFd)
|
|
543
|
-
? checkKernel(assumptions)
|
|
544
|
-
: undefined;
|
|
568
|
+
const kernel = isKernelChecking ? checkKernel(assumptions) : undefined;
|
|
545
569
|
// Z3 retries a quantifier-free problem with its tactic when the incremental kernel gives up.
|
|
546
570
|
const solved =
|
|
547
571
|
kernel === undefined ||
|
|
@@ -551,24 +575,24 @@ export const runSmtlibScript = (
|
|
|
551
575
|
manager.limit.inc())
|
|
552
576
|
? { ...solveWithStrategy(), core: undefined }
|
|
553
577
|
: kernel;
|
|
554
|
-
solved.
|
|
555
|
-
state.check = {
|
|
556
|
-
status: solved.result,
|
|
578
|
+
setCheck(solved.result, {
|
|
557
579
|
context: solved.context,
|
|
558
580
|
isOptimizing,
|
|
559
581
|
model: solved.model,
|
|
560
582
|
core: solved.core ?? solved.context?.unsatCore ?? [],
|
|
561
|
-
|
|
583
|
+
reasonUnknown: getReasonUnknown(solved, deadline),
|
|
584
|
+
});
|
|
562
585
|
print(getVerdict(solved.result));
|
|
563
586
|
} catch (error) {
|
|
564
587
|
if (!(error instanceof SmtCanceledError || isStackOverflow(error))) throw error;
|
|
565
|
-
state.
|
|
566
|
-
|
|
567
|
-
context: undefined,
|
|
588
|
+
const context = isKernelChecking ? state.kernel?.context : undefined;
|
|
589
|
+
setCheck(L_UNDEF, {
|
|
568
590
|
isOptimizing,
|
|
569
|
-
|
|
570
|
-
|
|
571
|
-
|
|
591
|
+
reasonUnknown: getReasonUnknown(
|
|
592
|
+
{ result: L_UNDEF, context, reasonUnknown: undefined },
|
|
593
|
+
deadline,
|
|
594
|
+
),
|
|
595
|
+
});
|
|
572
596
|
print("unknown");
|
|
573
597
|
} finally {
|
|
574
598
|
state.manager.limit.release();
|
|
@@ -576,27 +600,38 @@ export const runSmtlibScript = (
|
|
|
576
600
|
}
|
|
577
601
|
};
|
|
578
602
|
const getModel = (list: SmtList) => {
|
|
579
|
-
const check =
|
|
603
|
+
const check = state.check;
|
|
580
604
|
if (!settings.isProducingModels || check === undefined || check.status === L_FALSE)
|
|
581
605
|
throw new SmtParseError("model is not available", list.end);
|
|
582
606
|
if (check.model !== undefined) return check.model;
|
|
583
607
|
if (check.isOptimizing) throw new SmtUnsupportedError("the models of optimization");
|
|
584
608
|
if (check.context === undefined && check.status !== L_TRUE)
|
|
585
609
|
throw new SmtUnsupportedError("the model of a canceled search");
|
|
586
|
-
const model = check.context?.getModel() ?? new ProtoModel(
|
|
610
|
+
const model = check.context?.getModel() ?? new ProtoModel(state.manager);
|
|
587
611
|
model.incRef();
|
|
588
612
|
check.model = model;
|
|
589
613
|
return model;
|
|
590
614
|
};
|
|
591
615
|
const clearCheck = () => {
|
|
592
|
-
|
|
593
|
-
|
|
616
|
+
state.check?.model?.decRef();
|
|
617
|
+
state.check = undefined;
|
|
618
|
+
};
|
|
619
|
+
// The check holds a reference to its model until clearCheck.
|
|
620
|
+
const setCheck = (status: number, result: Partial<Omit<CheckResult, "status">> = {}) => {
|
|
621
|
+
result.model?.incRef();
|
|
622
|
+
state.check = {
|
|
623
|
+
status,
|
|
624
|
+
context: undefined,
|
|
625
|
+
isOptimizing: false,
|
|
626
|
+
model: undefined,
|
|
627
|
+
core: undefined,
|
|
628
|
+
...result,
|
|
629
|
+
};
|
|
594
630
|
};
|
|
595
631
|
// cmd_context::mk_solver: mk_solver_for_logic makes the incremental solver the smt kernel unless
|
|
596
632
|
// the logic, the default tactic or the sat parameters pick a sat solver. Under sat.euf that
|
|
597
633
|
// solver is inc_sat_solver in euf mode; the other sat solvers only store their assertions.
|
|
598
634
|
const resetKernel = () => {
|
|
599
|
-
const state = script.state;
|
|
600
635
|
const logic = state.logic;
|
|
601
636
|
const parameters = settings.parameters;
|
|
602
637
|
const isProofsEnabled = settings.isProducingProofs || state.isProofsEnabled === true;
|
|
@@ -615,10 +650,13 @@ export const runSmtlibScript = (
|
|
|
615
650
|
isEuf && !isFdSolver && parameters.get("sat.smt") !== "true"
|
|
616
651
|
? new IncSatSolver(state.manager, getSatParams(parameters), true, mkThSolver)
|
|
617
652
|
: undefined;
|
|
653
|
+
for (let index = 0; index < state.scopes.length; index++) {
|
|
654
|
+
state.kernel?.push();
|
|
655
|
+
useEufSolver((solver) => solver.push());
|
|
656
|
+
}
|
|
618
657
|
};
|
|
619
658
|
// The parts of sat.euf that are not ported leave its answers to the smt kernel.
|
|
620
659
|
const useEufSolver = <Result>(action: (solver: IncSatSolver) => Result) => {
|
|
621
|
-
const state = script.state;
|
|
622
660
|
const solver = state.eufSolver;
|
|
623
661
|
if (solver === undefined) return undefined;
|
|
624
662
|
try {
|
|
@@ -632,7 +670,6 @@ export const runSmtlibScript = (
|
|
|
632
670
|
};
|
|
633
671
|
// solver_na2as asserts a named assertion as an implication from its name.
|
|
634
672
|
const assertInKernel = (formula: number, name: number) => {
|
|
635
|
-
const state = script.state;
|
|
636
673
|
const manager = state.manager;
|
|
637
674
|
const asserted = name === -1 ? formula : manager.mkApp(OP_IMPLIES, [name, formula], SORT_BOOL);
|
|
638
675
|
manager.incRef(asserted);
|
|
@@ -641,7 +678,6 @@ export const runSmtlibScript = (
|
|
|
641
678
|
manager.decRef(asserted);
|
|
642
679
|
};
|
|
643
680
|
const checkKernel = (assumptions: number[]) => {
|
|
644
|
-
const state = script.state;
|
|
645
681
|
const kernel = state.kernel;
|
|
646
682
|
const found = useEufSolver((solver) => {
|
|
647
683
|
const result = solver.check(assumptions);
|
|
@@ -650,6 +686,7 @@ export const runSmtlibScript = (
|
|
|
650
686
|
context: undefined,
|
|
651
687
|
model: result === L_TRUE ? (solver.getModel() ?? undefined) : undefined,
|
|
652
688
|
core: result === L_FALSE ? [...solver.getUnsatCore()] : undefined,
|
|
689
|
+
reasonUnknown: solver.reasonUnknown,
|
|
653
690
|
};
|
|
654
691
|
});
|
|
655
692
|
if (found !== undefined) return found;
|
|
@@ -659,38 +696,45 @@ export const runSmtlibScript = (
|
|
|
659
696
|
context: kernel.context,
|
|
660
697
|
model: undefined,
|
|
661
698
|
core: undefined,
|
|
699
|
+
reasonUnknown: undefined,
|
|
662
700
|
};
|
|
701
|
+
const solved = solveAssuming(
|
|
702
|
+
state.manager,
|
|
703
|
+
getNamedAssertions(),
|
|
704
|
+
assumptions,
|
|
705
|
+
getKernelParams(),
|
|
706
|
+
);
|
|
663
707
|
return {
|
|
664
|
-
...
|
|
708
|
+
...solved,
|
|
665
709
|
model: undefined,
|
|
666
710
|
core: undefined,
|
|
711
|
+
reasonUnknown: solved.context.getLastFailureMessage(),
|
|
667
712
|
};
|
|
668
713
|
};
|
|
669
|
-
let pendingText = "";
|
|
670
714
|
const printDiagnostic = (line: string) => print(line, !settings.isDiagnosticOnStdout);
|
|
671
715
|
const write = (text: string, isDiagnostic: boolean) => {
|
|
672
|
-
const lines =
|
|
673
|
-
|
|
716
|
+
const lines = text.split("\n");
|
|
717
|
+
const rest = lines.pop() ?? "";
|
|
674
718
|
for (const line of lines) (isDiagnostic ? printDiagnostic : print)(line);
|
|
719
|
+
pendingText += rest;
|
|
675
720
|
};
|
|
676
721
|
const getSetup = () => ({
|
|
677
|
-
logic:
|
|
722
|
+
logic: state.logic,
|
|
678
723
|
isAutoConfig:
|
|
679
724
|
settings.parameters.get("auto_config") !== "false" &&
|
|
680
725
|
settings.parameters.get("smt.auto_config") !== "false",
|
|
681
726
|
});
|
|
682
727
|
const getTacticEnvironment = () => ({
|
|
683
|
-
manager:
|
|
728
|
+
manager: state.manager,
|
|
684
729
|
isMbqi: settings.isMbqi,
|
|
685
730
|
mbqiMaxIterations: settings.mbqiMaxIterations,
|
|
686
731
|
isFindingMacros: settings.isFindingMacros,
|
|
687
732
|
setup: getSetup(),
|
|
688
733
|
write,
|
|
689
734
|
parameters: settings.parameters,
|
|
690
|
-
hasDefinitions: () =>
|
|
735
|
+
hasDefinitions: () => state.reader.hasDefinitions(),
|
|
691
736
|
});
|
|
692
737
|
const getDatalog = () => {
|
|
693
|
-
const state = script.state;
|
|
694
738
|
state.datalog ??= createDatalogContext(
|
|
695
739
|
state.manager,
|
|
696
740
|
settings.parameters,
|
|
@@ -701,7 +745,6 @@ export const runSmtlibScript = (
|
|
|
701
745
|
const getTactic = (sexpr: SExpr, end: SmtList["end"]) =>
|
|
702
746
|
compileTactic(getTacticEnvironment(), sexpr, end);
|
|
703
747
|
const getGoal = (isTrackingDependencies = false) => {
|
|
704
|
-
const state = script.state;
|
|
705
748
|
const goal = new Goal(state.manager);
|
|
706
749
|
goal.isProofsEnabled = settings.isProducingProofs || state.isProofsEnabled === true;
|
|
707
750
|
goal.isCoresEnabled = settings.isProducingUnsatCores;
|
|
@@ -714,11 +757,18 @@ export const runSmtlibScript = (
|
|
|
714
757
|
);
|
|
715
758
|
return goal;
|
|
716
759
|
};
|
|
717
|
-
const hasNames = () =>
|
|
718
|
-
|
|
719
|
-
|
|
760
|
+
const hasNames = () => state.names.some((name) => name !== -1);
|
|
761
|
+
// parse_check_sat shrinks the expression stack once the check has run.
|
|
762
|
+
const checkSatAssuming = (items: SmtList["items"]) => {
|
|
763
|
+
const literals: number[] = [];
|
|
764
|
+
try {
|
|
765
|
+
for (const item of items) literals.push(state.reader.parseFormula(item));
|
|
766
|
+
checkSat(literals);
|
|
767
|
+
} finally {
|
|
768
|
+
for (const literal of literals) state.manager.decRef(literal);
|
|
769
|
+
}
|
|
770
|
+
};
|
|
720
771
|
const addObjective = (list: SmtList, isMax: boolean) => {
|
|
721
|
-
const state = script.state;
|
|
722
772
|
const term = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
723
773
|
const sort = state.manager.sorts[term];
|
|
724
774
|
if (sort !== SORT_INT && sort !== SORT_REAL && !state.manager.isBvSort(sort))
|
|
@@ -734,7 +784,6 @@ export const runSmtlibScript = (
|
|
|
734
784
|
});
|
|
735
785
|
};
|
|
736
786
|
const releaseObjectives = (size: number, softSize: number) => {
|
|
737
|
-
const state = script.state;
|
|
738
787
|
for (const index of state.softTrail.splice(softSize).reverse()) {
|
|
739
788
|
const objective = state.objectives[index];
|
|
740
789
|
state.manager.decRef(objective.terms.pop() as number);
|
|
@@ -744,13 +793,11 @@ export const runSmtlibScript = (
|
|
|
744
793
|
if (objective.type !== O_MAXSMT) state.manager.decRef(objective.term);
|
|
745
794
|
};
|
|
746
795
|
const restoreAssertions = (size: number) => {
|
|
747
|
-
const state = script.state;
|
|
748
796
|
for (const assertion of state.assertions.splice(size)) state.manager.decRef(assertion);
|
|
749
797
|
for (const name of state.names.splice(size)) if (name !== -1) state.manager.decRef(name);
|
|
750
798
|
state.assertionTexts.length = size;
|
|
751
799
|
};
|
|
752
800
|
const instantiate = (list: SmtList, isNested: boolean) => {
|
|
753
|
-
const state = script.state;
|
|
754
801
|
const manager = state.manager;
|
|
755
802
|
const outer = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
756
803
|
if (manager.kinds[outer] !== KIND_QUANTIFIER)
|
|
@@ -781,700 +828,858 @@ export const runSmtlibScript = (
|
|
|
781
828
|
manager.decRef(result);
|
|
782
829
|
manager.decRef(substituted);
|
|
783
830
|
};
|
|
784
|
-
|
|
785
|
-
|
|
786
|
-
|
|
787
|
-
|
|
788
|
-
const
|
|
789
|
-
|
|
790
|
-
if (logicError !== undefined) {
|
|
791
|
-
state.manager.decRef(assertion.formula);
|
|
792
|
-
throw new SmtParseError(logicError, list.end);
|
|
793
|
-
}
|
|
794
|
-
state.assertions.push(assertion.formula);
|
|
795
|
-
state.assertionTexts.push(
|
|
796
|
-
text.slice(term.offset, (term.kind === "list" ? term.end : term).endOffset).trim(),
|
|
797
|
-
);
|
|
798
|
-
if (state.hasChecked) state.isIncremental = true;
|
|
799
|
-
resetOptimizer();
|
|
800
|
-
if (!settings.isProducingUnsatCores || assertion.name === undefined) state.names.push(-1);
|
|
801
|
-
else {
|
|
802
|
-
const manager = state.manager;
|
|
803
|
-
const answer = manager.mkApp(
|
|
804
|
-
manager.mkFuncDecl(assertion.name, [], SORT_BOOL, true),
|
|
805
|
-
[],
|
|
806
|
-
SORT_BOOL,
|
|
807
|
-
);
|
|
808
|
-
manager.incRef(answer);
|
|
809
|
-
state.names.push(answer);
|
|
810
|
-
}
|
|
811
|
-
assertInKernel(assertion.formula, state.names[state.names.length - 1]);
|
|
812
|
-
clearCheck();
|
|
813
|
-
},
|
|
814
|
-
"check-sat": (list) => checkSat(parseFormulas(list.items.slice(1))),
|
|
815
|
-
"declare-rel": (list) => {
|
|
816
|
-
const state = script.state;
|
|
817
|
-
const name = list.items[1];
|
|
818
|
-
const domain = list.items[2];
|
|
819
|
-
if (!isSymbol(name) || domain?.kind !== "list")
|
|
820
|
-
throw new SmtParseError("at least 2 arguments expected", list.end);
|
|
821
|
-
const decl = state.manager.mkFuncDecl(
|
|
822
|
-
name.text,
|
|
823
|
-
domain.items.map((sort) => state.reader.parseSort(sort)),
|
|
824
|
-
SORT_BOOL,
|
|
825
|
-
);
|
|
826
|
-
state.reader.insertFunc(decl, list.end);
|
|
827
|
-
getDatalog().registerPredicate(decl);
|
|
828
|
-
},
|
|
829
|
-
"declare-var": (list) => {
|
|
830
|
-
const state = script.state;
|
|
831
|
-
const name = list.items[1];
|
|
832
|
-
const sort = list.items[2];
|
|
833
|
-
if (!isSymbol(name) || sort === undefined)
|
|
834
|
-
throw new SmtParseError("invalid declare-var command, symbol and sort expected", list.end);
|
|
835
|
-
const manager = state.manager;
|
|
836
|
-
const range = state.reader.parseSort(sort);
|
|
837
|
-
const decl = manager.mkFuncDecl(name.text, [], range);
|
|
838
|
-
state.reader.insertFunc(decl, list.end);
|
|
839
|
-
getDatalog().registerVariable(manager.mkApp(decl, [], range));
|
|
840
|
-
},
|
|
841
|
-
rule: (list) => {
|
|
842
|
-
const rule = list.items[1];
|
|
843
|
-
if (rule === undefined) throw new SmtParseError("invalid rule, expected formula", list.end);
|
|
844
|
-
const name = list.items[2];
|
|
845
|
-
getDatalog().addRule(script.state.reader.parseFormula(rule), isSymbol(name) ? name.text : "");
|
|
846
|
-
},
|
|
847
|
-
query: (list) => {
|
|
848
|
-
const state = script.state;
|
|
849
|
-
const target = list.items[1];
|
|
850
|
-
if (!isSymbol(target))
|
|
851
|
-
throw new SmtParseError("invalid query command, argument expected", list.end);
|
|
852
|
-
const decls = state.reader.getFuncs(target.text);
|
|
853
|
-
if (decls.length !== 1)
|
|
831
|
+
// parser::parse_func_decl_ref: a name, or a name with its signature. Z3 ends the message of an
|
|
832
|
+
// unexpected token with the last identifier it read.
|
|
833
|
+
const getFuncDeclRef = (reference: SExpr) => {
|
|
834
|
+
if (isSymbol(reference)) {
|
|
835
|
+
const decls = state.reader.getFuncs(reference.text);
|
|
836
|
+
if (decls.length > 1)
|
|
854
837
|
throw new SmtParseError(
|
|
855
|
-
`
|
|
856
|
-
|
|
838
|
+
`ambiguous function declaration reference, provide full signature to disambiguate (<symbol> (<sort>*) <sort>) ${reference.text}`,
|
|
839
|
+
reference,
|
|
857
840
|
);
|
|
858
|
-
|
|
859
|
-
const relation = decls[0];
|
|
860
|
-
if (!datalog.isPredicateDecl(relation))
|
|
841
|
+
if (decls.length === 0)
|
|
861
842
|
throw new SmtParseError(
|
|
862
|
-
|
|
863
|
-
|
|
843
|
+
`invalid function declaration reference, unknown function ${reference.text}`,
|
|
844
|
+
reference,
|
|
864
845
|
);
|
|
865
|
-
|
|
866
|
-
|
|
867
|
-
|
|
868
|
-
|
|
869
|
-
|
|
870
|
-
|
|
871
|
-
|
|
872
|
-
|
|
873
|
-
|
|
874
|
-
|
|
875
|
-
|
|
876
|
-
|
|
877
|
-
|
|
878
|
-
|
|
879
|
-
|
|
880
|
-
|
|
881
|
-
|
|
882
|
-
|
|
883
|
-
|
|
884
|
-
|
|
885
|
-
|
|
886
|
-
|
|
887
|
-
|
|
888
|
-
|
|
889
|
-
|
|
890
|
-
|
|
891
|
-
|
|
892
|
-
|
|
893
|
-
|
|
894
|
-
|
|
895
|
-
|
|
896
|
-
|
|
897
|
-
|
|
898
|
-
|
|
899
|
-
|
|
900
|
-
|
|
901
|
-
|
|
902
|
-
|
|
903
|
-
|
|
904
|
-
|
|
905
|
-
|
|
906
|
-
|
|
907
|
-
|
|
846
|
+
return decls[0];
|
|
847
|
+
}
|
|
848
|
+
const name = reference.kind === "list" ? (reference.items[0] ?? reference.end) : reference;
|
|
849
|
+
if (reference.kind !== "list" || name.kind !== "symbol") {
|
|
850
|
+
if (name.kind === "list")
|
|
851
|
+
throw new SmtUnsupportedError("an indexed function declaration reference");
|
|
852
|
+
throw new SmtParseError(
|
|
853
|
+
"invalid function declaration reference, symbol or '(' expected got query",
|
|
854
|
+
name,
|
|
855
|
+
);
|
|
856
|
+
}
|
|
857
|
+
const domain = reference.items[1] ?? reference.end;
|
|
858
|
+
if (domain.kind !== "list")
|
|
859
|
+
throw new SmtParseError(
|
|
860
|
+
`Invalid function name. Expecting sort list starting with '(' to disambiguate function name got ${domain.kind === "symbol" || domain.kind === "keyword" ? domain.text : name.text}`,
|
|
861
|
+
domain,
|
|
862
|
+
);
|
|
863
|
+
const sorts = domain.items.map((sort) => state.reader.parseSort(sort));
|
|
864
|
+
if (reference.items[2] === undefined)
|
|
865
|
+
throw new SmtParseError("Invalid function name invalid sort, unexpected ')'", reference.end);
|
|
866
|
+
const range = state.reader.parseSort(reference.items[2]);
|
|
867
|
+
const follower = reference.items[3] ?? reference.end;
|
|
868
|
+
const found = state.reader.getFuncs(name.text).find((decl) => {
|
|
869
|
+
const funcDecl = state.manager.funcDecls[decl];
|
|
870
|
+
return (
|
|
871
|
+
funcDecl.range === range &&
|
|
872
|
+
funcDecl.domain.length === sorts.length &&
|
|
873
|
+
funcDecl.domain.every((sort, index) => sort === sorts[index])
|
|
874
|
+
);
|
|
875
|
+
});
|
|
876
|
+
if (found === undefined)
|
|
877
|
+
throw new SmtParseError(
|
|
878
|
+
`invalid function declaration reference, unknown indexed function ${name.text}`,
|
|
879
|
+
follower,
|
|
880
|
+
);
|
|
881
|
+
if (follower !== reference.end)
|
|
882
|
+
throw new SmtUnsupportedError("a function declaration reference with trailing terms");
|
|
883
|
+
return found;
|
|
884
|
+
};
|
|
885
|
+
const runCommand = new Map<string, (list: SmtList) => void>([
|
|
886
|
+
[
|
|
887
|
+
"assert",
|
|
888
|
+
(list) => {
|
|
889
|
+
const term = list.items[1] ?? list.end;
|
|
890
|
+
const assertion = state.reader.parseAssertion(term);
|
|
891
|
+
const logicError = state.reader.getLogicError(assertion.formula);
|
|
892
|
+
if (logicError !== undefined) {
|
|
893
|
+
state.manager.decRef(assertion.formula);
|
|
894
|
+
throw new SmtParseError(logicError, list.end);
|
|
895
|
+
}
|
|
896
|
+
state.assertions.push(assertion.formula);
|
|
897
|
+
state.assertionTexts.push(
|
|
898
|
+
text.slice(term.offset, (term.kind === "list" ? term.end : term).endOffset).trim(),
|
|
908
899
|
);
|
|
909
|
-
|
|
910
|
-
|
|
911
|
-
|
|
912
|
-
|
|
913
|
-
|
|
914
|
-
|
|
915
|
-
|
|
916
|
-
|
|
917
|
-
|
|
918
|
-
|
|
919
|
-
|
|
920
|
-
|
|
921
|
-
|
|
922
|
-
|
|
923
|
-
|
|
924
|
-
|
|
925
|
-
|
|
926
|
-
|
|
927
|
-
|
|
928
|
-
|
|
929
|
-
|
|
930
|
-
|
|
931
|
-
|
|
932
|
-
if (
|
|
933
|
-
|
|
934
|
-
|
|
935
|
-
|
|
936
|
-
|
|
937
|
-
|
|
938
|
-
|
|
939
|
-
|
|
940
|
-
|
|
941
|
-
|
|
942
|
-
|
|
943
|
-
|
|
900
|
+
if (state.hasChecked) state.isIncremental = true;
|
|
901
|
+
resetOptimizer();
|
|
902
|
+
if (!settings.isProducingUnsatCores || assertion.name === undefined) state.names.push(-1);
|
|
903
|
+
else {
|
|
904
|
+
const manager = state.manager;
|
|
905
|
+
const answer = manager.mkApp(
|
|
906
|
+
manager.mkFuncDecl(assertion.name, [], SORT_BOOL, true),
|
|
907
|
+
[],
|
|
908
|
+
SORT_BOOL,
|
|
909
|
+
);
|
|
910
|
+
manager.incRef(answer);
|
|
911
|
+
state.names.push(answer);
|
|
912
|
+
}
|
|
913
|
+
assertInKernel(assertion.formula, state.names[state.names.length - 1]);
|
|
914
|
+
clearCheck();
|
|
915
|
+
},
|
|
916
|
+
],
|
|
917
|
+
["check-sat", (list) => checkSatAssuming(list.items.slice(1))],
|
|
918
|
+
[
|
|
919
|
+
"declare-rel",
|
|
920
|
+
(list) => {
|
|
921
|
+
const name = list.items[1];
|
|
922
|
+
const domain = list.items[2];
|
|
923
|
+
if (!isSymbol(name) || domain?.kind !== "list")
|
|
924
|
+
throw new SmtParseError("at least 2 arguments expected", list.end);
|
|
925
|
+
const decl = state.manager.mkFuncDecl(
|
|
926
|
+
name.text,
|
|
927
|
+
domain.items.map((sort) => state.reader.parseSort(sort)),
|
|
928
|
+
SORT_BOOL,
|
|
929
|
+
);
|
|
930
|
+
state.reader.insertFunc(decl, list.end);
|
|
931
|
+
getDatalog().registerPredicate(decl);
|
|
932
|
+
},
|
|
933
|
+
],
|
|
934
|
+
[
|
|
935
|
+
"declare-var",
|
|
936
|
+
(list) => {
|
|
937
|
+
const name = list.items[1];
|
|
938
|
+
const sort = list.items[2];
|
|
939
|
+
if (!isSymbol(name) || sort === undefined)
|
|
940
|
+
throw new SmtParseError(
|
|
941
|
+
"invalid declare-var command, symbol and sort expected",
|
|
942
|
+
list.end,
|
|
943
|
+
);
|
|
944
|
+
const manager = state.manager;
|
|
945
|
+
const range = state.reader.parseSort(sort);
|
|
946
|
+
const decl = manager.mkFuncDecl(name.text, [], range);
|
|
947
|
+
state.reader.insertFunc(decl, list.end);
|
|
948
|
+
getDatalog().registerVariable(manager.mkApp(decl, [], range));
|
|
949
|
+
},
|
|
950
|
+
],
|
|
951
|
+
[
|
|
952
|
+
"rule",
|
|
953
|
+
(list) => {
|
|
954
|
+
const rule = list.items[1];
|
|
955
|
+
if (rule === undefined) throw new SmtParseError("invalid rule, expected formula", list.end);
|
|
956
|
+
const name = list.items[2];
|
|
957
|
+
getDatalog().addRule(state.reader.parseFormula(rule), isSymbol(name) ? name.text : "");
|
|
958
|
+
},
|
|
959
|
+
],
|
|
960
|
+
[
|
|
961
|
+
"query",
|
|
962
|
+
(list) => {
|
|
963
|
+
if (list.items[1] === undefined)
|
|
964
|
+
throw new SmtParseError("invalid query command, argument expected", list.end);
|
|
965
|
+
const relation = getFuncDeclRef(list.items[1]);
|
|
966
|
+
const datalog = getDatalog();
|
|
967
|
+
// dl_query_cmd::set_next_arg runs once the parser is past the reference.
|
|
968
|
+
const follower = list.items[2] ?? list.end;
|
|
969
|
+
if (!datalog.isPredicateDecl(relation))
|
|
970
|
+
throw new SmtParseError(
|
|
971
|
+
"Invalid query argument, expected a predicate registered as a relation",
|
|
972
|
+
follower,
|
|
973
|
+
);
|
|
974
|
+
if (follower.kind !== "keyword" && follower !== list.end)
|
|
975
|
+
throw new SmtParseError("invalid command argument, keyword expected", follower);
|
|
976
|
+
for (const assertion of state.assertions) datalog.assertExpr(assertion);
|
|
977
|
+
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
978
|
+
state.manager.limit.push(settings.rlimit);
|
|
979
|
+
let status = L_UNDEF;
|
|
980
|
+
try {
|
|
981
|
+
status = datalog.relQuery(relation);
|
|
982
|
+
} catch (error) {
|
|
983
|
+
if (!(error instanceof SmtTacticError)) throw error;
|
|
984
|
+
print(`(error "query failed: ${error.message}")`);
|
|
985
|
+
} finally {
|
|
986
|
+
state.manager.limit.pop();
|
|
987
|
+
}
|
|
988
|
+
print(status === L_UNDEF && datalog.isBounded ? "bounded" : getVerdict(status));
|
|
989
|
+
datalog.isBounded = false;
|
|
990
|
+
},
|
|
991
|
+
],
|
|
992
|
+
[
|
|
993
|
+
"check-sat-using",
|
|
994
|
+
(list) => {
|
|
995
|
+
const params = getCommandParams(list.items, CHECK_SAT_USING_PARAMETERS);
|
|
996
|
+
if (list.items[1] === undefined)
|
|
997
|
+
throw new SmtParseError("check-sat-using needs a tactic argument", list.end);
|
|
998
|
+
const builder = getTactic(list.items[1], list.end);
|
|
999
|
+
const tactic = builder.build(params);
|
|
1000
|
+
clearCheck();
|
|
1001
|
+
const deadline = Date.now() + options.timeLimitMs;
|
|
1002
|
+
state.manager.limit.restart(deadline);
|
|
1003
|
+
state.manager.limit.push(settings.rlimit);
|
|
1004
|
+
try {
|
|
1005
|
+
const checked = checkSatUsing(tactic, getGoal(builder.isTrackingDependencies));
|
|
1006
|
+
setCheck(checked.status, {
|
|
1007
|
+
model: checked.model,
|
|
1008
|
+
core:
|
|
1009
|
+
builder.isTrackingDependencies || !hasNames()
|
|
1010
|
+
? getDependencyValues(checked.core)
|
|
1011
|
+
: undefined,
|
|
1012
|
+
reasonUnknown: checked.reasonUnknown ?? getCancelMessage(deadline),
|
|
1013
|
+
});
|
|
1014
|
+
print(getVerdict(checked.status));
|
|
1015
|
+
} finally {
|
|
1016
|
+
state.manager.limit.pop();
|
|
1017
|
+
}
|
|
1018
|
+
},
|
|
1019
|
+
],
|
|
1020
|
+
[
|
|
1021
|
+
"check-sat-assuming",
|
|
1022
|
+
(list) => {
|
|
1023
|
+
const literals = list.items[1];
|
|
1024
|
+
if (literals?.kind !== "list")
|
|
1025
|
+
throw new SmtParseError(
|
|
1026
|
+
"invalid check-sat-assuming command, '(' expected",
|
|
1027
|
+
literals ?? list.end,
|
|
1028
|
+
);
|
|
1029
|
+
checkSatAssuming(literals.items);
|
|
1030
|
+
},
|
|
1031
|
+
],
|
|
1032
|
+
[
|
|
1033
|
+
"get-consequences",
|
|
1034
|
+
(list) => {
|
|
1035
|
+
const manager = state.manager;
|
|
1036
|
+
const [assumptions, vars] = [list.items[1], list.items[2]].map((terms) => {
|
|
1037
|
+
if (terms === undefined)
|
|
1038
|
+
throw new SmtParseError("invalid command, argument(s) missing", list.end);
|
|
1039
|
+
if (terms.kind !== "list")
|
|
1040
|
+
throw new SmtParseError("invalid list of terms, '(' expected", terms);
|
|
1041
|
+
return terms.items.map((item) => state.reader.parseTerm(item));
|
|
1042
|
+
});
|
|
1043
|
+
if (list.items.length > 3)
|
|
1044
|
+
throw new SmtParseError("invalid command, too many arguments", list.items[3]);
|
|
1045
|
+
clearCheck();
|
|
1046
|
+
const deadline = Date.now() + options.timeLimitMs;
|
|
1047
|
+
manager.limit.restart(deadline);
|
|
1048
|
+
manager.limit.push(settings.rlimit);
|
|
1049
|
+
const names = state.names.filter((name) => name !== -1);
|
|
1050
|
+
try {
|
|
1051
|
+
if (isUsingFdSolver()) {
|
|
1052
|
+
if (names.length > 0)
|
|
1053
|
+
throw new SmtUnsupportedError("the named assertions of the finite-domain solver");
|
|
1054
|
+
const found = getFdConsequences(
|
|
1055
|
+
manager,
|
|
1056
|
+
new Map(),
|
|
1057
|
+
state.assertions,
|
|
1058
|
+
assumptions,
|
|
1059
|
+
vars,
|
|
1060
|
+
);
|
|
1061
|
+
setCheck(found.result, {
|
|
1062
|
+
model: found.model,
|
|
1063
|
+
core: found.core,
|
|
1064
|
+
reasonUnknown: found.reasonUnknown,
|
|
1065
|
+
});
|
|
1066
|
+
print(getVerdict(found.result));
|
|
1067
|
+
print("");
|
|
1068
|
+
for (const consequence of found.consequences.items) display(consequence);
|
|
1069
|
+
found.consequences.reset();
|
|
1070
|
+
return;
|
|
1071
|
+
}
|
|
1072
|
+
const kernel = state.kernel ?? new SmtKernel(manager, getKernelParams());
|
|
1073
|
+
if (state.kernel === undefined)
|
|
1074
|
+
for (const assertion of getNamedAssertions()) kernel.assertExpr(assertion);
|
|
1075
|
+
const found = getConsequences(kernel, [...names, ...assumptions], vars);
|
|
1076
|
+
setCheck(found.result, {
|
|
1077
|
+
context: kernel.context,
|
|
1078
|
+
core: kernel.context.unsatCore,
|
|
1079
|
+
reasonUnknown: kernel.context.getLastFailureMessage(),
|
|
1080
|
+
});
|
|
944
1081
|
print(getVerdict(found.result));
|
|
945
1082
|
print("");
|
|
946
1083
|
for (const consequence of found.consequences.items) display(consequence);
|
|
947
1084
|
found.consequences.reset();
|
|
948
|
-
|
|
1085
|
+
} catch (error) {
|
|
1086
|
+
if (!(error instanceof SmtCanceledError || isStackOverflow(error))) throw error;
|
|
1087
|
+
const reasonUnknown = getCancelMessage(deadline);
|
|
1088
|
+
if (state.kernel !== undefined) state.kernel.context.reasonUnknown = reasonUnknown;
|
|
1089
|
+
setCheck(L_UNDEF, { reasonUnknown });
|
|
1090
|
+
print("unknown");
|
|
1091
|
+
print("");
|
|
1092
|
+
} finally {
|
|
1093
|
+
manager.limit.pop();
|
|
949
1094
|
}
|
|
950
|
-
|
|
951
|
-
|
|
952
|
-
|
|
953
|
-
|
|
954
|
-
|
|
955
|
-
|
|
956
|
-
|
|
957
|
-
|
|
958
|
-
|
|
959
|
-
|
|
960
|
-
|
|
961
|
-
|
|
962
|
-
|
|
963
|
-
|
|
964
|
-
found.consequences.reset();
|
|
965
|
-
} finally {
|
|
966
|
-
manager.limit.pop();
|
|
967
|
-
}
|
|
968
|
-
},
|
|
969
|
-
minimize: (list) => addObjective(list, false),
|
|
970
|
-
maximize: (list) => addObjective(list, true),
|
|
971
|
-
"assert-soft": (list) => {
|
|
972
|
-
const state = script.state;
|
|
973
|
-
const formula = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
974
|
-
if (state.manager.sorts[formula] !== SORT_BOOL)
|
|
975
|
-
throw new SmtParseError("Invalid type for expression. Expected Boolean type.", list.end);
|
|
976
|
-
const parameters = getSoftParameters(list.items.slice(2));
|
|
977
|
-
resetOptimizer();
|
|
978
|
-
const existing = state.objectives.findIndex(
|
|
979
|
-
(objective) => objective.type === O_MAXSMT && objective.id === parameters.id,
|
|
980
|
-
);
|
|
981
|
-
const index = existing === -1 ? state.objectives.length : existing;
|
|
982
|
-
if (existing === -1)
|
|
983
|
-
state.objectives.push({
|
|
984
|
-
type: O_MAXSMT,
|
|
985
|
-
term: -1,
|
|
986
|
-
terms: [],
|
|
987
|
-
weights: [],
|
|
988
|
-
id: parameters.id,
|
|
989
|
-
});
|
|
990
|
-
if (parameters.weight.isZero()) return;
|
|
991
|
-
state.manager.incRef(formula);
|
|
992
|
-
state.objectives[index].terms.push(formula);
|
|
993
|
-
state.objectives[index].weights.push(parameters.weight);
|
|
994
|
-
state.softTrail.push(index);
|
|
995
|
-
},
|
|
996
|
-
push: (list) => {
|
|
997
|
-
const state = script.state;
|
|
998
|
-
clearCheck();
|
|
999
|
-
for (let index = getScopeCount(list); index > 0; index--) {
|
|
1000
|
-
state.scopes.push({
|
|
1001
|
-
assertions: state.assertions.length,
|
|
1002
|
-
objectives: state.objectives.length,
|
|
1003
|
-
softTrail: state.softTrail.length,
|
|
1004
|
-
});
|
|
1005
|
-
state.reader.push();
|
|
1006
|
-
state.isIncremental = true;
|
|
1007
|
-
state.kernel?.push();
|
|
1008
|
-
useEufSolver((solver) => solver.push());
|
|
1009
|
-
}
|
|
1010
|
-
},
|
|
1011
|
-
pop: (list) => {
|
|
1012
|
-
const state = script.state;
|
|
1013
|
-
const count = getScopeCount(list);
|
|
1014
|
-
if (count > state.scopes.length)
|
|
1015
|
-
throw new SmtParseError(
|
|
1016
|
-
"invalid pop command, argument is greater than the current stack depth",
|
|
1017
|
-
list.end,
|
|
1095
|
+
},
|
|
1096
|
+
],
|
|
1097
|
+
["minimize", (list) => addObjective(list, false)],
|
|
1098
|
+
["maximize", (list) => addObjective(list, true)],
|
|
1099
|
+
[
|
|
1100
|
+
"assert-soft",
|
|
1101
|
+
(list) => {
|
|
1102
|
+
const formula = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1103
|
+
if (state.manager.sorts[formula] !== SORT_BOOL)
|
|
1104
|
+
throw new SmtParseError("Invalid type for expression. Expected Boolean type.", list.end);
|
|
1105
|
+
const parameters = getSoftParameters(list.items.slice(2));
|
|
1106
|
+
resetOptimizer();
|
|
1107
|
+
const existing = state.objectives.findIndex(
|
|
1108
|
+
(objective) => objective.type === O_MAXSMT && objective.id === parameters.id,
|
|
1018
1109
|
);
|
|
1019
|
-
|
|
1020
|
-
|
|
1021
|
-
|
|
1022
|
-
|
|
1023
|
-
|
|
1024
|
-
|
|
1025
|
-
|
|
1026
|
-
|
|
1027
|
-
|
|
1028
|
-
|
|
1029
|
-
|
|
1030
|
-
|
|
1031
|
-
|
|
1032
|
-
|
|
1033
|
-
|
|
1034
|
-
|
|
1035
|
-
|
|
1036
|
-
|
|
1037
|
-
|
|
1038
|
-
|
|
1039
|
-
|
|
1040
|
-
|
|
1041
|
-
|
|
1042
|
-
|
|
1043
|
-
|
|
1044
|
-
|
|
1045
|
-
|
|
1110
|
+
const index = existing === -1 ? state.objectives.length : existing;
|
|
1111
|
+
if (existing === -1)
|
|
1112
|
+
state.objectives.push({
|
|
1113
|
+
type: O_MAXSMT,
|
|
1114
|
+
term: -1,
|
|
1115
|
+
terms: [],
|
|
1116
|
+
weights: [],
|
|
1117
|
+
id: parameters.id,
|
|
1118
|
+
});
|
|
1119
|
+
if (parameters.weight.isZero()) return;
|
|
1120
|
+
state.manager.incRef(formula);
|
|
1121
|
+
state.objectives[index].terms.push(formula);
|
|
1122
|
+
state.objectives[index].weights.push(parameters.weight);
|
|
1123
|
+
state.softTrail.push(index);
|
|
1124
|
+
},
|
|
1125
|
+
],
|
|
1126
|
+
[
|
|
1127
|
+
"push",
|
|
1128
|
+
(list) => {
|
|
1129
|
+
clearCheck();
|
|
1130
|
+
for (let index = getScopeCount(list); index > 0; index--) {
|
|
1131
|
+
state.scopes.push({
|
|
1132
|
+
assertions: state.assertions.length,
|
|
1133
|
+
objectives: state.objectives.length,
|
|
1134
|
+
softTrail: state.softTrail.length,
|
|
1135
|
+
});
|
|
1136
|
+
state.reader.push();
|
|
1137
|
+
state.isIncremental = true;
|
|
1046
1138
|
state.kernel?.push();
|
|
1047
1139
|
useEufSolver((solver) => solver.push());
|
|
1048
1140
|
}
|
|
1049
|
-
}
|
|
1050
|
-
|
|
1051
|
-
|
|
1052
|
-
|
|
1053
|
-
|
|
1054
|
-
|
|
1055
|
-
|
|
1056
|
-
|
|
1057
|
-
|
|
1058
|
-
|
|
1059
|
-
|
|
1060
|
-
|
|
1061
|
-
|
|
1062
|
-
|
|
1063
|
-
|
|
1064
|
-
|
|
1065
|
-
|
|
1066
|
-
|
|
1067
|
-
|
|
1068
|
-
|
|
1069
|
-
|
|
1141
|
+
},
|
|
1142
|
+
],
|
|
1143
|
+
[
|
|
1144
|
+
"pop",
|
|
1145
|
+
(list) => {
|
|
1146
|
+
const count = getScopeCount(list);
|
|
1147
|
+
if (count > state.scopes.length)
|
|
1148
|
+
throw new SmtParseError(
|
|
1149
|
+
"invalid pop command, argument is greater than the current stack depth",
|
|
1150
|
+
list.end,
|
|
1151
|
+
);
|
|
1152
|
+
clearCheck();
|
|
1153
|
+
if (count === 0) return;
|
|
1154
|
+
state.isIncremental = true;
|
|
1155
|
+
const scope = state.scopes[state.scopes.length - count];
|
|
1156
|
+
state.kernel?.pop(count);
|
|
1157
|
+
useEufSolver((solver) => solver.pop(count));
|
|
1158
|
+
for (let index = 0; index < count; index++) state.reader.pop();
|
|
1159
|
+
restoreAssertions(scope.assertions);
|
|
1160
|
+
resetOptimizer();
|
|
1161
|
+
releaseObjectives(scope.objectives, scope.softTrail);
|
|
1162
|
+
state.scopes.length -= count;
|
|
1163
|
+
},
|
|
1164
|
+
],
|
|
1165
|
+
[
|
|
1166
|
+
"reset",
|
|
1167
|
+
() => {
|
|
1168
|
+
clearCheck();
|
|
1169
|
+
resetOptimizer();
|
|
1170
|
+
state = createState();
|
|
1171
|
+
},
|
|
1172
|
+
],
|
|
1173
|
+
[
|
|
1174
|
+
"reset-assertions",
|
|
1175
|
+
() => {
|
|
1176
|
+
clearCheck();
|
|
1177
|
+
restoreAssertions(0);
|
|
1178
|
+
resetOptimizer();
|
|
1179
|
+
releaseObjectives(0, 0);
|
|
1180
|
+
state.scopes = state.scopes.map(() => ({ assertions: 0, objectives: 0, softTrail: 0 }));
|
|
1181
|
+
if (state.isProofsEnabled !== undefined) resetKernel();
|
|
1182
|
+
state.isIncremental = state.scopes.length > 0;
|
|
1183
|
+
state.hasChecked = false;
|
|
1184
|
+
},
|
|
1185
|
+
],
|
|
1186
|
+
[
|
|
1187
|
+
"simplify",
|
|
1188
|
+
(list) => {
|
|
1189
|
+
const manager = state.manager;
|
|
1190
|
+
if (list.items.length < 2)
|
|
1191
|
+
throw new SmtParseError("invalid simplify command, argument expected", list.end);
|
|
1192
|
+
const term = state.reader.parseTerm(list.items[1]);
|
|
1193
|
+
manager.incRef(term);
|
|
1194
|
+
const rewriter = new Rewriter(
|
|
1195
|
+
manager,
|
|
1196
|
+
getRewriterOptions(manager, getSimplifyParams(list.items.slice(2))),
|
|
1197
|
+
);
|
|
1198
|
+
const simplified = rewriter.rewrite(term);
|
|
1199
|
+
rewriter.cleanup();
|
|
1200
|
+
display(simplified);
|
|
1201
|
+
rewriter.release();
|
|
1202
|
+
manager.decRef(simplified);
|
|
1203
|
+
manager.decRef(term);
|
|
1204
|
+
},
|
|
1205
|
+
],
|
|
1070
1206
|
// The Boolean rewriter alone matches the simplifier only on Boolean structure over constants.
|
|
1071
|
-
|
|
1072
|
-
|
|
1073
|
-
|
|
1074
|
-
throw new SmtParseError("invalid command, one argument expected", list.end);
|
|
1075
|
-
const term = script.state.reader.parseTerm(list.items[1]);
|
|
1076
|
-
manager.incRef(term);
|
|
1077
|
-
const visited = new Set<number>();
|
|
1078
|
-
const todo = [term];
|
|
1079
|
-
while (todo.length > 0) {
|
|
1080
|
-
const expr = todo.pop() as number;
|
|
1081
|
-
if (visited.has(expr)) continue;
|
|
1082
|
-
visited.add(expr);
|
|
1083
|
-
const family = manager.kinds[expr] === KIND_APP ? manager.getFamily(expr) : -1;
|
|
1084
|
-
if (family !== FAMILY_BASIC && family !== FAMILY_USER && !manager.isNumeral(expr))
|
|
1085
|
-
throw new SmtUnsupportedError("the command dbg-bool-flat-rewriter beyond Boolean terms");
|
|
1086
|
-
manager.pushArgs(expr, todo);
|
|
1087
|
-
}
|
|
1088
|
-
const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
|
|
1089
|
-
const rewritten = rewriter.rewrite(term);
|
|
1090
|
-
display(rewritten);
|
|
1091
|
-
rewriter.release();
|
|
1092
|
-
manager.decRef(rewritten);
|
|
1093
|
-
manager.decRef(term);
|
|
1094
|
-
},
|
|
1095
|
-
apply: (list) => {
|
|
1096
|
-
const state = script.state;
|
|
1097
|
-
const params = getCommandParams(list.items, APPLY_PARAMETERS);
|
|
1098
|
-
if (list.items[1] === undefined)
|
|
1099
|
-
throw new SmtParseError("apply needs a tactic argument", list.end);
|
|
1100
|
-
const builder = getTactic(list.items[1], list.end);
|
|
1101
|
-
const tactic = builder.build(params);
|
|
1102
|
-
const isPrintingDependencies = params.get("print_dependencies") === true;
|
|
1103
|
-
if (isPrintingDependencies && !builder.isTrackingDependencies && hasNames())
|
|
1104
|
-
throw new SmtUnsupportedError("the dependencies of a tactic that drops dependencies");
|
|
1105
|
-
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
1106
|
-
const input = getGoal(builder.isTrackingDependencies);
|
|
1107
|
-
const goals = (() => {
|
|
1108
|
-
try {
|
|
1109
|
-
return applyTactic(tactic, input);
|
|
1110
|
-
} catch (error) {
|
|
1111
|
-
if (!(error instanceof SmtTacticError)) throw error;
|
|
1112
|
-
print(`(error "tactic failed: ${error.message}")`);
|
|
1113
|
-
return undefined;
|
|
1114
|
-
}
|
|
1115
|
-
})();
|
|
1116
|
-
// apply_tactic_cmd releases the result goals and then the input goal.
|
|
1117
|
-
if (goals === undefined) {
|
|
1118
|
-
input.reset();
|
|
1119
|
-
return;
|
|
1120
|
-
}
|
|
1121
|
-
try {
|
|
1207
|
+
[
|
|
1208
|
+
"dbg-bool-flat-rewriter",
|
|
1209
|
+
(list) => {
|
|
1122
1210
|
const manager = state.manager;
|
|
1123
|
-
|
|
1124
|
-
|
|
1125
|
-
|
|
1126
|
-
|
|
1127
|
-
|
|
1128
|
-
|
|
1129
|
-
|
|
1130
|
-
|
|
1131
|
-
|
|
1132
|
-
|
|
1133
|
-
|
|
1134
|
-
|
|
1135
|
-
|
|
1136
|
-
|
|
1137
|
-
|
|
1138
|
-
|
|
1139
|
-
|
|
1140
|
-
|
|
1141
|
-
|
|
1142
|
-
|
|
1143
|
-
|
|
1144
|
-
|
|
1145
|
-
|
|
1146
|
-
|
|
1147
|
-
|
|
1148
|
-
|
|
1149
|
-
|
|
1150
|
-
|
|
1151
|
-
|
|
1211
|
+
if (list.items.length !== 2)
|
|
1212
|
+
throw new SmtParseError("invalid command, one argument expected", list.end);
|
|
1213
|
+
const term = state.reader.parseTerm(list.items[1]);
|
|
1214
|
+
manager.incRef(term);
|
|
1215
|
+
const visited = new Set<number>();
|
|
1216
|
+
const todo = [term];
|
|
1217
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
1218
|
+
if (visited.has(expr)) continue;
|
|
1219
|
+
visited.add(expr);
|
|
1220
|
+
const family = manager.kinds[expr] === KIND_APP ? manager.getFamily(expr) : -1;
|
|
1221
|
+
if (family !== FAMILY_BASIC && family !== FAMILY_USER && !manager.isNumeral(expr))
|
|
1222
|
+
throw new SmtUnsupportedError(
|
|
1223
|
+
"the command dbg-bool-flat-rewriter beyond Boolean terms",
|
|
1224
|
+
);
|
|
1225
|
+
manager.pushArgs(expr, todo);
|
|
1226
|
+
}
|
|
1227
|
+
const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
|
|
1228
|
+
const rewritten = rewriter.rewrite(term);
|
|
1229
|
+
display(rewritten);
|
|
1230
|
+
rewriter.release();
|
|
1231
|
+
manager.decRef(rewritten);
|
|
1232
|
+
manager.decRef(term);
|
|
1233
|
+
},
|
|
1234
|
+
],
|
|
1235
|
+
[
|
|
1236
|
+
"apply",
|
|
1237
|
+
(list) => {
|
|
1238
|
+
const params = getCommandParams(list.items, APPLY_PARAMETERS);
|
|
1239
|
+
if (list.items[1] === undefined)
|
|
1240
|
+
throw new SmtParseError("apply needs a tactic argument", list.end);
|
|
1241
|
+
const builder = getTactic(list.items[1], list.end);
|
|
1242
|
+
const tactic = builder.build(params);
|
|
1243
|
+
const isPrintingDependencies = params.get("print_dependencies") === true;
|
|
1244
|
+
if (isPrintingDependencies && !builder.isTrackingDependencies && hasNames())
|
|
1245
|
+
throw new SmtUnsupportedError("the dependencies of a tactic that drops dependencies");
|
|
1246
|
+
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
1247
|
+
const input = getGoal(builder.isTrackingDependencies);
|
|
1248
|
+
const goals = (() => {
|
|
1249
|
+
try {
|
|
1250
|
+
return applyTactic(tactic, input);
|
|
1251
|
+
} catch (error) {
|
|
1252
|
+
if (!(error instanceof SmtTacticError)) throw error;
|
|
1253
|
+
print(`(error "tactic failed: ${error.message}")`);
|
|
1254
|
+
return undefined;
|
|
1255
|
+
}
|
|
1256
|
+
})();
|
|
1257
|
+
// apply_tactic_cmd releases the result goals and then the input goal.
|
|
1258
|
+
if (goals === undefined) {
|
|
1259
|
+
input.reset();
|
|
1260
|
+
return;
|
|
1261
|
+
}
|
|
1262
|
+
try {
|
|
1263
|
+
const manager = state.manager;
|
|
1264
|
+
const environment = getPrintEnvironment();
|
|
1265
|
+
if (params.get("print") !== false)
|
|
1266
|
+
print(
|
|
1267
|
+
[
|
|
1268
|
+
"(goals",
|
|
1269
|
+
...goals.map((goal) =>
|
|
1270
|
+
[
|
|
1271
|
+
"(goal",
|
|
1272
|
+
...goal.forms.items.flatMap((form, index) => [
|
|
1273
|
+
...(isPrintingDependencies
|
|
1274
|
+
? [
|
|
1275
|
+
[
|
|
1276
|
+
" |-",
|
|
1277
|
+
...getDependencyValues(goal.getDependency(index)).map(format),
|
|
1278
|
+
].join(" "),
|
|
1279
|
+
]
|
|
1280
|
+
: []),
|
|
1281
|
+
` ${printExpr(state.manager, environment, form, 2)}`,
|
|
1282
|
+
]),
|
|
1283
|
+
` :precision ${PRECISION_NAMES[goal.precision]} :depth ${goal.depth})`,
|
|
1284
|
+
].join("\n"),
|
|
1285
|
+
),
|
|
1286
|
+
")",
|
|
1287
|
+
].join("\n"),
|
|
1288
|
+
);
|
|
1289
|
+
if (
|
|
1290
|
+
params.get("print_model_converter") === true &&
|
|
1291
|
+
input.converters.some(
|
|
1292
|
+
(entry) => !("definitions" in entry) || entry.definitions.length > 0,
|
|
1293
|
+
)
|
|
1152
1294
|
)
|
|
1153
|
-
|
|
1154
|
-
|
|
1155
|
-
|
|
1156
|
-
|
|
1157
|
-
|
|
1158
|
-
|
|
1159
|
-
|
|
1160
|
-
|
|
1161
|
-
|
|
1162
|
-
|
|
1295
|
+
throw new SmtUnsupportedError("printing a model converter");
|
|
1296
|
+
if (params.get("print_benchmark") !== true) return;
|
|
1297
|
+
const assertions =
|
|
1298
|
+
goals.length === 1
|
|
1299
|
+
? goals[0].forms.items
|
|
1300
|
+
: [
|
|
1301
|
+
manager.mkOr(
|
|
1302
|
+
goals.map((goal) =>
|
|
1303
|
+
goal.forms.size === 1 ? goal.forms.items[0] : manager.mkAnd(goal.forms.items),
|
|
1304
|
+
),
|
|
1163
1305
|
),
|
|
1164
|
-
|
|
1165
|
-
|
|
1166
|
-
|
|
1167
|
-
|
|
1168
|
-
|
|
1169
|
-
|
|
1170
|
-
|
|
1171
|
-
|
|
1172
|
-
|
|
1173
|
-
|
|
1174
|
-
|
|
1175
|
-
|
|
1176
|
-
|
|
1177
|
-
|
|
1178
|
-
|
|
1179
|
-
|
|
1180
|
-
|
|
1181
|
-
|
|
1182
|
-
if (family === FAMILY_USER || family === FAMILY_MODEL_VALUE) decls.add(decl);
|
|
1306
|
+
];
|
|
1307
|
+
for (const assertion of assertions) manager.incRef(assertion);
|
|
1308
|
+
const visited = new Set<number>();
|
|
1309
|
+
const decls = new Set<number>();
|
|
1310
|
+
for (const assertion of assertions) {
|
|
1311
|
+
const todo = [assertion];
|
|
1312
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
1313
|
+
if (visited.has(expr)) continue;
|
|
1314
|
+
visited.add(expr);
|
|
1315
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
1316
|
+
const data = manager.getQuantifier(expr);
|
|
1317
|
+
todo.push(data.body, ...data.patterns, ...data.noPatterns);
|
|
1318
|
+
} else if (manager.kinds[expr] === KIND_APP) {
|
|
1319
|
+
manager.pushArgs(expr, todo);
|
|
1320
|
+
const decl = manager.decls[expr];
|
|
1321
|
+
const family = manager.funcDecls[decl].family;
|
|
1322
|
+
if (family === FAMILY_USER || family === FAMILY_MODEL_VALUE) decls.add(decl);
|
|
1323
|
+
}
|
|
1183
1324
|
}
|
|
1184
1325
|
}
|
|
1326
|
+
const lines = [...decls].map((decl) => {
|
|
1327
|
+
const funcDecl = manager.funcDecls[decl];
|
|
1328
|
+
return renderFormat(
|
|
1329
|
+
mkSeq1(
|
|
1330
|
+
[
|
|
1331
|
+
mkText(getQuotedName(funcDecl.name)),
|
|
1332
|
+
mkSeq5(funcDecl.domain.map((sort) => formatSort(manager, sort))),
|
|
1333
|
+
formatSort(manager, funcDecl.range),
|
|
1334
|
+
],
|
|
1335
|
+
"declare-fun",
|
|
1336
|
+
),
|
|
1337
|
+
environment.options,
|
|
1338
|
+
);
|
|
1339
|
+
});
|
|
1340
|
+
for (const assertion of assertions)
|
|
1341
|
+
lines.push(`(assert ${printExpr(manager, environment, assertion, 8)})`);
|
|
1342
|
+
print([...lines, "(check-sat)"].join("\n"));
|
|
1343
|
+
for (const assertion of assertions) manager.decRef(assertion);
|
|
1344
|
+
} finally {
|
|
1345
|
+
for (const goal of goals) if (goal !== input) goal.reset();
|
|
1346
|
+
input.reset();
|
|
1185
1347
|
}
|
|
1186
|
-
|
|
1187
|
-
|
|
1188
|
-
|
|
1189
|
-
|
|
1190
|
-
|
|
1191
|
-
|
|
1192
|
-
|
|
1193
|
-
|
|
1194
|
-
|
|
1195
|
-
"declare-fun",
|
|
1196
|
-
),
|
|
1197
|
-
environment.options,
|
|
1348
|
+
},
|
|
1349
|
+
],
|
|
1350
|
+
[
|
|
1351
|
+
"get-assertions",
|
|
1352
|
+
(list) => {
|
|
1353
|
+
if (!settings.isInteractive)
|
|
1354
|
+
throw new SmtParseError(
|
|
1355
|
+
"command is only available in interactive mode, use command (set-option :interactive-mode true)",
|
|
1356
|
+
list.end,
|
|
1198
1357
|
);
|
|
1358
|
+
print(`(${state.assertionTexts.join("\n ")})`);
|
|
1359
|
+
},
|
|
1360
|
+
],
|
|
1361
|
+
[
|
|
1362
|
+
"get-unsat-core",
|
|
1363
|
+
(list) => {
|
|
1364
|
+
if (!settings.isProducingUnsatCores)
|
|
1365
|
+
throw new SmtParseError(
|
|
1366
|
+
"unsat core construction is not enabled, use command (set-option :produce-unsat-cores true)",
|
|
1367
|
+
list.end,
|
|
1368
|
+
);
|
|
1369
|
+
const check = state.check;
|
|
1370
|
+
if (check === undefined || check.status !== L_FALSE)
|
|
1371
|
+
throw new SmtParseError("unsat core is not available", list.end);
|
|
1372
|
+
if (check.core === undefined)
|
|
1373
|
+
throw new SmtUnsupportedError("the unsat core of a tactic that drops dependencies");
|
|
1374
|
+
print(`(${check.core.map(format).join(" ")})`);
|
|
1375
|
+
},
|
|
1376
|
+
],
|
|
1377
|
+
[
|
|
1378
|
+
"eval",
|
|
1379
|
+
(list) => {
|
|
1380
|
+
const target = list.items[1];
|
|
1381
|
+
const term = target === undefined ? -1 : state.reader.parseTerm(target);
|
|
1382
|
+
if (list.items.length > 2) throw new SmtUnsupportedError("the parameters of eval");
|
|
1383
|
+
const model = getModel(list);
|
|
1384
|
+
if (term === -1) throw new SmtParseError("no arguments passed to eval", list.end);
|
|
1385
|
+
const manager = state.manager;
|
|
1386
|
+
manager.incRef(term);
|
|
1387
|
+
const value = model.eval(term, false);
|
|
1388
|
+
display(value);
|
|
1389
|
+
manager.decRef(value);
|
|
1390
|
+
manager.decRef(term);
|
|
1391
|
+
},
|
|
1392
|
+
],
|
|
1393
|
+
[
|
|
1394
|
+
"get-value",
|
|
1395
|
+
(list) => {
|
|
1396
|
+
const terms = list.items[1];
|
|
1397
|
+
if (terms?.kind !== "list")
|
|
1398
|
+
throw new SmtParseError("invalid get-value command, '(' expected", terms ?? list.end);
|
|
1399
|
+
const manager = state.manager;
|
|
1400
|
+
const exprs = terms.items.map((item) => state.reader.parseTerm(item));
|
|
1401
|
+
if (exprs.length === 0)
|
|
1402
|
+
throw new SmtParseError("invalid get-value command, empty list of terms", terms.end);
|
|
1403
|
+
if (list.items.length > 2) throw new SmtUnsupportedError("the parameters of get-value");
|
|
1404
|
+
const model = getModel(list);
|
|
1405
|
+
model.compact();
|
|
1406
|
+
// Z3 prints each term as the script spells it, from the end of the term before.
|
|
1407
|
+
const offsets = [
|
|
1408
|
+
terms.offset + 1,
|
|
1409
|
+
...terms.items.map((item) => (item.kind === "list" ? item.end : item).endOffset),
|
|
1410
|
+
];
|
|
1411
|
+
const lines = exprs.map((expr, index) => {
|
|
1412
|
+
manager.incRef(expr);
|
|
1413
|
+
const value = model.eval(expr, true);
|
|
1414
|
+
const line = `(${text.slice(offsets[index], offsets[index + 1]).trim()} ${format(value)})`;
|
|
1415
|
+
manager.decRef(value);
|
|
1416
|
+
manager.decRef(expr);
|
|
1417
|
+
return line;
|
|
1199
1418
|
});
|
|
1200
|
-
|
|
1201
|
-
|
|
1202
|
-
|
|
1203
|
-
|
|
1204
|
-
|
|
1205
|
-
|
|
1206
|
-
|
|
1207
|
-
|
|
1208
|
-
|
|
1209
|
-
|
|
1210
|
-
|
|
1211
|
-
|
|
1212
|
-
|
|
1213
|
-
|
|
1419
|
+
print(`(${lines.join("\n ")})`);
|
|
1420
|
+
},
|
|
1421
|
+
],
|
|
1422
|
+
[
|
|
1423
|
+
"get-objectives",
|
|
1424
|
+
() => {
|
|
1425
|
+
const optimizer = state.optimizer;
|
|
1426
|
+
if (optimizer === undefined || state.check === undefined)
|
|
1427
|
+
throw new SmtUnsupportedError("the command get-objectives");
|
|
1428
|
+
print(optimizer.getObjectives(format));
|
|
1429
|
+
},
|
|
1430
|
+
],
|
|
1431
|
+
[
|
|
1432
|
+
"get-model",
|
|
1433
|
+
(list) => {
|
|
1434
|
+
if (list.items.length > 1) throw new SmtUnsupportedError("the index of get-model");
|
|
1435
|
+
const manager = state.manager;
|
|
1436
|
+
const model = getModel(list);
|
|
1437
|
+
model.compact();
|
|
1438
|
+
for (const decl of state.reader.getDeclaredFuncs()) {
|
|
1439
|
+
const funcDecl = manager.funcDecls[decl];
|
|
1440
|
+
if (
|
|
1441
|
+
funcDecl.family !== FAMILY_USER ||
|
|
1442
|
+
model.constInterps.has(decl) ||
|
|
1443
|
+
model.funcInterps.has(decl)
|
|
1444
|
+
)
|
|
1445
|
+
continue;
|
|
1446
|
+
const value = model.getSomeValue(funcDecl.range);
|
|
1447
|
+
if (funcDecl.domain.length === 0) {
|
|
1448
|
+
model.registerConst(decl, value);
|
|
1449
|
+
continue;
|
|
1450
|
+
}
|
|
1451
|
+
const interp = new FuncInterp(manager, funcDecl.domain.length);
|
|
1452
|
+
interp.setElse(value);
|
|
1453
|
+
model.registerFunc(decl, interp);
|
|
1454
|
+
}
|
|
1455
|
+
model.addRecFuns();
|
|
1456
|
+
print(`(\n${printModel(manager, getPrintEnvironment(), model, 2)})`);
|
|
1457
|
+
},
|
|
1458
|
+
],
|
|
1459
|
+
["display", (list) => display(state.reader.parseTerm(list.items[1] ?? list.end))],
|
|
1460
|
+
[
|
|
1461
|
+
"dbg-lt",
|
|
1462
|
+
(list) => {
|
|
1463
|
+
const first = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1464
|
+
const second = state.reader.parseTerm(list.items[2] ?? list.end);
|
|
1465
|
+
print(String(isAstLess(state.manager, first, second)));
|
|
1466
|
+
},
|
|
1467
|
+
],
|
|
1468
|
+
[
|
|
1469
|
+
"dbg-some-value",
|
|
1470
|
+
(list) => {
|
|
1471
|
+
display(
|
|
1472
|
+
getManagerSomeValue(state.manager, state.reader.parseSort(list.items[1] ?? list.end)),
|
|
1214
1473
|
);
|
|
1215
|
-
|
|
1216
|
-
|
|
1217
|
-
|
|
1218
|
-
|
|
1219
|
-
|
|
1220
|
-
|
|
1221
|
-
|
|
1474
|
+
},
|
|
1475
|
+
],
|
|
1476
|
+
[
|
|
1477
|
+
"dbg-used-vars",
|
|
1478
|
+
(list) => {
|
|
1479
|
+
const manager = state.manager;
|
|
1480
|
+
const term = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1481
|
+
const body =
|
|
1482
|
+
manager.kinds[term] === KIND_QUANTIFIER ? manager.getQuantifier(term).body : term;
|
|
1483
|
+
const sorts = getFreeVarSorts(manager, body, manager.freeVarBounds[body]);
|
|
1484
|
+
const lines = sorts.map(
|
|
1485
|
+
(sort, index) =>
|
|
1486
|
+
`\n (${String(index).padEnd(6)} ${sort === undefined ? "<not-used>" : renderFormat(formatSort(manager, sort), settings.printOptions)})`,
|
|
1222
1487
|
);
|
|
1223
|
-
|
|
1224
|
-
|
|
1225
|
-
|
|
1226
|
-
|
|
1227
|
-
|
|
1228
|
-
|
|
1229
|
-
|
|
1230
|
-
|
|
1231
|
-
|
|
1232
|
-
|
|
1233
|
-
|
|
1234
|
-
|
|
1235
|
-
|
|
1236
|
-
|
|
1237
|
-
|
|
1238
|
-
|
|
1239
|
-
|
|
1240
|
-
|
|
1241
|
-
|
|
1242
|
-
|
|
1243
|
-
|
|
1244
|
-
|
|
1245
|
-
|
|
1246
|
-
|
|
1247
|
-
|
|
1248
|
-
|
|
1249
|
-
|
|
1250
|
-
|
|
1251
|
-
|
|
1252
|
-
|
|
1253
|
-
|
|
1254
|
-
|
|
1255
|
-
|
|
1256
|
-
|
|
1257
|
-
|
|
1258
|
-
|
|
1259
|
-
|
|
1260
|
-
|
|
1261
|
-
|
|
1262
|
-
|
|
1263
|
-
|
|
1264
|
-
|
|
1265
|
-
|
|
1266
|
-
|
|
1267
|
-
|
|
1268
|
-
|
|
1269
|
-
|
|
1270
|
-
|
|
1271
|
-
|
|
1272
|
-
|
|
1273
|
-
|
|
1274
|
-
|
|
1275
|
-
|
|
1276
|
-
|
|
1277
|
-
|
|
1278
|
-
|
|
1279
|
-
|
|
1280
|
-
|
|
1281
|
-
|
|
1488
|
+
print(`(vars${lines.join("")})`);
|
|
1489
|
+
},
|
|
1490
|
+
],
|
|
1491
|
+
[
|
|
1492
|
+
"dbg-elim-unused-vars",
|
|
1493
|
+
(list) => {
|
|
1494
|
+
const manager = state.manager;
|
|
1495
|
+
const term = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1496
|
+
if (manager.kinds[term] !== KIND_QUANTIFIER) {
|
|
1497
|
+
write(format(term), false);
|
|
1498
|
+
return;
|
|
1499
|
+
}
|
|
1500
|
+
display(elimUnusedVars(manager, term));
|
|
1501
|
+
},
|
|
1502
|
+
],
|
|
1503
|
+
["dbg-instantiate", (list) => instantiate(list, false)],
|
|
1504
|
+
["dbg-instantiate-nested", (list) => instantiate(list, true)],
|
|
1505
|
+
[
|
|
1506
|
+
"echo",
|
|
1507
|
+
(list) => {
|
|
1508
|
+
const message = list.items[1];
|
|
1509
|
+
if (message?.kind !== "string")
|
|
1510
|
+
throw new SmtParseError("invalid echo command, string expected", message ?? list.end);
|
|
1511
|
+
print(message.text);
|
|
1512
|
+
},
|
|
1513
|
+
],
|
|
1514
|
+
[
|
|
1515
|
+
"set-option",
|
|
1516
|
+
(list) => {
|
|
1517
|
+
const option = list.items[1];
|
|
1518
|
+
const keyword = option?.kind === "keyword" ? option.text : "";
|
|
1519
|
+
const optionName = `:${getParameterName(keyword)}`;
|
|
1520
|
+
const value = list.items[2];
|
|
1521
|
+
const isTrue = isSymbol(value, "true");
|
|
1522
|
+
if (keyword === ":produce-models") settings.isProducingModels = isTrue;
|
|
1523
|
+
if (keyword === ":produce-unsat-cores") settings.isProducingUnsatCores = isTrue;
|
|
1524
|
+
if (keyword === ":produce-proofs") settings.isProducingProofs = isTrue;
|
|
1525
|
+
if (keyword === ":interactive-mode" || keyword === ":produce-assertions") {
|
|
1526
|
+
if (state.isProofsEnabled !== undefined)
|
|
1527
|
+
throw new SmtParseError(
|
|
1528
|
+
"error setting ':produce-assertions', option value cannot be modified after initialization",
|
|
1529
|
+
value ?? list.end,
|
|
1530
|
+
);
|
|
1531
|
+
settings.isInteractive = isTrue;
|
|
1532
|
+
}
|
|
1533
|
+
if (keyword === ":diagnostic-output-channel")
|
|
1534
|
+
settings.isDiagnosticOnStdout = value?.kind === "string" && value.text === "stdout";
|
|
1535
|
+
if (keyword === ":int-real-coercions" && !isTrue)
|
|
1536
|
+
throw new SmtUnsupportedError("the option :int-real-coercions false");
|
|
1537
|
+
if (keyword === ":error-behavior") {
|
|
1538
|
+
if (!isSymbol(value, "immediate-exit") && !isSymbol(value, "continued-execution"))
|
|
1539
|
+
throw new SmtParseError(
|
|
1540
|
+
"error setting :error-behavior, 'immediate-execution' or 'continued-execution' expected",
|
|
1541
|
+
list.end,
|
|
1542
|
+
);
|
|
1543
|
+
settings.isExitingOnError = isSymbol(value, "immediate-exit");
|
|
1544
|
+
}
|
|
1545
|
+
const isParameter =
|
|
1546
|
+
keyword !== "" &&
|
|
1547
|
+
!BUILTIN_OPTIONS.has(keyword) &&
|
|
1548
|
+
value !== undefined &&
|
|
1549
|
+
value.kind !== "list";
|
|
1550
|
+
if (isParameter) settings.parameters.set(getParameterName(keyword), value.text);
|
|
1551
|
+
if (optionName === ":print_success") settings.isPrintingSuccess = isTrue;
|
|
1282
1552
|
if (
|
|
1283
|
-
|
|
1284
|
-
|
|
1285
|
-
model.funcInterps.has(decl)
|
|
1553
|
+
!BUILTIN_OPTIONS.has(keyword) &&
|
|
1554
|
+
settings.parameters.get("smtlib2_compliant") === "true"
|
|
1286
1555
|
)
|
|
1287
|
-
|
|
1288
|
-
|
|
1289
|
-
if (
|
|
1290
|
-
|
|
1291
|
-
|
|
1556
|
+
settings.isPrintingSuccess = true;
|
|
1557
|
+
if (optionName === ":smt.mbqi") settings.isMbqi = isTrue;
|
|
1558
|
+
if (optionName === ":smt.macro_finder") settings.isFindingMacros = isTrue;
|
|
1559
|
+
if (optionName === ":smt.mbqi.max_iterations" && value?.kind === "numeral")
|
|
1560
|
+
settings.mbqiMaxIterations = Number(value.text);
|
|
1561
|
+
if (optionName === ":rlimit" && value?.kind === "numeral")
|
|
1562
|
+
settings.rlimit = Number(value.text);
|
|
1563
|
+
const kernel = state.kernel;
|
|
1564
|
+
if (isParameter && kernel !== undefined)
|
|
1565
|
+
kernel.updateParams(getKernelParams(kernel.isSetUp));
|
|
1566
|
+
if (optionName === ":rewriter.hi_div0") {
|
|
1567
|
+
settings.isHiDiv0 = isTrue;
|
|
1568
|
+
state.manager.isHiDiv0 = isTrue;
|
|
1292
1569
|
}
|
|
1293
|
-
|
|
1294
|
-
|
|
1295
|
-
|
|
1296
|
-
|
|
1297
|
-
|
|
1298
|
-
|
|
1299
|
-
|
|
1300
|
-
|
|
1301
|
-
|
|
1302
|
-
|
|
1303
|
-
|
|
1304
|
-
|
|
1305
|
-
|
|
1306
|
-
|
|
1307
|
-
|
|
1308
|
-
|
|
1309
|
-
|
|
1310
|
-
|
|
1311
|
-
|
|
1312
|
-
|
|
1313
|
-
|
|
1314
|
-
|
|
1315
|
-
|
|
1316
|
-
|
|
1317
|
-
|
|
1318
|
-
|
|
1319
|
-
|
|
1320
|
-
|
|
1321
|
-
|
|
1322
|
-
|
|
1323
|
-
|
|
1324
|
-
|
|
1325
|
-
|
|
1326
|
-
|
|
1327
|
-
|
|
1328
|
-
|
|
1329
|
-
|
|
1330
|
-
|
|
1331
|
-
|
|
1332
|
-
|
|
1333
|
-
|
|
1334
|
-
|
|
1335
|
-
|
|
1336
|
-
|
|
1337
|
-
|
|
1338
|
-
|
|
1339
|
-
|
|
1340
|
-
|
|
1341
|
-
|
|
1342
|
-
|
|
1343
|
-
|
|
1344
|
-
|
|
1345
|
-
|
|
1346
|
-
|
|
1347
|
-
|
|
1348
|
-
|
|
1349
|
-
|
|
1350
|
-
|
|
1351
|
-
|
|
1352
|
-
|
|
1353
|
-
|
|
1354
|
-
|
|
1355
|
-
|
|
1356
|
-
|
|
1357
|
-
if (
|
|
1358
|
-
throw new
|
|
1359
|
-
|
|
1360
|
-
|
|
1361
|
-
);
|
|
1362
|
-
settings.isExitingOnError = isSymbol(value, "immediate-exit");
|
|
1363
|
-
}
|
|
1364
|
-
if (
|
|
1365
|
-
keyword !== "" &&
|
|
1366
|
-
!BUILTIN_OPTIONS.has(keyword) &&
|
|
1367
|
-
value !== undefined &&
|
|
1368
|
-
value.kind !== "list"
|
|
1369
|
-
)
|
|
1370
|
-
settings.parameters.set(getParameterName(keyword), value.text);
|
|
1371
|
-
if (optionName === ":print_success") settings.isPrintingSuccess = isTrue;
|
|
1372
|
-
if (!BUILTIN_OPTIONS.has(keyword) && settings.parameters.get("smtlib2_compliant") === "true")
|
|
1373
|
-
settings.isPrintingSuccess = true;
|
|
1374
|
-
if (optionName === ":smt.mbqi") settings.isMbqi = isTrue;
|
|
1375
|
-
if (optionName === ":smt.macro_finder") settings.isFindingMacros = isTrue;
|
|
1376
|
-
if (optionName === ":smt.mbqi.max_iterations" && value?.kind === "numeral")
|
|
1377
|
-
settings.mbqiMaxIterations = Number(value.text);
|
|
1378
|
-
if (optionName === ":rlimit" && value?.kind === "numeral")
|
|
1379
|
-
settings.rlimit = Number(value.text);
|
|
1380
|
-
if (optionName === ":rewriter.hi_div0") {
|
|
1381
|
-
settings.isHiDiv0 = isTrue;
|
|
1382
|
-
script.state.manager.isHiDiv0 = isTrue;
|
|
1383
|
-
}
|
|
1384
|
-
if (optionName === ":encoding" && value !== undefined && value.kind !== "list") {
|
|
1385
|
-
settings.encoding = ENCODINGS.get(value.text) ?? UNICODE_ENCODING;
|
|
1386
|
-
script.state.manager.maxChar = settings.encoding.maxChar;
|
|
1387
|
-
script.state.manager.charBits = settings.encoding.charBits;
|
|
1388
|
-
}
|
|
1389
|
-
if (optionName === ":parser.ignore_bad_patterns")
|
|
1390
|
-
settings.parserOptions.isIgnoringBadPatterns = isTrue;
|
|
1391
|
-
const numericOption = NUMERIC_PRINT_OPTIONS.get(optionName);
|
|
1392
|
-
if (numericOption !== undefined && value?.kind === "numeral")
|
|
1393
|
-
settings.printOptions[numericOption] = Number(value.text);
|
|
1394
|
-
const booleanOption = BOOLEAN_PRINT_OPTIONS.get(optionName);
|
|
1395
|
-
if (booleanOption !== undefined) settings.printOptions[booleanOption] = isTrue;
|
|
1396
|
-
if (
|
|
1397
|
-
optionName.startsWith(":pp.") &&
|
|
1398
|
-
numericOption === undefined &&
|
|
1399
|
-
booleanOption === undefined
|
|
1400
|
-
)
|
|
1401
|
-
throw new SmtUnsupportedError(`the option ${optionName}`);
|
|
1402
|
-
},
|
|
1403
|
-
"get-option": (list) => {
|
|
1404
|
-
const option = list.items[1];
|
|
1405
|
-
if (option?.kind !== "keyword")
|
|
1406
|
-
throw new SmtParseError("invalid command argument, keyword expected", option ?? list.end);
|
|
1407
|
-
const builtinValues = new Map<string, boolean | string>([
|
|
1408
|
-
[":print-success", settings.isPrintingSuccess],
|
|
1409
|
-
[":produce-models", settings.isProducingModels],
|
|
1410
|
-
[":produce-unsat-cores", settings.isProducingUnsatCores],
|
|
1411
|
-
[":int-real-coercions", true],
|
|
1412
|
-
[":error-behavior", settings.isExitingOnError ? "immediate-exit" : "continued-execution"],
|
|
1413
|
-
]);
|
|
1414
|
-
const name = getParameterName(option.text);
|
|
1415
|
-
const value =
|
|
1416
|
-
builtinValues.get(option.text) ??
|
|
1417
|
-
(BUILTIN_OPTIONS.has(option.text)
|
|
1418
|
-
? undefined
|
|
1419
|
-
: (settings.parameters.get(name) ?? PARAMETER_DEFAULTS.get(name)));
|
|
1420
|
-
if (value === undefined) throw new SmtUnsupportedError(`the option ${option.text}`);
|
|
1421
|
-
print(String(value));
|
|
1422
|
-
},
|
|
1423
|
-
"get-info": (list) => {
|
|
1424
|
-
const info = list.items[1];
|
|
1425
|
-
if (info?.kind !== "keyword")
|
|
1426
|
-
throw new SmtParseError("invalid command argument, keyword expected", info ?? list.end);
|
|
1427
|
-
const optimizer = script.state.optimizer;
|
|
1428
|
-
if (
|
|
1429
|
-
info.text === ":reason-unknown" &&
|
|
1430
|
-
script.state.check?.status === L_UNDEF &&
|
|
1431
|
-
optimizer !== undefined &&
|
|
1432
|
-
optimizer.reasonUnknown !== ""
|
|
1433
|
-
) {
|
|
1434
|
-
print(`(:reason-unknown "${optimizer.reasonUnknown}")`);
|
|
1435
|
-
return;
|
|
1436
|
-
}
|
|
1437
|
-
if (info.text !== ":error-behavior")
|
|
1438
|
-
throw new SmtUnsupportedError(`the information ${info.text}`);
|
|
1439
|
-
print(
|
|
1440
|
-
`(:error-behavior ${settings.isExitingOnError ? "immediate-exit" : "continued-execution"})`,
|
|
1441
|
-
);
|
|
1442
|
-
},
|
|
1443
|
-
"set-logic": (list) => {
|
|
1444
|
-
const state = script.state;
|
|
1445
|
-
const logic = list.items[1];
|
|
1446
|
-
if (!isSymbol(logic))
|
|
1447
|
-
throw new SmtParseError("invalid logic name, symbol expected", logic ?? list.end);
|
|
1448
|
-
if (state.logic !== undefined)
|
|
1449
|
-
throw new SmtParseError("the logic has already been set", list.end);
|
|
1450
|
-
if (state.assertions.length > 0)
|
|
1451
|
-
throw new SmtParseError("logic must be set before initialization", list.end);
|
|
1452
|
-
if (!isSupportedLogic(logic.text)) {
|
|
1453
|
-
print("unsupported");
|
|
1454
|
-
printDiagnostic(
|
|
1455
|
-
`; ignoring unsupported logic ${logic.text} line: ${list.line} position: ${list.column}`,
|
|
1570
|
+
if (optionName === ":encoding" && value !== undefined && value.kind !== "list") {
|
|
1571
|
+
settings.encoding = ENCODINGS.get(value.text) ?? UNICODE_ENCODING;
|
|
1572
|
+
state.manager.maxChar = settings.encoding.maxChar;
|
|
1573
|
+
state.manager.charBits = settings.encoding.charBits;
|
|
1574
|
+
}
|
|
1575
|
+
if (optionName === ":parser.ignore_bad_patterns")
|
|
1576
|
+
settings.parserOptions.isIgnoringBadPatterns = isTrue;
|
|
1577
|
+
const numericOption = NUMERIC_PRINT_OPTIONS.get(optionName);
|
|
1578
|
+
if (numericOption !== undefined && value?.kind === "numeral")
|
|
1579
|
+
settings.printOptions[numericOption] = Number(value.text);
|
|
1580
|
+
const booleanOption = BOOLEAN_PRINT_OPTIONS.get(optionName);
|
|
1581
|
+
if (booleanOption !== undefined) settings.printOptions[booleanOption] = isTrue;
|
|
1582
|
+
if (
|
|
1583
|
+
optionName.startsWith(":pp.") &&
|
|
1584
|
+
numericOption === undefined &&
|
|
1585
|
+
booleanOption === undefined
|
|
1586
|
+
)
|
|
1587
|
+
throw new SmtUnsupportedError(`the option ${optionName}`);
|
|
1588
|
+
},
|
|
1589
|
+
],
|
|
1590
|
+
[
|
|
1591
|
+
"get-option",
|
|
1592
|
+
(list) => {
|
|
1593
|
+
const option = list.items[1];
|
|
1594
|
+
if (option?.kind !== "keyword")
|
|
1595
|
+
throw new SmtParseError("invalid command argument, keyword expected", option ?? list.end);
|
|
1596
|
+
const builtinValues = new Map<string, boolean | string>([
|
|
1597
|
+
[":print-success", settings.isPrintingSuccess],
|
|
1598
|
+
[":produce-models", settings.isProducingModels],
|
|
1599
|
+
[":produce-unsat-cores", settings.isProducingUnsatCores],
|
|
1600
|
+
[":interactive-mode", settings.isInteractive],
|
|
1601
|
+
[":produce-assertions", settings.isInteractive],
|
|
1602
|
+
[":int-real-coercions", true],
|
|
1603
|
+
[":error-behavior", settings.isExitingOnError ? "immediate-exit" : "continued-execution"],
|
|
1604
|
+
]);
|
|
1605
|
+
const name = getParameterName(option.text);
|
|
1606
|
+
const value =
|
|
1607
|
+
builtinValues.get(option.text) ??
|
|
1608
|
+
(BUILTIN_OPTIONS.has(option.text)
|
|
1609
|
+
? undefined
|
|
1610
|
+
: (settings.parameters.get(name) ?? PARAMETER_DEFAULTS.get(name)));
|
|
1611
|
+
if (value === undefined) throw new SmtUnsupportedError(`the option ${option.text}`);
|
|
1612
|
+
print(String(value));
|
|
1613
|
+
},
|
|
1614
|
+
],
|
|
1615
|
+
[
|
|
1616
|
+
"get-info",
|
|
1617
|
+
(list) => {
|
|
1618
|
+
const info = list.items[1];
|
|
1619
|
+
if (info?.kind !== "keyword")
|
|
1620
|
+
throw new SmtParseError("invalid command argument, keyword expected", info ?? list.end);
|
|
1621
|
+
const check = state.check;
|
|
1622
|
+
const reasonUnknown =
|
|
1623
|
+
check === undefined
|
|
1624
|
+
? "state of the most recent check-sat command is not known"
|
|
1625
|
+
: check.reasonUnknown;
|
|
1626
|
+
if (info.text === ":reason-unknown" && reasonUnknown !== undefined) {
|
|
1627
|
+
print(`(:reason-unknown "${reasonUnknown.replaceAll('"', '\\"')}")`);
|
|
1628
|
+
return;
|
|
1629
|
+
}
|
|
1630
|
+
if (info.text === ":rlimit") {
|
|
1631
|
+
print(`(:rlimit ${state.manager.limit.count})`);
|
|
1632
|
+
return;
|
|
1633
|
+
}
|
|
1634
|
+
if (info.text !== ":error-behavior")
|
|
1635
|
+
throw new SmtUnsupportedError(`the information ${info.text}`);
|
|
1636
|
+
print(
|
|
1637
|
+
`(:error-behavior ${settings.isExitingOnError ? "immediate-exit" : "continued-execution"})`,
|
|
1456
1638
|
);
|
|
1457
|
-
|
|
1458
|
-
|
|
1459
|
-
|
|
1460
|
-
|
|
1461
|
-
|
|
1462
|
-
|
|
1463
|
-
|
|
1464
|
-
|
|
1465
|
-
|
|
1639
|
+
},
|
|
1640
|
+
],
|
|
1641
|
+
[
|
|
1642
|
+
"set-logic",
|
|
1643
|
+
(list) => {
|
|
1644
|
+
const logic = list.items[1];
|
|
1645
|
+
if (!isSymbol(logic))
|
|
1646
|
+
throw new SmtParseError("invalid logic name, symbol expected", logic ?? list.end);
|
|
1647
|
+
if (state.logic !== undefined)
|
|
1648
|
+
throw new SmtParseError("the logic has already been set", logic);
|
|
1649
|
+
if (state.assertions.length > 0)
|
|
1650
|
+
throw new SmtParseError("logic must be set before initialization", logic);
|
|
1651
|
+
if (!isSupportedLogic(logic.text)) {
|
|
1652
|
+
print("unsupported");
|
|
1653
|
+
printDiagnostic(
|
|
1654
|
+
`; ignoring unsupported logic ${logic.text} line: ${list.line} position: ${list.column}`,
|
|
1655
|
+
);
|
|
1656
|
+
return;
|
|
1657
|
+
}
|
|
1658
|
+
state.logic = logic.text;
|
|
1659
|
+
if (state.isProofsEnabled === undefined)
|
|
1660
|
+
state.reader = createSmtlibReader(state.manager, logic.text, settings.parserOptions);
|
|
1661
|
+
else {
|
|
1662
|
+
state.reader.restrictSorts(logic.text);
|
|
1663
|
+
// Deviation from Z3: its new solver starts without the open scopes, so it ignores their pop and keeps what they asserted.
|
|
1664
|
+
resetKernel();
|
|
1665
|
+
}
|
|
1666
|
+
if (settings.isPrintingSuccess) print("success");
|
|
1667
|
+
},
|
|
1668
|
+
],
|
|
1669
|
+
["set-info", () => {}],
|
|
1670
|
+
]);
|
|
1466
1671
|
const run = (list: SmtList) => {
|
|
1467
1672
|
const head = list.items[0];
|
|
1468
1673
|
if (!isSymbol(head))
|
|
1469
1674
|
throw new SmtParseError("invalid command, symbol expected", head ?? list.end);
|
|
1470
1675
|
const command = DECLARATIONS.has(head.text)
|
|
1471
|
-
? (declaration: SmtList) =>
|
|
1472
|
-
:
|
|
1473
|
-
? runCommand[head.text]
|
|
1474
|
-
: undefined;
|
|
1676
|
+
? (declaration: SmtList) => state.reader.declareCommand(declaration)
|
|
1677
|
+
: runCommand.get(head.text);
|
|
1475
1678
|
if (command === undefined) throw new SmtUnsupportedError(`the command ${head.text}`);
|
|
1476
|
-
|
|
1477
|
-
|
|
1679
|
+
// Z3's scoped_timer ends with the command that set it, so a command starts without one.
|
|
1680
|
+
state.manager.limit.restart(Infinity);
|
|
1681
|
+
if (!MANAGERLESS_COMMANDS.has(head.text) && state.isProofsEnabled === undefined) {
|
|
1682
|
+
state.isProofsEnabled = settings.parameters.get("proof") === "true";
|
|
1478
1683
|
resetKernel();
|
|
1479
1684
|
}
|
|
1480
1685
|
command(list);
|
|
@@ -1483,13 +1688,15 @@ export const runSmtlibScript = (
|
|
|
1483
1688
|
for (;;) {
|
|
1484
1689
|
try {
|
|
1485
1690
|
const list = commands.read();
|
|
1486
|
-
if (list === undefined || isSymbol(list.items[0], "exit"))
|
|
1691
|
+
if (list === undefined || isSymbol(list.items[0], "exit")) break;
|
|
1487
1692
|
run(list);
|
|
1488
1693
|
} catch (error) {
|
|
1489
1694
|
if (!(error instanceof SmtParseError)) throw error;
|
|
1490
1695
|
report(error);
|
|
1491
|
-
if (settings.isExitingOnError)
|
|
1696
|
+
if (settings.isExitingOnError) break;
|
|
1697
|
+
state.reader.reset();
|
|
1492
1698
|
commands.skip(report);
|
|
1493
1699
|
}
|
|
1494
1700
|
}
|
|
1701
|
+
if (pendingText !== "") printLine(pendingText);
|
|
1495
1702
|
};
|