tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +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 +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- package/dist/transfer.js +42 -39
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +0 -2
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- 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 +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- 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 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +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 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- 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 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +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 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- 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 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +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 +175 -15
- 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 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- 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 +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +234 -36
- 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 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +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 +19 -11
- 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 +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +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 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +25 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +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 +3126 -316
- 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 +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +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 +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- 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 +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +56 -74
- package/src/runtime.ts +4 -0
- 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 +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +2 -3
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +205 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +0 -2
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/tlcext-operators.ts +44 -12
- package/src/tlc/trace-spec.ts +21 -40
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +62 -152
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
package/src/check.ts
CHANGED
|
@@ -9,10 +9,8 @@ import {
|
|
|
9
9
|
getCoverageReport,
|
|
10
10
|
type CoverageReport,
|
|
11
11
|
} from "./coverage";
|
|
12
|
-
import { createEnvironment } from "./environment";
|
|
13
12
|
import {
|
|
14
13
|
createStackOverflowError,
|
|
15
|
-
getErrorExitCode,
|
|
16
14
|
isStackOverflow,
|
|
17
15
|
TlaEvaluationError,
|
|
18
16
|
TlaIllegalStateError,
|
|
@@ -24,21 +22,32 @@ import {
|
|
|
24
22
|
formatRange,
|
|
25
23
|
} from "./errors";
|
|
26
24
|
import {
|
|
27
|
-
createTracingEnvironment,
|
|
28
25
|
describeRange,
|
|
29
26
|
getDefinition,
|
|
30
|
-
isImpure,
|
|
31
27
|
type CallStack,
|
|
32
28
|
type Environment,
|
|
33
29
|
type FingerprintFailure,
|
|
34
30
|
} from "./evaluate";
|
|
31
|
+
import { EXIT_STATUS, setExitCode, withLivenessExitCode } from "./exit-codes";
|
|
35
32
|
import {
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
33
|
+
fingerprintReplayed,
|
|
34
|
+
getFailureExitCode,
|
|
35
|
+
getReplayFailure,
|
|
36
|
+
type FailureOptions,
|
|
37
|
+
} from "./check-failure";
|
|
38
|
+
import {
|
|
39
|
+
createTraceBuilder,
|
|
40
|
+
type Behavior,
|
|
41
|
+
type SearchPosition,
|
|
42
|
+
type TracedStep,
|
|
43
|
+
} from "./check-trace";
|
|
44
|
+
import {
|
|
45
|
+
createStateTable,
|
|
46
|
+
findStateIndex,
|
|
47
|
+
getStateHash,
|
|
48
|
+
isSameState,
|
|
49
|
+
markSeenState,
|
|
50
|
+
} from "./fingerprints";
|
|
42
51
|
import type { JavaOverride } from "./java-overrides";
|
|
43
52
|
import {
|
|
44
53
|
createLivenessChecker,
|
|
@@ -47,6 +56,7 @@ import {
|
|
|
47
56
|
type LiveSuccessor,
|
|
48
57
|
} from "./liveness-checker";
|
|
49
58
|
import {
|
|
59
|
+
createCheckEnvironment,
|
|
50
60
|
createMissingOperatorError,
|
|
51
61
|
createSearch,
|
|
52
62
|
getIncompleteSuccessorMessage,
|
|
@@ -58,11 +68,11 @@ import {
|
|
|
58
68
|
import {
|
|
59
69
|
getActionLabel,
|
|
60
70
|
getActionSignature,
|
|
61
|
-
|
|
62
|
-
getNextActions,
|
|
71
|
+
getSpecDescription,
|
|
63
72
|
getSpecificationValue,
|
|
64
73
|
toActionValue,
|
|
65
74
|
type SpecAction,
|
|
75
|
+
type SpecDescription,
|
|
66
76
|
} from "./spec-description";
|
|
67
77
|
import {
|
|
68
78
|
createStateWriter,
|
|
@@ -79,7 +89,6 @@ import {
|
|
|
79
89
|
type Successor,
|
|
80
90
|
} from "./successors";
|
|
81
91
|
import {
|
|
82
|
-
getCodedMessage,
|
|
83
92
|
getFailureMessage,
|
|
84
93
|
getWrappedException,
|
|
85
94
|
isEvalException,
|
|
@@ -90,9 +99,7 @@ import {
|
|
|
90
99
|
} from "./tlc/messages";
|
|
91
100
|
import { createTautologyError } from "./liveness";
|
|
92
101
|
import { KEY_SEPARATOR } from "./resolve";
|
|
93
|
-
import { setFingerprintPolynomial } from "./tlc/fingerprint";
|
|
94
102
|
import { writeTraceSpec } from "./tlc/trace-spec";
|
|
95
|
-
import { createTlcOrder } from "./tlc/order";
|
|
96
103
|
import {
|
|
97
104
|
getPrimedRanges,
|
|
98
105
|
replayInitialStates,
|
|
@@ -102,19 +109,15 @@ import {
|
|
|
102
109
|
import { getFingerprintDistance, OUT_DEGREE_BUCKETS } from "./tlc/summary";
|
|
103
110
|
import { createActionRecord, createCounterExample } from "./tlc/tlcext-operators";
|
|
104
111
|
import type { TlcVersion } from "./tlc/version";
|
|
112
|
+
import { runTypedSearch, type TypedResult } from "./typed-tier";
|
|
105
113
|
import {
|
|
106
|
-
combineHash,
|
|
107
114
|
createCanonicalizer,
|
|
108
115
|
createModelValue,
|
|
109
116
|
formatState,
|
|
110
117
|
getFingerprintError,
|
|
111
|
-
getHeldValues,
|
|
112
118
|
getModelValues,
|
|
113
|
-
getValueHash,
|
|
114
119
|
isSameValue,
|
|
115
120
|
markFingerprinted,
|
|
116
|
-
setStringOrder,
|
|
117
|
-
setValueOptions,
|
|
118
121
|
type Value,
|
|
119
122
|
} from "./values";
|
|
120
123
|
|
|
@@ -146,6 +149,8 @@ export interface CheckOptions {
|
|
|
146
149
|
isTool?: boolean;
|
|
147
150
|
/** TLC's -continue: reports each violation through onProgress and goes on. */
|
|
148
151
|
isContinued?: boolean;
|
|
152
|
+
/** Skips fingerprintDistance, which takes fingerprinting every state again after the search. */
|
|
153
|
+
isFingerprintDistanceSkipped?: boolean;
|
|
149
154
|
moduleOperators?: ModuleOperator[];
|
|
150
155
|
/** TLC's trace exploration spec, and the binary trace TLC records for it unless -noTEBin. */
|
|
151
156
|
traceSpec?: TraceSpecOptions;
|
|
@@ -284,12 +289,6 @@ export interface EvaluationFailure {
|
|
|
284
289
|
isWithoutStatistics?: boolean;
|
|
285
290
|
}
|
|
286
291
|
|
|
287
|
-
interface ReplayFailure {
|
|
288
|
-
callStack: Expression[];
|
|
289
|
-
fingerprint: FingerprintFailure | undefined;
|
|
290
|
-
replayError?: TlaEvaluationError;
|
|
291
|
-
}
|
|
292
|
-
|
|
293
292
|
export interface InitialStates {
|
|
294
293
|
generated: number;
|
|
295
294
|
distinct: number;
|
|
@@ -323,73 +322,18 @@ interface CoveredAction extends SpecAction {
|
|
|
323
322
|
node: number;
|
|
324
323
|
}
|
|
325
324
|
|
|
326
|
-
interface Behavior {
|
|
327
|
-
trace: TraceStep[];
|
|
328
|
-
traceOutput?: OutputLine[];
|
|
329
|
-
}
|
|
330
|
-
|
|
331
|
-
interface TraceOptions {
|
|
332
|
-
loopStart?: number;
|
|
333
|
-
known?: number;
|
|
334
|
-
}
|
|
335
|
-
|
|
336
325
|
interface ReportedViolation extends Omit<Violation, "loopStart"> {
|
|
337
326
|
loopStart?: number;
|
|
338
327
|
}
|
|
339
328
|
|
|
340
|
-
interface RebuiltState {
|
|
341
|
-
state: Value[];
|
|
342
|
-
level: number;
|
|
343
|
-
}
|
|
344
|
-
|
|
345
|
-
interface SearchPosition {
|
|
346
|
-
index: number;
|
|
347
|
-
isExpanding: boolean;
|
|
348
|
-
candidate: Value[] | undefined;
|
|
349
|
-
candidateLevel: number;
|
|
350
|
-
livenessSource: number;
|
|
351
|
-
rebuilt: RebuiltState | undefined;
|
|
352
|
-
}
|
|
353
|
-
|
|
354
|
-
interface FailureOptions {
|
|
355
|
-
initialState?: Value[];
|
|
356
|
-
isInitial?: boolean;
|
|
357
|
-
outDegrees?: number[];
|
|
358
|
-
callStack?: Expression[];
|
|
359
|
-
fingerprint?: FingerprintFailure;
|
|
360
|
-
replayError?: TlaEvaluationError;
|
|
361
|
-
isNextState?: boolean;
|
|
362
|
-
isCallStackFirst?: boolean;
|
|
363
|
-
traceFailure?: FailureMessage;
|
|
364
|
-
isLiveCallStack?: boolean;
|
|
365
|
-
}
|
|
366
|
-
|
|
367
329
|
const appendTraceOutput = <Traced extends Behavior>(behavior: Traced, lines: OutputLine[]) => ({
|
|
368
330
|
...behavior,
|
|
369
331
|
traceOutput: [...(behavior.traceOutput ?? []), ...lines],
|
|
370
332
|
});
|
|
371
333
|
|
|
372
|
-
const INITIAL_RECOVERY_FAILURE = "Failed to recover the initial state from its fingerprint.";
|
|
373
|
-
const NEXT_RECOVERY_FAILURE = "Failed to recover the next state from its fingerprint.";
|
|
374
|
-
|
|
375
334
|
const STOP_REPLAY = new Error("The replay stopped");
|
|
376
335
|
const STOP_WALK = new Error("The walk stopped");
|
|
377
336
|
|
|
378
|
-
const getInitialExitCode = (error: TlaEvaluationError) => {
|
|
379
|
-
const coded = getCodedMessage(error.message);
|
|
380
|
-
return coded &&
|
|
381
|
-
!coded.isEvalException &&
|
|
382
|
-
getMessageExitStatus(coded.code) === EXIT_STATUS.configParseError
|
|
383
|
-
? EXIT_STATUS.configParseError
|
|
384
|
-
: getErrorExitCode(error);
|
|
385
|
-
};
|
|
386
|
-
|
|
387
|
-
const getReplayExitCode = (error: TlaEvaluationError): number => {
|
|
388
|
-
const inner = error.cause;
|
|
389
|
-
if (inner instanceof TlaEvaluationError) return getReplayExitCode(inner);
|
|
390
|
-
return error instanceof TlaModuleError ? error.exitCode : EXIT_STATUS.specEvaluationFailure;
|
|
391
|
-
};
|
|
392
|
-
|
|
393
337
|
export const checkSequentially = (options: CheckOptions): CheckResult => {
|
|
394
338
|
const stateWriter =
|
|
395
339
|
options.dump && createStateWriter(options.dump, options.writeFile, options.version);
|
|
@@ -428,29 +372,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
428
372
|
capturedLines = outer;
|
|
429
373
|
}
|
|
430
374
|
};
|
|
431
|
-
const
|
|
432
|
-
|
|
433
|
-
setValueOptions(options);
|
|
434
|
-
setFingerprintPolynomial(options.fingerprintPolynomial ?? 0);
|
|
435
|
-
const specification = createEnvironment(config, {
|
|
436
|
-
source: options.source,
|
|
437
|
-
loadModule: options.loadModule,
|
|
438
|
-
order,
|
|
439
|
-
loadClass: options.loadClass,
|
|
440
|
-
print,
|
|
441
|
-
files: {
|
|
442
|
-
readFile: options.readFile,
|
|
443
|
-
writeFile: options.writeFile,
|
|
444
|
-
makeDirectory: options.makeDirectory,
|
|
445
|
-
},
|
|
446
|
-
seed: options.seed,
|
|
447
|
-
isTool: options.isTool,
|
|
448
|
-
traceFile: options.traceSpec?.traceFile,
|
|
449
|
-
isSanyReported: options.isSanyReported,
|
|
450
|
-
isWarningEnabled: options.isWarningEnabled,
|
|
451
|
-
version: options.version,
|
|
452
|
-
moduleOperators: options.moduleOperators,
|
|
453
|
-
});
|
|
375
|
+
const created = createCheckEnvironment(config, options, print);
|
|
376
|
+
const specification = created.specification;
|
|
454
377
|
reportStartup(specification, config, options.onProgress);
|
|
455
378
|
const coverage =
|
|
456
379
|
options.coverage === undefined
|
|
@@ -468,13 +391,11 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
468
391
|
const runtime = environment.runtime;
|
|
469
392
|
const is174 = runtime.version === "1.7.4";
|
|
470
393
|
runtime.pause = options.onPause ?? (() => {});
|
|
394
|
+
let description: SpecDescription | undefined;
|
|
395
|
+
const getDescription = () =>
|
|
396
|
+
(description ??= getSpecDescription(config, environment, specification.instanceActions));
|
|
471
397
|
runtime.getSpecification = () =>
|
|
472
|
-
getSpecificationValue(
|
|
473
|
-
config,
|
|
474
|
-
environment,
|
|
475
|
-
specification.variableLocations,
|
|
476
|
-
specification.instanceActions,
|
|
477
|
-
);
|
|
398
|
+
getSpecificationValue(getDescription(), config, environment, specification.variableLocations);
|
|
478
399
|
let searchDepth = 0;
|
|
479
400
|
let computedInitialStates: InitialStates | undefined;
|
|
480
401
|
const getTraceSpec = (trace: TraceStep[], loopStart: number | undefined) =>
|
|
@@ -539,21 +460,22 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
539
460
|
const createSuccess = (): CheckResult => ({
|
|
540
461
|
...createResult("success"),
|
|
541
462
|
outDegrees: [...outDegrees],
|
|
542
|
-
fingerprintDistance:
|
|
543
|
-
|
|
544
|
-
runtime.generatedStates,
|
|
545
|
-
|
|
546
|
-
|
|
547
|
-
|
|
548
|
-
|
|
549
|
-
|
|
463
|
+
fingerprintDistance: options.isFingerprintDistanceSkipped
|
|
464
|
+
? undefined
|
|
465
|
+
: getFingerprintDistance(runtime.distinctStates, runtime.generatedStates, (visit) =>
|
|
466
|
+
visit(
|
|
467
|
+
search
|
|
468
|
+
? search.getStoredFingerprints(states, fingerprintStates)
|
|
469
|
+
: BigInt64Array.from(states, runtime.getFingerprint),
|
|
470
|
+
),
|
|
471
|
+
),
|
|
550
472
|
});
|
|
551
473
|
|
|
552
474
|
const search = createSearch(
|
|
553
475
|
config,
|
|
554
476
|
environment,
|
|
555
477
|
specification.variableLocations,
|
|
556
|
-
() => order.getDeclarationOrder("variable"),
|
|
478
|
+
() => created.order.getDeclarationOrder("variable"),
|
|
557
479
|
options.onProgress,
|
|
558
480
|
specification.moduleOperators,
|
|
559
481
|
);
|
|
@@ -575,13 +497,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
575
497
|
config.postconditions.length > 0 ||
|
|
576
498
|
config.possible.length > 0 ||
|
|
577
499
|
specification.moduleOperators.some((operator) => operator.kind === "postcondition");
|
|
578
|
-
const
|
|
579
|
-
|
|
580
|
-
{ state: Record<string, Value>; action: SpecAction | undefined }
|
|
581
|
-
>();
|
|
582
|
-
const getStepState = (step: TraceStep) => traceSteps.get(step)?.state ?? step.state;
|
|
500
|
+
const tracedSteps = new WeakMap<TraceStep, TracedStep>();
|
|
501
|
+
const getStepState = (step: TraceStep) => tracedSteps.get(step)?.state ?? step.state;
|
|
583
502
|
const getStepAction = (step: TraceStep) => {
|
|
584
|
-
const action =
|
|
503
|
+
const action = tracedSteps.get(step)?.action;
|
|
585
504
|
return action ? toActionValue(action) : createActionRecord(step.action);
|
|
586
505
|
};
|
|
587
506
|
const checkTracePostconditions = (
|
|
@@ -633,13 +552,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
633
552
|
};
|
|
634
553
|
const spec = search.spec;
|
|
635
554
|
const getFingerprintState = search.getFingerprintState;
|
|
636
|
-
let specNextActions: SpecAction[] | undefined;
|
|
637
|
-
const getSpecNextActions = () =>
|
|
638
|
-
(specNextActions ??= getNextActions(config, environment, specification.instanceActions));
|
|
639
555
|
// Tool's constructor splits the next-state relation into actions before TLC checks anything.
|
|
640
|
-
|
|
556
|
+
const nextActions = getDescription().actions;
|
|
641
557
|
runtime.getSuccessorAction = (state, next) =>
|
|
642
|
-
|
|
558
|
+
nextActions.find((action) =>
|
|
643
559
|
getSuccessors(action.expression, state, environment, action.scope).some((successor) =>
|
|
644
560
|
successor.state.every((value, index) => isSameValue(value, next[index])),
|
|
645
561
|
),
|
|
@@ -657,11 +573,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
657
573
|
)
|
|
658
574
|
: -1,
|
|
659
575
|
}));
|
|
660
|
-
const coverageInits = addCoverageRelations(
|
|
661
|
-
|
|
662
|
-
coverage ? getInitActions(config, environment, specification.instanceActions) : [],
|
|
663
|
-
);
|
|
664
|
-
const coverageActions = addCoverageRelations("next", coverage ? getSpecNextActions() : []);
|
|
576
|
+
const coverageInits = addCoverageRelations("init", coverage ? getDescription().inits : []);
|
|
577
|
+
const coverageActions = addCoverageRelations("next", coverage ? nextActions : []);
|
|
665
578
|
if (coverage) buildCoverage(coverage, environment, getPrimedRanges(coverageActions, environment));
|
|
666
579
|
const walkCoveredSuccessors = (
|
|
667
580
|
action: CoveredAction,
|
|
@@ -696,64 +609,26 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
696
609
|
);
|
|
697
610
|
return successors;
|
|
698
611
|
};
|
|
612
|
+
const rejectIncompleteInitialState = (partial: (Value | undefined)[]) => {
|
|
613
|
+
throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
|
|
614
|
+
};
|
|
699
615
|
const getCoveredInitialStates = () => {
|
|
700
616
|
const initialStates: Value[][] = [];
|
|
701
617
|
replayInitialStates(
|
|
702
618
|
coverageInits,
|
|
703
619
|
environment,
|
|
704
620
|
(state) => initialStates.push(state),
|
|
705
|
-
|
|
706
|
-
throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
|
|
707
|
-
},
|
|
621
|
+
rejectIncompleteInitialState,
|
|
708
622
|
);
|
|
709
623
|
return initialStates;
|
|
710
624
|
};
|
|
711
|
-
const getReplayFailure = (replay: (tracing: Environment) => void): ReplayFailure | undefined => {
|
|
712
|
-
const tracing = createTracingEnvironment(environment);
|
|
713
|
-
const callStack = tracing.callStack;
|
|
714
|
-
try {
|
|
715
|
-
replay(tracing);
|
|
716
|
-
return undefined;
|
|
717
|
-
} catch (error) {
|
|
718
|
-
if (isStackOverflow(error)) return { callStack: [], fingerprint: undefined };
|
|
719
|
-
if (!(error instanceof TlaEvaluationError) || !callStack) return undefined;
|
|
720
|
-
return {
|
|
721
|
-
callStack: callStack.expressions,
|
|
722
|
-
fingerprint: callStack.fingerprint,
|
|
723
|
-
replayError: error,
|
|
724
|
-
};
|
|
725
|
-
}
|
|
726
|
-
};
|
|
727
|
-
const findFailedSources = (value: Value, sources: CallStack["sources"]): Expression[] => {
|
|
728
|
-
if (typeof value !== "object") return [];
|
|
729
|
-
const source = sources.get(value);
|
|
730
|
-
const failed = getHeldValues(value).find((held) => getFingerprintError(held) !== undefined);
|
|
731
|
-
return [
|
|
732
|
-
...(source ? [source] : []),
|
|
733
|
-
...(failed === undefined ? [] : findFailedSources(failed, sources)),
|
|
734
|
-
];
|
|
735
|
-
};
|
|
736
|
-
const fingerprintReplayed = (state: Value[], callStack: CallStack | undefined) => {
|
|
737
|
-
for (const value of getFingerprintState(state)) {
|
|
738
|
-
const error = getFingerprintError(value);
|
|
739
|
-
if (!error) continue;
|
|
740
|
-
const sources = callStack ? findFailedSources(value, callStack.sources) : [];
|
|
741
|
-
if (callStack && sources.length > 0) {
|
|
742
|
-
callStack.expressions.length = 0;
|
|
743
|
-
callStack.isFrozen = true;
|
|
744
|
-
callStack.fingerprint = { sources, reason: error.message };
|
|
745
|
-
}
|
|
746
|
-
throw error;
|
|
747
|
-
}
|
|
748
|
-
state.forEach(markFingerprinted);
|
|
749
|
-
};
|
|
750
625
|
const createReplayedStates = () => {
|
|
751
626
|
const replayed = unstoredFingerprint ? [unstoredFingerprint] : [];
|
|
752
627
|
return (state: Value[], callStack: CallStack | undefined) => {
|
|
753
|
-
fingerprintReplayed(state, callStack);
|
|
628
|
+
fingerprintReplayed(state, getFingerprintState(state), callStack);
|
|
754
629
|
const fingerprintState = getFingerprintState(state);
|
|
755
630
|
const isSeen =
|
|
756
|
-
findStateIndex(getStateHash(fingerprintState), fingerprintState) !== -1 ||
|
|
631
|
+
findStateIndex(seenStates, getStateHash(fingerprintState), fingerprintState) !== -1 ||
|
|
757
632
|
replayed.some((seen) => isSameState(seen, fingerprintState));
|
|
758
633
|
if (isSeen) return false;
|
|
759
634
|
replayed.push(fingerprintState);
|
|
@@ -765,48 +640,44 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
765
640
|
let replayedCount = 0;
|
|
766
641
|
const deferred: unknown[] = [];
|
|
767
642
|
const addReplayed = createReplayedStates();
|
|
768
|
-
return getReplayFailure((tracing) => {
|
|
769
|
-
replayInitialStates(
|
|
770
|
-
|
|
771
|
-
|
|
772
|
-
|
|
773
|
-
|
|
774
|
-
|
|
775
|
-
|
|
776
|
-
|
|
777
|
-
|
|
778
|
-
|
|
779
|
-
|
|
780
|
-
|
|
781
|
-
|
|
782
|
-
};
|
|
783
|
-
|
|
784
|
-
|
|
785
|
-
|
|
786
|
-
|
|
787
|
-
|
|
788
|
-
|
|
789
|
-
state: traced,
|
|
790
|
-
});
|
|
791
|
-
throw STOP_REPLAY;
|
|
792
|
-
}
|
|
793
|
-
} catch (error) {
|
|
794
|
-
const isFingerprintFailure =
|
|
795
|
-
error instanceof TlaEvaluationError && tracing.callStack?.fingerprint !== undefined;
|
|
796
|
-
if (!isFingerprintFailure && !isStackOverflow(error)) throw error;
|
|
797
|
-
deferred.push(error);
|
|
643
|
+
return getReplayFailure(environment, (tracing) => {
|
|
644
|
+
replayInitialStates(getDescription().inits, tracing, (state) => {
|
|
645
|
+
reportInitialStatesProgress(replayedCount, (progress) => capturedLines?.push(progress));
|
|
646
|
+
replayedCount++;
|
|
647
|
+
runtime.generatedStates = replayedCount;
|
|
648
|
+
if (deferred.length > 0) return;
|
|
649
|
+
try {
|
|
650
|
+
const addFingerprint = () => {
|
|
651
|
+
if (!addReplayed(state, tracing.callStack)) return;
|
|
652
|
+
runtime.queueSize++;
|
|
653
|
+
liveness?.addInitialState(states.length, state, tracing);
|
|
654
|
+
};
|
|
655
|
+
const violation = search.checkReplayedInitialState(state, tracing, addFingerprint);
|
|
656
|
+
if (violation) {
|
|
657
|
+
const traced = traces.toTrace([{ action: undefined, state }], []).trace[0].state;
|
|
658
|
+
capturedLines?.push({
|
|
659
|
+
kind: "initial-state-violation",
|
|
660
|
+
...violation,
|
|
661
|
+
state: traced,
|
|
662
|
+
});
|
|
663
|
+
throw STOP_REPLAY;
|
|
798
664
|
}
|
|
799
|
-
}
|
|
800
|
-
|
|
665
|
+
} catch (error) {
|
|
666
|
+
const isFingerprintFailure =
|
|
667
|
+
error instanceof TlaEvaluationError && tracing.callStack?.fingerprint !== undefined;
|
|
668
|
+
if (!isFingerprintFailure && !isStackOverflow(error)) throw error;
|
|
669
|
+
deferred.push(error);
|
|
670
|
+
}
|
|
671
|
+
});
|
|
801
672
|
if (deferred.length > 0) throw deferred[0];
|
|
802
673
|
});
|
|
803
674
|
};
|
|
804
675
|
const replayNext = (index: number) =>
|
|
805
|
-
getReplayFailure((tracing) => {
|
|
676
|
+
getReplayFailure(environment, (tracing) => {
|
|
806
677
|
const state = states[index];
|
|
807
678
|
const source = stateWriter && getGraphState(state, depths[index]);
|
|
808
679
|
const addReplayed = createReplayedStates();
|
|
809
|
-
replaySuccessors(
|
|
680
|
+
replaySuccessors(nextActions, state, tracing, (next, action) => {
|
|
810
681
|
const addFingerprint = () => {
|
|
811
682
|
const isUnseen = addReplayed(next, tracing.callStack);
|
|
812
683
|
if (source) {
|
|
@@ -824,7 +695,6 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
824
695
|
}
|
|
825
696
|
});
|
|
826
697
|
});
|
|
827
|
-
const isReducing = config.view !== undefined || config.symmetry !== undefined;
|
|
828
698
|
const tlcFingerprints: number[] = [];
|
|
829
699
|
if (search.properties.liveness.length > 0) {
|
|
830
700
|
options.onProgress?.({
|
|
@@ -857,7 +727,11 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
857
727
|
search.satisfiesActionConstraints(state, successor.state);
|
|
858
728
|
if (!isInModel) return false;
|
|
859
729
|
const fingerprintState = getFingerprintState(successor.state);
|
|
860
|
-
const index = findStateIndex(
|
|
730
|
+
const index = findStateIndex(
|
|
731
|
+
seenStates,
|
|
732
|
+
getStateHash(fingerprintState),
|
|
733
|
+
fingerprintState,
|
|
734
|
+
);
|
|
861
735
|
successors.push({ index, state: successor.state });
|
|
862
736
|
return false;
|
|
863
737
|
},
|
|
@@ -880,202 +754,14 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
880
754
|
const parents: number[] = [];
|
|
881
755
|
const actions: (string | undefined)[] = [];
|
|
882
756
|
const depths: number[] = [];
|
|
883
|
-
|
|
884
|
-
const seenStates = { slots: new Int32Array(1 << 17), size: 0, shift: 16 };
|
|
757
|
+
const seenStates = createStateTable(fingerprintStates);
|
|
885
758
|
const canonicalizeState = createCanonicalizer();
|
|
886
759
|
|
|
887
760
|
const toRecord = search.toRecord;
|
|
888
|
-
const getAliasState = (
|
|
889
|
-
alias: string,
|
|
890
|
-
steps: Successor[],
|
|
891
|
-
position: number,
|
|
892
|
-
loopStart: number | undefined,
|
|
893
|
-
) => {
|
|
894
|
-
const searchLevel = runtime.getLevel;
|
|
895
|
-
const searchBehavior = runtime.getBehavior;
|
|
896
|
-
runtime.getLevel = () => position + 1;
|
|
897
|
-
runtime.getBehavior = () => steps.slice(0, position + 1).map((step) => step.state);
|
|
898
|
-
try {
|
|
899
|
-
return evaluateAlias(
|
|
900
|
-
alias,
|
|
901
|
-
steps[position].state,
|
|
902
|
-
(steps[position + 1] ?? steps[loopStart ?? position]).state,
|
|
903
|
-
);
|
|
904
|
-
} finally {
|
|
905
|
-
runtime.getLevel = searchLevel;
|
|
906
|
-
runtime.getBehavior = searchBehavior;
|
|
907
|
-
}
|
|
908
|
-
};
|
|
909
|
-
const evaluateAlias = (alias: string, state: Value[], next: Value[] | undefined) =>
|
|
910
|
-
search.evaluateAlias(alias, state, next, options.isTool ?? false);
|
|
911
|
-
const findStepAction = (index: number, previous: Value[], state: Value[], isHeld: boolean) => {
|
|
912
|
-
const actions = getSpecNextActions();
|
|
913
|
-
const expanding = { ...current };
|
|
914
|
-
Object.assign(current, {
|
|
915
|
-
index,
|
|
916
|
-
isExpanding: true,
|
|
917
|
-
candidate: undefined,
|
|
918
|
-
rebuilt: { state: previous, level: depths[index] },
|
|
919
|
-
});
|
|
920
|
-
const getKey = isHeld ? (values: Value[]) => values : getFingerprintState;
|
|
921
|
-
const key = getKey(state);
|
|
922
|
-
try {
|
|
923
|
-
return coverage
|
|
924
|
-
? coverageActions.find((item) =>
|
|
925
|
-
getCoveredSuccessors(item, previous).some((successor) =>
|
|
926
|
-
isSameState(getKey(successor.state), key),
|
|
927
|
-
),
|
|
928
|
-
)
|
|
929
|
-
: actions.find((item) =>
|
|
930
|
-
getSuccessors(item.expression, previous, environment, item.scope).some((successor) =>
|
|
931
|
-
isSameState(getKey(successor.state), key),
|
|
932
|
-
),
|
|
933
|
-
);
|
|
934
|
-
} finally {
|
|
935
|
-
Object.assign(current, expanding);
|
|
936
|
-
}
|
|
937
|
-
};
|
|
938
|
-
const toTrace = (
|
|
939
|
-
steps: Successor[],
|
|
940
|
-
path: number[],
|
|
941
|
-
traceOptions: TraceOptions = {},
|
|
942
|
-
): Behavior => {
|
|
943
|
-
const alias = config.alias;
|
|
944
|
-
const known = traceOptions.known ?? 1;
|
|
945
|
-
const initialOutput = steps.length > 1 ? captureOutput(getSpecInitialStates).lines : [];
|
|
946
|
-
const stepActions = steps.map((step, position) =>
|
|
947
|
-
position === 0 || step.action === "Stuttering"
|
|
948
|
-
? { result: undefined, lines: [] }
|
|
949
|
-
: captureOutput(() =>
|
|
950
|
-
findStepAction(
|
|
951
|
-
path[position - 1],
|
|
952
|
-
steps[position - 1].state,
|
|
953
|
-
step.state,
|
|
954
|
-
known === 2 && position === steps.length - 1,
|
|
955
|
-
),
|
|
956
|
-
),
|
|
957
|
-
);
|
|
958
|
-
const outputs = stepActions.map((step) => step.lines);
|
|
959
|
-
const loopStart = traceOptions.loopStart;
|
|
960
|
-
const rebuilt = is174 && loopStart !== undefined ? loopStart + 1 : steps.length - known;
|
|
961
|
-
if (coverage && steps.length > 1) {
|
|
962
|
-
const isRebuiltAgain = known > 0 && !is174;
|
|
963
|
-
if (rebuilt > 0 && isRebuiltAgain) captureOutput(getSpecInitialStates);
|
|
964
|
-
if (isRebuiltAgain) {
|
|
965
|
-
steps.slice(1).forEach((step, position) => {
|
|
966
|
-
if (step.action === "Stuttering") return;
|
|
967
|
-
captureOutput(() =>
|
|
968
|
-
findStepAction(
|
|
969
|
-
path[position],
|
|
970
|
-
steps[position].state,
|
|
971
|
-
step.state,
|
|
972
|
-
known === 2 && position === steps.length - 2,
|
|
973
|
-
),
|
|
974
|
-
);
|
|
975
|
-
});
|
|
976
|
-
}
|
|
977
|
-
}
|
|
978
|
-
const prefixOutput = rebuilt > 0 ? [initialOutput, ...outputs.slice(1, rebuilt)].flat() : [];
|
|
979
|
-
return {
|
|
980
|
-
trace: steps.map((step, position) => {
|
|
981
|
-
const action = stepActions[position].result;
|
|
982
|
-
const traceStep: TraceStep = {
|
|
983
|
-
action: step.action,
|
|
984
|
-
label: action && getActionLabel(action, options.version),
|
|
985
|
-
state:
|
|
986
|
-
alias === undefined
|
|
987
|
-
? toRecord(step.state)
|
|
988
|
-
: getAliasState(alias, steps, position, loopStart),
|
|
989
|
-
output: position === 0 ? prefixOutput : position < rebuilt ? [] : outputs[position],
|
|
990
|
-
};
|
|
991
|
-
if (alias !== undefined || action) {
|
|
992
|
-
traceSteps.set(traceStep, { state: toRecord(step.state), action });
|
|
993
|
-
}
|
|
994
|
-
return traceStep;
|
|
995
|
-
}),
|
|
996
|
-
traceOutput: known > 0 && !is174 ? [initialOutput, ...outputs].flat() : [],
|
|
997
|
-
};
|
|
998
|
-
};
|
|
999
761
|
const getSpecInitialStates = () => {
|
|
1000
762
|
if (coverage) return getCoveredInitialStates();
|
|
1001
763
|
return spec.init === undefined ? [] : getInitialStates(spec.init, environment, spec.scope);
|
|
1002
764
|
};
|
|
1003
|
-
const findTraceSuccessor = (state: Value[], isMatch: (successor: Successor) => boolean) =>
|
|
1004
|
-
captureOutput(() => {
|
|
1005
|
-
for (const action of getSpecNextActions()) {
|
|
1006
|
-
const successor = getSuccessors(action.expression, state, environment, action.scope).find(
|
|
1007
|
-
isMatch,
|
|
1008
|
-
);
|
|
1009
|
-
if (successor) return { ...successor, action: successor.action ?? action.name };
|
|
1010
|
-
}
|
|
1011
|
-
return undefined;
|
|
1012
|
-
}).result;
|
|
1013
|
-
const hasFingerprint = (state: Value[], index: number) =>
|
|
1014
|
-
isSameState(getFingerprintState(state), fingerprintStates[index]);
|
|
1015
|
-
const findSuccessorWithFingerprint = (state: Value[], index: number) =>
|
|
1016
|
-
findTraceSuccessor(state, (successor) => hasFingerprint(successor.state, index));
|
|
1017
|
-
const getPathStates = (path: number[], nextFailure: string) => {
|
|
1018
|
-
const initial = captureOutput(() =>
|
|
1019
|
-
isReducing || isImpure(environment)
|
|
1020
|
-
? getSpecInitialStates().find((state) => hasFingerprint(state, path[0]))
|
|
1021
|
-
: states[path[0]],
|
|
1022
|
-
).result;
|
|
1023
|
-
if (!initial) throw new TlaEvaluationError(INITIAL_RECOVERY_FAILURE);
|
|
1024
|
-
const steps: Successor[] = [{ state: initial, action: undefined }];
|
|
1025
|
-
for (let position = 1; position < path.length; position++) {
|
|
1026
|
-
const previous = steps[position - 1].state;
|
|
1027
|
-
if (path[position - 1] === path[position]) {
|
|
1028
|
-
steps.push({ state: previous, action: "Stuttering" });
|
|
1029
|
-
continue;
|
|
1030
|
-
}
|
|
1031
|
-
const rebuilt = current.rebuilt;
|
|
1032
|
-
current.rebuilt = { state: previous, level: depths[path[position - 1]] };
|
|
1033
|
-
const successor = findSuccessorWithFingerprint(previous, path[position]);
|
|
1034
|
-
current.rebuilt = rebuilt;
|
|
1035
|
-
if (!successor) throw new TlaEvaluationError(nextFailure);
|
|
1036
|
-
steps.push(successor);
|
|
1037
|
-
}
|
|
1038
|
-
return steps;
|
|
1039
|
-
};
|
|
1040
|
-
const getTrace = (index: number, lastSuccessor?: Successor) => {
|
|
1041
|
-
const path: number[] = [];
|
|
1042
|
-
for (let position = index; position !== -1; position = parents[position]) {
|
|
1043
|
-
path.unshift(position);
|
|
1044
|
-
}
|
|
1045
|
-
const steps =
|
|
1046
|
-
isReducing && path.length > 1
|
|
1047
|
-
? getPathStates(path, INITIAL_RECOVERY_FAILURE)
|
|
1048
|
-
: path.map((position) => ({ state: states[position], action: actions[position] }));
|
|
1049
|
-
if (!lastSuccessor) return toTrace(steps, path);
|
|
1050
|
-
const action = isReducing
|
|
1051
|
-
? findTraceSuccessor(states[index], (successor) =>
|
|
1052
|
-
isSameState(successor.state, lastSuccessor.state),
|
|
1053
|
-
)?.action
|
|
1054
|
-
: lastSuccessor.action;
|
|
1055
|
-
return toTrace([...steps, { state: lastSuccessor.state, action }], path, { known: 2 });
|
|
1056
|
-
};
|
|
1057
|
-
// Deviation from TLC: TLCTrace#printTrace prints a lone initial state without the alias.
|
|
1058
|
-
const getStateTrace = (index: number): Behavior =>
|
|
1059
|
-
parents[index] === -1
|
|
1060
|
-
? {
|
|
1061
|
-
trace: [
|
|
1062
|
-
{
|
|
1063
|
-
action: undefined,
|
|
1064
|
-
label: undefined,
|
|
1065
|
-
state:
|
|
1066
|
-
config.alias === undefined
|
|
1067
|
-
? toRecord(states[index])
|
|
1068
|
-
: getAliasState(
|
|
1069
|
-
config.alias,
|
|
1070
|
-
[{ state: states[index], action: undefined }],
|
|
1071
|
-
0,
|
|
1072
|
-
undefined,
|
|
1073
|
-
),
|
|
1074
|
-
},
|
|
1075
|
-
],
|
|
1076
|
-
traceOutput: is174 ? [] : captureOutput(getSpecInitialStates).lines,
|
|
1077
|
-
}
|
|
1078
|
-
: getTrace(index);
|
|
1079
765
|
const isUnfingerprintable = (state: Value[]) => {
|
|
1080
766
|
try {
|
|
1081
767
|
return getFingerprintState(state).some((value) => getFingerprintError(value) !== undefined);
|
|
@@ -1084,31 +770,6 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1084
770
|
return true;
|
|
1085
771
|
}
|
|
1086
772
|
};
|
|
1087
|
-
const getFailedTrace = (index: number, successor: Successor): Behavior => ({
|
|
1088
|
-
trace: getTrace(index, successor).trace,
|
|
1089
|
-
});
|
|
1090
|
-
const getFailureExitCode = (error: TlaEvaluationError, failureOptions: FailureOptions) => {
|
|
1091
|
-
if (
|
|
1092
|
-
failureOptions.isInitial &&
|
|
1093
|
-
!failureOptions.callStack &&
|
|
1094
|
-
!failureOptions.fingerprint &&
|
|
1095
|
-
is174
|
|
1096
|
-
) {
|
|
1097
|
-
return EXIT_STATUS.success;
|
|
1098
|
-
}
|
|
1099
|
-
if (!failureOptions.callStack) {
|
|
1100
|
-
return failureOptions.isInitial ? getInitialExitCode(error) : getErrorExitCode(error);
|
|
1101
|
-
}
|
|
1102
|
-
if (failureOptions.isCallStackFirst) return getErrorExitCode(error);
|
|
1103
|
-
if (failureOptions.isLiveCallStack) {
|
|
1104
|
-
return (
|
|
1105
|
-
getExitCode(error) ?? (error instanceof TlaModuleError ? error.exitCode : EXIT_STATUS.error)
|
|
1106
|
-
);
|
|
1107
|
-
}
|
|
1108
|
-
return failureOptions.isInitial || failureOptions.fingerprint
|
|
1109
|
-
? EXIT_STATUS.specEvaluationFailure
|
|
1110
|
-
: getReplayExitCode(failureOptions.replayError ?? error);
|
|
1111
|
-
};
|
|
1112
773
|
const createFailureResult = (
|
|
1113
774
|
failed: unknown,
|
|
1114
775
|
behavior: Behavior,
|
|
@@ -1124,7 +785,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1124
785
|
const traceOutput = [...(behavior.traceOutput ?? []), ...(checked?.lines ?? [])];
|
|
1125
786
|
return {
|
|
1126
787
|
...createResult("error", undefined, {
|
|
1127
|
-
...getFailureMessage(
|
|
788
|
+
...getFailureMessage(
|
|
789
|
+
error,
|
|
790
|
+
failureOptions.phase !== undefined && failureOptions.phase !== "initial",
|
|
791
|
+
),
|
|
1128
792
|
...behavior,
|
|
1129
793
|
...(traceOutput.length > 0 && { traceOutput }),
|
|
1130
794
|
...(postcondition && { postcondition }),
|
|
@@ -1132,9 +796,9 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1132
796
|
failureOptions.initialState && !(error instanceof TlaModuleError)
|
|
1133
797
|
? toRecord(failureOptions.initialState)
|
|
1134
798
|
: undefined,
|
|
1135
|
-
exitCode: getFailureExitCode(error, failureOptions),
|
|
799
|
+
exitCode: getFailureExitCode(error, failureOptions, is174),
|
|
1136
800
|
callStack: failureOptions.callStack,
|
|
1137
|
-
...(failureOptions.
|
|
801
|
+
...(failureOptions.phase === "liveness" && { isCallStackFirst: true }),
|
|
1138
802
|
...(failureOptions.fingerprint && { fingerprint: failureOptions.fingerprint }),
|
|
1139
803
|
...(failureOptions.traceFailure && { traceFailure: failureOptions.traceFailure }),
|
|
1140
804
|
}),
|
|
@@ -1143,9 +807,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1143
807
|
};
|
|
1144
808
|
const reportIncompleteSuccessor = (index: number, error: TlaIncompleteSuccessorError) => {
|
|
1145
809
|
runtime.generatedStates++;
|
|
1146
|
-
const actions = getSpecNextActions();
|
|
1147
810
|
const named =
|
|
1148
|
-
|
|
811
|
+
nextActions.length === 1
|
|
812
|
+
? nextActions
|
|
813
|
+
: nextActions.filter((item) => item.name === error.action);
|
|
1149
814
|
const action =
|
|
1150
815
|
named.length === 1
|
|
1151
816
|
? named[0]
|
|
@@ -1157,12 +822,12 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1157
822
|
const message = getIncompleteSuccessorMessage(
|
|
1158
823
|
error.variables,
|
|
1159
824
|
error.action,
|
|
1160
|
-
|
|
825
|
+
nextActions.length,
|
|
1161
826
|
options.version,
|
|
1162
827
|
);
|
|
1163
828
|
const undefinedValue = createModelValue("null");
|
|
1164
829
|
const partial = error.state.map((value) => value ?? undefinedValue);
|
|
1165
|
-
const failure = createFailureResult(error, getStateTrace(index));
|
|
830
|
+
const failure = createFailureResult(error, traces.getStateTrace(index));
|
|
1166
831
|
return withOutDegrees({
|
|
1167
832
|
...failure,
|
|
1168
833
|
failure: failure.failure && {
|
|
@@ -1182,65 +847,12 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1182
847
|
},
|
|
1183
848
|
});
|
|
1184
849
|
};
|
|
1185
|
-
const getPathSteps = (path: number[], loopStart?: number) => {
|
|
1186
|
-
const steps = getPathStates(path, NEXT_RECOVERY_FAILURE);
|
|
1187
|
-
const lastState = steps[steps.length - 1].state;
|
|
1188
|
-
const isClosed =
|
|
1189
|
-
!isReducing ||
|
|
1190
|
-
loopStart === undefined ||
|
|
1191
|
-
loopStart === path.length - 1 ||
|
|
1192
|
-
findSuccessorWithFingerprint(lastState, path[loopStart]) !== undefined;
|
|
1193
|
-
if (!isClosed) throw new TlaEvaluationError(NEXT_RECOVERY_FAILURE);
|
|
1194
|
-
return steps;
|
|
1195
|
-
};
|
|
1196
|
-
const getStateHash = (state: Value[]) => {
|
|
1197
|
-
let hash = 0x811c9dc5;
|
|
1198
|
-
for (let index = 0; index < state.length; index++)
|
|
1199
|
-
hash = combineHash(hash, getValueHash(state[index]));
|
|
1200
|
-
return hash & 0x3fffffff;
|
|
1201
|
-
};
|
|
1202
850
|
const fingerprintModelState = (state: Value[]) => {
|
|
1203
851
|
for (const value of state) {
|
|
1204
852
|
const error = getFingerprintError(value);
|
|
1205
853
|
if (error) throw error;
|
|
1206
854
|
}
|
|
1207
855
|
};
|
|
1208
|
-
const isSameState = (stored: Value[], state: Value[]) => {
|
|
1209
|
-
for (let position = 0; position < state.length; position++) {
|
|
1210
|
-
if (!isSameValue(stored[position], state[position])) return false;
|
|
1211
|
-
}
|
|
1212
|
-
return true;
|
|
1213
|
-
};
|
|
1214
|
-
const getSlot = (hash: number) => (Math.imul(hash, 0x9e3779b1) >>> seenStates.shift) << 1;
|
|
1215
|
-
const findStateIndex = (hash: number, state: Value[]) => {
|
|
1216
|
-
const mask = seenStates.slots.length - 1;
|
|
1217
|
-
for (let slot = getSlot(hash); ; slot = (slot + 2) & mask) {
|
|
1218
|
-
const entry = seenStates.slots[slot + 1];
|
|
1219
|
-
if (entry === 0) return -1;
|
|
1220
|
-
if (seenStates.slots[slot] === hash && isSameState(fingerprintStates[entry - 1], state)) {
|
|
1221
|
-
return entry - 1;
|
|
1222
|
-
}
|
|
1223
|
-
}
|
|
1224
|
-
};
|
|
1225
|
-
const insertSeen = (hash: number, entry: number) => {
|
|
1226
|
-
const mask = seenStates.slots.length - 1;
|
|
1227
|
-
let slot = getSlot(hash);
|
|
1228
|
-
while (seenStates.slots[slot + 1] !== 0) slot = (slot + 2) & mask;
|
|
1229
|
-
seenStates.slots[slot] = hash;
|
|
1230
|
-
seenStates.slots[slot + 1] = entry;
|
|
1231
|
-
};
|
|
1232
|
-
const markSeen = (hash: number, index: number) => {
|
|
1233
|
-
seenStates.size++;
|
|
1234
|
-
if (seenStates.size * 4 > seenStates.slots.length) {
|
|
1235
|
-
const slots = seenStates.slots;
|
|
1236
|
-
seenStates.slots = new Int32Array(slots.length * 2);
|
|
1237
|
-
seenStates.shift--;
|
|
1238
|
-
for (let slot = 0; slot < slots.length; slot += 2) {
|
|
1239
|
-
if (slots[slot + 1] !== 0) insertSeen(slots[slot], slots[slot + 1]);
|
|
1240
|
-
}
|
|
1241
|
-
}
|
|
1242
|
-
insertSeen(hash, index + 1);
|
|
1243
|
-
};
|
|
1244
856
|
let unstoredFingerprint: Value[] | undefined;
|
|
1245
857
|
const countDistinctState = (depth: number) => {
|
|
1246
858
|
runtime.distinctStates = states.length + 1;
|
|
@@ -1269,11 +881,33 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1269
881
|
livenessSource: -1,
|
|
1270
882
|
rebuilt: undefined,
|
|
1271
883
|
};
|
|
884
|
+
const traces = createTraceBuilder({
|
|
885
|
+
config,
|
|
886
|
+
options,
|
|
887
|
+
environment,
|
|
888
|
+
search,
|
|
889
|
+
nextActions,
|
|
890
|
+
current,
|
|
891
|
+
states,
|
|
892
|
+
fingerprintStates,
|
|
893
|
+
parents,
|
|
894
|
+
actions,
|
|
895
|
+
depths,
|
|
896
|
+
tracedSteps,
|
|
897
|
+
captureOutput,
|
|
898
|
+
getInitialStates: getSpecInitialStates,
|
|
899
|
+
findSuccessorAction: (state, isMatch) =>
|
|
900
|
+
coverage
|
|
901
|
+
? coverageActions.find((item) => getCoveredSuccessors(item, state).some(isMatch))
|
|
902
|
+
: nextActions.find((item) =>
|
|
903
|
+
getSuccessors(item.expression, state, environment, item.scope).some(isMatch),
|
|
904
|
+
),
|
|
905
|
+
});
|
|
1272
906
|
const getPath = (index: number): Value[][] =>
|
|
1273
907
|
index === -1 ? [] : [...getPath(parents[index]), states[index]];
|
|
1274
908
|
runtime.isSeen = (state) => {
|
|
1275
909
|
const fingerprintState = getFingerprintState(state);
|
|
1276
|
-
return findStateIndex(getStateHash(fingerprintState), fingerprintState) !== -1;
|
|
910
|
+
return findStateIndex(seenStates, getStateHash(fingerprintState), fingerprintState) !== -1;
|
|
1277
911
|
};
|
|
1278
912
|
runtime.getBehavior = (state) => {
|
|
1279
913
|
const index = state === current.candidate ? -1 : states.indexOf(state);
|
|
@@ -1309,7 +943,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1309
943
|
formatState(
|
|
1310
944
|
config.alias === undefined
|
|
1311
945
|
? toRecord(state)
|
|
1312
|
-
: evaluateAlias(config.alias, state, undefined),
|
|
946
|
+
: search.evaluateAlias(config.alias, state, undefined, options.isTool ?? false),
|
|
1313
947
|
),
|
|
1314
948
|
getText: () => formatState(toRecord(state)),
|
|
1315
949
|
});
|
|
@@ -1328,7 +962,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1328
962
|
fingerprintModelState(fingerprintState);
|
|
1329
963
|
state.forEach(markFingerprinted);
|
|
1330
964
|
}
|
|
1331
|
-
const isSeen = isInModel && findStateIndex(hash, fingerprintState) !== -1;
|
|
965
|
+
const isSeen = isInModel && findStateIndex(seenStates, hash, fingerprintState) !== -1;
|
|
1332
966
|
if (isSeen) return undefined;
|
|
1333
967
|
unstoredFingerprint = isInModel ? fingerprintState : undefined;
|
|
1334
968
|
if (isInModel) {
|
|
@@ -1341,7 +975,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1341
975
|
search.getViolatedInvariants(state).forEach((invariant) =>
|
|
1342
976
|
reportContinuedViolation("invariant-violation", {
|
|
1343
977
|
name: invariant.name,
|
|
1344
|
-
...toTrace([{ action: undefined, state }], []),
|
|
978
|
+
...traces.toTrace([{ action: undefined, state }], []),
|
|
1345
979
|
}),
|
|
1346
980
|
);
|
|
1347
981
|
}
|
|
@@ -1349,21 +983,37 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1349
983
|
if (violated) {
|
|
1350
984
|
return reportViolation("invariant-violation", {
|
|
1351
985
|
name: violated.name,
|
|
1352
|
-
...toTrace([{ action: undefined, state }], []),
|
|
986
|
+
...traces.toTrace([{ action: undefined, state }], []),
|
|
1353
987
|
});
|
|
1354
988
|
}
|
|
1355
989
|
const failedPredicate = search.findFailedInitialPredicate(state);
|
|
1356
990
|
if (failedPredicate) {
|
|
1357
991
|
return reportViolation("liveness-violation", {
|
|
1358
992
|
name: failedPredicate.name,
|
|
1359
|
-
...toTrace([{ action: undefined, state }], []),
|
|
993
|
+
...traces.toTrace([{ action: undefined, state }], []),
|
|
1360
994
|
});
|
|
1361
995
|
}
|
|
1362
996
|
if (!isInModel) return undefined;
|
|
1363
|
-
|
|
997
|
+
markSeenState(seenStates, hash, states.length);
|
|
1364
998
|
addState(state, fingerprintState, -1, undefined);
|
|
1365
999
|
return undefined;
|
|
1366
1000
|
};
|
|
1001
|
+
// Looks a successor up, where the constraints keep it in the model, as the search does before it
|
|
1002
|
+
// checks the successor.
|
|
1003
|
+
const lookUpSuccessor = (state: Value[], successor: Successor) => {
|
|
1004
|
+
const fingerprintState = getFingerprintState(successor.state);
|
|
1005
|
+
const hash = getStateHash(fingerprintState);
|
|
1006
|
+
const foundIndex = findStateIndex(seenStates, hash, fingerprintState);
|
|
1007
|
+
const isStateInModel = search.satisfiesConstraints(successor.state, state);
|
|
1008
|
+
if (isStateInModel) search.trackStatePossible(successor.state);
|
|
1009
|
+
const isInModel = isStateInModel && search.satisfiesActionConstraints(state, successor.state);
|
|
1010
|
+
if (isInModel) {
|
|
1011
|
+
search.trackActionPossible(state, successor.state);
|
|
1012
|
+
fingerprintModelState(fingerprintState);
|
|
1013
|
+
successor.state.forEach(markFingerprinted);
|
|
1014
|
+
}
|
|
1015
|
+
return { fingerprintState, hash, isInModel, existing: isInModel ? foundIndex : -1 };
|
|
1016
|
+
};
|
|
1367
1017
|
const visitSuccessor = (
|
|
1368
1018
|
index: number,
|
|
1369
1019
|
successor: Successor,
|
|
@@ -1376,27 +1026,16 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1376
1026
|
current.candidate = successor.state;
|
|
1377
1027
|
current.candidateLevel = depths[index] + 1;
|
|
1378
1028
|
if (isCanonicalizedFirst) canonicalizeState(successor.state);
|
|
1379
|
-
const
|
|
1380
|
-
|
|
1381
|
-
const foundIndex = findStateIndex(hash, fingerprintState);
|
|
1382
|
-
const isStateInModel = search.satisfiesConstraints(successor.state, state);
|
|
1383
|
-
if (isStateInModel) search.trackStatePossible(successor.state);
|
|
1384
|
-
const isInModel = isStateInModel && search.satisfiesActionConstraints(state, successor.state);
|
|
1385
|
-
if (isInModel) {
|
|
1386
|
-
search.trackActionPossible(state, successor.state);
|
|
1387
|
-
fingerprintModelState(fingerprintState);
|
|
1388
|
-
successor.state.forEach(markFingerprinted);
|
|
1389
|
-
}
|
|
1390
|
-
const existing = isInModel ? foundIndex : -1;
|
|
1391
|
-
if (source && isInModel) {
|
|
1029
|
+
const found = lookUpSuccessor(state, successor);
|
|
1030
|
+
if (source && found.isInModel) {
|
|
1392
1031
|
stateWriter?.writeSuccessor(
|
|
1393
1032
|
source,
|
|
1394
1033
|
getGraphState(successor.state, depths[index] + 1),
|
|
1395
|
-
existing !== -1,
|
|
1034
|
+
found.existing !== -1,
|
|
1396
1035
|
action && getGraphAction(action),
|
|
1397
1036
|
);
|
|
1398
1037
|
}
|
|
1399
|
-
if (source && !isInModel && options.dump?.constrained) {
|
|
1038
|
+
if (source && !found.isInModel && options.dump?.constrained) {
|
|
1400
1039
|
const excluded = getGraphState(successor.state, depths[index] + 1);
|
|
1401
1040
|
search
|
|
1402
1041
|
.getExcludingConstraints(state, successor.state)
|
|
@@ -1409,23 +1048,23 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1409
1048
|
),
|
|
1410
1049
|
);
|
|
1411
1050
|
}
|
|
1412
|
-
if (existing !== -1 && liveness) {
|
|
1413
|
-
const stored = states[existing];
|
|
1051
|
+
if (found.existing !== -1 && liveness) {
|
|
1052
|
+
const stored = states[found.existing];
|
|
1414
1053
|
const isStored = stored.every((value, position) => value === successor.state[position]);
|
|
1415
|
-
liveSuccessors.push({ index: existing, state: isStored ? stored : successor.state });
|
|
1054
|
+
liveSuccessors.push({ index: found.existing, state: isStored ? stored : successor.state });
|
|
1416
1055
|
}
|
|
1417
|
-
const isNew = isInModel && existing === -1;
|
|
1056
|
+
const isNew = found.isInModel && found.existing === -1;
|
|
1418
1057
|
if (isNew && liveness) liveSuccessors.push({ index: states.length, state: successor.state });
|
|
1419
|
-
unstoredFingerprint = isNew ? fingerprintState : undefined;
|
|
1058
|
+
unstoredFingerprint = isNew ? found.fingerprintState : undefined;
|
|
1420
1059
|
if (isNew) {
|
|
1421
1060
|
countDistinctState(depths[index] + 1);
|
|
1422
1061
|
newStateCount++;
|
|
1423
1062
|
if (coverage) coverage.secondary[coveredNode]++;
|
|
1424
1063
|
}
|
|
1425
|
-
if (existing === -1) {
|
|
1064
|
+
if (found.existing === -1) {
|
|
1426
1065
|
try {
|
|
1427
1066
|
const violated = search.findViolatedInvariant(successor.state, state);
|
|
1428
|
-
const violation = violated && { name: violated.name, ...getTrace(index, successor) };
|
|
1067
|
+
const violation = violated && { name: violated.name, ...traces.getTrace(index, successor) };
|
|
1429
1068
|
if (violation && !options.isContinued) {
|
|
1430
1069
|
return withOutDegrees(reportViolation("invariant-violation", violation));
|
|
1431
1070
|
}
|
|
@@ -1435,7 +1074,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1435
1074
|
const replay = captureOutput(() => replayNext(index));
|
|
1436
1075
|
return createFailureResult(
|
|
1437
1076
|
error,
|
|
1438
|
-
appendTraceOutput(getFailedTrace(index, successor), replay.lines),
|
|
1077
|
+
appendTraceOutput(traces.getFailedTrace(index, successor), replay.lines),
|
|
1439
1078
|
replay.result ?? { outDegrees: getFailureOutDegrees() },
|
|
1440
1079
|
);
|
|
1441
1080
|
}
|
|
@@ -1443,7 +1082,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1443
1082
|
const violatedProperty = search.findViolatedActionProperty(state, successor.state);
|
|
1444
1083
|
const propertyViolation = violatedProperty && {
|
|
1445
1084
|
name: violatedProperty.name,
|
|
1446
|
-
...getTrace(index, successor),
|
|
1085
|
+
...traces.getTrace(index, successor),
|
|
1447
1086
|
};
|
|
1448
1087
|
if (propertyViolation && !options.isContinued) {
|
|
1449
1088
|
return withOutDegrees(reportViolation("liveness-violation", propertyViolation));
|
|
@@ -1452,8 +1091,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1452
1091
|
if (!isNew) return undefined;
|
|
1453
1092
|
if (coverage) countCoverageVariables(coverage, successor.state);
|
|
1454
1093
|
if (!isCanonicalizedFirst) canonicalizeState(successor.state);
|
|
1455
|
-
|
|
1456
|
-
addState(successor.state, fingerprintState, index, successor.action);
|
|
1094
|
+
markSeenState(seenStates, found.hash, states.length);
|
|
1095
|
+
addState(successor.state, found.fingerprintState, index, successor.action);
|
|
1457
1096
|
runtime.queueSize++;
|
|
1458
1097
|
return undefined;
|
|
1459
1098
|
};
|
|
@@ -1466,6 +1105,57 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1466
1105
|
const assumptionViolation = findViolatedAssumption();
|
|
1467
1106
|
if (assumptionViolation) return createResult("assumption-violation", assumptionViolation);
|
|
1468
1107
|
options.onProgress?.({ kind: "initial-states-started" });
|
|
1108
|
+
const typedChecks =
|
|
1109
|
+
!options.isContinued &&
|
|
1110
|
+
options.dump === undefined &&
|
|
1111
|
+
// A set of small integers on the tier is a 31-bit mask, which a lower bound could overflow.
|
|
1112
|
+
options.maxSetSize === undefined &&
|
|
1113
|
+
!hasPostconditions
|
|
1114
|
+
? search.getTypedChecks(liveness?.solutions)
|
|
1115
|
+
: undefined;
|
|
1116
|
+
const typed =
|
|
1117
|
+
typedChecks &&
|
|
1118
|
+
runTypedSearch(environment, {
|
|
1119
|
+
...typedChecks,
|
|
1120
|
+
isDeadlockChecked: config.checkDeadlock,
|
|
1121
|
+
isFingerprinted: !options.isFingerprintDistanceSkipped,
|
|
1122
|
+
livenessCheck: options.livenessCheck ?? "default",
|
|
1123
|
+
});
|
|
1124
|
+
if (typed && !typed.deadlock && !typed.violation && !typed.lasso) {
|
|
1125
|
+
for (let count = 2; count < typed.initialStates.generated; count *= 2) {
|
|
1126
|
+
reportInitialStatesProgress(count, options.onProgress);
|
|
1127
|
+
}
|
|
1128
|
+
options.onProgress?.({ kind: "initial-states-computed", initialStates: typed.initialStates });
|
|
1129
|
+
const statistics = {
|
|
1130
|
+
...createResult("success"),
|
|
1131
|
+
generatedStates: typed.generatedStates,
|
|
1132
|
+
distinctStates: typed.distinctStates,
|
|
1133
|
+
queuedStates: 0,
|
|
1134
|
+
depth: typed.generatedStates === 0 ? 0 : Math.max(typed.depth, 1),
|
|
1135
|
+
initialStates: typed.initialStates,
|
|
1136
|
+
};
|
|
1137
|
+
if (liveness && options.livenessCheck !== "off") {
|
|
1138
|
+
options.onProgress?.({
|
|
1139
|
+
kind: "liveness-started",
|
|
1140
|
+
branches: liveness.branches,
|
|
1141
|
+
isComplete: true,
|
|
1142
|
+
states: typed.distinctStates,
|
|
1143
|
+
statistics,
|
|
1144
|
+
});
|
|
1145
|
+
options.onProgress?.({ kind: "liveness-finished" });
|
|
1146
|
+
}
|
|
1147
|
+
return {
|
|
1148
|
+
...statistics,
|
|
1149
|
+
outDegrees: typed.outDegrees,
|
|
1150
|
+
fingerprintDistance: options.isFingerprintDistanceSkipped
|
|
1151
|
+
? undefined
|
|
1152
|
+
: getFingerprintDistance(
|
|
1153
|
+
typed.distinctStates,
|
|
1154
|
+
typed.generatedStates,
|
|
1155
|
+
typed.forEachFingerprintRun,
|
|
1156
|
+
),
|
|
1157
|
+
};
|
|
1158
|
+
}
|
|
1469
1159
|
if (spec.init !== undefined) {
|
|
1470
1160
|
let overflowState: Value[] | undefined;
|
|
1471
1161
|
const reportInitialFailure = (error: unknown, state: Value[]) => {
|
|
@@ -1473,7 +1163,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1473
1163
|
return createFailureResult(
|
|
1474
1164
|
error,
|
|
1475
1165
|
{ trace: [], traceOutput: replay.lines },
|
|
1476
|
-
{ initialState: state, ...replay.result,
|
|
1166
|
+
{ initialState: state, ...replay.result, phase: "initial" },
|
|
1477
1167
|
);
|
|
1478
1168
|
};
|
|
1479
1169
|
try {
|
|
@@ -1500,9 +1190,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1500
1190
|
(state) => {
|
|
1501
1191
|
if (onInitialState(state)) throw STOP_WALK;
|
|
1502
1192
|
},
|
|
1503
|
-
|
|
1504
|
-
throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
|
|
1505
|
-
},
|
|
1193
|
+
rejectIncompleteInitialState,
|
|
1506
1194
|
);
|
|
1507
1195
|
} catch (error) {
|
|
1508
1196
|
if (error !== STOP_WALK) throw error;
|
|
@@ -1529,7 +1217,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1529
1217
|
return createFailureResult(
|
|
1530
1218
|
error,
|
|
1531
1219
|
{ trace: [], traceOutput: replay.lines },
|
|
1532
|
-
{ ...replay.result,
|
|
1220
|
+
{ ...replay.result, phase: "initial" },
|
|
1533
1221
|
);
|
|
1534
1222
|
}
|
|
1535
1223
|
}
|
|
@@ -1589,7 +1277,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1589
1277
|
);
|
|
1590
1278
|
}
|
|
1591
1279
|
let isStopped = false;
|
|
1592
|
-
return
|
|
1280
|
+
return nextActions.reduce((count, action) => {
|
|
1593
1281
|
if (isStopped) return count;
|
|
1594
1282
|
return (
|
|
1595
1283
|
count +
|
|
@@ -1610,7 +1298,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1610
1298
|
};
|
|
1611
1299
|
const getLiveCallStack = (index: number, liveSuccessors: LiveSuccessor[]) => {
|
|
1612
1300
|
if (!liveness || is174) return undefined;
|
|
1613
|
-
const replay = getReplayFailure((tracing) =>
|
|
1301
|
+
const replay = getReplayFailure(environment, (tracing) =>
|
|
1614
1302
|
liveness.addState(index, states[index], liveSuccessors, tracing),
|
|
1615
1303
|
);
|
|
1616
1304
|
return replay?.callStack.length && !replay.fingerprint ? replay.callStack : undefined;
|
|
@@ -1627,14 +1315,14 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1627
1315
|
const replayFailedNext = (index: number, liveSuccessors: LiveSuccessor[]) => {
|
|
1628
1316
|
const live = captureOutput(() => addFailedLiveState(index, liveSuccessors));
|
|
1629
1317
|
if (live.result) {
|
|
1630
|
-
const result = { callStack: live.result
|
|
1318
|
+
const result: FailureOptions = { phase: "behavior-graph", callStack: live.result };
|
|
1631
1319
|
return { result, lines: live.lines };
|
|
1632
1320
|
}
|
|
1633
1321
|
const replay = captureOutput(() => replayNext(index));
|
|
1634
1322
|
return { result: replay.result, lines: [...live.lines, ...replay.lines] };
|
|
1635
1323
|
};
|
|
1636
1324
|
const reportNextStateOverflow = (index: number) =>
|
|
1637
|
-
createFailureResult(createStackOverflowError(), getStateTrace(index), {
|
|
1325
|
+
createFailureResult(createStackOverflowError(), traces.getStateTrace(index), { phase: "next" });
|
|
1638
1326
|
const reportNextStateFailure = (
|
|
1639
1327
|
error: unknown,
|
|
1640
1328
|
index: number,
|
|
@@ -1644,8 +1332,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1644
1332
|
const replay = replayFailedNext(index, liveSuccessors);
|
|
1645
1333
|
return createFailureResult(
|
|
1646
1334
|
withNextStateExitCode(error),
|
|
1647
|
-
appendTraceOutput(getStateTrace(index), replay.lines),
|
|
1648
|
-
{
|
|
1335
|
+
appendTraceOutput(traces.getStateTrace(index), replay.lines),
|
|
1336
|
+
{ phase: "next", ...replay.result },
|
|
1649
1337
|
);
|
|
1650
1338
|
};
|
|
1651
1339
|
const expandState = (index: number, liveSuccessors: LiveSuccessor[]) => {
|
|
@@ -1676,7 +1364,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1676
1364
|
outcome = createFailureResult(
|
|
1677
1365
|
new TlaEvaluationError(`${getWrappedException(error)}${error.message}`, error),
|
|
1678
1366
|
appendTraceOutput({ trace: [] }, replay.lines),
|
|
1679
|
-
{
|
|
1367
|
+
{ phase: "next", ...replay.result },
|
|
1680
1368
|
);
|
|
1681
1369
|
return true;
|
|
1682
1370
|
}
|
|
@@ -1693,10 +1381,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1693
1381
|
outcome = createFailureResult(
|
|
1694
1382
|
error,
|
|
1695
1383
|
appendTraceOutput(
|
|
1696
|
-
traceFailure ? getStateTrace(index) : getFailedTrace(index, successor),
|
|
1384
|
+
traceFailure ? traces.getStateTrace(index) : traces.getFailedTrace(index, successor),
|
|
1697
1385
|
replay.lines,
|
|
1698
1386
|
),
|
|
1699
|
-
{
|
|
1387
|
+
{ phase: "next", ...replay.result, traceFailure },
|
|
1700
1388
|
);
|
|
1701
1389
|
}
|
|
1702
1390
|
return outcome !== undefined;
|
|
@@ -1718,7 +1406,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1718
1406
|
}
|
|
1719
1407
|
const accepted = liveness?.addState(index, state, liveSuccessors);
|
|
1720
1408
|
if (!liveness || !accepted) return undefined;
|
|
1721
|
-
const steps = getPathSteps(accepted);
|
|
1409
|
+
const steps = traces.getPathSteps(accepted);
|
|
1722
1410
|
const properties = getViolatedProperties(
|
|
1723
1411
|
liveness,
|
|
1724
1412
|
steps.map((step) => step.state),
|
|
@@ -1727,11 +1415,14 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1727
1415
|
return reportViolation("property-violation", {
|
|
1728
1416
|
name: properties[0],
|
|
1729
1417
|
properties,
|
|
1730
|
-
...toTrace(steps, accepted, { known: 0 }),
|
|
1418
|
+
...traces.toTrace(steps, accepted, { known: 0 }),
|
|
1731
1419
|
});
|
|
1732
1420
|
};
|
|
1733
1421
|
if (successorCount === 0 && config.checkDeadlock) {
|
|
1734
|
-
const deadlock = reportViolation("deadlock", {
|
|
1422
|
+
const deadlock = reportViolation("deadlock", {
|
|
1423
|
+
name: "deadlock",
|
|
1424
|
+
...traces.getStateTrace(index),
|
|
1425
|
+
});
|
|
1735
1426
|
const live = captureOutput(() => {
|
|
1736
1427
|
try {
|
|
1737
1428
|
return { additional: addLiveState()?.violation };
|
|
@@ -1764,14 +1455,13 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1764
1455
|
{ outDegrees: getFailureOutDegrees() },
|
|
1765
1456
|
);
|
|
1766
1457
|
}
|
|
1767
|
-
const replay = getReplayFailure((tracing) =>
|
|
1458
|
+
const replay = getReplayFailure(environment, (tracing) =>
|
|
1768
1459
|
liveness?.addState(index, state, liveSuccessors, tracing),
|
|
1769
1460
|
);
|
|
1770
|
-
return createFailureResult(error, getStateTrace(index), {
|
|
1461
|
+
return createFailureResult(error, traces.getStateTrace(index), {
|
|
1771
1462
|
outDegrees: getFailureOutDegrees(),
|
|
1772
1463
|
callStack: replay?.callStack.length ? replay.callStack : undefined,
|
|
1773
|
-
|
|
1774
|
-
isCallStackFirst: true,
|
|
1464
|
+
phase: "liveness",
|
|
1775
1465
|
});
|
|
1776
1466
|
}
|
|
1777
1467
|
};
|
|
@@ -1795,8 +1485,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1795
1485
|
const reportLasso = (checker: LivenessChecker, lasso: Lasso) => {
|
|
1796
1486
|
const path = [...lasso.prefix, ...lasso.cycle];
|
|
1797
1487
|
const loopStart = lasso.prefix.length;
|
|
1798
|
-
const steps = getPathSteps(path, loopStart);
|
|
1799
|
-
const trace = toTrace(steps, path, { loopStart, known: 0 }).trace;
|
|
1488
|
+
const steps = traces.getPathSteps(path, loopStart);
|
|
1489
|
+
const trace = traces.toTrace(steps, path, { loopStart, known: 0 }).trace;
|
|
1800
1490
|
const properties = getViolatedProperties(
|
|
1801
1491
|
checker,
|
|
1802
1492
|
steps.map((step) => step.state),
|
|
@@ -1808,7 +1498,9 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1808
1498
|
const loop =
|
|
1809
1499
|
cycleStart === cycleEnd
|
|
1810
1500
|
? { result: undefined, lines: [] }
|
|
1811
|
-
: captureOutput(() =>
|
|
1501
|
+
: captureOutput(() =>
|
|
1502
|
+
traces.findStepAction(cycleEnd, lastState, states[cycleStart], false),
|
|
1503
|
+
);
|
|
1812
1504
|
const isStutteringWarned = cycleStart === cycleEnd && lasso.isCycleConstrained;
|
|
1813
1505
|
return reportViolation(
|
|
1814
1506
|
"liveness-violation",
|
|
@@ -1826,7 +1518,9 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1826
1518
|
? getStepAction(trace[trace.length - 1])
|
|
1827
1519
|
: loop.result
|
|
1828
1520
|
? toActionValue(loop.result)
|
|
1829
|
-
: createActionRecord(
|
|
1521
|
+
: createActionRecord(
|
|
1522
|
+
traces.findSuccessorWithFingerprint(lastState, cycleStart)?.action,
|
|
1523
|
+
),
|
|
1830
1524
|
);
|
|
1831
1525
|
};
|
|
1832
1526
|
const isPeriodic = liveness !== undefined && (options.livenessCheck ?? "default") === "default";
|
|
@@ -1855,7 +1549,109 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1855
1549
|
periodic.time += performance.now() - now;
|
|
1856
1550
|
return lasso;
|
|
1857
1551
|
};
|
|
1858
|
-
|
|
1552
|
+
const adoptTypedSearch = (searched: TypedResult) => {
|
|
1553
|
+
runtime.generatedStates = searched.generatedStates;
|
|
1554
|
+
runtime.distinctStates = searched.distinctStates;
|
|
1555
|
+
runtime.queueSize = searched.queuedStates;
|
|
1556
|
+
runtime.diameter = searched.depth;
|
|
1557
|
+
searchDepth = searched.depth;
|
|
1558
|
+
outDegrees.splice(0, outDegrees.length, ...searched.outDegrees);
|
|
1559
|
+
newStateCount = 0;
|
|
1560
|
+
};
|
|
1561
|
+
// The tier found a state without successors, or a successor that violates an invariant or an
|
|
1562
|
+
// action property. The interpreter rebuilds the tier's path to it and reports it, as it would after
|
|
1563
|
+
// its own search.
|
|
1564
|
+
const path = typed?.deadlock ?? typed?.violation;
|
|
1565
|
+
const initialIndex = path ? states.findIndex((state) => path.isPathState(0, state)) : -1;
|
|
1566
|
+
if (typed && path && initialIndex !== -1) {
|
|
1567
|
+
const steps: { successor: Successor; action: SpecAction | undefined }[] = [];
|
|
1568
|
+
const getLastState = () => steps.at(-1)?.successor.state ?? states[initialIndex];
|
|
1569
|
+
for (let position = 1; position === steps.length + 1 && position < path.length; position++) {
|
|
1570
|
+
// The interpreter expands only the states it stores, which it has canonicalized.
|
|
1571
|
+
canonicalizeState(getLastState());
|
|
1572
|
+
forEachActionSuccessor(getLastState(), undefined, (successor, action) => {
|
|
1573
|
+
if (!path.isPathState(position, successor.state)) return false;
|
|
1574
|
+
steps.push({ successor, action });
|
|
1575
|
+
return true;
|
|
1576
|
+
});
|
|
1577
|
+
}
|
|
1578
|
+
const isRebuilt = steps.length === path.length - 1;
|
|
1579
|
+
const violating = typed.violation && isRebuilt ? steps.pop() : undefined;
|
|
1580
|
+
if (violating && isCanonicalizedFirst) canonicalizeState(violating.successor.state);
|
|
1581
|
+
const violatedInvariant =
|
|
1582
|
+
violating && search.findViolatedInvariant(violating.successor.state, getLastState());
|
|
1583
|
+
const violatedProperty =
|
|
1584
|
+
violating &&
|
|
1585
|
+
!violatedInvariant &&
|
|
1586
|
+
search.findViolatedActionProperty(getLastState(), violating.successor.state);
|
|
1587
|
+
const violated = violatedInvariant ?? violatedProperty;
|
|
1588
|
+
const isDeadlocked =
|
|
1589
|
+
typed.deadlock !== undefined &&
|
|
1590
|
+
isRebuilt &&
|
|
1591
|
+
forEachActionSuccessor(getLastState(), undefined, () => true) === 0;
|
|
1592
|
+
if (isDeadlocked || violated) {
|
|
1593
|
+
const parent = { index: initialIndex };
|
|
1594
|
+
for (const step of steps) {
|
|
1595
|
+
visitSuccessor(parent.index, step.successor, [], undefined, step.action);
|
|
1596
|
+
parent.index = states.length - 1;
|
|
1597
|
+
}
|
|
1598
|
+
adoptTypedSearch(typed);
|
|
1599
|
+
Object.assign(current, { index: parent.index, candidate: undefined, isExpanding: true });
|
|
1600
|
+
if (violating && violated) {
|
|
1601
|
+
lookUpSuccessor(states[parent.index], violating.successor);
|
|
1602
|
+
current.candidate = violating.successor.state;
|
|
1603
|
+
current.candidateLevel = depths[parent.index] + 1;
|
|
1604
|
+
return withOutDegrees(
|
|
1605
|
+
reportViolation(violatedInvariant ? "invariant-violation" : "liveness-violation", {
|
|
1606
|
+
name: violated.name,
|
|
1607
|
+
...traces.getTrace(parent.index, violating.successor),
|
|
1608
|
+
}),
|
|
1609
|
+
);
|
|
1610
|
+
}
|
|
1611
|
+
const result = expandState(parent.index, []);
|
|
1612
|
+
if (result) return result;
|
|
1613
|
+
}
|
|
1614
|
+
}
|
|
1615
|
+
// The tier found a behavior that violates a temporal property after its whole search. The
|
|
1616
|
+
// interpreter stores the paths to the lasso's states and reports it, as it would after its own.
|
|
1617
|
+
const lassoSteps = new Map<number, { successor: Successor; action: SpecAction | undefined }>();
|
|
1618
|
+
for (const entry of typed?.lasso?.states ?? []) {
|
|
1619
|
+
const initial = entry.parent === -1 ? states.find(entry.isState) : undefined;
|
|
1620
|
+
if (initial) {
|
|
1621
|
+
lassoSteps.set(entry.index, {
|
|
1622
|
+
successor: { state: initial, action: undefined },
|
|
1623
|
+
action: undefined,
|
|
1624
|
+
});
|
|
1625
|
+
}
|
|
1626
|
+
const parent = lassoSteps.get(entry.parent)?.successor.state;
|
|
1627
|
+
if (!parent) continue;
|
|
1628
|
+
// The interpreter expands only the states it stores, which it has canonicalized.
|
|
1629
|
+
canonicalizeState(parent);
|
|
1630
|
+
forEachActionSuccessor(parent, undefined, (successor, action) => {
|
|
1631
|
+
if (!entry.isState(successor.state)) return false;
|
|
1632
|
+
lassoSteps.set(entry.index, { successor, action });
|
|
1633
|
+
return true;
|
|
1634
|
+
});
|
|
1635
|
+
}
|
|
1636
|
+
const lassoIndexes = new Map<number, number>();
|
|
1637
|
+
const typedLasso =
|
|
1638
|
+
typed?.lasso && lassoSteps.size === typed.lasso.states.length ? typed.lasso : undefined;
|
|
1639
|
+
typedLasso?.states.forEach((entry) => {
|
|
1640
|
+
const step = lassoSteps.get(entry.index);
|
|
1641
|
+
const parent = lassoIndexes.get(entry.parent);
|
|
1642
|
+
if (step && parent !== undefined)
|
|
1643
|
+
visitSuccessor(parent, step.successor, [], undefined, step.action);
|
|
1644
|
+
lassoIndexes.set(
|
|
1645
|
+
entry.index,
|
|
1646
|
+
parent === undefined ? states.findIndex(entry.isState) : states.length - 1,
|
|
1647
|
+
);
|
|
1648
|
+
});
|
|
1649
|
+
if (typed && typedLasso) adoptTypedSearch(typed);
|
|
1650
|
+
for (
|
|
1651
|
+
let index = typedLasso ? states.length : 0;
|
|
1652
|
+
index < states.length && !runtime.isStopped;
|
|
1653
|
+
index++
|
|
1654
|
+
) {
|
|
1859
1655
|
current.index = index;
|
|
1860
1656
|
current.candidate = undefined;
|
|
1861
1657
|
runtime.queueSize = states.length - index - 1;
|
|
@@ -1900,7 +1696,15 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1900
1696
|
statistics: createResult("success"),
|
|
1901
1697
|
});
|
|
1902
1698
|
}
|
|
1903
|
-
const
|
|
1699
|
+
const getLassoIndexes = (indexes: number[]) =>
|
|
1700
|
+
indexes.map((index) => lassoIndexes.get(index) ?? -1);
|
|
1701
|
+
const lasso = typedLasso
|
|
1702
|
+
? {
|
|
1703
|
+
prefix: getLassoIndexes(typedLasso.prefix),
|
|
1704
|
+
cycle: getLassoIndexes(typedLasso.cycle),
|
|
1705
|
+
isCycleConstrained: typedLasso.isCycleConstrained,
|
|
1706
|
+
}
|
|
1707
|
+
: finalLiveness?.findViolation();
|
|
1904
1708
|
if (finalLiveness && lasso) return reportLasso(finalLiveness, lasso);
|
|
1905
1709
|
|
|
1906
1710
|
if (finalLiveness) options.onProgress?.({ kind: "liveness-finished" });
|