tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.68b2c4968
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/README.md +2 -1
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +45 -41
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +44 -43
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- 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/codegen.ts +6 -2
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +134 -86
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +36 -6
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +24 -13
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- 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 +634 -186
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- 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 +45 -20
- 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 +63 -4
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- 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 +13 -7
- 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 +1 -8
- 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 +26 -7
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +483 -116
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +93 -15
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1449 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +109 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- 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 +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +109 -36
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- 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 +18 -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 +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- 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 +66 -11
- 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 +167 -85
- 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 +220 -0
- 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 +324 -0
- 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 +163 -99
- 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 +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +118 -88
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +410 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
- 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 +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- 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 +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +311 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2105 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +544 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
- package/src/prover/smt/solver/smtlib-script.ts +1843 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2012 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +29 -8
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- 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 +20 -5
- package/src/prover/zenon/parse.ts +6 -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 +7 -5
- 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 +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +264 -77
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +2 -1
- package/src/sany/generator-expressions.ts +30 -27
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +6 -5
- package/src/search.ts +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 +165 -78
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +42 -23
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,328 @@
|
|
|
1
|
+
import { SmtCanceledError } from "../../../../errors";
|
|
2
|
+
import { mkNot } from "../ast-util";
|
|
3
|
+
import type { ProtoModel } from "../proto-model";
|
|
4
|
+
import { L_TRUE, L_UNDEF } from "../lbool";
|
|
5
|
+
import { NULL_LITERAL } from "../sat/clause";
|
|
6
|
+
import { CR_DONE } from "../sat/solver";
|
|
7
|
+
import { type Enode, NULL_THEORY_VAR, type ThEq } from "./egraph";
|
|
8
|
+
import type { EufSolver } from "./euf-solver";
|
|
9
|
+
|
|
10
|
+
export class TrailStack {
|
|
11
|
+
private undos: (() => void)[] = [];
|
|
12
|
+
private scopes: number[] = [];
|
|
13
|
+
|
|
14
|
+
push(undo: () => void) {
|
|
15
|
+
this.undos.push(undo);
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
pushScope() {
|
|
19
|
+
this.scopes.push(this.undos.length);
|
|
20
|
+
}
|
|
21
|
+
|
|
22
|
+
popScope(numScopes: number) {
|
|
23
|
+
if (numScopes === 0) return;
|
|
24
|
+
const lim = this.scopes[this.scopes.length - numScopes];
|
|
25
|
+
this.scopes.length -= numScopes;
|
|
26
|
+
while (this.undos.length > lim) (this.undos.pop() as () => void)();
|
|
27
|
+
}
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
// A th_explain: the literals and equalities that explain a propagation or a conflict.
|
|
31
|
+
export interface ThExplain {
|
|
32
|
+
readonly lits: readonly number[];
|
|
33
|
+
readonly eqs: readonly (readonly [Enode, Enode])[];
|
|
34
|
+
readonly consequent: number;
|
|
35
|
+
readonly eq: readonly [Enode, Enode] | null;
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
export type Dependencies = Map<Enode, Enode[] | null>;
|
|
39
|
+
|
|
40
|
+
export const addDependency = (deps: Dependencies, node: Enode, dep: Enode) => {
|
|
41
|
+
const existing = deps.get(node);
|
|
42
|
+
if (existing === undefined || existing === null) deps.set(node, [dep]);
|
|
43
|
+
else if (!existing.includes(dep)) existing.push(dep);
|
|
44
|
+
};
|
|
45
|
+
|
|
46
|
+
export abstract class ThSolver {
|
|
47
|
+
protected var2enode: Enode[] = [];
|
|
48
|
+
protected stack: { expr: number; index: number }[] = [];
|
|
49
|
+
private var2enodeLim: number[] = [];
|
|
50
|
+
protected numScopes = 0;
|
|
51
|
+
|
|
52
|
+
constructor(
|
|
53
|
+
readonly ctx: EufSolver,
|
|
54
|
+
readonly name: string,
|
|
55
|
+
readonly id: number,
|
|
56
|
+
) {}
|
|
57
|
+
|
|
58
|
+
get manager() {
|
|
59
|
+
return this.ctx.manager;
|
|
60
|
+
}
|
|
61
|
+
|
|
62
|
+
get s() {
|
|
63
|
+
return this.ctx.s;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
abstract internalize(expr: number, isSign: boolean, isRoot: boolean): number;
|
|
67
|
+
abstract internalizeTerm(expr: number): void;
|
|
68
|
+
|
|
69
|
+
applySortCnstr(_node: Enode, _sort: number) {}
|
|
70
|
+
eqInternalized(_node: Enode) {}
|
|
71
|
+
newEqEh(_eq: ThEq) {}
|
|
72
|
+
useDiseqs() {
|
|
73
|
+
return false;
|
|
74
|
+
}
|
|
75
|
+
newDiseqEh(_eq: ThEq) {}
|
|
76
|
+
unitPropagate() {
|
|
77
|
+
return false;
|
|
78
|
+
}
|
|
79
|
+
check() {
|
|
80
|
+
return CR_DONE;
|
|
81
|
+
}
|
|
82
|
+
asserted(_lit: number) {}
|
|
83
|
+
getAntecedents(_lit: number, data: unknown, antecedents: number[]) {
|
|
84
|
+
this.ctx.getThAntecedents(data as ThExplain, antecedents);
|
|
85
|
+
}
|
|
86
|
+
getPhase(_boolVar: number) {
|
|
87
|
+
return L_UNDEF;
|
|
88
|
+
}
|
|
89
|
+
isExternal(_boolVar: number) {
|
|
90
|
+
return false;
|
|
91
|
+
}
|
|
92
|
+
initSearch() {}
|
|
93
|
+
popReinit() {}
|
|
94
|
+
isSelfPropagating() {
|
|
95
|
+
return false;
|
|
96
|
+
}
|
|
97
|
+
preSimplify() {}
|
|
98
|
+
simplify() {}
|
|
99
|
+
flushRoots() {}
|
|
100
|
+
finalize() {}
|
|
101
|
+
relevantEh(_node: Enode) {}
|
|
102
|
+
isShared(_thVar: number) {
|
|
103
|
+
return false;
|
|
104
|
+
}
|
|
105
|
+
isBetaRedex(_parent: Enode, _node: Enode) {
|
|
106
|
+
return false;
|
|
107
|
+
}
|
|
108
|
+
addValue(_node: Enode, _model: ProtoModel, _values: (number | undefined)[]) {}
|
|
109
|
+
addDep(node: Enode, deps: Dependencies) {
|
|
110
|
+
deps.set(node, null);
|
|
111
|
+
return true;
|
|
112
|
+
}
|
|
113
|
+
includeFuncInterp(_decl: number) {
|
|
114
|
+
return false;
|
|
115
|
+
}
|
|
116
|
+
initModel() {}
|
|
117
|
+
finalizeModel(_model: ProtoModel) {}
|
|
118
|
+
hasUnhandled() {
|
|
119
|
+
return false;
|
|
120
|
+
}
|
|
121
|
+
|
|
122
|
+
protected visit(_expr: number) {
|
|
123
|
+
return false;
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
protected visited(_expr: number) {
|
|
127
|
+
return false;
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
protected postVisit(_expr: number, _isSign: boolean, _isRoot: boolean) {
|
|
131
|
+
return false;
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
protected visitRec(expr: number, isSign: boolean, isRoot: boolean) {
|
|
135
|
+
const manager = this.manager;
|
|
136
|
+
const stack = this.stack;
|
|
137
|
+
const base = stack.length;
|
|
138
|
+
this.visit(expr);
|
|
139
|
+
loop: while (stack.length > base) {
|
|
140
|
+
if (!manager.limit.inc()) throw new SmtCanceledError();
|
|
141
|
+
const frame = stack[stack.length - 1];
|
|
142
|
+
const current = frame.expr;
|
|
143
|
+
if (this.visited(current)) {
|
|
144
|
+
stack.pop();
|
|
145
|
+
continue;
|
|
146
|
+
}
|
|
147
|
+
const numArgs = manager.isApp(current) ? manager.getNumArgs(current) : 0;
|
|
148
|
+
while (frame.index < numArgs)
|
|
149
|
+
if (!this.visit(manager.getArg(current, frame.index++))) continue loop;
|
|
150
|
+
if (!this.visited(current) && !this.postVisit(current, isSign, isRoot && current === expr)) {
|
|
151
|
+
stack.length = base;
|
|
152
|
+
return false;
|
|
153
|
+
}
|
|
154
|
+
stack.pop();
|
|
155
|
+
}
|
|
156
|
+
return true;
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
mkVar(node: Enode) {
|
|
160
|
+
this.forcePush();
|
|
161
|
+
const thVar = this.var2enode.length;
|
|
162
|
+
this.var2enode.push(node);
|
|
163
|
+
return thVar;
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
get numVars() {
|
|
167
|
+
return this.var2enode.length;
|
|
168
|
+
}
|
|
169
|
+
|
|
170
|
+
var2enodeOf(thVar: number) {
|
|
171
|
+
return this.var2enode[thVar];
|
|
172
|
+
}
|
|
173
|
+
|
|
174
|
+
var2expr(thVar: number) {
|
|
175
|
+
return this.var2enode[thVar].owner;
|
|
176
|
+
}
|
|
177
|
+
|
|
178
|
+
getThVar(node: Enode) {
|
|
179
|
+
return node.getThVar(this.id);
|
|
180
|
+
}
|
|
181
|
+
|
|
182
|
+
getRepresentative(thVar: number) {
|
|
183
|
+
return this.getThVar(this.var2enode[thVar].root);
|
|
184
|
+
}
|
|
185
|
+
|
|
186
|
+
isAttachedToVar(node: Enode) {
|
|
187
|
+
const thVar = node.getThVar(this.id);
|
|
188
|
+
return thVar !== NULL_THEORY_VAR && this.var2enode[thVar] === node;
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
push() {
|
|
192
|
+
this.numScopes++;
|
|
193
|
+
}
|
|
194
|
+
|
|
195
|
+
pop(numScopes: number) {
|
|
196
|
+
const fromLazy = Math.min(this.numScopes, numScopes);
|
|
197
|
+
this.numScopes -= fromLazy;
|
|
198
|
+
if (numScopes > fromLazy) this.popCore(numScopes - fromLazy);
|
|
199
|
+
}
|
|
200
|
+
|
|
201
|
+
protected forcePush() {
|
|
202
|
+
for (; this.numScopes > 0; this.numScopes--) this.pushCore();
|
|
203
|
+
}
|
|
204
|
+
|
|
205
|
+
protected pushCore() {
|
|
206
|
+
this.var2enodeLim.push(this.var2enode.length);
|
|
207
|
+
}
|
|
208
|
+
|
|
209
|
+
protected popCore(numScopes: number) {
|
|
210
|
+
const newLvl = this.var2enodeLim.length - numScopes;
|
|
211
|
+
this.var2enode.length = this.var2enodeLim[newLvl];
|
|
212
|
+
this.var2enodeLim.length = newLvl;
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
expr2enode(expr: number) {
|
|
216
|
+
return this.ctx.getEnode(expr);
|
|
217
|
+
}
|
|
218
|
+
|
|
219
|
+
eInternalize(expr: number) {
|
|
220
|
+
return this.ctx.eInternalize(expr);
|
|
221
|
+
}
|
|
222
|
+
|
|
223
|
+
mkEnode(expr: number, isSuppressingArgs = false) {
|
|
224
|
+
const manager = this.manager;
|
|
225
|
+
const args = isSuppressingArgs
|
|
226
|
+
? []
|
|
227
|
+
: manager.getArgs(expr).map((arg) => this.expr2enode(arg) as Enode);
|
|
228
|
+
const node = this.ctx.mkEnode(expr, args);
|
|
229
|
+
this.ctx.attachNode(node);
|
|
230
|
+
return node;
|
|
231
|
+
}
|
|
232
|
+
|
|
233
|
+
mkLiteral(expr: number) {
|
|
234
|
+
return this.ctx.mkLiteral(expr);
|
|
235
|
+
}
|
|
236
|
+
|
|
237
|
+
mkEq(first: number, second: number) {
|
|
238
|
+
return this.ctx.mkEq(first, second);
|
|
239
|
+
}
|
|
240
|
+
|
|
241
|
+
eqInternalize(first: number, second: number) {
|
|
242
|
+
return this.mkLiteral(this.ctx.mkEq(first, second));
|
|
243
|
+
}
|
|
244
|
+
|
|
245
|
+
expr2literal(expr: number) {
|
|
246
|
+
return this.ctx.expr2literal(expr);
|
|
247
|
+
}
|
|
248
|
+
|
|
249
|
+
literal2expr(lit: number) {
|
|
250
|
+
const expr = this.ctx.boolVar2expr(lit >> 1) as number;
|
|
251
|
+
return (lit & 1) === 1 ? mkNot(this.manager, expr) : expr;
|
|
252
|
+
}
|
|
253
|
+
|
|
254
|
+
boolVar2enode(boolVar: number) {
|
|
255
|
+
const expr = this.ctx.boolVar2expr(boolVar);
|
|
256
|
+
return expr === undefined ? undefined : this.expr2enode(expr);
|
|
257
|
+
}
|
|
258
|
+
|
|
259
|
+
boolVar2expr(boolVar: number) {
|
|
260
|
+
return this.ctx.boolVar2expr(boolVar);
|
|
261
|
+
}
|
|
262
|
+
|
|
263
|
+
isTrue(lit: number) {
|
|
264
|
+
return this.s.value(lit) === L_TRUE;
|
|
265
|
+
}
|
|
266
|
+
|
|
267
|
+
addUnit(lit: number) {
|
|
268
|
+
const wasTrue = this.isTrue(lit);
|
|
269
|
+
this.ctx.addClause([lit], false);
|
|
270
|
+
return !wasTrue;
|
|
271
|
+
}
|
|
272
|
+
|
|
273
|
+
addClause(lits: number[], isRedundant = false) {
|
|
274
|
+
let wasTrue = false;
|
|
275
|
+
for (const lit of lits) wasTrue ||= this.isTrue(lit);
|
|
276
|
+
this.ctx.addClause(lits, isRedundant);
|
|
277
|
+
return !wasTrue;
|
|
278
|
+
}
|
|
279
|
+
|
|
280
|
+
addEquiv(first: number, second: number) {
|
|
281
|
+
this.addClause([first ^ 1, second]);
|
|
282
|
+
this.addClause([first, second ^ 1]);
|
|
283
|
+
}
|
|
284
|
+
|
|
285
|
+
addEquivAnd(lit: number, lits: readonly number[]) {
|
|
286
|
+
for (const other of lits) this.addClause([lit ^ 1, other]);
|
|
287
|
+
this.addClause([...lits.map((other) => other ^ 1), lit]);
|
|
288
|
+
}
|
|
289
|
+
|
|
290
|
+
rewrite(expr: number) {
|
|
291
|
+
return this.ctx.rewrite(expr);
|
|
292
|
+
}
|
|
293
|
+
|
|
294
|
+
random() {
|
|
295
|
+
return this.s.rand.next();
|
|
296
|
+
}
|
|
297
|
+
|
|
298
|
+
mkPropagation(
|
|
299
|
+
lits: readonly number[],
|
|
300
|
+
eqs: readonly (readonly [Enode, Enode])[],
|
|
301
|
+
consequent: number,
|
|
302
|
+
eq: readonly [Enode, Enode] | null = null,
|
|
303
|
+
) {
|
|
304
|
+
const explain: ThExplain = { lits, eqs, consequent, eq };
|
|
305
|
+
return this.ctx.mkConstraint(this, explain);
|
|
306
|
+
}
|
|
307
|
+
|
|
308
|
+
propagateLit(lits: readonly number[], eqs: readonly (readonly [Enode, Enode])[], lit: number) {
|
|
309
|
+
this.ctx.propagate(lit, this.mkPropagation(lits, eqs, lit));
|
|
310
|
+
}
|
|
311
|
+
|
|
312
|
+
propagateEq(
|
|
313
|
+
lits: readonly number[],
|
|
314
|
+
eqs: readonly (readonly [Enode, Enode])[],
|
|
315
|
+
first: Enode,
|
|
316
|
+
second: Enode,
|
|
317
|
+
) {
|
|
318
|
+
return this.ctx.propagateEq(
|
|
319
|
+
first,
|
|
320
|
+
second,
|
|
321
|
+
this.mkPropagation(lits, eqs, NULL_LITERAL, [first, second]),
|
|
322
|
+
);
|
|
323
|
+
}
|
|
324
|
+
|
|
325
|
+
setConflict(lits: readonly number[], eqs: readonly (readonly [Enode, Enode])[]) {
|
|
326
|
+
this.ctx.setConflict(this.mkPropagation(lits, eqs, NULL_LITERAL));
|
|
327
|
+
}
|
|
328
|
+
}
|
|
@@ -0,0 +1,30 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
FAMILY_ARITH,
|
|
4
|
+
FAMILY_ARRAY,
|
|
5
|
+
FAMILY_BV,
|
|
6
|
+
FAMILY_DATATYPE,
|
|
7
|
+
FAMILY_FPA,
|
|
8
|
+
FAMILY_MODEL_VALUE,
|
|
9
|
+
} from "../ast";
|
|
10
|
+
import { ArithSolver } from "./arith-solver";
|
|
11
|
+
import { ArraySolver } from "./array-solver";
|
|
12
|
+
import { BvSolver } from "./bv-solver";
|
|
13
|
+
import { DtSolver } from "./dt-solver";
|
|
14
|
+
import { FpaSolver } from "./fpa-solver";
|
|
15
|
+
import type { EufSolver } from "./euf-solver";
|
|
16
|
+
import { QSolver } from "./q-solver";
|
|
17
|
+
import type { ThSolver } from "./th-solver";
|
|
18
|
+
|
|
19
|
+
// euf::solver::get_solver: the theory solver of a family, or of quantifiers for family -1. Model
|
|
20
|
+
// values have none. A goal that needs a theory the port lacks goes back to the smt kernel.
|
|
21
|
+
export const mkThSolver = (ctx: EufSolver, family: number): ThSolver | null => {
|
|
22
|
+
if (family === -1) return new QSolver(ctx);
|
|
23
|
+
if (family === FAMILY_MODEL_VALUE) return null;
|
|
24
|
+
if (family === FAMILY_ARITH) return new ArithSolver(ctx, family);
|
|
25
|
+
if (family === FAMILY_ARRAY) return new ArraySolver(ctx, family);
|
|
26
|
+
if (family === FAMILY_BV) return new BvSolver(ctx, family);
|
|
27
|
+
if (family === FAMILY_DATATYPE) return new DtSolver(ctx, family);
|
|
28
|
+
if (family === FAMILY_FPA) return new FpaSolver(ctx, family);
|
|
29
|
+
throw new SmtUnsupportedError(`sat.euf theory of family ${family}`);
|
|
30
|
+
};
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/expr_safe_replace.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { SmtInvariantError } from "../../../errors";
|
|
3
2
|
import { KIND_APP, KIND_VAR, type AstManager } from "./ast";
|
|
4
3
|
import { RefVector } from "./ref-vector";
|
|
@@ -80,6 +79,7 @@ export class ExprSafeReplace {
|
|
|
80
79
|
const manager = this.manager;
|
|
81
80
|
const data = manager.getQuantifier(quantifier);
|
|
82
81
|
const patterns = new RefVector(manager);
|
|
82
|
+
const noPatterns = new RefVector(manager);
|
|
83
83
|
let body = -1;
|
|
84
84
|
const isAllGround =
|
|
85
85
|
this.sources.items.every((source) => manager.isGroundApp(source)) &&
|
|
@@ -103,8 +103,18 @@ export class ExprSafeReplace {
|
|
|
103
103
|
todo.push(pattern);
|
|
104
104
|
hasAllData = false;
|
|
105
105
|
}
|
|
106
|
+
for (const noPattern of data.noPatterns) {
|
|
107
|
+
const replaced = hasAllData ? this.cache.get(noPattern) : undefined;
|
|
108
|
+
if (replaced !== undefined) {
|
|
109
|
+
noPatterns.push(replaced);
|
|
110
|
+
continue;
|
|
111
|
+
}
|
|
112
|
+
todo.push(noPattern);
|
|
113
|
+
hasAllData = false;
|
|
114
|
+
}
|
|
106
115
|
if (!hasAllData) {
|
|
107
116
|
patterns.reset();
|
|
117
|
+
noPatterns.reset();
|
|
108
118
|
if (body !== -1) manager.decRef(body);
|
|
109
119
|
return;
|
|
110
120
|
}
|
|
@@ -130,6 +140,7 @@ export class ExprSafeReplace {
|
|
|
130
140
|
pattern = replaced;
|
|
131
141
|
patterns.push(pattern);
|
|
132
142
|
}
|
|
143
|
+
for (const original of data.noPatterns) noPatterns.pushOwned(replace.apply(original));
|
|
133
144
|
const isAllVars = replace.sources.items.every(
|
|
134
145
|
(replaced) => manager.kinds[replaced] === KIND_VAR,
|
|
135
146
|
);
|
|
@@ -150,14 +161,27 @@ export class ExprSafeReplace {
|
|
|
150
161
|
shifter.release();
|
|
151
162
|
replace.release();
|
|
152
163
|
}
|
|
153
|
-
const result = manager.mkQuantifier({
|
|
164
|
+
const result = manager.mkQuantifier({
|
|
165
|
+
...data,
|
|
166
|
+
body,
|
|
167
|
+
patterns: patterns.items,
|
|
168
|
+
noPatterns: noPatterns.items,
|
|
169
|
+
});
|
|
154
170
|
this.refs.push(result);
|
|
155
171
|
this.cache.set(quantifier, result);
|
|
156
172
|
todo.pop();
|
|
157
173
|
patterns.reset();
|
|
174
|
+
noPatterns.reset();
|
|
158
175
|
manager.decRef(body);
|
|
159
176
|
}
|
|
160
177
|
|
|
178
|
+
reset() {
|
|
179
|
+
this.sources.reset();
|
|
180
|
+
this.targets.reset();
|
|
181
|
+
this.refs.reset();
|
|
182
|
+
this.cache.clear();
|
|
183
|
+
}
|
|
184
|
+
|
|
161
185
|
release() {
|
|
162
186
|
this.cache.clear();
|
|
163
187
|
this.refs.reset();
|
|
@@ -0,0 +1,271 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_ARITH,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
OP_ADD,
|
|
6
|
+
OP_MUL,
|
|
7
|
+
OP_NUM,
|
|
8
|
+
OP_POWER,
|
|
9
|
+
OP_SUB,
|
|
10
|
+
OP_TO_REAL,
|
|
11
|
+
OP_UMINUS,
|
|
12
|
+
SORT_INT,
|
|
13
|
+
SORT_REAL,
|
|
14
|
+
} from "./ast";
|
|
15
|
+
import {
|
|
16
|
+
type Polynomial,
|
|
17
|
+
type PolynomialManager,
|
|
18
|
+
PolynomialRef,
|
|
19
|
+
PolynomialRefVector,
|
|
20
|
+
} from "./nlsat/polynomial";
|
|
21
|
+
import { getLcm, Rational } from "./rational";
|
|
22
|
+
import { RefVector } from "./ref-vector";
|
|
23
|
+
|
|
24
|
+
interface Frame {
|
|
25
|
+
term: number;
|
|
26
|
+
index: number;
|
|
27
|
+
}
|
|
28
|
+
|
|
29
|
+
export class Expr2Polynomial {
|
|
30
|
+
private cache = new Map<number, number>();
|
|
31
|
+
private cachedDomain: RefVector;
|
|
32
|
+
private cachedPolynomials: PolynomialRefVector;
|
|
33
|
+
private cachedDenominators: bigint[] = [];
|
|
34
|
+
private frames: Frame[] = [];
|
|
35
|
+
private presult: PolynomialRefVector;
|
|
36
|
+
private dresult: bigint[] = [];
|
|
37
|
+
private var2expr: RefVector;
|
|
38
|
+
|
|
39
|
+
constructor(
|
|
40
|
+
private manager: AstManager,
|
|
41
|
+
readonly pm: PolynomialManager,
|
|
42
|
+
private t2x: Map<number, number>,
|
|
43
|
+
private mkVar: (isInt: boolean) => number,
|
|
44
|
+
) {
|
|
45
|
+
this.cachedDomain = new RefVector(manager);
|
|
46
|
+
this.cachedPolynomials = new PolynomialRefVector(pm);
|
|
47
|
+
this.presult = new PolynomialRefVector(pm);
|
|
48
|
+
this.var2expr = new RefVector(manager);
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
private reset() {
|
|
52
|
+
this.frames.length = 0;
|
|
53
|
+
this.presult.reset();
|
|
54
|
+
this.dresult.length = 0;
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
private cacheResult(term: number) {
|
|
58
|
+
if (this.manager.getRefCount(term) <= 1) return;
|
|
59
|
+
this.cache.set(term, this.cachedPolynomials.size);
|
|
60
|
+
this.cachedDomain.push(term);
|
|
61
|
+
this.cachedPolynomials.push(this.presult.get(this.presult.size - 1));
|
|
62
|
+
this.cachedDenominators.push(this.dresult[this.dresult.length - 1]);
|
|
63
|
+
}
|
|
64
|
+
|
|
65
|
+
private storeResult(term: number, polynomial: Polynomial, denominator: bigint) {
|
|
66
|
+
this.presult.push(polynomial);
|
|
67
|
+
this.dresult.push(denominator);
|
|
68
|
+
this.cacheResult(term);
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
private storeVarPoly(term: number) {
|
|
72
|
+
let variable = this.t2x.get(term);
|
|
73
|
+
if (variable === undefined) {
|
|
74
|
+
variable = this.mkVar(this.manager.sorts[term] === SORT_INT);
|
|
75
|
+
this.t2x.set(term, variable);
|
|
76
|
+
if (variable >= this.var2expr.size) this.var2expr.resize(variable + 1);
|
|
77
|
+
this.var2expr.set(variable, term);
|
|
78
|
+
}
|
|
79
|
+
this.storeResult(term, this.pm.mkVar(variable), 1n);
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
private visitArithApp(term: number) {
|
|
83
|
+
const manager = this.manager;
|
|
84
|
+
switch (manager.getOp(term)) {
|
|
85
|
+
case OP_NUM: {
|
|
86
|
+
const value = manager.getRationalValue(term);
|
|
87
|
+
this.storeResult(term, this.pm.mkConst(value.num), value.den);
|
|
88
|
+
return true;
|
|
89
|
+
}
|
|
90
|
+
case OP_ADD:
|
|
91
|
+
case OP_SUB:
|
|
92
|
+
case OP_MUL:
|
|
93
|
+
case OP_UMINUS:
|
|
94
|
+
case OP_TO_REAL:
|
|
95
|
+
this.frames.push({ term, index: 0 });
|
|
96
|
+
return false;
|
|
97
|
+
case OP_POWER: {
|
|
98
|
+
const exponent = manager.getArg(term, 1);
|
|
99
|
+
const value = manager.isNumeral(exponent) ? manager.getRationalValue(exponent) : undefined;
|
|
100
|
+
if (value === undefined || !value.isInt() || value.num <= 0n || value.num > 0xffffffffn) {
|
|
101
|
+
this.storeVarPoly(term);
|
|
102
|
+
return true;
|
|
103
|
+
}
|
|
104
|
+
this.frames.push({ term, index: 0 });
|
|
105
|
+
return false;
|
|
106
|
+
}
|
|
107
|
+
default:
|
|
108
|
+
this.storeVarPoly(term);
|
|
109
|
+
return true;
|
|
110
|
+
}
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
private visit(term: number) {
|
|
114
|
+
const manager = this.manager;
|
|
115
|
+
const cached = manager.getRefCount(term) > 1 ? this.cache.get(term) : undefined;
|
|
116
|
+
if (cached !== undefined) {
|
|
117
|
+
this.presult.push(this.cachedPolynomials.get(cached));
|
|
118
|
+
this.dresult.push(this.cachedDenominators[cached]);
|
|
119
|
+
return true;
|
|
120
|
+
}
|
|
121
|
+
if (manager.kinds[term] !== KIND_APP || manager.getFamily(term) !== FAMILY_ARITH) {
|
|
122
|
+
this.storeVarPoly(term);
|
|
123
|
+
return true;
|
|
124
|
+
}
|
|
125
|
+
return this.visitArithApp(term);
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
private pop(numArgs: number) {
|
|
129
|
+
this.presult.shrink(this.presult.size - numArgs);
|
|
130
|
+
this.dresult.length -= numArgs;
|
|
131
|
+
}
|
|
132
|
+
|
|
133
|
+
private processAddSub(term: number, numArgs: number, isAdd: boolean) {
|
|
134
|
+
const pm = this.pm;
|
|
135
|
+
const first = this.presult.size - numArgs;
|
|
136
|
+
const p = new PolynomialRef(pm);
|
|
137
|
+
const pAux = new PolynomialRef(pm);
|
|
138
|
+
let denominator = 1n;
|
|
139
|
+
for (let index = 0; index < numArgs; index++)
|
|
140
|
+
denominator = getLcm(denominator, this.dresult[first + index]);
|
|
141
|
+
p.set(pm.zero);
|
|
142
|
+
for (let index = 0; index < numArgs; index++) {
|
|
143
|
+
pAux.set(
|
|
144
|
+
pm.mulConst(denominator / this.dresult[first + index], this.presult.get(first + index)),
|
|
145
|
+
);
|
|
146
|
+
if (index === 0) p.copy(pAux);
|
|
147
|
+
else p.set(isAdd ? pm.add(p.get(), pAux.get()) : pm.sub(p.get(), pAux.get()));
|
|
148
|
+
}
|
|
149
|
+
this.pop(numArgs);
|
|
150
|
+
this.storeResult(term, p.get(), denominator);
|
|
151
|
+
pAux.reset();
|
|
152
|
+
p.reset();
|
|
153
|
+
}
|
|
154
|
+
|
|
155
|
+
private processMul(term: number, numArgs: number) {
|
|
156
|
+
const first = this.presult.size - numArgs;
|
|
157
|
+
const p = new PolynomialRef(this.pm);
|
|
158
|
+
let denominator = 1n;
|
|
159
|
+
p.set(this.pm.one);
|
|
160
|
+
for (let index = 0; index < numArgs; index++) {
|
|
161
|
+
p.set(this.pm.mul(p.get(), this.presult.get(first + index)));
|
|
162
|
+
denominator *= this.dresult[first + index];
|
|
163
|
+
}
|
|
164
|
+
this.pop(numArgs);
|
|
165
|
+
this.storeResult(term, p.get(), denominator);
|
|
166
|
+
p.reset();
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
private processUminus(term: number) {
|
|
170
|
+
const negP = new PolynomialRef(this.pm);
|
|
171
|
+
negP.set(this.pm.neg(this.presult.get(this.presult.size - 1)));
|
|
172
|
+
this.presult.shrink(this.presult.size - 1);
|
|
173
|
+
this.presult.push(negP.get());
|
|
174
|
+
this.cacheResult(term);
|
|
175
|
+
negP.reset();
|
|
176
|
+
}
|
|
177
|
+
|
|
178
|
+
private processPower(term: number, numArgs: number) {
|
|
179
|
+
const first = this.presult.size - numArgs;
|
|
180
|
+
const k = Number(this.manager.getRationalValue(this.manager.getArg(term, 1)).num);
|
|
181
|
+
const p = new PolynomialRef(this.pm);
|
|
182
|
+
this.pm.pw(this.presult.get(first), k, p);
|
|
183
|
+
const denominator = this.dresult[first] ** BigInt(k);
|
|
184
|
+
this.pop(numArgs);
|
|
185
|
+
this.storeResult(term, p.get(), denominator);
|
|
186
|
+
p.reset();
|
|
187
|
+
}
|
|
188
|
+
|
|
189
|
+
private processApp(term: number) {
|
|
190
|
+
const numArgs = this.manager.getNumArgs(term);
|
|
191
|
+
switch (this.manager.getOp(term)) {
|
|
192
|
+
case OP_ADD:
|
|
193
|
+
return this.processAddSub(term, numArgs, true);
|
|
194
|
+
case OP_SUB:
|
|
195
|
+
return this.processAddSub(term, numArgs, false);
|
|
196
|
+
case OP_MUL:
|
|
197
|
+
return this.processMul(term, numArgs);
|
|
198
|
+
case OP_POWER:
|
|
199
|
+
return this.processPower(term, numArgs);
|
|
200
|
+
case OP_UMINUS:
|
|
201
|
+
return this.processUminus(term);
|
|
202
|
+
default:
|
|
203
|
+
return this.cacheResult(term);
|
|
204
|
+
}
|
|
205
|
+
}
|
|
206
|
+
|
|
207
|
+
toPolynomial(term: number, p: PolynomialRef) {
|
|
208
|
+
this.reset();
|
|
209
|
+
if (!this.visit(term)) {
|
|
210
|
+
const frames = this.frames;
|
|
211
|
+
while (frames.length > 0) {
|
|
212
|
+
const frame = frames[frames.length - 1];
|
|
213
|
+
const numArgs = this.manager.getNumArgs(frame.term);
|
|
214
|
+
let isPushed = false;
|
|
215
|
+
while (frame.index < numArgs) {
|
|
216
|
+
const arg = this.manager.getArg(frame.term, frame.index);
|
|
217
|
+
frame.index++;
|
|
218
|
+
if (!this.visit(arg)) {
|
|
219
|
+
isPushed = true;
|
|
220
|
+
break;
|
|
221
|
+
}
|
|
222
|
+
}
|
|
223
|
+
if (isPushed) continue;
|
|
224
|
+
this.processApp(frame.term);
|
|
225
|
+
frames.pop();
|
|
226
|
+
}
|
|
227
|
+
}
|
|
228
|
+
p.set(this.presult.get(this.presult.size - 1));
|
|
229
|
+
const denominator = this.dresult[this.dresult.length - 1];
|
|
230
|
+
this.reset();
|
|
231
|
+
return denominator;
|
|
232
|
+
}
|
|
233
|
+
|
|
234
|
+
private isIntVar(variable: number) {
|
|
235
|
+
return this.manager.sorts[this.var2expr.items[variable]] === SORT_INT;
|
|
236
|
+
}
|
|
237
|
+
|
|
238
|
+
toExpr(polynomial: Polynomial, isUsingPower: boolean) {
|
|
239
|
+
const manager = this.manager;
|
|
240
|
+
const isInt = polynomial.ms.every((monomial) =>
|
|
241
|
+
monomial.vars.every((variable) => this.isIntVar(variable)),
|
|
242
|
+
);
|
|
243
|
+
const sort = isInt ? SORT_INT : SORT_REAL;
|
|
244
|
+
const mkNumeral = (value: bigint) => manager.mkNumeralOfSort(Rational.of(value), sort);
|
|
245
|
+
const args = polynomial.ms.map((monomial, index) => {
|
|
246
|
+
const factors: number[] = [];
|
|
247
|
+
const coeff = polynomial.as[index];
|
|
248
|
+
if (coeff !== 1n) factors.push(mkNumeral(coeff));
|
|
249
|
+
for (const [position, variable] of monomial.vars.entries()) {
|
|
250
|
+
const term = this.var2expr.items[variable];
|
|
251
|
+
const base =
|
|
252
|
+
this.isIntVar(variable) && !isInt ? manager.mkApp(OP_TO_REAL, [term], SORT_REAL) : term;
|
|
253
|
+
const degree = monomial.degrees[position];
|
|
254
|
+
if (isUsingPower && degree > 1)
|
|
255
|
+
factors.push(manager.mkApp(OP_POWER, [base, mkNumeral(BigInt(degree))], SORT_REAL));
|
|
256
|
+
else for (let count = 0; count < degree; count++) factors.push(base);
|
|
257
|
+
}
|
|
258
|
+
if (factors.length === 0) return mkNumeral(1n);
|
|
259
|
+
return factors.length === 1 ? factors[0] : manager.mkApp(OP_MUL, factors, sort);
|
|
260
|
+
});
|
|
261
|
+
if (args.length === 0) return mkNumeral(0n);
|
|
262
|
+
return args.length === 1 ? args[0] : manager.mkApp(OP_ADD, args, sort);
|
|
263
|
+
}
|
|
264
|
+
|
|
265
|
+
release() {
|
|
266
|
+
this.presult.reset();
|
|
267
|
+
this.cachedPolynomials.reset();
|
|
268
|
+
this.cachedDomain.reset();
|
|
269
|
+
this.var2expr.reset();
|
|
270
|
+
}
|
|
271
|
+
}
|