tla-ts 0.0.10-dev.094b9b512 → 0.0.10-dev.1ebc153bd
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/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +37 -36
- package/dist/deciders.js +38 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +5 -1
- package/dist/index.d.ts +5 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +146 -58
- package/dist/prove.js +145 -57
- package/dist/run.cjs +43 -43
- package/dist/run.js +45 -45
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +40 -37
- package/dist/transfer.js +38 -35
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +1 -1
- package/src/ast.ts +4 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +268 -71
- 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/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +65 -36
- package/src/errors.ts +8 -1
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- 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 +9 -8
- package/src/obligations/levels.ts +0 -2
- package/src/obligations/module.ts +0 -2
- package/src/obligations/normalize.ts +1 -6
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +2 -2
- package/src/obligations/printer.ts +5 -7
- 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 +1 -4
- 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 +256 -185
- 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 -55
- package/src/prover/isabelle/isar/context.ts +25 -26
- package/src/prover/isabelle/isar/induct.ts +2 -12
- package/src/prover/isabelle/isar/method.ts +6 -10
- package/src/prover/isabelle/isar/proof.ts +40 -39
- 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 +3 -5
- 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 +3 -5
- 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/md5.ts +26 -29
- package/src/prover/prep/methods.ts +55 -6
- 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/context.ts +10 -14
- 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 +1 -8
- 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 +4 -7
- 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 +1 -4
- package/src/prover/smt/solver/asserted-formulas.ts +67 -3
- package/src/prover/smt/solver/ast-lt.ts +2 -3
- package/src/prover/smt/solver/ast-util.ts +4 -5
- package/src/prover/smt/solver/ast.ts +171 -168
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +2 -11
- package/src/prover/smt/solver/bit-blaster.ts +0 -3
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +39 -29
- package/src/prover/smt/solver/bound-simplifier.ts +2 -5
- package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
- package/src/prover/smt/solver/bv-decl-plugin.ts +13 -11
- 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 +3 -7
- 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 +2 -5
- package/src/prover/smt/solver/conflict-resolution.ts +8 -8
- package/src/prover/smt/solver/context.ts +45 -15
- 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 +22 -17
- 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 +25 -7
- 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-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
- package/src/prover/smt/solver/enode.ts +16 -10
- 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 +2 -8
- package/src/prover/smt/solver/euf/arith-solver.ts +0 -6
- package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +21 -12
- 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 +69 -53
- package/src/prover/smt/solver/euf/euf-solver.ts +38 -37
- 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 +27 -98
- 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 +3 -3
- package/src/prover/smt/solver/euf/th-solver.ts +1 -16
- 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 +2 -4
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +25 -14
- package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/fpa-rewriter.ts +12 -14
- package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -1
- package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -3
- package/src/prover/smt/solver/goal.ts +6 -4
- 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 +4 -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 +1 -2
- 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 +9 -6
- 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 +1 -2
- 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 +6 -15
- package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -2
- 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 +10 -3
- 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 +1 -19
- package/src/prover/smt/solver/model-based-opt.ts +1 -2
- package/src/prover/smt/solver/model-checker.ts +2 -3
- 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 +2 -4
- package/src/prover/smt/solver/muz/dl-context.ts +67 -19
- 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 -6
- 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 -30
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
- package/src/prover/smt/solver/muz/dl-rule.ts +93 -57
- 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 +195 -37
- package/src/prover/smt/solver/muz/spacer-context.ts +111 -102
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -4
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
- package/src/prover/smt/solver/muz/spacer-manager.ts +0 -6
- package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +4 -15
- package/src/prover/smt/solver/muz/spacer-util.ts +2 -29
- 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 +5 -5
- package/src/prover/smt/solver/nlsat/algebraic.ts +197 -96
- 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 +118 -105
- 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 +1 -2
- package/src/prover/smt/solver/nnf.ts +6 -3
- 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 +19 -13
- 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 +1 -2
- 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 +15 -30
- package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/poly-rewriter.ts +76 -21
- package/src/prover/smt/solver/probes.ts +91 -28
- package/src/prover/smt/solver/propagate-values.ts +4 -1
- package/src/prover/smt/solver/proto-model.ts +9 -12
- 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 +2 -3
- 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 +71 -97
- package/src/prover/smt/solver/quant-hoist.ts +2 -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 +17 -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 +2 -20
- package/src/prover/smt/solver/sat/cleaner.ts +0 -2
- package/src/prover/smt/solver/sat/config.ts +6 -9
- 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 +30 -15
- package/src/prover/smt/solver/sat/model-converter.ts +2 -22
- 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 +4 -4
- package/src/prover/smt/solver/sat/sat2goal.ts +9 -15
- package/src/prover/smt/solver/sat/scc.ts +1 -2
- package/src/prover/smt/solver/sat/simplifier.ts +16 -60
- package/src/prover/smt/solver/sat/solver.ts +47 -70
- 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 +21 -39
- package/src/prover/smt/solver/seq-decl-plugin.ts +10 -14
- package/src/prover/smt/solver/seq-derive.ts +11 -16
- 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 +2 -4
- package/src/prover/smt/solver/seq-monadic.ts +7 -7
- package/src/prover/smt/solver/seq-range-predicate.ts +18 -8
- package/src/prover/smt/solver/seq-re-rewriter.ts +5 -130
- package/src/prover/smt/solver/seq-re-util.ts +8 -27
- 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 +32 -35
- 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 +9 -5
- package/src/prover/smt/solver/smt-logics.ts +0 -1
- package/src/prover/smt/solver/smt-setup.ts +86 -20
- package/src/prover/smt/solver/smt2-printer.ts +0 -2
- package/src/prover/smt/solver/smtlib-parser.ts +1681 -721
- package/src/prover/smt/solver/smtlib-script.ts +1273 -793
- package/src/prover/smt/solver/solve-eqs.ts +13 -23
- package/src/prover/smt/solver/solver.ts +1 -2
- package/src/prover/smt/solver/static-features.ts +0 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +269 -130
- 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 +1 -2
- package/src/prover/smt/solver/theory-lra-internalize.ts +9 -1
- package/src/prover/smt/solver/theory-lra-model.ts +0 -1
- package/src/prover/smt/solver/theory-lra-propagate.ts +6 -5
- package/src/prover/smt/solver/theory-lra-state.ts +0 -1
- package/src/prover/smt/solver/theory-lra.ts +0 -7
- package/src/prover/smt/solver/theory-pb.ts +34 -15
- 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 -36
- 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 +6 -6
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/tlapm/cache.ts +8 -8
- 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 +625 -189
- package/src/runtime.ts +7 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +209 -56
- package/src/simulate.ts +3 -0
- package/src/spec-description.ts +2 -2
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +265 -94
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +3 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
- 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,10 +1,9 @@
|
|
|
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,
|
|
6
4
|
SmtCanceledError,
|
|
7
5
|
SmtParseError,
|
|
6
|
+
SmtDefaultError,
|
|
8
7
|
SmtTacticError,
|
|
9
8
|
SmtUnsupportedError,
|
|
10
9
|
} from "../../../errors";
|
|
@@ -40,19 +39,24 @@ import {
|
|
|
40
39
|
createCommandReader,
|
|
41
40
|
createSmtlibReader,
|
|
42
41
|
DECLARATIONS,
|
|
42
|
+
expectClosed,
|
|
43
43
|
isSymbol,
|
|
44
|
+
isUnsigned,
|
|
44
45
|
type SExpr,
|
|
45
46
|
type SmtList,
|
|
46
47
|
type SmtlibReader,
|
|
48
|
+
type SmtToken,
|
|
47
49
|
} from "./smtlib-parser";
|
|
48
50
|
import { O_MAXIMIZE, O_MAXSMT, O_MINIMIZE, OptContext, type OptObjective } from "./opt-context";
|
|
49
51
|
import { getLogicStrategy } from "./logic-tactics";
|
|
50
52
|
import { isMbqiByFeatures, isMbqiByLogic } from "./smt-setup";
|
|
51
|
-
import { isSupportedLogic } from "./smt-logics";
|
|
53
|
+
import { isSupportedLogic, logicHasSeq } from "./smt-logics";
|
|
52
54
|
import { getVerdict, solveAssertions, solveAssuming } from "./solver";
|
|
53
55
|
import { getConsequences } from "./smt-consequences";
|
|
54
56
|
import { getFdConsequences } from "./fd-solver";
|
|
55
57
|
import { SmtKernel } from "./smt-kernel";
|
|
58
|
+
import { Mus } from "./mus";
|
|
59
|
+
import { RefVector } from "./ref-vector";
|
|
56
60
|
import { IncSatSolver } from "./sat/inc-sat-solver";
|
|
57
61
|
import { mkThSolver } from "./euf/th-solvers";
|
|
58
62
|
import { isAstLess } from "./ast-lt";
|
|
@@ -71,9 +75,62 @@ import {
|
|
|
71
75
|
compileTactic,
|
|
72
76
|
getRewriterOptions,
|
|
73
77
|
getSatParams,
|
|
78
|
+
getSmtTacticFailure,
|
|
74
79
|
type TacticParam,
|
|
75
80
|
} from "./tactic";
|
|
76
81
|
|
|
82
|
+
const UNPORTED_COMMANDS = new Set([
|
|
83
|
+
"assert-not",
|
|
84
|
+
"assume",
|
|
85
|
+
"dbg-bool-rewriter",
|
|
86
|
+
"dbg-elim-and",
|
|
87
|
+
"dbg-get-qbody",
|
|
88
|
+
"dbg-params",
|
|
89
|
+
"dbg-pp-var",
|
|
90
|
+
"dbg-set",
|
|
91
|
+
"dbg-set-next-id",
|
|
92
|
+
"dbg-sexpr",
|
|
93
|
+
"dbg-shift-vars",
|
|
94
|
+
"dbg-size",
|
|
95
|
+
"dbg-subst",
|
|
96
|
+
"dbg-th-rewriter",
|
|
97
|
+
"dbg-translator",
|
|
98
|
+
"declare-map",
|
|
99
|
+
"declare-tactic",
|
|
100
|
+
"declare-type-var",
|
|
101
|
+
"del",
|
|
102
|
+
"display-dimacs",
|
|
103
|
+
"euf-project",
|
|
104
|
+
"eufi",
|
|
105
|
+
"ff-boolean-certify",
|
|
106
|
+
"ff-certify",
|
|
107
|
+
"ff-check-native-proof",
|
|
108
|
+
"ff-integrated-certify",
|
|
109
|
+
"get-assignment",
|
|
110
|
+
"get-interpolant",
|
|
111
|
+
"get-proof",
|
|
112
|
+
"get-proof-graph",
|
|
113
|
+
"get-unsat-assumptions",
|
|
114
|
+
"get-user-tactics",
|
|
115
|
+
"help",
|
|
116
|
+
"help-simplifier",
|
|
117
|
+
"help-tactic",
|
|
118
|
+
"include",
|
|
119
|
+
"infer",
|
|
120
|
+
"labels",
|
|
121
|
+
"mbi",
|
|
122
|
+
"mbp",
|
|
123
|
+
"mbp-qel",
|
|
124
|
+
"model-add",
|
|
125
|
+
"model-del",
|
|
126
|
+
"prefer",
|
|
127
|
+
"qe-lite",
|
|
128
|
+
"qel",
|
|
129
|
+
"reset-preferences",
|
|
130
|
+
"set-initial-value",
|
|
131
|
+
"set-simplifier",
|
|
132
|
+
]);
|
|
133
|
+
|
|
77
134
|
const SILENT_COMMANDS = new Set([
|
|
78
135
|
...DECLARATIONS,
|
|
79
136
|
"assert",
|
|
@@ -83,8 +140,6 @@ const SILENT_COMMANDS = new Set([
|
|
|
83
140
|
"reset-assertions",
|
|
84
141
|
"set-option",
|
|
85
142
|
"set-info",
|
|
86
|
-
"minimize",
|
|
87
|
-
"maximize",
|
|
88
143
|
"assert-soft",
|
|
89
144
|
"declare-rel",
|
|
90
145
|
"declare-var",
|
|
@@ -177,7 +232,9 @@ const getSoftParameters = (items: SExpr[]) => {
|
|
|
177
232
|
const parameters = { weight: Rational.one, id: null as string | null };
|
|
178
233
|
for (let index = 0; index < items.length; index += 2) {
|
|
179
234
|
const keyword = items[index];
|
|
180
|
-
|
|
235
|
+
if (keyword.kind !== "keyword")
|
|
236
|
+
throw new SmtParseError("invalid command argument, keyword expected", keyword);
|
|
237
|
+
const name = getParameterName(keyword.text);
|
|
181
238
|
const value = items[index + 1];
|
|
182
239
|
if (name === "weight" && (value?.kind === "numeral" || value?.kind === "decimal")) {
|
|
183
240
|
const [whole, fraction = ""] = value.text.split(".");
|
|
@@ -195,7 +252,9 @@ const getSimplifyParams = (items: SExpr[]) => {
|
|
|
195
252
|
const params = new Map<string, TacticParam>();
|
|
196
253
|
for (let index = 0; index < items.length; index += 2) {
|
|
197
254
|
const keyword = items[index];
|
|
198
|
-
|
|
255
|
+
if (keyword.kind !== "keyword")
|
|
256
|
+
throw new SmtParseError("invalid command argument, keyword expected", keyword);
|
|
257
|
+
const name = getParameterName(keyword.text);
|
|
199
258
|
const value = items[index + 1];
|
|
200
259
|
if (SIMPLIFY_UINT_PARAMETERS.has(name) && value?.kind === "numeral") {
|
|
201
260
|
params.set(name, Number(value.text));
|
|
@@ -247,12 +306,29 @@ const getCommandParams = (items: SExpr[], isBooleans: ReadonlyMap<string, boolea
|
|
|
247
306
|
"invalid command argument, unsigned integer expected",
|
|
248
307
|
value ?? keyword,
|
|
249
308
|
);
|
|
309
|
+
if (!isUnsigned(value.text))
|
|
310
|
+
throw new SmtParseError(
|
|
311
|
+
"invalid indexed identifier, index is too big to fit in an unsigned machine integer",
|
|
312
|
+
value,
|
|
313
|
+
);
|
|
250
314
|
params.set(name, Number(value.text));
|
|
251
315
|
}
|
|
252
316
|
}
|
|
253
317
|
return params;
|
|
254
318
|
};
|
|
255
319
|
|
|
320
|
+
const getFirstArgument = (list: SmtList) => {
|
|
321
|
+
const argument = list.items[1];
|
|
322
|
+
if (argument === undefined)
|
|
323
|
+
throw new SmtParseError("invalid command, argument(s) missing", list.end);
|
|
324
|
+
return argument;
|
|
325
|
+
};
|
|
326
|
+
|
|
327
|
+
const checkArgumentCount = (list: SmtList, count: number) => {
|
|
328
|
+
const extra = list.items[count + 1];
|
|
329
|
+
if (extra !== undefined) throw new SmtParseError("invalid command, too many arguments", extra);
|
|
330
|
+
};
|
|
331
|
+
|
|
256
332
|
// Z3's parse_opt_unsigned names the push command for pop as well.
|
|
257
333
|
const getScopeCount = (list: SmtList) => {
|
|
258
334
|
const argument = list.items[1];
|
|
@@ -274,8 +350,17 @@ interface CheckResult {
|
|
|
274
350
|
status: number;
|
|
275
351
|
context: Context | undefined;
|
|
276
352
|
isOptimizing: boolean;
|
|
353
|
+
isFromTactic: boolean;
|
|
277
354
|
model: ProtoModel | undefined;
|
|
278
355
|
core: number[] | undefined;
|
|
356
|
+
// check_sat_result::reason_unknown, where the port tracks it.
|
|
357
|
+
reasonUnknown?: string;
|
|
358
|
+
}
|
|
359
|
+
|
|
360
|
+
interface SolverAnswer {
|
|
361
|
+
result: number;
|
|
362
|
+
context: Context | undefined;
|
|
363
|
+
reasonUnknown: string | undefined;
|
|
279
364
|
}
|
|
280
365
|
|
|
281
366
|
interface ScriptState {
|
|
@@ -299,9 +384,7 @@ interface ScriptState {
|
|
|
299
384
|
// combined_solver's incremental smt kernel, which keeps one context across the checks, or
|
|
300
385
|
// undefined while Z3 has made no such kernel.
|
|
301
386
|
kernel: SmtKernel | undefined;
|
|
302
|
-
|
|
303
|
-
// an unported theory and the smt kernel answers in its place.
|
|
304
|
-
eufSolver: IncSatSolver | undefined;
|
|
387
|
+
satSolver: IncSatSolver | undefined;
|
|
305
388
|
}
|
|
306
389
|
|
|
307
390
|
// Z3 fixes the proof mode at the first command that needs terms.
|
|
@@ -311,15 +394,22 @@ const MANAGERLESS_COMMANDS = new Set([
|
|
|
311
394
|
"set-logic",
|
|
312
395
|
"get-option",
|
|
313
396
|
"get-info",
|
|
397
|
+
"get-assertions",
|
|
314
398
|
"echo",
|
|
315
399
|
]);
|
|
316
400
|
|
|
317
401
|
export const runSmtlibScript = (
|
|
318
402
|
text: string,
|
|
319
403
|
options: DecideOptions,
|
|
320
|
-
|
|
404
|
+
printLine: (line: string, isDiagnostic?: boolean) => void,
|
|
321
405
|
) => {
|
|
322
406
|
const commands = createCommandReader(text);
|
|
407
|
+
// Z3 writes to a stream: text left without a newline starts the next line.
|
|
408
|
+
let pendingText = "";
|
|
409
|
+
const print = (line: string, isDiagnostic?: boolean) => {
|
|
410
|
+
printLine(pendingText + line, isDiagnostic);
|
|
411
|
+
pendingText = "";
|
|
412
|
+
};
|
|
323
413
|
const settings = {
|
|
324
414
|
isPrintingSuccess: false,
|
|
325
415
|
isProducingModels: true,
|
|
@@ -337,11 +427,11 @@ export const runSmtlibScript = (
|
|
|
337
427
|
rlimit: 0,
|
|
338
428
|
printOptions: { ...DEFAULT_PRINT_OPTIONS },
|
|
339
429
|
parserOptions: { isIgnoringBadPatterns: true },
|
|
430
|
+
// Z3 keeps set-info's :status across reset.
|
|
431
|
+
status: L_UNDEF,
|
|
340
432
|
};
|
|
341
433
|
const createState = (): ScriptState => {
|
|
342
|
-
const manager = new AstManager(
|
|
343
|
-
new ResourceLimit(Date.now() + options.timeLimitMs, options.signal),
|
|
344
|
-
);
|
|
434
|
+
const manager = new AstManager(new ResourceLimit(Infinity, options.signal));
|
|
345
435
|
manager.isHiDiv0 = settings.isHiDiv0;
|
|
346
436
|
manager.maxChar = settings.encoding.maxChar;
|
|
347
437
|
manager.charBits = settings.encoding.charBits;
|
|
@@ -362,23 +452,22 @@ export const runSmtlibScript = (
|
|
|
362
452
|
hasChecked: false,
|
|
363
453
|
datalog: undefined,
|
|
364
454
|
kernel: undefined,
|
|
365
|
-
|
|
455
|
+
satSolver: undefined,
|
|
366
456
|
};
|
|
367
457
|
};
|
|
368
|
-
|
|
458
|
+
let state = createState();
|
|
369
459
|
const getPrintEnvironment = () => ({
|
|
370
460
|
options: settings.printOptions,
|
|
371
|
-
isUsed:
|
|
372
|
-
isClashing:
|
|
461
|
+
isUsed: state.reader.isUsed,
|
|
462
|
+
isClashing: state.reader.isClashing,
|
|
373
463
|
});
|
|
374
|
-
const format = (expr: number) => printExpr(
|
|
464
|
+
const format = (expr: number) => printExpr(state.manager, getPrintEnvironment(), expr);
|
|
375
465
|
const display = (expr: number) => print(format(expr));
|
|
376
466
|
const report = (error: SmtParseError) =>
|
|
377
467
|
print(`(error "line ${error.line} column ${error.column}: ${error.message}")`);
|
|
378
468
|
const getNamedAssertions = () => {
|
|
379
|
-
const state = script.state;
|
|
380
469
|
const manager = state.manager;
|
|
381
|
-
const isNamed =
|
|
470
|
+
const isNamed = hasNames();
|
|
382
471
|
return state.assertions.map((assertion, index) =>
|
|
383
472
|
isNamed && state.names[index] !== -1
|
|
384
473
|
? manager.mkApp(OP_IMPLIES, [state.names[index], assertion], SORT_BOOL)
|
|
@@ -404,8 +493,7 @@ export const runSmtlibScript = (
|
|
|
404
493
|
paretoMaxLemmas: Number(parameters.get("opt.pareto_nlsat_max_lemmas") ?? 128),
|
|
405
494
|
};
|
|
406
495
|
};
|
|
407
|
-
const optimize = (extra: number[]) => {
|
|
408
|
-
const state = script.state;
|
|
496
|
+
const optimize = (extra: number[], end: SmtToken) => {
|
|
409
497
|
const manager = state.manager;
|
|
410
498
|
const objectives = state.objectives;
|
|
411
499
|
const hard = [...getNamedAssertions(), ...state.names.filter((name) => name !== -1), ...extra];
|
|
@@ -423,7 +511,7 @@ export const runSmtlibScript = (
|
|
|
423
511
|
setup: getSetup(),
|
|
424
512
|
write: () => {},
|
|
425
513
|
parameters: settings.parameters,
|
|
426
|
-
hasDefinitions: () =>
|
|
514
|
+
hasDefinitions: () => state.reader.hasDefinitions(),
|
|
427
515
|
},
|
|
428
516
|
objectives,
|
|
429
517
|
);
|
|
@@ -431,7 +519,7 @@ export const runSmtlibScript = (
|
|
|
431
519
|
clearCheck();
|
|
432
520
|
state.manager.limit.push(settings.rlimit);
|
|
433
521
|
try {
|
|
434
|
-
const hasAssumptions = extra.length > 0 ||
|
|
522
|
+
const hasAssumptions = extra.length > 0 || hasNames();
|
|
435
523
|
const status = optimizer.optimize(hard, {
|
|
436
524
|
...getOptOptions(),
|
|
437
525
|
hasAssumptions,
|
|
@@ -448,14 +536,11 @@ export const runSmtlibScript = (
|
|
|
448
536
|
!hasAssumptions &&
|
|
449
537
|
settings.parameters.get("opt.incremental") !== "true",
|
|
450
538
|
});
|
|
451
|
-
|
|
452
|
-
state.check = {
|
|
453
|
-
status,
|
|
454
|
-
context: undefined,
|
|
539
|
+
setCheck(status, {
|
|
455
540
|
isOptimizing: true,
|
|
456
541
|
model: optimizer.model ?? undefined,
|
|
457
|
-
|
|
458
|
-
};
|
|
542
|
+
reasonUnknown: optimizer.getReasonUnknown(),
|
|
543
|
+
});
|
|
459
544
|
print(getVerdict(status));
|
|
460
545
|
return true;
|
|
461
546
|
} catch (error) {
|
|
@@ -464,15 +549,15 @@ export const runSmtlibScript = (
|
|
|
464
549
|
resetOptimizer();
|
|
465
550
|
return false;
|
|
466
551
|
}
|
|
552
|
+
if (error instanceof SmtDefaultError) {
|
|
553
|
+
optimizer.release();
|
|
554
|
+
setCheck(L_UNDEF, { isOptimizing: true, reasonUnknown: "unknown" });
|
|
555
|
+
throw new SmtParseError(error.message, end);
|
|
556
|
+
}
|
|
467
557
|
if (!(error instanceof SmtCanceledError || isStackOverflow(error))) throw error;
|
|
558
|
+
const reasonUnknown = optimizer.getReasonUnknown();
|
|
468
559
|
optimizer.release();
|
|
469
|
-
|
|
470
|
-
status: L_UNDEF,
|
|
471
|
-
context: undefined,
|
|
472
|
-
isOptimizing: true,
|
|
473
|
-
model: undefined,
|
|
474
|
-
core: undefined,
|
|
475
|
-
};
|
|
560
|
+
setCheck(L_UNDEF, { isOptimizing: true, reasonUnknown });
|
|
476
561
|
print("unknown");
|
|
477
562
|
return true;
|
|
478
563
|
} finally {
|
|
@@ -481,94 +566,127 @@ export const runSmtlibScript = (
|
|
|
481
566
|
}
|
|
482
567
|
};
|
|
483
568
|
const resetOptimizer = () => {
|
|
484
|
-
|
|
485
|
-
|
|
569
|
+
state.optimizer?.release();
|
|
570
|
+
state.optimizer = undefined;
|
|
486
571
|
};
|
|
487
572
|
// The port keeps answering with the smt kernel where it lacks a piece of the logic's strategy.
|
|
488
573
|
const solveWithStrategy = () => {
|
|
489
|
-
const state = script.state;
|
|
490
574
|
const goal = getGoal();
|
|
491
575
|
const strategy =
|
|
492
576
|
settings.parameters.get("tactic.default_tactic") ??
|
|
493
577
|
getLogicStrategy(state.logic, goal.isProofsEnabled);
|
|
494
578
|
try {
|
|
495
579
|
const checked = checkSatUsing(compileInternalTactic(getTacticEnvironment(), strategy), goal);
|
|
496
|
-
return {
|
|
580
|
+
return {
|
|
581
|
+
result: checked.status,
|
|
582
|
+
context: undefined,
|
|
583
|
+
model: checked.model,
|
|
584
|
+
// The finite-domain solver is an inc_sat_solver, whose reason stays "no reason given" after an answer.
|
|
585
|
+
reasonUnknown:
|
|
586
|
+
isUsingFdSolver() && checked.status !== L_UNDEF
|
|
587
|
+
? "no reason given"
|
|
588
|
+
: checked.reasonUnknown,
|
|
589
|
+
};
|
|
497
590
|
} catch (error) {
|
|
498
591
|
if (!(error instanceof SmtUnsupportedError)) throw error;
|
|
499
592
|
const hasQuantifiers = state.assertions.some(
|
|
500
593
|
(assertion) => state.manager.hasQuantifierFlags[assertion],
|
|
501
594
|
);
|
|
595
|
+
const solved = solveAssertions(state.manager, state.assertions, {
|
|
596
|
+
isMbqi: settings.isMbqi || isMbqiByFeatures(getSetup(), hasQuantifiers),
|
|
597
|
+
mbqiMaxIterations: settings.mbqiMaxIterations,
|
|
598
|
+
isFindingMacros: settings.isFindingMacros,
|
|
599
|
+
setup: getSetup(),
|
|
600
|
+
});
|
|
502
601
|
return {
|
|
503
|
-
...
|
|
504
|
-
isMbqi: settings.isMbqi || isMbqiByFeatures(getSetup(), hasQuantifiers),
|
|
505
|
-
mbqiMaxIterations: settings.mbqiMaxIterations,
|
|
506
|
-
isFindingMacros: settings.isFindingMacros,
|
|
507
|
-
setup: getSetup(),
|
|
508
|
-
}),
|
|
602
|
+
...solved,
|
|
509
603
|
model: undefined,
|
|
604
|
+
reasonUnknown:
|
|
605
|
+
solved.result === L_UNDEF && solved.context !== undefined
|
|
606
|
+
? getSmtTacticFailure(solved.context)
|
|
607
|
+
: "",
|
|
510
608
|
};
|
|
511
609
|
}
|
|
512
610
|
};
|
|
513
|
-
|
|
514
|
-
|
|
611
|
+
// Deviation from Z3: the heap guard and a stack overflow, which Z3 lacks, read as an exhausted rlimit.
|
|
612
|
+
const getCancelMessage = (deadline: number) =>
|
|
613
|
+
Date.now() > deadline || options.signal?.aborted === true
|
|
614
|
+
? "canceled"
|
|
615
|
+
: "max. resource limit exceeded";
|
|
616
|
+
// As in Z3, a timeout leaves "timeout" in the kernel, which reports it while its last search hasn't failed.
|
|
617
|
+
const getReasonUnknown = (solved: SolverAnswer, deadline: number) => {
|
|
618
|
+
const isTimedOut = solved.result === L_UNDEF && Date.now() > deadline;
|
|
619
|
+
const context = state.kernel?.context;
|
|
620
|
+
if (isTimedOut && context !== undefined) context.reasonUnknown = "timeout";
|
|
621
|
+
if (context !== undefined && solved.context === context) return context.getLastFailureMessage();
|
|
622
|
+
return isTimedOut ? "timeout" : (solved.reasonUnknown ?? getCancelMessage(deadline));
|
|
623
|
+
};
|
|
624
|
+
// As in Z3, a kernel loses the mbqi its logic turned on once it reads the parameters again.
|
|
625
|
+
const getKernelParams = (isSetUp = false) => ({
|
|
626
|
+
isMbqi: settings.isMbqi || (!isSetUp && isMbqiByLogic(getSetup())),
|
|
515
627
|
mbqiMaxIterations: settings.mbqiMaxIterations,
|
|
516
628
|
isFindingMacros: settings.isFindingMacros,
|
|
517
629
|
setup: getSetup(),
|
|
518
630
|
});
|
|
519
|
-
|
|
520
|
-
|
|
521
|
-
state.
|
|
631
|
+
// mk_special_solver_for_logic gives these logics the finite-domain solver, incremental or not.
|
|
632
|
+
const isUsingFdSolver = () =>
|
|
633
|
+
(state.logic === "QF_FD" || state.logic === "SAT") &&
|
|
634
|
+
!settings.isProducingProofs &&
|
|
635
|
+
!settings.parameters.has("tactic.default_tactic");
|
|
636
|
+
const checkSat = (extra: number[], end: SmtToken) => {
|
|
637
|
+
const deadline = Date.now() + options.timeLimitMs;
|
|
638
|
+
state.manager.limit.restart(deadline);
|
|
522
639
|
// opt::context::optimize answers as the search of the hard constraints does: once they are
|
|
523
640
|
// satisfiable, optsmt and maxsmt only improve the model. The unported parts of optimization
|
|
524
641
|
// only get that answer.
|
|
525
|
-
if (state.objectives.length > 0 && optimize(extra)) return;
|
|
642
|
+
if (state.objectives.length > 0 && optimize(extra, end)) return;
|
|
526
643
|
state.manager.limit.push(settings.rlimit);
|
|
527
644
|
const isOptimizing = state.objectives.length > 0;
|
|
645
|
+
const manager = state.manager;
|
|
646
|
+
const names = state.names.filter((name) => name !== -1);
|
|
647
|
+
const isNamed = names.length > 0;
|
|
648
|
+
const isAssuming = isNamed || extra.length > 0;
|
|
649
|
+
if (isAssuming) state.isIncremental = true;
|
|
650
|
+
if (!isOptimizing) state.hasChecked = true;
|
|
651
|
+
const isKernelChecking =
|
|
652
|
+
isAssuming || (state.isIncremental && !isOptimizing && !isUsingFdSolver());
|
|
528
653
|
try {
|
|
529
|
-
const
|
|
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
|
-
const assumptions = isNamed ? [...names, ...extra] : extra;
|
|
541
|
-
const kernel =
|
|
542
|
-
isAssuming || (state.isIncremental && !isOptimizing && !isFd)
|
|
543
|
-
? checkKernel(assumptions)
|
|
544
|
-
: undefined;
|
|
654
|
+
const kernel = isKernelChecking ? checkKernel(names, extra) : undefined;
|
|
545
655
|
// Z3 retries a quantifier-free problem with its tactic when the incremental kernel gives up.
|
|
546
|
-
const
|
|
656
|
+
const isFromTactic =
|
|
547
657
|
kernel === undefined ||
|
|
548
658
|
(!isAssuming &&
|
|
549
659
|
kernel.result === L_UNDEF &&
|
|
550
660
|
!state.assertions.some((assertion) => manager.hasQuantifierFlags[assertion]) &&
|
|
551
|
-
manager.limit.inc())
|
|
552
|
-
|
|
553
|
-
|
|
554
|
-
solved.model?.incRef();
|
|
555
|
-
state.check = {
|
|
556
|
-
status: solved.result,
|
|
661
|
+
manager.limit.inc());
|
|
662
|
+
const solved = isFromTactic ? { ...solveWithStrategy(), core: undefined } : kernel;
|
|
663
|
+
setCheck(solved.result, {
|
|
557
664
|
context: solved.context,
|
|
558
665
|
isOptimizing,
|
|
666
|
+
isFromTactic: isFromTactic && !isUsingFdSolver(),
|
|
559
667
|
model: solved.model,
|
|
560
668
|
core: solved.core ?? solved.context?.unsatCore ?? [],
|
|
561
|
-
|
|
669
|
+
reasonUnknown: getReasonUnknown(solved, deadline),
|
|
670
|
+
});
|
|
562
671
|
print(getVerdict(solved.result));
|
|
563
672
|
} catch (error) {
|
|
564
|
-
if (
|
|
565
|
-
|
|
566
|
-
|
|
567
|
-
|
|
673
|
+
if (
|
|
674
|
+
!(
|
|
675
|
+
error instanceof SmtCanceledError ||
|
|
676
|
+
error instanceof SmtDefaultError ||
|
|
677
|
+
isStackOverflow(error)
|
|
678
|
+
)
|
|
679
|
+
)
|
|
680
|
+
throw error;
|
|
681
|
+
const context = isKernelChecking ? state.kernel?.context : undefined;
|
|
682
|
+
setCheck(L_UNDEF, {
|
|
568
683
|
isOptimizing,
|
|
569
|
-
|
|
570
|
-
|
|
571
|
-
|
|
684
|
+
isFromTactic: !isKernelChecking && !isUsingFdSolver(),
|
|
685
|
+
reasonUnknown:
|
|
686
|
+
error instanceof SmtDefaultError
|
|
687
|
+
? error.message
|
|
688
|
+
: getReasonUnknown({ result: L_UNDEF, context, reasonUnknown: undefined }, deadline),
|
|
689
|
+
});
|
|
572
690
|
print("unknown");
|
|
573
691
|
} finally {
|
|
574
692
|
state.manager.limit.release();
|
|
@@ -576,27 +694,44 @@ export const runSmtlibScript = (
|
|
|
576
694
|
}
|
|
577
695
|
};
|
|
578
696
|
const getModel = (list: SmtList) => {
|
|
579
|
-
const check =
|
|
697
|
+
const check = state.check;
|
|
580
698
|
if (!settings.isProducingModels || check === undefined || check.status === L_FALSE)
|
|
581
699
|
throw new SmtParseError("model is not available", list.end);
|
|
582
700
|
if (check.model !== undefined) return check.model;
|
|
583
701
|
if (check.isOptimizing) throw new SmtUnsupportedError("the models of optimization");
|
|
584
702
|
if (check.context === undefined && check.status !== L_TRUE)
|
|
585
|
-
throw
|
|
586
|
-
|
|
703
|
+
throw check.isFromTactic
|
|
704
|
+
? new SmtParseError("model is not available", list.end)
|
|
705
|
+
: new SmtUnsupportedError("the model of a canceled search");
|
|
706
|
+
const model = check.context?.getModel() ?? new ProtoModel(state.manager);
|
|
587
707
|
model.incRef();
|
|
588
708
|
check.model = model;
|
|
589
709
|
return model;
|
|
590
710
|
};
|
|
591
711
|
const clearCheck = () => {
|
|
592
|
-
|
|
593
|
-
|
|
712
|
+
state.check?.model?.decRef();
|
|
713
|
+
state.check = undefined;
|
|
714
|
+
};
|
|
715
|
+
// cmd_context::validate_check_sat_result runs after the answer is printed.
|
|
716
|
+
const validateCheck = (end: SmtToken) => {
|
|
717
|
+
const status = state.check?.status ?? L_UNDEF;
|
|
718
|
+
if (status !== L_UNDEF && settings.status !== L_UNDEF && status !== settings.status)
|
|
719
|
+
throw new SmtParseError(`check annotation that says ${getVerdict(settings.status)}`, end);
|
|
720
|
+
};
|
|
721
|
+
// The check holds a reference to its model until clearCheck.
|
|
722
|
+
const setCheck = (status: number, result: Partial<Omit<CheckResult, "status">> = {}) => {
|
|
723
|
+
result.model?.incRef();
|
|
724
|
+
state.check = {
|
|
725
|
+
status,
|
|
726
|
+
context: undefined,
|
|
727
|
+
isOptimizing: false,
|
|
728
|
+
isFromTactic: false,
|
|
729
|
+
model: undefined,
|
|
730
|
+
core: undefined,
|
|
731
|
+
...result,
|
|
732
|
+
};
|
|
594
733
|
};
|
|
595
|
-
// cmd_context::mk_solver: mk_solver_for_logic makes the incremental solver the smt kernel unless
|
|
596
|
-
// the logic, the default tactic or the sat parameters pick a sat solver. Under sat.euf that
|
|
597
|
-
// solver is inc_sat_solver in euf mode; the other sat solvers only store their assertions.
|
|
598
734
|
const resetKernel = () => {
|
|
599
|
-
const state = script.state;
|
|
600
735
|
const logic = state.logic;
|
|
601
736
|
const parameters = settings.parameters;
|
|
602
737
|
const isProofsEnabled = settings.isProducingProofs || state.isProofsEnabled === true;
|
|
@@ -609,47 +744,54 @@ export const runSmtlibScript = (
|
|
|
609
744
|
parameters.get("tactic.default_tactic") === "sat" ||
|
|
610
745
|
parameters.get("sat.smt") === "true" ||
|
|
611
746
|
isEuf;
|
|
612
|
-
state.
|
|
747
|
+
state.satSolver?.release();
|
|
613
748
|
state.kernel = isSatSolver ? undefined : new SmtKernel(state.manager, getKernelParams());
|
|
614
|
-
state.
|
|
615
|
-
|
|
616
|
-
? new IncSatSolver(state.manager, getSatParams(parameters), true, mkThSolver)
|
|
749
|
+
state.satSolver =
|
|
750
|
+
isSatSolver && !isFdSolver && parameters.get("sat.smt") !== "true"
|
|
751
|
+
? new IncSatSolver(state.manager, getSatParams(parameters), true, isEuf ? mkThSolver : null)
|
|
617
752
|
: undefined;
|
|
753
|
+
for (let index = 0; index < state.scopes.length; index++) {
|
|
754
|
+
state.kernel?.push();
|
|
755
|
+
useSatSolver((solver) => solver.push());
|
|
756
|
+
}
|
|
618
757
|
};
|
|
619
|
-
// The parts of
|
|
620
|
-
const
|
|
621
|
-
const
|
|
622
|
-
const solver = state.eufSolver;
|
|
758
|
+
// The parts of inc_sat_solver that are not ported leave its answers to the smt kernel.
|
|
759
|
+
const useSatSolver = <Result>(action: (solver: IncSatSolver) => Result) => {
|
|
760
|
+
const solver = state.satSolver;
|
|
623
761
|
if (solver === undefined) return undefined;
|
|
624
762
|
try {
|
|
625
763
|
return action(solver);
|
|
626
764
|
} catch (error) {
|
|
627
765
|
if (!(error instanceof SmtUnsupportedError)) throw error;
|
|
628
766
|
solver.release();
|
|
629
|
-
state.
|
|
767
|
+
state.satSolver = undefined;
|
|
630
768
|
return undefined;
|
|
631
769
|
}
|
|
632
770
|
};
|
|
633
771
|
// solver_na2as asserts a named assertion as an implication from its name.
|
|
634
772
|
const assertInKernel = (formula: number, name: number) => {
|
|
635
|
-
const state = script.state;
|
|
636
773
|
const manager = state.manager;
|
|
774
|
+
useSatSolver((solver) =>
|
|
775
|
+
name === -1 ? solver.assertExpr(formula) : solver.assertNamed(formula, name),
|
|
776
|
+
);
|
|
777
|
+
const kernel = state.kernel;
|
|
778
|
+
if (kernel === undefined) return;
|
|
637
779
|
const asserted = name === -1 ? formula : manager.mkApp(OP_IMPLIES, [name, formula], SORT_BOOL);
|
|
638
780
|
manager.incRef(asserted);
|
|
639
|
-
|
|
640
|
-
useEufSolver((solver) => solver.assertExpr(asserted));
|
|
781
|
+
kernel.assertExpr(asserted);
|
|
641
782
|
manager.decRef(asserted);
|
|
642
783
|
};
|
|
643
|
-
const checkKernel = (
|
|
644
|
-
const state = script.state;
|
|
784
|
+
const checkKernel = (names: number[], extra: number[]) => {
|
|
645
785
|
const kernel = state.kernel;
|
|
646
|
-
const
|
|
647
|
-
|
|
786
|
+
const assumptions = [...names, ...extra];
|
|
787
|
+
const found = useSatSolver((solver) => {
|
|
788
|
+
const result = solver.check(extra);
|
|
648
789
|
return {
|
|
649
790
|
result,
|
|
650
791
|
context: undefined,
|
|
651
792
|
model: result === L_TRUE ? (solver.getModel() ?? undefined) : undefined,
|
|
652
793
|
core: result === L_FALSE ? [...solver.getUnsatCore()] : undefined,
|
|
794
|
+
reasonUnknown: solver.reasonUnknown,
|
|
653
795
|
};
|
|
654
796
|
});
|
|
655
797
|
if (found !== undefined) return found;
|
|
@@ -659,38 +801,47 @@ export const runSmtlibScript = (
|
|
|
659
801
|
context: kernel.context,
|
|
660
802
|
model: undefined,
|
|
661
803
|
core: undefined,
|
|
804
|
+
reasonUnknown: undefined,
|
|
662
805
|
};
|
|
806
|
+
const solved = solveAssuming(
|
|
807
|
+
state.manager,
|
|
808
|
+
getNamedAssertions(),
|
|
809
|
+
assumptions,
|
|
810
|
+
getKernelParams(),
|
|
811
|
+
);
|
|
663
812
|
return {
|
|
664
|
-
...
|
|
813
|
+
...solved,
|
|
665
814
|
model: undefined,
|
|
666
815
|
core: undefined,
|
|
816
|
+
// inc_sat_solver, which these logics use, keeps "no reason given" after an answer.
|
|
817
|
+
reasonUnknown:
|
|
818
|
+
solved.result === L_UNDEF ? solved.context.getLastFailureMessage() : "no reason given",
|
|
667
819
|
};
|
|
668
820
|
};
|
|
669
|
-
let pendingText = "";
|
|
670
821
|
const printDiagnostic = (line: string) => print(line, !settings.isDiagnosticOnStdout);
|
|
671
822
|
const write = (text: string, isDiagnostic: boolean) => {
|
|
672
|
-
const lines =
|
|
673
|
-
|
|
823
|
+
const lines = text.split("\n");
|
|
824
|
+
const rest = lines.pop() ?? "";
|
|
674
825
|
for (const line of lines) (isDiagnostic ? printDiagnostic : print)(line);
|
|
826
|
+
pendingText += rest;
|
|
675
827
|
};
|
|
676
828
|
const getSetup = () => ({
|
|
677
|
-
logic:
|
|
829
|
+
logic: state.logic,
|
|
678
830
|
isAutoConfig:
|
|
679
831
|
settings.parameters.get("auto_config") !== "false" &&
|
|
680
832
|
settings.parameters.get("smt.auto_config") !== "false",
|
|
681
833
|
});
|
|
682
834
|
const getTacticEnvironment = () => ({
|
|
683
|
-
manager:
|
|
835
|
+
manager: state.manager,
|
|
684
836
|
isMbqi: settings.isMbqi,
|
|
685
837
|
mbqiMaxIterations: settings.mbqiMaxIterations,
|
|
686
838
|
isFindingMacros: settings.isFindingMacros,
|
|
687
839
|
setup: getSetup(),
|
|
688
840
|
write,
|
|
689
841
|
parameters: settings.parameters,
|
|
690
|
-
hasDefinitions: () =>
|
|
842
|
+
hasDefinitions: () => state.reader.hasDefinitions(),
|
|
691
843
|
});
|
|
692
844
|
const getDatalog = () => {
|
|
693
|
-
const state = script.state;
|
|
694
845
|
state.datalog ??= createDatalogContext(
|
|
695
846
|
state.manager,
|
|
696
847
|
settings.parameters,
|
|
@@ -698,12 +849,10 @@ export const runSmtlibScript = (
|
|
|
698
849
|
);
|
|
699
850
|
return state.datalog;
|
|
700
851
|
};
|
|
701
|
-
const getTactic = (sexpr: SExpr, end: SmtList["end"]) =>
|
|
702
|
-
compileTactic(getTacticEnvironment(), sexpr, end);
|
|
703
852
|
const getGoal = (isTrackingDependencies = false) => {
|
|
704
|
-
const state = script.state;
|
|
705
853
|
const goal = new Goal(state.manager);
|
|
706
854
|
goal.isProofsEnabled = settings.isProducingProofs || state.isProofsEnabled === true;
|
|
855
|
+
goal.isModelsEnabled = settings.isProducingModels;
|
|
707
856
|
goal.isCoresEnabled = settings.isProducingUnsatCores;
|
|
708
857
|
for (const [index, assertion] of state.assertions.entries())
|
|
709
858
|
goal.assert(
|
|
@@ -714,15 +863,43 @@ export const runSmtlibScript = (
|
|
|
714
863
|
);
|
|
715
864
|
return goal;
|
|
716
865
|
};
|
|
717
|
-
const
|
|
718
|
-
|
|
719
|
-
|
|
866
|
+
const getCommandGoal = (isTrackingDependencies: boolean, end: SmtToken) => {
|
|
867
|
+
if (
|
|
868
|
+
settings.isProducingUnsatCores &&
|
|
869
|
+
(settings.isProducingProofs || state.isProofsEnabled === true)
|
|
870
|
+
)
|
|
871
|
+
throw new SmtParseError(
|
|
872
|
+
"Frontend does not support simultaneous generation of proofs and unsat cores",
|
|
873
|
+
end,
|
|
874
|
+
);
|
|
875
|
+
return getGoal(isTrackingDependencies);
|
|
876
|
+
};
|
|
877
|
+
const hasNames = () => state.names.some((name) => name !== -1);
|
|
878
|
+
// parse_check_sat shrinks the expression stack once the check has run.
|
|
879
|
+
const checkSatAssuming = (items: SmtList["items"], itemsEnd: SmtToken, end: SmtToken) => {
|
|
880
|
+
const literals: number[] = [];
|
|
881
|
+
try {
|
|
882
|
+
for (const [index, item] of items.entries())
|
|
883
|
+
literals.push(
|
|
884
|
+
state.reader.parseFormula(
|
|
885
|
+
item,
|
|
886
|
+
items[index + 1] ?? itemsEnd,
|
|
887
|
+
"invalid check-sat command, argument must be a Boolean literal",
|
|
888
|
+
),
|
|
889
|
+
);
|
|
890
|
+
checkSat(literals, end);
|
|
891
|
+
} finally {
|
|
892
|
+
for (const literal of literals) state.manager.decRef(literal);
|
|
893
|
+
}
|
|
894
|
+
};
|
|
720
895
|
const addObjective = (list: SmtList, isMax: boolean) => {
|
|
721
|
-
const
|
|
722
|
-
const term = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
896
|
+
const term = state.reader.parseTerm(getFirstArgument(list));
|
|
723
897
|
const sort = state.manager.sorts[term];
|
|
724
898
|
if (sort !== SORT_INT && sort !== SORT_REAL && !state.manager.isBvSort(sort))
|
|
725
|
-
throw new SmtParseError(
|
|
899
|
+
throw new SmtParseError(
|
|
900
|
+
"Objective must be bit-vector, integer or real",
|
|
901
|
+
list.items[2] ?? list.end,
|
|
902
|
+
);
|
|
726
903
|
resetOptimizer();
|
|
727
904
|
state.manager.incRef(term);
|
|
728
905
|
state.objectives.push({
|
|
@@ -732,9 +909,10 @@ export const runSmtlibScript = (
|
|
|
732
909
|
weights: [],
|
|
733
910
|
id: null,
|
|
734
911
|
});
|
|
912
|
+
if (settings.isPrintingSuccess) print("success");
|
|
913
|
+
checkArgumentCount(list, 1);
|
|
735
914
|
};
|
|
736
915
|
const releaseObjectives = (size: number, softSize: number) => {
|
|
737
|
-
const state = script.state;
|
|
738
916
|
for (const index of state.softTrail.splice(softSize).reverse()) {
|
|
739
917
|
const objective = state.objectives[index];
|
|
740
918
|
state.manager.decRef(objective.terms.pop() as number);
|
|
@@ -744,13 +922,11 @@ export const runSmtlibScript = (
|
|
|
744
922
|
if (objective.type !== O_MAXSMT) state.manager.decRef(objective.term);
|
|
745
923
|
};
|
|
746
924
|
const restoreAssertions = (size: number) => {
|
|
747
|
-
const state = script.state;
|
|
748
925
|
for (const assertion of state.assertions.splice(size)) state.manager.decRef(assertion);
|
|
749
926
|
for (const name of state.names.splice(size)) if (name !== -1) state.manager.decRef(name);
|
|
750
927
|
state.assertionTexts.length = size;
|
|
751
928
|
};
|
|
752
929
|
const instantiate = (list: SmtList, isNested: boolean) => {
|
|
753
|
-
const state = script.state;
|
|
754
930
|
const manager = state.manager;
|
|
755
931
|
const outer = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
756
932
|
if (manager.kinds[outer] !== KIND_QUANTIFIER)
|
|
@@ -781,713 +957,1017 @@ export const runSmtlibScript = (
|
|
|
781
957
|
manager.decRef(result);
|
|
782
958
|
manager.decRef(substituted);
|
|
783
959
|
};
|
|
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)
|
|
960
|
+
// parser::parse_func_decl_ref: a name, or a name with its signature. Z3 ends the message of an
|
|
961
|
+
// unexpected token with the last identifier it read.
|
|
962
|
+
const getFuncDeclRef = (reference: SExpr) => {
|
|
963
|
+
if (isSymbol(reference)) {
|
|
964
|
+
const decls = state.reader.getFuncs(reference.text);
|
|
965
|
+
if (decls.length > 1)
|
|
854
966
|
throw new SmtParseError(
|
|
855
|
-
`
|
|
856
|
-
|
|
967
|
+
`ambiguous function declaration reference, provide full signature to disambiguate (<symbol> (<sort>*) <sort>) ${reference.text}`,
|
|
968
|
+
reference,
|
|
857
969
|
);
|
|
858
|
-
|
|
859
|
-
const relation = decls[0];
|
|
860
|
-
if (!datalog.isPredicateDecl(relation))
|
|
970
|
+
if (decls.length === 0)
|
|
861
971
|
throw new SmtParseError(
|
|
862
|
-
|
|
863
|
-
|
|
972
|
+
`invalid function declaration reference, unknown function ${reference.text}`,
|
|
973
|
+
reference,
|
|
864
974
|
);
|
|
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
|
-
|
|
975
|
+
return decls[0];
|
|
976
|
+
}
|
|
977
|
+
const name = reference.kind === "list" ? (reference.items[0] ?? reference.end) : reference;
|
|
978
|
+
if (reference.kind !== "list" || name.kind !== "symbol") {
|
|
979
|
+
if (name.kind === "list")
|
|
980
|
+
throw new SmtUnsupportedError("an indexed function declaration reference");
|
|
981
|
+
throw new SmtParseError(
|
|
982
|
+
`invalid function declaration reference, symbol or '(' expected got ${name.lastId}`,
|
|
983
|
+
name,
|
|
984
|
+
);
|
|
985
|
+
}
|
|
986
|
+
const domain = reference.items[1] ?? reference.end;
|
|
987
|
+
if (domain.kind !== "list")
|
|
988
|
+
throw new SmtParseError(
|
|
989
|
+
`Invalid function name. Expecting sort list starting with '(' to disambiguate function name got ${domain.lastId}`,
|
|
990
|
+
domain,
|
|
991
|
+
);
|
|
992
|
+
const sorts = domain.items.map((sort) => state.reader.parseSort(sort));
|
|
993
|
+
if (reference.items[2] === undefined)
|
|
994
|
+
throw new SmtParseError("Invalid function name invalid sort, unexpected ')'", reference.end);
|
|
995
|
+
const range = state.reader.parseSort(reference.items[2]);
|
|
996
|
+
const follower = reference.items[3] ?? reference.end;
|
|
997
|
+
const found = state.reader.getFuncs(name.text).find((decl) => {
|
|
998
|
+
const funcDecl = state.manager.funcDecls[decl];
|
|
999
|
+
return (
|
|
1000
|
+
funcDecl.range === range &&
|
|
1001
|
+
funcDecl.domain.length === sorts.length &&
|
|
1002
|
+
funcDecl.domain.every((sort, index) => sort === sorts[index])
|
|
1003
|
+
);
|
|
1004
|
+
});
|
|
1005
|
+
if (found === undefined)
|
|
1006
|
+
throw new SmtParseError(
|
|
1007
|
+
`invalid function declaration reference, unknown indexed function ${name.text}`,
|
|
1008
|
+
follower,
|
|
1009
|
+
);
|
|
1010
|
+
if (follower !== reference.end)
|
|
1011
|
+
throw new SmtUnsupportedError("a function declaration reference with trailing terms");
|
|
1012
|
+
return found;
|
|
1013
|
+
};
|
|
1014
|
+
const runCommand = new Map<string, (list: SmtList) => void>([
|
|
1015
|
+
[
|
|
1016
|
+
"assert",
|
|
1017
|
+
(list) => {
|
|
1018
|
+
const term = list.items[1] ?? list.end;
|
|
1019
|
+
const follower = list.items[2] ?? list.end;
|
|
1020
|
+
const assertion = state.reader.parseAssertion(term, follower);
|
|
1021
|
+
const logicError = state.reader.getLogicError(assertion.formula);
|
|
1022
|
+
if (logicError !== undefined) {
|
|
1023
|
+
state.manager.decRef(assertion.formula);
|
|
1024
|
+
throw new SmtParseError(logicError, follower);
|
|
1025
|
+
}
|
|
1026
|
+
state.assertions.push(assertion.formula);
|
|
1027
|
+
state.assertionTexts.push(
|
|
1028
|
+
text.slice(term.offset, (term.kind === "list" ? term.end : term).endOffset).trim(),
|
|
908
1029
|
);
|
|
909
|
-
|
|
910
|
-
|
|
911
|
-
|
|
912
|
-
|
|
913
|
-
|
|
914
|
-
|
|
915
|
-
|
|
916
|
-
|
|
917
|
-
|
|
918
|
-
|
|
919
|
-
|
|
920
|
-
|
|
921
|
-
|
|
922
|
-
|
|
923
|
-
|
|
924
|
-
|
|
925
|
-
|
|
926
|
-
|
|
927
|
-
|
|
928
|
-
|
|
929
|
-
|
|
930
|
-
|
|
931
|
-
|
|
932
|
-
|
|
933
|
-
|
|
934
|
-
|
|
935
|
-
|
|
936
|
-
|
|
937
|
-
|
|
938
|
-
|
|
939
|
-
|
|
940
|
-
|
|
941
|
-
|
|
942
|
-
|
|
943
|
-
|
|
1030
|
+
if (state.hasChecked) state.isIncremental = true;
|
|
1031
|
+
resetOptimizer();
|
|
1032
|
+
if (!settings.isProducingUnsatCores || assertion.name === undefined) state.names.push(-1);
|
|
1033
|
+
else {
|
|
1034
|
+
const manager = state.manager;
|
|
1035
|
+
const answer = manager.mkApp(
|
|
1036
|
+
manager.mkFuncDecl(assertion.name, [], SORT_BOOL, true),
|
|
1037
|
+
[],
|
|
1038
|
+
SORT_BOOL,
|
|
1039
|
+
);
|
|
1040
|
+
manager.incRef(answer);
|
|
1041
|
+
state.names.push(answer);
|
|
1042
|
+
}
|
|
1043
|
+
assertInKernel(assertion.formula, state.names[state.names.length - 1]);
|
|
1044
|
+
clearCheck();
|
|
1045
|
+
if (follower !== list.end)
|
|
1046
|
+
throw new SmtParseError("invalid assert command, ')' expected", follower);
|
|
1047
|
+
},
|
|
1048
|
+
],
|
|
1049
|
+
[
|
|
1050
|
+
"check-sat",
|
|
1051
|
+
(list) => {
|
|
1052
|
+
checkSatAssuming(list.items.slice(1), list.end, list.end);
|
|
1053
|
+
validateCheck(list.end);
|
|
1054
|
+
},
|
|
1055
|
+
],
|
|
1056
|
+
[
|
|
1057
|
+
"declare-rel",
|
|
1058
|
+
(list) => {
|
|
1059
|
+
const name = list.items[1];
|
|
1060
|
+
const domain = list.items[2];
|
|
1061
|
+
if (!isSymbol(name) || domain?.kind !== "list")
|
|
1062
|
+
throw new SmtParseError("at least 2 arguments expected", list.end);
|
|
1063
|
+
const decl = state.manager.mkFuncDecl(
|
|
1064
|
+
name.text,
|
|
1065
|
+
domain.items.map((sort) => state.reader.parseSort(sort)),
|
|
1066
|
+
SORT_BOOL,
|
|
1067
|
+
);
|
|
1068
|
+
state.reader.insertFunc(decl, list.end);
|
|
1069
|
+
getDatalog().registerPredicate(decl);
|
|
1070
|
+
},
|
|
1071
|
+
],
|
|
1072
|
+
[
|
|
1073
|
+
"declare-var",
|
|
1074
|
+
(list) => {
|
|
1075
|
+
const name = list.items[1];
|
|
1076
|
+
const sort = list.items[2];
|
|
1077
|
+
if (!isSymbol(name) || sort === undefined)
|
|
1078
|
+
throw new SmtParseError(
|
|
1079
|
+
"invalid declare-var command, symbol and sort expected",
|
|
1080
|
+
list.end,
|
|
1081
|
+
);
|
|
1082
|
+
const manager = state.manager;
|
|
1083
|
+
const range = state.reader.parseSort(sort);
|
|
1084
|
+
const decl = manager.mkFuncDecl(name.text, [], range);
|
|
1085
|
+
state.reader.insertFunc(decl, list.end);
|
|
1086
|
+
getDatalog().registerVariable(manager.mkApp(decl, [], range));
|
|
1087
|
+
},
|
|
1088
|
+
],
|
|
1089
|
+
[
|
|
1090
|
+
"rule",
|
|
1091
|
+
(list) => {
|
|
1092
|
+
const rule = list.items[1];
|
|
1093
|
+
if (rule === undefined) throw new SmtParseError("invalid rule, expected formula", list.end);
|
|
1094
|
+
const name = list.items[2];
|
|
1095
|
+
getDatalog().addRule(
|
|
1096
|
+
state.reader.parseFormula(rule, rule),
|
|
1097
|
+
isSymbol(name) ? name.text : "",
|
|
1098
|
+
);
|
|
1099
|
+
},
|
|
1100
|
+
],
|
|
1101
|
+
[
|
|
1102
|
+
"query",
|
|
1103
|
+
(list) => {
|
|
1104
|
+
if (list.items[1] === undefined)
|
|
1105
|
+
throw new SmtParseError("invalid query command, argument expected", list.end);
|
|
1106
|
+
const relation = getFuncDeclRef(list.items[1]);
|
|
1107
|
+
const datalog = getDatalog();
|
|
1108
|
+
// dl_query_cmd::set_next_arg runs once the parser is past the reference.
|
|
1109
|
+
const follower = list.items[2] ?? list.end;
|
|
1110
|
+
if (!datalog.isPredicateDecl(relation))
|
|
1111
|
+
throw new SmtParseError(
|
|
1112
|
+
"Invalid query argument, expected a predicate registered as a relation",
|
|
1113
|
+
follower,
|
|
1114
|
+
);
|
|
1115
|
+
if (follower.kind !== "keyword" && follower !== list.end)
|
|
1116
|
+
throw new SmtParseError("invalid command argument, keyword expected", follower);
|
|
1117
|
+
for (const assertion of state.assertions) datalog.assertExpr(assertion);
|
|
1118
|
+
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
1119
|
+
state.manager.limit.push(settings.rlimit);
|
|
1120
|
+
let status = L_UNDEF;
|
|
1121
|
+
try {
|
|
1122
|
+
status = datalog.relQuery(relation);
|
|
1123
|
+
} catch (error) {
|
|
1124
|
+
if (!(error instanceof SmtTacticError)) throw error;
|
|
1125
|
+
print(`(error "query failed: ${error.message}")`);
|
|
1126
|
+
} finally {
|
|
1127
|
+
state.manager.limit.pop();
|
|
1128
|
+
}
|
|
1129
|
+
print(status === L_UNDEF && datalog.isBounded ? "bounded" : getVerdict(status));
|
|
1130
|
+
datalog.isBounded = false;
|
|
1131
|
+
},
|
|
1132
|
+
],
|
|
1133
|
+
[
|
|
1134
|
+
"check-sat-using",
|
|
1135
|
+
(list) => {
|
|
1136
|
+
const params = getCommandParams(list.items, CHECK_SAT_USING_PARAMETERS);
|
|
1137
|
+
if (list.items[1] === undefined)
|
|
1138
|
+
throw new SmtParseError("check-sat-using needs a tactic argument", list.end);
|
|
1139
|
+
expectClosed(list.items[1]);
|
|
1140
|
+
const builder = compileTactic(getTacticEnvironment(), list.items[1]);
|
|
1141
|
+
const tactic = builder.build(params);
|
|
1142
|
+
const goal = getCommandGoal(builder.isTrackingDependencies, list.end);
|
|
1143
|
+
clearCheck();
|
|
1144
|
+
const deadline = Date.now() + options.timeLimitMs;
|
|
1145
|
+
state.manager.limit.restart(deadline);
|
|
1146
|
+
state.manager.limit.push(settings.rlimit);
|
|
1147
|
+
try {
|
|
1148
|
+
const checked = checkSatUsing(tactic, goal);
|
|
1149
|
+
setCheck(checked.status, {
|
|
1150
|
+
isFromTactic: true,
|
|
1151
|
+
model: checked.model,
|
|
1152
|
+
core:
|
|
1153
|
+
builder.isTrackingDependencies || !hasNames()
|
|
1154
|
+
? getDependencyValues(checked.core)
|
|
1155
|
+
: undefined,
|
|
1156
|
+
reasonUnknown: checked.reasonUnknown ?? getCancelMessage(deadline),
|
|
1157
|
+
});
|
|
1158
|
+
print(getVerdict(checked.status));
|
|
1159
|
+
} finally {
|
|
1160
|
+
state.manager.limit.pop();
|
|
1161
|
+
}
|
|
1162
|
+
validateCheck(list.end);
|
|
1163
|
+
},
|
|
1164
|
+
],
|
|
1165
|
+
[
|
|
1166
|
+
"check-sat-assuming",
|
|
1167
|
+
(list) => {
|
|
1168
|
+
const literals = list.items[1] ?? list.end;
|
|
1169
|
+
if (literals.kind !== "list")
|
|
1170
|
+
throw new SmtParseError(
|
|
1171
|
+
`invalid check-sat-assuming command, '(', expected got ${literals.lastId}`,
|
|
1172
|
+
literals,
|
|
1173
|
+
);
|
|
1174
|
+
checkSatAssuming(literals.items, literals.end, list.end);
|
|
1175
|
+
validateCheck(list.end);
|
|
1176
|
+
},
|
|
1177
|
+
],
|
|
1178
|
+
[
|
|
1179
|
+
"get-consequences",
|
|
1180
|
+
(list) => {
|
|
1181
|
+
const manager = state.manager;
|
|
1182
|
+
const [assumptions, vars] = [list.items[1], list.items[2]].map((terms) => {
|
|
1183
|
+
if (terms === undefined)
|
|
1184
|
+
throw new SmtParseError("invalid command, argument(s) missing", list.end);
|
|
1185
|
+
if (terms.kind !== "list")
|
|
1186
|
+
throw new SmtParseError(
|
|
1187
|
+
`invalid list of terms, '(' expected got ${terms.lastId}`,
|
|
1188
|
+
terms,
|
|
1189
|
+
);
|
|
1190
|
+
return terms.items.map((item) => state.reader.parseTerm(item));
|
|
1191
|
+
});
|
|
1192
|
+
if (list.items.length > 3)
|
|
1193
|
+
throw new SmtParseError("invalid command, too many arguments", list.items[3]);
|
|
1194
|
+
clearCheck();
|
|
1195
|
+
const deadline = Date.now() + options.timeLimitMs;
|
|
1196
|
+
manager.limit.restart(deadline);
|
|
1197
|
+
manager.limit.push(settings.rlimit);
|
|
1198
|
+
const names = state.names.filter((name) => name !== -1);
|
|
1199
|
+
try {
|
|
1200
|
+
if (isUsingFdSolver()) {
|
|
1201
|
+
if (names.length > 0)
|
|
1202
|
+
throw new SmtUnsupportedError("the named assertions of the finite-domain solver");
|
|
1203
|
+
const found = getFdConsequences(
|
|
1204
|
+
manager,
|
|
1205
|
+
new Map(),
|
|
1206
|
+
state.assertions,
|
|
1207
|
+
assumptions,
|
|
1208
|
+
vars,
|
|
1209
|
+
);
|
|
1210
|
+
setCheck(found.result, {
|
|
1211
|
+
model: found.model,
|
|
1212
|
+
core: found.core,
|
|
1213
|
+
reasonUnknown: found.reasonUnknown,
|
|
1214
|
+
});
|
|
1215
|
+
print(getVerdict(found.result));
|
|
1216
|
+
print("");
|
|
1217
|
+
for (const consequence of found.consequences.items) display(consequence);
|
|
1218
|
+
found.consequences.reset();
|
|
1219
|
+
return;
|
|
1220
|
+
}
|
|
1221
|
+
const kernel = state.kernel ?? new SmtKernel(manager, getKernelParams());
|
|
1222
|
+
if (state.kernel === undefined)
|
|
1223
|
+
for (const assertion of getNamedAssertions()) kernel.assertExpr(assertion);
|
|
1224
|
+
const found = getConsequences(kernel, [...names, ...assumptions], vars);
|
|
1225
|
+
setCheck(found.result, {
|
|
1226
|
+
context: kernel.context,
|
|
1227
|
+
core: kernel.context.unsatCore,
|
|
1228
|
+
reasonUnknown: kernel.context.getLastFailureMessage(),
|
|
1229
|
+
});
|
|
944
1230
|
print(getVerdict(found.result));
|
|
945
1231
|
print("");
|
|
946
1232
|
for (const consequence of found.consequences.items) display(consequence);
|
|
947
1233
|
found.consequences.reset();
|
|
948
|
-
|
|
1234
|
+
} catch (error) {
|
|
1235
|
+
if (!(error instanceof SmtCanceledError || isStackOverflow(error))) throw error;
|
|
1236
|
+
const reasonUnknown = getCancelMessage(deadline);
|
|
1237
|
+
if (state.kernel !== undefined) state.kernel.context.reasonUnknown = reasonUnknown;
|
|
1238
|
+
setCheck(L_UNDEF, { reasonUnknown });
|
|
1239
|
+
print("unknown");
|
|
1240
|
+
print("");
|
|
1241
|
+
} finally {
|
|
1242
|
+
manager.limit.pop();
|
|
949
1243
|
}
|
|
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,
|
|
1244
|
+
},
|
|
1245
|
+
],
|
|
1246
|
+
["minimize", (list) => addObjective(list, false)],
|
|
1247
|
+
["maximize", (list) => addObjective(list, true)],
|
|
1248
|
+
[
|
|
1249
|
+
"assert-soft",
|
|
1250
|
+
(list) => {
|
|
1251
|
+
const formula = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1252
|
+
if (state.manager.sorts[formula] !== SORT_BOOL)
|
|
1253
|
+
throw new SmtParseError("Invalid type for expression. Expected Boolean type.", list.end);
|
|
1254
|
+
const parameters = getSoftParameters(list.items.slice(2));
|
|
1255
|
+
resetOptimizer();
|
|
1256
|
+
const existing = state.objectives.findIndex(
|
|
1257
|
+
(objective) => objective.type === O_MAXSMT && objective.id === parameters.id,
|
|
1018
1258
|
);
|
|
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
|
-
|
|
1259
|
+
const index = existing === -1 ? state.objectives.length : existing;
|
|
1260
|
+
if (existing === -1)
|
|
1261
|
+
state.objectives.push({
|
|
1262
|
+
type: O_MAXSMT,
|
|
1263
|
+
term: -1,
|
|
1264
|
+
terms: [],
|
|
1265
|
+
weights: [],
|
|
1266
|
+
id: parameters.id,
|
|
1267
|
+
});
|
|
1268
|
+
if (parameters.weight.isZero()) return;
|
|
1269
|
+
state.manager.incRef(formula);
|
|
1270
|
+
state.objectives[index].terms.push(formula);
|
|
1271
|
+
state.objectives[index].weights.push(parameters.weight);
|
|
1272
|
+
state.softTrail.push(index);
|
|
1273
|
+
},
|
|
1274
|
+
],
|
|
1275
|
+
[
|
|
1276
|
+
"push",
|
|
1277
|
+
(list) => {
|
|
1278
|
+
clearCheck();
|
|
1279
|
+
for (let index = getScopeCount(list); index > 0; index--) {
|
|
1280
|
+
state.scopes.push({
|
|
1281
|
+
assertions: state.assertions.length,
|
|
1282
|
+
objectives: state.objectives.length,
|
|
1283
|
+
softTrail: state.softTrail.length,
|
|
1284
|
+
});
|
|
1285
|
+
state.reader.push();
|
|
1286
|
+
state.isIncremental = true;
|
|
1046
1287
|
state.kernel?.push();
|
|
1047
|
-
|
|
1288
|
+
useSatSolver((solver) => solver.push());
|
|
1048
1289
|
}
|
|
1049
|
-
|
|
1050
|
-
|
|
1051
|
-
|
|
1052
|
-
|
|
1053
|
-
|
|
1054
|
-
|
|
1055
|
-
|
|
1056
|
-
|
|
1057
|
-
|
|
1058
|
-
|
|
1059
|
-
|
|
1060
|
-
|
|
1061
|
-
|
|
1062
|
-
|
|
1063
|
-
|
|
1064
|
-
|
|
1065
|
-
|
|
1066
|
-
|
|
1067
|
-
|
|
1068
|
-
|
|
1069
|
-
|
|
1070
|
-
|
|
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;
|
|
1290
|
+
if (list.items[2] !== undefined)
|
|
1291
|
+
throw new SmtParseError("invalid push command, ')' expected", list.items[2]);
|
|
1292
|
+
},
|
|
1293
|
+
],
|
|
1294
|
+
[
|
|
1295
|
+
"pop",
|
|
1296
|
+
(list) => {
|
|
1297
|
+
const count = getScopeCount(list);
|
|
1298
|
+
const follower = list.items[2] ?? list.end;
|
|
1299
|
+
clearCheck();
|
|
1300
|
+
if (count > state.scopes.length)
|
|
1301
|
+
throw new SmtParseError(
|
|
1302
|
+
"invalid pop command, argument is greater than the current stack depth",
|
|
1303
|
+
follower,
|
|
1304
|
+
);
|
|
1305
|
+
if (count > 0) {
|
|
1306
|
+
state.isIncremental = true;
|
|
1307
|
+
const scope = state.scopes[state.scopes.length - count];
|
|
1308
|
+
state.kernel?.pop(count);
|
|
1309
|
+
useSatSolver((solver) => solver.pop(count));
|
|
1310
|
+
state.reader.pop(count);
|
|
1311
|
+
restoreAssertions(scope.assertions);
|
|
1312
|
+
resetOptimizer();
|
|
1313
|
+
releaseObjectives(scope.objectives, scope.softTrail);
|
|
1314
|
+
state.scopes.length -= count;
|
|
1114
1315
|
}
|
|
1115
|
-
|
|
1116
|
-
|
|
1117
|
-
|
|
1118
|
-
|
|
1119
|
-
|
|
1120
|
-
|
|
1121
|
-
|
|
1316
|
+
if (follower !== list.end)
|
|
1317
|
+
throw new SmtParseError("invalid pop command, ')' expected", follower);
|
|
1318
|
+
},
|
|
1319
|
+
],
|
|
1320
|
+
[
|
|
1321
|
+
"reset",
|
|
1322
|
+
(list) => {
|
|
1323
|
+
if (list.items[1] !== undefined)
|
|
1324
|
+
throw new SmtParseError("invalid reset command, ')' expected", list.items[1]);
|
|
1325
|
+
clearCheck();
|
|
1326
|
+
resetOptimizer();
|
|
1327
|
+
state = createState();
|
|
1328
|
+
},
|
|
1329
|
+
],
|
|
1330
|
+
[
|
|
1331
|
+
"reset-assertions",
|
|
1332
|
+
(list) => {
|
|
1333
|
+
checkArgumentCount(list, 0);
|
|
1334
|
+
restoreAssertions(0);
|
|
1335
|
+
resetOptimizer();
|
|
1336
|
+
releaseObjectives(0, 0);
|
|
1337
|
+
state.scopes = state.scopes.map(() => ({ assertions: 0, objectives: 0, softTrail: 0 }));
|
|
1338
|
+
if (state.isProofsEnabled !== undefined) resetKernel();
|
|
1339
|
+
state.isIncremental = state.scopes.length > 0;
|
|
1340
|
+
state.hasChecked = false;
|
|
1341
|
+
},
|
|
1342
|
+
],
|
|
1343
|
+
[
|
|
1344
|
+
"simplify",
|
|
1345
|
+
(list) => {
|
|
1122
1346
|
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
|
-
|
|
1347
|
+
if (list.items.length < 2)
|
|
1348
|
+
throw new SmtParseError("invalid simplify command, argument expected", list.end);
|
|
1349
|
+
const term = state.reader.parseTerm(list.items[1]);
|
|
1350
|
+
manager.incRef(term);
|
|
1351
|
+
const rewriter = new Rewriter(
|
|
1352
|
+
manager,
|
|
1353
|
+
getRewriterOptions(manager, getSimplifyParams(list.items.slice(2))),
|
|
1354
|
+
);
|
|
1355
|
+
// simplify_cmd prints a failure of the rewriter and then the term as it was.
|
|
1356
|
+
const simplified = (() => {
|
|
1357
|
+
try {
|
|
1358
|
+
return rewriter.rewrite(term);
|
|
1359
|
+
} catch (error) {
|
|
1360
|
+
if (!(error instanceof SmtDefaultError)) throw error;
|
|
1361
|
+
print(`(error "simplifier failed: ${error.message}")`);
|
|
1362
|
+
manager.incRef(term);
|
|
1363
|
+
return term;
|
|
1364
|
+
}
|
|
1365
|
+
})();
|
|
1366
|
+
rewriter.cleanup();
|
|
1367
|
+
display(simplified);
|
|
1368
|
+
rewriter.release();
|
|
1369
|
+
manager.decRef(simplified);
|
|
1370
|
+
manager.decRef(term);
|
|
1371
|
+
},
|
|
1372
|
+
],
|
|
1373
|
+
// The Boolean rewriter alone matches the simplifier only on Boolean structure over constants.
|
|
1374
|
+
[
|
|
1375
|
+
"dbg-bool-flat-rewriter",
|
|
1376
|
+
(list) => {
|
|
1377
|
+
const manager = state.manager;
|
|
1378
|
+
if (list.items.length !== 2)
|
|
1379
|
+
throw new SmtParseError("invalid command, one argument expected", list.end);
|
|
1380
|
+
const term = state.reader.parseTerm(list.items[1]);
|
|
1381
|
+
manager.incRef(term);
|
|
1382
|
+
const visited = new Set<number>();
|
|
1383
|
+
const todo = [term];
|
|
1384
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
1385
|
+
if (visited.has(expr)) continue;
|
|
1386
|
+
visited.add(expr);
|
|
1387
|
+
const family = manager.kinds[expr] === KIND_APP ? manager.getFamily(expr) : -1;
|
|
1388
|
+
if (family !== FAMILY_BASIC && family !== FAMILY_USER && !manager.isNumeral(expr))
|
|
1389
|
+
throw new SmtUnsupportedError(
|
|
1390
|
+
"the command dbg-bool-flat-rewriter beyond Boolean terms",
|
|
1391
|
+
);
|
|
1392
|
+
manager.pushArgs(expr, todo);
|
|
1393
|
+
}
|
|
1394
|
+
const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
|
|
1395
|
+
const rewritten = rewriter.rewrite(term);
|
|
1396
|
+
display(rewritten);
|
|
1397
|
+
rewriter.release();
|
|
1398
|
+
manager.decRef(rewritten);
|
|
1399
|
+
manager.decRef(term);
|
|
1400
|
+
},
|
|
1401
|
+
],
|
|
1402
|
+
[
|
|
1403
|
+
"apply",
|
|
1404
|
+
(list) => {
|
|
1405
|
+
const params = getCommandParams(list.items, APPLY_PARAMETERS);
|
|
1406
|
+
if (list.items[1] === undefined)
|
|
1407
|
+
throw new SmtParseError("apply needs a tactic argument", list.end);
|
|
1408
|
+
expectClosed(list.items[1]);
|
|
1409
|
+
// apply_tactic_cmd, unlike check-sat-using, gives the tactic no logic.
|
|
1410
|
+
const builder = compileTactic(
|
|
1411
|
+
{ ...getTacticEnvironment(), setup: { ...getSetup(), logic: undefined } },
|
|
1412
|
+
list.items[1],
|
|
1413
|
+
);
|
|
1414
|
+
const tactic = builder.build(params);
|
|
1415
|
+
const input = getCommandGoal(builder.isTrackingDependencies, list.end);
|
|
1416
|
+
const isPrintingDependencies = params.get("print_dependencies") === true;
|
|
1417
|
+
if (isPrintingDependencies && !builder.isTrackingDependencies && hasNames())
|
|
1418
|
+
throw new SmtUnsupportedError("the dependencies of a tactic that drops dependencies");
|
|
1419
|
+
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
1420
|
+
const goals = (() => {
|
|
1421
|
+
try {
|
|
1422
|
+
return applyTactic(tactic, input);
|
|
1423
|
+
} catch (error) {
|
|
1424
|
+
if (!(error instanceof SmtTacticError)) throw error;
|
|
1425
|
+
print(`(error "tactic failed: ${error.message}")`);
|
|
1426
|
+
return undefined;
|
|
1427
|
+
}
|
|
1428
|
+
})();
|
|
1429
|
+
// apply_tactic_cmd releases the result goals and then the input goal.
|
|
1430
|
+
if (goals === undefined) {
|
|
1431
|
+
input.reset();
|
|
1432
|
+
return;
|
|
1433
|
+
}
|
|
1434
|
+
try {
|
|
1435
|
+
const manager = state.manager;
|
|
1436
|
+
const environment = getPrintEnvironment();
|
|
1437
|
+
if (params.get("print") !== false)
|
|
1438
|
+
print(
|
|
1439
|
+
[
|
|
1440
|
+
"(goals",
|
|
1441
|
+
...goals.map((goal) =>
|
|
1442
|
+
[
|
|
1443
|
+
"(goal",
|
|
1444
|
+
...goal.forms.items.flatMap((form, index) => [
|
|
1445
|
+
...(isPrintingDependencies
|
|
1446
|
+
? [
|
|
1447
|
+
[
|
|
1448
|
+
" |-",
|
|
1449
|
+
...getDependencyValues(goal.getDependency(index)).map(format),
|
|
1450
|
+
].join(" "),
|
|
1451
|
+
]
|
|
1452
|
+
: []),
|
|
1453
|
+
` ${printExpr(state.manager, environment, form, 2)}`,
|
|
1454
|
+
]),
|
|
1455
|
+
` :precision ${PRECISION_NAMES[goal.precision]} :depth ${goal.depth})`,
|
|
1456
|
+
].join("\n"),
|
|
1457
|
+
),
|
|
1458
|
+
")",
|
|
1459
|
+
].join("\n"),
|
|
1460
|
+
);
|
|
1461
|
+
if (
|
|
1462
|
+
params.get("print_model_converter") === true &&
|
|
1463
|
+
input.converters.some(
|
|
1464
|
+
(entry) => !("definitions" in entry) || entry.definitions.length > 0,
|
|
1465
|
+
)
|
|
1152
1466
|
)
|
|
1153
|
-
|
|
1154
|
-
|
|
1155
|
-
|
|
1156
|
-
|
|
1157
|
-
|
|
1158
|
-
|
|
1159
|
-
|
|
1160
|
-
|
|
1161
|
-
|
|
1162
|
-
|
|
1467
|
+
throw new SmtUnsupportedError("printing a model converter");
|
|
1468
|
+
if (params.get("print_benchmark") !== true) return;
|
|
1469
|
+
const assertions =
|
|
1470
|
+
goals.length === 1
|
|
1471
|
+
? goals[0].forms.items
|
|
1472
|
+
: [
|
|
1473
|
+
manager.mkOr(
|
|
1474
|
+
goals.map((goal) =>
|
|
1475
|
+
goal.forms.size === 1 ? goal.forms.items[0] : manager.mkAnd(goal.forms.items),
|
|
1476
|
+
),
|
|
1163
1477
|
),
|
|
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);
|
|
1478
|
+
];
|
|
1479
|
+
for (const assertion of assertions) manager.incRef(assertion);
|
|
1480
|
+
const visited = new Set<number>();
|
|
1481
|
+
const decls = new Set<number>();
|
|
1482
|
+
for (const assertion of assertions) {
|
|
1483
|
+
const todo = [assertion];
|
|
1484
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
1485
|
+
if (visited.has(expr)) continue;
|
|
1486
|
+
visited.add(expr);
|
|
1487
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
1488
|
+
const data = manager.getQuantifier(expr);
|
|
1489
|
+
todo.push(data.body, ...data.patterns, ...data.noPatterns);
|
|
1490
|
+
} else if (manager.kinds[expr] === KIND_APP) {
|
|
1491
|
+
manager.pushArgs(expr, todo);
|
|
1492
|
+
const decl = manager.decls[expr];
|
|
1493
|
+
const family = manager.funcDecls[decl].family;
|
|
1494
|
+
if (family === FAMILY_USER || family === FAMILY_MODEL_VALUE) decls.add(decl);
|
|
1495
|
+
}
|
|
1183
1496
|
}
|
|
1184
1497
|
}
|
|
1498
|
+
const lines = [...decls].map((decl) => {
|
|
1499
|
+
const funcDecl = manager.funcDecls[decl];
|
|
1500
|
+
return renderFormat(
|
|
1501
|
+
mkSeq1(
|
|
1502
|
+
[
|
|
1503
|
+
mkText(getQuotedName(funcDecl.name)),
|
|
1504
|
+
mkSeq5(funcDecl.domain.map((sort) => formatSort(manager, sort))),
|
|
1505
|
+
formatSort(manager, funcDecl.range),
|
|
1506
|
+
],
|
|
1507
|
+
"declare-fun",
|
|
1508
|
+
),
|
|
1509
|
+
environment.options,
|
|
1510
|
+
);
|
|
1511
|
+
});
|
|
1512
|
+
for (const assertion of assertions)
|
|
1513
|
+
lines.push(`(assert ${printExpr(manager, environment, assertion, 8)})`);
|
|
1514
|
+
print([...lines, "(check-sat)"].join("\n"));
|
|
1515
|
+
for (const assertion of assertions) manager.decRef(assertion);
|
|
1516
|
+
} finally {
|
|
1517
|
+
for (const goal of goals) if (goal !== input) goal.reset();
|
|
1518
|
+
input.reset();
|
|
1185
1519
|
}
|
|
1186
|
-
|
|
1187
|
-
|
|
1188
|
-
|
|
1189
|
-
|
|
1190
|
-
|
|
1191
|
-
|
|
1192
|
-
|
|
1193
|
-
|
|
1194
|
-
|
|
1195
|
-
|
|
1196
|
-
|
|
1197
|
-
|
|
1520
|
+
},
|
|
1521
|
+
],
|
|
1522
|
+
[
|
|
1523
|
+
"get-assertions",
|
|
1524
|
+
(list) => {
|
|
1525
|
+
checkArgumentCount(list, 0);
|
|
1526
|
+
if (!settings.isInteractive)
|
|
1527
|
+
throw new SmtParseError(
|
|
1528
|
+
"command is only available in interactive mode, use command (set-option :interactive-mode true)",
|
|
1529
|
+
list.end,
|
|
1530
|
+
);
|
|
1531
|
+
print(`(${state.assertionTexts.join("\n ")})`);
|
|
1532
|
+
},
|
|
1533
|
+
],
|
|
1534
|
+
[
|
|
1535
|
+
"get-unsat-core",
|
|
1536
|
+
(list) => {
|
|
1537
|
+
checkArgumentCount(list, 0);
|
|
1538
|
+
if (!settings.isProducingUnsatCores)
|
|
1539
|
+
throw new SmtParseError(
|
|
1540
|
+
"unsat core construction is not enabled, use command (set-option :produce-unsat-cores true)",
|
|
1541
|
+
list.end,
|
|
1198
1542
|
);
|
|
1543
|
+
const check = state.check;
|
|
1544
|
+
if (check === undefined || check.status !== L_FALSE)
|
|
1545
|
+
throw new SmtParseError("unsat core is not available", list.end);
|
|
1546
|
+
if (check.core === undefined)
|
|
1547
|
+
throw new SmtUnsupportedError("the unsat core of a tactic that drops dependencies");
|
|
1548
|
+
const kernel = state.kernel;
|
|
1549
|
+
if (
|
|
1550
|
+
kernel === undefined ||
|
|
1551
|
+
check.context !== kernel.context ||
|
|
1552
|
+
settings.parameters.get("smt.core.minimize") !== "true"
|
|
1553
|
+
) {
|
|
1554
|
+
print(`(${check.core.map(format).join(" ")})`);
|
|
1555
|
+
return;
|
|
1556
|
+
}
|
|
1557
|
+
const mus = new Mus(state.manager, {
|
|
1558
|
+
checkSat: (assumptions) => kernel.check(assumptions),
|
|
1559
|
+
getUnsatCore: () => kernel.context.unsatCore,
|
|
1199
1560
|
});
|
|
1200
|
-
|
|
1201
|
-
|
|
1202
|
-
|
|
1203
|
-
|
|
1204
|
-
|
|
1205
|
-
|
|
1206
|
-
|
|
1207
|
-
|
|
1208
|
-
|
|
1209
|
-
|
|
1210
|
-
|
|
1211
|
-
|
|
1212
|
-
|
|
1213
|
-
|
|
1561
|
+
const core = [...kernel.context.unsatCore];
|
|
1562
|
+
for (const literal of core) mus.addSoft(literal);
|
|
1563
|
+
const minimized = new RefVector(state.manager);
|
|
1564
|
+
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
1565
|
+
const status = mus.getMus(minimized);
|
|
1566
|
+
print(`(${(status === L_TRUE ? minimized.items : core).map(format).join(" ")})`);
|
|
1567
|
+
minimized.reset();
|
|
1568
|
+
mus.reset();
|
|
1569
|
+
},
|
|
1570
|
+
],
|
|
1571
|
+
[
|
|
1572
|
+
"eval",
|
|
1573
|
+
(list) => {
|
|
1574
|
+
const target = list.items[1];
|
|
1575
|
+
const term = target === undefined ? -1 : state.reader.parseTerm(target);
|
|
1576
|
+
const parameter = list.items[2];
|
|
1577
|
+
if (parameter !== undefined && parameter.kind !== "keyword")
|
|
1578
|
+
throw new SmtParseError("invalid command argument, keyword expected", parameter);
|
|
1579
|
+
if (parameter !== undefined) throw new SmtUnsupportedError("the parameters of eval");
|
|
1580
|
+
const model = getModel(list);
|
|
1581
|
+
if (term === -1) throw new SmtParseError("no arguments passed to eval", list.end);
|
|
1582
|
+
const manager = state.manager;
|
|
1583
|
+
manager.incRef(term);
|
|
1584
|
+
const value = model.eval(term, false);
|
|
1585
|
+
display(value);
|
|
1586
|
+
manager.decRef(value);
|
|
1587
|
+
manager.decRef(term);
|
|
1588
|
+
},
|
|
1589
|
+
],
|
|
1590
|
+
[
|
|
1591
|
+
"get-value",
|
|
1592
|
+
(list) => {
|
|
1593
|
+
const terms = list.items[1] ?? list.end;
|
|
1594
|
+
if (terms.kind !== "list")
|
|
1595
|
+
throw new SmtParseError(
|
|
1596
|
+
`invalid get-value command, '(' expected got ${terms.lastId}`,
|
|
1597
|
+
terms,
|
|
1598
|
+
);
|
|
1599
|
+
const manager = state.manager;
|
|
1600
|
+
const exprs = terms.items.map((item) => state.reader.parseTerm(item));
|
|
1601
|
+
if (exprs.length === 0)
|
|
1602
|
+
throw new SmtParseError("invalid get-value command, empty list of terms", terms.end);
|
|
1603
|
+
const extra = list.items[2];
|
|
1604
|
+
if (
|
|
1605
|
+
extra?.kind === "keyword" &&
|
|
1606
|
+
(extra.text === ":model-index" || extra.text === ":model_index")
|
|
1607
|
+
)
|
|
1608
|
+
throw new SmtUnsupportedError("the model index of get-value");
|
|
1609
|
+
if (extra !== undefined)
|
|
1610
|
+
throw new SmtParseError("invalid get-value command, ')' expected", extra);
|
|
1611
|
+
const model = getModel(list);
|
|
1612
|
+
pendingText += "(";
|
|
1613
|
+
model.compact();
|
|
1614
|
+
// Z3 prints each term as the script spells it, from the end of the term before.
|
|
1615
|
+
const offsets = [
|
|
1616
|
+
terms.offset + 1,
|
|
1617
|
+
...terms.items.map((item) => (item.kind === "list" ? item.end : item).endOffset),
|
|
1618
|
+
];
|
|
1619
|
+
exprs.forEach((expr, index) => {
|
|
1620
|
+
manager.incRef(expr);
|
|
1621
|
+
const value = model.eval(expr, true);
|
|
1622
|
+
pendingText += `${index > 0 ? "\n " : ""}(${text.slice(offsets[index], offsets[index + 1]).trim()} ${format(value)})`;
|
|
1623
|
+
manager.decRef(value);
|
|
1624
|
+
manager.decRef(expr);
|
|
1625
|
+
});
|
|
1626
|
+
print(")");
|
|
1627
|
+
},
|
|
1628
|
+
],
|
|
1629
|
+
[
|
|
1630
|
+
"get-objectives",
|
|
1631
|
+
() => {
|
|
1632
|
+
const optimizer = state.optimizer;
|
|
1633
|
+
if (optimizer === undefined || state.check === undefined)
|
|
1634
|
+
throw new SmtUnsupportedError("the command get-objectives");
|
|
1635
|
+
print(optimizer.getObjectives(format));
|
|
1636
|
+
},
|
|
1637
|
+
],
|
|
1638
|
+
[
|
|
1639
|
+
"get-model",
|
|
1640
|
+
(list) => {
|
|
1641
|
+
for (const index of list.items.slice(1)) {
|
|
1642
|
+
if (index.kind !== "numeral")
|
|
1643
|
+
throw new SmtParseError("invalid command argument, unsigned integer expected", index);
|
|
1644
|
+
if (!isUnsigned(index.text))
|
|
1645
|
+
throw new SmtParseError(
|
|
1646
|
+
"invalid indexed identifier, index is too big to fit in an unsigned machine integer",
|
|
1647
|
+
index,
|
|
1648
|
+
);
|
|
1649
|
+
}
|
|
1650
|
+
const manager = state.manager;
|
|
1651
|
+
const model = getModel(list);
|
|
1652
|
+
const last = list.items[list.items.length - 1];
|
|
1653
|
+
// get_model_cmd takes any number of indices and keeps the last.
|
|
1654
|
+
if (last.kind === "numeral" && BigInt(last.text) > 0n)
|
|
1655
|
+
throw new SmtUnsupportedError("the index of get-model");
|
|
1656
|
+
model.compact();
|
|
1657
|
+
for (const decl of state.reader.getDeclaredFuncs()) {
|
|
1658
|
+
const funcDecl = manager.funcDecls[decl];
|
|
1659
|
+
if (
|
|
1660
|
+
funcDecl.family !== FAMILY_USER ||
|
|
1661
|
+
manager.macros.has(decl) ||
|
|
1662
|
+
model.constInterps.has(decl) ||
|
|
1663
|
+
model.funcInterps.has(decl)
|
|
1664
|
+
)
|
|
1665
|
+
continue;
|
|
1666
|
+
const value = model.getSomeValue(funcDecl.range);
|
|
1667
|
+
if (funcDecl.domain.length === 0) {
|
|
1668
|
+
model.registerConst(decl, value);
|
|
1669
|
+
continue;
|
|
1670
|
+
}
|
|
1671
|
+
const interp = new FuncInterp(manager, funcDecl.domain.length);
|
|
1672
|
+
interp.setElse(value);
|
|
1673
|
+
model.registerFunc(decl, interp);
|
|
1674
|
+
}
|
|
1675
|
+
model.addRecFuns();
|
|
1676
|
+
print(`(\n${printModel(manager, getPrintEnvironment(), model, 2)})`);
|
|
1677
|
+
},
|
|
1678
|
+
],
|
|
1679
|
+
[
|
|
1680
|
+
"display",
|
|
1681
|
+
(list) => {
|
|
1682
|
+
display(state.reader.parseTerm(getFirstArgument(list)));
|
|
1683
|
+
checkArgumentCount(list, 1);
|
|
1684
|
+
},
|
|
1685
|
+
],
|
|
1686
|
+
[
|
|
1687
|
+
"dbg-lt",
|
|
1688
|
+
(list) => {
|
|
1689
|
+
const first = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1690
|
+
const second = state.reader.parseTerm(list.items[2] ?? list.end);
|
|
1691
|
+
print(String(isAstLess(state.manager, first, second)));
|
|
1692
|
+
},
|
|
1693
|
+
],
|
|
1694
|
+
[
|
|
1695
|
+
"dbg-some-value",
|
|
1696
|
+
(list) => {
|
|
1697
|
+
display(
|
|
1698
|
+
getManagerSomeValue(state.manager, state.reader.parseSort(list.items[1] ?? list.end)),
|
|
1214
1699
|
);
|
|
1215
|
-
|
|
1216
|
-
|
|
1217
|
-
|
|
1218
|
-
|
|
1219
|
-
|
|
1220
|
-
|
|
1221
|
-
|
|
1700
|
+
},
|
|
1701
|
+
],
|
|
1702
|
+
[
|
|
1703
|
+
"dbg-used-vars",
|
|
1704
|
+
(list) => {
|
|
1705
|
+
const manager = state.manager;
|
|
1706
|
+
const term = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1707
|
+
const body =
|
|
1708
|
+
manager.kinds[term] === KIND_QUANTIFIER ? manager.getQuantifier(term).body : term;
|
|
1709
|
+
const sorts = getFreeVarSorts(manager, body, manager.freeVarBounds[body]);
|
|
1710
|
+
const lines = sorts.map(
|
|
1711
|
+
(sort, index) =>
|
|
1712
|
+
`\n (${String(index).padEnd(6)} ${sort === undefined ? "<not-used>" : renderFormat(formatSort(manager, sort), settings.printOptions)})`,
|
|
1222
1713
|
);
|
|
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
|
-
const
|
|
1714
|
+
print(`(vars${lines.join("")})`);
|
|
1715
|
+
},
|
|
1716
|
+
],
|
|
1717
|
+
[
|
|
1718
|
+
"dbg-elim-unused-vars",
|
|
1719
|
+
(list) => {
|
|
1720
|
+
const manager = state.manager;
|
|
1721
|
+
const term = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1722
|
+
if (manager.kinds[term] !== KIND_QUANTIFIER) {
|
|
1723
|
+
write(format(term), false);
|
|
1724
|
+
return;
|
|
1725
|
+
}
|
|
1726
|
+
display(elimUnusedVars(manager, term));
|
|
1727
|
+
},
|
|
1728
|
+
],
|
|
1729
|
+
["dbg-instantiate", (list) => instantiate(list, false)],
|
|
1730
|
+
["dbg-instantiate-nested", (list) => instantiate(list, true)],
|
|
1731
|
+
[
|
|
1732
|
+
"echo",
|
|
1733
|
+
(list) => {
|
|
1734
|
+
const message = getFirstArgument(list);
|
|
1735
|
+
if (message.kind !== "string")
|
|
1736
|
+
throw new SmtParseError("invalid command argument, string expected", message);
|
|
1737
|
+
print(message.text);
|
|
1738
|
+
checkArgumentCount(list, 1);
|
|
1739
|
+
},
|
|
1740
|
+
],
|
|
1741
|
+
[
|
|
1742
|
+
"set-option",
|
|
1743
|
+
(list) => {
|
|
1744
|
+
const option = list.items[1];
|
|
1745
|
+
const keyword = option?.kind === "keyword" ? option.text : "";
|
|
1746
|
+
const optionName = `:${getParameterName(keyword)}`;
|
|
1747
|
+
const value = list.items[2];
|
|
1748
|
+
const isTrue = isSymbol(value, "true");
|
|
1749
|
+
if (keyword === ":produce-models") settings.isProducingModels = isTrue;
|
|
1750
|
+
if (keyword === ":produce-unsat-cores") settings.isProducingUnsatCores = isTrue;
|
|
1751
|
+
if (keyword === ":produce-proofs") settings.isProducingProofs = isTrue;
|
|
1752
|
+
if (keyword === ":interactive-mode" || keyword === ":produce-assertions") {
|
|
1753
|
+
if (state.isProofsEnabled !== undefined)
|
|
1754
|
+
throw new SmtParseError(
|
|
1755
|
+
"error setting ':produce-assertions', option value cannot be modified after initialization",
|
|
1756
|
+
value ?? list.end,
|
|
1757
|
+
);
|
|
1758
|
+
settings.isInteractive = isTrue;
|
|
1759
|
+
}
|
|
1760
|
+
if (keyword === ":diagnostic-output-channel")
|
|
1761
|
+
settings.isDiagnosticOnStdout = value?.kind === "string" && value.text === "stdout";
|
|
1762
|
+
if (keyword === ":int-real-coercions" && !isTrue)
|
|
1763
|
+
throw new SmtUnsupportedError("the option :int-real-coercions false");
|
|
1764
|
+
if (keyword === ":error-behavior") {
|
|
1765
|
+
if (!isSymbol(value, "immediate-exit") && !isSymbol(value, "continued-execution"))
|
|
1766
|
+
throw new SmtParseError(
|
|
1767
|
+
"error setting :error-behavior, 'immediate-execution' or 'continued-execution' expected",
|
|
1768
|
+
list.end,
|
|
1769
|
+
);
|
|
1770
|
+
settings.isExitingOnError = isSymbol(value, "immediate-exit");
|
|
1771
|
+
}
|
|
1772
|
+
const isParameter =
|
|
1773
|
+
keyword !== "" &&
|
|
1774
|
+
!BUILTIN_OPTIONS.has(keyword) &&
|
|
1775
|
+
value !== undefined &&
|
|
1776
|
+
value.kind !== "list";
|
|
1777
|
+
if (isParameter) settings.parameters.set(getParameterName(keyword), value.text);
|
|
1778
|
+
if (optionName === ":print_success") settings.isPrintingSuccess = isTrue;
|
|
1282
1779
|
if (
|
|
1283
|
-
|
|
1284
|
-
|
|
1285
|
-
model.funcInterps.has(decl)
|
|
1780
|
+
!BUILTIN_OPTIONS.has(keyword) &&
|
|
1781
|
+
settings.parameters.get("smtlib2_compliant") === "true"
|
|
1286
1782
|
)
|
|
1287
|
-
|
|
1288
|
-
|
|
1289
|
-
if (
|
|
1290
|
-
|
|
1291
|
-
|
|
1783
|
+
settings.isPrintingSuccess = true;
|
|
1784
|
+
if (optionName === ":smt.mbqi") settings.isMbqi = isTrue;
|
|
1785
|
+
if (optionName === ":smt.macro_finder") settings.isFindingMacros = isTrue;
|
|
1786
|
+
if (optionName === ":smt.mbqi.max_iterations" && value?.kind === "numeral")
|
|
1787
|
+
settings.mbqiMaxIterations = Number(value.text);
|
|
1788
|
+
if (optionName === ":rlimit" && value?.kind === "numeral")
|
|
1789
|
+
settings.rlimit = Number(value.text);
|
|
1790
|
+
const kernel = state.kernel;
|
|
1791
|
+
if (isParameter && kernel !== undefined)
|
|
1792
|
+
kernel.updateParams(getKernelParams(kernel.isSetUp));
|
|
1793
|
+
if (optionName === ":rewriter.hi_div0") {
|
|
1794
|
+
settings.isHiDiv0 = isTrue;
|
|
1795
|
+
state.manager.isHiDiv0 = isTrue;
|
|
1292
1796
|
}
|
|
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}`,
|
|
1797
|
+
if (optionName === ":encoding" && value !== undefined && value.kind !== "list") {
|
|
1798
|
+
settings.encoding = ENCODINGS.get(value.text) ?? UNICODE_ENCODING;
|
|
1799
|
+
state.manager.maxChar = settings.encoding.maxChar;
|
|
1800
|
+
state.manager.charBits = settings.encoding.charBits;
|
|
1801
|
+
}
|
|
1802
|
+
if (optionName === ":parser.ignore_bad_patterns")
|
|
1803
|
+
settings.parserOptions.isIgnoringBadPatterns = isTrue;
|
|
1804
|
+
const numericOption = NUMERIC_PRINT_OPTIONS.get(optionName);
|
|
1805
|
+
if (numericOption !== undefined && value?.kind === "numeral")
|
|
1806
|
+
settings.printOptions[numericOption] = Number(value.text);
|
|
1807
|
+
const booleanOption = BOOLEAN_PRINT_OPTIONS.get(optionName);
|
|
1808
|
+
if (booleanOption !== undefined) settings.printOptions[booleanOption] = isTrue;
|
|
1809
|
+
if (
|
|
1810
|
+
optionName.startsWith(":pp.") &&
|
|
1811
|
+
numericOption === undefined &&
|
|
1812
|
+
booleanOption === undefined
|
|
1813
|
+
)
|
|
1814
|
+
throw new SmtUnsupportedError(`the option ${optionName}`);
|
|
1815
|
+
},
|
|
1816
|
+
],
|
|
1817
|
+
[
|
|
1818
|
+
"get-option",
|
|
1819
|
+
(list) => {
|
|
1820
|
+
const option = list.items[1];
|
|
1821
|
+
if (option?.kind !== "keyword")
|
|
1822
|
+
throw new SmtParseError("invalid command argument, keyword expected", option ?? list.end);
|
|
1823
|
+
const builtinValues = new Map<string, boolean | string>([
|
|
1824
|
+
[":print-success", settings.isPrintingSuccess],
|
|
1825
|
+
[":produce-models", settings.isProducingModels],
|
|
1826
|
+
[":produce-unsat-cores", settings.isProducingUnsatCores],
|
|
1827
|
+
[":interactive-mode", settings.isInteractive],
|
|
1828
|
+
[":produce-assertions", settings.isInteractive],
|
|
1829
|
+
[":int-real-coercions", true],
|
|
1830
|
+
[":error-behavior", settings.isExitingOnError ? "immediate-exit" : "continued-execution"],
|
|
1831
|
+
]);
|
|
1832
|
+
const name = getParameterName(option.text);
|
|
1833
|
+
const value =
|
|
1834
|
+
builtinValues.get(option.text) ??
|
|
1835
|
+
(BUILTIN_OPTIONS.has(option.text)
|
|
1836
|
+
? undefined
|
|
1837
|
+
: (settings.parameters.get(name) ?? PARAMETER_DEFAULTS.get(name)));
|
|
1838
|
+
if (value === undefined) throw new SmtUnsupportedError(`the option ${option.text}`);
|
|
1839
|
+
print(String(value));
|
|
1840
|
+
},
|
|
1841
|
+
],
|
|
1842
|
+
[
|
|
1843
|
+
"get-info",
|
|
1844
|
+
(list) => {
|
|
1845
|
+
const info = list.items[1];
|
|
1846
|
+
if (info?.kind !== "keyword")
|
|
1847
|
+
throw new SmtParseError("invalid command argument, keyword expected", info ?? list.end);
|
|
1848
|
+
const check = state.check;
|
|
1849
|
+
const reasonUnknown =
|
|
1850
|
+
check === undefined
|
|
1851
|
+
? "state of the most recent check-sat command is not known"
|
|
1852
|
+
: check.reasonUnknown;
|
|
1853
|
+
if (info.text === ":reason-unknown" && reasonUnknown !== undefined) {
|
|
1854
|
+
print(`(:reason-unknown "${reasonUnknown.replaceAll('"', '\\"')}")`);
|
|
1855
|
+
return;
|
|
1856
|
+
}
|
|
1857
|
+
if (info.text === ":rlimit") {
|
|
1858
|
+
print(`(:rlimit ${state.manager.limit.count})`);
|
|
1859
|
+
return;
|
|
1860
|
+
}
|
|
1861
|
+
if (info.text !== ":error-behavior")
|
|
1862
|
+
throw new SmtUnsupportedError(`the information ${info.text}`);
|
|
1863
|
+
print(
|
|
1864
|
+
`(:error-behavior ${settings.isExitingOnError ? "immediate-exit" : "continued-execution"})`,
|
|
1456
1865
|
);
|
|
1457
|
-
|
|
1458
|
-
|
|
1459
|
-
|
|
1460
|
-
|
|
1461
|
-
|
|
1462
|
-
|
|
1463
|
-
|
|
1464
|
-
|
|
1465
|
-
|
|
1866
|
+
},
|
|
1867
|
+
],
|
|
1868
|
+
[
|
|
1869
|
+
"set-logic",
|
|
1870
|
+
(list) => {
|
|
1871
|
+
const logic = getFirstArgument(list);
|
|
1872
|
+
if (!isSymbol(logic))
|
|
1873
|
+
throw new SmtParseError("invalid command argument, symbol expected", logic);
|
|
1874
|
+
if (state.logic !== undefined)
|
|
1875
|
+
throw new SmtParseError("the logic has already been set", logic);
|
|
1876
|
+
if (state.assertions.length > 0)
|
|
1877
|
+
throw new SmtParseError("logic must be set before initialization", logic);
|
|
1878
|
+
if (!isSupportedLogic(logic.text)) {
|
|
1879
|
+
print("unsupported");
|
|
1880
|
+
printDiagnostic(
|
|
1881
|
+
`; ignoring unsupported logic ${logic.text} line: ${list.line} position: ${list.column}`,
|
|
1882
|
+
);
|
|
1883
|
+
checkArgumentCount(list, 1);
|
|
1884
|
+
return;
|
|
1885
|
+
}
|
|
1886
|
+
state.logic = logic.text;
|
|
1887
|
+
if (state.isProofsEnabled === undefined)
|
|
1888
|
+
state.reader = createSmtlibReader(state.manager, logic.text, settings.parserOptions);
|
|
1889
|
+
else {
|
|
1890
|
+
state.reader.restrictSorts(logic.text);
|
|
1891
|
+
// Deviation from Z3: its new solver starts without the open scopes, so it ignores their pop and keeps what they asserted.
|
|
1892
|
+
resetKernel();
|
|
1893
|
+
}
|
|
1894
|
+
if (settings.isPrintingSuccess) print("success");
|
|
1895
|
+
checkArgumentCount(list, 1);
|
|
1896
|
+
},
|
|
1897
|
+
],
|
|
1898
|
+
[
|
|
1899
|
+
"set-info",
|
|
1900
|
+
(list) => {
|
|
1901
|
+
const info = list.items[1];
|
|
1902
|
+
if (info === undefined)
|
|
1903
|
+
throw new SmtParseError("invalid command, argument(s) missing", list.end);
|
|
1904
|
+
if (info.kind !== "keyword")
|
|
1905
|
+
throw new SmtParseError("invalid command argument, keyword expected", info);
|
|
1906
|
+
const value = list.items[2];
|
|
1907
|
+
if (value === undefined)
|
|
1908
|
+
throw new SmtParseError("invalid command, argument(s) missing", list.end);
|
|
1909
|
+
if (value.kind === "list" || value.kind === "keyword" || value.kind === "eof")
|
|
1910
|
+
throw new SmtParseError("invalid option value", value);
|
|
1911
|
+
if (info.text === ":status" && value.kind === "symbol") {
|
|
1912
|
+
const status = [L_TRUE, L_FALSE, L_UNDEF].find(
|
|
1913
|
+
(innerStatus) => getVerdict(innerStatus) === value.text,
|
|
1914
|
+
);
|
|
1915
|
+
if (status === undefined) throw new SmtParseError("invalid ':status' attribute", value);
|
|
1916
|
+
settings.status = status;
|
|
1917
|
+
}
|
|
1918
|
+
if (list.items[3] !== undefined)
|
|
1919
|
+
throw new SmtParseError("invalid command, too many arguments", list.items[3]);
|
|
1920
|
+
},
|
|
1921
|
+
],
|
|
1922
|
+
]);
|
|
1466
1923
|
const run = (list: SmtList) => {
|
|
1467
1924
|
const head = list.items[0];
|
|
1468
1925
|
if (!isSymbol(head))
|
|
1469
1926
|
throw new SmtParseError("invalid command, symbol expected", head ?? list.end);
|
|
1470
1927
|
const command = DECLARATIONS.has(head.text)
|
|
1471
|
-
? (declaration: SmtList) =>
|
|
1472
|
-
: runCommand
|
|
1473
|
-
if (command === undefined
|
|
1474
|
-
|
|
1475
|
-
|
|
1928
|
+
? (declaration: SmtList) => state.reader.declareCommand(declaration)
|
|
1929
|
+
: runCommand.get(head.text);
|
|
1930
|
+
if (command === undefined && UNPORTED_COMMANDS.has(head.text))
|
|
1931
|
+
throw new SmtUnsupportedError(`the command ${head.text}`);
|
|
1932
|
+
if (command === undefined) {
|
|
1933
|
+
expectClosed(list);
|
|
1934
|
+
print("unsupported");
|
|
1935
|
+
printDiagnostic(`; ${head.text} line: ${list.end.line} position: ${list.end.column}`);
|
|
1936
|
+
return;
|
|
1937
|
+
}
|
|
1938
|
+
// Z3's scoped_timer ends with the command that set it, so a command starts without one.
|
|
1939
|
+
state.manager.limit.restart(Infinity);
|
|
1940
|
+
if (!MANAGERLESS_COMMANDS.has(head.text) && state.isProofsEnabled === undefined) {
|
|
1941
|
+
state.isProofsEnabled = settings.parameters.get("proof") === "true";
|
|
1942
|
+
if (state.logic === undefined || logicHasSeq(state.logic)) state.manager.initSeqPlugin();
|
|
1943
|
+
if (state.logic === undefined) state.reader.registerList();
|
|
1476
1944
|
resetKernel();
|
|
1477
1945
|
}
|
|
1478
|
-
|
|
1946
|
+
try {
|
|
1947
|
+
command(list);
|
|
1948
|
+
} catch (error) {
|
|
1949
|
+
if (!(error instanceof SmtDefaultError)) throw error;
|
|
1950
|
+
throw new SmtParseError(error.message, list.end);
|
|
1951
|
+
}
|
|
1479
1952
|
if (settings.isPrintingSuccess && SILENT_COMMANDS.has(head.text)) print("success");
|
|
1480
1953
|
};
|
|
1481
1954
|
for (;;) {
|
|
1482
1955
|
try {
|
|
1483
|
-
const list = commands.
|
|
1484
|
-
if (list === undefined
|
|
1956
|
+
const list = commands.readCommand();
|
|
1957
|
+
if (list === undefined) break;
|
|
1958
|
+
if (isSymbol(list.items[0], "exit")) {
|
|
1959
|
+
checkArgumentCount(list, 0);
|
|
1960
|
+
if (settings.isPrintingSuccess) print("success");
|
|
1961
|
+
break;
|
|
1962
|
+
}
|
|
1485
1963
|
run(list);
|
|
1486
1964
|
} catch (error) {
|
|
1487
1965
|
if (!(error instanceof SmtParseError)) throw error;
|
|
1488
1966
|
report(error);
|
|
1489
|
-
if (settings.isExitingOnError)
|
|
1967
|
+
if (settings.isExitingOnError) break;
|
|
1968
|
+
state.reader.reset();
|
|
1490
1969
|
commands.skip(report);
|
|
1491
1970
|
}
|
|
1492
1971
|
}
|
|
1972
|
+
if (pendingText !== "") printLine(pendingText);
|
|
1493
1973
|
};
|