tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.28c823e4b
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 +7 -0
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +3 -3
- package/dist/deciders.cjs +28 -28
- package/dist/deciders.js +52 -52
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +105 -10
- package/dist/index.d.ts +105 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +116 -36
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +4 -23
- package/src/bags.ts +99 -102
- package/src/builtins.ts +40 -78
- package/src/bundled-modules.ts +1 -8
- package/src/check.ts +564 -366
- package/src/cli/options.ts +10 -5
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +18 -11
- package/src/cli/tlapm.ts +0 -12
- package/src/cli/tlc-arguments.ts +640 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +525 -216
- package/src/cli/typescript.ts +0 -3
- package/src/cli/xml-exporter.ts +4 -16
- package/src/cli.ts +0 -1
- package/src/codegen.ts +191 -64
- package/src/config.ts +140 -109
- package/src/coverage.ts +837 -0
- package/src/dependencies.ts +6 -40
- package/src/dfid.ts +618 -0
- package/src/environment.ts +237 -119
- package/src/errors.ts +56 -56
- package/src/evaluate.ts +543 -341
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +10 -10
- package/src/index.ts +3 -0
- package/src/instances.ts +38 -31
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +255 -139
- package/src/levels.ts +8 -17
- package/src/lexer.ts +80 -100
- package/src/liveness-checker.ts +77 -117
- package/src/liveness.ts +106 -62
- package/src/obligations/action.ts +4 -28
- package/src/obligations/anonymize.ts +84 -80
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +2 -19
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +1 -11
- package/src/obligations/index.ts +0 -11
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +1 -15
- package/src/obligations/normalize.ts +5 -24
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +1 -10
- package/src/obligations/printer.ts +47 -46
- package/src/obligations/proof.ts +1 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +3 -14
- package/src/obligations/source.ts +1 -21
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +8 -14
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +24 -33
- package/src/parallel.ts +48 -40
- package/src/parser.ts +565 -282
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +5 -10
- package/src/prover/deciders.ts +0 -4
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
- package/src/prover/isabelle/isar/method.ts +25 -38
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +15 -26
- package/src/prover/isabelle/isar/type-check.ts +11 -25
- package/src/prover/isabelle/provers/blast/blast.ts +10 -41
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +11 -25
- package/src/prover/isabelle/pure/bicompose.ts +16 -13
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +1 -9
- package/src/prover/isabelle/pure/drule.ts +24 -40
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -14
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
- package/src/prover/isabelle/pure/rewriter.ts +26 -58
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +1 -31
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +6 -12
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +13 -36
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +9 -19
- package/src/prover/isabelle/tla/context.ts +8 -16
- package/src/prover/isabelle/tla/logic.ts +4 -11
- package/src/prover/isabelle/tla/simpdata.ts +46 -34
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +4 -36
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +0 -16
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +9 -36
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +0 -36
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +19 -26
- package/src/prover/smt/data.ts +51 -54
- package/src/prover/smt/encode.ts +14 -35
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +66 -101
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -143
- package/src/prover/smt/solver/auf-solver.ts +6 -39
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +4 -61
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +3 -34
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +6 -98
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +35 -130
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +14 -56
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +2 -36
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +3 -15
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +12 -69
- package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
- package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +3 -47
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
- package/src/prover/smt/solver/nlsat/solver.ts +7 -67
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -48
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
- package/src/prover/smt/solver/quantifier-manager.ts +1 -8
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +2 -37
- package/src/prover/smt/solver/solver.ts +1 -16
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +20 -25
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +12 -17
- package/src/prover/verdict.ts +0 -2
- package/src/prover/zenon/check/check.ts +0 -9
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +0 -5
- package/src/prover/zenon/check/relations.ts +0 -13
- package/src/prover/zenon/check/rewrites.ts +0 -6
- package/src/prover/zenon/check/sets.ts +0 -3
- package/src/prover/zenon/check/terms.ts +0 -17
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +0 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +1 -26
- package/src/prover/zenon/index-table.ts +17 -38
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +1 -29
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +0 -9
- package/src/prover/zenon/mltoll.ts +54 -76
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +2 -7
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +1 -17
- package/src/prover/zenon/tla/functions.ts +57 -29
- package/src/prover/zenon/tla/llproof.ts +63 -70
- package/src/prover/zenon/tla/records.ts +56 -27
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +68 -39
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +59 -58
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +12 -112
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generator.ts +149 -252
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +41 -61
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +0 -31
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +29 -63
- package/src/sany/selectors.ts +15 -39
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +13 -63
- package/src/search.ts +495 -155
- package/src/simulate.ts +685 -0
- package/src/spec-description.ts +176 -69
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +254 -69
- package/src/state-graph.ts +50 -24
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +2 -3
- package/src/successors.ts +260 -91
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +110 -44
- package/src/tlc/order.ts +37 -60
- package/src/tlc/random.ts +33 -45
- package/src/tlc/replay.ts +549 -217
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +76 -41
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +269 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +8 -21
- package/src/typescript/collections.ts +0 -15
- package/src/typescript/compile.ts +0 -5
- package/src/typescript/context.ts +0 -12
- package/src/typescript/emit.ts +0 -1
- package/src/typescript/expressions.ts +0 -12
- package/src/typescript/formula.ts +4 -12
- package/src/typescript/functions.ts +6 -17
- package/src/typescript/model.ts +10 -11
- package/src/typescript/names.ts +0 -2
- package/src/typescript/program.ts +0 -3
- package/src/typescript/properties.ts +6 -8
- package/src/typescript/scope.ts +0 -5
- package/src/typescript/steps.ts +0 -10
- package/src/typescript/types.ts +1 -8
- package/src/values.ts +749 -330
- package/src/worker.ts +7 -8
package/src/liveness-checker.ts
CHANGED
|
@@ -1,7 +1,6 @@
|
|
|
1
1
|
import { TlaEvaluationError } from "./errors";
|
|
2
2
|
import { hasRepeatedEffects, type Environment } from "./evaluate";
|
|
3
3
|
import {
|
|
4
|
-
createTautologyError,
|
|
5
4
|
evaluateLive,
|
|
6
5
|
evaluateOnLasso,
|
|
7
6
|
toLiveExpression,
|
|
@@ -28,16 +27,11 @@ export interface LiveSuccessor {
|
|
|
28
27
|
export interface Lasso {
|
|
29
28
|
prefix: number[];
|
|
30
29
|
cycle: number[];
|
|
31
|
-
// Whether the solution that the lasso violates constrains the cycle, as a liveness property does.
|
|
32
|
-
// TLC warns that a stuttering counterexample to one may come from a missing fairness constraint.
|
|
33
30
|
isCycleConstrained: boolean;
|
|
34
31
|
}
|
|
35
32
|
|
|
36
33
|
export interface LivenessChecker {
|
|
37
|
-
// How many solutions of the negated properties TLC checks, which it calls branches.
|
|
38
34
|
branches: number;
|
|
39
|
-
// With a tracing environment, the checks record their call stack as TLC's replay of a failed
|
|
40
|
-
// check does.
|
|
41
35
|
addInitialState: (index: number, state: Value[], tracing?: Environment) => void;
|
|
42
36
|
addState: (
|
|
43
37
|
index: number,
|
|
@@ -54,32 +48,23 @@ interface SearchGraph {
|
|
|
54
48
|
getSuccessors: (index: number, state: Value[]) => LiveSuccessor[];
|
|
55
49
|
}
|
|
56
50
|
|
|
57
|
-
// Numbers in a typed array that doubles as it fills, so a graph of millions of nodes takes a few
|
|
58
|
-
// bytes for each.
|
|
59
51
|
interface Pool<Data extends Int32Array | Uint8Array> {
|
|
60
52
|
data: Data;
|
|
61
53
|
length: number;
|
|
62
54
|
create: (length: number) => Data;
|
|
63
55
|
}
|
|
64
56
|
|
|
65
|
-
// TLC's behavior graph for one solution: a node per state, or per state and tableau node.
|
|
66
57
|
interface BehaviorGraph {
|
|
67
58
|
solution: Solution;
|
|
68
|
-
// One id per distinct action check across the solutions.
|
|
69
59
|
actionIds: Int32Array;
|
|
70
60
|
nodeStates: number[];
|
|
71
61
|
nodeTableaux: number[];
|
|
72
|
-
// Where a node's edges start in edgeTargets, or UNWRITTEN until TLC writes the node with its
|
|
73
|
-
// successors, and how many it has.
|
|
74
62
|
edgeStarts: number[];
|
|
75
63
|
edgeCounts: number[];
|
|
76
64
|
edgeTargets: Pool<Int32Array>;
|
|
77
|
-
// The results of the action checks on each edge, and of the state checks on each state, which
|
|
78
|
-
// are the same for every node of the state.
|
|
79
65
|
edgeActions: Pool<Uint8Array>;
|
|
80
66
|
stateResults: Pool<Uint8Array>;
|
|
81
67
|
initial: number[];
|
|
82
|
-
// The nodes of each state in the order they are recorded, a list through nextSiblings.
|
|
83
68
|
firstNodes: Pool<Int32Array>;
|
|
84
69
|
lastNodes: Pool<Int32Array>;
|
|
85
70
|
nextSiblings: number[];
|
|
@@ -104,7 +89,6 @@ const containsAlways = (expression: LiveExpression): boolean => {
|
|
|
104
89
|
}
|
|
105
90
|
};
|
|
106
91
|
|
|
107
|
-
// TLC's OrderOfSolution#hasEmptyPEMAndBoxFreePromises, negated.
|
|
108
92
|
const isCycleConstrained = (solution: Solution) =>
|
|
109
93
|
solution.promises.some((promise) => containsAlways(promise.body)) ||
|
|
110
94
|
solution.models.some(
|
|
@@ -141,8 +125,7 @@ const writeToPool = <Data extends Int32Array | Uint8Array>(
|
|
|
141
125
|
|
|
142
126
|
const NO_NODE = -1;
|
|
143
127
|
|
|
144
|
-
// A Map holds at most 2^24 entries, so
|
|
145
|
-
// open-addressing table of (state plus one, tableau node, node) triples.
|
|
128
|
+
// A Map holds at most 2^24 entries, so an open-addressing table of (state plus one, tableau node, node) triples finds each node.
|
|
146
129
|
interface NodeTable {
|
|
147
130
|
slots: Int32Array;
|
|
148
131
|
size: number;
|
|
@@ -178,7 +161,6 @@ const getStateResult = (behavior: BehaviorGraph, node: number, position: number)
|
|
|
178
161
|
behavior.nodeStates[node] * behavior.solution.stateChecks.length + position
|
|
179
162
|
] === 1;
|
|
180
163
|
|
|
181
|
-
// A node owns one entry in each per-node array of its graph.
|
|
182
164
|
const pushNode = (behavior: BehaviorGraph, state: number, tableauNode: number) => {
|
|
183
165
|
behavior.nodeStates.push(state);
|
|
184
166
|
behavior.nodeTableaux.push(tableauNode);
|
|
@@ -225,17 +207,14 @@ export const createLivenessChecker = (
|
|
|
225
207
|
const formula =
|
|
226
208
|
fairness.length === 0 ? violation : createJunction("And", [...fairness, violation]);
|
|
227
209
|
const solutions = getSolutions(formula);
|
|
228
|
-
if (solutions.length === 0) {
|
|
229
|
-
throw createTautologyError();
|
|
230
|
-
}
|
|
231
210
|
const actionIds = new Map<string, number>();
|
|
232
211
|
const behaviors = solutions.map((solution): BehaviorGraph => ({
|
|
233
212
|
solution,
|
|
234
213
|
actionIds: Int32Array.from(solution.actionChecks, (predicate) => {
|
|
235
214
|
const key = getTermKey(predicate);
|
|
236
|
-
const
|
|
237
|
-
actionIds.set(key,
|
|
238
|
-
return
|
|
215
|
+
const actionId = actionIds.get(key) ?? actionIds.size;
|
|
216
|
+
actionIds.set(key, actionId);
|
|
217
|
+
return actionId;
|
|
239
218
|
}),
|
|
240
219
|
nodeStates: [],
|
|
241
220
|
nodeTableaux: [],
|
|
@@ -252,23 +231,17 @@ export const createLivenessChecker = (
|
|
|
252
231
|
isDone: [],
|
|
253
232
|
errorNode: undefined,
|
|
254
233
|
}));
|
|
255
|
-
|
|
234
|
+
let capacityMultiplier = 1;
|
|
256
235
|
|
|
257
|
-
// TLC evaluates every check on its own. Without side effects the order can't show, so the
|
|
258
|
-
// checks of one state share their results.
|
|
259
236
|
const isShared = !hasRepeatedEffects(environment);
|
|
260
|
-
|
|
261
|
-
const
|
|
262
|
-
|
|
263
|
-
actions: new Map<Value[], Map<Value[], Int8Array>>(),
|
|
264
|
-
};
|
|
237
|
+
let evaluationEnvironment = environment;
|
|
238
|
+
const sharedStates = new Map<Value[], Map<LiveExpression, boolean>>();
|
|
239
|
+
const sharedActions = new Map<Value[], Map<Value[], Int8Array>>();
|
|
265
240
|
const getStateCache = (state: Value[]) => {
|
|
266
|
-
const cache =
|
|
267
|
-
|
|
241
|
+
const cache = sharedStates.get(state) ?? new Map<LiveExpression, boolean>();
|
|
242
|
+
sharedStates.set(state, cache);
|
|
268
243
|
return cache;
|
|
269
244
|
};
|
|
270
|
-
// TLCGet("level") reads the level of the state whose successors the checks run on.
|
|
271
|
-
// A check that fails leaves no source, so the failure's trace reads the levels of the search.
|
|
272
245
|
const evaluateFrom = <Result>(source: number | undefined, evaluate: () => Result) => {
|
|
273
246
|
environment.runtime.setLivenessSource(source);
|
|
274
247
|
try {
|
|
@@ -282,7 +255,7 @@ export const createLivenessChecker = (
|
|
|
282
255
|
predicate,
|
|
283
256
|
state,
|
|
284
257
|
undefined,
|
|
285
|
-
|
|
258
|
+
evaluationEnvironment,
|
|
286
259
|
isShared ? getStateCache(state) : new Map(),
|
|
287
260
|
);
|
|
288
261
|
const checkState = (behavior: BehaviorGraph, source: number, state: Value[]) =>
|
|
@@ -301,27 +274,27 @@ export const createLivenessChecker = (
|
|
|
301
274
|
const predicates = behavior.solution.actionChecks;
|
|
302
275
|
if (!isShared) {
|
|
303
276
|
return Uint8Array.from(predicates, (predicate) =>
|
|
304
|
-
evaluateLive(predicate, state, successor,
|
|
277
|
+
evaluateLive(predicate, state, successor, evaluationEnvironment, new Map()) ? 1 : 0,
|
|
305
278
|
);
|
|
306
279
|
}
|
|
307
280
|
const stateCache = getStateCache(state);
|
|
308
|
-
const results =
|
|
309
|
-
|
|
281
|
+
const results = sharedActions.get(state) ?? new Map<Value[], Int8Array>();
|
|
282
|
+
sharedActions.set(state, results);
|
|
310
283
|
const known = results.get(successor) ?? new Int8Array(actionIds.size).fill(-1);
|
|
311
284
|
results.set(successor, known);
|
|
312
|
-
return Uint8Array.from(behavior.actionIds, (
|
|
313
|
-
if (known[
|
|
314
|
-
known[
|
|
285
|
+
return Uint8Array.from(behavior.actionIds, (actionId, position) => {
|
|
286
|
+
if (known[actionId] === -1) {
|
|
287
|
+
known[actionId] = evaluateLive(
|
|
315
288
|
predicates[position],
|
|
316
289
|
state,
|
|
317
290
|
successor,
|
|
318
|
-
|
|
291
|
+
evaluationEnvironment,
|
|
319
292
|
stateCache,
|
|
320
293
|
)
|
|
321
294
|
? 1
|
|
322
295
|
: 0;
|
|
323
296
|
}
|
|
324
|
-
return known[
|
|
297
|
+
return known[actionId];
|
|
325
298
|
});
|
|
326
299
|
});
|
|
327
300
|
const isConsistent = (
|
|
@@ -333,8 +306,6 @@ export const createLivenessChecker = (
|
|
|
333
306
|
evaluateFrom(source, () =>
|
|
334
307
|
tableau.nodes[node].statePredicates.every((predicate) => evaluateState(predicate, state)),
|
|
335
308
|
);
|
|
336
|
-
// TLC 1.7.4 doesn't stop at a tableau node that accepts every behavior, so it finds a violation
|
|
337
|
-
// of a property like a safety property only in its liveness checks.
|
|
338
309
|
const isAccepting = (tableau: Tableau, node: number) => {
|
|
339
310
|
if (environment.runtime.version === "1.7.4") return false;
|
|
340
311
|
const tableauNode = tableau.nodes[node];
|
|
@@ -403,16 +374,12 @@ export const createLivenessChecker = (
|
|
|
403
374
|
behavior.edgeCounts[node] = targets.length;
|
|
404
375
|
};
|
|
405
376
|
|
|
406
|
-
// TLC
|
|
407
|
-
// iterates in slot order. Its capacity starts at 16 times a factor that grows with every set
|
|
408
|
-
// that outgrows it.
|
|
377
|
+
// TLC iterates a state's successors and the state itself in the slot order of a SetOfStates, a hash set whose capacity grows with every set that outgrows it.
|
|
409
378
|
const getSuccessorSet = (index: number, state: Value[], successors: LiveSuccessor[]) => {
|
|
410
|
-
|
|
411
|
-
|
|
412
|
-
|
|
413
|
-
|
|
414
|
-
count: 0,
|
|
415
|
-
};
|
|
379
|
+
let successorSlots = Array.from<LiveSuccessor | undefined>({
|
|
380
|
+
length: SUCCESSOR_CAPACITY * capacityMultiplier,
|
|
381
|
+
});
|
|
382
|
+
let successorCount = 0;
|
|
416
383
|
const insertSuccessor = (slots: (LiveSuccessor | undefined)[], successor: LiveSuccessor) => {
|
|
417
384
|
for (
|
|
418
385
|
let slot = (search.getFingerprint(successor) & 0x7fffffff) % slots.length;
|
|
@@ -429,20 +396,19 @@ export const createLivenessChecker = (
|
|
|
429
396
|
}
|
|
430
397
|
};
|
|
431
398
|
const addSuccessor = (successor: LiveSuccessor) => {
|
|
432
|
-
if (
|
|
433
|
-
const old =
|
|
434
|
-
|
|
435
|
-
for (const entry of old) if (entry) insertSuccessor(
|
|
399
|
+
if (successorCount >= successorSlots.length >> 1) {
|
|
400
|
+
const old = successorSlots;
|
|
401
|
+
successorSlots = Array.from<LiveSuccessor | undefined>({ length: 2 * old.length + 1 });
|
|
402
|
+
for (const entry of old) if (entry) insertSuccessor(successorSlots, entry);
|
|
436
403
|
}
|
|
437
|
-
if (insertSuccessor(
|
|
404
|
+
if (insertSuccessor(successorSlots, successor)) successorCount++;
|
|
438
405
|
};
|
|
439
406
|
successors.forEach(addSuccessor);
|
|
440
407
|
addSuccessor({ index, state });
|
|
441
|
-
if (
|
|
442
|
-
return
|
|
408
|
+
if (successorSlots.length > SUCCESSOR_CAPACITY * capacityMultiplier) capacityMultiplier++;
|
|
409
|
+
return successorSlots.filter((entry): entry is LiveSuccessor => entry !== undefined);
|
|
443
410
|
};
|
|
444
411
|
|
|
445
|
-
// TLC's TableauLiveChecker#addNextState for a node it finds after it expanded the node's state.
|
|
446
412
|
const expandLate = (
|
|
447
413
|
behavior: BehaviorGraph,
|
|
448
414
|
tableau: Tableau,
|
|
@@ -480,8 +446,7 @@ export const createLivenessChecker = (
|
|
|
480
446
|
const isDone = behavior.isDone[successor.index] === true;
|
|
481
447
|
for (const next of tableauNode.successors) {
|
|
482
448
|
if (!isConsistent(tableau, next, index, successor.state)) continue;
|
|
483
|
-
//
|
|
484
|
-
// checks the graph. TLC records its node, which it never expands.
|
|
449
|
+
// Deviation from TLC: TLC records the node of a successor the search never stored, which it never expands.
|
|
485
450
|
if (successor.index === -1) continue;
|
|
486
451
|
const existing = getNodeId(behavior, successor.index, next);
|
|
487
452
|
if (existing !== undefined && successors.includes(existing)) continue;
|
|
@@ -504,7 +469,7 @@ export const createLivenessChecker = (
|
|
|
504
469
|
stateResults: Uint8Array,
|
|
505
470
|
index: number,
|
|
506
471
|
) => {
|
|
507
|
-
const consistency = tableau.nodes.map((
|
|
472
|
+
const consistency = tableau.nodes.map((_tableauNode, node) =>
|
|
508
473
|
set.map((successor) => isConsistent(tableau, node, index, successor.state)),
|
|
509
474
|
);
|
|
510
475
|
behavior.isDone[index] = true;
|
|
@@ -554,7 +519,6 @@ export const createLivenessChecker = (
|
|
|
554
519
|
writeNode(behavior, index, successors, actions, stateResults);
|
|
555
520
|
};
|
|
556
521
|
|
|
557
|
-
// The shortest path from an initial node to the node, last node first, as TLC's getPath finds it.
|
|
558
522
|
const getPath = (behavior: BehaviorGraph, target: number) => {
|
|
559
523
|
if (behavior.initial.includes(target)) return [target];
|
|
560
524
|
const parents = new Map<number, number>();
|
|
@@ -581,7 +545,6 @@ export const createLivenessChecker = (
|
|
|
581
545
|
throw new TlaEvaluationError(`Couldn't re-create liveness trace (path) starting at: ${target}`);
|
|
582
546
|
};
|
|
583
547
|
|
|
584
|
-
// TLC's LiveWorker#checkSccs, a Tarjan search that pushes every successor of a node at once.
|
|
585
548
|
const findLassoInModel = (
|
|
586
549
|
behavior: BehaviorGraph,
|
|
587
550
|
model: Solution["models"][number],
|
|
@@ -638,8 +601,6 @@ export const createLivenessChecker = (
|
|
|
638
601
|
return getLasso(root, members, membersByState);
|
|
639
602
|
};
|
|
640
603
|
|
|
641
|
-
// TLC's LiveWorker#printTrace: a prefix to the root, a greedy walk through the component
|
|
642
|
-
// until it satisfies every check, and a breadth-first path back to the root.
|
|
643
604
|
const getLasso = (
|
|
644
605
|
root: number,
|
|
645
606
|
members: Set<number>,
|
|
@@ -655,74 +616,75 @@ export const createLivenessChecker = (
|
|
|
655
616
|
const stateDone = model.infinitelyOftenStates.map(() => false);
|
|
656
617
|
const actionDone = model.infinitelyOftenActions.map(() => false);
|
|
657
618
|
const promiseDone = solution.promises.map(() => false);
|
|
658
|
-
|
|
659
|
-
|
|
619
|
+
let remainingCount = stateDone.length + actionDone.length + promiseDone.length;
|
|
620
|
+
let currentNode = root;
|
|
660
621
|
const isMember = (node: number) => members.has(node);
|
|
661
622
|
const moveTo = (next: number) => {
|
|
662
|
-
cycleStack.push(
|
|
663
|
-
|
|
623
|
+
cycleStack.push(currentNode);
|
|
624
|
+
currentNode = next;
|
|
664
625
|
};
|
|
665
|
-
while (
|
|
666
|
-
const countAtStart =
|
|
626
|
+
while (remainingCount > 0) {
|
|
627
|
+
const countAtStart = remainingCount;
|
|
667
628
|
while (true) {
|
|
668
629
|
model.infinitelyOftenStates.forEach((position, slot) => {
|
|
669
|
-
if (!stateDone[slot] && getStateResult(behavior,
|
|
630
|
+
if (!stateDone[slot] && getStateResult(behavior, currentNode, position)) {
|
|
670
631
|
stateDone[slot] = true;
|
|
671
|
-
|
|
632
|
+
remainingCount--;
|
|
672
633
|
}
|
|
673
634
|
});
|
|
674
635
|
solution.promises.forEach((promise, position) => {
|
|
675
|
-
if (!promiseDone[position] && isFulfilled(
|
|
636
|
+
if (!promiseDone[position] && isFulfilled(currentNode, promise)) {
|
|
676
637
|
promiseDone[position] = true;
|
|
677
|
-
|
|
638
|
+
remainingCount--;
|
|
678
639
|
}
|
|
679
640
|
});
|
|
680
|
-
if (
|
|
681
|
-
|
|
682
|
-
|
|
683
|
-
const
|
|
641
|
+
if (remainingCount <= 0) break;
|
|
642
|
+
let lastNext = -1;
|
|
643
|
+
let unvisitedNext = -1;
|
|
644
|
+
const countBeforeActions = remainingCount;
|
|
645
|
+
const isTaken = getNodeSuccessors(behavior, currentNode).some((next, edge) => {
|
|
684
646
|
if (membersByState.has(behavior.nodeStates[next])) {
|
|
685
|
-
if (!isMember(next) || !isAllowed(
|
|
686
|
-
|
|
647
|
+
if (!isMember(next) || !isAllowed(currentNode, edge)) return false;
|
|
648
|
+
lastNext = next;
|
|
687
649
|
model.infinitelyOftenActions.forEach((position, slot) => {
|
|
688
|
-
if (!actionDone[slot] && getAction(
|
|
650
|
+
if (!actionDone[slot] && getAction(currentNode, edge, position)) {
|
|
689
651
|
actionDone[slot] = true;
|
|
690
|
-
|
|
652
|
+
remainingCount--;
|
|
691
653
|
}
|
|
692
654
|
});
|
|
693
655
|
}
|
|
694
|
-
if (
|
|
656
|
+
if (remainingCount < countBeforeActions) {
|
|
695
657
|
moveTo(next);
|
|
696
658
|
seen.clear();
|
|
697
659
|
return true;
|
|
698
660
|
}
|
|
699
|
-
if (isMember(next) && !seen.has(next))
|
|
661
|
+
if (isMember(next) && !seen.has(next)) unvisitedNext = next;
|
|
700
662
|
return false;
|
|
701
663
|
});
|
|
702
|
-
if (
|
|
703
|
-
if (
|
|
704
|
-
moveTo(
|
|
664
|
+
if (isTaken) break;
|
|
665
|
+
if (remainingCount < countAtStart) {
|
|
666
|
+
moveTo(lastNext);
|
|
705
667
|
seen.clear();
|
|
706
668
|
break;
|
|
707
669
|
}
|
|
708
|
-
while (
|
|
670
|
+
while (unvisitedNext === -1) {
|
|
709
671
|
const previous = cycleStack.pop();
|
|
710
672
|
if (previous === undefined) {
|
|
711
673
|
throw new TlaEvaluationError(
|
|
712
674
|
"TLC failed to build the counterexample of a liveness property",
|
|
713
675
|
);
|
|
714
676
|
}
|
|
715
|
-
|
|
716
|
-
|
|
677
|
+
currentNode = previous;
|
|
678
|
+
unvisitedNext =
|
|
717
679
|
getNodeSuccessors(behavior, previous).find(
|
|
718
680
|
(next) => isMember(next) && !seen.has(next),
|
|
719
681
|
) ?? -1;
|
|
720
682
|
}
|
|
721
|
-
moveTo(
|
|
722
|
-
seen.add(
|
|
683
|
+
moveTo(unvisitedNext);
|
|
684
|
+
seen.add(unvisitedNext);
|
|
723
685
|
}
|
|
724
686
|
}
|
|
725
|
-
const postfix = getClosingPath(root,
|
|
687
|
+
const postfix = getClosingPath(root, currentNode, membersByState, isAllowed);
|
|
726
688
|
for (let position = cycleStack.length - 1; position >= 0; position--) {
|
|
727
689
|
const state = behavior.nodeStates[cycleStack[position]];
|
|
728
690
|
if (postfix[postfix.length - 1] !== state) postfix.push(state);
|
|
@@ -736,7 +698,6 @@ export const createLivenessChecker = (
|
|
|
736
698
|
};
|
|
737
699
|
};
|
|
738
700
|
|
|
739
|
-
// TLC's LiveWorker#bfsPostFix, the states from the walk's end back to the root, last first.
|
|
740
701
|
const getClosingPath = (
|
|
741
702
|
root: number,
|
|
742
703
|
end: number,
|
|
@@ -782,7 +743,7 @@ export const createLivenessChecker = (
|
|
|
782
743
|
|
|
783
744
|
for (let position = 0; position < queue.length; position++) {
|
|
784
745
|
const stack = [queue[position], UNVISITED, 0];
|
|
785
|
-
|
|
746
|
+
let nextLink = 0;
|
|
786
747
|
while (stack.length >= 3) {
|
|
787
748
|
const lowLink = stack.pop() ?? 0;
|
|
788
749
|
const location = stack.pop();
|
|
@@ -799,10 +760,10 @@ export const createLivenessChecker = (
|
|
|
799
760
|
stack.push(Math.min(lowLink, links[node]));
|
|
800
761
|
continue;
|
|
801
762
|
}
|
|
802
|
-
links[node] =
|
|
763
|
+
links[node] = nextLink;
|
|
803
764
|
stack.push(lowLink, node, SCC_MARKER);
|
|
804
765
|
components.push(node);
|
|
805
|
-
|
|
766
|
+
let nextLowLink = nextLink++;
|
|
806
767
|
getNodeSuccessors(behavior, node).forEach((next, edge) => {
|
|
807
768
|
if (!isWritten(behavior, next)) return;
|
|
808
769
|
if (!isAllowed(node, edge)) {
|
|
@@ -810,9 +771,9 @@ export const createLivenessChecker = (
|
|
|
810
771
|
return;
|
|
811
772
|
}
|
|
812
773
|
if (links[next] === UNVISITED) stack.push(next, UNVISITED);
|
|
813
|
-
else nextLowLink
|
|
774
|
+
else nextLowLink = Math.min(nextLowLink, links[next]);
|
|
814
775
|
});
|
|
815
|
-
stack.push(nextLowLink
|
|
776
|
+
stack.push(nextLowLink);
|
|
816
777
|
}
|
|
817
778
|
}
|
|
818
779
|
return undefined;
|
|
@@ -821,9 +782,9 @@ export const createLivenessChecker = (
|
|
|
821
782
|
return {
|
|
822
783
|
branches: behaviors.length,
|
|
823
784
|
addInitialState: (index, state, tracing) => {
|
|
824
|
-
|
|
825
|
-
|
|
826
|
-
|
|
785
|
+
evaluationEnvironment = tracing ?? environment;
|
|
786
|
+
sharedStates.clear();
|
|
787
|
+
sharedActions.clear();
|
|
827
788
|
try {
|
|
828
789
|
for (const behavior of behaviors) {
|
|
829
790
|
const tableau = behavior.solution.tableau;
|
|
@@ -839,13 +800,13 @@ export const createLivenessChecker = (
|
|
|
839
800
|
}
|
|
840
801
|
}
|
|
841
802
|
} finally {
|
|
842
|
-
|
|
803
|
+
evaluationEnvironment = environment;
|
|
843
804
|
}
|
|
844
805
|
},
|
|
845
806
|
addState: (index, state, successors, tracing) => {
|
|
846
|
-
|
|
847
|
-
|
|
848
|
-
|
|
807
|
+
evaluationEnvironment = tracing ?? environment;
|
|
808
|
+
sharedStates.clear();
|
|
809
|
+
sharedActions.clear();
|
|
849
810
|
try {
|
|
850
811
|
const set = getSuccessorSet(index, state, successors);
|
|
851
812
|
for (const behavior of behaviors) {
|
|
@@ -870,7 +831,7 @@ export const createLivenessChecker = (
|
|
|
870
831
|
}
|
|
871
832
|
return undefined;
|
|
872
833
|
} finally {
|
|
873
|
-
|
|
834
|
+
evaluationEnvironment = environment;
|
|
874
835
|
}
|
|
875
836
|
},
|
|
876
837
|
findViolation: () => {
|
|
@@ -882,12 +843,11 @@ export const createLivenessChecker = (
|
|
|
882
843
|
}
|
|
883
844
|
return undefined;
|
|
884
845
|
},
|
|
885
|
-
// TLC names every property that the counterexample violates, once each.
|
|
886
846
|
getViolatedProperties: (path, cycleStart) => [
|
|
887
847
|
...new Set(
|
|
888
848
|
properties
|
|
889
849
|
.filter(
|
|
890
|
-
(
|
|
850
|
+
(_property, position) =>
|
|
891
851
|
!evaluateOnLasso(negations[position].body, path, cycleStart, 0, environment),
|
|
892
852
|
)
|
|
893
853
|
.map((property) => property.name),
|