tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0
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 +8 -0
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +121 -12
- package/dist/index.d.ts +121 -12
- 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 +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1155 -900
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +318 -656
- package/src/cli/typescript.ts +0 -3
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +260 -371
- package/src/errors.ts +93 -58
- package/src/evaluate.ts +848 -374
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +97 -43
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -325
- package/src/liveness.ts +224 -131
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +121 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +34 -57
- package/src/parallel.ts +62 -72
- package/src/parser.ts +1184 -531
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- 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 +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +34 -77
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +4 -47
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +26 -31
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -658
- 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 -16
- 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 +626 -56
- 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 +319 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -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 +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -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 +93 -0
- package/src/prover/smt/solver/der.ts +39 -30
- 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 +296 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- 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 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- 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 +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- 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 +179 -28
- 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 -9
- package/src/prover/smt/solver/hashtable.ts +30 -23
- 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 +113 -133
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- 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 -4
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +92 -136
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- 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 +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -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 +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- 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 +382 -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 +495 -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 +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -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 +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- 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 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- 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 +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -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 +21 -26
- 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 +261 -79
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +41 -51
- 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 -16
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +22 -32
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- 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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- 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 +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -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 +2107 -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 +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +129 -38
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +2141 -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 +1210 -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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- package/src/prover/smt/solver/theory-pb.ts +951 -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-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +74 -48
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +296 -105
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +10 -25
- package/src/typescript/collections.ts +34 -35
- package/src/typescript/compile.ts +1 -8
- package/src/typescript/context.ts +0 -12
- package/src/typescript/emit.ts +0 -1
- package/src/typescript/expressions.ts +0 -12
- package/src/typescript/formula.ts +9 -15
- package/src/typescript/functions.ts +6 -17
- package/src/typescript/model.ts +14 -16
- package/src/typescript/names.ts +0 -2
- package/src/typescript/program.ts +0 -3
- package/src/typescript/properties.ts +6 -8
- package/src/typescript/scope.ts +0 -5
- package/src/typescript/steps.ts +20 -28
- package/src/typescript/types.ts +3 -10
- package/src/values.ts +917 -522
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- 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
package/src/successors.ts
CHANGED
|
@@ -7,7 +7,12 @@ import {
|
|
|
7
7
|
} from "./ast";
|
|
8
8
|
import { getKindString } from "./builtins";
|
|
9
9
|
import { getReadVariables } from "./dependencies";
|
|
10
|
-
import {
|
|
10
|
+
import {
|
|
11
|
+
TlaEvaluationError,
|
|
12
|
+
TlaIllegalStateError,
|
|
13
|
+
TlaIncompleteSuccessorError,
|
|
14
|
+
TlaUncodedError,
|
|
15
|
+
} from "./errors";
|
|
11
16
|
import { EXIT_STATUS, setExitCode } from "./exit-codes";
|
|
12
17
|
import {
|
|
13
18
|
describeLocation,
|
|
@@ -16,10 +21,10 @@ import {
|
|
|
16
21
|
bindLazyArguments,
|
|
17
22
|
bindDefinitions,
|
|
18
23
|
bindOperatorArguments,
|
|
24
|
+
bindPattern,
|
|
19
25
|
bindValue,
|
|
20
26
|
compileArgumentScope,
|
|
21
27
|
evaluate,
|
|
22
|
-
expectBoolean,
|
|
23
28
|
forEachBinding,
|
|
24
29
|
getLazyFunction,
|
|
25
30
|
toKeepLazyContext,
|
|
@@ -27,7 +32,9 @@ import {
|
|
|
27
32
|
getContextElements,
|
|
28
33
|
getEntryEvaluator,
|
|
29
34
|
getReevaluatedDefinitions,
|
|
35
|
+
getStartupValue,
|
|
30
36
|
lookupScope,
|
|
37
|
+
mapBoundSets,
|
|
31
38
|
resolveApplyOperator,
|
|
32
39
|
resolveGlobalOperator,
|
|
33
40
|
toUnspecifiedSubscriptError,
|
|
@@ -37,14 +44,22 @@ import {
|
|
|
37
44
|
type Scope,
|
|
38
45
|
type State,
|
|
39
46
|
} from "./evaluate";
|
|
40
|
-
import {
|
|
41
|
-
import {
|
|
47
|
+
import { forEachChild } from "./instances";
|
|
48
|
+
import { CORE_OPERATORS } from "./standard-modules";
|
|
49
|
+
import { getRandomSubset, nextPrime, type JavaRandom } from "./tlc/random";
|
|
50
|
+
import {
|
|
51
|
+
getEnabledFailure,
|
|
52
|
+
isAssignedShortcut,
|
|
53
|
+
LITERAL_KINDS,
|
|
54
|
+
replayEnabled,
|
|
55
|
+
warnChangedUnchanged,
|
|
56
|
+
} from "./tlc/replay";
|
|
42
57
|
import {
|
|
43
58
|
formatValue,
|
|
44
59
|
getStreamedElements,
|
|
60
|
+
isEqualLikeTlc,
|
|
45
61
|
isFunctionValue,
|
|
46
62
|
isTlcEnumerable,
|
|
47
|
-
valuesEqual,
|
|
48
63
|
type Value,
|
|
49
64
|
} from "./values";
|
|
50
65
|
|
|
@@ -56,10 +71,12 @@ export interface Successor {
|
|
|
56
71
|
interface Run {
|
|
57
72
|
environment: Environment;
|
|
58
73
|
isInit: boolean;
|
|
59
|
-
// Whether the run computes ENABLED rather than the successors of the state.
|
|
60
74
|
isEnabled: boolean;
|
|
61
75
|
current: Value[] | undefined;
|
|
62
76
|
isStopped: boolean;
|
|
77
|
+
generator: JavaRandom | undefined;
|
|
78
|
+
successors: number;
|
|
79
|
+
onUnsatisfied?: (state: Value[], conjunct: Expression) => void;
|
|
63
80
|
}
|
|
64
81
|
|
|
65
82
|
type Continuation = (partial: State, action: string | undefined) => void;
|
|
@@ -76,7 +93,7 @@ type Runner = (
|
|
|
76
93
|
type Conjunct = { expression: Expression } & (
|
|
77
94
|
| { kind: "Guard" }
|
|
78
95
|
| { kind: "Assign"; index: number; value: Expression }
|
|
79
|
-
| { kind: "Unchanged";
|
|
96
|
+
| { kind: "Unchanged"; variables: UnchangedVariable[] }
|
|
80
97
|
| { kind: "Branch"; runner: Runner }
|
|
81
98
|
);
|
|
82
99
|
|
|
@@ -94,18 +111,14 @@ const assign = (partial: State, index: number, value: Value) => {
|
|
|
94
111
|
return copy;
|
|
95
112
|
};
|
|
96
113
|
|
|
97
|
-
// What TLC says it was computing when it fails.
|
|
98
114
|
const getComputation = (run: Run) =>
|
|
99
115
|
run.isInit ? "initial states" : run.isEnabled ? "ENABLED" : "next states";
|
|
100
116
|
|
|
101
|
-
// TLC fails with an unexpected exception when it fails to compute the next states or ENABLED.
|
|
102
117
|
const createRunError = (run: Run, message: string) => {
|
|
103
118
|
const error = new TlaEvaluationError(message);
|
|
104
119
|
return run.isInit ? error : setExitCode(error, EXIT_STATUS.error);
|
|
105
120
|
};
|
|
106
121
|
|
|
107
|
-
// TLC's message for a conjunct that isn't a boolean, which differs for a literal it walks to rather
|
|
108
|
-
// than evaluates.
|
|
109
122
|
const getNonBooleanMessage = (
|
|
110
123
|
run: Run,
|
|
111
124
|
value: Value,
|
|
@@ -121,7 +134,6 @@ const getNonBooleanMessage = (
|
|
|
121
134
|
return `In computing ${getComputation(run)}, TLC expected a boolean expression,\nbut instead found ${formatValue(value)}.\n${node}`;
|
|
122
135
|
};
|
|
123
136
|
|
|
124
|
-
// TLC words an IF whose condition isn't a boolean differently for each computation.
|
|
125
137
|
const getIfConditionMessage = (run: Run, value: Value, expression: Expression) => {
|
|
126
138
|
const kind = getKindString(value);
|
|
127
139
|
const range = describeRange(expression);
|
|
@@ -134,9 +146,19 @@ const getIfConditionMessage = (run: Run, value: Value, expression: Expression) =
|
|
|
134
146
|
const holds = (run: Run, expression: Expression, context: Context) =>
|
|
135
147
|
holdsValue(run, expression, evaluate(expression, context));
|
|
136
148
|
|
|
149
|
+
const CORE_OPERATOR_NAMES = new Set(CORE_OPERATORS.map((operator) => operator.name));
|
|
150
|
+
|
|
151
|
+
const isBuiltInOperation = (expression: Expression) =>
|
|
152
|
+
expression.kind === "Apply"
|
|
153
|
+
? CORE_OPERATOR_NAMES.has(expression.operator)
|
|
154
|
+
: expression.kind !== "Identifier" && !LITERAL_KINDS.has(expression.kind);
|
|
155
|
+
|
|
137
156
|
const holdsValue = (run: Run, expression: Expression, value: Value, isWalked = true) => {
|
|
138
157
|
if (typeof value === "boolean") return value;
|
|
139
|
-
|
|
158
|
+
const message = getNonBooleanMessage(run, value, expression, isWalked);
|
|
159
|
+
throw run.isInit && isWalked && isBuiltInOperation(expression)
|
|
160
|
+
? new TlaUncodedError(message)
|
|
161
|
+
: createRunError(run, message);
|
|
140
162
|
};
|
|
141
163
|
|
|
142
164
|
const evaluateCached = (
|
|
@@ -156,7 +178,12 @@ const getRunner = (expression: Expression, environment: Environment, isInit: boo
|
|
|
156
178
|
const runners = isInit ? initRunners : nextRunners;
|
|
157
179
|
const cached = runners.get(expression);
|
|
158
180
|
if (cached) return cached;
|
|
159
|
-
const
|
|
181
|
+
const deterministic = compileAction(expression, environment, isInit);
|
|
182
|
+
const random = isInit ? undefined : compileRandomAction(expression, environment);
|
|
183
|
+
const runner: Runner = random
|
|
184
|
+
? (run, scope, partial, action, isFixed, onComplete) =>
|
|
185
|
+
(run.generator ? random : deterministic)(run, scope, partial, action, isFixed, onComplete)
|
|
186
|
+
: deterministic;
|
|
160
187
|
runners.set(expression, runner);
|
|
161
188
|
return runner;
|
|
162
189
|
};
|
|
@@ -220,28 +247,34 @@ const isPossiblyAssignable = (target: Expression, isInit: boolean) =>
|
|
|
220
247
|
(target.kind === "Identifier" && (isInit || isLocallyResolved(target))) ||
|
|
221
248
|
(!isInit && target.kind === "Prime");
|
|
222
249
|
|
|
223
|
-
|
|
250
|
+
interface UnchangedVariable {
|
|
251
|
+
index: number;
|
|
252
|
+
expression: Expression;
|
|
253
|
+
}
|
|
254
|
+
|
|
255
|
+
const getUnchangedVariables = (
|
|
224
256
|
expression: Expression,
|
|
225
257
|
environment: Environment,
|
|
226
258
|
visited = new Set<string>(),
|
|
227
|
-
):
|
|
259
|
+
): UnchangedVariable[] | undefined => {
|
|
228
260
|
if (expression.kind === "Tuple") {
|
|
229
|
-
const
|
|
230
|
-
|
|
261
|
+
const variables = expression.elements.map((element) =>
|
|
262
|
+
getUnchangedVariables(element, environment, visited),
|
|
231
263
|
);
|
|
232
|
-
return
|
|
264
|
+
return variables.every((item) => item !== undefined) ? variables.flat() : undefined;
|
|
233
265
|
}
|
|
234
266
|
if (expression.kind !== "Identifier" || visited.has(expression.name)) return undefined;
|
|
235
267
|
const index = environment.variableIndex.get(expression.name);
|
|
236
|
-
if (index !== undefined) return [index];
|
|
268
|
+
if (index !== undefined) return [{ index, expression }];
|
|
237
269
|
const definition = getZeroArityBody(expression.name, environment);
|
|
238
270
|
if (!definition) return undefined;
|
|
239
271
|
visited.add(expression.name);
|
|
240
|
-
return
|
|
272
|
+
return getUnchangedVariables(definition.body, environment, visited);
|
|
241
273
|
};
|
|
242
274
|
|
|
243
275
|
const ACTION_KINDS = new Set([
|
|
244
276
|
"Label",
|
|
277
|
+
"Selection",
|
|
245
278
|
"And",
|
|
246
279
|
"Or",
|
|
247
280
|
"Exists",
|
|
@@ -277,9 +310,7 @@ const isGuard = (expression: Expression, environment: Environment, isInit: boole
|
|
|
277
310
|
|
|
278
311
|
const NO_NAMES: ReadonlySet<string> = new Set();
|
|
279
312
|
|
|
280
|
-
|
|
281
|
-
// operator, whose body may assign variables.
|
|
282
|
-
export const getReadLocals = (
|
|
313
|
+
const getReadLocals = (
|
|
283
314
|
expression: Expression,
|
|
284
315
|
bound: ReadonlySet<string>,
|
|
285
316
|
): string[] | undefined => {
|
|
@@ -288,21 +319,18 @@ export const getReadLocals = (
|
|
|
288
319
|
return bound.has(expression.name) ? [] : [expression.name];
|
|
289
320
|
}
|
|
290
321
|
const names: string[] = [];
|
|
291
|
-
|
|
292
|
-
|
|
293
|
-
const childLocals =
|
|
322
|
+
let isReadOnly = true;
|
|
323
|
+
forEachChild(expression, (child, childNames) => {
|
|
324
|
+
const childLocals = isReadOnly
|
|
294
325
|
? getReadLocals(child, childNames.length === 0 ? bound : new Set([...bound, ...childNames]))
|
|
295
326
|
: [];
|
|
296
327
|
if (childLocals) names.push(...childLocals);
|
|
297
|
-
else
|
|
298
|
-
return child;
|
|
328
|
+
else isReadOnly = false;
|
|
299
329
|
});
|
|
300
|
-
return
|
|
330
|
+
return isReadOnly ? names : undefined;
|
|
301
331
|
};
|
|
302
332
|
|
|
303
|
-
|
|
304
|
-
// checks like a guard when it has neither.
|
|
305
|
-
const hasBranches = (
|
|
333
|
+
export const hasBranches = (
|
|
306
334
|
expression: Expression,
|
|
307
335
|
environment: Environment,
|
|
308
336
|
visited: Set<Definition>,
|
|
@@ -337,15 +365,13 @@ const toConjunct = (
|
|
|
337
365
|
}
|
|
338
366
|
}
|
|
339
367
|
if (!isInit && expression.kind === "Unchanged") {
|
|
340
|
-
const
|
|
341
|
-
if (
|
|
368
|
+
const variables = getUnchangedVariables(expression.expression, environment);
|
|
369
|
+
if (variables) return { kind: "Unchanged", expression, variables };
|
|
342
370
|
}
|
|
343
371
|
if (isGuard(expression, environment, isInit)) return { kind: "Guard", expression };
|
|
344
372
|
return { kind: "Branch", expression, runner: getRunner(expression, environment, isInit) };
|
|
345
373
|
};
|
|
346
374
|
|
|
347
|
-
// The leading guards of `\E x \in S, y \in T : P /\ Q` that read no inner bound hold for every inner
|
|
348
|
-
// binding alike, so they can run once for each element of the outermost bound.
|
|
349
375
|
const getHoistedGuards = (expression: QuantifierExpression, environment: Environment) => {
|
|
350
376
|
if (expression.bounds.length < 2 || expression.body.kind !== "And") return undefined;
|
|
351
377
|
const names = expression.bounds.flatMap((bound) =>
|
|
@@ -388,9 +414,25 @@ const compileConjunction = (
|
|
|
388
414
|
if (index > 0 && isShortcut && isComplete(current)) {
|
|
389
415
|
context ??= getContext(run, scope, current);
|
|
390
416
|
for (let rest = index; rest < conjuncts.length; rest++) {
|
|
391
|
-
const
|
|
417
|
+
const conjunct = conjuncts[rest];
|
|
418
|
+
const state = run.current;
|
|
419
|
+
const changed =
|
|
420
|
+
state && conjunct.kind === "Unchanged"
|
|
421
|
+
? conjunct.variables.find((variable) => {
|
|
422
|
+
const assigned = current[variable.index];
|
|
423
|
+
return assigned !== undefined && !isEqualLikeTlc(assigned, state[variable.index]);
|
|
424
|
+
})
|
|
425
|
+
: undefined;
|
|
426
|
+
if (changed) {
|
|
427
|
+
warnChangedUnchanged(run.environment, changed.index, changed.expression);
|
|
428
|
+
return;
|
|
429
|
+
}
|
|
430
|
+
const expression = conjunct.expression;
|
|
392
431
|
const value = evaluateCached(restEvaluators, rest, expression, context);
|
|
393
|
-
if (!holdsValue(run, expression, value, false))
|
|
432
|
+
if (!holdsValue(run, expression, value, false)) {
|
|
433
|
+
run.onUnsatisfied?.(current, expression);
|
|
434
|
+
return;
|
|
435
|
+
}
|
|
394
436
|
}
|
|
395
437
|
onComplete(current, action);
|
|
396
438
|
return;
|
|
@@ -409,7 +451,7 @@ const compileConjunction = (
|
|
|
409
451
|
if (assigned === undefined) {
|
|
410
452
|
current = assign(current, conjunct.index, value);
|
|
411
453
|
context = undefined;
|
|
412
|
-
} else if (!
|
|
454
|
+
} else if (!isEqualLikeTlc(assigned, value)) {
|
|
413
455
|
return;
|
|
414
456
|
}
|
|
415
457
|
continue;
|
|
@@ -418,12 +460,13 @@ const compileConjunction = (
|
|
|
418
460
|
const state = run.current;
|
|
419
461
|
if (!state) return;
|
|
420
462
|
let unchanged: State | undefined;
|
|
421
|
-
for (const variable of conjunct.
|
|
422
|
-
const assigned = (unchanged ?? current)[variable];
|
|
463
|
+
for (const variable of conjunct.variables) {
|
|
464
|
+
const assigned = (unchanged ?? current)[variable.index];
|
|
423
465
|
if (assigned === undefined) {
|
|
424
466
|
unchanged ??= current.slice();
|
|
425
|
-
unchanged[variable] = state[variable];
|
|
426
|
-
} else if (!
|
|
467
|
+
unchanged[variable.index] = state[variable.index];
|
|
468
|
+
} else if (!isEqualLikeTlc(assigned, state[variable.index])) {
|
|
469
|
+
warnChangedUnchanged(run.environment, variable.index, variable.expression);
|
|
427
470
|
return;
|
|
428
471
|
}
|
|
429
472
|
}
|
|
@@ -445,11 +488,13 @@ const compileConjunction = (
|
|
|
445
488
|
runFrom(0, run, scope, partial, action, onComplete);
|
|
446
489
|
};
|
|
447
490
|
|
|
448
|
-
const compileGuard =
|
|
449
|
-
(expression
|
|
450
|
-
(run, scope, partial, action, _isFixed, onComplete) => {
|
|
491
|
+
const compileGuard = (expression: Expression): Runner => {
|
|
492
|
+
const enabledFailure = getEnabledFailure(expression);
|
|
493
|
+
return (run, scope, partial, action, _isFixed, onComplete) => {
|
|
494
|
+
if (run.isEnabled && enabledFailure !== undefined) throw createRunError(run, enabledFailure);
|
|
451
495
|
if (holds(run, expression, getContext(run, scope, partial))) onComplete(partial, action);
|
|
452
496
|
};
|
|
497
|
+
};
|
|
453
498
|
|
|
454
499
|
const compileMembership = (
|
|
455
500
|
expression: Expression & { kind: "Apply" },
|
|
@@ -473,6 +518,17 @@ const compileMembership = (
|
|
|
473
518
|
throw createRunError(run, `${message}\n${describeRange(expression)}`);
|
|
474
519
|
}
|
|
475
520
|
const elements = getStreamedElements(value);
|
|
521
|
+
if (run.generator) {
|
|
522
|
+
for (const element of getRandomSubset(
|
|
523
|
+
elements.length,
|
|
524
|
+
value,
|
|
525
|
+
run.environment.runtime.getRandom(),
|
|
526
|
+
run.environment.runtime.version,
|
|
527
|
+
)) {
|
|
528
|
+
onComplete(assign(partial, index, element), action);
|
|
529
|
+
if (run.successors > 0 || run.isStopped) return;
|
|
530
|
+
}
|
|
531
|
+
}
|
|
476
532
|
for (let position = 0; position < elements.length && !run.isStopped; position++) {
|
|
477
533
|
onComplete(assign(partial, index, elements[position]), action);
|
|
478
534
|
}
|
|
@@ -520,8 +576,6 @@ const compileDynamicAssignment = (
|
|
|
520
576
|
};
|
|
521
577
|
};
|
|
522
578
|
|
|
523
|
-
// Tool.getInitStates and Tool.getNextStates walk the body of a function they apply that is still
|
|
524
|
-
// lazy, which they evaluate as TLC computes the initial states eagerly, and otherwise apply it.
|
|
525
579
|
const compileFunctionAction = (
|
|
526
580
|
expression: Expression & { kind: "FunctionApplication" },
|
|
527
581
|
environment: Environment,
|
|
@@ -561,11 +615,10 @@ const compileFunctionAction = (
|
|
|
561
615
|
};
|
|
562
616
|
|
|
563
617
|
const compileUnchanged = (expression: Expression, environment: Environment): Runner => {
|
|
564
|
-
const indices = getUnchangedIndices(expression, environment);
|
|
565
|
-
if (indices) return compileConjunction([getUnchangedWrapper(expression)], environment, false);
|
|
566
|
-
if (expression.kind === "Tuple")
|
|
567
|
-
return getRunner(getUnchangedWrapper(expression), environment, false);
|
|
568
618
|
const unchanged = getUnchangedWrapper(expression);
|
|
619
|
+
if (getUnchangedVariables(expression, environment))
|
|
620
|
+
return compileConjunction([unchanged], environment, false);
|
|
621
|
+
if (expression.kind === "Tuple") return getRunner(unchanged, environment, false);
|
|
569
622
|
return (run, scope, partial, action, isFixed, onComplete) => {
|
|
570
623
|
const binding =
|
|
571
624
|
expression.kind === "Identifier" ? lookupScope(scope, expression.name) : undefined;
|
|
@@ -580,7 +633,22 @@ const compileUnchanged = (expression: Expression, environment: Environment): Run
|
|
|
580
633
|
);
|
|
581
634
|
return;
|
|
582
635
|
}
|
|
583
|
-
|
|
636
|
+
const context = getContext(run, scope, partial);
|
|
637
|
+
if (run.isEnabled && expression.kind === "Apply") {
|
|
638
|
+
const operator = resolveApplyOperator(expression, context);
|
|
639
|
+
if (operator?.kind === "Closure" && operator.params.length === expression.args.length) {
|
|
640
|
+
getRunner(getUnchangedWrapper(operator.body), environment, false)(
|
|
641
|
+
run,
|
|
642
|
+
bindOperatorArguments(operator, expression.args, context),
|
|
643
|
+
partial,
|
|
644
|
+
action,
|
|
645
|
+
isFixed,
|
|
646
|
+
onComplete,
|
|
647
|
+
);
|
|
648
|
+
return;
|
|
649
|
+
}
|
|
650
|
+
}
|
|
651
|
+
if (holds(run, unchanged, context)) onComplete(partial, action);
|
|
584
652
|
};
|
|
585
653
|
};
|
|
586
654
|
|
|
@@ -597,10 +665,10 @@ const compileCall = (
|
|
|
597
665
|
if (global?.kind === "Builtin") return guard;
|
|
598
666
|
if (global?.kind === "Closure") {
|
|
599
667
|
const bindArguments = compileArgumentScope(global, expression.args, environment);
|
|
600
|
-
|
|
668
|
+
let bodyRunner: Runner | undefined;
|
|
601
669
|
return (run, scope, partial, action, isFixed, onComplete) => {
|
|
602
|
-
|
|
603
|
-
|
|
670
|
+
bodyRunner ??= getRunner(global.body, environment, isInit);
|
|
671
|
+
bodyRunner(
|
|
604
672
|
run,
|
|
605
673
|
bindArguments(getContext(run, scope, partial)),
|
|
606
674
|
partial,
|
|
@@ -637,7 +705,7 @@ const compileIdentifier = (
|
|
|
637
705
|
const definition = isLocallyResolved(expression)
|
|
638
706
|
? undefined
|
|
639
707
|
: getZeroArityBody(expression.name, environment);
|
|
640
|
-
|
|
708
|
+
let bodyRunner: Runner | undefined;
|
|
641
709
|
return (run, scope, partial, action, isFixed, onComplete) => {
|
|
642
710
|
const binding = lookupScope(scope, expression.name);
|
|
643
711
|
if (binding?.kind === "Thunk" && !binding.isReleased) {
|
|
@@ -651,20 +719,20 @@ const compileIdentifier = (
|
|
|
651
719
|
);
|
|
652
720
|
return;
|
|
653
721
|
}
|
|
654
|
-
if (
|
|
722
|
+
if (
|
|
723
|
+
binding ||
|
|
724
|
+
!definition ||
|
|
725
|
+
(expression.location.range && getStartupValue(definition, environment) !== undefined)
|
|
726
|
+
) {
|
|
727
|
+
// Deviation from TLC: Tool#getInitStates prints an unassigned variable's declaration as the non-boolean value it found.
|
|
655
728
|
guard(run, scope, partial, action, isFixed, onComplete);
|
|
656
729
|
return;
|
|
657
730
|
}
|
|
658
|
-
|
|
659
|
-
|
|
731
|
+
bodyRunner ??= getRunner(definition.body, environment, isInit);
|
|
732
|
+
bodyRunner(run, undefined, partial, isFixed ? action : definition.name, isFixed, onComplete);
|
|
660
733
|
};
|
|
661
734
|
};
|
|
662
735
|
|
|
663
|
-
// A PlusCal action starts with a guard such as pc[self] = "L1", and a process is a disjunction of
|
|
664
|
-
// its actions. The labels an expression requires of one variable at one bound name let a
|
|
665
|
-
// disjunction skip the operands whose guard is false without evaluating them. A hand-written
|
|
666
|
-
// action often puts other guards first, such as running = self /\ pc[self] = "L1". TLC evaluates
|
|
667
|
-
// those before the label's guard, so a skipped operand still runs them, for their errors.
|
|
668
736
|
interface LabelGuard {
|
|
669
737
|
variable: number;
|
|
670
738
|
argument: string;
|
|
@@ -689,16 +757,12 @@ const toLabelGuard = (expression: Expression, environment: Environment) => {
|
|
|
689
757
|
const getConjuncts = (expression: Expression): Expression[] =>
|
|
690
758
|
expression.kind === "And" ? expression.operands.flatMap(getConjuncts) : [expression];
|
|
691
759
|
|
|
692
|
-
// What may come before the label's guard: a comparison or a name that a conjunction checks as a
|
|
693
|
-
// guard. An operand with another conjunct first, such as an assignment or a name defined as an
|
|
694
|
-
// action that may branch, runs in full.
|
|
695
760
|
const isLeadingGuard = (expression: Expression, environment: Environment) =>
|
|
696
761
|
(expression.kind === "Identifier" ||
|
|
697
762
|
(expression.kind === "Apply" &&
|
|
698
763
|
(expression.operator === "=" || expression.operator === "#"))) &&
|
|
699
764
|
isGuard(expression, environment, false);
|
|
700
765
|
|
|
701
|
-
// Checks the guards before a label's guard as a conjunction does, for TLC's errors.
|
|
702
766
|
const compileLeadingGuards = (guards: Expression[]) => {
|
|
703
767
|
const evaluators: (Evaluator | undefined)[] = [];
|
|
704
768
|
return (run: Run, scope: Scope | undefined, partial: State) => {
|
|
@@ -813,6 +877,66 @@ const compileDisjunction = (
|
|
|
813
877
|
};
|
|
814
878
|
};
|
|
815
879
|
|
|
880
|
+
const compileRandomChoice =
|
|
881
|
+
(choices: Runner[]): Runner =>
|
|
882
|
+
(run, scope, partial, action, isFixed, onComplete) => {
|
|
883
|
+
const generator = run.generator;
|
|
884
|
+
if (!generator) throw new Error("A random choice needs the run's generator");
|
|
885
|
+
const start = Math.floor(generator.nextDouble() * choices.length);
|
|
886
|
+
const prime = nextPrime(generator);
|
|
887
|
+
for (let attempt = 0; attempt < choices.length; attempt++) {
|
|
888
|
+
choices[(start + attempt * prime) % choices.length](
|
|
889
|
+
run,
|
|
890
|
+
scope,
|
|
891
|
+
partial,
|
|
892
|
+
action,
|
|
893
|
+
isFixed,
|
|
894
|
+
onComplete,
|
|
895
|
+
);
|
|
896
|
+
if (run.successors > 0 || run.isStopped) return;
|
|
897
|
+
}
|
|
898
|
+
};
|
|
899
|
+
|
|
900
|
+
const compileRandomExists = (
|
|
901
|
+
expression: QuantifierExpression,
|
|
902
|
+
environment: Environment,
|
|
903
|
+
): Runner => {
|
|
904
|
+
const body = getRunner(expression.body, environment, false);
|
|
905
|
+
return (run, scope, partial, action, isFixed, onComplete) => {
|
|
906
|
+
const context = getContext(run, scope, partial);
|
|
907
|
+
const version = environment.runtime.version;
|
|
908
|
+
const orders = mapBoundSets(expression.bounds, (set) => evaluate(set, context)).map(
|
|
909
|
+
(set, index) =>
|
|
910
|
+
getRandomSubset(
|
|
911
|
+
getContextElements(set, expression.bounds[index].set, version).length,
|
|
912
|
+
set,
|
|
913
|
+
environment.runtime.getRandom(),
|
|
914
|
+
version,
|
|
915
|
+
),
|
|
916
|
+
);
|
|
917
|
+
const visit = (position: number, boundScope: Scope | undefined): boolean => {
|
|
918
|
+
if (position < 0) {
|
|
919
|
+
body(run, boundScope, partial, action, isFixed, onComplete);
|
|
920
|
+
return run.successors > 0 || run.isStopped;
|
|
921
|
+
}
|
|
922
|
+
const pattern = expression.bounds[position].pattern;
|
|
923
|
+
return orders[position].some((element) =>
|
|
924
|
+
visit(position - 1, bindPattern(boundScope, pattern, element)),
|
|
925
|
+
);
|
|
926
|
+
};
|
|
927
|
+
visit(orders.length - 1, scope);
|
|
928
|
+
};
|
|
929
|
+
};
|
|
930
|
+
|
|
931
|
+
const compileRandomAction = (expression: Expression, environment: Environment) => {
|
|
932
|
+
if (expression.kind === "Exists") return compileRandomExists(expression, environment);
|
|
933
|
+
if (expression.kind !== "Or") return undefined;
|
|
934
|
+
const runners = expression.operands.map((operand) => getRunner(operand, environment, false));
|
|
935
|
+
return expression.isBulleted
|
|
936
|
+
? compileRandomChoice(runners)
|
|
937
|
+
: runners.reduce((left, right) => compileRandomChoice([left, right]));
|
|
938
|
+
};
|
|
939
|
+
|
|
816
940
|
const compileAction = (
|
|
817
941
|
expression: Expression,
|
|
818
942
|
environment: Environment,
|
|
@@ -852,12 +976,8 @@ const compileAction = (
|
|
|
852
976
|
const rest = compileConjunction(hoisted.rest, environment, isInit);
|
|
853
977
|
return (run, scope, partial, action, isFixed, onComplete) => {
|
|
854
978
|
const context = getContext(run, scope, partial);
|
|
855
|
-
const sets = expression.bounds
|
|
856
|
-
getContextElements(
|
|
857
|
-
evaluate(innerBound.set, context),
|
|
858
|
-
innerBound.set,
|
|
859
|
-
environment.runtime.version,
|
|
860
|
-
),
|
|
979
|
+
const sets = mapBoundSets(expression.bounds, (set) =>
|
|
980
|
+
getContextElements(evaluate(set, context), set, environment.runtime.version),
|
|
861
981
|
);
|
|
862
982
|
if (sets.some((elements) => elements.length === 0)) return;
|
|
863
983
|
const visit = (index: number, boundScope: Scope | undefined): void => {
|
|
@@ -955,7 +1075,6 @@ const compileAction = (
|
|
|
955
1075
|
const arm = arms.find((candidate) => {
|
|
956
1076
|
const value = evaluate(candidate.condition, context);
|
|
957
1077
|
if (typeof value === "boolean") return value;
|
|
958
|
-
// TLC leaves out the space before the kind under ENABLED.
|
|
959
1078
|
throw createRunError(
|
|
960
1079
|
run,
|
|
961
1080
|
`In computing ${getComputation(run)}, a non-boolean expression${run.isEnabled ? "" : " "}(${getKindString(value)}) was used as a guard condition of a CASE.\n${describeNode(candidate.source)}`,
|
|
@@ -974,10 +1093,16 @@ const compileAction = (
|
|
|
974
1093
|
case "Let": {
|
|
975
1094
|
const body = getChildRunner(expression.body);
|
|
976
1095
|
const reevaluated = getReevaluatedDefinitions(expression.definitions, environment);
|
|
1096
|
+
// TLC's Tool#enabled binds a LET's definitions to lazy values it caches, where Tool#getNextStates evaluates them at every use.
|
|
1097
|
+
const cached = { impure: new Set<Definition>(), streamed: reevaluated.streamed };
|
|
977
1098
|
return (run, scope, partial, action, isFixed, onComplete) =>
|
|
978
1099
|
body(
|
|
979
1100
|
run,
|
|
980
|
-
bindDefinitions(
|
|
1101
|
+
bindDefinitions(
|
|
1102
|
+
expression.definitions,
|
|
1103
|
+
getContext(run, scope, partial),
|
|
1104
|
+
run.isEnabled ? cached : reevaluated,
|
|
1105
|
+
),
|
|
981
1106
|
partial,
|
|
982
1107
|
action,
|
|
983
1108
|
isFixed,
|
|
@@ -995,7 +1120,11 @@ const compileAction = (
|
|
|
995
1120
|
return compileUnchanged(expression.expression, environment);
|
|
996
1121
|
case "AngleAction": {
|
|
997
1122
|
const body = getChildRunner(expression.action);
|
|
998
|
-
const unchanged =
|
|
1123
|
+
const unchanged: Expression = {
|
|
1124
|
+
kind: "Unchanged",
|
|
1125
|
+
expression: expression.subscript,
|
|
1126
|
+
location: expression.subscript.location,
|
|
1127
|
+
};
|
|
999
1128
|
const isUnchanged = (run: Run, scope: Scope | undefined, nextPartial: State) => {
|
|
1000
1129
|
try {
|
|
1001
1130
|
return holds(run, unchanged, getContext(run, scope, nextPartial));
|
|
@@ -1011,13 +1140,15 @@ const compileAction = (
|
|
|
1011
1140
|
});
|
|
1012
1141
|
}
|
|
1013
1142
|
case "BoxAction":
|
|
1014
|
-
return
|
|
1015
|
-
|
|
1016
|
-
|
|
1017
|
-
|
|
1018
|
-
|
|
1143
|
+
return compileDisjunction(
|
|
1144
|
+
[expression.action, getUnchangedWrapper(expression.subscript)],
|
|
1145
|
+
environment,
|
|
1146
|
+
isInit,
|
|
1147
|
+
);
|
|
1019
1148
|
case "Label":
|
|
1020
1149
|
return getChildRunner(expression.body);
|
|
1150
|
+
case "Selection":
|
|
1151
|
+
return getChildRunner(expression.expression);
|
|
1021
1152
|
case "Identifier":
|
|
1022
1153
|
return compileIdentifier(expression, environment, isInit);
|
|
1023
1154
|
case "FunctionApplication":
|
|
@@ -1038,11 +1169,19 @@ const compileAction = (
|
|
|
1038
1169
|
const right = getChildRunner(args[1]);
|
|
1039
1170
|
return (run, scope, partial, action, isFixed, onComplete) => {
|
|
1040
1171
|
const condition = evaluate(args[0], getContext(run, scope, partial));
|
|
1041
|
-
|
|
1042
|
-
|
|
1043
|
-
|
|
1044
|
-
|
|
1045
|
-
|
|
1172
|
+
if (typeof condition !== "boolean") {
|
|
1173
|
+
const kind = getKindString(condition);
|
|
1174
|
+
const range = describeRange(expression);
|
|
1175
|
+
throw createRunError(
|
|
1176
|
+
run,
|
|
1177
|
+
run.isInit
|
|
1178
|
+
? `In computing initial states of a predicate of form P => Q, P was ${kind}\n.${range}`
|
|
1179
|
+
: run.isEnabled
|
|
1180
|
+
? `While computing ENABLED of an expression of the form P => Q, P was ${kind}.\n${range}`
|
|
1181
|
+
: `In computing next states of a predicate of the form P => Q, P was\n${kind}.\n${range}`,
|
|
1182
|
+
);
|
|
1183
|
+
}
|
|
1184
|
+
if (!condition) {
|
|
1046
1185
|
onComplete(partial, action);
|
|
1047
1186
|
return;
|
|
1048
1187
|
}
|
|
@@ -1056,7 +1195,6 @@ const compileAction = (
|
|
|
1056
1195
|
}
|
|
1057
1196
|
};
|
|
1058
1197
|
|
|
1059
|
-
// A partial state that assigns no variable, which a run fills in as it assigns them.
|
|
1060
1198
|
const getEmptyState = (environment: Environment): State =>
|
|
1061
1199
|
environment.variables.map((): Value | undefined => undefined);
|
|
1062
1200
|
|
|
@@ -1075,16 +1213,18 @@ export const isEnabled = (expression: Expression, context: Context): boolean =>
|
|
|
1075
1213
|
);
|
|
1076
1214
|
}
|
|
1077
1215
|
const environment = context.environment;
|
|
1078
|
-
|
|
1079
|
-
|
|
1216
|
+
if (environment.callStack || (environment.coverage && environment.coverage.current !== -1)) {
|
|
1217
|
+
return replayEnabled(expression, context.scope, state, environment);
|
|
1218
|
+
}
|
|
1080
1219
|
const run: Run = {
|
|
1081
1220
|
environment,
|
|
1082
1221
|
isInit: false,
|
|
1083
1222
|
isEnabled: true,
|
|
1084
1223
|
current: state,
|
|
1085
1224
|
isStopped: false,
|
|
1225
|
+
generator: undefined,
|
|
1226
|
+
successors: 0,
|
|
1086
1227
|
};
|
|
1087
|
-
// TLC stops computing ENABLED at the first successor, so it skips the rest of the action.
|
|
1088
1228
|
getRunner(expression, environment, false)(
|
|
1089
1229
|
run,
|
|
1090
1230
|
context.scope,
|
|
@@ -1103,6 +1243,7 @@ export const forEachInitialState = (
|
|
|
1103
1243
|
environment: Environment,
|
|
1104
1244
|
onState: (state: Value[]) => boolean,
|
|
1105
1245
|
scope?: Scope,
|
|
1246
|
+
onIncomplete?: (state: State) => boolean,
|
|
1106
1247
|
) => {
|
|
1107
1248
|
const run: Run = {
|
|
1108
1249
|
environment,
|
|
@@ -1110,6 +1251,8 @@ export const forEachInitialState = (
|
|
|
1110
1251
|
isEnabled: false,
|
|
1111
1252
|
current: undefined,
|
|
1112
1253
|
isStopped: false,
|
|
1254
|
+
generator: undefined,
|
|
1255
|
+
successors: 0,
|
|
1113
1256
|
};
|
|
1114
1257
|
getRunner(expression, environment, true)(
|
|
1115
1258
|
run,
|
|
@@ -1120,8 +1263,10 @@ export const forEachInitialState = (
|
|
|
1120
1263
|
(partial) => {
|
|
1121
1264
|
if (run.isStopped) return;
|
|
1122
1265
|
if (!isComplete(partial)) {
|
|
1123
|
-
|
|
1124
|
-
|
|
1266
|
+
if (onIncomplete) {
|
|
1267
|
+
run.isStopped = onIncomplete([...partial]);
|
|
1268
|
+
return;
|
|
1269
|
+
}
|
|
1125
1270
|
throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
|
|
1126
1271
|
}
|
|
1127
1272
|
run.isStopped = onState(partial);
|
|
@@ -1147,12 +1292,29 @@ export const getInitialStates = (
|
|
|
1147
1292
|
return states;
|
|
1148
1293
|
};
|
|
1149
1294
|
|
|
1295
|
+
export const createIncompleteSuccessorError = (
|
|
1296
|
+
partial: State,
|
|
1297
|
+
action: string | undefined,
|
|
1298
|
+
environment: Environment,
|
|
1299
|
+
) => {
|
|
1300
|
+
const missing = environment.variables.filter((_name, index) => partial[index] === undefined);
|
|
1301
|
+
return new TlaIncompleteSuccessorError(
|
|
1302
|
+
`Successor state is not completely specified by action ${action ?? "Next"}. The following variables are not assigned: ${missing.join(", ")}`,
|
|
1303
|
+
partial,
|
|
1304
|
+
action,
|
|
1305
|
+
missing,
|
|
1306
|
+
);
|
|
1307
|
+
};
|
|
1308
|
+
|
|
1150
1309
|
export const forEachSuccessor = (
|
|
1151
1310
|
expression: Expression,
|
|
1152
1311
|
state: Value[],
|
|
1153
1312
|
environment: Environment,
|
|
1154
1313
|
onSuccessor: (successor: Successor) => boolean,
|
|
1155
1314
|
scope?: Scope,
|
|
1315
|
+
generator?: JavaRandom,
|
|
1316
|
+
onUnsatisfied?: Run["onUnsatisfied"],
|
|
1317
|
+
onIncomplete?: (state: State, action: string | undefined) => void,
|
|
1156
1318
|
) => {
|
|
1157
1319
|
const run: Run = {
|
|
1158
1320
|
environment,
|
|
@@ -1160,8 +1322,10 @@ export const forEachSuccessor = (
|
|
|
1160
1322
|
isEnabled: false,
|
|
1161
1323
|
current: state,
|
|
1162
1324
|
isStopped: false,
|
|
1325
|
+
generator,
|
|
1326
|
+
successors: 0,
|
|
1327
|
+
onUnsatisfied,
|
|
1163
1328
|
};
|
|
1164
|
-
const counter = { successors: 0 };
|
|
1165
1329
|
getRunner(expression, environment, false)(
|
|
1166
1330
|
run,
|
|
1167
1331
|
scope,
|
|
@@ -1171,19 +1335,46 @@ export const forEachSuccessor = (
|
|
|
1171
1335
|
(partial, action) => {
|
|
1172
1336
|
if (run.isStopped) return;
|
|
1173
1337
|
if (!isComplete(partial)) {
|
|
1174
|
-
|
|
1175
|
-
|
|
1176
|
-
|
|
1177
|
-
|
|
1178
|
-
|
|
1179
|
-
missing,
|
|
1180
|
-
);
|
|
1338
|
+
if (onIncomplete) {
|
|
1339
|
+
onIncomplete(partial, action);
|
|
1340
|
+
return;
|
|
1341
|
+
}
|
|
1342
|
+
throw createIncompleteSuccessorError(partial, action, environment);
|
|
1181
1343
|
}
|
|
1182
|
-
|
|
1344
|
+
run.successors++;
|
|
1183
1345
|
run.isStopped = onSuccessor({ state: partial, action });
|
|
1184
1346
|
},
|
|
1185
1347
|
);
|
|
1186
|
-
return
|
|
1348
|
+
return run.successors;
|
|
1349
|
+
};
|
|
1350
|
+
|
|
1351
|
+
export const hasIncompleteSuccessor = (
|
|
1352
|
+
expression: Expression,
|
|
1353
|
+
state: Value[],
|
|
1354
|
+
environment: Environment,
|
|
1355
|
+
scope?: Scope,
|
|
1356
|
+
) => {
|
|
1357
|
+
const run: Run = {
|
|
1358
|
+
environment,
|
|
1359
|
+
isInit: false,
|
|
1360
|
+
isEnabled: false,
|
|
1361
|
+
current: state,
|
|
1362
|
+
isStopped: false,
|
|
1363
|
+
generator: undefined,
|
|
1364
|
+
successors: 0,
|
|
1365
|
+
};
|
|
1366
|
+
// TLC's Tool#getState generates every successor of the action before it compares them.
|
|
1367
|
+
getRunner(expression, environment, false)(
|
|
1368
|
+
run,
|
|
1369
|
+
scope,
|
|
1370
|
+
getEmptyState(environment),
|
|
1371
|
+
undefined,
|
|
1372
|
+
false,
|
|
1373
|
+
(partial) => {
|
|
1374
|
+
if (!isComplete(partial)) run.successors++;
|
|
1375
|
+
},
|
|
1376
|
+
);
|
|
1377
|
+
return run.successors > 0;
|
|
1187
1378
|
};
|
|
1188
1379
|
|
|
1189
1380
|
export const getSuccessors = (
|