tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- 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 +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -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 +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- 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 +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- 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 +119 -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 +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- 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 +224 -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 +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- 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 +31 -74
- 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 +1 -44
- 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 +0 -2
- 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 +1026 -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 +615 -53
- 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/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -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 +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- 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 +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -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 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -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 +26 -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 +112 -132
- 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 +345 -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 +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- 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 +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- 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 +91 -135
- 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 +22 -72
- 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 +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- 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 +309 -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 +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 +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- 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 +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +1406 -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 +218 -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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -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 +308 -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 +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -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/qe-arith-plugin.ts +1098 -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 +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -23
- 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 +261 -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 +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- 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 +43 -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 +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- 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 +1986 -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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -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 +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- 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 +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- 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 +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -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 +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- 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/tlc/replay.ts
CHANGED
|
@@ -1,14 +1,24 @@
|
|
|
1
1
|
import type { Expression, SourceLocation } from "../ast";
|
|
2
2
|
import { TlaEvaluationError } from "../errors";
|
|
3
3
|
import { isConstantLevel } from "../dependencies";
|
|
4
|
+
import {
|
|
5
|
+
countCoverage,
|
|
6
|
+
costCoverage,
|
|
7
|
+
getCoverageNode,
|
|
8
|
+
runAtCoverageNode,
|
|
9
|
+
type Coverage,
|
|
10
|
+
} from "../coverage";
|
|
4
11
|
import {
|
|
5
12
|
bindDefinitions,
|
|
6
13
|
bindLazyArguments,
|
|
7
14
|
bindOperatorArguments,
|
|
15
|
+
describeRange,
|
|
8
16
|
evaluate,
|
|
9
|
-
|
|
17
|
+
forEachBoundElement,
|
|
10
18
|
freezeCallStack,
|
|
11
19
|
getLazyFunction,
|
|
20
|
+
getQuantifierElements,
|
|
21
|
+
mapBoundSets,
|
|
12
22
|
toKeepLazyContext,
|
|
13
23
|
lookupScope,
|
|
14
24
|
resolveApplyOperator,
|
|
@@ -20,41 +30,46 @@ import {
|
|
|
20
30
|
type State,
|
|
21
31
|
toUnspecifiedSubscriptError,
|
|
22
32
|
} from "../evaluate";
|
|
23
|
-
import {
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
33
|
+
import {
|
|
34
|
+
getStreamedElements,
|
|
35
|
+
isEqualLikeTlc,
|
|
36
|
+
isTlcEnumerable,
|
|
37
|
+
setTrace,
|
|
38
|
+
type Value,
|
|
39
|
+
} from "../values";
|
|
40
|
+
import { substitutionFrames } from "../instances";
|
|
41
|
+
import { MESSAGE_CODE } from "./messages";
|
|
30
42
|
|
|
31
43
|
interface ReplayAction {
|
|
32
44
|
expression: Expression;
|
|
33
45
|
scope: Scope | undefined;
|
|
34
46
|
}
|
|
35
47
|
|
|
36
|
-
// TLC's ActionItemList: the conjuncts left to process, the first at the head.
|
|
37
48
|
interface ActionItem {
|
|
38
49
|
kind: "Predicate" | "Unchanged" | "Changed";
|
|
39
50
|
expression: Expression;
|
|
40
51
|
scope: Scope | undefined;
|
|
52
|
+
node: number;
|
|
41
53
|
rest: ActionItem | undefined;
|
|
42
54
|
}
|
|
43
55
|
|
|
44
56
|
interface Replay {
|
|
45
57
|
environment: Environment;
|
|
46
|
-
callStack: CallStack;
|
|
58
|
+
callStack: CallStack | undefined;
|
|
59
|
+
coverage: Coverage | undefined;
|
|
47
60
|
isInit: boolean;
|
|
48
|
-
// Whether the replay computes ENABLED rather than the successors of the state.
|
|
49
61
|
isEnabled: boolean;
|
|
50
|
-
// The state whose successors the replay computes.
|
|
51
62
|
current: Value[] | undefined;
|
|
52
63
|
onState: (state: Value[]) => void;
|
|
64
|
+
onIncomplete: ((state: State) => void) | undefined;
|
|
53
65
|
}
|
|
54
66
|
|
|
55
67
|
const withFrame = <Result>(replay: Replay, expression: Expression, run: () => Result): Result => {
|
|
56
68
|
const callStack = replay.callStack;
|
|
57
|
-
callStack
|
|
69
|
+
if (!callStack) return run();
|
|
70
|
+
const isEntered = callStack.expressions.at(-1) === expression;
|
|
71
|
+
const frames = (!isEntered && substitutionFrames.get(expression)) || [];
|
|
72
|
+
callStack.expressions.push(...frames, expression);
|
|
58
73
|
const outerSets = setTrace.sets;
|
|
59
74
|
const sets = outerSets ?? [];
|
|
60
75
|
const depth = sets.length;
|
|
@@ -62,16 +77,38 @@ const withFrame = <Result>(replay: Replay, expression: Expression, run: () => Re
|
|
|
62
77
|
try {
|
|
63
78
|
return run();
|
|
64
79
|
} catch (error) {
|
|
65
|
-
// A quantifier enumerates its bounds outside any evaluation.
|
|
66
80
|
freezeCallStack(callStack, sets.slice(depth), error);
|
|
67
81
|
throw error;
|
|
68
82
|
} finally {
|
|
69
|
-
if (!callStack.isFrozen) callStack.expressions.
|
|
83
|
+
if (!callStack.isFrozen) callStack.expressions.length -= frames.length + 1;
|
|
70
84
|
sets.length = depth;
|
|
71
85
|
setTrace.sets = outerSets;
|
|
72
86
|
}
|
|
73
87
|
};
|
|
74
88
|
|
|
89
|
+
const getNode = (replay: Replay, node: number, expression: Expression) =>
|
|
90
|
+
replay.coverage ? getCoverageNode(replay.coverage, node, expression) : -1;
|
|
91
|
+
|
|
92
|
+
const runAt = <Result>(replay: Replay, node: number, run: () => Result) =>
|
|
93
|
+
replay.coverage ? runAtCoverageNode(replay.coverage, node, run) : run();
|
|
94
|
+
|
|
95
|
+
const evaluateAt = (replay: Replay, node: number, expression: Expression, context: Context) =>
|
|
96
|
+
runAt(replay, node, () => evaluate(expression, context));
|
|
97
|
+
|
|
98
|
+
const evaluateOperatorAt = (
|
|
99
|
+
replay: Replay,
|
|
100
|
+
node: number,
|
|
101
|
+
expression: Expression,
|
|
102
|
+
context: Context,
|
|
103
|
+
) => {
|
|
104
|
+
const value = evaluateAt(replay, node, expression, context);
|
|
105
|
+
const coverage = replay.coverage;
|
|
106
|
+
if (coverage?.covered.has(expression)) {
|
|
107
|
+
for (let item = node; item !== -1; item = coverage.prefixes[item]) coverage.primary[item]--;
|
|
108
|
+
}
|
|
109
|
+
return value;
|
|
110
|
+
};
|
|
111
|
+
|
|
75
112
|
const getContext = (replay: Replay, scope: Scope | undefined, partial: State): Context =>
|
|
76
113
|
replay.isInit
|
|
77
114
|
? { environment: replay.environment, scope, state: partial, next: undefined }
|
|
@@ -87,8 +124,6 @@ const assign = (partial: State, index: number, value: Value) => {
|
|
|
87
124
|
return copy;
|
|
88
125
|
};
|
|
89
126
|
|
|
90
|
-
// SANY parses an infix chain such as A /\ B /\ C as (A /\ B) /\ C, where tla-ts keeps one
|
|
91
|
-
// junction, so the replay recreates the node of each prefix.
|
|
92
127
|
const getPrefix = (expression: Expression & { kind: "And" | "Or" }, count: number): Expression => {
|
|
93
128
|
const first = expression.operands[0].location;
|
|
94
129
|
const range = expression.location.range;
|
|
@@ -98,48 +133,48 @@ const getPrefix = (expression: Expression & { kind: "And" | "Or" }, count: numbe
|
|
|
98
133
|
return { ...expression, operands: expression.operands.slice(0, count), location };
|
|
99
134
|
};
|
|
100
135
|
|
|
136
|
+
const getPrefixNode = (replay: Replay, node: number) =>
|
|
137
|
+
replay.coverage ? replay.coverage.prefixes[node] : -1;
|
|
138
|
+
|
|
101
139
|
const getIdentifierName = (expression: Expression) =>
|
|
102
140
|
expression.kind === "Identifier" ? expression.name : undefined;
|
|
103
141
|
|
|
104
|
-
// The state variable an expression names, as TLC's getVar finds it through definitions and
|
|
105
|
-
// operator arguments.
|
|
106
142
|
const getVariable = (
|
|
107
|
-
|
|
143
|
+
environment: Environment,
|
|
108
144
|
expression: Expression,
|
|
109
145
|
scope: Scope | undefined,
|
|
110
146
|
): number | undefined => {
|
|
111
|
-
if (expression.kind === "Label") return getVariable(
|
|
147
|
+
if (expression.kind === "Label") return getVariable(environment, expression.body, scope);
|
|
112
148
|
const name = getIdentifierName(expression);
|
|
113
149
|
if (name === undefined) return undefined;
|
|
114
150
|
const binding = lookupScope(scope, name);
|
|
115
|
-
if (binding?.kind === "Thunk") return getVariable(
|
|
151
|
+
if (binding?.kind === "Thunk") return getVariable(environment, binding.expression, binding.scope);
|
|
116
152
|
if (binding) return undefined;
|
|
117
|
-
const index =
|
|
153
|
+
const index = environment.variableIndex.get(name);
|
|
118
154
|
if (index !== undefined) return index;
|
|
119
|
-
const operator = resolveGlobalOperator(name,
|
|
155
|
+
const operator = resolveGlobalOperator(name, environment);
|
|
120
156
|
return operator?.kind === "Closure" && operator.params.length === 0
|
|
121
|
-
? getVariable(
|
|
157
|
+
? getVariable(environment, operator.body, operator.scope)
|
|
122
158
|
: undefined;
|
|
123
159
|
};
|
|
124
160
|
|
|
125
|
-
// The variable a primed expression such as x' assigns, as TLC's getPrimedVar finds it.
|
|
126
161
|
const getPrimedVariable = (
|
|
127
|
-
|
|
162
|
+
environment: Environment,
|
|
128
163
|
expression: Expression,
|
|
129
164
|
scope: Scope | undefined,
|
|
130
165
|
): number | undefined => {
|
|
131
|
-
if (expression.kind === "Prime") return getVariable(
|
|
132
|
-
if (expression.kind === "Label") return getPrimedVariable(
|
|
166
|
+
if (expression.kind === "Prime") return getVariable(environment, expression.expression, scope);
|
|
167
|
+
if (expression.kind === "Label") return getPrimedVariable(environment, expression.body, scope);
|
|
133
168
|
const name = getIdentifierName(expression);
|
|
134
169
|
if (name === undefined) return undefined;
|
|
135
170
|
const binding = lookupScope(scope, name);
|
|
136
171
|
if (binding?.kind === "Thunk") {
|
|
137
|
-
return getPrimedVariable(
|
|
172
|
+
return getPrimedVariable(environment, binding.expression, binding.scope);
|
|
138
173
|
}
|
|
139
174
|
if (binding) return undefined;
|
|
140
|
-
const operator = resolveGlobalOperator(name,
|
|
175
|
+
const operator = resolveGlobalOperator(name, environment);
|
|
141
176
|
return operator?.kind === "Closure" && operator.params.length === 0
|
|
142
|
-
? getPrimedVariable(
|
|
177
|
+
? getPrimedVariable(environment, operator.body, operator.scope)
|
|
143
178
|
: undefined;
|
|
144
179
|
};
|
|
145
180
|
|
|
@@ -149,37 +184,56 @@ const isTrue = (value: Value) => {
|
|
|
149
184
|
return value;
|
|
150
185
|
};
|
|
151
186
|
|
|
152
|
-
// Once every variable has a value, TLC's getInitStates and getNextStatesAllAssigned evaluate the
|
|
153
|
-
// conjuncts left instead of walking them, so a disjunction among them takes one step. Its enabled
|
|
154
|
-
// doesn't, and Tool#getNextStates0 takes this shortcut only with warnings on.
|
|
155
187
|
export const isAssignedShortcut = (replay: Pick<Replay, "environment" | "isInit" | "isEnabled">) =>
|
|
156
188
|
!replay.isEnabled && (replay.isInit || replay.environment.runtime.isWarningEnabled);
|
|
157
189
|
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
190
|
+
const proceed = (
|
|
191
|
+
replay: Replay,
|
|
192
|
+
items: ActionItem | undefined,
|
|
193
|
+
partial: State,
|
|
194
|
+
node: number,
|
|
195
|
+
): boolean => {
|
|
196
|
+
const isProduced = proceedItems(replay, items, partial, node);
|
|
197
|
+
if (isProduced && replay.coverage && !replay.isInit) countCoverage(replay.coverage, node);
|
|
198
|
+
return isProduced;
|
|
199
|
+
};
|
|
200
|
+
|
|
201
|
+
const addState = (replay: Replay, state: Value[], node: number) => {
|
|
202
|
+
const coverage = replay.coverage;
|
|
203
|
+
if (coverage && replay.isInit) {
|
|
204
|
+
countCoverage(coverage, node);
|
|
205
|
+
countCoverage(coverage, coverage.roots[node]);
|
|
206
|
+
}
|
|
207
|
+
replay.onState(state);
|
|
208
|
+
return true;
|
|
209
|
+
};
|
|
210
|
+
|
|
211
|
+
const proceedItems = (
|
|
212
|
+
replay: Replay,
|
|
213
|
+
items: ActionItem | undefined,
|
|
214
|
+
partial: State,
|
|
215
|
+
node: number,
|
|
216
|
+
): boolean => {
|
|
161
217
|
if (items === undefined) {
|
|
162
|
-
if (isComplete(partial)) replay
|
|
163
|
-
|
|
218
|
+
if (isComplete(partial)) return addState(replay, partial, node);
|
|
219
|
+
replay.onIncomplete?.(partial);
|
|
220
|
+
return false;
|
|
164
221
|
}
|
|
165
222
|
if (isComplete(partial) && isAssignedShortcut(replay)) {
|
|
166
|
-
proceedAssigned(replay, items, partial);
|
|
167
|
-
return;
|
|
223
|
+
return proceedAssigned(replay, items, partial, node);
|
|
168
224
|
}
|
|
169
225
|
if (items.kind === "Predicate") {
|
|
170
|
-
visit(replay, items.expression, items.rest, items.scope, partial);
|
|
171
|
-
return;
|
|
226
|
+
return visit(replay, items.expression, items.rest, items.scope, partial, items.node);
|
|
172
227
|
}
|
|
173
228
|
if (items.kind === "Unchanged") {
|
|
174
|
-
visitUnchanged(replay, items.expression, items.rest, items.scope, partial);
|
|
175
|
-
return;
|
|
229
|
+
return visitUnchanged(replay, items.expression, items.rest, items.scope, partial, items.node);
|
|
176
230
|
}
|
|
177
|
-
|
|
231
|
+
return isChanged(replay, items, partial) && proceed(replay, items.rest, partial, items.node);
|
|
178
232
|
};
|
|
179
233
|
|
|
180
234
|
const isChanged = (replay: Replay, item: ActionItem, partial: State) => {
|
|
181
235
|
const environment = replay.environment;
|
|
182
|
-
const before =
|
|
236
|
+
const before = evaluateAt(replay, item.node, item.expression, {
|
|
183
237
|
environment,
|
|
184
238
|
scope: item.scope,
|
|
185
239
|
state: replay.current,
|
|
@@ -187,7 +241,7 @@ const isChanged = (replay: Replay, item: ActionItem, partial: State) => {
|
|
|
187
241
|
});
|
|
188
242
|
const after = (() => {
|
|
189
243
|
try {
|
|
190
|
-
return
|
|
244
|
+
return evaluateAt(replay, item.node, item.expression, {
|
|
191
245
|
environment,
|
|
192
246
|
scope: item.scope,
|
|
193
247
|
state: partial,
|
|
@@ -199,24 +253,37 @@ const isChanged = (replay: Replay, item: ActionItem, partial: State) => {
|
|
|
199
253
|
: error;
|
|
200
254
|
}
|
|
201
255
|
})();
|
|
202
|
-
|
|
256
|
+
try {
|
|
257
|
+
return !isEqualLikeTlc(before, after);
|
|
258
|
+
} catch (error) {
|
|
259
|
+
if (replay.callStack) freezeCallStack(replay.callStack, [before], error);
|
|
260
|
+
throw error;
|
|
261
|
+
}
|
|
203
262
|
};
|
|
204
263
|
|
|
205
|
-
const proceedAssigned = (
|
|
264
|
+
const proceedAssigned = (
|
|
265
|
+
replay: Replay,
|
|
266
|
+
items: ActionItem | undefined,
|
|
267
|
+
partial: Value[],
|
|
268
|
+
node: number,
|
|
269
|
+
): boolean => {
|
|
206
270
|
for (let item = items; item !== undefined; item = item.rest) {
|
|
207
271
|
if (item.kind === "Unchanged") {
|
|
208
|
-
visitUnchanged(replay, item.expression, item.rest, item.scope, partial);
|
|
209
|
-
return;
|
|
272
|
+
return visitUnchanged(replay, item.expression, item.rest, item.scope, partial, item.node);
|
|
210
273
|
}
|
|
211
|
-
|
|
274
|
+
const isHeld =
|
|
212
275
|
item.kind === "Changed"
|
|
213
|
-
?
|
|
214
|
-
:
|
|
215
|
-
|
|
216
|
-
|
|
276
|
+
? isChanged(replay, item, partial)
|
|
277
|
+
: isTrue(
|
|
278
|
+
evaluateAt(replay, item.node, item.expression, getContext(replay, item.scope, partial)),
|
|
279
|
+
);
|
|
280
|
+
if (!isHeld) {
|
|
281
|
+
const coverage = replay.coverage;
|
|
282
|
+
if (coverage && replay.isInit) coverage.secondary[coverage.roots[node]]++;
|
|
283
|
+
return false;
|
|
217
284
|
}
|
|
218
285
|
}
|
|
219
|
-
replay
|
|
286
|
+
return addState(replay, partial, node);
|
|
220
287
|
};
|
|
221
288
|
|
|
222
289
|
const visit = (
|
|
@@ -225,39 +292,71 @@ const visit = (
|
|
|
225
292
|
items: ActionItem | undefined,
|
|
226
293
|
scope: Scope | undefined,
|
|
227
294
|
partial: State,
|
|
228
|
-
|
|
295
|
+
parent: number,
|
|
296
|
+
): boolean =>
|
|
297
|
+
visitAt(replay, expression, items, scope, partial, getNode(replay, parent, expression));
|
|
298
|
+
|
|
299
|
+
const visitAt = (
|
|
300
|
+
replay: Replay,
|
|
301
|
+
expression: Expression,
|
|
302
|
+
items: ActionItem | undefined,
|
|
303
|
+
scope: Scope | undefined,
|
|
304
|
+
partial: State,
|
|
305
|
+
node: number,
|
|
306
|
+
): boolean =>
|
|
229
307
|
withFrame(replay, expression, () => {
|
|
230
308
|
switch (expression.kind) {
|
|
231
|
-
case "Let":
|
|
232
|
-
|
|
233
|
-
|
|
234
|
-
|
|
235
|
-
|
|
236
|
-
|
|
237
|
-
|
|
238
|
-
|
|
239
|
-
|
|
309
|
+
case "Let": {
|
|
310
|
+
const context = getContext(replay, scope, partial);
|
|
311
|
+
const definitions = expression.definitions;
|
|
312
|
+
const bound = replay.coverage
|
|
313
|
+
? bindDefinitions(definitions, context, {
|
|
314
|
+
impure: new Set(definitions),
|
|
315
|
+
streamed: new Set(),
|
|
316
|
+
})
|
|
317
|
+
: bindDefinitions(definitions, context);
|
|
318
|
+
return visit(replay, expression.body, items, bound, partial, node);
|
|
319
|
+
}
|
|
240
320
|
case "Label":
|
|
241
|
-
visit(replay, expression.body, items, scope, partial);
|
|
242
|
-
return;
|
|
321
|
+
return visit(replay, expression.body, items, scope, partial, node);
|
|
243
322
|
default:
|
|
244
323
|
if (LITERAL_KINDS.has(expression.kind))
|
|
245
324
|
throw new TlaEvaluationError("The state relation is not a boolean expression.");
|
|
246
|
-
withFrame(replay, expression, () =>
|
|
247
|
-
visitApplication(replay, expression, items, scope, partial),
|
|
325
|
+
return withFrame(replay, expression, () =>
|
|
326
|
+
visitApplication(replay, expression, items, scope, partial, node),
|
|
248
327
|
);
|
|
249
328
|
}
|
|
250
329
|
});
|
|
251
330
|
|
|
252
|
-
// The value of a user-defined operator TLC evaluates instead of walking its body.
|
|
253
331
|
const visitValue = (
|
|
254
332
|
replay: Replay,
|
|
255
333
|
value: Value,
|
|
256
334
|
items: ActionItem | undefined,
|
|
257
335
|
partial: State,
|
|
258
|
-
|
|
259
|
-
|
|
260
|
-
|
|
336
|
+
node: number,
|
|
337
|
+
) => isTrue(value) && proceed(replay, items, partial, node);
|
|
338
|
+
|
|
339
|
+
const BUILT_IN_OPERATORS = new Set([
|
|
340
|
+
"=",
|
|
341
|
+
"#",
|
|
342
|
+
"~",
|
|
343
|
+
"<=>",
|
|
344
|
+
"/\\",
|
|
345
|
+
"\\/",
|
|
346
|
+
"=>",
|
|
347
|
+
"\\in",
|
|
348
|
+
"\\notin",
|
|
349
|
+
"\\subseteq",
|
|
350
|
+
"\\cup",
|
|
351
|
+
"\\cap",
|
|
352
|
+
"\\",
|
|
353
|
+
"SUBSET",
|
|
354
|
+
"UNION",
|
|
355
|
+
"DOMAIN",
|
|
356
|
+
"~>",
|
|
357
|
+
"-+->",
|
|
358
|
+
"\\cdot",
|
|
359
|
+
]);
|
|
261
360
|
|
|
262
361
|
const visitDefined = (
|
|
263
362
|
replay: Replay,
|
|
@@ -265,21 +364,21 @@ const visitDefined = (
|
|
|
265
364
|
items: ActionItem | undefined,
|
|
266
365
|
scope: Scope | undefined,
|
|
267
366
|
partial: State,
|
|
268
|
-
|
|
367
|
+
node: number,
|
|
368
|
+
): boolean => {
|
|
269
369
|
const context = getContext(replay, scope, partial);
|
|
270
370
|
if (expression.kind === "Identifier") {
|
|
271
371
|
const binding = lookupScope(scope, expression.name);
|
|
272
372
|
if (binding?.kind === "Thunk" && binding.cache === undefined) {
|
|
273
|
-
|
|
274
|
-
return;
|
|
373
|
+
const thunkNode = replay.coverage?.values.get(binding) ?? node;
|
|
374
|
+
return visit(replay, binding.expression, items, binding.scope, partial, thunkNode);
|
|
275
375
|
}
|
|
276
376
|
if (
|
|
277
377
|
binding?.kind === "Operator" &&
|
|
278
378
|
binding.operator.kind === "Closure" &&
|
|
279
379
|
binding.operator.params.length === 0
|
|
280
380
|
) {
|
|
281
|
-
visit(replay, binding.operator.body, items, binding.operator.scope, partial);
|
|
282
|
-
return;
|
|
381
|
+
return visit(replay, binding.operator.body, items, binding.operator.scope, partial, node);
|
|
283
382
|
}
|
|
284
383
|
const definition = binding ? undefined : replay.environment.definitions.get(expression.name);
|
|
285
384
|
const operator = binding
|
|
@@ -291,48 +390,54 @@ const visitDefined = (
|
|
|
291
390
|
!replay.environment.variableIndex.has(expression.name) &&
|
|
292
391
|
!(definition && isConstantLevel(definition, replay.environment))
|
|
293
392
|
) {
|
|
294
|
-
visit(replay, operator.body, items, operator.scope, partial);
|
|
295
|
-
return;
|
|
393
|
+
return visit(replay, operator.body, items, operator.scope, partial, node);
|
|
296
394
|
}
|
|
297
|
-
visitValue(
|
|
298
|
-
|
|
395
|
+
return visitValue(
|
|
396
|
+
replay,
|
|
397
|
+
evaluateOperatorAt(replay, node, expression, context),
|
|
398
|
+
items,
|
|
399
|
+
partial,
|
|
400
|
+
node,
|
|
401
|
+
);
|
|
299
402
|
}
|
|
300
403
|
const operator = resolveApplyOperator(expression, context);
|
|
301
404
|
if (operator?.kind === "Closure" && operator.params.length === expression.args.length) {
|
|
302
|
-
|
|
303
|
-
replay,
|
|
304
|
-
operator.body,
|
|
305
|
-
items,
|
|
405
|
+
const bound = runAt(replay, node, () =>
|
|
306
406
|
bindOperatorArguments(operator, expression.args, context),
|
|
307
|
-
partial,
|
|
308
407
|
);
|
|
309
|
-
return;
|
|
408
|
+
return visit(replay, operator.body, items, bound, partial, node);
|
|
310
409
|
}
|
|
311
|
-
|
|
410
|
+
const value = BUILT_IN_OPERATORS.has(expression.operator)
|
|
411
|
+
? evaluateAt(replay, node, expression, context)
|
|
412
|
+
: evaluateOperatorAt(replay, node, expression, context);
|
|
413
|
+
return visitValue(replay, value, items, partial, node);
|
|
312
414
|
};
|
|
313
415
|
|
|
314
|
-
// A variable takes the value when it has none yet, and otherwise must already have it.
|
|
315
416
|
const proceedWithValue = (
|
|
316
417
|
replay: Replay,
|
|
317
418
|
items: ActionItem | undefined,
|
|
318
419
|
partial: State,
|
|
319
420
|
index: number,
|
|
320
421
|
value: Value,
|
|
422
|
+
node: number,
|
|
321
423
|
) => {
|
|
322
424
|
const assigned = partial[index];
|
|
323
|
-
if (assigned === undefined)
|
|
324
|
-
|
|
325
|
-
return;
|
|
326
|
-
}
|
|
327
|
-
if (valuesEqual(assigned, value)) proceed(replay, items, partial);
|
|
425
|
+
if (assigned === undefined) return proceed(replay, items, assign(partial, index, value), node);
|
|
426
|
+
return isEqualLikeTlc(assigned, value) && proceed(replay, items, partial, node);
|
|
328
427
|
};
|
|
329
428
|
|
|
330
429
|
const createItem = (
|
|
331
430
|
kind: ActionItem["kind"],
|
|
332
431
|
expression: Expression,
|
|
333
432
|
scope: Scope | undefined,
|
|
433
|
+
node: number,
|
|
334
434
|
rest: ActionItem | undefined,
|
|
335
|
-
): ActionItem => ({ kind, expression, scope, rest });
|
|
435
|
+
): ActionItem => ({ kind, expression, scope, node, rest });
|
|
436
|
+
|
|
437
|
+
const getEnumerated = (replay: Replay, set: Value, elements: Value[]) => {
|
|
438
|
+
if (replay.coverage) costCoverage(replay.coverage, set, elements.length + 1);
|
|
439
|
+
return elements;
|
|
440
|
+
};
|
|
336
441
|
|
|
337
442
|
const visitAssignment = (
|
|
338
443
|
replay: Replay,
|
|
@@ -340,65 +445,119 @@ const visitAssignment = (
|
|
|
340
445
|
items: ActionItem | undefined,
|
|
341
446
|
scope: Scope | undefined,
|
|
342
447
|
partial: State,
|
|
448
|
+
node: number,
|
|
343
449
|
) => {
|
|
344
450
|
const [target, source] = expression.args;
|
|
345
451
|
const index = replay.isInit
|
|
346
|
-
? getVariable(replay, target, scope)
|
|
347
|
-
: getPrimedVariable(replay, target, scope);
|
|
452
|
+
? getVariable(replay.environment, target, scope)
|
|
453
|
+
: getPrimedVariable(replay.environment, target, scope);
|
|
348
454
|
const context = getContext(replay, scope, partial);
|
|
349
455
|
if (index === undefined) {
|
|
350
|
-
|
|
351
|
-
|
|
456
|
+
return (
|
|
457
|
+
evaluateAt(replay, node, expression, context) === true &&
|
|
458
|
+
proceed(replay, items, partial, node)
|
|
459
|
+
);
|
|
352
460
|
}
|
|
353
|
-
const value =
|
|
461
|
+
const value = evaluateAt(replay, node, source, context);
|
|
354
462
|
const assigned = partial[index];
|
|
355
463
|
if (expression.operator === "=") {
|
|
356
|
-
proceedWithValue(replay, items, partial, index, value);
|
|
357
|
-
return;
|
|
464
|
+
return proceedWithValue(replay, items, partial, index, value, node);
|
|
358
465
|
}
|
|
359
466
|
const set: Value = expression.operator === "\\subseteq" ? { kind: "Subset", base: value } : value;
|
|
467
|
+
if (typeof set === "object" && set !== value) replay.callStack?.sources.set(set, source);
|
|
360
468
|
if (assigned !== undefined) {
|
|
361
|
-
|
|
362
|
-
|
|
469
|
+
return (
|
|
470
|
+
evaluateAt(replay, node, expression, context) === true &&
|
|
471
|
+
proceed(replay, items, partial, node)
|
|
472
|
+
);
|
|
363
473
|
}
|
|
364
474
|
if (!isTlcEnumerable(set))
|
|
365
475
|
throw new TlaEvaluationError("The right side of \\IN is not enumerable.");
|
|
366
|
-
|
|
367
|
-
|
|
368
|
-
|
|
476
|
+
return getEnumerated(replay, set, getStreamedElements(set)).reduce<boolean>(
|
|
477
|
+
(isProduced, element) =>
|
|
478
|
+
proceed(replay, items, assign(partial, index, element), node) || isProduced,
|
|
479
|
+
false,
|
|
480
|
+
);
|
|
369
481
|
};
|
|
370
482
|
|
|
371
483
|
const ASSIGNMENT_OPERATORS = new Set(["=", "\\in", "\\subseteq"]);
|
|
372
484
|
|
|
373
485
|
export const LITERAL_KINDS = new Set<Expression["kind"]>(["Number", "Decimal", "String"]);
|
|
374
486
|
|
|
487
|
+
const ENABLED_TEMPORAL_FORMS: Partial<Record<Expression["kind"], string>> = {
|
|
488
|
+
Always: "[]",
|
|
489
|
+
Eventually: "<>",
|
|
490
|
+
WeakFairness: "WF",
|
|
491
|
+
StrongFairness: "SF",
|
|
492
|
+
};
|
|
493
|
+
|
|
494
|
+
export const getEnabledFailure = (expression: Expression) => {
|
|
495
|
+
const form =
|
|
496
|
+
expression.kind === "Apply" && (expression.operator === "~>" || expression.operator === "-+->")
|
|
497
|
+
? expression.operator === "~>"
|
|
498
|
+
? "a ~> b"
|
|
499
|
+
: "a -+-> formula"
|
|
500
|
+
: ENABLED_TEMPORAL_FORMS[expression.kind];
|
|
501
|
+
if (form !== undefined) {
|
|
502
|
+
return `In computing ENABLED, TLC encountered a temporal formula (${form}).\n${describeRange(expression)}`;
|
|
503
|
+
}
|
|
504
|
+
if (expression.kind === "UnboundedQuantifier") {
|
|
505
|
+
return expression.isTemporal
|
|
506
|
+
? `In computing ENABLED, TLC encountered temporal quantifier.\n${describeRange(expression)}`
|
|
507
|
+
: `In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${expression.quantifier === "Forall" ? "\\A" : "\\E"} x \\in S: P(x).\n${describeRange(expression)}`;
|
|
508
|
+
}
|
|
509
|
+
if (expression.kind === "Choose" && expression.set === undefined) {
|
|
510
|
+
return `In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${describeRange(expression)}`;
|
|
511
|
+
}
|
|
512
|
+
return undefined;
|
|
513
|
+
};
|
|
514
|
+
|
|
515
|
+
const getBindings = (
|
|
516
|
+
replay: Replay,
|
|
517
|
+
expression: Expression & { kind: "Exists" | "Forall" },
|
|
518
|
+
context: Context,
|
|
519
|
+
node: number,
|
|
520
|
+
) => {
|
|
521
|
+
const bindings: (Scope | undefined)[] = [];
|
|
522
|
+
const version = replay.environment.runtime.version;
|
|
523
|
+
const sets = runAt(replay, node, () =>
|
|
524
|
+
mapBoundSets(expression.bounds, (set) => {
|
|
525
|
+
const value = evaluate(set, context);
|
|
526
|
+
const elements = getQuantifierElements(value, set, version);
|
|
527
|
+
if (Array.isArray(elements)) getEnumerated(replay, value, elements);
|
|
528
|
+
return elements;
|
|
529
|
+
}),
|
|
530
|
+
);
|
|
531
|
+
forEachBoundElement(expression.bounds, sets, context.scope, (bound) => {
|
|
532
|
+
bindings.push(bound);
|
|
533
|
+
return false;
|
|
534
|
+
});
|
|
535
|
+
return bindings;
|
|
536
|
+
};
|
|
537
|
+
|
|
375
538
|
const visitApplication = (
|
|
376
539
|
replay: Replay,
|
|
377
540
|
expression: Expression,
|
|
378
541
|
items: ActionItem | undefined,
|
|
379
542
|
scope: Scope | undefined,
|
|
380
543
|
partial: State,
|
|
381
|
-
|
|
544
|
+
node: number,
|
|
545
|
+
): boolean => {
|
|
382
546
|
const context = getContext(replay, scope, partial);
|
|
383
547
|
switch (expression.kind) {
|
|
384
548
|
case "Identifier":
|
|
385
|
-
visitDefined(replay, expression, items, scope, partial);
|
|
386
|
-
return;
|
|
549
|
+
return visitDefined(replay, expression, items, scope, partial, node);
|
|
387
550
|
case "Apply": {
|
|
388
551
|
if (ASSIGNMENT_OPERATORS.has(expression.operator) && expression.args.length === 2) {
|
|
389
|
-
visitAssignment(replay, expression, items, scope, partial);
|
|
390
|
-
return;
|
|
552
|
+
return visitAssignment(replay, expression, items, scope, partial, node);
|
|
391
553
|
}
|
|
392
554
|
if (expression.operator === "=>" && expression.args.length === 2) {
|
|
393
|
-
if (isTrue(
|
|
394
|
-
visit(replay, expression.args[1], items, scope, partial);
|
|
395
|
-
return;
|
|
555
|
+
if (isTrue(evaluateAt(replay, node, expression.args[0], context))) {
|
|
556
|
+
return visit(replay, expression.args[1], items, scope, partial, node);
|
|
396
557
|
}
|
|
397
|
-
proceed(replay, items, partial);
|
|
398
|
-
return;
|
|
558
|
+
return proceed(replay, items, partial, node);
|
|
399
559
|
}
|
|
400
|
-
visitDefined(replay, expression, items, scope, partial);
|
|
401
|
-
return;
|
|
560
|
+
return visitDefined(replay, expression, items, scope, partial, node);
|
|
402
561
|
}
|
|
403
562
|
case "And": {
|
|
404
563
|
const operands = expression.operands;
|
|
@@ -406,254 +565,420 @@ const visitApplication = (
|
|
|
406
565
|
const rest = operands
|
|
407
566
|
.slice(1)
|
|
408
567
|
.reduceRight<ActionItem | undefined>(
|
|
409
|
-
(tail, operand) => createItem("Predicate", operand, scope, tail),
|
|
568
|
+
(tail, operand) => createItem("Predicate", operand, scope, node, tail),
|
|
410
569
|
items,
|
|
411
570
|
);
|
|
412
|
-
visit(replay, operands[0], rest, scope, partial);
|
|
413
|
-
return;
|
|
571
|
+
return visit(replay, operands[0], rest, scope, partial, node);
|
|
414
572
|
}
|
|
415
573
|
const last = operands[operands.length - 1];
|
|
416
|
-
|
|
574
|
+
return visitAt(
|
|
417
575
|
replay,
|
|
418
576
|
getPrefix(expression, operands.length - 1),
|
|
419
|
-
createItem("Predicate", last, scope, items),
|
|
577
|
+
createItem("Predicate", last, scope, node, items),
|
|
420
578
|
scope,
|
|
421
579
|
partial,
|
|
580
|
+
getPrefixNode(replay, node),
|
|
422
581
|
);
|
|
423
|
-
return;
|
|
424
582
|
}
|
|
425
583
|
case "Or": {
|
|
426
584
|
const operands = expression.operands;
|
|
427
585
|
if (expression.isBulleted || operands.length === 2) {
|
|
428
|
-
operands.
|
|
429
|
-
|
|
586
|
+
return operands.reduce(
|
|
587
|
+
(isProduced, operand) =>
|
|
588
|
+
visit(replay, operand, items, scope, partial, node) || isProduced,
|
|
589
|
+
false,
|
|
590
|
+
);
|
|
430
591
|
}
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
|
|
592
|
+
const isPrefixProduced = visitAt(
|
|
593
|
+
replay,
|
|
594
|
+
getPrefix(expression, operands.length - 1),
|
|
595
|
+
items,
|
|
596
|
+
scope,
|
|
597
|
+
partial,
|
|
598
|
+
getPrefixNode(replay, node),
|
|
599
|
+
);
|
|
600
|
+
const isLastProduced = visit(
|
|
601
|
+
replay,
|
|
602
|
+
operands[operands.length - 1],
|
|
603
|
+
items,
|
|
604
|
+
scope,
|
|
605
|
+
partial,
|
|
606
|
+
node,
|
|
607
|
+
);
|
|
608
|
+
return isPrefixProduced || isLastProduced;
|
|
434
609
|
}
|
|
435
610
|
case "Exists":
|
|
436
|
-
|
|
437
|
-
|
|
438
|
-
|
|
439
|
-
|
|
440
|
-
|
|
611
|
+
return getBindings(replay, expression, context, node).reduce(
|
|
612
|
+
(isProduced, bound) =>
|
|
613
|
+
visit(replay, expression.body, items, bound, partial, node) || isProduced,
|
|
614
|
+
false,
|
|
615
|
+
);
|
|
441
616
|
case "Forall": {
|
|
442
|
-
const bounds
|
|
443
|
-
|
|
444
|
-
bounds.push(bound);
|
|
445
|
-
return false;
|
|
446
|
-
});
|
|
447
|
-
if (bounds.length === 0) {
|
|
448
|
-
proceed(replay, items, partial);
|
|
449
|
-
return;
|
|
450
|
-
}
|
|
451
|
-
// TLC adds each binding after the first to the front of the conjuncts left.
|
|
617
|
+
const bounds = getBindings(replay, expression, context, node);
|
|
618
|
+
if (bounds.length === 0) return proceed(replay, items, partial, node);
|
|
452
619
|
const rest = bounds
|
|
453
620
|
.slice(1)
|
|
454
621
|
.reduce<ActionItem | undefined>(
|
|
455
|
-
(tail, bound) => createItem("Predicate", expression.body, bound, tail),
|
|
622
|
+
(tail, bound) => createItem("Predicate", expression.body, bound, node, tail),
|
|
456
623
|
items,
|
|
457
624
|
);
|
|
458
|
-
visit(replay, expression.body, rest, bounds[0], partial);
|
|
459
|
-
return;
|
|
625
|
+
return visit(replay, expression.body, rest, bounds[0], partial, node);
|
|
460
626
|
}
|
|
461
627
|
case "If":
|
|
462
|
-
visit(
|
|
628
|
+
return visit(
|
|
463
629
|
replay,
|
|
464
|
-
isTrue(
|
|
630
|
+
isTrue(evaluateAt(replay, node, expression.condition, context))
|
|
465
631
|
? expression.consequent
|
|
466
632
|
: expression.alternative,
|
|
467
633
|
items,
|
|
468
634
|
scope,
|
|
469
635
|
partial,
|
|
636
|
+
node,
|
|
470
637
|
);
|
|
471
|
-
return;
|
|
472
638
|
case "Case": {
|
|
473
639
|
const arm = expression.arms.find((candidate) =>
|
|
474
|
-
isTrue(
|
|
640
|
+
isTrue(evaluateAt(replay, node, candidate.condition, context)),
|
|
475
641
|
);
|
|
476
642
|
const body = arm?.body ?? expression.other;
|
|
477
643
|
if (body === undefined) {
|
|
478
644
|
throw new TlaEvaluationError("TLC encountered a CASE with no conditions true.");
|
|
479
645
|
}
|
|
480
|
-
visit(replay, body, items, scope, partial);
|
|
481
|
-
return;
|
|
646
|
+
return visit(replay, body, items, scope, partial, node);
|
|
482
647
|
}
|
|
483
648
|
case "FunctionApplication": {
|
|
484
649
|
const lambda = getLazyFunction(
|
|
485
|
-
|
|
650
|
+
evaluateAt(
|
|
651
|
+
replay,
|
|
652
|
+
node,
|
|
653
|
+
expression.function,
|
|
654
|
+
replay.isInit ? context : toKeepLazyContext(context),
|
|
655
|
+
),
|
|
486
656
|
);
|
|
487
657
|
if (lambda) {
|
|
488
|
-
|
|
489
|
-
return;
|
|
658
|
+
const bound = runAt(replay, node, () => bindLazyArguments(lambda, expression, context));
|
|
659
|
+
return visit(replay, lambda.body, items, bound, partial, node);
|
|
490
660
|
}
|
|
491
661
|
break;
|
|
492
662
|
}
|
|
493
663
|
case "Unchanged":
|
|
494
664
|
if (!replay.isInit) {
|
|
495
|
-
visitUnchanged(replay, expression.expression, items, scope, partial);
|
|
496
|
-
return;
|
|
665
|
+
return visitUnchanged(replay, expression.expression, items, scope, partial, node);
|
|
497
666
|
}
|
|
498
667
|
break;
|
|
499
668
|
case "BoxAction":
|
|
500
669
|
if (!replay.isInit) {
|
|
501
|
-
visit(replay, expression.action, items, scope, partial);
|
|
502
|
-
|
|
503
|
-
|
|
670
|
+
const isProduced = visit(replay, expression.action, items, scope, partial, node);
|
|
671
|
+
return (
|
|
672
|
+
visitUnchanged(replay, expression.subscript, items, scope, partial, node) || isProduced
|
|
673
|
+
);
|
|
504
674
|
}
|
|
505
675
|
break;
|
|
506
676
|
case "AngleAction":
|
|
507
677
|
if (!replay.isInit) {
|
|
508
|
-
visit(
|
|
678
|
+
return visit(
|
|
509
679
|
replay,
|
|
510
680
|
expression.action,
|
|
511
|
-
createItem("Changed", expression.subscript, scope, items),
|
|
681
|
+
createItem("Changed", expression.subscript, scope, node, items),
|
|
512
682
|
scope,
|
|
513
683
|
partial,
|
|
684
|
+
node,
|
|
514
685
|
);
|
|
515
|
-
return;
|
|
516
686
|
}
|
|
517
687
|
break;
|
|
518
688
|
}
|
|
519
|
-
|
|
689
|
+
const failure = replay.isEnabled ? getEnabledFailure(expression) : undefined;
|
|
690
|
+
if (failure !== undefined) throw new TlaEvaluationError(failure);
|
|
691
|
+
return visitValue(replay, evaluateAt(replay, node, expression, context), items, partial, node);
|
|
520
692
|
};
|
|
521
693
|
|
|
522
|
-
|
|
694
|
+
export const warnChangedUnchanged = (
|
|
695
|
+
environment: Environment,
|
|
696
|
+
index: number,
|
|
697
|
+
expression: Expression,
|
|
698
|
+
) =>
|
|
699
|
+
environment.runtime.warn(
|
|
700
|
+
MESSAGE_CODE.unchangedVariableChanged,
|
|
701
|
+
`The variable ${environment.variables[index]} was changed while it is specified as UNCHANGED at\n${describeRange(expression)}`,
|
|
702
|
+
);
|
|
703
|
+
|
|
523
704
|
const visitUnchanged = (
|
|
524
705
|
replay: Replay,
|
|
525
706
|
expression: Expression,
|
|
526
707
|
items: ActionItem | undefined,
|
|
527
708
|
scope: Scope | undefined,
|
|
528
709
|
partial: State,
|
|
529
|
-
|
|
710
|
+
parent: number,
|
|
711
|
+
): boolean =>
|
|
530
712
|
withFrame(replay, expression, () => {
|
|
531
|
-
const
|
|
713
|
+
const node = getNode(replay, parent, expression);
|
|
714
|
+
const index = getVariable(replay.environment, expression, scope);
|
|
532
715
|
if (index !== undefined) {
|
|
533
716
|
const value = replay.current?.[index];
|
|
534
|
-
if (value
|
|
535
|
-
|
|
717
|
+
if (value === undefined) return false;
|
|
718
|
+
const assigned = partial[index];
|
|
719
|
+
if (assigned !== undefined && !isEqualLikeTlc(assigned, value)) {
|
|
720
|
+
warnChangedUnchanged(replay.environment, index, expression);
|
|
721
|
+
return false;
|
|
722
|
+
}
|
|
723
|
+
return proceedWithValue(replay, items, partial, index, value, node);
|
|
536
724
|
}
|
|
537
725
|
if (expression.kind === "Tuple") {
|
|
538
726
|
const [first, ...others] = expression.elements;
|
|
539
|
-
if (first === undefined)
|
|
540
|
-
proceed(replay, items, partial);
|
|
541
|
-
return;
|
|
542
|
-
}
|
|
727
|
+
if (first === undefined) return proceed(replay, items, partial, node);
|
|
543
728
|
const rest = others.reduceRight<ActionItem | undefined>(
|
|
544
|
-
(tail, element) => createItem("Unchanged", element, scope, tail),
|
|
729
|
+
(tail, element) => createItem("Unchanged", element, scope, node, tail),
|
|
545
730
|
items,
|
|
546
731
|
);
|
|
547
|
-
visitUnchanged(replay, first, rest, scope, partial);
|
|
548
|
-
return;
|
|
732
|
+
return visitUnchanged(replay, first, rest, scope, partial, node);
|
|
549
733
|
}
|
|
550
734
|
if (expression.kind === "Identifier") {
|
|
551
735
|
const binding = lookupScope(scope, expression.name);
|
|
552
736
|
if (binding?.kind === "Thunk") {
|
|
553
|
-
visitUnchanged(replay, binding.expression, items, binding.scope, partial);
|
|
554
|
-
return;
|
|
737
|
+
return visitUnchanged(replay, binding.expression, items, binding.scope, partial, node);
|
|
555
738
|
}
|
|
556
739
|
const operator = binding
|
|
557
740
|
? undefined
|
|
558
741
|
: resolveGlobalOperator(expression.name, replay.environment);
|
|
559
742
|
if (operator?.kind === "Closure" && operator.params.length === 0) {
|
|
560
|
-
visitUnchanged(replay, operator.body, items, operator.scope, partial);
|
|
561
|
-
|
|
743
|
+
return visitUnchanged(replay, operator.body, items, operator.scope, partial, node);
|
|
744
|
+
}
|
|
745
|
+
}
|
|
746
|
+
// Deviation from TLC: Tool#enabledUnchanged evaluates the application in the partial next state and fails on an unassigned variable.
|
|
747
|
+
if (replay.isEnabled && expression.kind === "Apply") {
|
|
748
|
+
const context = getContext(replay, scope, partial);
|
|
749
|
+
const operator = resolveApplyOperator(expression, context);
|
|
750
|
+
if (operator?.kind === "Closure" && operator.params.length === expression.args.length) {
|
|
751
|
+
return visitUnchanged(
|
|
752
|
+
replay,
|
|
753
|
+
operator.body,
|
|
754
|
+
items,
|
|
755
|
+
bindOperatorArguments(operator, expression.args, context),
|
|
756
|
+
partial,
|
|
757
|
+
node,
|
|
758
|
+
);
|
|
562
759
|
}
|
|
563
760
|
}
|
|
564
761
|
const environment = replay.environment;
|
|
565
|
-
const before =
|
|
762
|
+
const before = evaluateAt(replay, node, expression, {
|
|
566
763
|
environment,
|
|
567
764
|
scope,
|
|
568
765
|
state: replay.current,
|
|
569
766
|
next: undefined,
|
|
570
767
|
});
|
|
571
|
-
const after =
|
|
572
|
-
|
|
768
|
+
const after = evaluateAt(replay, node, expression, {
|
|
769
|
+
environment,
|
|
770
|
+
scope,
|
|
771
|
+
state: partial,
|
|
772
|
+
next: undefined,
|
|
773
|
+
});
|
|
774
|
+
return isEqualLikeTlc(before, after) && proceed(replay, items, partial, node);
|
|
573
775
|
});
|
|
574
776
|
|
|
575
777
|
const createReplay = (
|
|
576
778
|
environment: Environment,
|
|
577
|
-
|
|
779
|
+
kind: "init" | "next" | "enabled",
|
|
578
780
|
current: Value[] | undefined,
|
|
579
781
|
onState: (state: Value[]) => void,
|
|
580
|
-
|
|
581
|
-
): Replay => {
|
|
582
|
-
|
|
583
|
-
|
|
584
|
-
|
|
585
|
-
|
|
782
|
+
onIncomplete?: (state: State) => void,
|
|
783
|
+
): Replay => ({
|
|
784
|
+
environment,
|
|
785
|
+
callStack: environment.callStack,
|
|
786
|
+
coverage: environment.coverage,
|
|
787
|
+
isInit: kind === "init",
|
|
788
|
+
isEnabled: kind === "enabled",
|
|
789
|
+
current,
|
|
790
|
+
onState,
|
|
791
|
+
onIncomplete,
|
|
792
|
+
});
|
|
586
793
|
|
|
587
794
|
const ENABLED_FOUND = new Error("The replay found a successor");
|
|
588
795
|
|
|
589
|
-
// TLC's Tool#enabled, which walks the action as getNextStates does and stops at the first
|
|
590
|
-
// successor.
|
|
591
796
|
export const replayEnabled = (
|
|
592
797
|
expression: Expression,
|
|
593
798
|
scope: Scope | undefined,
|
|
594
799
|
state: Value[],
|
|
595
800
|
environment: Environment,
|
|
596
801
|
) => {
|
|
597
|
-
const replay = createReplay(
|
|
598
|
-
|
|
599
|
-
|
|
600
|
-
|
|
601
|
-
|
|
602
|
-
throw ENABLED_FOUND;
|
|
603
|
-
},
|
|
604
|
-
true,
|
|
605
|
-
);
|
|
606
|
-
const depth = replay.callStack.expressions.length;
|
|
802
|
+
const replay = createReplay(environment, "enabled", state, () => {
|
|
803
|
+
throw ENABLED_FOUND;
|
|
804
|
+
});
|
|
805
|
+
const callStack = replay.callStack;
|
|
806
|
+
const depth = callStack?.expressions.length ?? 0;
|
|
607
807
|
try {
|
|
608
|
-
// The ENABLED of a fairness condition WF_v(A) passes A to TLC's enabled with v to change, where
|
|
609
|
-
// liveness.ts builds <<A>>_v at the location of A.
|
|
610
808
|
if (expression.kind === "AngleAction" && expression.location === expression.action.location) {
|
|
611
|
-
const changed = createItem("Changed", expression.subscript, scope, undefined);
|
|
612
|
-
visit(replay, expression.action, changed, scope, getEmptyState(environment));
|
|
809
|
+
const changed = createItem("Changed", expression.subscript, scope, -1, undefined);
|
|
810
|
+
visit(replay, expression.action, changed, scope, getEmptyState(environment), -1);
|
|
613
811
|
} else {
|
|
614
|
-
visit(replay, expression, undefined, scope, getEmptyState(environment));
|
|
812
|
+
visit(replay, expression, undefined, scope, getEmptyState(environment), -1);
|
|
615
813
|
}
|
|
616
814
|
return false;
|
|
617
815
|
} catch (error) {
|
|
618
816
|
if (error !== ENABLED_FOUND) throw error;
|
|
619
|
-
|
|
620
|
-
|
|
621
|
-
|
|
817
|
+
if (callStack) {
|
|
818
|
+
callStack.expressions.length = depth;
|
|
819
|
+
callStack.isFrozen = false;
|
|
820
|
+
}
|
|
622
821
|
return true;
|
|
623
822
|
}
|
|
624
823
|
};
|
|
625
824
|
|
|
626
|
-
// TLC's getInitStates, which conjoins the initial predicates of the specification.
|
|
627
825
|
export const replayInitialStates = (
|
|
628
|
-
inits: ReplayAction[],
|
|
826
|
+
inits: (ReplayAction & { node?: number })[],
|
|
629
827
|
environment: Environment,
|
|
630
828
|
onState: (state: Value[]) => void,
|
|
829
|
+
onIncomplete?: (state: State) => void,
|
|
631
830
|
) => {
|
|
632
831
|
const [first, ...others] = inits;
|
|
633
832
|
if (first === undefined) return;
|
|
634
|
-
const replay = createReplay(environment,
|
|
833
|
+
const replay = createReplay(environment, "init", undefined, onState, onIncomplete);
|
|
635
834
|
const rest = others.reduceRight<ActionItem | undefined>(
|
|
636
|
-
(tail, init) => createItem("Predicate", init.expression, init.scope, tail),
|
|
835
|
+
(tail, init) => createItem("Predicate", init.expression, init.scope, init.node ?? -1, tail),
|
|
637
836
|
undefined,
|
|
638
837
|
);
|
|
639
|
-
visit(replay, first.expression, rest, first.scope, getEmptyState(environment));
|
|
838
|
+
visit(replay, first.expression, rest, first.scope, getEmptyState(environment), first.node ?? -1);
|
|
640
839
|
};
|
|
641
840
|
|
|
642
|
-
// TLC's getNextStates for each action TLC splits the next-state relation into. TLC checks the
|
|
643
|
-
// successors of an action once it has computed them all.
|
|
644
841
|
export const replaySuccessors = <Action extends ReplayAction>(
|
|
645
842
|
actions: Action[],
|
|
646
843
|
state: Value[],
|
|
647
844
|
environment: Environment,
|
|
648
845
|
onState: (state: Value[], action: Action) => void,
|
|
649
846
|
) => {
|
|
650
|
-
// TLC fails to split a next-state relation that is not an operator application before it checks
|
|
651
|
-
// the spec, so it replays nothing.
|
|
652
847
|
if (actions.some((action) => LITERAL_KINDS.has(action.expression.kind))) return;
|
|
653
848
|
actions.forEach((action) => {
|
|
654
849
|
const successors: Value[][] = [];
|
|
655
|
-
|
|
656
|
-
visit(replay, action.expression, undefined, action.scope, getEmptyState(environment));
|
|
850
|
+
walkSuccessors(action, -1, state, environment, (next) => successors.push(next));
|
|
657
851
|
successors.forEach((successor) => onState(successor, action));
|
|
658
852
|
});
|
|
659
853
|
};
|
|
854
|
+
|
|
855
|
+
export const walkSuccessors = (
|
|
856
|
+
action: ReplayAction,
|
|
857
|
+
node: number,
|
|
858
|
+
state: Value[],
|
|
859
|
+
environment: Environment,
|
|
860
|
+
onState: (state: Value[]) => void,
|
|
861
|
+
onIncomplete?: (state: State) => void,
|
|
862
|
+
) => {
|
|
863
|
+
const replay = createReplay(environment, "next", state, onState, onIncomplete);
|
|
864
|
+
visit(replay, action.expression, undefined, action.scope, getEmptyState(environment), node);
|
|
865
|
+
};
|
|
866
|
+
|
|
867
|
+
export const getPrimedRanges = (actions: ReplayAction[], environment: Environment) => {
|
|
868
|
+
const ranges: Expression[] = [];
|
|
869
|
+
const createContext = (scope: Scope | undefined): Context => ({
|
|
870
|
+
environment,
|
|
871
|
+
scope,
|
|
872
|
+
state: undefined,
|
|
873
|
+
next: undefined,
|
|
874
|
+
});
|
|
875
|
+
const collectUnchanged = (expression: Expression, scope: Scope | undefined): void => {
|
|
876
|
+
if (
|
|
877
|
+
getVariable(environment, expression, undefined) !== undefined &&
|
|
878
|
+
expression.kind === "Identifier"
|
|
879
|
+
) {
|
|
880
|
+
ranges.push(expression);
|
|
881
|
+
return;
|
|
882
|
+
}
|
|
883
|
+
if (expression.kind === "Tuple") {
|
|
884
|
+
expression.elements.forEach((element) => collectUnchanged(element, scope));
|
|
885
|
+
return;
|
|
886
|
+
}
|
|
887
|
+
if (expression.kind !== "Identifier") return;
|
|
888
|
+
const binding = lookupScope(scope, expression.name);
|
|
889
|
+
const operator = binding ? undefined : resolveGlobalOperator(expression.name, environment);
|
|
890
|
+
if (operator?.kind === "Closure" && operator.params.length === 0) {
|
|
891
|
+
collectUnchanged(operator.body, operator.scope);
|
|
892
|
+
}
|
|
893
|
+
};
|
|
894
|
+
const collect = (
|
|
895
|
+
expression: Expression,
|
|
896
|
+
scope: Scope | undefined,
|
|
897
|
+
visited: Set<Expression>,
|
|
898
|
+
): void => {
|
|
899
|
+
switch (expression.kind) {
|
|
900
|
+
case "Let":
|
|
901
|
+
collect(
|
|
902
|
+
expression.body,
|
|
903
|
+
bindDefinitions(expression.definitions, createContext(scope)),
|
|
904
|
+
visited,
|
|
905
|
+
);
|
|
906
|
+
return;
|
|
907
|
+
case "Label":
|
|
908
|
+
collect(expression.body, scope, visited);
|
|
909
|
+
return;
|
|
910
|
+
case "FunctionApplication":
|
|
911
|
+
collect(expression.function, scope, visited);
|
|
912
|
+
return;
|
|
913
|
+
case "If":
|
|
914
|
+
collect(expression.consequent, scope, visited);
|
|
915
|
+
collect(expression.alternative, scope, visited);
|
|
916
|
+
return;
|
|
917
|
+
case "Case":
|
|
918
|
+
expression.arms.forEach((arm) => collect(arm.body, scope, visited));
|
|
919
|
+
if (expression.other) collect(expression.other, scope, visited);
|
|
920
|
+
return;
|
|
921
|
+
case "And":
|
|
922
|
+
case "Or":
|
|
923
|
+
expression.operands.forEach((operand) => collect(operand, scope, visited));
|
|
924
|
+
return;
|
|
925
|
+
case "Exists":
|
|
926
|
+
case "Forall":
|
|
927
|
+
collect(expression.body, scope, visited);
|
|
928
|
+
return;
|
|
929
|
+
case "Unchanged":
|
|
930
|
+
collectUnchanged(expression.expression, scope);
|
|
931
|
+
return;
|
|
932
|
+
case "AngleAction":
|
|
933
|
+
collect(expression.action, scope, visited);
|
|
934
|
+
return;
|
|
935
|
+
case "BoxAction":
|
|
936
|
+
collect(expression.action, scope, visited);
|
|
937
|
+
ranges.push(expression.subscript);
|
|
938
|
+
return;
|
|
939
|
+
case "Identifier":
|
|
940
|
+
case "Apply": {
|
|
941
|
+
if (expression.kind === "Apply") {
|
|
942
|
+
if (expression.operator === "=>") {
|
|
943
|
+
expression.args.forEach((arg) => collect(arg, scope, visited));
|
|
944
|
+
return;
|
|
945
|
+
}
|
|
946
|
+
if (expression.operator === "=" || expression.operator === "\\in") {
|
|
947
|
+
if (getPrimedVariable(environment, expression.args[0], scope) !== undefined) {
|
|
948
|
+
ranges.push(expression);
|
|
949
|
+
}
|
|
950
|
+
return;
|
|
951
|
+
}
|
|
952
|
+
}
|
|
953
|
+
const name = expression.kind === "Identifier" ? expression.name : expression.operator;
|
|
954
|
+
const binding = lookupScope(scope, name);
|
|
955
|
+
if (binding?.kind === "Thunk") {
|
|
956
|
+
collect(binding.expression, binding.scope, visited);
|
|
957
|
+
return;
|
|
958
|
+
}
|
|
959
|
+
const operator =
|
|
960
|
+
expression.kind === "Apply"
|
|
961
|
+
? resolveApplyOperator(expression, createContext(scope))
|
|
962
|
+
: binding?.kind === "Operator"
|
|
963
|
+
? binding.operator
|
|
964
|
+
: binding
|
|
965
|
+
? undefined
|
|
966
|
+
: resolveGlobalOperator(name, environment);
|
|
967
|
+
if (operator?.kind !== "Closure" || visited.has(operator.body)) return;
|
|
968
|
+
const definition = environment.definitions.get(name);
|
|
969
|
+
if (definition?.isRecursive) return;
|
|
970
|
+
const args = expression.kind === "Apply" ? expression.args : [];
|
|
971
|
+
if (operator.params.length !== args.length) return;
|
|
972
|
+
visited.add(operator.body);
|
|
973
|
+
collect(
|
|
974
|
+
operator.body,
|
|
975
|
+
bindOperatorArguments(operator, args, createContext(scope)),
|
|
976
|
+
visited,
|
|
977
|
+
);
|
|
978
|
+
visited.delete(operator.body);
|
|
979
|
+
}
|
|
980
|
+
}
|
|
981
|
+
};
|
|
982
|
+
actions.forEach((action) => collect(action.expression, action.scope, new Set()));
|
|
983
|
+
return ranges.flatMap((expression) => expression.location.range ?? []);
|
|
984
|
+
};
|