tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a
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 +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 +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 +43 -40
- 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 +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 +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/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 +38 -3
- 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/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 +37 -7
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +25 -17
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- 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 +664 -287
- 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 +4 -11
- 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 +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 +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/md5.ts +26 -29
- 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 +37 -16
- 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 +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/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
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/var_subst.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { KIND_APP, KIND_QUANTIFIER, KIND_VAR, type AstManager, type SmtSymbol } from "./ast";
|
|
3
2
|
import { ExprSafeReplace } from "./expr-safe-replace";
|
|
4
3
|
import { BetaReducer } from "./rewriter-tpl";
|
|
@@ -75,6 +74,7 @@ export const replaceFreeVars = (
|
|
|
75
74
|
replace: (variable: number, index: number, shift: number) => number,
|
|
76
75
|
) => {
|
|
77
76
|
const cache = new Map<number, number>();
|
|
77
|
+
const numNodes = manager.kinds.length;
|
|
78
78
|
const frames: ReplaceFrame[] = [];
|
|
79
79
|
const results: number[] = [];
|
|
80
80
|
const visit = (current: number, shift: number) => {
|
|
@@ -82,7 +82,7 @@ export const replaceFreeVars = (
|
|
|
82
82
|
results.push(current);
|
|
83
83
|
return;
|
|
84
84
|
}
|
|
85
|
-
const key =
|
|
85
|
+
const key = shift * numNodes + current;
|
|
86
86
|
const cached = cache.get(key);
|
|
87
87
|
if (cached !== undefined) results.push(cached);
|
|
88
88
|
else if (manager.kinds[current] !== KIND_VAR)
|
|
@@ -98,21 +98,29 @@ export const replaceFreeVars = (
|
|
|
98
98
|
const frame = frames[frames.length - 1];
|
|
99
99
|
const current = frame.expr;
|
|
100
100
|
const data = manager.kinds[current] === KIND_QUANTIFIER ? manager.getQuantifier(current) : null;
|
|
101
|
-
const
|
|
101
|
+
const quantifierChildren =
|
|
102
|
+
data === null ? [] : [data.body, ...data.patterns, ...data.noPatterns];
|
|
103
|
+
const numChildren = data === null ? manager.getNumArgs(current) : quantifierChildren.length;
|
|
102
104
|
if (frame.next < numChildren) {
|
|
103
105
|
const index = frame.next++;
|
|
104
106
|
if (data === null) visit(manager.getArg(current, index), frame.shift);
|
|
105
|
-
else
|
|
106
|
-
visit(index === 0 ? data.body : data.patterns[index - 1], frame.shift + data.sorts.length);
|
|
107
|
+
else visit(quantifierChildren[index], frame.shift + data.sorts.length);
|
|
107
108
|
continue;
|
|
108
109
|
}
|
|
109
110
|
const children = results.splice(frame.start);
|
|
110
111
|
const result =
|
|
111
112
|
data === null
|
|
112
113
|
? manager.mkApp(manager.decls[current], children, manager.sorts[current])
|
|
113
|
-
:
|
|
114
|
+
: children.every((child, index) => child === quantifierChildren[index])
|
|
115
|
+
? current
|
|
116
|
+
: manager.mkQuantifier({
|
|
117
|
+
...data,
|
|
118
|
+
body: children[0],
|
|
119
|
+
patterns: children.slice(1, 1 + data.patterns.length),
|
|
120
|
+
noPatterns: children.slice(1 + data.patterns.length),
|
|
121
|
+
});
|
|
114
122
|
frames.pop();
|
|
115
|
-
cache.set(
|
|
123
|
+
cache.set(frame.shift * numNodes + current, result);
|
|
116
124
|
results.push(result);
|
|
117
125
|
}
|
|
118
126
|
return results[0];
|
|
@@ -127,7 +135,7 @@ export const getFreeVarSorts = (manager: AstManager, expr: number, count: number
|
|
|
127
135
|
const delta = deltas.pop() ?? 0;
|
|
128
136
|
if (manager.freeVarBounds[current] <= delta) continue;
|
|
129
137
|
if (manager.getRefCount(current) > 1) {
|
|
130
|
-
const key =
|
|
138
|
+
const key = delta * manager.kinds.length + current;
|
|
131
139
|
if (visited.has(key)) continue;
|
|
132
140
|
visited.add(key);
|
|
133
141
|
}
|
|
@@ -142,7 +150,7 @@ export const getFreeVarSorts = (manager: AstManager, expr: number, count: number
|
|
|
142
150
|
}
|
|
143
151
|
else {
|
|
144
152
|
const data = manager.getQuantifier(current);
|
|
145
|
-
for (const child of [data.body, ...data.patterns]) {
|
|
153
|
+
for (const child of [data.body, ...data.patterns, ...data.noPatterns]) {
|
|
146
154
|
exprs.push(child);
|
|
147
155
|
deltas.push(delta + data.sorts.length);
|
|
148
156
|
}
|
|
@@ -164,14 +172,17 @@ export class UnusedVarsEliminator {
|
|
|
164
172
|
apply(expr: number) {
|
|
165
173
|
const manager = this.manager;
|
|
166
174
|
return manager.withoutTemporaries(() => {
|
|
167
|
-
const data =
|
|
168
|
-
|
|
175
|
+
const data =
|
|
176
|
+
manager.kinds[expr] === KIND_QUANTIFIER && !manager.isLambda(expr)
|
|
177
|
+
? manager.getQuantifier(expr)
|
|
178
|
+
: null;
|
|
179
|
+
const kept = data === null ? expr : manager.isGroundApp(data.body) ? data.body : -1;
|
|
169
180
|
if (kept !== -1 || data === null) {
|
|
170
181
|
manager.incRef(kept);
|
|
171
182
|
return kept;
|
|
172
183
|
}
|
|
173
184
|
const usedSorts: (number | undefined)[] = [];
|
|
174
|
-
for (const term of [data.body, ...data.patterns])
|
|
185
|
+
for (const term of [data.body, ...data.patterns, ...data.noPatterns])
|
|
175
186
|
getFreeVarSorts(manager, term, manager.freeVarBounds[term]).forEach((sort, index) => {
|
|
176
187
|
if (sort !== undefined) usedSorts[index] = sort;
|
|
177
188
|
});
|
|
@@ -206,13 +217,24 @@ export class UnusedVarsEliminator {
|
|
|
206
217
|
numRemoved === numDecls
|
|
207
218
|
? []
|
|
208
219
|
: data.patterns.map((pattern) => this.subst.apply(pattern, mapping));
|
|
220
|
+
const noPatterns =
|
|
221
|
+
numRemoved === numDecls
|
|
222
|
+
? []
|
|
223
|
+
: data.noPatterns.map((noPattern) => this.subst.apply(noPattern, mapping));
|
|
209
224
|
const result =
|
|
210
225
|
numRemoved === numDecls
|
|
211
226
|
? body
|
|
212
|
-
: manager.mkQuantifier({
|
|
227
|
+
: manager.mkQuantifier({
|
|
228
|
+
...data,
|
|
229
|
+
sorts: keptSorts,
|
|
230
|
+
names: keptNames,
|
|
231
|
+
body,
|
|
232
|
+
patterns,
|
|
233
|
+
noPatterns,
|
|
234
|
+
});
|
|
213
235
|
if (result !== body) {
|
|
214
236
|
manager.incRef(result);
|
|
215
|
-
for (const pattern of patterns) manager.decRef(pattern);
|
|
237
|
+
for (const pattern of [...patterns, ...noPatterns]) manager.decRef(pattern);
|
|
216
238
|
manager.decRef(body);
|
|
217
239
|
}
|
|
218
240
|
for (const variable of mapping) if (variable !== -1) manager.decRef(variable);
|
package/src/prover/smt/table.ts
CHANGED
|
@@ -130,7 +130,7 @@ export const TYPED_SYMBOLS = [
|
|
|
130
130
|
"TIntLteq",
|
|
131
131
|
];
|
|
132
132
|
|
|
133
|
-
export type AxiomArgument = number | string |
|
|
133
|
+
export type AxiomArgument = number | bigint | string | AxiomArgument[];
|
|
134
134
|
|
|
135
135
|
export interface Axiom {
|
|
136
136
|
name: string;
|
|
@@ -151,7 +151,8 @@ export const axiom = (
|
|
|
151
151
|
formula,
|
|
152
152
|
});
|
|
153
153
|
|
|
154
|
-
export const getAxiomKey = (entry: Axiom) =>
|
|
154
|
+
export const getAxiomKey = (entry: Axiom) =>
|
|
155
|
+
`${entry.name} ${JSON.stringify(entry.args, (_key, value: unknown) => (typeof value === "bigint" ? `${value}n` : value))}`;
|
|
155
156
|
|
|
156
157
|
const getAxiomRank = (entry: Axiom) => {
|
|
157
158
|
const constant = CONSTANT_AXIOMS.indexOf(entry.name);
|
|
@@ -0,0 +1,146 @@
|
|
|
1
|
+
import type { Expr, Sequent } from "../../obligations/expression";
|
|
2
|
+
import type { AxiomArgument } from "./table";
|
|
3
|
+
|
|
4
|
+
export type Type =
|
|
5
|
+
| { kind: "Idv" | "Bool" | "Int" | "Real" | "String" }
|
|
6
|
+
| { kind: "Set"; element: Type }
|
|
7
|
+
| { kind: "Fun"; domain: Type; range: Type }
|
|
8
|
+
| { kind: "Product"; items: Type[] }
|
|
9
|
+
| { kind: "Record"; fields: { name: string; type: Type }[] };
|
|
10
|
+
|
|
11
|
+
export const IDV: Type = { kind: "Idv" };
|
|
12
|
+
export const BOOL: Type = { kind: "Bool" };
|
|
13
|
+
export const INT: Type = { kind: "Int" };
|
|
14
|
+
export const STRING: Type = { kind: "String" };
|
|
15
|
+
|
|
16
|
+
const ATOMS = ["Idv", "Bool", "Int", "Real", "String"];
|
|
17
|
+
|
|
18
|
+
export const getTypeName = (type: Type): string => {
|
|
19
|
+
switch (type.kind) {
|
|
20
|
+
case "Set":
|
|
21
|
+
return `Set$${getTypeName(type.element)}$`;
|
|
22
|
+
case "Fun":
|
|
23
|
+
return `Fun$${getTypeName(type.domain)}${getTypeName(type.range)}$`;
|
|
24
|
+
case "Product":
|
|
25
|
+
return `Prd$${type.items.map(getTypeName).join("")}$`;
|
|
26
|
+
case "Record":
|
|
27
|
+
return `Rec${type.fields.map((field) => `!${field.name}${getTypeName(field.type)}`).join("")}$`;
|
|
28
|
+
default:
|
|
29
|
+
return type.kind;
|
|
30
|
+
}
|
|
31
|
+
};
|
|
32
|
+
|
|
33
|
+
export const isSameType = (left: Type, right: Type) => getTypeName(left) === getTypeName(right);
|
|
34
|
+
|
|
35
|
+
// The order Stdlib.compare gives T_t.ty, whose constructors TVar and TFSet tla-ts never builds.
|
|
36
|
+
export const getTypeKey = (type: Type): AxiomArgument => {
|
|
37
|
+
switch (type.kind) {
|
|
38
|
+
case "Set":
|
|
39
|
+
return [2, getTypeKey(type.element)];
|
|
40
|
+
case "Fun":
|
|
41
|
+
return [4, getTypeKey(type.domain), getTypeKey(type.range)];
|
|
42
|
+
case "Product":
|
|
43
|
+
return [5, type.items.map(getTypeKey)];
|
|
44
|
+
case "Record":
|
|
45
|
+
return [6, type.fields.map((field) => [field.name, getTypeKey(field.type)])];
|
|
46
|
+
default:
|
|
47
|
+
return [1, ATOMS.indexOf(type.kind)];
|
|
48
|
+
}
|
|
49
|
+
};
|
|
50
|
+
|
|
51
|
+
// The SMT sort of a value of this type. tlapm also gives a STRING-bounded variable the sort String,
|
|
52
|
+
// though its membership in StrSet then needs an Idv, so a string stays an Idv here.
|
|
53
|
+
export const getSort = (type: Type | undefined) =>
|
|
54
|
+
type?.kind === "Int" || type?.kind === "Bool" ? type.kind : "Idv";
|
|
55
|
+
|
|
56
|
+
interface Search {
|
|
57
|
+
infer: (expression: Expr, depth: number) => Type | undefined;
|
|
58
|
+
isTarget: (expression: Expr, depth: number) => boolean;
|
|
59
|
+
}
|
|
60
|
+
|
|
61
|
+
const getBuiltin = (expression: Expr) =>
|
|
62
|
+
expression.kind === "Apply" && expression.operator.kind === "Internal"
|
|
63
|
+
? expression.operator.builtin
|
|
64
|
+
: undefined;
|
|
65
|
+
|
|
66
|
+
const getFirst = (items: (() => Type | undefined)[]) =>
|
|
67
|
+
items.reduce<Type | undefined>((found, item) => found ?? item(), undefined);
|
|
68
|
+
|
|
69
|
+
const getAgreed = (left: () => Type | undefined, right: () => Type | undefined) => {
|
|
70
|
+
const found = left();
|
|
71
|
+
if (found === undefined) return undefined;
|
|
72
|
+
const next = right();
|
|
73
|
+
return next !== undefined && isSameType(found, next) ? next : undefined;
|
|
74
|
+
};
|
|
75
|
+
|
|
76
|
+
const visit = (
|
|
77
|
+
search: Search,
|
|
78
|
+
isPositive: boolean,
|
|
79
|
+
depth: number,
|
|
80
|
+
expression: Expr,
|
|
81
|
+
): Type | undefined => {
|
|
82
|
+
const builtin = getBuiltin(expression);
|
|
83
|
+
const args = expression.kind === "Apply" ? expression.args : [];
|
|
84
|
+
const recurse = (inner: Expr, isInnerPositive = isPositive) =>
|
|
85
|
+
visit(search, isInnerPositive, depth, inner);
|
|
86
|
+
switch (builtin) {
|
|
87
|
+
case "Mem":
|
|
88
|
+
case "Notmem":
|
|
89
|
+
if (
|
|
90
|
+
args.length === 2 &&
|
|
91
|
+
search.isTarget(args[0], depth) &&
|
|
92
|
+
(builtin === "Notmem") === isPositive
|
|
93
|
+
) {
|
|
94
|
+
const type = search.infer(args[1], depth);
|
|
95
|
+
return type?.kind === "Set" ? type.element : undefined;
|
|
96
|
+
}
|
|
97
|
+
return undefined;
|
|
98
|
+
case "Eq":
|
|
99
|
+
case "Neq": {
|
|
100
|
+
if (args.length !== 2 || (builtin === "Neq") !== isPositive) return undefined;
|
|
101
|
+
if (search.isTarget(args[0], depth)) return search.infer(args[1], depth);
|
|
102
|
+
return search.isTarget(args[1], depth) ? search.infer(args[0], depth) : undefined;
|
|
103
|
+
}
|
|
104
|
+
case "Conj":
|
|
105
|
+
case "Disj":
|
|
106
|
+
return (builtin === "Disj") === isPositive
|
|
107
|
+
? getFirst(args.map((arg) => () => recurse(arg)))
|
|
108
|
+
: getAgreed(
|
|
109
|
+
() => recurse(args[0]),
|
|
110
|
+
() => recurse(args[1]),
|
|
111
|
+
);
|
|
112
|
+
case "Neg":
|
|
113
|
+
return recurse(args[0], !isPositive);
|
|
114
|
+
case "Implies":
|
|
115
|
+
return getFirst([() => recurse(args[0], !isPositive), () => recurse(args[1])]);
|
|
116
|
+
}
|
|
117
|
+
switch (expression.kind) {
|
|
118
|
+
// T_hyps folds a list that must agree from None, so it never agrees.
|
|
119
|
+
case "List":
|
|
120
|
+
return expression.bullet !== "Refs" && (expression.bullet === "Or") === isPositive
|
|
121
|
+
? getFirst(expression.items.map((item) => () => recurse(item)))
|
|
122
|
+
: undefined;
|
|
123
|
+
case "Quant":
|
|
124
|
+
return (expression.quantifier === "Forall") === isPositive
|
|
125
|
+
? visit(search, isPositive, depth + expression.bounds.length, expression.body)
|
|
126
|
+
: undefined;
|
|
127
|
+
case "Sequent":
|
|
128
|
+
return isPositive ? visitSequent(search, depth, expression.sequent) : undefined;
|
|
129
|
+
default:
|
|
130
|
+
return undefined;
|
|
131
|
+
}
|
|
132
|
+
};
|
|
133
|
+
|
|
134
|
+
const visitSequent = (search: Search, depth: number, sequent: Sequent) =>
|
|
135
|
+
getFirst([
|
|
136
|
+
...sequent.context.map(
|
|
137
|
+
(hyp, index) => () =>
|
|
138
|
+
hyp.kind === "Fact" && hyp.visibility === "Visible"
|
|
139
|
+
? visit(search, false, depth + index, hyp.expression)
|
|
140
|
+
: undefined,
|
|
141
|
+
),
|
|
142
|
+
() => visit(search, true, depth + sequent.context.length, sequent.active),
|
|
143
|
+
]);
|
|
144
|
+
|
|
145
|
+
export const searchType = (search: Search, isPositive: boolean, expression: Expr) =>
|
|
146
|
+
visit(search, isPositive, 0, expression);
|
|
@@ -21,7 +21,7 @@ import {
|
|
|
21
21
|
} from "./ocaml-marshal";
|
|
22
22
|
import { getBudget } from "../prep/methods";
|
|
23
23
|
import { getFailureReason, isProvedAttempt, type ProofAttempt } from "../prove";
|
|
24
|
-
import { BACKENDS
|
|
24
|
+
import { BACKENDS } from "../verdict";
|
|
25
25
|
|
|
26
26
|
export type FingerprintTable = Map<string, OcamlValue[]>;
|
|
27
27
|
|
|
@@ -29,12 +29,31 @@ const MAGIC_NUMBER = 20210223;
|
|
|
29
29
|
|
|
30
30
|
const RECORD_SIZE = 23;
|
|
31
31
|
|
|
32
|
-
const
|
|
32
|
+
const STORED_PROVERS = [
|
|
33
|
+
...BACKENDS,
|
|
34
|
+
"cooper",
|
|
35
|
+
"expandenabled",
|
|
36
|
+
"expandcdot",
|
|
37
|
+
"lambdify",
|
|
38
|
+
"enabledaxioms",
|
|
39
|
+
"levelcomparison",
|
|
40
|
+
] as const;
|
|
41
|
+
|
|
42
|
+
type StoredProver = (typeof STORED_PROVERS)[number];
|
|
43
|
+
|
|
44
|
+
// A constant constructor's tag is the value itself.
|
|
45
|
+
const PROVERS: Record<StoredProver, { field: number; tag: number; isConstant?: boolean }> = {
|
|
33
46
|
zenon: { field: 1, tag: 1 },
|
|
34
47
|
isabelle: { field: 2, tag: 0 },
|
|
48
|
+
cooper: { field: 4, tag: 3, isConstant: true },
|
|
35
49
|
smt: { field: 10, tag: 8 },
|
|
36
50
|
z3: { field: 11, tag: 9 },
|
|
37
51
|
ls4: { field: 17, tag: 16 },
|
|
52
|
+
expandenabled: { field: 18, tag: 6, isConstant: true },
|
|
53
|
+
expandcdot: { field: 19, tag: 8, isConstant: true },
|
|
54
|
+
lambdify: { field: 20, tag: 9, isConstant: true },
|
|
55
|
+
enabledaxioms: { field: 21, tag: 10, isConstant: true },
|
|
56
|
+
levelcomparison: { field: 22, tag: 11, isConstant: true },
|
|
38
57
|
};
|
|
39
58
|
|
|
40
59
|
const FAIL_METHOD = 5;
|
|
@@ -94,18 +113,18 @@ export const loadFingerprints = (table: FingerprintTable, path: string, isSafe:
|
|
|
94
113
|
table.clear();
|
|
95
114
|
(buckets !== undefined && isBlock(buckets) ? buckets.fields : [])
|
|
96
115
|
.flatMap((bucket) => readBucket(bucket).toReversed())
|
|
97
|
-
.forEach((
|
|
98
|
-
if (typeof
|
|
116
|
+
.forEach((entry) => {
|
|
117
|
+
if (typeof entry[0] !== "string" || !isBlock(entry[1]))
|
|
99
118
|
throw new TlaProofError("corrupted fingerprint file");
|
|
100
119
|
table.set(
|
|
101
|
-
|
|
102
|
-
|
|
120
|
+
entry[0],
|
|
121
|
+
entry[1].fields.map((result, field) => (isTrusted(result, field) ? result : 0)),
|
|
103
122
|
);
|
|
104
123
|
});
|
|
105
124
|
};
|
|
106
125
|
|
|
107
126
|
const decodeResult = (
|
|
108
|
-
prover:
|
|
127
|
+
prover: StoredProver,
|
|
109
128
|
result: OcamlValue | undefined,
|
|
110
129
|
): ProofAttempt | undefined => {
|
|
111
130
|
const status = getField(result, 0);
|
|
@@ -129,8 +148,8 @@ const decodeResult = (
|
|
|
129
148
|
};
|
|
130
149
|
};
|
|
131
150
|
|
|
132
|
-
// Fpfile.fp_writes
|
|
133
|
-
const encodeResult = (prover:
|
|
151
|
+
// Fpfile.fp_writes counts the date's months from 0.
|
|
152
|
+
const encodeResult = (prover: StoredProver, attempt: ProofAttempt) => {
|
|
134
153
|
const now = new Date();
|
|
135
154
|
const method = attempt.method;
|
|
136
155
|
const timeout = { float: getBudget(method) };
|
|
@@ -153,7 +172,9 @@ const encodeResult = (prover: Backend, attempt: ProofAttempt) => {
|
|
|
153
172
|
createBlock(
|
|
154
173
|
0,
|
|
155
174
|
isProvedAttempt(attempt) ? 0 : createBlock(0, reason),
|
|
156
|
-
|
|
175
|
+
PROVERS[prover].isConstant
|
|
176
|
+
? PROVERS[prover].tag
|
|
177
|
+
: createBlock(PROVERS[prover].tag, argument),
|
|
157
178
|
),
|
|
158
179
|
createBlock(
|
|
159
180
|
0,
|
|
@@ -205,25 +226,25 @@ export const getKnownResults = (table: FingerprintTable) => {
|
|
|
205
226
|
const storedResults = new Map<ProofAttempt, OcamlValue>();
|
|
206
227
|
const storedRecords = new Map<Map<string, ProofAttempt>, OcamlValue[]>();
|
|
207
228
|
const results = new Map(
|
|
208
|
-
[...table].map((
|
|
229
|
+
[...table].map((entry) => {
|
|
209
230
|
const attempts = new Map(
|
|
210
|
-
|
|
211
|
-
const stored =
|
|
231
|
+
STORED_PROVERS.flatMap((prover) => {
|
|
232
|
+
const stored = entry[1][PROVERS[prover].field];
|
|
212
233
|
const result = decodeResult(prover, getField(stored, 0));
|
|
213
234
|
if (!result) return [];
|
|
214
235
|
storedResults.set(result, stored);
|
|
215
236
|
return [[prover, result]];
|
|
216
237
|
}),
|
|
217
238
|
);
|
|
218
|
-
storedRecords.set(attempts,
|
|
219
|
-
return [
|
|
239
|
+
storedRecords.set(attempts, entry[1]);
|
|
240
|
+
return [entry[0], attempts];
|
|
220
241
|
}),
|
|
221
242
|
);
|
|
222
243
|
const save = (path: string) => {
|
|
223
244
|
table.clear();
|
|
224
245
|
results.forEach((attempts, fingerprint) => {
|
|
225
246
|
const record = [...(storedRecords.get(attempts) ?? Array<OcamlValue>(RECORD_SIZE).fill(0))];
|
|
226
|
-
|
|
247
|
+
STORED_PROVERS.forEach((prover) => {
|
|
227
248
|
const attempt = attempts.get(prover);
|
|
228
249
|
if (attempt)
|
|
229
250
|
record[PROVERS[prover].field] =
|