tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545
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 +58 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-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 +45 -44
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- 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 +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +336 -88
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +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/dependencies.ts +23 -2
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +30 -3
- package/src/evaluate.ts +9 -3
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +3 -2
- 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 +633 -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 +1448 -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 +338 -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 +348 -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 +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
- package/src/prover/smt/solver/smtlib-script.ts +1702 -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 +1995 -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 +72 -36
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +1 -1
- package/src/sany/generator-expressions.ts +9 -17
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +1 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/search.ts +198 -45
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +4 -2
- package/src/successors.ts +1 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +1 -1
- package/src/prover/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
|
@@ -5,6 +5,26 @@ interface QuantifierScope {
|
|
|
5
5
|
exits: (() => void)[];
|
|
6
6
|
}
|
|
7
7
|
|
|
8
|
+
interface LetScope {
|
|
9
|
+
depth: number;
|
|
10
|
+
names: number[];
|
|
11
|
+
}
|
|
12
|
+
|
|
13
|
+
// The index of each name a LET binds, and of the parenthesis that closes its definitions.
|
|
14
|
+
const getLetNames = (tokens: RegExpMatchArray[], start: number) => {
|
|
15
|
+
const names: number[] = [];
|
|
16
|
+
let position = start;
|
|
17
|
+
let depth = 0;
|
|
18
|
+
do {
|
|
19
|
+
const token = tokens[position][0];
|
|
20
|
+
if (token === "(") depth++;
|
|
21
|
+
if (token === ")") depth--;
|
|
22
|
+
if (token === "(" && depth === 2) names.push(position + 1);
|
|
23
|
+
position++;
|
|
24
|
+
} while (depth > 0);
|
|
25
|
+
return { names, end: position - 1 };
|
|
26
|
+
};
|
|
27
|
+
|
|
8
28
|
export interface Identifier {
|
|
9
29
|
base: string;
|
|
10
30
|
salt: number;
|
|
@@ -52,10 +72,23 @@ export const createPrinter = (declared: Map<string, Identifier>) => {
|
|
|
52
72
|
const replacements = new Map<number, string>();
|
|
53
73
|
const renames = new Map<string, string[]>();
|
|
54
74
|
const scopes: QuantifierScope[] = [];
|
|
75
|
+
const lets = new Map<number, LetScope>();
|
|
76
|
+
const bindName = (index: number, scope: QuantifierScope) => {
|
|
77
|
+
const raw = tokens[index][0];
|
|
78
|
+
const identifier = context.adjoin(raw.replace(/(:\w+)?#\d+$/, ""));
|
|
79
|
+
const stack = renames.get(raw) ?? [];
|
|
80
|
+
renames.set(raw, [...stack, identifier.name]);
|
|
81
|
+
scope.exits.push(context.enter(identifier), () => renames.set(raw, stack));
|
|
82
|
+
replacements.set(index, identifier.name);
|
|
83
|
+
};
|
|
55
84
|
let position = 0;
|
|
56
85
|
let depth = 0;
|
|
57
86
|
while (position < tokens.length) {
|
|
58
87
|
const token = tokens[position][0];
|
|
88
|
+
if (token === "(" && tokens[position + 1]?.[0] === "let") {
|
|
89
|
+
const found = getLetNames(tokens, position + 2);
|
|
90
|
+
lets.set(found.end, { depth: depth + 1, names: found.names });
|
|
91
|
+
}
|
|
59
92
|
const isQuantifier =
|
|
60
93
|
token === "(" &&
|
|
61
94
|
(tokens[position + 1]?.[0] === "forall" || tokens[position + 1]?.[0] === "exists") &&
|
|
@@ -66,12 +99,7 @@ export const createPrinter = (declared: Map<string, Identifier>) => {
|
|
|
66
99
|
scopes.push(scope);
|
|
67
100
|
position += 3;
|
|
68
101
|
while (tokens[position]?.[0] === "(") {
|
|
69
|
-
|
|
70
|
-
const identifier = context.adjoin(raw.replace(/#\d+$/, ""));
|
|
71
|
-
const stack = renames.get(raw) ?? [];
|
|
72
|
-
renames.set(raw, [...stack, identifier.name]);
|
|
73
|
-
scope.exits.push(context.enter(identifier), () => renames.set(raw, stack));
|
|
74
|
-
replacements.set(position + 1, identifier.name);
|
|
102
|
+
bindName(position + 1, scope);
|
|
75
103
|
position += 4;
|
|
76
104
|
}
|
|
77
105
|
position++;
|
|
@@ -88,6 +116,14 @@ export const createPrinter = (declared: Map<string, Identifier>) => {
|
|
|
88
116
|
}
|
|
89
117
|
const name = renames.get(token)?.at(-1);
|
|
90
118
|
if (name !== undefined) replacements.set(position, name);
|
|
119
|
+
// Smtlib names a LET's definitions in order, though it prints them last first, and only its
|
|
120
|
+
// body sees them.
|
|
121
|
+
const letScope = lets.get(position);
|
|
122
|
+
if (letScope !== undefined) {
|
|
123
|
+
const scope: QuantifierScope = { depth: letScope.depth, exits: [] };
|
|
124
|
+
letScope.names.toReversed().forEach((index) => bindName(index, scope));
|
|
125
|
+
scopes.push(scope);
|
|
126
|
+
}
|
|
91
127
|
position++;
|
|
92
128
|
}
|
|
93
129
|
return tokens
|
package/src/prover/smt/data.ts
CHANGED
|
@@ -42,11 +42,15 @@ import {
|
|
|
42
42
|
SUBSET_EQ,
|
|
43
43
|
TAIL,
|
|
44
44
|
tla,
|
|
45
|
-
TRIG_EQ,
|
|
46
45
|
TT_IDV,
|
|
47
46
|
UNION,
|
|
48
47
|
} from "./format";
|
|
48
|
+
import { getUntypedSpec } from "./arithmetic";
|
|
49
|
+
import type { SmtEncoding } from "./rewrite";
|
|
49
50
|
import { axiom, type Axiom } from "./table";
|
|
51
|
+
import { getTypeKey, getTypeName, IDV, type Type } from "./types";
|
|
52
|
+
|
|
53
|
+
const SET_OF_IDV: Type = { kind: "Set", element: IDV };
|
|
50
54
|
|
|
51
55
|
export interface SymbolSpec {
|
|
52
56
|
declaration: string | undefined;
|
|
@@ -55,8 +59,11 @@ export interface SymbolSpec {
|
|
|
55
59
|
}
|
|
56
60
|
|
|
57
61
|
export interface CollectState {
|
|
62
|
+
encoding: SmtEncoding;
|
|
58
63
|
recordFields: Map<string, string[]>;
|
|
64
|
+
setTypes: Map<string, Type>;
|
|
59
65
|
strings: string[];
|
|
66
|
+
integers: string[];
|
|
60
67
|
isFunConstr: boolean;
|
|
61
68
|
isFunSet: boolean;
|
|
62
69
|
isExcept: boolean;
|
|
@@ -65,6 +72,12 @@ export interface CollectState {
|
|
|
65
72
|
anonymous: Map<string, number>;
|
|
66
73
|
}
|
|
67
74
|
|
|
75
|
+
const getOmittedDeclaration = (name: string) =>
|
|
76
|
+
`; omitted declaration of 'TLA__${name}' (second-order)`;
|
|
77
|
+
|
|
78
|
+
const getLiteralNames = (count: number) =>
|
|
79
|
+
Array.from({ length: count }, (_value, index) => `IntLit_${index + 1}`);
|
|
80
|
+
|
|
68
81
|
const SEQUENCE_DEPS = ["Mem", "Seq", "Len", "FunApp", "NatSet", "Cast_Int", "Proj_Int"];
|
|
69
82
|
|
|
70
83
|
const INT_EXP = tla("IntExp");
|
|
@@ -97,46 +110,11 @@ const STATIC_SPECS = new Map(
|
|
|
97
110
|
axiom(
|
|
98
111
|
"IntExpTyping",
|
|
99
112
|
[],
|
|
100
|
-
`(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (or (distinct x (${CAST_INT} 0)) (${INT_LTEQ} (${CAST_INT} 1) y))) (${MEM} (${INT_EXP} x y) ${INT_SET})) :pattern ((${INT_EXP} x y))))`,
|
|
113
|
+
`(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} (${CAST_INT} 0) y) (or (distinct x (${CAST_INT} 0)) (${INT_LTEQ} (${CAST_INT} 1) y))) (${MEM} (${INT_EXP} x y) ${INT_SET})) :pattern ((${INT_EXP} x y))))`,
|
|
101
114
|
),
|
|
102
115
|
],
|
|
103
116
|
),
|
|
104
|
-
|
|
105
|
-
undefined,
|
|
106
|
-
[
|
|
107
|
-
"Mem",
|
|
108
|
-
"Seq",
|
|
109
|
-
"Len",
|
|
110
|
-
"Append",
|
|
111
|
-
"FunApp",
|
|
112
|
-
"FunDom",
|
|
113
|
-
"IntSet",
|
|
114
|
-
"NatSet",
|
|
115
|
-
"Tuple_0",
|
|
116
|
-
"Proj_Int",
|
|
117
|
-
],
|
|
118
|
-
[
|
|
119
|
-
axiom("SeqSelectseqTyping", [], undefined),
|
|
120
|
-
axiom("SeqSelectseqLen", [], undefined),
|
|
121
|
-
axiom("SeqSelectseqNil", [], undefined),
|
|
122
|
-
axiom("SeqSelectseqApp", [], undefined),
|
|
123
|
-
axiom("SeqSelectseqAppend", [], undefined),
|
|
124
|
-
],
|
|
125
|
-
),
|
|
126
|
-
Choose: createSpec(undefined, [], [axiom("ChooseDef", [], undefined)]),
|
|
127
|
-
Mem: declareSpec(
|
|
128
|
-
"Mem",
|
|
129
|
-
2,
|
|
130
|
-
["SetExtTrigger"],
|
|
131
|
-
[
|
|
132
|
-
axiom(
|
|
133
|
-
"SetExt",
|
|
134
|
-
[],
|
|
135
|
-
`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${MEM} z x) (${MEM} z y))) (= x y)) :pattern ((${SET_EXT_TRIGGER} x y))))`,
|
|
136
|
-
),
|
|
137
|
-
],
|
|
138
|
-
"Bool",
|
|
139
|
-
),
|
|
117
|
+
Choose: createSpec(getOmittedDeclaration("Choose"), [], [axiom("ChooseDef", [], undefined)]),
|
|
140
118
|
SubsetEq: declareSpec(
|
|
141
119
|
"SubsetEq",
|
|
142
120
|
2,
|
|
@@ -190,30 +168,12 @@ const STATIC_SPECS = new Map(
|
|
|
190
168
|
["Mem"],
|
|
191
169
|
[getSetOperationDef("Cup", `(or (${MEM} x a) (${MEM} x b))`)],
|
|
192
170
|
),
|
|
193
|
-
Cap: declareSpec(
|
|
194
|
-
"Cap",
|
|
195
|
-
2,
|
|
196
|
-
["Mem", "SetEnum_0", "SetExtTrigger"],
|
|
197
|
-
[
|
|
198
|
-
getSetOperationDef("Cap", `(and (${MEM} x a) (${MEM} x b))`),
|
|
199
|
-
axiom(
|
|
200
|
-
"DisjointTrigger",
|
|
201
|
-
[],
|
|
202
|
-
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} (${CAP} x y) ${tla("SetEnum_0")}) :pattern ((${CAP} x y))))`,
|
|
203
|
-
),
|
|
204
|
-
],
|
|
205
|
-
),
|
|
206
171
|
SetMinus: declareSpec(
|
|
207
172
|
"SetMinus",
|
|
208
173
|
2,
|
|
209
174
|
["Mem"],
|
|
210
175
|
[getSetOperationDef("SetMinus", `(and (${MEM} x a) (not (${MEM} x b)))`)],
|
|
211
176
|
),
|
|
212
|
-
SetSt: createSpec(
|
|
213
|
-
undefined,
|
|
214
|
-
["Mem", "SetEnum_0", "SetExtTrigger"],
|
|
215
|
-
[axiom("SetStDef", [], undefined), axiom("EmptyComprehensionTrigger", [], undefined)],
|
|
216
|
-
),
|
|
217
177
|
NatSet: declareSpec(
|
|
218
178
|
"NatSet",
|
|
219
179
|
0,
|
|
@@ -440,24 +400,6 @@ const STATIC_SPECS = new Map(
|
|
|
440
400
|
],
|
|
441
401
|
),
|
|
442
402
|
Proj_Int: createSpec(declare(tla("Proj_Int"), 1, "Int"), [], []),
|
|
443
|
-
TrigEq_Set$Idv$: declareSpec(
|
|
444
|
-
"TrigEq_Set$Idv$",
|
|
445
|
-
2,
|
|
446
|
-
["SetExtTrigger"],
|
|
447
|
-
[
|
|
448
|
-
axiom(
|
|
449
|
-
"ExtTrigEqDef",
|
|
450
|
-
["Set$Idv$"],
|
|
451
|
-
`(forall ((x Idv) (y Idv)) (! (= (${TRIG_EQ} x y) (= x y)) :pattern ((${TRIG_EQ} x y))))`,
|
|
452
|
-
),
|
|
453
|
-
axiom(
|
|
454
|
-
"ExtTrigEqTrigger",
|
|
455
|
-
["Idv"],
|
|
456
|
-
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} x y) :pattern ((${TRIG_EQ} x y))))`,
|
|
457
|
-
),
|
|
458
|
-
],
|
|
459
|
-
"Bool",
|
|
460
|
-
),
|
|
461
403
|
SetExtTrigger: declareSpec("SetExtTrigger", 2, [], [], "Bool"),
|
|
462
404
|
IsSetOf: declareSpec("IsSetOf", 1, [], [], "Bool"),
|
|
463
405
|
BoolSet: declareSpec("BoolSet", 0, [], []),
|
|
@@ -465,6 +407,13 @@ const STATIC_SPECS = new Map(
|
|
|
465
407
|
IntSet: declareSpec("IntSet", 0, [], []),
|
|
466
408
|
Tt_Idv: declareSpec("Tt_Idv", 0, [], []),
|
|
467
409
|
TIntLteq: createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]),
|
|
410
|
+
TIntLt: createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]),
|
|
411
|
+
TIntGteq: createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]),
|
|
412
|
+
TIntGt: createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]),
|
|
413
|
+
TIntPlus: createSpec(undefined, ["IntPlus"], []),
|
|
414
|
+
TIntMinus: createSpec(undefined, ["IntMinus"], []),
|
|
415
|
+
TIntTimes: createSpec(undefined, ["IntTimes"], []),
|
|
416
|
+
TIntUminus: createSpec(undefined, ["IntUminus"], []),
|
|
468
417
|
}),
|
|
469
418
|
);
|
|
470
419
|
|
|
@@ -481,12 +430,17 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
481
430
|
const setOf = /^SetOf_(\d+)$/.exec(name);
|
|
482
431
|
if (setOf) {
|
|
483
432
|
const count = Number(setOf[1]);
|
|
433
|
+
const axioms = [
|
|
434
|
+
axiom("SetOfIntro", [count], undefined),
|
|
435
|
+
axiom("SetOfElim", [count], undefined),
|
|
436
|
+
];
|
|
437
|
+
if (!state.encoding.isSetExtensional)
|
|
438
|
+
return createSpec(getOmittedDeclaration(name), ["Mem"], axioms);
|
|
484
439
|
return createSpec(
|
|
485
|
-
|
|
440
|
+
getOmittedDeclaration(name),
|
|
486
441
|
["Mem", "IsSetOf"],
|
|
487
442
|
[
|
|
488
|
-
|
|
489
|
-
axiom("SetOfElim", [count], undefined),
|
|
443
|
+
...axioms,
|
|
490
444
|
axiom("AssertIsSetOf", [count], undefined),
|
|
491
445
|
axiom(
|
|
492
446
|
"CompareSetOfTrigger",
|
|
@@ -511,15 +465,62 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
511
465
|
[axiom("StrLitIsstr", [value], `(${MEM} ${symbol} ${STR_SET})`), ...distinct],
|
|
512
466
|
);
|
|
513
467
|
}
|
|
468
|
+
const integer = /^IntLit_(\d+)$/.exec(name);
|
|
469
|
+
if (integer) {
|
|
470
|
+
const value = integer[1];
|
|
471
|
+
const distinct = state.integers.map((other) =>
|
|
472
|
+
axiom(
|
|
473
|
+
"IntLitDistinct",
|
|
474
|
+
[BigInt(other), BigInt(value)],
|
|
475
|
+
`(distinct ${tla(`IntLit_${other}`)} ${symbol})`,
|
|
476
|
+
),
|
|
477
|
+
);
|
|
478
|
+
state.integers.push(value);
|
|
479
|
+
const zero = tla("IntLit_0");
|
|
480
|
+
const isPositivityNeeded = value === "0" && !state.encoding.isArithmetic;
|
|
481
|
+
return declareSpec(
|
|
482
|
+
name,
|
|
483
|
+
0,
|
|
484
|
+
["Mem", "IntSet", "IntLit_0", "IntLteq", ...(isPositivityNeeded ? ["IntLit_1"] : [])],
|
|
485
|
+
[
|
|
486
|
+
axiom("IntLitIsint", [BigInt(value)], `(${MEM} ${symbol} ${INT_SET})`),
|
|
487
|
+
axiom(
|
|
488
|
+
"IntLitZeroCmp",
|
|
489
|
+
[BigInt(value)],
|
|
490
|
+
value === "0" ? `(${INT_LTEQ} ${symbol} ${zero})` : `(${INT_LTEQ} ${zero} ${symbol})`,
|
|
491
|
+
),
|
|
492
|
+
...distinct,
|
|
493
|
+
...(isPositivityNeeded
|
|
494
|
+
? [
|
|
495
|
+
axiom(
|
|
496
|
+
"NonNegIsPos",
|
|
497
|
+
[],
|
|
498
|
+
`(forall ((x Idv)) (! (=> (and (${INT_LTEQ} ${zero} x) (distinct ${zero} x)) (${INT_LTEQ} ${tla("IntLit_1")} x)) :pattern ((${INT_LTEQ} ${zero} x))))`,
|
|
499
|
+
),
|
|
500
|
+
]
|
|
501
|
+
: []),
|
|
502
|
+
],
|
|
503
|
+
);
|
|
504
|
+
}
|
|
514
505
|
const tuple = /^Tuple_(\d+)$/.exec(name);
|
|
515
506
|
if (tuple) {
|
|
516
507
|
const count = Number(tuple[1]);
|
|
517
508
|
state.tuples.push(count);
|
|
509
|
+
const indexes = state.encoding.isArithmetic
|
|
510
|
+
? ["Cast_Int"]
|
|
511
|
+
: count === 0
|
|
512
|
+
? ["IntLit_0"]
|
|
513
|
+
: getLiteralNames(count);
|
|
518
514
|
const deps =
|
|
519
515
|
count === 0
|
|
520
|
-
? ["FunIsafcn",
|
|
521
|
-
: ["FunIsafcn", "FunDom", "FunApp", `SetEnum_${count}`,
|
|
522
|
-
return declareSpec(
|
|
516
|
+
? ["FunIsafcn", ...indexes, "Seq", "Len"]
|
|
517
|
+
: ["FunIsafcn", "FunDom", "FunApp", `SetEnum_${count}`, ...indexes, "Mem", "Seq", "Len"];
|
|
518
|
+
return declareSpec(
|
|
519
|
+
name,
|
|
520
|
+
count,
|
|
521
|
+
deps,
|
|
522
|
+
getTupleAxioms(count, state.isExcept, state.encoding.isArithmetic),
|
|
523
|
+
);
|
|
523
524
|
}
|
|
524
525
|
const product = /^Product_(\d+)$/.exec(name);
|
|
525
526
|
if (product) {
|
|
@@ -527,8 +528,44 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
527
528
|
return declareSpec(
|
|
528
529
|
name,
|
|
529
530
|
count,
|
|
530
|
-
[
|
|
531
|
-
|
|
531
|
+
[
|
|
532
|
+
"Mem",
|
|
533
|
+
`Tuple_${count}`,
|
|
534
|
+
"FunApp",
|
|
535
|
+
...(state.encoding.isArithmetic ? ["Cast_Int", "Proj_Int"] : getLiteralNames(count)),
|
|
536
|
+
],
|
|
537
|
+
getComponentSet(
|
|
538
|
+
"Product",
|
|
539
|
+
[count],
|
|
540
|
+
symbol,
|
|
541
|
+
tla(`Tuple_${count}`),
|
|
542
|
+
getIntegers(count, state.encoding.isArithmetic),
|
|
543
|
+
"t",
|
|
544
|
+
),
|
|
545
|
+
);
|
|
546
|
+
}
|
|
547
|
+
if (name.startsWith("TrigEq_")) {
|
|
548
|
+
const type = state.setTypes.get(name) ?? SET_OF_IDV;
|
|
549
|
+
const element = type.kind === "Set" ? type.element : IDV;
|
|
550
|
+
return declareSpec(
|
|
551
|
+
name,
|
|
552
|
+
2,
|
|
553
|
+
["SetExtTrigger"],
|
|
554
|
+
[
|
|
555
|
+
axiom(
|
|
556
|
+
"ExtTrigEqDef",
|
|
557
|
+
[getTypeKey(type)],
|
|
558
|
+
`(forall ((x Idv) (y Idv)) (! (= (${symbol} x y) (= x y)) :pattern ((${symbol} x y))))`,
|
|
559
|
+
`ExtTrigEqDef ${getTypeName(type)}`,
|
|
560
|
+
),
|
|
561
|
+
axiom(
|
|
562
|
+
"ExtTrigEqTrigger",
|
|
563
|
+
[getTypeKey(element)],
|
|
564
|
+
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} x y) :pattern ((${symbol} x y))))`,
|
|
565
|
+
`ExtTrigEqTrigger ${getTypeName(element)}`,
|
|
566
|
+
),
|
|
567
|
+
],
|
|
568
|
+
"Bool",
|
|
532
569
|
);
|
|
533
570
|
}
|
|
534
571
|
const fields = state.recordFields.get(name);
|
|
@@ -558,6 +595,8 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
558
595
|
}
|
|
559
596
|
const anonymous = state.anonymous.get(name);
|
|
560
597
|
if (anonymous !== undefined) return declareSpec(name, anonymous, [], []);
|
|
598
|
+
const untyped = state.encoding.isArithmetic ? undefined : getUntypedSpec(name);
|
|
599
|
+
if (untyped) return untyped;
|
|
561
600
|
const known = STATIC_SPECS.get(name);
|
|
562
601
|
if (known) return known;
|
|
563
602
|
const typed = TYPED_OPERATORS[name];
|
|
@@ -570,6 +609,74 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
570
609
|
name === "IntLteq" ? "Bool" : "Idv",
|
|
571
610
|
);
|
|
572
611
|
switch (name) {
|
|
612
|
+
case "SelectSeq":
|
|
613
|
+
return createSpec(
|
|
614
|
+
getOmittedDeclaration(name),
|
|
615
|
+
[
|
|
616
|
+
"Mem",
|
|
617
|
+
"Seq",
|
|
618
|
+
"Len",
|
|
619
|
+
"Append",
|
|
620
|
+
"FunApp",
|
|
621
|
+
"FunDom",
|
|
622
|
+
"IntSet",
|
|
623
|
+
"NatSet",
|
|
624
|
+
"Tuple_0",
|
|
625
|
+
state.encoding.isArithmetic ? "Proj_Int" : "IntLteq",
|
|
626
|
+
],
|
|
627
|
+
[
|
|
628
|
+
axiom("SeqSelectseqTyping", [], undefined),
|
|
629
|
+
axiom("SeqSelectseqLen", [], undefined),
|
|
630
|
+
axiom("SeqSelectseqNil", [], undefined),
|
|
631
|
+
axiom("SeqSelectseqApp", [], undefined),
|
|
632
|
+
axiom("SeqSelectseqAppend", [], undefined),
|
|
633
|
+
],
|
|
634
|
+
);
|
|
635
|
+
case "Mem":
|
|
636
|
+
return declareSpec(
|
|
637
|
+
name,
|
|
638
|
+
2,
|
|
639
|
+
state.encoding.isSetExtensional ? ["SetExtTrigger"] : [],
|
|
640
|
+
state.encoding.isSetExtensional
|
|
641
|
+
? [
|
|
642
|
+
axiom(
|
|
643
|
+
"SetExt",
|
|
644
|
+
[],
|
|
645
|
+
`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${MEM} z x) (${MEM} z y))) (= x y)) :pattern ((${SET_EXT_TRIGGER} x y))))`,
|
|
646
|
+
),
|
|
647
|
+
]
|
|
648
|
+
: [],
|
|
649
|
+
"Bool",
|
|
650
|
+
);
|
|
651
|
+
case "Cap":
|
|
652
|
+
return declareSpec(
|
|
653
|
+
name,
|
|
654
|
+
2,
|
|
655
|
+
["Mem", ...(state.encoding.isSetExtensional ? ["SetEnum_0", "SetExtTrigger"] : [])],
|
|
656
|
+
[
|
|
657
|
+
getSetOperationDef("Cap", `(and (${MEM} x a) (${MEM} x b))`),
|
|
658
|
+
...(state.encoding.isSetExtensional
|
|
659
|
+
? [
|
|
660
|
+
axiom(
|
|
661
|
+
"DisjointTrigger",
|
|
662
|
+
[],
|
|
663
|
+
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} (${CAP} x y) ${tla("SetEnum_0")}) :pattern ((${CAP} x y))))`,
|
|
664
|
+
),
|
|
665
|
+
]
|
|
666
|
+
: []),
|
|
667
|
+
],
|
|
668
|
+
);
|
|
669
|
+
case "SetSt":
|
|
670
|
+
return createSpec(
|
|
671
|
+
getOmittedDeclaration(name),
|
|
672
|
+
["Mem", ...(state.encoding.isSetExtensional ? ["SetEnum_0", "SetExtTrigger"] : [])],
|
|
673
|
+
[
|
|
674
|
+
axiom("SetStDef", [], undefined),
|
|
675
|
+
...(state.encoding.isSetExtensional
|
|
676
|
+
? [axiom("EmptyComprehensionTrigger", [], undefined)]
|
|
677
|
+
: []),
|
|
678
|
+
],
|
|
679
|
+
);
|
|
573
680
|
case "FunSet":
|
|
574
681
|
state.isFunSet = true;
|
|
575
682
|
return declareSpec(
|
|
@@ -598,7 +705,7 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
598
705
|
case "FunFcn":
|
|
599
706
|
state.isFunConstr = true;
|
|
600
707
|
return createSpec(
|
|
601
|
-
|
|
708
|
+
getOmittedDeclaration(name),
|
|
602
709
|
["FunIsafcn"],
|
|
603
710
|
[
|
|
604
711
|
axiom("FunConstrIsafcn", [], undefined),
|
|
@@ -633,7 +740,7 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
633
740
|
[],
|
|
634
741
|
`(forall ((f Idv) (x Idv) (y Idv) (z Idv)) (! (=> (${MEM} z (${FUN_DOM} f)) (and (=> (= z x) (= (${FUN_APP} ${updated} z) y)) (=> (distinct z x) (= (${FUN_APP} ${updated} z) (${FUN_APP} f z))))) :pattern ((${FUN_APP} ${updated} z)) :pattern (${updated} (${FUN_APP} f z))))`,
|
|
635
742
|
),
|
|
636
|
-
...state.tuples.flatMap(getTupleExcepts),
|
|
743
|
+
...state.tuples.flatMap((count) => getTupleExcepts(count, state.encoding.isArithmetic)),
|
|
637
744
|
...state.records.flatMap(getRecordExcepts),
|
|
638
745
|
],
|
|
639
746
|
);
|