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,15 +1,9 @@
|
|
|
1
|
-
import { TlaUnsupportedError } from "../../errors";
|
|
1
|
+
import { TlaError, TlaProverError, TlaUnsupportedError } from "../../errors";
|
|
2
2
|
import { normalizeApply, shiftExpr } from "../../obligations/substitution";
|
|
3
|
-
import type { Bound, Builtin, Expr, Sequent } from "../../obligations/expression";
|
|
3
|
+
import type { Bound, Builtin, Expr, Hyp, Sequent } from "../../obligations/expression";
|
|
4
|
+
import { getNumeral } from "./axioms";
|
|
4
5
|
import { createContext, type Identifier } from "./context";
|
|
5
|
-
import {
|
|
6
|
-
createFlattener,
|
|
7
|
-
getDepth,
|
|
8
|
-
getVariable,
|
|
9
|
-
removeUnprimable,
|
|
10
|
-
UNPRIMABLE,
|
|
11
|
-
type Entry,
|
|
12
|
-
} from "./flatten";
|
|
6
|
+
import { createFlattener, getDepth, removeUnprimable, UNPRIMABLE, type Entry } from "./flatten";
|
|
13
7
|
import {
|
|
14
8
|
BOOL_SET,
|
|
15
9
|
BUILTIN_SYMBOLS,
|
|
@@ -20,18 +14,21 @@ import {
|
|
|
20
14
|
disjoin,
|
|
21
15
|
FUN_APP,
|
|
22
16
|
FUN_EXCEPT,
|
|
17
|
+
FUN_ISAFCN,
|
|
23
18
|
FUN_SET,
|
|
24
19
|
getBinders,
|
|
20
|
+
getVariable,
|
|
21
|
+
getVariableSort,
|
|
25
22
|
INT_LTEQ,
|
|
26
23
|
INT_SET,
|
|
27
24
|
MEM,
|
|
28
25
|
NAT_SET,
|
|
26
|
+
PROJ_INT,
|
|
29
27
|
STR_SET,
|
|
30
28
|
SUBSET_EQ,
|
|
31
29
|
tla,
|
|
32
30
|
TT_IDV,
|
|
33
31
|
} from "./format";
|
|
34
|
-
import { getIntegers } from "./axioms";
|
|
35
32
|
import { getEquality, resolveTriggers, type Polarity } from "./extensionality";
|
|
36
33
|
import {
|
|
37
34
|
getChooseAxioms,
|
|
@@ -40,17 +37,38 @@ import {
|
|
|
40
37
|
getSetOfAxioms,
|
|
41
38
|
getSetStAxioms,
|
|
42
39
|
} from "./instances";
|
|
40
|
+
import {
|
|
41
|
+
BOOL,
|
|
42
|
+
getSort,
|
|
43
|
+
getTypeName,
|
|
44
|
+
IDV,
|
|
45
|
+
INT,
|
|
46
|
+
isSameType,
|
|
47
|
+
searchType,
|
|
48
|
+
STRING,
|
|
49
|
+
type Type,
|
|
50
|
+
} from "./types";
|
|
43
51
|
|
|
44
52
|
interface Term {
|
|
45
53
|
isBool: boolean;
|
|
46
54
|
text: string;
|
|
47
55
|
integer?: string;
|
|
56
|
+
type?: Type;
|
|
48
57
|
}
|
|
49
58
|
|
|
50
59
|
export interface EncodingSession {
|
|
51
60
|
caseErrors: number;
|
|
52
61
|
}
|
|
53
62
|
|
|
63
|
+
// The options of Smtlib.preprocess that tlapm's --debug flags set.
|
|
64
|
+
export interface SmtEncoding {
|
|
65
|
+
isArithmetic: boolean;
|
|
66
|
+
rewriteLevel: number;
|
|
67
|
+
isSetExtensional: boolean;
|
|
68
|
+
// Type level 2, which --debug smarter_types turns on.
|
|
69
|
+
isTyped: boolean;
|
|
70
|
+
}
|
|
71
|
+
|
|
54
72
|
export interface Mode {
|
|
55
73
|
isOmitted: boolean;
|
|
56
74
|
polarity: Polarity;
|
|
@@ -59,8 +77,15 @@ export interface Mode {
|
|
|
59
77
|
}
|
|
60
78
|
|
|
61
79
|
export type Binding =
|
|
62
|
-
| { kind: "constant"; symbol: string }
|
|
63
|
-
| {
|
|
80
|
+
| { kind: "constant"; symbol: string; type?: Type }
|
|
81
|
+
| {
|
|
82
|
+
kind: "variable";
|
|
83
|
+
name: string;
|
|
84
|
+
symbol: string;
|
|
85
|
+
primed: string;
|
|
86
|
+
type?: Type;
|
|
87
|
+
primedType?: Type;
|
|
88
|
+
}
|
|
64
89
|
| { kind: "operator"; symbol: string; arity: number }
|
|
65
90
|
| { kind: "secondOrder"; name: string; shapes: number[] }
|
|
66
91
|
| { kind: "unsupported"; reason: string };
|
|
@@ -72,9 +97,11 @@ export interface Env {
|
|
|
72
97
|
|
|
73
98
|
export interface Encoder {
|
|
74
99
|
session: EncodingSession;
|
|
100
|
+
encoding: SmtEncoding;
|
|
75
101
|
flattener: ReturnType<typeof createFlattener>;
|
|
76
102
|
anonymous: Map<string, number>;
|
|
77
103
|
recordFields: Map<string, string[]>;
|
|
104
|
+
setTypes: Map<string, Type>;
|
|
78
105
|
context: ReturnType<typeof createContext>;
|
|
79
106
|
declared: Map<string, Identifier>;
|
|
80
107
|
}
|
|
@@ -85,6 +112,64 @@ interface NestedContext {
|
|
|
85
112
|
wrappers: ((body: string) => string)[];
|
|
86
113
|
}
|
|
87
114
|
|
|
115
|
+
const UNSUPPORTED_OPERANDS = new Set<Builtin>([
|
|
116
|
+
"Prime",
|
|
117
|
+
"StrongPrime",
|
|
118
|
+
"Leadsto",
|
|
119
|
+
"ENABLED",
|
|
120
|
+
"UNCHANGED",
|
|
121
|
+
"Cdot",
|
|
122
|
+
"Actplus",
|
|
123
|
+
"BoxTrue",
|
|
124
|
+
"BoxFalse",
|
|
125
|
+
"Diamond",
|
|
126
|
+
"Divides",
|
|
127
|
+
"Irregular",
|
|
128
|
+
]);
|
|
129
|
+
|
|
130
|
+
const ARITHMETIC = new Set<Builtin>(["Plus", "Minus", "Times", "Uminus"]);
|
|
131
|
+
|
|
132
|
+
const getSetType = (element: Type): Type => ({ kind: "Set", element });
|
|
133
|
+
|
|
134
|
+
const getRecordFieldType = (type: Type, field: string) =>
|
|
135
|
+
type.kind === "Record" ? type.fields.find((entry) => entry.name === field)?.type : undefined;
|
|
136
|
+
|
|
137
|
+
const getFieldType = (type: Type, field: string) =>
|
|
138
|
+
type.kind === "Fun" && type.domain.kind === "String"
|
|
139
|
+
? type.range
|
|
140
|
+
: getRecordFieldType(type, field);
|
|
141
|
+
|
|
142
|
+
const getComponentType = (type: Type, args: Expr[]) => {
|
|
143
|
+
if (args.length !== 1) return undefined;
|
|
144
|
+
const arg = args[0];
|
|
145
|
+
if (arg.kind === "String") return getRecordFieldType(type, arg.value);
|
|
146
|
+
return arg.kind === "Num" && arg.fraction === "" && type.kind === "Product"
|
|
147
|
+
? type.items[Number(arg.integer) - 1]
|
|
148
|
+
: undefined;
|
|
149
|
+
};
|
|
150
|
+
|
|
151
|
+
const getBuiltinType = (builtin: Builtin, types: Type[]): Type | undefined => {
|
|
152
|
+
const first = types[0];
|
|
153
|
+
switch (builtin) {
|
|
154
|
+
case "Range":
|
|
155
|
+
return getSetType(INT);
|
|
156
|
+
case "Cup":
|
|
157
|
+
case "Cap":
|
|
158
|
+
case "Setminus":
|
|
159
|
+
return first.kind === "Set" && isSameType(first, types[1]) ? first : undefined;
|
|
160
|
+
case "UNION":
|
|
161
|
+
return first.kind === "Set" && first.element.kind === "Set" ? first.element : undefined;
|
|
162
|
+
case "SUBSET":
|
|
163
|
+
return first.kind === "Set" ? getSetType(first) : undefined;
|
|
164
|
+
case "DOMAIN":
|
|
165
|
+
if (first.kind === "Fun") return getSetType(first.domain);
|
|
166
|
+
if (first.kind === "Product") return getSetType(INT);
|
|
167
|
+
return first.kind === "Record" ? getSetType(STRING) : undefined;
|
|
168
|
+
default:
|
|
169
|
+
return undefined;
|
|
170
|
+
}
|
|
171
|
+
};
|
|
172
|
+
|
|
88
173
|
const toBool = (term: Term) =>
|
|
89
174
|
term.isBool ? term.text : `(= ${resolveTriggers(term.text, true)} ${TT_IDV})`;
|
|
90
175
|
|
|
@@ -93,7 +178,37 @@ const toIdv = (term: Term) =>
|
|
|
93
178
|
|
|
94
179
|
const wrapBool = (text: string): Term => ({ isBool: true, text });
|
|
95
180
|
|
|
96
|
-
const wrapIdv = (text: string): Term => ({ isBool: false, text });
|
|
181
|
+
const wrapIdv = (text: string, type?: Type): Term => ({ isBool: false, text, type });
|
|
182
|
+
|
|
183
|
+
const wrapInteger = (text: string): Term => ({
|
|
184
|
+
isBool: false,
|
|
185
|
+
text: `(${CAST_INT} ${text})`,
|
|
186
|
+
integer: text,
|
|
187
|
+
});
|
|
188
|
+
|
|
189
|
+
const getTypedOnly = (encoder: Encoder, type: Type | undefined) =>
|
|
190
|
+
encoder.encoding.isTyped ? type : undefined;
|
|
191
|
+
|
|
192
|
+
const getType = (term: Term) =>
|
|
193
|
+
term.isBool ? BOOL : term.integer === undefined ? (term.type ?? IDV) : INT;
|
|
194
|
+
|
|
195
|
+
const getTyped = (symbol: string, type: Type | undefined) => {
|
|
196
|
+
if (type?.kind === "Int") return wrapInteger(symbol);
|
|
197
|
+
return type?.kind === "Bool" ? wrapBool(symbol) : wrapIdv(symbol, type);
|
|
198
|
+
};
|
|
199
|
+
|
|
200
|
+
// Type.Synthesize marks a component of a tuple or record as projected into its type, and only
|
|
201
|
+
// Int has a projection at type level 2. tlapm leaves a Bool component an Idv it then uses as a
|
|
202
|
+
// Bool, so it stays an individual here.
|
|
203
|
+
const project = (text: string, type: Type) => {
|
|
204
|
+
if (type.kind === "Int") return { isBool: false, text, integer: `(${PROJ_INT} ${text})` };
|
|
205
|
+
return wrapIdv(text, type.kind === "Bool" ? undefined : type);
|
|
206
|
+
};
|
|
207
|
+
|
|
208
|
+
const getElementType = (term: Term) => {
|
|
209
|
+
const type = getType(term);
|
|
210
|
+
return type.kind === "Set" ? type.element : undefined;
|
|
211
|
+
};
|
|
97
212
|
|
|
98
213
|
const getBinding = (env: Env | undefined, index: number): Binding => {
|
|
99
214
|
const found = Array.from({ length: index - 1 }).reduce<Env | undefined>(
|
|
@@ -106,6 +221,57 @@ const getBinding = (env: Env | undefined, index: number): Binding => {
|
|
|
106
221
|
|
|
107
222
|
export const push = (env: Env | undefined, binding: Binding): Env => ({ binding, rest: env });
|
|
108
223
|
|
|
224
|
+
const inferType = (
|
|
225
|
+
encoder: Encoder,
|
|
226
|
+
expression: Expr,
|
|
227
|
+
env: Env | undefined,
|
|
228
|
+
mode: Mode,
|
|
229
|
+
depth: number,
|
|
230
|
+
) => {
|
|
231
|
+
const inner = Array.from({ length: depth }).reduce<Env | undefined>(
|
|
232
|
+
(current) => push(current, { kind: "unsupported", reason: "a declaration without a type" }),
|
|
233
|
+
env,
|
|
234
|
+
);
|
|
235
|
+
try {
|
|
236
|
+
return getType(
|
|
237
|
+
encode(
|
|
238
|
+
createEncoder({ caseErrors: encoder.session.caseErrors }, encoder.encoding),
|
|
239
|
+
expression,
|
|
240
|
+
inner,
|
|
241
|
+
mode,
|
|
242
|
+
),
|
|
243
|
+
);
|
|
244
|
+
} catch (error) {
|
|
245
|
+
if (error instanceof TlaError) return undefined;
|
|
246
|
+
throw error;
|
|
247
|
+
}
|
|
248
|
+
};
|
|
249
|
+
|
|
250
|
+
// The type a later hypothesis gives a declaration with no domain, which the env doesn't bind yet.
|
|
251
|
+
// A primed variable has no index of its own, so the hypotheses name it.
|
|
252
|
+
export const searchDeclarationType = (
|
|
253
|
+
encoder: Encoder,
|
|
254
|
+
expression: Expr,
|
|
255
|
+
isPositive: boolean,
|
|
256
|
+
env: Env | undefined,
|
|
257
|
+
mode: Mode,
|
|
258
|
+
primed?: string,
|
|
259
|
+
) =>
|
|
260
|
+
encoder.encoding.isTyped
|
|
261
|
+
? searchType(
|
|
262
|
+
{
|
|
263
|
+
infer: (inner, depth) =>
|
|
264
|
+
inferType(encoder, inner, env, mode, primed === undefined ? depth + 1 : depth),
|
|
265
|
+
isTarget: (inner, depth) =>
|
|
266
|
+
primed === undefined
|
|
267
|
+
? inner.kind === "Ix" && inner.index === depth + 1
|
|
268
|
+
: inner.kind === "Opaque" && inner.name === primed,
|
|
269
|
+
},
|
|
270
|
+
isPositive,
|
|
271
|
+
expression,
|
|
272
|
+
)
|
|
273
|
+
: undefined;
|
|
274
|
+
|
|
109
275
|
const getFree = (text: string, depth: number) =>
|
|
110
276
|
[...new Set(text.match(/[^\s()]+#\d+/g))]
|
|
111
277
|
.filter((variable) => getDepth(variable) < depth)
|
|
@@ -130,7 +296,7 @@ const invert = (mode: Mode): Mode => ({
|
|
|
130
296
|
: "Neither",
|
|
131
297
|
});
|
|
132
298
|
|
|
133
|
-
|
|
299
|
+
const encodeIdv = (encoder: Encoder, expression: Expr, env: Env | undefined, mode: Mode) =>
|
|
134
300
|
toIdv(encode(encoder, expression, env, clearPolarity(mode)));
|
|
135
301
|
|
|
136
302
|
export const encodeBool = (encoder: Encoder, expression: Expr, env: Env | undefined, mode: Mode) =>
|
|
@@ -144,7 +310,9 @@ const encodeDomains = (encoder: Encoder, bounds: Bound[], env: Env | undefined,
|
|
|
144
310
|
if (bound.domain.kind === "NoDomain") return [...domains, undefined];
|
|
145
311
|
return [...domains, bound.domain.expression];
|
|
146
312
|
}, [])
|
|
147
|
-
.map((domain) =>
|
|
313
|
+
.map((domain) =>
|
|
314
|
+
domain === undefined ? undefined : encode(encoder, domain, env, clearPolarity(mode)),
|
|
315
|
+
);
|
|
148
316
|
|
|
149
317
|
const getDomains = (
|
|
150
318
|
encoder: Encoder,
|
|
@@ -158,15 +326,64 @@ const getDomains = (
|
|
|
158
326
|
return domain;
|
|
159
327
|
});
|
|
160
328
|
|
|
161
|
-
const
|
|
162
|
-
const
|
|
329
|
+
const getSetResult = (encoder: Encoder, domains: Term[], getResult: (elements: Type[]) => Type) => {
|
|
330
|
+
const elements = domains.map(getElementType);
|
|
331
|
+
return encoder.encoding.isTyped && elements.every((element) => element !== undefined)
|
|
332
|
+
? getResult(elements.filter((element) => element !== undefined))
|
|
333
|
+
: undefined;
|
|
334
|
+
};
|
|
335
|
+
|
|
336
|
+
const bindVariables = (
|
|
337
|
+
names: string[],
|
|
338
|
+
env: Env | undefined,
|
|
339
|
+
mode: Mode,
|
|
340
|
+
types: (Type | undefined)[] = [],
|
|
341
|
+
) => {
|
|
342
|
+
const variables = names.map((name, index) =>
|
|
343
|
+
getVariable(name, mode.depth + index, getSort(types[index])),
|
|
344
|
+
);
|
|
163
345
|
const inner = variables.reduce<Env | undefined>(
|
|
164
|
-
(current, symbol) => push(current, { kind: "constant", symbol }),
|
|
346
|
+
(current, symbol, index) => push(current, { kind: "constant", symbol, type: types[index] }),
|
|
165
347
|
env,
|
|
166
348
|
);
|
|
167
349
|
return { variables, env: inner, mode: { ...mode, depth: mode.depth + names.length } };
|
|
168
350
|
};
|
|
169
351
|
|
|
352
|
+
// Type.Synthesize types a variable bounded by a set of type Set(t) as a t. A Ditto has the
|
|
353
|
+
// previous domain, though tlapm types it without a cast in its membership, or as Set(t) itself
|
|
354
|
+
// when t isn't atomic, so Z3 rejects either. A variable with no domain gets the type a hypothesis
|
|
355
|
+
// in the rest of the quantifier gives it.
|
|
356
|
+
const getBoundTypes = (
|
|
357
|
+
encoder: Encoder,
|
|
358
|
+
expression: Extract<Expr, { kind: "Quant" }>,
|
|
359
|
+
domains: (Term | undefined)[],
|
|
360
|
+
env: Env | undefined,
|
|
361
|
+
mode: Mode,
|
|
362
|
+
) =>
|
|
363
|
+
expression.bounds.reduce<{ types: (Type | undefined)[]; last: Type | undefined }>(
|
|
364
|
+
(state, bound, index) => {
|
|
365
|
+
const domain = domains[index];
|
|
366
|
+
const next = (type: Type | undefined) => ({ types: [...state.types, type], last: type });
|
|
367
|
+
if (bound.domain.kind === "Domain" && domain !== undefined)
|
|
368
|
+
return next(getElementType(domain));
|
|
369
|
+
if (bound.domain.kind === "Ditto" && state.last !== undefined) return next(state.last);
|
|
370
|
+
const rest = expression.bounds.slice(index + 1);
|
|
371
|
+
const scope = rest.length === 0 ? expression.body : { ...expression, bounds: rest };
|
|
372
|
+
const names = expression.bounds.slice(0, index).map((innerBound) => innerBound.name);
|
|
373
|
+
const outer = bindVariables(names, env, mode, state.types);
|
|
374
|
+
return next(
|
|
375
|
+
searchDeclarationType(
|
|
376
|
+
encoder,
|
|
377
|
+
scope,
|
|
378
|
+
expression.quantifier === "Forall",
|
|
379
|
+
outer.env,
|
|
380
|
+
outer.mode,
|
|
381
|
+
),
|
|
382
|
+
);
|
|
383
|
+
},
|
|
384
|
+
{ types: [], last: undefined },
|
|
385
|
+
).types;
|
|
386
|
+
|
|
170
387
|
const encodeQuantifier = (
|
|
171
388
|
encoder: Encoder,
|
|
172
389
|
expression: Extract<Expr, { kind: "Quant" }>,
|
|
@@ -174,27 +391,38 @@ const encodeQuantifier = (
|
|
|
174
391
|
mode: Mode,
|
|
175
392
|
) => {
|
|
176
393
|
const domains = encodeDomains(encoder, expression.bounds, env, mode);
|
|
394
|
+
const types = encoder.encoding.isTyped
|
|
395
|
+
? getBoundTypes(encoder, expression, domains, env, mode)
|
|
396
|
+
: [];
|
|
177
397
|
const bound = bindVariables(
|
|
178
398
|
expression.bounds.map((innerBound) => innerBound.name),
|
|
179
399
|
env,
|
|
180
400
|
mode,
|
|
401
|
+
types,
|
|
181
402
|
);
|
|
182
403
|
const body = encodeBool(encoder, expression.body, bound.env, bound.mode);
|
|
183
|
-
const guards = bound.variables.flatMap((variable, index) =>
|
|
184
|
-
|
|
185
|
-
|
|
404
|
+
const guards = bound.variables.flatMap((variable, index) => {
|
|
405
|
+
const domain = domains[index];
|
|
406
|
+
if (domain === undefined) return [];
|
|
407
|
+
return [`(${MEM} ${toIdv(getTyped(variable, types[index]))} ${toIdv(domain)})`];
|
|
408
|
+
});
|
|
186
409
|
return expression.quantifier === "Forall"
|
|
187
410
|
? `(forall (${getBinders(bound.variables)}) ${guards.length === 0 ? body : `(=> ${conjoin(guards)} ${body})`})`
|
|
188
411
|
: `(exists (${getBinders(bound.variables)}) ${conjoin([...guards, body])})`;
|
|
189
412
|
};
|
|
190
413
|
|
|
414
|
+
const getSorts = (count: number, free: string[]) => [
|
|
415
|
+
...Array.from({ length: count }, () => "Idv"),
|
|
416
|
+
...free.map((variable) => getVariableSort(variable) ?? "Idv"),
|
|
417
|
+
];
|
|
418
|
+
|
|
191
419
|
const encodeSetSt = (
|
|
192
420
|
encoder: Encoder,
|
|
193
421
|
expression: Extract<Expr, { kind: "SetSt" }>,
|
|
194
422
|
env: Env | undefined,
|
|
195
423
|
mode: Mode,
|
|
196
424
|
) => {
|
|
197
|
-
const domain =
|
|
425
|
+
const domain = encode(encoder, expression.domain, env, clearPolarity(mode));
|
|
198
426
|
const bound = bindVariables([expression.name], env, clearPolarity(mode));
|
|
199
427
|
const body = encodeBool(encoder, expression.body, bound.env, bound.mode);
|
|
200
428
|
const free = getFree(body, mode.depth);
|
|
@@ -203,11 +431,16 @@ const encodeSetSt = (
|
|
|
203
431
|
body,
|
|
204
432
|
mode,
|
|
205
433
|
(name) => getSetStAxioms(name, free, body, bound.variables[0]),
|
|
206
|
-
|
|
434
|
+
getSorts(1, free),
|
|
435
|
+
);
|
|
436
|
+
return wrapIdv(
|
|
437
|
+
call(symbol, [toIdv(domain), ...free]),
|
|
438
|
+
getSetResult(encoder, [domain], (elements) => getSetType(elements[0])),
|
|
207
439
|
);
|
|
208
|
-
return wrapIdv(call(symbol, [domain, ...free]));
|
|
209
440
|
};
|
|
210
441
|
|
|
442
|
+
// At type level 2 tlapm also gives a set of values the types Standardize rejects, so it encodes
|
|
443
|
+
// none.
|
|
211
444
|
const encodeSetOf = (
|
|
212
445
|
encoder: Encoder,
|
|
213
446
|
expression: Extract<Expr, { kind: "SetOf" }>,
|
|
@@ -220,50 +453,78 @@ const encodeSetOf = (
|
|
|
220
453
|
env,
|
|
221
454
|
clearPolarity(mode),
|
|
222
455
|
);
|
|
223
|
-
const element =
|
|
224
|
-
const
|
|
456
|
+
const element = encode(encoder, expression.element, bound.env, clearPolarity(bound.mode));
|
|
457
|
+
const text = toIdv(element);
|
|
458
|
+
const free = getFree(text, mode.depth);
|
|
225
459
|
const count = domains.length;
|
|
226
460
|
const symbol = encoder.flattener.flatten(
|
|
227
461
|
`SetOf_${count}`,
|
|
228
|
-
|
|
462
|
+
text,
|
|
229
463
|
mode,
|
|
230
|
-
(name) => getSetOfAxioms(name, free,
|
|
231
|
-
count
|
|
464
|
+
(name) => getSetOfAxioms(name, free, text, bound.variables),
|
|
465
|
+
getSorts(count, free),
|
|
466
|
+
);
|
|
467
|
+
return wrapIdv(
|
|
468
|
+
call(symbol, [...domains.map(toIdv), ...free]),
|
|
469
|
+
getSetResult(encoder, domains, () => getSetType(getType(element))),
|
|
232
470
|
);
|
|
233
|
-
return wrapIdv(call(symbol, [...domains, ...free]));
|
|
234
471
|
};
|
|
235
472
|
|
|
473
|
+
// tlapm binds the components of a function of several arguments in a LET. It builds every
|
|
474
|
+
// component from Ix 1, which inside the LET is the previous component, doesn't shift the body past
|
|
475
|
+
// the tuple, and indexes the tuple with untyped numbers that no axiom relates to the tuple's, so
|
|
476
|
+
// this binds each component to its typed index.
|
|
236
477
|
const encodeFunction = (
|
|
237
478
|
encoder: Encoder,
|
|
238
479
|
expression: Extract<Expr, { kind: "Fcn" }>,
|
|
239
480
|
env: Env | undefined,
|
|
240
481
|
mode: Mode,
|
|
241
482
|
) => {
|
|
242
|
-
const
|
|
483
|
+
const terms = getDomains(encoder, expression.bounds, env, mode, "a function");
|
|
484
|
+
const domains = terms.map(toIdv);
|
|
243
485
|
const domain =
|
|
244
486
|
domains.length === 1 ? domains[0] : call(tla(`Product_${domains.length}`), domains);
|
|
245
487
|
const variable = getVariable(domains.length === 1 ? expression.bounds[0].name : "x", mode.depth);
|
|
246
488
|
const inner = { ...clearPolarity(mode), depth: mode.depth + 1 };
|
|
247
|
-
const
|
|
248
|
-
domains.length === 1
|
|
249
|
-
|
|
250
|
-
|
|
251
|
-
|
|
252
|
-
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
489
|
+
const components = bindVariables(
|
|
490
|
+
domains.length === 1 ? [] : expression.bounds.map((bound) => bound.name),
|
|
491
|
+
env,
|
|
492
|
+
inner,
|
|
493
|
+
);
|
|
494
|
+
const term = encode(
|
|
495
|
+
encoder,
|
|
496
|
+
expression.body,
|
|
497
|
+
domains.length === 1 ? push(env, { kind: "constant", symbol: variable }) : components.env,
|
|
498
|
+
clearPolarity(components.mode),
|
|
499
|
+
);
|
|
500
|
+
const body = toIdv(term);
|
|
501
|
+
const definitions = components.variables.map(
|
|
502
|
+
(component, index) =>
|
|
503
|
+
`(${component} (${FUN_APP} ${variable} ${getNumeral(index + 1, encoder.encoding.isArithmetic)}))`,
|
|
504
|
+
);
|
|
505
|
+
// Smtlib prints the definitions of a LET last first, and N_axiomatize visits them in order.
|
|
506
|
+
const value =
|
|
507
|
+
domains.length === 1 ? body : `(let (${definitions.toReversed().join(" ")}) ${body})`;
|
|
508
|
+
const free = getFree(value, mode.depth);
|
|
257
509
|
const symbol = encoder.flattener.flatten(
|
|
258
510
|
"FunFcn",
|
|
259
|
-
body
|
|
511
|
+
domains.length === 1 ? body : `(let (${definitions.join(" ")}) ${body})`,
|
|
260
512
|
mode,
|
|
261
|
-
(name, axioms) => getFunctionAxioms(name, free,
|
|
262
|
-
|
|
513
|
+
(name, axioms) => getFunctionAxioms(name, free, value, variable, axioms),
|
|
514
|
+
getSorts(1, free),
|
|
515
|
+
);
|
|
516
|
+
return wrapIdv(
|
|
517
|
+
call(symbol, [domain, ...free]),
|
|
518
|
+
getSetResult(encoder, terms, (elements) => ({
|
|
519
|
+
kind: "Fun",
|
|
520
|
+
domain: elements.length === 1 ? elements[0] : { kind: "Product", items: elements },
|
|
521
|
+
range: getType(term),
|
|
522
|
+
})),
|
|
263
523
|
);
|
|
264
|
-
return wrapIdv(call(symbol, [domain, ...free]));
|
|
265
524
|
};
|
|
266
525
|
|
|
526
|
+
// At type level 2 tlapm sorts the variable of a CHOOSE over a set of type Set(Int) as an Int in
|
|
527
|
+
// its body but an Idv in ChooseDef, which Z3 rejects, so it stays an Idv.
|
|
267
528
|
const encodeChoose = (
|
|
268
529
|
encoder: Encoder,
|
|
269
530
|
expression: Extract<Expr, { kind: "Choose" }>,
|
|
@@ -282,24 +543,35 @@ const encodeChoose = (
|
|
|
282
543
|
body,
|
|
283
544
|
mode,
|
|
284
545
|
(name) => getChooseAxioms(name, free, body, variable),
|
|
285
|
-
free
|
|
546
|
+
getSorts(0, free),
|
|
286
547
|
);
|
|
287
548
|
return wrapIdv(call(symbol, free));
|
|
288
549
|
};
|
|
289
550
|
|
|
551
|
+
// Type.Synthesize compares values of the same type in their own sort only above type level 1,
|
|
552
|
+
// and Standardize triggers set extensionality on any equality of two sets of one type.
|
|
290
553
|
const encodeEquality = (
|
|
291
554
|
encoder: Encoder,
|
|
292
555
|
args: Expr[],
|
|
293
556
|
env: Env | undefined,
|
|
294
557
|
mode: Mode,
|
|
295
558
|
isNegated: boolean,
|
|
296
|
-
) =>
|
|
297
|
-
|
|
298
|
-
|
|
299
|
-
|
|
300
|
-
|
|
301
|
-
|
|
302
|
-
|
|
559
|
+
) => {
|
|
560
|
+
const left = encode(encoder, args[0], env, clearPolarity(mode));
|
|
561
|
+
const right = encode(encoder, args[1], env, clearPolarity(mode));
|
|
562
|
+
const type = getType(left);
|
|
563
|
+
const polarity = encoder.encoding.isSetExtensional ? mode.polarity : undefined;
|
|
564
|
+
if (!encoder.encoding.isTyped || !isSameType(type, getType(right)))
|
|
565
|
+
return getEquality(toIdv(left), toIdv(right), polarity, isNegated);
|
|
566
|
+
if (type.kind === "Int" || type.kind === "Bool") {
|
|
567
|
+
const operands = [left, right].map((term) => term.integer ?? term.text).join(" ");
|
|
568
|
+
return isNegated ? `(distinct ${operands})` : `(= ${operands})`;
|
|
569
|
+
}
|
|
570
|
+
if (type.kind !== "Set") return getEquality(left.text, right.text, polarity, isNegated);
|
|
571
|
+
const name = `TrigEq_${getTypeName(type)}`;
|
|
572
|
+
encoder.setTypes.set(name, type);
|
|
573
|
+
return getEquality(left.text, right.text, polarity, isNegated, tla(name));
|
|
574
|
+
};
|
|
303
575
|
|
|
304
576
|
const getSelectionTest = (encoder: Encoder, test: Expr, env: Env | undefined, mode: Mode) => {
|
|
305
577
|
const lambda = test.kind === "Lambda" && test.params.length === 1 ? test : undefined;
|
|
@@ -324,7 +596,8 @@ const encodeBuiltin = (
|
|
|
324
596
|
env: Env | undefined,
|
|
325
597
|
mode: Mode,
|
|
326
598
|
): Term => {
|
|
327
|
-
const
|
|
599
|
+
const getTerms = () => args.map((arg) => encode(encoder, arg, env, clearPolarity(mode)));
|
|
600
|
+
const encodeArgs = () => getTerms().map(toIdv);
|
|
328
601
|
switch (builtin) {
|
|
329
602
|
case "Conj":
|
|
330
603
|
return wrapBool(conjoin(args.map((arg) => encodeBool(encoder, arg, env, mode))));
|
|
@@ -351,15 +624,20 @@ const encodeBuiltin = (
|
|
|
351
624
|
case "Subseteq":
|
|
352
625
|
return wrapBool(call(SUBSET_EQ, encodeArgs()));
|
|
353
626
|
case "Lteq":
|
|
354
|
-
return wrapBool(call(INT_LTEQ, encodeArgs()));
|
|
355
627
|
case "Gteq":
|
|
356
|
-
return wrapBool(call(INT_LTEQ, encodeArgs().toReversed()));
|
|
357
628
|
case "Lt":
|
|
358
629
|
case "Gt": {
|
|
630
|
+
const terms = getTerms();
|
|
631
|
+
const integers = terms.flatMap((term) => (term.integer === undefined ? [] : [term.integer]));
|
|
632
|
+
if (encoder.encoding.isTyped && integers.length === 2)
|
|
633
|
+
return wrapBool(call(tla(`TInt${builtin}`), integers));
|
|
634
|
+
const order = (operands: string[]) =>
|
|
635
|
+
builtin === "Lteq" || builtin === "Lt" ? operands : operands.toReversed();
|
|
636
|
+
const operands = order(terms.map(toIdv));
|
|
637
|
+
if (builtin === "Lteq" || builtin === "Gteq") return wrapBool(call(INT_LTEQ, operands));
|
|
359
638
|
// Rewrite copies the operands before Flatten, which flattens each copy again.
|
|
360
|
-
const getOperands = () => (builtin === "Lt" ? encodeArgs() : encodeArgs().toReversed());
|
|
361
639
|
return wrapBool(
|
|
362
|
-
`(and ${call(INT_LTEQ,
|
|
640
|
+
`(and ${call(INT_LTEQ, operands)} (distinct ${order(encodeArgs()).join(" ")}))`,
|
|
363
641
|
);
|
|
364
642
|
}
|
|
365
643
|
case "SelectSeq": {
|
|
@@ -369,8 +647,9 @@ const encodeBuiltin = (
|
|
|
369
647
|
"SelectSeq",
|
|
370
648
|
test.body,
|
|
371
649
|
mode,
|
|
372
|
-
(name) =>
|
|
373
|
-
|
|
650
|
+
(name) =>
|
|
651
|
+
getSelectSeqAxioms(name, free, test.body, test.variable, encoder.encoding.isArithmetic),
|
|
652
|
+
getSorts(1, free),
|
|
374
653
|
);
|
|
375
654
|
return wrapIdv(call(symbol, [encodeIdv(encoder, args[0], env, mode), ...free]));
|
|
376
655
|
}
|
|
@@ -380,8 +659,18 @@ const encodeBuiltin = (
|
|
|
380
659
|
}
|
|
381
660
|
default: {
|
|
382
661
|
const symbol = BUILTIN_SYMBOLS[builtin];
|
|
383
|
-
if (symbol === undefined)
|
|
384
|
-
|
|
662
|
+
if (symbol === undefined)
|
|
663
|
+
throw new TlaProverError(
|
|
664
|
+
UNSUPPORTED_OPERANDS.has(builtin)
|
|
665
|
+
? `Type.Synthesize: Unsupported builtin ${builtin.startsWith("Box") ? "Box" : builtin}`
|
|
666
|
+
: "Type.Synthesize: Unexpected left operand",
|
|
667
|
+
);
|
|
668
|
+
const terms = getTerms();
|
|
669
|
+
if (!encoder.encoding.isTyped) return wrapIdv(call(symbol, terms.map(toIdv)));
|
|
670
|
+
const integers = terms.flatMap((term) => (term.integer === undefined ? [] : [term.integer]));
|
|
671
|
+
if (ARITHMETIC.has(builtin) && integers.length === terms.length)
|
|
672
|
+
return wrapInteger(call(tla(`TInt${builtin}`), integers));
|
|
673
|
+
return wrapIdv(call(symbol, terms.map(toIdv)), getBuiltinType(builtin, terms.map(getType)));
|
|
385
674
|
}
|
|
386
675
|
}
|
|
387
676
|
};
|
|
@@ -397,8 +686,10 @@ const encodeReference = (
|
|
|
397
686
|
case "constant":
|
|
398
687
|
case "variable":
|
|
399
688
|
if (args.length > 0) throw new TlaUnsupportedError(`an applied ${binding.kind}`);
|
|
400
|
-
return
|
|
689
|
+
return getTyped(binding.symbol, binding.type);
|
|
401
690
|
case "operator":
|
|
691
|
+
if (args.length === 0 && binding.arity > 0)
|
|
692
|
+
throw new TlaProverError("Type.Synthesize: Impossible operator conversion");
|
|
402
693
|
if (args.length !== binding.arity)
|
|
403
694
|
throw new TlaUnsupportedError("an operator applied to the wrong number of arguments");
|
|
404
695
|
return wrapIdv(
|
|
@@ -440,7 +731,7 @@ const encodeReference = (
|
|
|
440
731
|
higherOrder.join(" "),
|
|
441
732
|
mode,
|
|
442
733
|
() => [],
|
|
443
|
-
firstOrder.length
|
|
734
|
+
getSorts(firstOrder.length, free),
|
|
444
735
|
binding.name,
|
|
445
736
|
);
|
|
446
737
|
return wrapIdv(call(symbol, [...firstOrder, ...free]));
|
|
@@ -450,11 +741,11 @@ const encodeReference = (
|
|
|
450
741
|
}
|
|
451
742
|
};
|
|
452
743
|
|
|
453
|
-
const getPrimed = (env: Env | undefined, name: string):
|
|
744
|
+
const getPrimed = (env: Env | undefined, name: string): Term => {
|
|
454
745
|
if (!env) throw new TlaUnsupportedError(`a primed declaration that isn't a variable`);
|
|
455
746
|
const binding = env.binding;
|
|
456
747
|
return binding.kind === "variable" && binding.name === name
|
|
457
|
-
? binding.primed
|
|
748
|
+
? getTyped(binding.primed, binding.primedType)
|
|
458
749
|
: getPrimed(env.rest, name);
|
|
459
750
|
};
|
|
460
751
|
|
|
@@ -464,9 +755,12 @@ const encodeOpaque = (
|
|
|
464
755
|
args: Expr[],
|
|
465
756
|
env: Env | undefined,
|
|
466
757
|
mode: Mode,
|
|
467
|
-
) => {
|
|
758
|
+
): Term => {
|
|
759
|
+
// Rewrite.simplify_sets writes IsAFcn for the functions in a set of functions.
|
|
760
|
+
if (name === "IsAFcn" && args.length === 1)
|
|
761
|
+
return wrapBool(`(${FUN_ISAFCN} ${encodeIdv(encoder, args[0], env, mode)})`);
|
|
468
762
|
if (args.length === 0 && name.endsWith("#prime"))
|
|
469
|
-
return
|
|
763
|
+
return getPrimed(env, name.slice(0, -"#prime".length));
|
|
470
764
|
const anonymousName = args.length === 0 ? `Anon_OPAQUE_${name}` : `Anon_${name}`;
|
|
471
765
|
encoder.anonymous.set(anonymousName, args.length);
|
|
472
766
|
return wrapIdv(
|
|
@@ -522,10 +816,10 @@ const encodeCase = (
|
|
|
522
816
|
const other: Term = expression.other
|
|
523
817
|
? encode(encoder, expression.other, env, mode)
|
|
524
818
|
: wrapIdv(getCaseError(encoder));
|
|
525
|
-
const
|
|
526
|
-
const
|
|
527
|
-
|
|
528
|
-
if (
|
|
819
|
+
const type = getType(other);
|
|
820
|
+
const isUniform = bodies.every((body) => isSameType(getType(body), type));
|
|
821
|
+
const isBool = isUniform && type.kind === "Bool";
|
|
822
|
+
if (isUniform && type.kind === "Int") {
|
|
529
823
|
const integer = expression.arms.reduceRight(
|
|
530
824
|
(rest, arm, index) =>
|
|
531
825
|
`(ite ${encodeBool(encoder, arm.condition, env, clearPolarity(mode))} ${bodies[index].integer} ${rest})`,
|
|
@@ -539,7 +833,29 @@ const encodeCase = (
|
|
|
539
833
|
`(ite ${encodeBool(encoder, arm.condition, env, mode)} ${convert(bodies[index])} ${rest})`,
|
|
540
834
|
convert(other),
|
|
541
835
|
);
|
|
542
|
-
return { isBool, text };
|
|
836
|
+
return { isBool, text, type: isUniform ? other.type : undefined };
|
|
837
|
+
};
|
|
838
|
+
|
|
839
|
+
// Type.Synthesize types a NEW constant by its visible domain, or else by a hypothesis in the rest
|
|
840
|
+
// of the sequent. The guard is its membership in the domain the encoding asserts.
|
|
841
|
+
export const declareConstant = (
|
|
842
|
+
encoder: Encoder,
|
|
843
|
+
hyp: Extract<Hyp, { kind: "Fresh" }>,
|
|
844
|
+
guarded: Expr | undefined,
|
|
845
|
+
rest: Sequent,
|
|
846
|
+
env: Env | undefined,
|
|
847
|
+
mode: Mode,
|
|
848
|
+
) => {
|
|
849
|
+
const domain = guarded && encode(encoder, guarded, env, clearPolarity(mode));
|
|
850
|
+
const type =
|
|
851
|
+
domain !== undefined && hyp.domainVisibility === "Visible"
|
|
852
|
+
? getElementType(domain)
|
|
853
|
+
: searchDeclarationType(encoder, { kind: "Sequent", sequent: rest }, true, env, mode);
|
|
854
|
+
return {
|
|
855
|
+
type,
|
|
856
|
+
getGuard: (symbol: string) =>
|
|
857
|
+
domain && `(${MEM} ${toIdv(getTyped(symbol, type))} ${toIdv(domain)})`,
|
|
858
|
+
};
|
|
543
859
|
};
|
|
544
860
|
|
|
545
861
|
const encodeSequent = (
|
|
@@ -549,7 +865,7 @@ const encodeSequent = (
|
|
|
549
865
|
mode: Mode,
|
|
550
866
|
): string => {
|
|
551
867
|
const steps = sequent.context.reduce<NestedContext>(
|
|
552
|
-
(state, hyp) => {
|
|
868
|
+
(state, hyp, index) => {
|
|
553
869
|
switch (hyp.kind) {
|
|
554
870
|
case "Fresh": {
|
|
555
871
|
if (hyp.shape > 0) {
|
|
@@ -563,16 +879,18 @@ const encodeSequent = (
|
|
|
563
879
|
}
|
|
564
880
|
if (hyp.level !== "Constant")
|
|
565
881
|
throw new TlaUnsupportedError("a NEW declaration that isn't constant");
|
|
566
|
-
const
|
|
567
|
-
const
|
|
882
|
+
const rest = { context: sequent.context.slice(index + 1), active: sequent.active };
|
|
883
|
+
const declared = declareConstant(encoder, hyp, hyp.domain, rest, state.env, state.mode);
|
|
884
|
+
const bound = bindVariables([hyp.name], state.env, state.mode, [declared.type]);
|
|
568
885
|
const variable = bound.variables[0];
|
|
569
|
-
const guard =
|
|
886
|
+
const guard = declared.getGuard(variable);
|
|
570
887
|
return {
|
|
571
888
|
env: bound.env,
|
|
572
889
|
mode: bound.mode,
|
|
573
890
|
wrappers: [
|
|
574
891
|
...state.wrappers,
|
|
575
|
-
(body) =>
|
|
892
|
+
(body) =>
|
|
893
|
+
`(forall (${getBinders([variable])}) ${guard ? `(=> ${guard} ${body})` : body})`,
|
|
576
894
|
],
|
|
577
895
|
};
|
|
578
896
|
}
|
|
@@ -610,15 +928,20 @@ const encode = (encoder: Encoder, expression: Expr, env: Env | undefined, mode:
|
|
|
610
928
|
case "FALSE":
|
|
611
929
|
return wrapBool("false");
|
|
612
930
|
case "BOOLEAN":
|
|
613
|
-
return wrapIdv(BOOL_SET);
|
|
931
|
+
return wrapIdv(BOOL_SET, getTypedOnly(encoder, getSetType(BOOL)));
|
|
614
932
|
case "STRING":
|
|
615
|
-
return wrapIdv(STR_SET);
|
|
933
|
+
return wrapIdv(STR_SET, getTypedOnly(encoder, getSetType(STRING)));
|
|
616
934
|
case "Nat":
|
|
617
|
-
return wrapIdv(NAT_SET);
|
|
935
|
+
return wrapIdv(NAT_SET, getTypedOnly(encoder, getSetType(INT)));
|
|
618
936
|
case "Int":
|
|
619
|
-
return wrapIdv(INT_SET);
|
|
937
|
+
return wrapIdv(INT_SET, getTypedOnly(encoder, getSetType(INT)));
|
|
938
|
+
case "Real":
|
|
939
|
+
case "Infinity":
|
|
940
|
+
throw new TlaProverError(
|
|
941
|
+
`Encode.Standardize: Unexpected builtin '${expression.builtin}'`,
|
|
942
|
+
);
|
|
620
943
|
default:
|
|
621
|
-
throw new
|
|
944
|
+
throw new TlaProverError("Type.Synthesize: Unexpected builtin");
|
|
622
945
|
}
|
|
623
946
|
case "Apply": {
|
|
624
947
|
const operator = expression.operator;
|
|
@@ -651,9 +974,12 @@ const encode = (encoder: Encoder, expression: Expr, env: Env | undefined, mode:
|
|
|
651
974
|
const integer = `(ite ${resolveTriggers(condition, true)} ${consequent.integer} ${alternative.integer})`;
|
|
652
975
|
return { isBool: false, text: `(${CAST_INT} ${integer})`, integer };
|
|
653
976
|
}
|
|
654
|
-
|
|
655
|
-
|
|
656
|
-
|
|
977
|
+
if (consequent.isBool && alternative.isBool)
|
|
978
|
+
return wrapBool(`(ite ${condition} ${consequent.text} ${alternative.text})`);
|
|
979
|
+
return wrapIdv(
|
|
980
|
+
`(ite ${condition} ${toIdv(consequent)} ${toIdv(alternative)})`,
|
|
981
|
+
isSameType(getType(consequent), getType(alternative)) ? consequent.type : undefined,
|
|
982
|
+
);
|
|
657
983
|
}
|
|
658
984
|
case "List": {
|
|
659
985
|
const items = expression.items.map((item) => encodeBool(encoder, item, env, mode));
|
|
@@ -669,67 +995,103 @@ const encode = (encoder: Encoder, expression: Expr, env: Env | undefined, mode:
|
|
|
669
995
|
return encodeSetSt(encoder, expression, env, mode);
|
|
670
996
|
case "SetOf":
|
|
671
997
|
return encodeSetOf(encoder, expression, env, mode);
|
|
672
|
-
case "SetEnum":
|
|
998
|
+
case "SetEnum": {
|
|
999
|
+
const elements = expression.elements.map((element) =>
|
|
1000
|
+
encode(encoder, element, env, clearPolarity(mode)),
|
|
1001
|
+
);
|
|
1002
|
+
const types = elements.map(getType);
|
|
673
1003
|
return wrapIdv(
|
|
674
|
-
call(
|
|
675
|
-
|
|
676
|
-
|
|
1004
|
+
call(tla(`SetEnum_${elements.length}`), elements.map(toIdv)),
|
|
1005
|
+
getTypedOnly(
|
|
1006
|
+
encoder,
|
|
1007
|
+
types.every((type) => isSameType(type, types[0] ?? IDV))
|
|
1008
|
+
? getSetType(types[0] ?? IDV)
|
|
1009
|
+
: undefined,
|
|
677
1010
|
),
|
|
678
1011
|
);
|
|
679
|
-
|
|
1012
|
+
}
|
|
1013
|
+
case "Product": {
|
|
1014
|
+
const factors = expression.factors.map((factor) =>
|
|
1015
|
+
encode(encoder, factor, env, clearPolarity(mode)),
|
|
1016
|
+
);
|
|
680
1017
|
return wrapIdv(
|
|
681
|
-
call(
|
|
682
|
-
|
|
683
|
-
|
|
684
|
-
|
|
1018
|
+
call(tla(`Product_${factors.length}`), factors.map(toIdv)),
|
|
1019
|
+
getSetResult(encoder, factors, (items) => getSetType({ kind: "Product", items })),
|
|
1020
|
+
);
|
|
1021
|
+
}
|
|
1022
|
+
case "Tuple": {
|
|
1023
|
+
const elements = expression.elements.map((element) =>
|
|
1024
|
+
encode(encoder, element, env, clearPolarity(mode)),
|
|
685
1025
|
);
|
|
686
|
-
case "Tuple":
|
|
687
1026
|
return wrapIdv(
|
|
688
|
-
call(
|
|
689
|
-
|
|
690
|
-
expression.elements.map((element) => encodeIdv(encoder, element, env, mode)),
|
|
691
|
-
),
|
|
1027
|
+
call(tla(`Tuple_${elements.length}`), elements.map(toIdv)),
|
|
1028
|
+
getTypedOnly(encoder, { kind: "Product", items: elements.map(getType) }),
|
|
692
1029
|
);
|
|
1030
|
+
}
|
|
693
1031
|
case "Fcn":
|
|
694
1032
|
return encodeFunction(encoder, expression, env, mode);
|
|
695
1033
|
case "FcnApp": {
|
|
696
|
-
const encodedFunction =
|
|
1034
|
+
const encodedFunction = encode(encoder, expression.function, env, clearPolarity(mode));
|
|
697
1035
|
const args = expression.args.map((arg) => encodeIdv(encoder, arg, env, mode));
|
|
698
1036
|
const argument = args.length === 1 ? args[0] : call(tla(`Tuple_${args.length}`), args);
|
|
699
|
-
|
|
1037
|
+
const text = `(${FUN_APP} ${toIdv(encodedFunction)} ${argument})`;
|
|
1038
|
+
const component = getTypedOnly(
|
|
1039
|
+
encoder,
|
|
1040
|
+
getComponentType(getType(encodedFunction), expression.args),
|
|
1041
|
+
);
|
|
1042
|
+
return component === undefined ? wrapIdv(text) : project(text, component);
|
|
700
1043
|
}
|
|
701
|
-
case "Arrow":
|
|
1044
|
+
case "Arrow": {
|
|
1045
|
+
const sets = [expression.domain, expression.range].map((set) =>
|
|
1046
|
+
encode(encoder, set, env, clearPolarity(mode)),
|
|
1047
|
+
);
|
|
702
1048
|
return wrapIdv(
|
|
703
|
-
call(FUN_SET,
|
|
704
|
-
|
|
705
|
-
|
|
706
|
-
|
|
1049
|
+
call(FUN_SET, sets.map(toIdv)),
|
|
1050
|
+
getSetResult(encoder, sets, (elements) =>
|
|
1051
|
+
getSetType({ kind: "Fun", domain: elements[0], range: elements[1] }),
|
|
1052
|
+
),
|
|
707
1053
|
);
|
|
1054
|
+
}
|
|
708
1055
|
case "Record":
|
|
709
1056
|
case "Rect": {
|
|
710
1057
|
const names = expression.fields.map((field) => field.name);
|
|
711
1058
|
const suffix = names.join("_");
|
|
712
1059
|
encoder.recordFields.set(`Record_${suffix}`, names);
|
|
713
1060
|
encoder.recordFields.set(`RecordSet_${suffix}`, names);
|
|
1061
|
+
const values = expression.fields.map((field) =>
|
|
1062
|
+
encode(encoder, field.value, env, clearPolarity(mode)),
|
|
1063
|
+
);
|
|
1064
|
+
// Type.Synthesize types a set of records only at type level 3.
|
|
1065
|
+
const type: Type = {
|
|
1066
|
+
kind: "Record",
|
|
1067
|
+
fields: names.map((name, index) => ({ name, type: getType(values[index]) })),
|
|
1068
|
+
};
|
|
714
1069
|
return wrapIdv(
|
|
715
1070
|
call(
|
|
716
1071
|
tla(`${expression.kind === "Record" ? "Record" : "RecordSet"}_${suffix}`),
|
|
717
|
-
|
|
1072
|
+
values.map(toIdv),
|
|
718
1073
|
),
|
|
1074
|
+
expression.kind === "Record" ? getTypedOnly(encoder, type) : undefined,
|
|
719
1075
|
);
|
|
720
1076
|
}
|
|
721
1077
|
case "Except":
|
|
722
1078
|
return wrapIdv(encodeExcept(encoder, expression, env, mode));
|
|
723
|
-
case "Dot":
|
|
724
|
-
|
|
725
|
-
|
|
726
|
-
);
|
|
1079
|
+
case "Dot": {
|
|
1080
|
+
const record = encode(encoder, expression.expression, env, clearPolarity(mode));
|
|
1081
|
+
const text = `(${FUN_APP} ${toIdv(record)} ${tla(`StrLit_${expression.field}`)})`;
|
|
1082
|
+
const component = getTypedOnly(encoder, getFieldType(getType(record), expression.field));
|
|
1083
|
+
return component === undefined ? wrapIdv(text) : project(text, component);
|
|
1084
|
+
}
|
|
727
1085
|
case "Case":
|
|
728
1086
|
return encodeCase(encoder, expression, env, mode);
|
|
729
1087
|
case "String":
|
|
730
|
-
return wrapIdv(tla(`StrLit_${expression.value}`));
|
|
1088
|
+
return wrapIdv(tla(`StrLit_${expression.value}`), getTypedOnly(encoder, STRING));
|
|
731
1089
|
case "Num":
|
|
732
1090
|
if (expression.fraction !== "") throw new TlaUnsupportedError("a real number");
|
|
1091
|
+
// Deviation from tlapm: its int_of_string fails the obligation for a literal above 2^62 - 1.
|
|
1092
|
+
// Type.Synthesize gives a number no type when arithmetic is off.
|
|
1093
|
+
if (!encoder.encoding.isArithmetic)
|
|
1094
|
+
return wrapIdv(tla(`IntLit_${BigInt(expression.integer)}`));
|
|
733
1095
|
return {
|
|
734
1096
|
isBool: false,
|
|
735
1097
|
text: `(${CAST_INT} ${BigInt(expression.integer)})`,
|
|
@@ -741,7 +1103,10 @@ const encode = (encoder: Encoder, expression: Expr, env: Env | undefined, mode:
|
|
|
741
1103
|
case "Tquant":
|
|
742
1104
|
case "Tsub":
|
|
743
1105
|
case "Fair":
|
|
744
|
-
throw new
|
|
1106
|
+
throw new TlaProverError("Backend.Smtlib: Unsupported expression");
|
|
1107
|
+
case "Lambda":
|
|
1108
|
+
case "Bang":
|
|
1109
|
+
throw new TlaProverError(`Type.Synthesize: Unexpected ${expression.kind} constructor`);
|
|
745
1110
|
default:
|
|
746
1111
|
throw new TlaUnsupportedError(`the expression ${expression.kind}`);
|
|
747
1112
|
}
|
|
@@ -752,11 +1117,13 @@ export const getEntries = (encoder: Encoder, line: string): Entry[] => [
|
|
|
752
1117
|
removeUnprimable(resolveTriggers(line, false)),
|
|
753
1118
|
];
|
|
754
1119
|
|
|
755
|
-
export const createEncoder = (session: EncodingSession): Encoder => ({
|
|
1120
|
+
export const createEncoder = (session: EncodingSession, encoding: SmtEncoding): Encoder => ({
|
|
756
1121
|
session,
|
|
1122
|
+
encoding,
|
|
757
1123
|
flattener: createFlattener(),
|
|
758
1124
|
anonymous: new Map(),
|
|
759
1125
|
recordFields: new Map(),
|
|
1126
|
+
setTypes: new Map(),
|
|
760
1127
|
context: createContext(),
|
|
761
1128
|
declared: new Map(),
|
|
762
1129
|
});
|