tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +615 -53
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
package/dist/transfer.js
CHANGED
|
@@ -6,89 +6,23 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{
|
|
10
|
-
`,t:` `,r:`\r`,f:`\f`},
|
|
11
|
-
`),
|
|
12
|
-
|
|
13
|
-
`?
|
|
14
|
-
`?
|
|
15
|
-
`||e[a]===`\r`?
|
|
16
|
-
\r`.includes(e[t]))n
|
|
17
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]])
|
|
18
|
-
(
|
|
19
|
-
(* This module provides dummy definitions of the operators that are *)
|
|
20
|
-
(
|
|
21
|
-
(* handles specifications that use real numbers will provide its own *)
|
|
22
|
-
(* implementations of these operators. TLC currently does not handle real *)
|
|
23
|
-
(* numbers and produces an error if a specification requires TLC to *)
|
|
24
|
-
(* evaluate the operators defined here or to evaluate any operator defined *)
|
|
25
|
-
(* in the Integers module that is applied to non-integer real numbers. *)
|
|
26
|
-
(* *)
|
|
27
|
-
(* See the book "Specifying Systems" for the real Reals module. *)
|
|
28
|
-
(***************************************************************************)
|
|
29
|
-
EXTENDS Integers
|
|
30
|
-
|
|
31
|
-
Real == "Reals"
|
|
32
|
-
a / b == CHOOSE m \\in Real : m * b = a
|
|
33
|
-
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
34
|
-
=============================================================================`,Ze=`----------------------------- MODULE RealTime -------------------------------
|
|
35
|
-
(***************************************************************************)
|
|
36
|
-
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
37
|
-
(* Systems". The type of specification described there cannot be handled *)
|
|
38
|
-
(* by the TLC model checker. *)
|
|
39
|
-
(***************************************************************************)
|
|
40
|
-
EXTENDS Reals
|
|
41
|
-
VARIABLE now
|
|
42
|
-
|
|
43
|
-
RTBound(A, v, D, E) ==
|
|
44
|
-
LET TNext(t) == t' = IF <<A>>_v \\/ ~(ENABLED <<A>>_v)'
|
|
45
|
-
THEN 0
|
|
46
|
-
ELSE t + (now'-now)
|
|
47
|
-
|
|
48
|
-
Timer(t) == (t=0) /\\ [][TNext(t)]_<<t, v, now>>
|
|
49
|
-
|
|
50
|
-
MaxTime(t) == [](t \\leq E)
|
|
51
|
-
|
|
52
|
-
MinTime(t) == [][A => t \\geq D]_v
|
|
53
|
-
IN \\EE t : Timer(t) /\\ MaxTime(t) /\\ MinTime(t)
|
|
54
|
-
-----------------------------------------------------------------------------
|
|
55
|
-
RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
56
|
-
/\\ UNCHANGED v
|
|
57
|
-
IN /\\ now \\in Real
|
|
58
|
-
/\\ [][NowNext]_now
|
|
59
|
-
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
60
|
-
=============================================================================`,Qe=`----------------------------- MODULE Toolbox --------------------------------
|
|
61
|
-
(***************************************************************************)
|
|
62
|
-
(* *)
|
|
63
|
-
(***************************************************************************)
|
|
64
|
-
LOCAL INSTANCE Naturals \\* a + b
|
|
65
|
-
LOCAL INSTANCE FiniteSets \\* Cardinality
|
|
66
|
-
LOCAL INSTANCE TLC \\* TLCGet
|
|
67
|
-
|
|
68
|
-
-----------------------------------------------------------------------------
|
|
69
|
-
|
|
70
|
-
(* Trace Exploration *)
|
|
71
|
-
|
|
72
|
-
_TETrace ==
|
|
73
|
-
CHOOSE f \\in [ (Nat \\ {0}) -> STRING ] : TRUE
|
|
74
|
-
|
|
75
|
-
LOCAL _TETraceLength == Cardinality(DOMAIN _TETrace)
|
|
76
|
-
|
|
77
|
-
\\* When evaluated as part of a TLC ALIAS expression, \`_TEPosition\` should be
|
|
78
|
-
\\* redefined as \`TLCGet("level"), or replace with \`TLCGet(level)\` right away.
|
|
79
|
-
\\* The definition below accounts for several "peculiarities" of the
|
|
80
|
-
\\* Toolbox's trace exploration.
|
|
81
|
-
_TEPosition ==
|
|
82
|
-
IF TLCGet("level") >= _TETraceLength
|
|
83
|
-
THEN _TETraceLength
|
|
84
|
-
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
85
|
-
|
|
86
|
-
=============================================================================`,$e=/* @__PURE__ */ new Map([[`Reals`,Xe],[`RealTime`,Ze],[`Toolbox`,Qe]]),et={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},tt=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},nt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),rt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),it=e=>{let t=t=>{let n=he(e,t,tt);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=he(e,t,nt);if(e.startsWith(`..`,n)&&nt(e[n+2]))return{kind:`Constant`,first:t,last:he(e,n+2,nt)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=nt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:he(e,t+1,nt)-1,children:[]};if(rt(n))return{kind:`Constant`,first:t,last:he(e,t,rt)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},at=e=>{let t=e.length===0?void 0:it(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=et[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),ee=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||ee===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${ee}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},ot=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,k=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,st=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),A=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),j=e=>typeof e==`object`&&e.kind===`ModelValue`,ct=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),lt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:k(e)?`set`:`function`,ut=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,dt={isUsed:!1},ft=(e,t)=>(dt.isUsed=!0,e.writtenKeys=t,e),pt=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[xr(e.domain,t)]]),mt=(e,t,n)=>ft(Zn(e,t),n),ht=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(ht);e.writtenKeys=void 0,e.range.forEach(ht)}},gt=e=>e.every(e=>typeof e==`string`),_t=(e,t)=>e.length>0&&t.length>0&>(e)!==gt(t),vt=(e,t)=>{dt.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return _t(n,r)?yn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=It(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:It(t,n);if(r!==0)return r}return 0},yt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=It(n[e],r[e]);if(t!==0)return t}return 0},bt=e=>j(e)?e.type:void 0,xt=(e,t,n)=>{let r=bt(e),i=bt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(j(e)&&j(t)){if(r===void 0||i===void 0||r===i)return;throw new h(`Attempted to ${a} the differently-typed model values ${I(e)} and ${I(t)}`)}throw r===void 0?new h(`Attempted to ${a} the typed model value ${I(t)} and the non-model value\n${I(e)}`):new h(`Attempted to ${a}${n?``:` the`} typed model value ${I(e)} and non-model value\n${I(t)}`)},St={ranks:Object.create(null),size:0},Ct=e=>{St.ranks=Object.create(null),St.size=0,Lt.clear();for(let t of e)Et(t)},wt={is174:!1},Tt=e=>{wt.is174=e===`1.7.4`},Et=e=>(St.ranks[e]===void 0&&(St.ranks[e]=St.size++),e),Dt=()=>St.size,Ot=e=>Object.keys(St.ranks).find(t=>St.ranks[t]===e),kt=e=>St.ranks[Et(e)],At=(e,t)=>{if(e===t)return 0;let n=St.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},jt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Mt=(e,t)=>(jt(e)||jt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Nt=(e,t,n)=>{if(!jt(e))throw new h(`Attempted to ${n} the set ${I(M(e)?N(e):e,!0)} with the value:\n${I(t,!0)}`);if(!jt(t))throw new h(`Attempted to compare overridden value ${I(e,!0)} with non-overridden value:\n${I(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new h(`Attempted to compare ${I(e,!0)} with the value\n${I(t,!0)}`)},Pt={kind:`InfiniteSet`,name:`Any`},Ft=e=>{throw new h(`Attempted to compare ANY with the value\n${I(e)}`)},It=(e,t)=>{if(e===t)return dt.isUsed&&ht(e),e===Pt?Ft(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return vt(e,t);if(n===`Set`&&r===`Set`)return yt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&xt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return xt(e,t,!1),n===`ModelValue`?-1:1;if(e===Pt||t===Pt)return Ft(e===Pt?t:e);if(k(e)&&k(t)&&Mt(e,t))return Nt(e,t,`compare`);let i=k(e);if(i!==k(t))throw new h(`Attempted to compare ${lt(e)} ${I(e)} with ${lt(t)} ${I(t)}`);return i?yt(N(e),N(t)):vt(F(e),F(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return At(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(xt(e,t,!1),j(e))return-1;if(j(t))return 1;throw new h(`Attempted to compare ${lt(e)} ${I(e)} with ${lt(t)} ${I(t)}`)},Lt=/* @__PURE__ */ new Map,Rt=e=>{let t=Lt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:kt(e),hash:Vr(Hr(Ur(e),109)),fingerprint:Qr($r(e)^60)};return Lt.set(e,n),n},zt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),Bt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Vt={isPresent:!1},Ht=(e,t)=>(t===`lambda`&&(Vt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ut=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Wt=e=>Ht(e,`lambda`),Gt=e=>ot(e)&&e.isCached===!0,Kt={isPresent:!1},qt=e=>(Kt.isPresent=!0,e),Jt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Yt=e=>{Kt.isPresent&&typeof e==`object`&&ot(e)&&Jt.has(e.kind)&&(e.isCached=!0)},Xt=e=>{(Vt.isPresent||Kt.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Xt),e.range.forEach(Xt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Xt):k(e)&&M(e)&&(Yt(e),N(e).elements.forEach(Xt))))},Zt=(e,t)=>{if(Yt(e),e===t)return dt.isUsed&&ht(e),e!==Pt||Ft(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&xt(e,t,!0),It(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return vt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return yt(e,t)===0;if(j(e)||j(t))return xt(e,t,!0),j(e)&&j(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Zt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=P(e.domain),r=P(t.domain);if(n||r)return n===r;let i=P(e.range),a=P(t.range);return i||a?i===a:Zt(e.domain,t.domain)&&Zt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(P(e))return P(t);if(P(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Zt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return P(e)?P(t):!P(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Zt(e,t.factors[n]));let n=k(e)&&k(t)&&!(M(e)&&M(t));if(n&&Mt(e,t))return Nt(e,t,`check equality of`)===0;if(n){if(!jt(e)){let n=N(e);if(!jt(t))return yt(n,N(t))===0}return ii(e)===ii(t)}return It(e,t)===0},Qt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ii(n)===ii(r);return n},$t=Qt(!1),en=Qt(!0),tn=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},nn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||en(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||en(i[e],n))return i[e]}return n.kind===`Set`?tn(n.elements,t):(tn(n.domain,t),tn(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},rn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},an=e=>{if(!A(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:rn(t.domain)}},on=e=>{if(!A(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},sn=(e,t)=>(xt(t,e,!1),1),cn=(e,t)=>(xt(t,e,!0),!1),ln=(e,t)=>(e.type!==void 0&&xt(e,t,!1),j(t)?e.rank-t.rank:-1),un=(e,t)=>(e.type!==void 0&&xt(e,t,!0),j(t)&&e.name===t.name),dn={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},fn=(e,t,n)=>{let r=dn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${I(e)} with ${r.other}:\n${I(t)}`},pn=(e,t,n)=>{let r=an(n);if(!r){if(j(n))return sn(n,t);throw new h(`Attempted to compare the function ${I(t)} with the value:\n${I(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>mn(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return mn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new h(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${I(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},mn=(e,t)=>{for(let n=0;n<e.length;n++){let r=yn(e[n],t[n]);if(r!==0)return r}return 0},hn=(e,t)=>{let n=F(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=A(t)?Sr(t):void 0;return r?n.range.length-r.length||mn(n.range,r):pn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=on(t);if(!r){if(j(t))return sn(t,e);throw new h(`Attempted to compare record:\n${I(e)}\nwith non-record\n${I(t)}`)}return n.domain.length-r.domain.length||mn(n.domain,r.domain)||mn(n.range,r.range)}return pn({...n,low:rn(n.domain)},e,t)},gn=(e,t)=>jt(e)||jt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),_n=(e,t)=>{let n=ct(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},vn=(e,t)=>{if(gn(e,t))return It(e,t);if(!ct(e))return vn(N(e),t);if(!k(t)){if(j(t))return sn(t,e);throw new h(`Attempted to compare the set ${I(e)} with the value:\n${I(t)}`)}let n=_n(e,t);return n.elements.length-n.otherElements.length||mn(n.elements,n.otherElements)},yn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return It(e,t);if(j(t))return sn(t,e);throw new h(fn(e,t,!1))}return e.kind===`ModelValue`?ln(e,t):A(e)?hn(e,t):vn(e,t)},bn=(e,t)=>e.every((e,n)=>wn(e,t[n])),xn=(e,t,n)=>{let r=an(n);if(!r){if(j(n))return cn(n,t);throw new h(`Attempted to check equality of the function ${I(t)} with the value:\n${I(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&bn(e.range,r.range);let i=e.low??r.low;return i===void 0?bn(e.domain,r.domain)&&bn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new h(`Attempted to compare an integer with non-integer:\n${I(e)}.`);return e===i+t})&&bn(e.range,r.range)},Sn=(e,t)=>{let n=F(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=A(t)?Sr(t):void 0;return r?n.range.length===r.length&&bn(n.range,r):xn({...n,low:1},e,t)}if(Ut(e)===`record`){let r=on(t);if(!r){if(j(t))return cn(t,e);throw new h(`Attempted to check equality of record:\n${I(e)}\nwith non-record\n${I(t)}`)}return n.domain.length===r.domain.length&&bn(n.domain,r.domain)&&bn(n.range,r.range)}return xn({...n,low:rn(n.domain)},e,t)},Cn=(e,t)=>{if(gn(e,t))return Zt(e,t);if(!ct(e))return Cn(N(e),t);if(!k(t)){if(j(t))return cn(t,e);throw new h(`Attempted to check equality of the set ${I(e)} with the value:\n${I(t)}`)}let n=_n(e,t);return n.elements.length===n.otherElements.length&&bn(n.elements,n.otherElements)},wn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(j(t))return cn(t,e);throw new h(fn(e,t,!0))}return e.kind===`ModelValue`?un(e,t):A(e)?Sn(e,t):Cn(e,t)},Tn=e=>{let t=[];for(let n of e){let e=Dn(n,t);e.isFound||t.splice(e.index,0,n)}return t},En=(e,t)=>{let n=wr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Dn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=En(e,()=>yn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},On=(e,t)=>t.some(t=>En(t,()=>wn(t,e))),kn=/* @__PURE__ */ new WeakSet,An=e=>{typeof e==`object`&&(e.kind===`Set`&&(kn.add(e),e.elements.forEach(An)),e.kind===`Function`&&(e.domain.forEach(An),e.range.forEach(An)))},jn=(e,t)=>Tr(Zt,wn,e,t),Mn=e=>{for(let t=1;t<e.length;t++)if(It(e[t-1],e[t])>=0)return!1;return!0},Nn=e=>{for(let t=1;t<e.length;t++)Yt(e[t]);if(e.length<2||Mn(e))return zt(e);let t=[...e].sort(It),n=[t[0]];for(let e=1;e<t.length;e++)It(n[n.length-1],t[e])!==0&&n.push(t[e]);return zt(n)},Pn=e=>Tr(Nn,e=>({kind:`MixedSet`,elements:e}),e,void 0),Fn=zt([]),In=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0||i.push(t)}return i.length===n.length?e:zt(i)},Ln=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&It(r[a],t)<0;)a++;a<r.length&&It(r[a],t)===0&&i.push(t)}return i.length===n.length?e:zt(i)},Rn=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=It(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=zt(i);if(e.hash!==0&&e.hash!==Kr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zr(a[n]);if(e===Kr)break;t=t+Wr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+ei(a[e])|0;c.fingerprint=t}return c},zn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>It(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&It(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Bt(n,r)},Bn=e=>{let t=zn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:ft(t,e.map(e=>e[0]))},Vn=[],Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Vn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Vn[e]=n,n},Gn=e=>{if(vr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Vn[e.length]||Un.has(e)),qn=e=>{let t=N(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Ht(Bt(Wn(e.length),e),`tuple`),Xn=e=>Ht(zn(e),`record`),Zn=(e,t)=>Ht(Bt(e,t),`record`),Qn=e=>k(e)&&!jt(e),$n=(e,t=!1)=>`UNION(${I(e.base,t)})`,er=(e,t=e=>N(e).elements)=>{if(!Qn(e.base))throw new h(`Attempted to enumerate the nonenumerable set:\n${$n(e)}`);return t(e.base)},tr=(e,t,n)=>{if(Qn(e))return e;throw new h(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${I(e)}\nwhen enumerating:\n${$n(n)}`)},M=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return M(e.base);case`FunctionSet`:return M(e.domain)&&M(e.range)||nr(e.domain)===!0||nr(e)===!0;case`RecordSet`:return e.sets.every(M)||nr(e)===!0;case`ProductSet`:return e.factors.every(M)||nr(e)===!0;case`Union`:return M(e.base)&&dr(e.base).every(M);case`SetOperation`:return e.operator===`\\cup`?M(e.left)&&M(e.right):e.operator===`\\cap`?M(e.left)||M(e.right):M(e.left);default:return!1}},nr=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=nr(e.domain);return t===void 0?void 0:!t&&nr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=nr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return M(e)?N(e).elements.length===0:void 0;default:return}},rr=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},ir=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},ar=e=>{if(typeof e!=`object`||e.kind!==`Subset`||jt(e.base))return;let t=N(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:ir(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return zt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},or=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(zt(r.map(t=>e[t])));while(ir(r,e.length))}return t},sr=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(jt(a))throw new h(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},cr=(e,t=e=>N(e).elements)=>{if(typeof e!=`object`)throw new h(`Expected a set but found ${I(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Tn(e.elements);case`Interval`:{let t=Gn(e);return t!==Vn[t.length]&&Un.set(t,e),t}case`Subset`:{if(vr(e.base)===0)return or([]);if(!k(e.base))throw new h(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${at(I(e.base))}`);let t=N(e.base).elements;if(t.length>30)throw new h(_r(e));return or(t)}case`FunctionSet`:{if(!wt.is174&&P(e))return[];if(jt(e.domain))throw new h(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||wt.is174)&&jt(e.range))throw new h(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${I(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return rr(n.map(()=>r)).map(e=>Bt(n,e))}case`RecordSet`:{if(!wt.is174&&P(e))return[];let n=sr(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${I(t)}`);return rr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!wt.is174&&P(e))return[];let n=sr(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${I(e)}`);return rr(n).map(Yn)}case`FilteredSet`:if(!k(e.base)||jt(e.base))throw new h(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(e.base)}\nis not enumerable`);return N(e.base).elements.filter(e.test);case`Union`:{let t=er(e).flatMap((t,n)=>N(tr(t,n,e)).elements);return N(Pn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Qn(e.left)||!Qn(e.right)))throw new h(`Attempted to enumerate S \\cup T when S:\n${I(e.left)}\nand T:\n${I(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Qn(e.left)&&!Qn(e.right))throw new h(`Attempted to enumerate S \\cap T when neither S:\n${I(e.left)}\nnor T:\n${I(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Qn(e.left))throw new h(`Attempted to enumerate S \\ T when S:\n${I(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Tr(e=>Rn(N(e.left),N(e.right)).elements,e=>Tn(lr(e)),e,e);let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return N(n).elements.filter(t=>Er(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to enumerate the non-enumerable set ${I(e)}`);default:throw new h(`Expected a set but found ${I(e)}`)}},N=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return zt(cr(e));let t=typeof e==`object`&&ot(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=wr.sets;n?.push(e);let r=cr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?zt(r):Nn(r);return t&&(t.enumerated=i),i},lr=e=>[...N(e.left).elements,...N(e.right).elements],ur=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?Tr(e=>N(e).elements,e=>Tn(En(e,()=>lr(e))),e,e):N(e).elements,dr=e=>{if(typeof e!=`object`||Gt(e))return N(e).elements;let t=wr.sets;t?.push(e);let n=hr(e);return t?.pop(),n},fr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,pr=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(pr);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(pr)&&e.range.every(pr);case`SetOperation`:return e.operator!==`\\cup`&&pr(e.left)&&pr(e.right);case`FilteredSet`:return pr(e.base);case`ProductSet`:return e.factors.every(pr);default:return!1}},mr=e=>typeof e!=`object`||Gt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?mr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||mr(e.left)||mr(e.right):fr(e)?.some(mr)??!1,hr=e=>{if(e.kind===`Union`)return er(e,dr).flatMap((t,n)=>dr(tr(t,n,e)));if(e.kind===`FilteredSet`&&!jt(e.base))return dr(e.base).filter(e.test);if(fr(e)?.some(mr))return cr(e,dr);if(e.kind!==`SetOperation`)return N(e).elements;if(e.operator===`\\cup`)return!Qn(e.left)||!Qn(e.right)?N(e).elements:[...dr(e.left),...dr(e.right)];let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Qn(n)?dr(n).filter(t=>Er(t,r)===(e.operator===`\\cap`)):N(e).elements},P=e=>{if(typeof e!=`object`||!k(e))throw new h(`Shouldn't call isEmpty() on value ${I(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new h(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(P);case`RecordSet`:return e.sets.some(P);case`FunctionSet`:return!P(e.domain)&&P(e.range);case`Union`:return er(e).every((t,n)=>P(tr(t,n,e)));default:return N(e).elements.length===0}},gr=(e,t,n)=>e.reduce((e,r)=>{let i=e*vr(r,t);if(i>2147483647)throw new h(n());return i},1),_r=e=>`Overflow when computing the number of elements in:\n${I(e)}`,vr=(e,t)=>{if(typeof e!=`object`)throw new h(`Attempted to compute the number of elements in the ${lt(e)} ${I(e)}.`);switch(e.kind){case`ModelValue`:throw new h(`Attempted to compute the number of elements in the model value ${I(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return vr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new h(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new h(`Attempted to compute the number of elements in the overridden value ${I(e)}.`);case`Subset`:{let n=vr(e.base,t);if(n>=31)throw new h(_r(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(P(e.domain))return 1;if(P(e.range))return 0;if(vr(e.range,t)===1)return 1}let n=vr(e.domain,t),r=vr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new h(_r(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&P(e)?0:gr(e.sets,t,()=>_r(e));case`ProductSet`:return t!==`1.7.4`&&P(e)?0:gr(e.factors,t,()=>`Overflow when computing the number of elements in ${I(e)}`);default:return Yt(e),N(e).elements.length}},yr=e=>`Attempted to check if the set ${I(e)}is finite.`,br=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new h(`Attempted to check if the ${lt(e)} ${I(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new h(`Attempted to check if the function:\n${I(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return br(e.base)&&P(e.base);case`Subset`:return br(e.base);case`FunctionSet`:{let t=br(e.domain);if(t&&P(e.domain))return!0;let n=br(e.range);return n&&P(e.range)?!0:n&&(t||vr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!br(e))n.isAllFinite=!1;else if(P(e))return!0;return n.isAllFinite}case`Union`:if(!Qn(e.base))throw new h(`Attempted to check if the nonenumerable set:\n${$n(e)}\nis a finite set.`);return N(e.base).elements.every(br);case`SetOperation`:if(e.operator===`\\cup`)return br(e.left)&&br(e.right);if(e.operator===`\\cap`){if(!br(e.left)&&!br(e.right))throw new h(yr(e));return!0}if(br(e.left))return!0;if(!br(e.right))throw new h(yr(e));return!1;case`FilteredSet`:if(!br(e.base))throw new h(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(e.base)}\nis finite.`);return!0}},xr=(e,t,n=It)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Sr=e=>{if(typeof e!=`object`||!A(e))return;let t=F(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Cr=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!A(t))return`${n} ${lt(t)} ${I(t)}`;let r=Ut(t);return r===`record`?`Attempted to check if element:\n${I(e)}\nis in the record:\n${I(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${I(t)}`},wr={sets:void 0},Tr=(e,t,n,r)=>{let i=wr.sets,a=wr.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof h))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Er=(e,t)=>{let n=wr.sets;if(n===void 0)return kr(e,t);n.push(t);let r=kr(e,t);return n.pop(),r},Dr=(e,t)=>xr(t.elements,e)!==-1,Or=(e,t)=>kn.has(t)?Dn(e,t.elements).isFound:On(e,t.elements),kr=(e,t)=>{if(!k(t))throw new h(Cr(e,t));switch(t.kind){case`Set`:return Yt(e),Tr(Dr,Or,e,t);case`MixedSet`:return On(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!j(e))throw new h(`Attempted to check if the value:\n${I(e)}\nis in the integer interval ${I(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(j(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new h(`Attempted to check if the value:\n${I(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!k(e)||jt(e))throw new h(`Attempted to check if the non-enumerable value\n${at(I(e))}\nis element of\n${at(I(t))}`);return N(e).elements.every(e=>Er(e,t.base));case`FunctionSet`:{if(!A(e)){if(j(e))return!1;throw new h(`Attempted to check if \n${I(e)}\nwhich is not a TLC function value, is in the set of functions:\n${at(I(t))}`)}let n=F(e),r=rn(n.domain);return(r===void 0?jn(t.domain,zt(n.domain)):jn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Er(e,t.range))}case`RecordSet`:{let n=A(e)?F(e):void 0;if(!n||!gt(n.domain)){if(j(e))return!1;throw new h(`Attempted to check if non-record\n${I(e)}\nis in the set of records:\n${I(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=xr(n.domain,e);return i!==-1&&Er(n.range[i],t.sets[r])})}case`ProductSet`:{let n=A(e)?Sr(e):void 0;if(n===void 0){if(A(e)&&F(e).domain.every(e=>typeof e==`number`)||j(e))return!1;throw new h(`Attempted to check if non-tuple\n${I(e)}\nis in the set of tuples:\n${I(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Er(e,t.factors[n]))}case`FilteredSet`:return Er(e,t.base)&&t.test(e);case`Union`:if(!Qn(t.base))throw new h(`Attempted to check if:\n ${I(e)}\nis an element of the non-enumerable set:\n ${$n(t)}`);return N(t.base).elements.some(t=>Er(e,t));case`SetOperation`:return t.operator===`\\cup`?Er(e,t.left)||Er(e,t.right):Er(e,t.left)&&Er(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Sr(e);if(n===void 0){if(j(e))return!1;throw new h(`Attempted to check if the value:\n${at(I(e))}\nis an element of ${at(I(t))}.`)}return n.every(e=>Er(e,t.base))}default:throw new h(Cr(e,t))}},Ar=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Er(e,n):e.range.every((e,r)=>Ar(e,t.range[r],n.range)),F=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;M(e.domain)||vr(e.domain);let t=qn(e.domain);return e.enumerated=Ht(Bt(t,t.map(t=>e.apply(t))),Ut(e)),e.enumerated}throw new h(`Expected a function but found ${I(e)}`)},jr=(e,t,n)=>{let r=at(I(e)),i=at(I(t)),a=n===`1.7.4`;switch(Ut(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Mr=(e,t)=>{if(!wt.is174)return jr(e,t);let n=at(I(t));return Ut(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Nr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Pr=e=>new h(`Attempted to apply function with integer domain to the non-integer argument ${at(I(e))}`),Fr=(e,t,n)=>{throw wt.is174||e.length<32?e.forEach(e=>wn(e,t)):xr(e,t,yn),n},Ir=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ut(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new h(n(e,t));if(a===void 0&&!wt.is174&&Kn(r))throw Pr(t)}let i=Nr(r,t);return i===-1?Tr(xr,Fr,r,t):i},Lr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Er(t,e.domain))throw new h(Ut(e)===`lambda`?jr(e,t):`Attempted to apply a function to ${I(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new h(`Attempted to apply ${I(e)}, which is not a function`);let r=n??jr,i=Ir(e,t,r);if(i===-1)throw new h(r(e,t));return e.range[i]},Rr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,zr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e).domain;return Rr(t)??zt(t)},Br=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!M(e.domain))){if(!Er(t,e.domain))return e;let r=n(e.apply(t));return Ht({kind:`LazyFunction`,domain:e.domain,apply:n=>jn(t,n)?r:e.apply(n),source:e.source},Ut(e))}if(!A(e))throw new h(`Attempted to apply EXCEPT construct to the value ${at(I(e))}.`);let i=F(e),a=Ir(i,t,Mr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Ht(Bt(i.domain,o),Ut(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Kr){let e=Zr(c);if(e!==Kr){let t=Zr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Gr(t,Zr(s))+Gr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ti(e,s)+ti(e,c)|0}return l},Vr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hr=(e,t)=>Math.imul(e^t,16777619),Ur=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vr(t)},Wr=e=>Vr(e+2654435769|0),Gr=(e,t)=>Vr(Math.imul(e,668265261)+t|0),Kr=795548749,qr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zr(t[e]);if(r===Kr)return Kr;n=n+Wr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Zr(e.domain[n]),i=Zr(e.range[n]);if(r===Kr||i===Kr)return Kr;t=t+Gr(r,i)|0}return t},Jr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new h(`TLC has found a state in which the value of a variable contains ${I(e)}`);if(k(e)){N(e).elements.forEach(Jr);return}let t=F(e);t.domain.forEach(Jr),t.range.forEach(Jr)},Yr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Zr(e)===Kr&&Jr(e);return}catch(e){if(!(e instanceof h))throw e;return e}},Xr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Zr=e=>typeof e==`number`?Vr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ur(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=qr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?M(e.domain)?Zr(F(e)):Kr:M(e)?Zr(N(e)):Kr,Qr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$r=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qr(t)},ei=e=>Qr(ri(e)+2135587861|0),ti=(e,t)=>Qr(Math.imul(ri(e),374761393)+ri(t)|0),ni=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ei(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ti(e.domain[n],e.range[n])|0;return t},ri=e=>typeof e==`number`?Qr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?$r(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ni(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ri(F(e)):M(e)?ri(N(e)):$r(ii(e)),ii=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ai(e),ai=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ii(e.base)}>`;if(e.kind===`FilteredSet`&&!M(e))throw new h(`Attempted to compare the non-enumerable set ${I(e)} with another value`);if(k(e))return M(e)?`{${N(e).elements.map(ii).join(`,`)}}`:`<${e.kind} ${I(e)}>`;let t=F(e);return`(${t.domain.map((e,n)=>`${ii(e)}:${ii(t.range[n])}`).join(`,`)})`},oi=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,si=e=>e.reduce((e,t)=>e===0?0:e*vr(t),1),ci=e=>{if(e.kind===`Subset`)return vr(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`&&M(e.domain)&&vr(e.domain)===0)return zt([Bt([],[])]);let t=e.kind===`FunctionSet`?vr(e.range)**vr(e.domain):si(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Fn:t<=1999?N(e):void 0},li=(e,t)=>{if(t)return ci(e);if(M(e))try{return ci(e)}catch(e){if(e instanceof h)return;throw e}},ui=(e,t)=>{let n=e=>I(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return $n(e,t)}},di=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),fi=e=>{if(M(e.domain))try{return F(e)}catch(e){if(e instanceof h)return;throw e}},I=(e,t=!1,n=!1)=>{let r=e=>I(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return oi(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(N(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=li(e,t);return n?r(n):ui(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?fi(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${I(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&wt.is174&&Ut(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&Ut(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ut(e)===`record`||i.domain.every(e=>typeof e==`string`&&di(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):pt(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},pi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${at(I(n))}\n`).join(``)},mi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),hi=(e,t)=>mi.has(e)?new h(t):new n(t),gi=(e,t,r,i)=>new n(`The ${e} argument of ${t} should be a ${r}, but instead it is:\n${I(i)}`),_i=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||_i(r))throw hi(n,`${n} expects a value as argument ${t+1}`);return r},vi=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`number`)throw hi(n,`${n} expects an integer but received ${I(r)}`);return r},yi=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw hi(n,`${n} expects a boolean but received ${I(r)}`);return r},bi=(e,t,n)=>{let r=L(e,t,n);if(!k(r))throw hi(n,`${n} expects a set but received ${I(r)}`);return r},xi=(e,t,n)=>{let r=bi(e,t,n);if(!M(r))throw hi(n,`${n} cannot enumerate the non-enumerable set ${I(r)}`);return r},Si=(e,t,n)=>N(xi(e,t,n)).elements,Ci=(e,t,n)=>{let r=L(e,t,n),i=Sr(r);if(!i)throw hi(n,`${n} expects a sequence but received ${I(r)}`);return i},wi=(e,t,n)=>{let r=L(e,t,n);if(!A(r))throw hi(n,`${n} expects a function but received ${I(r)}`);return F(r)},Ti=(e,t,n)=>{let r=e[t];if(r===void 0||!_i(r))throw hi(n,`${n} expects an operator as argument ${t+1}`);return r},Ei=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),R=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),Di=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ki=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ai=e=>e>2147483647||e<-2147483648,ji=e=>new n(`Overflow when computing ${e}`),Mi={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Ni={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Pi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Fi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ii=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ni[e.operator];if(e.kind!==`Function`)return Mi[e.kind];let t=Ut(e);return t===void 0?`FcnRcdValue`:Fi[t]},Li=e=>Pi[Ii(e)],Ri=(e,t)=>new h(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),zi=(e,t)=>{let r=r=>(...i)=>{let a=wr.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof h&&(e.isLazy===!0||!(r instanceof n))?(wr.sets&&(wr.sets.length=a),Ri(t,r.message)):r}};return{...e,evaluate:r(e.evaluate),evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Bi=(e,t)=>{if(typeof e!=`number`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.IntValue`);return e},Vi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Hi=(e,t,n,r)=>{let i=Vi(e,n,`IntValue`,2);return ki(t,(e,n)=>{let a=Bi(e,i),o=Bi(n,i),s=r(a,o);if(Ai(s))throw ji(`${a}${t}${o}`);return s})},Ui=(e,t,r)=>{if(typeof e!=`number`)throw new n(`The ${t} argument of ${r} should be an integer, but instead it is:\n${I(e)}`);return e},Wi=(e,t,n=e)=>ki(e,(e,r)=>t(Ui(e,`first`,n),Ui(r,`second`,n))),Gi=(e,t,n)=>({...Oi(e,t,n),isLazy:!0}),Ki=(e,t,n)=>{let r=Ti(e,t,n);return()=>r.call([])},qi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ji=()=>({bool:Pu,condition:(e,t)=>{if(typeof e!=`boolean`)throw _u(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw vu(t,n,e);return e},apply:Lr,expectFunction:ju,tuple:Yn,set:Pn,record:Zn,writtenRecord:mt,equal:Zt,enumerate:Vu,unassigned:(e,t)=>{throw Tu(e,t)},primeOutsideAction:e=>{throw Du(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Mu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>ku(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Yi={value:void 0},Xi={isAllowed:void 0},Zi=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Ye(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,V(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${oa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${oa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${oa(e,r[0],n)}, "the left side of =>") ? bool(${oa(e,r[1],n)}, "the right side of =>") : true)`;if(O(t))return ta(e,t,n);let i=dd(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,xu(t))}(${oa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,Su(t,i))}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Rd(r[0],a))return`${Qi(e,i.evaluateUnary)}(${oa(e,r[0],n)})`;let o=r.length===2&&Rd(r[0],a)&&Rd(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(O(e))return!1;let r=Sd(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return aa(e.record);case`FunctionApplication`:return[e.function,...e.args].every(aa);default:return!1}},oa=(e,t,n)=>{let r=(t,r=n)=>oa(e,t,r);switch(t.kind){case`Number`:return ut(t.value)?String(t.value):ta(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(O(t))return ta(e,t,n);let i=Sd(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{qd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ia(t.function,n,e.environment)?r(t.function):aa(t.function)?r(t.function,i):ta(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Qi(e,t)}))`,o=bu(e.environment.runtime.version),s=o?`, ${Qi(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Qi(e,yu(t))}(${r(t.record)})`;case`Record`:{let i=Zd(t.fields);if(Qd(i))return ta(e,t,n);let a=Qi(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Qi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Qi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},sa=(e,t)=>{if(!qi.has(e.kind)||(Xi.isAllowed??=Zi(),!Xi.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=oa(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
87
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Yi.value??=Ji();let o=Yi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ca={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},la={none:0,error:1,warning:3,state:4},ua={0:``,1:`Error: `,3:`Warning: `,4:`State `},da=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===la.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
|
|
88
|
-
(Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${ua[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},fa=`The configuration file did not specify the initial state predicate.
|
|
9
|
+
import{$ as e,B as t,C as n,F as r,G as i,J as a,K as o,N as s,P as c,Q as l,R as u,S as d,V as f,W as p,X as m,Y as h,Z as g,_,at as v,b as y,g as b,h as ee,k as x,nt as S,q as te,tt as C,u as w,v as ne,x as T,y as re,z as ie}from"./worker.js";import{gzipSync as ae}from"node:zlib";const oe=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),se=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),ce=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),le=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ue=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),de=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),fe=e=>e.startsWith(`\\`)?parseInt(e.slice(2),de.get(e[1].toLowerCase())):Number(e),pe=/-{4,} *MODULE\b/,me=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)me[n.charCodeAt(0)]|=e});const E=(e,t)=>e<128&&(me[e]&t)!==0,D=(e,t,n)=>{let r=t;for(;E(e.charCodeAt(r),n);)r++;return r},O=/* @__PURE__ */ new Map;le.forEach(e=>{let t=e.charCodeAt(0),n=O.get(t)??[];n.push(e),O.set(t,n)});const k=(e,t)=>{let n=O.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},he=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(ue.has(n))return n;let r=e[t];return ue.has(r)?r:void 0},ge=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&E(e.charCodeAt(t+1),2)){let n=e.slice(t+1,D(e,t+1,2)),r=n.length;for(;r>0&&!se.has(n.slice(0,r));)r--;let i=se.get(n.slice(0,r));return{text:i??`\\`,length:i===void 0?1:r+1}}let r=he(e,t);if(r!==void 0)return{text:ue.get(r)??``,length:r.length};let i=k(e,t);return i?{text:ce.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},_e=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ve=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>ue.has(e)||_e.has(e));return n===void 0?void 0:{text:n,length:n.length}},ye=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},be=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:D(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?D(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return ye(e,s?o+1:o,e=>e===`.`)-t},xe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Se={n:`
|
|
10
|
+
`,t:` `,r:`\r`,f:`\f`},Ce=(e,t)=>t===9?e+8-e%8:e+1,we=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),Te=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=we.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=D(e,t+2,i);return a===t+2?0:a-t},Ee=(e,t=!1)=>{let n=pe.exec(e);if(!n)throw new r(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,o=e.slice(0,n.index).split(`
|
|
11
|
+
`),s=n.index,c=o.length,l=n.index-o[o.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==l||f>s)&&(d=l,f=l,p=0);f<s;f++)p=Ce(p,e.charCodeAt(f));return Ce(p,e.charCodeAt(s))},h=(e,t,n,r)=>{let a=m();i.push({kind:e,text:t,spelling:r,line:c,column:a,endColumn:a+n-1}),s+=n},g=t=>{for(let n=0;n<t;n++)e.charCodeAt(s)===10&&(c++,l=s+1),s++},_=t=>new r(`${t} at line ${c}, column ${m()}`,void 0,{reason:t,line:c,column:m(),isEnd:s>=e.length});for(;s<e.length;){let n=e.charCodeAt(s);if(n===10||n===32||n===9||n===13){g(1);continue}if(n===92&&e.charCodeAt(s+1)===42){g(ye(e,s,e=>e!==`
|
|
12
|
+
`&&e!==`\r`)-s);continue}if(n===40&&e.charCodeAt(s+1)===42){let t=0;do{if(s>=e.length)throw _(`Unterminated comment`);e.startsWith(`(*`,s)?(t++,g(2)):e.startsWith(`*)`,s)?(t--,g(2)):g(1)}while(t>0);continue}if(n===45&&e.startsWith(`----`,s)){let t=ye(e,s,e=>e===`-`)-s,n=ye(e,s+t,e=>e===` `);e.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,s)){if(h(`ModuleEnd`,`====`,ye(e,s,e=>e===`=`)-s),u--,u<=0)break;continue}if(n===34){let t=c,n=m(),r=[];for(g(1);e.charCodeAt(s)!==34;){let t=e.charCodeAt(s);if(s>=e.length||t===10||t===13)throw _(`Unterminated string`);if(t===92){let t=e[s+1];if(t===void 0||!`ntrf\\"`.includes(t))throw _(`Invalid escape in string`);r.push(Se[t]??t),g(2)}else r.push(e[s]),g(1)}g(1),i.push({kind:`String`,text:r.join(``),line:t,column:n,endColumn:m()-1});continue}let r=Te(e,s,t);if(r>0){h(`Number`,e.slice(s,s+r),r);continue}if(E(n,7)){let t=D(e,s,7),r=e.slice(s,t),i=D(e,s,1);if(i===t){let n=e.charCodeAt(t)===46?D(e,t+1,1):t,i=n>t+1,a=i?e.slice(s,n):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(s,i);h(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let o=a.get(r)??r;a.set(o,o),h(oe.has(r)?`Keyword`:`Identifier`,o,r.length);continue}let o=e[s];if(n>=128&&_e.has(o)){h(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(n===60){let n=be(e,s,t);if(n>0){h(`Step`,e.slice(s,s+n),n);continue}}let l=ge(e,s);if(l){let t=e.slice(s,s+l.length);h(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw _(`Unexpected character ${JSON.stringify(o)}`)}let v=m();return i.push({kind:`End`,text:``,line:c,column:v,endColumn:v}),i},De=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],Oe=De.map(e=>e[0]),ke=new Map(Oe.map((e,t)=>[e,t]).reverse()),A=e=>{let t=ke.get(e);if(t===void 0)throw new re(`Unknown SANY token kind ${e}`);return t},Ae=new Map(De.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),je=Math.max(...[...Ae.keys()].map(e=>e.length)),Me=Array.from({length:je},(e,t)=>je-t),Ne=/----+ *MODULE/y,Pe=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],Fe=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Ie=Fe(String.raw`\.\/\\`),Le=Fe(String.raw`\.\\\/`),Re=String.raw`<(?:[0-9]+|\+|\*)>`,ze=[[`_BM0`,[Ne]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Ie],[`BOR`,Le],[`IDENTIFIER`,Pe],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Re}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Re,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Re}(?:\*\.*|-\.*|\.+)`,`y`)]]],Be=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Ne]]],Ve=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Ne]],[`BAND`,Ie],[`BOR`,Le],[`IDENTIFIER`,Pe]],He=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Ue=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,We=(e,t,n)=>e.map(([e,r])=>({kind:A(e),length:Math.max(...r.map(e=>He(e,t,n)))})).reduce(Ue,{kind:-1,length:0}),Ge=(e,t)=>{let n=Me.find(n=>Ae.has(e.slice(t,t+n))),r=We(ze,e,t);return n===void 0?r:Ue(r,{kind:Ae.get(e.slice(t,t+n))??-1,length:n})},Ke=e=>e+8-e%8,qe=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
|
|
13
|
+
`?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
|
|
14
|
+
`?o=!0:s===` `&&(i=Ke(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},Je=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ye=new Set([...Ae.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Xe=(e,t)=>{let n=0;for(;Ye.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,He(Je,e,t)))},Ze=e=>{let t=qe(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(A(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?et(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
15
|
+
`||e[a]===`\r`?et(o+1,0,void 0,i):et(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=We(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,Oe[a.kind].startsWith(`_BM`)&&(r=`SPEC`),Oe[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(Be);if(r===`PRAGMA`)return c(Ve);for(;n<e.length;){let t=n;if(`
|
|
16
|
+
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=Ge(e,t);if(r.length===0){let n=Xe(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},Qe=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
17
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),$e=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Qe.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),et=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${$e(n)}" (${n.charCodeAt(0)}), `}after : "${$e(r)}"`,tt=e=>{let t=Ze(e);for(let e=t();typeof e!=`string`&&e.kind!==A(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Ke(e):e+1,e.beginColumn);return et(e.beginLine,n,e.image[t],e.image.slice(0,t))}},nt=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],rt=/* @__PURE__ */ new Set([...nt,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),it=[`TYPE`,`TYPE_CONSTRAINT`],at=/* @__PURE__ */ new Set([...nt,...it]),ot=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],st=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},ct=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:et(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:et(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
|
|
18
|
+
`);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=st(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Te(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=ve(e,n)??ge(e,n),m=ot.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},lt=(e,t)=>new _(`TLC found an error in the configuration file at line ${e}\n${t}`),j=(e,t)=>lt(e,`The keyword ${t} appeared twice.`),ut=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),dt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ft=(t,n=`master`)=>{let r=n===`1.7.4`?at:rt,i=ct(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new _(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw v(new _(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),S.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new _(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw lt(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw lt(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw lt(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw lt(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw lt(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw lt(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw lt(t,``);r=l()}if(r.text!==`=`)throw lt(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?ut.get(e):void 0,i=r.has(e)?dt.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw lt(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw j(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw lt(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw j(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!it.includes(e))throw lt(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw j(t,e);c.add(e),h=l()}}return o},pt=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],mt=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(pt),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},ht=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},M=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gt=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},_t={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},vt=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},yt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),bt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),xt=e=>{let t=t=>{let n=ye(e,t,vt);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ye(e,t,yt);if(e.startsWith(`..`,n)&&yt(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,yt)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=yt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,yt)-1,children:[]};if(bt(n))return{kind:`Constant`,first:t,last:ye(e,t,bt)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},N=e=>{let t=e.length===0?void 0:xt(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=_t[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},St={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ct={none:0,error:1,warning:3,state:4},wt={0:``,1:`Error: `,3:`Warning: `,4:`State `},Tt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${wt[n]}${r}`,Et=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===Ct.warning;if(a&&e.errorCodes?.includes(n))throw new f(n,i);if(a&&e.isWarningEnabled===!1||r!==Ct.error&&e.suppressedCodes?.includes(n))return;let o=a&&!e.isTool&&t.size===0?`
|
|
20
|
+
(Use the -nowarning option to disable this warning.)`:``,s=Tt(e.isTool,n,r,`${i}${o}`);a&&t.has(s)||(a&&t.add(s),console.log(s))}}},Dt=`The configuration file did not specify the initial state predicate.
|
|
89
21
|
Can also be caused by trying to run TLC on a specification from
|
|
90
|
-
a module imported with a parameterized INSTANCE statement.`,
|
|
91
|
-
%1%`,!0],[
|
|
22
|
+
a module imported with a parameterized INSTANCE statement.`,Ot=[[1005,w,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
23
|
+
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
24
|
+
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
25
|
+
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
92
26
|
%1%,
|
|
93
27
|
but it produced the following error:
|
|
94
28
|
%2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
|
|
@@ -97,8 +31,8 @@ but it produced the following error:
|
|
|
97
31
|
%1%
|
|
98
32
|
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
99
33
|
the following value:
|
|
100
|
-
%1%`,!0],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
101
|
-
%4%`,!0],[2176,`Applying %1% to the following value,
|
|
34
|
+
%1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
35
|
+
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,ee,!1],[2176,`Applying %1% to the following value,
|
|
102
36
|
which is not %2%:
|
|
103
37
|
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
104
38
|
element is not a bag:
|
|
@@ -110,9 +44,11 @@ element is not a bag:
|
|
|
110
44
|
%5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
|
|
111
45
|
on the right-hand side of a <- after already appearing on the
|
|
112
46
|
left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
|
|
113
|
-
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,
|
|
114
|
-
%
|
|
115
|
-
%1%`,!1],[
|
|
47
|
+
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Dt,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
|
|
48
|
+
cannot be used as a %3%`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
49
|
+
%1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
|
|
50
|
+
but TLC can handle only specifications with one next-state relation.`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
|
|
51
|
+
%1%`,!1],[2245,`In the configuration file, the module name %1% is not a module in the specification.`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
116
52
|
but instead found %3%.
|
|
117
53
|
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
118
54
|
but didn't find one.
|
|
@@ -120,7 +56,7 @@ but didn't find one.
|
|
|
120
56
|
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
121
57
|
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
122
58
|
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
123
|
-
%4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
59
|
+
%4%`,!0],[2272,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property: Let A be the formula at %2%; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2273,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at %2% (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2274,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that infinitely many %1% steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at %2% (compare page 91 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
124
60
|
%2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
|
|
125
61
|
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
126
62
|
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
@@ -128,15 +64,27 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
|
|
|
128
64
|
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
129
65
|
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
130
66
|
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
131
|
-
`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]]
|
|
67
|
+
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let kt;const At=()=>kt??=Ot.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),jt=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,Mt=e=>jt.test(e)?void 0:At().find(t=>t.pattern.test(e))?.message,Nt=e=>e instanceof x||Mt(e.message)?.isEvalException===!0,Pt=/* @__PURE__ */ new Map([[1e3,`
|
|
132
68
|
: `],[2105,`failed.
|
|
133
69
|
`],[2154,`but it produced the following error:
|
|
134
|
-
`],[2213,`:
|
|
135
|
-
`],[2281,` - specifically: `]
|
|
136
|
-
`)
|
|
137
|
-
from outside that declaration's scope.`,wo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:b(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&xo(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:bo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?yo(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&vo(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Co}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=So(n.operand);if(l.isSufficesOpen){if(uo(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=xo(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?io(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=ho(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:go(e);if(!c)return;let f=uo(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=uo(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(vo(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Co}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},To=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:b(e.location.range),message:n}),!0)},Eo=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=b(r),a=e.params.filter((r,i)=>{let a=Ka(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:b(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Do=(e,t,n,r)=>{if(!_o(e))return!1;let i=po(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ka(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&wo(e,i,o,t,n,r),o!==void 0},Oo=(e,t,n,r)=>{let i=e.location;if(Ro(e,n,r))return;let a=za.get(e);if(a!==void 0)return a;if(Ba(t))return e.kind===`Apply`?e.args.length:0;let o=Ka(n,t);if(o?.isNonFact){r.errors.push({location:b(oo(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Do(e,n,r,!1)||lo(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Ia),o)return o.arity;let s=ro(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,za.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Ka(n,c)!==void 0||ro(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=b(e.kind===`Apply`&&l===`-.`?ao(i,`-`):oo(e,t));if(!co(t)||lo(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=so(e);d&&i.range&&r.errors.push({location:b(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},ko=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>Qa(e,eo(t.pattern),t.pattern.ranges,n),t)),Ao=(e,t)=>e.kind===`Identifier`&&e.name===t&&O(e)||Ye(e).some(e=>Ao(e,t)),jo=(e,t)=>{e.kind===`FunctionConstruction`&&Ao(e.body,t)&&(e.isRecursive=!0),Ye(e).forEach(e=>jo(e,t))},Mo=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?to(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:b(o),message:e})},c=e.kind===`Function`?ko(e.bounds,t,i):$a(t,e.params,i),l=Ka(c,a)??qa(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(z(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),jo(e.body,a),e.isSelfReferential=Ao(e.body,a)):z(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Ya(a,Ka(t,a)??qa(a,i,o),{kind:`Definition`,arity:Ua(e),range:o},i)},No=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ka(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ua(t),params:Wa(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Wo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ba(t.name)?e:s(e,e=>!Ha(t.location,e.location)),o={name:t.name,arity:Ua(t),kind:`Definition`,range:t.location.range,parent:a};if(Ga(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ba(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Mo(t,a,u,i)?{...o,params:Wa(t)}:a},a),()=>!0)},Po=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ka(t,r)??qa(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Fo=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Po(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:b(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Io=(e,t,n)=>{if(Fo(e,t,n))return;let r=e.operator,i=io(r,t,n),a=Oo(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:b(e.argumentsRange??oo(e,r)),message:`The operator ${r} requires ${a-(Po(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Lo(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:b(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Oo(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else z(i,t,n);return!0}if(i.kind===`Lambda`){z(i,t,n);let o=i.params.length===c;return!o&&La.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??oo(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return z(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=io(u,t,n)?.params??[],f=Oo(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(oo(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Lo=(e,t,n)=>{e.kind===`Identifier`?Oo(e,e.name,t,n):z(e,t,n)},Ro=(e,t,n)=>{let r=Ra.get(e);return r?(r.args.forEach(e=>Lo(e,t,n)),n.errors.push(r.error),!0):!1},z=(e,t,n)=>{if(La.has(e)&&!n.isGenerated){z(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>z(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Fo(e,t,n))return;let r=e.name,i=Oo(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:b(oo(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Oo(e,e.operator,t,n);return;case`Apply`:Io(e,t,n);return;case`Lambda`:z(e.body,Qa(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:z(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&z(e.other,t,n);return;case`Let`:z(e.body,No(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(e.body,ko(e.bounds,t,n),i(to(e.bounds)));return;case`UnboundedQuantifier`:z(e.body,Qa(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&z(e.set,t,n),z(e.body,Qa(t,eo(e.pattern),e.pattern.ranges,n),i(eo(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:z(e.predicate,ko([e.bound],t,n),i(eo(e.bound.pattern)));return;case`SetMap`:z(e.expression,ko(e.bounds,t,n),i(to(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:b(r.location.range??ao(r.location,r.name)),message:`Non-unique fields in constructor.`}),z(r.value,t,n)});return;case`Except`:z(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),z(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:z(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(To(e,n))return;z(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Eo(e,t,n);return;case`Subexpression`:if(Ro(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Lo(e,t,n)),Do(e,t,n,!1)}},zo=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Fo(e,t,n)||Do(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Ka(t,r)?.isNonFact?n.errors.push({location:b(oo(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||z(e,t,n)}),Bo=(e,t,n)=>(e.set&&z(e.set,t,n),Xa(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Vo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Bo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Vo(t,e.scope,e.unit,!0):z(t,e.scope,e.unit),e),{scope:t,unit:n});return z(e.conclusion,i.scope,i.unit),i.scope},Ho=(e,t,n)=>e.kind===`AssumeProve`?Vo(e,t,n):(z(e,t,n),t),Uo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&zo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Go(t,e,r),t)},Wo=(e,t,n)=>{let r=Zo(e,t,n);return e.name===void 0?r:Xa(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Go=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Ho(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Uo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Uo(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return zo(r.facts,t,n),o(t);case`Instance`:return o(Wo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Wo(t,e,i):No([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),Uo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(Qa(ko(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Qa(ko(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...to(r.bounds),...r.names]}),Uo(e.proof,a(t),n),a(o)}default:return Uo(e.proof,a(t),n),a(t)}},Ko=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ho(e.statement,void 0,t);e.name!==void 0&&Za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Uo(e.proof,n,t),r&&(r.isInProof=!1)},qo={line:0,column:0},Jo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Yo=(e,t)=>{let n=new Map([...Va,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Xo=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){z(n,a,i);return}let r=Oo(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new l(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:b(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:b(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),u=e=>!Ka(a,e.name)&&!ro(e.name,i);return c.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(u).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:b(r),message:`Substitution missing for symbol ${t.name} declared at ${b(a)} \nand instantiated in module ${n}.`})}),s},Zo=(e,t,n)=>{let r=n.getInstance(e);return Xo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Xa(e,t,r,n),t)},Qo=(e,t,n,r)=>{let i=Yo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Xo(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:qo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},$o=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof l)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},es=(e,t)=>{let n=Yo(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...Va,...t.bound].map(([e,t])=>[e,{...t,position:qo}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>Za(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return $o([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Ya(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);Jo(e,t)?z(t.body,void 0,i):Mo(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:Ua(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);$a(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Za(t,e,i)),e.name!==void 0&&Za(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);z(e.expression,void 0,r),e.name!==void 0&&Za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Ko(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>zo(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:b(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},ts=/* @__PURE__ */ new WeakSet,ns=/* @__PURE__ */ new WeakSet,rs=(e,t,n=/* @__PURE__ */ new Set)=>{let r=ls(e,(e,r)=>rs(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&O(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&O(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},is=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),as=/* @__PURE__ */ new WeakMap,os=e=>as.get(e)??e.name,ss=(e,t)=>(os(t)!==e.name&&as.set(e,os(t)),e),cs=(e,t)=>ss(e.kind===`Function`?{...e,bounds:is(e.bounds,e=>t(e,[])),body:t(e.body,to(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),ls=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>cs(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:is(e.bounds,n),body:t(e.body,to(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,eo(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,eo(e.bound.pattern))};case`SetMap`:return{...e,bounds:is(e.bounds,n),expression:t(e.expression,to(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},us=`LAMBDA`,ds=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return ls(e,(e,n)=>(r.push(...ds(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},fs=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},ps=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ms=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},hs=(e,t)=>e.map(e=>({pattern:ms(e.pattern,t),set:e.set})),gs=(e,t)=>e.kind===`Function`?{...e,bounds:hs(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},_s=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>ss({...gs(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:hs(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ms(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ms(e.bound.pattern,n),set:e.bound.set}};default:return e}},vs=e=>`${e}@ENABLED`,ys=(e,t)=>e.modes.get(t)??e,bs=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!O(e)&&t.instantiation.variables.has(e.name),xs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>xs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(bs(e,t,n))return[e.name];let r=O(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?xs(r.body,t,/* @__PURE__ */ new Map):void 0},Ss=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return bs(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:vs(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Ds(e.expression,ys(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Ds(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Ds(e.subscript,ys(t,`Primed`),n),location:r},Ds(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=xs(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:vs(r),location:e.location},location:e.location},Ds({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Cs=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Ia}),ws=(e,t)=>e.map(e=>Cs(e.name,t)),Ts=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...ws(t,r),...i.map(e=>Cs(e,r))],location:r},location:r}},Es=(e,t)=>e.instantiation.isParameterized(t)?ks(e,t):void 0,Ds=(e,t,n)=>{let r=e=>Ds(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!O(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Ds(e.expression,ys(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Ds(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},ys(t,`Enabled`),n)};let s=Ss(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return ts.add(n),n;let r=Es(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&Ua(o)>0?Ts(r,a,Ua(o),e.location):{kind:`Apply`,operator:r,args:ws(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||ns.has(e),c=e=>(s&&ns.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:us,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:us,args:n,resolution:Ia},location:e.location};if(o)throw new l(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Es(t,e.operator);return u===void 0?c({...e,args:n}):{...e,operator:u,args:[...ws(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Es(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Ts(n,a,Ua(r),e.location):{...e,operator:n}}let c=fs(t),u=ls(e,(e,i)=>i.length===0?r(e):Ds(e,t,ps(n,i,c)));return _s(u,n,c)},Os=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Cs(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ks=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=fs(e),o=gs(cs(i,(t,n)=>Ds(t,e,ps(/* @__PURE__ */ new Map,n,a))),a);return Os(o,r.params,i.location)}):t},As=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ds(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Es(i,e)??e,getQualifiedKey:t=>{let n=Es(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Os(r,e.params,r.location)):t}}},js=e=>e.kind===`Let`&&e.instances!==void 0||Ye(e).some(js),Ms=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=ls(e,e=>Ms(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ha(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Ns=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Ps=(e,t)=>e.definitions.some(e=>js(e.body))||e.assumptions.some(e=>js(e.expression))||e.theorems.some(e=>{let t=Ns(e);return t!==void 0&&js(t)})?{...e,definitions:e.definitions.map(e=>cs(e,e=>Ms(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ms(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Ns(e);return n===void 0?e:{...e,statement:Ms(n,t,[])}})}:e,Fs=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),Is={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Ls=(e,t)=>{let n=Is[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Rs=(e,t)=>`${e}${t}`,zs=(e,t,n)=>`${e}${t}${n}`,Bs=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Vs=(e,t,n)=>`${e},${t},${n}`,Hs=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Us=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ws=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Gs=(e,t,n,r)=>({...Hs(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Ks=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,qs=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Js=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...Gs(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Ys=Gs(`$Set`,0,[2],[1]),Xs=Gs(`$Junction`,0,[3],[1]),Zs=Gs(`$Choose`,0,[2],[1]),Qs=Gs(`$Function`,0,[3],[1]),$s=Gs(`$FcnApply`,0,[2,2],[1,1]),ec=Gs(`$RcdSelect`,0,[2,0],[1,1]),tc=Gs(`'`,2,[1],[0]),nc=Gs(`ENABLED`,1,[2],[0]),rc=Gs(`[]`,3,[3],[0]),ic=Gs(`$SquareAct`,2,[2,1],[0,0]),ac=Gs(`$WF`,3,[1,2],[0,0]),oc=Gs(`$TemporalExists`,3,[3],[0]),sc=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),cc=e=>e.map(e=>({name:e,arity:0})),lc=(e,t)=>t.location.range?s(`${e}.`,t.location.range):new l(`${e} at line ${t.location.line}, column ${t.location.column}`),uc=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),dc=e=>e.kind!==`Let`&&e.kind!==`Label`,fc=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:_(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=_(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Js.get(t)??Fs.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Hs(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(zs(e,n,t))}),t.data.constraints.forEach((e,t)=>Us(r.constraints,t,e)),Ws(r.argConstraints,Rs(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ws(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Ks(e,n))throw new l(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new l(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Vs(t,n,r)),s=Hs(Math.max(e.level,...t.filter((t,n)=>qs(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{qs(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Us(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Us(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Us(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Us(s.constraints,t,Ks(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Us(s.constraints,e,Ks(r,a)))}))}),e.argParams.forEach(e=>{let t=Bs(e),n=a(t.operator)?.operator;n&&Us(s.constraints,t.param,Ks(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ws(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Ws(s.argConstraints,Rs(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Ws(s.argConstraints,Rs(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Bs(e),n=a(t.operator);n&&Ws(s.argConstraints,Rs(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Bs(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Bs(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(zs(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(zs(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(zs(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,cc(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Hs();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=sc(n,cc(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw lc(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw lc(`Action used where only temporal formula or state predicate allowed`,e);uc.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&dc(n)&&n.kind!==r)throw lc(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=_(e,n);t.constraints.forEach((e,t)=>Us(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ws(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof l)||t.sany?t:lc(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Hs();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return u(n,e),i(Xs,n)}case`Prime`:case`Unchanged`:return s(tc,[e.expression],t);case`Enabled`:return s(nc,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(rc,[n])}case`If`:return s(Xs,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Xs,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(Xs,[e.body],t,e.bounds.map(e=>e.set),to(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw lc(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?oc:Xs,[e.body],t,[],e.names);case`Choose`:return s(Zs,[e.body],t,e.set?[e.set]:[],eo(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Ys,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Ys,[e.predicate],t,[e.bound.set],eo(e.bound.pattern));case`SetMap`:return s(Ys,[e.expression],t,e.bounds.map(e=>e.set),to(e.bounds));case`FunctionConstruction`:return s(Qs,[e.body],t,e.bounds.map(e=>e.set),to(e.bounds));case`Record`:return s(Qs,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Ys,e.fields.map(e=>e.value),t);case`Except`:return s(Ys,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i($s,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Ys,e.args,t)}]);case`Bracket`:return Hs();case`FieldAccess`:return i(ec,[a(e.record,t),{data:Hs()}]);case`BoxAction`:case`AngleAction`:return s(ic,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(ac,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Hs()}},ee=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>ee(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Ye(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,sc(t,cc(e.names))),i;default:return ls(e,(e,n)=>(a(e,r,sc(t,cc(n))),e)),i}},g=(e,t,n,r)=>{let i=sc(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=ee(n,i),c={...Hs(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(Rs(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(zs(e.name,n,t.name))).map(e=>Vs(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(Bs(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Bs(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Hs(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=g(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:a}},pc=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?pc(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Hs(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Us(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ws(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},mc=(e,t,n,r)=>{let i=fc(t),o=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?pc(t.statement,/* @__PURE__ */ new Map,i).level:o([t.statement]):0},c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=b(e.statement),n=()=>s(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...c(e.proof)]:e.body.kind===`Qed`?c(e.proof):[]}):[],l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>s(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>o([e.set])!==0).flatMap(e=>e.set.location.range?[{location:b(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?c(e.proof):[]]}):[],u=$o([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?pc(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?c(e.proof):[]];if(n.length>0)throw a(n)}})),...n],r);if(u.length>0)throw a(u,!1,void 0,r)},hc=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),gc=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),_c=/* @__PURE__ */ new Set([...hc,...gc,`Enabled`]),vc=/* @__PURE__ */ new Set([`~>`,`-+->`]),yc=/* @__PURE__ */ new Set([...vc,`\\cdot`]),bc=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),xc=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Sc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Cc=(e,t)=>bc.has(e)||t.builtins.get(e)?.isStateLevel===!0,wc=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(hc.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(gc.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&vc.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(_c.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&yc.has(e.operator))&&(r[0]|=1),_c.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Sc(e);if(u!==void 0&&!O(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel)&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{Cc(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),xc.has(u)&&(r[0]|=8),!a&&Cc(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=32)}}Ye(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Tc=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Ec=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Dc=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Oc=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=wc(Tc(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Ec(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Ec(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Dc(t[e],l[e*r])))),p=Ec(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},kc=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Ac(Tc(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Ac=(e,t)=>{let n=t.facts.words,r=wc(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=kc(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Dc(e.callee,r[0])||(i[0]|=r[0]&14)}),i},jc=(e,t)=>!(kc(e,t)[0]&1),Mc={any:2,repeated:4,streamed:8},Nc=(e,t,n=`any`)=>(kc(e,t)[0]&Mc[n])!==0,Pc=(e,t)=>{let n=kc(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Fc=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},Ic=(e,t)=>{let n=Ac([e],t);return n[0]&16?void 0:Fc(n)},Lc=(e,t)=>!!(Ac([e],t)[0]&1),Rc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=wr.sets,a=i??[],o=a.length;wr.sets=a;try{return n()}catch(e){throw Nd(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,wr.sets=i}},zc=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Bc=e=>!e.includes(void 0),Vc=e=>e.variables.map(()=>void 0),Hc=(e,t,n)=>{let r=[...e];return r[t]=n,r},Uc=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Wc=e=>e.kind===`Identifier`?e.name:void 0,Gc=(e,t,n)=>{if(t.kind===`Label`)return Gc(e,t.body,n);let r=Wc(t);if(r===void 0)return;let i=Ou(n,r);if(i?.kind===`Thunk`)return Gc(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=dd(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Gc(e,o.body,o.scope):void 0},Kc=(e,t,n)=>{if(t.kind===`Prime`)return Gc(e,t.expression,n);if(t.kind===`Label`)return Kc(e,t.body,n);let r=Wc(t);if(r===void 0)return;let i=Ou(n,r);if(i?.kind===`Thunk`)return Kc(e,i.expression,i.scope);if(i)return;let a=dd(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Kc(e,a.body,a.scope):void 0},qc=e=>{if(typeof e!=`boolean`)throw new h(`TLC expected a boolean expression.`);return e},Jc=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Yc=(e,t,n)=>{t===void 0?Bc(n)&&e.onState(n):Bc(n)&&Jc(e)?Zc(e,t,n):t.kind===`Predicate`?Qc(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?sl(e,t.expression,t.rest,t.scope,n):Xc(e,t,n)&&Yc(e,t.rest,n)},Xc=(e,t,n)=>{let r=e.environment,i=H(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return H(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Eu(t,r.runtime.version):t}})();return!Zt(i,a)},Zc=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){sl(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Xc(e,r,n):!qc(H(r.expression,zc(e,r.scope,n))))return}e.onState(n)},Qc=(e,t,n,r,i)=>Rc(e,t,()=>{switch(t.kind){case`Let`:Qc(e,t.body,n,Ed(t.definitions,zc(e,r,i)),i);return;case`Label`:Qc(e,t.body,n,r,i);return;default:if(al.has(t.kind))throw new h(`The state relation is not a boolean expression.`);Rc(e,t,()=>ol(e,t,n,r,i))}}),$c=(e,t,n,r)=>{qc(t)&&Yc(e,n,r)},el=(e,t,n,r,i)=>{let a=zc(e,r,i);if(t.kind===`Identifier`){let o=Ou(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Qc(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Qc(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:dd(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&jc(s,e.environment))){Qc(e,c.body,n,c.scope,i);return}$c(e,H(t,a),n,i);return}let o=fd(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Qc(e,o.body,n,wd(o,t.args,a),i):$c(e,H(t,a),n,i)},tl=(e,t,n,r,i)=>{let a=n[r];a===void 0?Yc(e,t,Hc(n,r,i)):Zt(a,i)&&Yc(e,t,n)},nl=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),rl=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Gc(e,a,r):Kc(e,a,r),c=zc(e,r,i);if(s===void 0){H(t,c)===!0&&Yc(e,n,i);return}let l=H(o,c),u=i[s];if(t.operator===`=`){tl(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)H(t,c)===!0&&Yc(e,n,i);else{if(!Qn(d))throw new h(`The right side of \\IN is not enumerable.`);for(let t of dr(d))Yc(e,n,Hc(i,s,t))}},il=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),al=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),ol=(e,t,n,r,i)=>{let a=zc(e,r,i);switch(t.kind){case`Identifier`:el(e,t,n,r,i);return;case`Apply`:if(il.has(t.operator)&&t.args.length===2){rl(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(qc(H(t.args[0],a))){Qc(e,t.args[1],n,r,i);return}Yc(e,n,i);return}el(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>nl(`Predicate`,t,r,e),n);Qc(e,a[0],t,r,i);return}let o=a[a.length-1];Qc(e,Uc(t,a.length-1),nl(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Qc(e,t,n,r,i));return}Qc(e,Uc(t,a.length-1),n,r,i),Qc(e,a[a.length-1],n,r,i);return}case`Exists`:Ku(t.bounds,a,r=>(Qc(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Ku(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Yc(e,n,i);return}let o=r.slice(1).reduce((e,n)=>nl(`Predicate`,t.body,n,e),n);Qc(e,t.body,o,r[0],i);return}case`If`:Qc(e,qc(H(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>qc(H(e.condition,a)))?.body??t.other;if(o===void 0)throw new h(`TLC encountered a CASE with no conditions true.`);Qc(e,o,n,r,i);return}case`FunctionApplication`:{let r=Zu(H(t.function,e.isInit?a:Mu(a)));if(r){Qc(e,r.body,n,Qu(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){sl(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Qc(e,t.action,n,r,i),sl(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Qc(e,t.action,nl(`Changed`,t.subscript,r,n),r,i);return}}$c(e,H(t,a),n,i)},sl=(e,t,n,r,i)=>Rc(e,t,()=>{let a=Gc(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&tl(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Yc(e,n,i);return}let s=o.reduceRight((e,t)=>nl(`Unchanged`,t,r,e),n);sl(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=Ou(r,t.name);if(a?.kind===`Thunk`){sl(e,a.expression,n,a.scope,i);return}let o=a?void 0:dd(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){sl(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});Zt(s,c)&&Yc(e,n,i)}),cl=(e,t,n,r,i=!1)=>{let a=e.callStack;if(!a)throw Error(`The replay needs an environment that records its call stack`);return{environment:e,callStack:a,isInit:t,isEnabled:i,current:n,onState:r}},ll=/* @__PURE__ */ Error(`The replay found a successor`),ul=(e,t,n,r)=>{let i=cl(r,!1,n,()=>{throw ll},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=nl(`Changed`,e.subscript,t,void 0);Qc(i,e.action,n,t,Vc(r))}else Qc(i,e,void 0,t,Vc(r));return!1}catch(e){if(e!==ll)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},dl=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=cl(t,!0,void 0,n),o=i.reduceRight((e,t)=>nl(`Predicate`,t.expression,t.scope,e),void 0);Qc(a,r.expression,o,r.scope,Vc(t))},fl=(e,t,n,r)=>{e.some(e=>al.has(e.expression.kind))||e.forEach(e=>{let i=[],a=cl(n,!1,t,e=>i.push(e));Qc(a,e.expression,void 0,e.scope,Vc(n)),i.forEach(t=>r(t,e))})},pl=/* @__PURE__ */ new WeakMap,ml=/* @__PURE__ */ new WeakMap,hl=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},gl=(e,t,n)=>{let r=e.slice();return r[t]=n,r},_l=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,vl=(e,t)=>{let n=new h(t);return e.isInit?n:o(n,m.error)},yl=(e,t,n,r)=>{let i=gu(n);return r&&al.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${_l(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},bl=(e,t,n)=>{let r=Li(t),i=B(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${_l(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
138
|
-
`:``}${i}`},xl=(e,t,n)=>Sl(e,t,H(t,n)),Sl=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw vl(e,yl(e,n,t,r))},Cl=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=Id(n,r.environment))(r),wl=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Tl=(e,t,n)=>{let r=n?pl:ml,i=r.get(e);if(i)return i;let a=nu(e,t,n);return r.set(e,a),a},El=(e,t)=>{if(t.constants.has(e))return;let n=Fu(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Dl=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Dl(e.expression,t,!1,r);if(e.kind!==`Identifier`||O(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=El(e.name,t);if(a&&!r.has(a))return r.add(a),Dl(a.body,t,n,r)},Ol=(e,t,n)=>Dl(e,t,!n),kl=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return kl(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Ed(e.definitions,hl(r,t,n));return kl(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Ou(t,e.name);if(a?.kind===`Thunk`)return kl(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=El(e.name,r.environment);if(s)return kl(s.body,void 0,n,r,i)},Al=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||O(e))||!t&&e.kind===`Prime`,jl=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>jl(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[r];let i=El(e.name,t);if(i)return n.add(e.name),jl(i.body,t,n)},Ml=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Nl=(e,t,n)=>Ml.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||wl(e.operator)&&(Al(e.args[0],n)||Ol(e.args[0],t,n)!==void 0)||O(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Pl=/* @__PURE__ */ new Set,Fl=(e,t)=>{if(O(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return ls(e,(e,i)=>{let a=r.isReadOnly?Fl(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Il=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||O(e)?void 0:Fu(r,t);return i&&!n.has(i)&&(n.add(i),Il(i.body,t,n))?!0:Ye(e).some(e=>Il(e,t,n))},Ll=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Ol(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=jl(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Nl(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Tl(e,t,n)}},Rl=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(Ic(e,t)===void 0||Il(e,t,/* @__PURE__ */ new Set))return!0;let n=Fl(e,Pl);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},zl=(e,t,n)=>{let r=e.map(e=>Ll(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Jc(t);for(let s=e;s<r.length;s++){if(s>0&&f&&iu(u)){d??=hl(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=Cl(a,e,n,d);if(!Sl(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=hl(t,n,u);let r=Cl(i,s,e.expression,d);if(!Sl(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=hl(t,n,u);let r=Cl(i,s,e.value,d),a=u[e.index];if(a===void 0)u=gl(u,e.index,r),d=void 0;else if(!Zt(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let t of e.indices){let e=(r??u)[t];if(e===void 0)r??=u.slice(),r[t]=n[t];else if(!Zt(e,n[t]))return}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Bl=e=>(t,n,r,i,a,o)=>{xl(t,e,hl(t,n,r))&&o(r,i)},Vl=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=hl(r,i,a);if(a[l]!==void 0){xl(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Qn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${_l(r)}, the right side of \\IN is not enumerable.`;throw vl(r,`${t}\n${B(e)}`)}let p=dr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(gl(a,l,p[e]),o)}},Hl=/* @__PURE__ */ new WeakMap,Ul=e=>{let t=Hl.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Ul),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Hl.set(e,n),n},Wl=(e,t)=>{let n=e.args[0],r=Bl(e),i=(e,r,i)=>kl(n,r,i,e,!t)??-1,a=Vl(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=H(e.args[1],hl(t,n,o));l(gl(o,u,d),s)}},Gl=(e,t,n)=>{let r=B(e);return(i,a,o,s,c,l)=>{let u=hl(i,a,o),d=H(e.function,n?u:Mu(u)),f=Zu(d);if(f!==void 0){Tl(f.body,t,n)(i,Qu(f,e,u),o,s,c,l);return}if(!A(d))throw vl(i,`In computing ${_l(i)}, a non-function (${Li(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw vl(i,`In computing ${_l(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Kl=(e,t)=>{if(jl(e,t))return zl([Ul(e)],t,!1);if(e.kind===`Tuple`)return Tl(Ul(e),t,!1);let n=Ul(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Ou(i,e.name):void 0;l?.kind===`Thunk`?Tl(Ul(l.expression),t,!1)(r,l.scope,a,o,s,c):xl(r,n,hl(r,i,a))&&c(a,o)}},ql=(e,t,n)=>{let r=e.operator,i=Bl(e),a=O(e)?void 0:dd(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Vd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Tl(a.body,t,n),o.body(e,i(hl(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=hl(a,o,s),f=fd(e,d);f?.kind===`Closure`?Tl(f.body,t,n)(a,wd(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Jl=(e,t,n)=>{let r=Bl(e),i=O(e)?void 0:El(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Ou(s,e.name);f?.kind===`Thunk`?Tl(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Tl(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Yl=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||O(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!O(i))return;let a=Dl(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Xl=e=>e.kind===`And`?e.operands.flatMap(Xl):[e],Zl=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Nl(e,t,!1),Ql=e=>{let t=[];return(n,r,i)=>{let a=hl(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Sl(n,i,Cl(t,r,i,a)))return}}},$l=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Xl(e),r=n.findIndex(e=>!Zl(e,t)||Yl(e,t)),i=r===-1?void 0:Yl(n[r],t);return i?{...i,before:r===0?void 0:Ql(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>$l(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||O(e))return;let r=dd(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=$l(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!O(o))return;let s=i.before,c=s&&Vd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(hl(e,t,n)),n))}},eu=(e,t,n)=>{let r=Ou(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},tu=(e,t,n)=>{let r=e.map(e=>Tl(e,t,n)),i=n?[]:e.map(e=>$l(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&eu(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},nu=(e,t,n)=>{let r=e=>Tl(e,t,n);switch(e.kind){case`And`:return zl(e.operands,t,n);case`Or`:return tu(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=zu(H(a.set,hl(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,ku(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Rl(e,t);if(o){let r=zl(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=hl(n,i,a),d=e.bounds.map(e=>zu(H(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=ku(t,o.names[e],r);if(e===d.length-1){let e=hl(n,i,a);if(!o.guards.every(t=>xl(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Ku(e.bounds,hl(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Ic(e,t)!==void 0&&!Il(e.body,t,/* @__PURE__ */ new Set)?Fl(e,Pl):void 0;return(t,n,r,o,s,c)=>{let l=[];Ku(e.bounds,hl(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Ou(n,e)?.kind===`Value`)){u.every(n=>xl(t,e.body,hl(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&iu(r)?u.slice(n).every(n=>xl(t,e.body,hl(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=H(e.condition,hl(r,i,a));if(typeof l!=`boolean`)throw vl(r,bl(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=hl(r,i,a),u=t.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw vl(r,`In computing ${_l(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Li(t)}) was used as a guard condition of a CASE.\n${gu(e.source)}`)})?.body??n;if(!u)throw vl(r,`In computing ${_l(r)}, TLC encountered a CASE with no conditions true.\n${B(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Od(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Ed(e.definitions,hl(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new h(`UNCHANGED appears in an initial predicate at ${mu(e)}`)}:Kl(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Ul(e.subscript),a=(e,n,r)=>{try{return xl(e,i,hl(e,n,r))}catch(n){throw e.isEnabled?Eu(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Ul(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Jl(e,t,n);case`FunctionApplication`:return Gl(e,t,n);case`Apply`:{let i=e.args;if(wl(e.operator)){let r=Ol(i[0],t,n);if(r!==void 0)return e.operator===`=`?zl([e],t,n):Vl(e,()=>r);if(Al(i[0],n))return Wl(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=H(i[0],hl(t,n,r));(typeof c==`boolean`?c:Pu(c,`the left side of => at ${mu(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return ql(e,t,n)}default:return Bl(e)}},ru=e=>e.variables.map(()=>void 0),iu=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},au=(e,t)=>{let n=t.state;if(!n||!iu(n))throw new h(`ENABLED needs a complete state at ${mu(e)}`);let r=t.environment;if(r.callStack)return ul(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return Tl(e,r,!1)(i,t.scope,ru(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},ou=(e,t,n,r)=>{let i={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};Tl(e,t,!0)(i,r,ru(t),void 0,!1,e=>{if(!i.isStopped){if(!iu(e))throw o(new te([...e]),m.error);i.isStopped=n(e)}})},su=(e,t,n)=>{let r=[];return ou(e,t,e=>(r.push(e),!1),n),r},cu=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return Tl(e,n,!1)(a,i,ru(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!iu(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new y(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},lu=(e,t,n,r)=>{let i=[];return cu(e,t,n,e=>(i.push(e),!1),r),i},uu=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),du=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),fu=e=>du.has(e.kind)||e.kind===`Apply`&&uu.has(e.operator),pu=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&st(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},mu=e=>`line ${e.location.line}, column ${e.location.column}`,hu=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,B=e=>{let t=e.location.range;return t?hu(t):mu(e)},gu=e=>e.kind===`Number`?e.text??String(e.value):B(e),_u=(e,t)=>new h(`A non-boolean expression (${Li(t)}) was used as the condition of an IF.\n${B(e)}`),vu=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new h(`A non-boolean expression (${Li(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${gu(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new h(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Li(n)}.\n${B({...e,location:{...e.location,range:{...r,end:i}}})}`)},yu=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${I(n)}\n${B(e)}`,r=e=>`Attempted to apply function:\n${at(I(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!A(i))throw new h(`Attempted to select field "${t}" from a non-record value ${at(I(i))}\n${B(e)}`);let a=Ut(i);if(a===`tuple`)throw Pr(t);return Lr(i,t,a===`record`?n:r)}},bu=e=>e===`1.7.4`?(t,n)=>jr(t,n,e):void 0,xu=e=>t=>{if(!A(t))throw new h(`Attempted to apply the operator DOMAIN to a non-function\n(${Li(t)})\n${B(e)}`);return zr(t)},Su=(e,t)=>(n,r)=>{if(!k(n)||jt(n))throw new h(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${B(e)}`);return t.evaluate([n,r])},Cu=e=>o(new h(`TLC can't handle real numbers: ${e.text} at ${mu(e)}`),m.configParseError),wu=e=>o(new h(`TLC can't handle a number this big: ${e.text??e.value} at ${mu(e)}`),m.error),Tu=(e,t)=>new _(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${B(t)}`,e),Eu=(e,t)=>e instanceof _&&t!==`1.7.4`?new h(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Du=e=>new h(`A primed expression appears outside an action at ${mu(e)}`),Ou=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},ku=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Au=(e,t,n)=>{if(t.kind===`Name`)return ku(e,t.name,n);let r=Sr(n);if(!r||r.length!==t.names.length)throw new h(`Cannot bind <<${t.names.join(`, `)}>> to ${I(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>ku(e,t,r[n]),e)},ju=(e,t)=>{if(A(e))return e;throw new h(`A non-function (${Li(e)}) was applied as a function.\n${B(t)}`)},Mu=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Nu=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Pu=(e,t)=>{if(typeof e!=`boolean`)throw new h(`Expected ${t} to be a boolean but found ${I(e)}`);return e},Fu=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Iu=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},Lu=(e,t,n)=>{if(!k(e)||jt(e)){let r=I(e),i=n===`1.7.4`?void 0:Iu(e,r);throw new h(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${gu(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${gu(t)}\n${i}`)}},Ru=(e,t,n)=>(Lu(e,t,n),typeof e==`object`&&e.kind===`Interval`?Gn(e):ar(e)??ur(e)),zu=(e,t,n)=>n===`1.7.4`?(Lu(e,t,n),ar(e)??dr(e)):Ru(e,t,n),Bu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return vr(e),e},Vu=(e,t,n)=>Bu(e)??zu(e,t,n),Hu=(e,t,n)=>Bu(e)??Ru(e,t,n),Uu=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Wu=(e,t)=>e.map(e=>Vu(H(e.set,t),e.set,t.environment.runtime.version)),Gu=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Uu(t[n],t=>i(n-1,Au(a,e[n].pattern,t)));return i(e.length-1,n)},Ku=(e,t,n)=>Gu(e,Wu(e,t),t.scope,n),qu=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Ju=(e,t,n)=>{if(e.length===1)return Au(t,e[0].pattern,n);let r=Sr(n)??[];return e.reduce((e,t,n)=>Au(e,t.pattern,r[n]),t)},Yu=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Xu=e=>Object.assign(e.value,{lambda:e}),Zu=e=>Yu(e)?e.lambda:void 0,Qu=(e,t,n)=>{let r=e.value,i=t.args.map(e=>H(e,n)),a=i.length===1?i[0]:Yn(i),o=(e,n,i)=>`In applying the function\n${at(I(r))},\nthe ${e} is:\n${at(I(n))}${i}.\n${B(t.function)}`,s=e.bounds;if(s.length===1){if(!Er(a,r.domain))throw new h(o(`first argument`,a,`which is not in its domain`));return Ju(s,e.scope,a)}let c=Sr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new h(`Attempted to apply a function to an argument not in its domain.\n${B(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Er(n,l[t]))throw new h(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
139
|
-
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Sr(n)?.length!==e.pattern.names.length)throw new h(o(r,n,`which does not match its formal parameter`))}),Ju(s,e.scope,Yn(c.slice(0,s.length)))},$u=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:hu(n)}},ed=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},td=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},nd=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),rd=(e,t)=>{let n=qu(e.bounds,t),r=td(n,(n,r)=>H(e.body,Nu(t,Ju(e.bounds,ku(void 0,e.name,r),n))),ed($u(e.bounds,e.body),e.bounds,n));return Xu({value:r,bounds:e.bounds,body:e.body,scope:ku(void 0,e.name,r)}),e.bounds.length===1?Wt(r):r},id=(e,t)=>{if(typeof t!=`object`||Ut(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!st(t.domain))return t;try{let e=F(t);return Bt(e.domain,e.range)}catch(e){if(e instanceof h)return t;throw e}},ad=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new h(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>rd(e,t):Id(nd(e),t):Id(e.body,t),od=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=ad(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Nu(e,void 0)):e=>a[i]??r(Nu(e,void 0));return t.definitionEvaluators.set(e,o),o},sd=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},cd=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!jc(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>id(e,ad(e,t)(i)));An(n),t.startupValues[r]=n}catch(e){if(!(e instanceof h)&&!f(e))throw e}}),ld=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=H(e.expression,Nu(t,e.scope));return n&&(!e.isStreamed||pr(r))&&(e.cache=r),r},ud=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),dd=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return dd(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?ud(r):t.builtins.get(e)},fd=(e,t)=>O(e)?pd(e.operator,t):dd(e.operator,t.environment)??pd(e.operator,t),pd=(e,t)=>{let n=Ou(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return dd(e,t.environment)},md=e=>e.kind===`Closure`?e.params.length:e.arity,hd=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:pd(n,t);if(!r)throw new h(`Expected an operator argument at ${mu(e)}`);return r},gd=(e,t,n)=>{if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>ku(e,n.name,t[r]),e.scope);return H(e.body,Nu(n,r))},_d=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:md(e),call:n=>gd(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},vd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=pd(e.name,t);return n!==void 0&&md(n)>0},yd=(e,t)=>e.map(e=>vd(e,t)?_d(hd(e,t),t):H(e,t)),bd=(e,t)=>new h(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),xd=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Sd=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return Sd(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},Cd=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&ut(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=O(e)?void 0:Sd(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Ou(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:xd(e,t)}}return t=>xd(e,t)},wd=(e,t,n,r)=>{if(t.length!==e.params.length)throw bd(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:hd(t[a],n)}:(r?.[a]??Cd(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Td=(e,t,n,r)=>e.kind===`Closure`?H(e.body,Nu(n,wd(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(zd(t,n),n):e.evaluate(yd(t,n),n),Ed=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),Dd=(e,t,n)=>{let r=Ou(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return ld(r,n);if(r?.kind===`Operator`){if(md(r.operator)===0)return gd(r.operator,[],n);throw new h(`Operator ${e} is used without arguments`)}let i=Sd(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Tu(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return od(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new h(`Unknown identifier ${e} at ${mu(t)}`)},Od=(e,t)=>({impure:new Set(e.filter(e=>Nc(e,t))),streamed:new Set(e.filter(e=>Nc(e,t,`streamed`)))}),kd=e=>[...e.facts.ids.keys()].some(t=>Nc(t,e)),Ad=e=>[...e.facts.ids.keys()].some(t=>Nc(t,e,`repeated`)),jd=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Md=(e,t,n,r)=>i=>{r.expressions.push(e);let a=wr.sets,o=wr.callStack,s=a??[],c=s.length;wr.sets=s,wr.callStack=r;try{let a=t(i),o=jd(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&fu(e)&&r.sources.set(o,e),o}catch(t){let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=pu(e,r.values),a=i&&!Ye(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!A(a)?void 0:a;throw Nd(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,wr.sets=a,wr.callStack=o}},Nd=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof h){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Pd=(e,t,n)=>{if(!(n instanceof h))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Fd=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=ef(e,t),i=t.callStack,a=i?Md(e,r,t,i):r;return t.evaluators.set(e,a),a},Id=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=sa(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>Id(e,t.environment)(t),Ld=(e,t)=>{let n=e.name,r=O(e)?void 0:Sd(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Tu(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n={reference:void 0};return r=>(n.reference??=od(e,t))(r)}return t=>Dd(n,e,t)},Rd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||O(e))return!0;let n=dd(e.name,t);return n===void 0||md(n)===0},zd=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Bd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(zd(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Rd(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Rd(t[0],n)&&Rd(t[1],n);if(i&&a){let e=V(t[0],n),r=V(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(yd(t,n),n)},Vd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw bd(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Cd(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:hd(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Hd=(e,t,n)=>{let r=Vd(e,t,n),i={body:void 0};return t=>(i.body??=Id(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Ud=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=V(n[0],t),r=V(n[1],t);return t=>!Pu(e(t),`the left side of =>`)||Pu(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new h(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=O(e)?void 0:dd(e.operator,t);if(r?.kind===`Closure`)return Hd(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=V(n[0],t),i=xu(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=V(n[0],t);return ns.has(e)||Lc(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=V(n[0],t),a=V(n[1],t),o=Su(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return Bd(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new h(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>Cd(e,t));return r=>{let a=pd(e.operator,r);if(a)return Td(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new h(`${e.operator} is a function; apply it with brackets`):new h(`Unknown operator ${e.operator} at ${mu(e)}`)}},Wd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=V(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=V(a.set,t);return s=>Uu(Vu(o(s),a.set,t.runtime.version),t=>Pu(i(Nu(s,ku(s.scope,e,t))),r)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let e=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``),a=o.map(e=>V(e.set,t));return s=>{let c=a.map((e,n)=>Vu(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?Pu(i(Nu(s,a)),r)!==n:Uu(c[t],n=>l(t-1,ku(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Ku(o,e,t=>Pu(i(Nu(e,t)),r)!==n)?!n:n},Gd=(e,t)=>{if(e.kind===`Tuple`)return Yn(e.names.map(e=>{let n=Ou(t,e);return n?.kind===`Value`&&n.value}));let n=Ou(t,e.name);return n?.kind===`Value`?n.value:void 0},Kd=/* @__PURE__ */ new WeakSet,qd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Kd.add(e)},Jd=(e,t)=>{let n=Kd.has(e),r=V(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=V(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=qn(e),o=Bt(i,i.map(e=>r(Nu(t,ku(t.scope,n,e)))));return st(e)?o:Wt(o)}let n=[],s=i.map(e=>Hu(H(e.set,t),e.set,t.environment.runtime.version));return Gu(i,s,t.scope,e=>{let o=i.length===1?Gd(a.pattern,e)??!1:Yn(i.map(t=>Gd(t.pattern,e)??!1));return n.push([o,r(Nu(t,e))]),!1}),zn(n)},l=$u(i,e.body),u=(t,n)=>{let a=n.scope,o=Xu({value:td(t,e=>r(Nu(n,Ju(i,a,e))),ed(l,i,t)),bounds:i,body:e.body,scope:a});return i.length===1?Wt(o):o},d=t.callStack;return t=>{let r=o?s(t):qu(i,t);if(e.isRecursive||n||t.isKeepLazy||!M(r))return u(r,t);if(!st(r)){if(d)return u(r,t);try{return c(r,t)}catch(e){if(!(e instanceof h))throw e;return u(r,t)}}if(!d)return c(r,t);try{return c(r,t)}catch(t){throw Pd(d,e,t),t}}},Yd=(e,t)=>{let n=Kd.has(e);n&&qd(e.function);let r=V(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Nu(i,ku(i.scope,`@`,e))):Br(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(ca.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${B(e.function)}`)}return n}},Xd=(e,t)=>{if(e.kind===`SetFilter`){let n=V(e.predicate,t),r=V(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:hu(a)},s=(e,t)=>n=>Pu(e(Nu(t,Au(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>({kind:`FilteredSet`,base:t,test:s(r,n),source:o,rebind:r=>c(t,{...n,environment:r},V(e.predicate,r))});return e=>{let t=r(e);return st(t)?zt(N(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=V(e.expression,t);return t=>{let r=[];return Ku(e.bounds,t,e=>(r.push(n(Nu(t,e))),!1)),Pn(r)}}let n=e.set;if(!n)return()=>{throw new h(`TLC cannot evaluate an unbounded CHOOSE at ${mu(e)}`)};let r=V(e.body,t),i=V(n,t);return t=>{let a=i(t);if(!k(a)||jt(a))throw new h(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${B(e)}`);let o={value:void 0},s=Hu(a,n,t.environment.runtime.version);if(Uu(s,n=>{let i=Au(t.scope,e.pattern,n);return Pu(r(Nu(t,i)),`the body of CHOOSE`)?(o.value=Gd(e.pattern,i),!0):!1}),o.value===void 0)throw new h(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${B(e)}`);return o.value}},Zd=e=>[...e].sort((e,t)=>It(e.name,t.name)),Qd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),$d=(e,t)=>{let n=Zd(e),r=Qd(n),i=n.map(e=>V(e.value,t));if(r)return e=>Xn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>mt(a,i.map(t=>t(e)),o):e=>Zn(a,i.map(t=>t(e)))},ef=(e,t)=>{let n=e=>V(e,t);switch(e.kind){case`Number`:{let t=e.value;return ut(t)?()=>t:()=>{throw wu(e)}}case`Decimal`:return()=>{throw Cu(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Ld(e,t);case`Apply`:return Ud(e,t);case`Bracket`:return()=>{throw new h(`A bracket without a function or subscript is not an expression at ${mu(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new h(`An operator cannot be used as a value at ${mu(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw vu(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw vu(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Du(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Zt(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw _u(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new h(`A non-boolean expression (${Li(t)}) was used as a condition of a CASE. ${gu(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new h(`Attempted to evaluate a CASE with no conditions true.\n${B(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Nu(n,Ed(e.definitions,n)))}case`Forall`:case`Exists`:return Wd(e,t);case`UnboundedQuantifier`:return()=>{throw new h(`TLC cannot evaluate an unbounded quantifier at ${mu(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Xd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Pn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Yn(t.map(t=>t(e)))}case`FunctionConstruction`:return Jd(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return $d(e.fields,t);case`RecordSet`:{let t=Zd(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return Yd(e,t);case`ExceptAt`:return t=>{let n=Ou(t.scope,`@`);if(n?.kind!==`Value`)throw new h(`@ appears outside an EXCEPT at ${mu(e)}`);return n.value};case`FunctionApplication`:{qd(e.function);let r=n(e.function),i=t=>ju(r(Mu(t)),e),a=e.args.map(n),o=bu(t.runtime.version);if(a.length===1){let e=a[0];return t=>Lr(i(t),e(t),o)}return e=>Lr(i(e),Yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=yu(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?Pu(t(e),`an action`)||r(e):Pu(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>au(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new h(`The subexpression reference at ${mu(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new h(`TLC cannot evaluate a temporal formula in a state at ${mu(e)}`)}}},tf=`tlc2/value/impl/`,nf={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},rf={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},af=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n={offset:0},r=e=>{let t=n.offset;return n.offset+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n.offset)}},of=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),sf=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],cf=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??of.get(e[3])}${`[]`.repeat(e[1].length)}`),lf=(e,t)=>e[e[t].first].text,uf=(e,t)=>lf(e,t).replaceAll(`/`,`.`),df=e=>{let t=af(e);if(t.readUint32()!==3405691582)throw new l(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===nf.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===nf.integer?a.value=t.readInt32():r===nf.float?t.readUint32():r===nf.long||r===nf.double?(t.readBytes(8),e++):r===nf.class||r===nf.string||r===nf.methodType||r===nf.module||r===nf.package?a.first=t.readUint16():r===nf.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=uf(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=cf(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:af(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>uf(n,d.readUint16())):[],p=sf.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=cf(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},ff=(e,t)=>{let n=e[t],r=e[n.second];return{className:lf(e,n.first),name:e[r.first].text}},pf=(t,n,r,i)=>{let a=()=>new e(`The Java override ${r}.${t.name} computes its value, which tla-ts cannot run`),o=t.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===nf.integer)return t.value;if(t.tag===nf.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=rf.iconstM1&&t<=rf.iconst5)s.push(t-rf.iconst0),e+=1;else if(t===rf.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===rf.sipush)s.push(r()<<16>>16),e+=3;else if(t===rf.ldc)s.push(l(o[e+1])),e+=2;else if(t===rf.ldcW)s.push(l(r())),e+=3;else if(t===rf.dup){let t=c();s.push(t,t),e+=1}else if(t===rf.getstatic){let t=ff(n,r());if(t.className!==`${tf}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===rf.invokestatic){let t=ff(n,r()),o=c();if(t.className!==`${tf}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===rf.new)s.push({className:lf(n,r()),value:void 0}),e+=3;else if(t===rf.invokespecial){let t=ff(n,r()),o=c(),s=c();if(!(t.className===`${tf}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===rf.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},mf=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=df(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:pf(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},hf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),gf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],_f=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),vf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs`.split(`.`),yf=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),bf=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),xf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
70
|
+
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
71
|
+
`],[2281,` - specifically: `],[2405,`failed.
|
|
72
|
+
`]]),Ft=(e,t,n)=>{let r=n?Pt.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${It(t.slice(a),n)}`},It=(e,t)=>{let n=t?Mt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ct.none} @!@!@\n${Ft(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Lt=(e,t=2)=>String(e).padStart(t,`0`),Rt=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${Lt(r%24)}h`:e>36e5?`${Lt(r%24)}h ${Lt(n)}min`:e>6e4?`${Lt(n)}min ${Lt(t)}s`:`${Lt(t)}s`},zt=e=>`${e.getFullYear()}-${Lt(e.getMonth()+1)}-${Lt(e.getDate())} ${Lt(e.getHours())}:${Lt(e.getMinutes())}:${Lt(e.getSeconds())}`,Bt=/* @__PURE__ */ new WeakMap,Vt=(e,t,n)=>{if(!(e instanceof y))return e;let r=v(new y(`${n}\n${e.message}`,e),l(e));return Bt.set(r,{code:t,headline:n,inner:e}),r},Ht=e=>Bt.has(e),Ut=e(`util.WrongInvocationException`),Wt=i.slice(0,i.indexOf(`
|
|
73
|
+
`)),Gt=`${i}tlc2.tool.EvalException: `,Kt=`${i}util.Assert$TLCRuntimeException: `,qt=e=>Nt(e)?Gt:Kt,Jt=e=>{try{return e()}catch(e){throw e instanceof y?Nt(e)?new y(`${p}${e.message}`):Mt(e.message)?e:new y(`${i}${e.message}`):e}},Yt=[Gt,Kt,i,p],Xt=(e,t)=>{let n=Bt.get(e);if(n)return`${n.headline}\n${Xt(n.inner,t)}`;let r=e.message;if(e instanceof ie)return r;let i=Yt.find(e=>r.startsWith(e))??``;return`${i}${It(r.slice(i.length),t)}`},Zt=(e,t)=>{let n=Bt.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Xt(e,!0)};if(e instanceof c)return{code:t?St.stackOverflow:St.general,message:r,toolMessage:r};if(t&&Nt(e))return{code:Mt(r)?.code??St.general,message:r,toolMessage:r};let a=t&&!r.startsWith(Wt)&&!(e instanceof ie),o=e instanceof s?Ut:i,l=a?o:``;return{code:St.general,message:`${l}${r}`,toolMessage:`${l}${Xt(e,!0)}`}},Qt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,$t=2147483647,en=1e6;let tn=en;const nn=()=>tn,rn=()=>Math.max(tn,10),an=()=>`Attempted to construct a set with too many elements (>${tn}).`,on=(e,t)=>{if(e.length===rn())throw new s(an());e.push(t)},sn=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=rn(),cn=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},P=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ln=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),un=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),dn=e=>typeof e==`object`&&e.kind===`ModelValue`,fn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),pn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:P(e)?`set`:`function`,mn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let hn=!1;const gn=(e,t)=>(hn=!0,e.writtenKeys=t,e),_n=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,vn=e=>_n(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),yn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):vn(e),bn=(e,t,n)=>gn(di(e,t),n),xn=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(xn);e.writtenKeys=void 0,e.range.forEach(xn)}},Sn=e=>e.every(e=>typeof e==`string`),Cn=(e,t)=>e.length>0&&t.length>0&&Sn(e)!==Sn(t),wn=(e,t)=>{hn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Cn(n,r)?Pr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Xn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Xn(t,n);if(r!==0)return r}return 0},Tn=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Xn(n[e],r[e]);if(t!==0)return t}return 0},En=e=>dn(e)?e.type:void 0,Dn=(e,t,n)=>{let r=En(e),i=En(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(dn(e)&&dn(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${R(e)} and ${R(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${R(t)} and the non-model value\n${R(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${R(e)} and non-model value\n${R(t)}`)},On=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),kn=On(),An=e=>{Object.assign(kn,On()),Zn.clear();for(let t of e)Bn(t)},jn=()=>{kn.searchRank=kn.size},Mn=()=>kn.unorderedString;let Nn=!1;const Pn={isExpanded:!0,isViewPrinted:!1},Fn=e=>{Nn=e.version===`1.7.4`,tn=e.maxSetSize??en,Pn.isExpanded=e.isLazyValueExpanded??!0,Pn.isViewPrinted=e.isViewPrinted??!1},In=/* @__PURE__ */ new WeakMap,Ln=(e,t)=>(Pn.isViewPrinted&&In.set(e,t),e),Rn=/* @__PURE__ */ new WeakMap,zn=(e,t)=>(Rn.set(e,t),e),Bn=e=>(kn.ranks[e]===void 0&&(kn.ranks[e]=kn.size++),e),Vn=e=>kn.ranks[Bn(e)],Hn=(e,t)=>{if(e===t)return 0;let n=kn.ranks,r=n[e],i=n[t],a=kn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(kn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Un=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Wn=(e,t)=>(Un(e)||Un(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Gn=(e,t)=>new y(Un(e)?`Attempted to compare overridden value ${R(e,!0)} with non-overridden value:\n${R(t)}`:`Attempted to compare ${pn(e)} ${R(e)} with ${pn(t)} ${R(t)}`),Kn=(e,t,n)=>{if(!Un(e))throw new y(`Attempted to ${n} the set ${R(F(e)?I(e):e,!0)} with the value:\n${R(t,!0)}`);if(!Un(t))throw Gn(e,t);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new x(`Attempted to compare ${R(e,!0)} with the value\n${R(t,!0)}`)},qn={kind:`InfiniteSet`,name:`Any`},Jn=e=>{throw new x(`Attempted to compare ANY with the value\n${R(e)}`)},Yn=e=>{hn&&xn(e),e===qn&&Jn(e),typeof e==`object`&&e.kind===`LazyFunction`&&L(e)},Xn=(e,t)=>{if(e===t)return Yn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return wn(e,t);if(n===`Set`&&r===`Set`)return Tn(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&Dn(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Dn(e,t,!1),n===`ModelValue`?-1:1;if(e===qn||t===qn)return Jn(e===qn?t:e);if(P(e)&&P(t)&&Wn(e,t))return Kn(e,t,`compare`);let i=P(e);if(i!==P(t))throw Gn(e,t);if(n===`Interval`&&r===`Set`){let n=Fi(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Fi(t);if(n!==0)return n}return i?Tn(I(e),I(t)):wn(L(e),L(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Hn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Dn(e,t,!1),dn(e))return-1;if(dn(t))return 1;throw Gn(e,t)},Zn=/* @__PURE__ */ new Map,Qn=32768,$n=e=>{let t=Zn.get(e);if(t)return t;if(Zn.size===Qn)throw new T(`TLC supports at most ${Qn} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Vn(e),hash:fa(pa(ma(e),109)),fingerprint:Ca(wa(e)^60)};return Zn.set(e,n),n},er=()=>[...Zn.values()],tr=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),nr=e=>{let t=tr(e);return t.isNormalized=!0,t},rr=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let ir=!1;const ar=(e,t)=>(t===`lambda`&&(ir=!0),t!==void 0&&(e.functionClass=t),e),or=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,sr=e=>ar(e,`lambda`),cr=e=>Qt(e)&&e.isCached===!0;let lr=!1;const ur=e=>(lr=!0,e),dr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),fr=e=>{lr&&typeof e==`object`&&Qt(e)&&dr.has(e.kind)&&(e.isCached=!0)},pr=e=>{(ir||lr)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(pr),e.range.forEach(pr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(pr):P(e)&&F(e)&&(fr(e),I(e).elements.forEach(pr))))},mr=(e,t)=>{if(fr(e),e===t)return Yn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Dn(e,t,!0),Xn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return wn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Tn(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Fi(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Fi(t))return!1;if(dn(e)||dn(t))return e.kind===`LazyFunction`&&L(e),Dn(e,t,!0),dn(e)&&dn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return mr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Mi(e.domain),r=Mi(t.domain);if(n||r)return n===r;let i=Mi(e.range),a=Mi(t.range);return i||a?i===a:mr(e.domain,t.domain)&&mr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Mi(e))return Mi(t);if(Mi(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&mr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Mi(e)?Mi(t):!Mi(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>mr(e,t.factors[n]));let n=P(e)&&P(t)&&!(F(e)&&F(t));if(n&&Wn(e,t))return Kn(e,t,`check equality of`)===0;if(n){if(!Un(e)){let n=I(e);if(!Un(t))return Tn(n,I(t))===0}return ka(e)===ka(t)}return Xn(e,t)===0},hr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ka(n)===ka(r);return n},gr=hr(!1),_r=hr(!0),vr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},yr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Sa(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||_r(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||_r(i[e],n))return i[e]}return n.kind===`Set`?vr(n.elements,t):(vr(n.domain,t),vr(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},br=(e,t)=>t.length===0||or(e)===`tuple`?1:la(t)?.low,xr=e=>{if(!un(e))return;let t=L(e);return{domain:t.domain,range:t.range,low:br(e,t.domain)}},Sr=e=>{if(!un(e))return;let t=L(e);return Sn(t.domain)?t:void 0},Cr=(e,t,n)=>(Dn(t,e,n),1),wr={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Tr=(e,t,n)=>{let r=wr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${R(e)} with ${r.other}:\n${R(t)}`},Er=e=>e?`check equality of`:`compare`,Dr=(e,t,n,r)=>{let i=xr(n);if(!i){if(dn(n))return Cr(n,t,r);throw new y(`Attempted to ${Er(r)} the function ${R(t)} with the value:\n${R(n)}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>Or(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return Or(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new y(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${R(n)}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},Or=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Nr(e[r],t[r],n);if(i!==0)return i}return 0},kr=(e,t,n)=>{let r=L(e);if(or(e)===`tuple`){let i=un(t)?Bi(t):void 0;return i?r.range.length-i.length||Or(r.range,i,n):Dr({...r,low:1},e,t,n)}if(or(e)===`record`){let i=Sr(t);if(!i){if(dn(t))return Cr(t,e,n);throw new y(`Attempted to ${Er(n)} record:\n${R(e)}\nwith non-record\n${R(t)}`)}return r.domain.length-i.domain.length||Or(r.domain,i.domain,n)||Or(r.range,i.range,n)}return Dr({...r,low:br(e,r.domain)},e,t,n)},Ar=(e,t)=>Un(e)||Un(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),jr=(e,t)=>{let n=fn(t)?t:I(t);return{elements:I(e).elements,otherElements:I(n).elements}},Mr=(e,t,n)=>{if(Ar(e,t))return n?+!mr(e,t):Xn(e,t);if(!fn(e))return Mr(I(e),t,n);if(!P(t)){if(dn(t))return Cr(t,e,n);throw new y(`Attempted to ${Er(n)} the set ${R(e)} with the value:\n${R(t)}`)}let r=jr(e,t);return r.elements.length-r.otherElements.length||Or(r.elements,r.otherElements,n)},Nr=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:Xn(e,t);if(dn(t))return Cr(t,e,n);throw new y(Tr(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&Dn(e,t,n),dn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):un(e)?kr(e,t,n):Mr(e,t,n)},Pr=(e,t)=>Nr(e,t,!1),Fr=(e,t)=>Nr(e,t,!0)===0,Ir=e=>{let t=[];for(let n of e){let e=Rr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Lr=(e,t)=>{let n=Hi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Rr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Lr(e,()=>Pr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},zr=(e,t)=>t.some(t=>Lr(t,()=>Fr(t,e))),Br=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Vr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Vr)),e.kind===`Function`&&(e.domain.forEach(Vr),e.range.forEach(Vr)))},Hr=e=>{if(!(typeof e!=`object`||cr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:I(e);return;case`FilteredSet`:case`Subset`:return Hr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Hr(e.left),Hr(e.right));case`FunctionSet`:return Hr(e.domain),Hr(e.range);case`RecordSet`:return e.sets.forEach(Hr);case`ProductSet`:return e.factors.forEach(Hr)}},Ur=(e,t)=>Ui(mr,Fr,e,t),Wr=e=>{for(let t=1;t<e.length;t++)if(Xn(e[t-1],e[t])>=0)return!1;return!0},Gr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},Kr=e=>{for(let t=1;t<e.length;t++)fr(e[t]);if(e.length<2||Wr(e))return tr(e);let t=[...e].sort(Xn),n=[t[0]];for(let e=1;e<t.length;e++)Xn(n[n.length-1],t[e])!==0&&n.push(t[e]);return tr(n)},qr=e=>{if(Gr(e))return tr(e);let t=Ui(Kr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Jr=tr([]),Yr=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Xn(r[a],t)<0;)a++;a<r.length&&Xn(r[a],t)===0||i.push(t)}return i.length===n.length?e:tr(i)},Xr=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Xn(r[a],t)<0;)a++;a<r.length&&Xn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:tr(i)},Zr=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Xn(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=tr(i);if(e.hash!==0&&e.hash!==_a){let t=e.hash,n=0;for(;n<a.length;n++){let e=Sa(a[n]);if(e===_a)break;t=t+ha(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Ta(a[e])|0;c.fingerprint=t}return c},Qr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Xn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Xn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return rr(n,r)},$r=e=>{let t=Qr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:gn(t,e.map(e=>e[0]))},ei=[],ti=/* @__PURE__ */ new Map,ni=[],ri=/* @__PURE__ */ new WeakMap,ii=e=>{let t=ei[e]??ti.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ti.set(e,new WeakRef(n)):ei[e]=n,n},ai=e=>{if(Fi(e),e.low===1&&e.high>=1)return ii(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},oi=e=>e.length>0&&(e===ei[e.length]||e===ti.get(e.length)?.deref())||ri.has(e),si=e=>{let t=I(e).elements;return oi(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},ci=e=>{let t=ni[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ni[e]=n,n},li=e=>ar(rr(ii(e.length),e),`tuple`),ui=e=>ar(Qr(e),`record`),di=(e,t)=>ar(rr(e,t),`record`),fi=e=>P(e)&&!Un(e),pi=(e,t=!1)=>`UNION(${R(e.base,t)})`,mi=(e,t=e=>I(e).elements)=>{if(!fi(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${pi(e)}`);return t(e.base)},hi=(e,t,n)=>{if(fi(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${R(e)}\nwhen enumerating:\n${pi(n)}`)},F=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return F(e.base);case`FunctionSet`:return F(e.domain)&&F(e.range)||gi(e.domain)===!0||gi(e)===!0;case`RecordSet`:return e.sets.every(F)||gi(e)===!0;case`ProductSet`:return e.factors.every(F)||gi(e)===!0;case`Union`:return F(e.base)&&(fn(e.base)?Br(e.base):Di(e.base)).every(F);case`SetOperation`:return e.operator===`\\cup`?F(e.left)&&F(e.right):e.operator===`\\cap`?F(e.left)||F(e.right):F(e.left);default:return!1}},gi=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=gi(e.domain);return t===void 0?void 0:!t&&gi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=gi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return F(e)?I(e).elements.length===0:void 0;default:return}},_i=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},vi=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},yi=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Un(e.base))return;let t=I(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:vi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return tr(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},bi=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(tr(r.map(t=>e[t])));while(vi(r,e.length))}return t},xi=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Un(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Si=(e,t=e=>I(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${R(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Ir(e.elements);case`Interval`:{let t=ai(e);return t!==ei[t.length]&&ri.set(t,e),t}case`Subset`:{if(Fi(e.base)===0)return bi([]);if(!P(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(R(e.base))}`);let t=I(e.base).elements;if(t.length>30)throw new y(Pi(e));return bi(t)}case`FunctionSet`:{if(!Nn&&Mi(e))return[];if(Un(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${R(e.domain)}\ncannot be enumerated.`);let n=si(e.domain);if((n.length>0||Nn)&&Un(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${R(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return _i(n.map(()=>r)).map(e=>rr(n,e))}case`RecordSet`:{if(!Nn&&Mi(e))return[];let n=xi(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${R(t)}`);return _i(n).map(t=>ui(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Nn&&Mi(e))return[];let n=xi(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${R(e)}`);return _i(n).map(li)}case`FilteredSet`:if(!P(e.base)||Un(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${R(e.base)}\nis not enumerable`);return I(qr(Di(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return mi(e).forEach((n,r)=>{let i=hi(n,r,e);if(sn(i))throw new s(an());Di(i).forEach(e=>on(t,e))}),I(qr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!fi(e.left)&&!fi(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${R(e.left)}\nnor T:\n${R(e.right)}\nis enumerable`);if(e.operator===`\\`&&!fi(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${R(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return I(qr(wi(e))).elements;let t=e.operator===`\\`||fi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return cn(typeof n==`object`&&n.kind===`Interval`?n:Di(n),t=>{Gi(t,r)===(e.operator===`\\cap`)&&on(i,t)}),I(qr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${R(e)}`);default:throw new y(`Expected a set but found ${R(e)}`)}},I=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return tr(Si(e));let t=typeof e==`object`&&Qt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Hi.sets;n?.push(e);let r=Si(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?tr(r):Kr(r);return t&&(t.enumerated=i),i},Ci=e=>{if(!(typeof e!=`object`||cr(e)))switch(e.kind){case`MixedSet`:I(e);return;case`FilteredSet`:return fi(e.base)||I(e),Ci(e.base);case`Union`:if(!fn(e.base)&&fi(e.base))return Ci(e.base);mi(e).slice(0,1).forEach(t=>Ci(hi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!fi(e.left)&&I(e),e.operator!==`\\cup`||fi(e.left)&&fi(e.right)||I(e),e.operator!==`\\cap`||fi(e.left)?Ci(e.left):Ci(e.right),e.operator===`\\cup`&&Ci(e.right)}},wi=e=>{if(!fi(e.left)||!fi(e.right))throw new y(`Attempted to enumerate S \\cup T when S:\n${R(e.left)}\nand T:\n${R(e.right)}\nare not both enumerable`);if(Ci(e.left),Ci(e.right),sn(e.left))throw new s(an());let t=Di(e.left),n=sn(e.right)?void 0:Di(e.right);if(!n||t.length+n.length>rn())throw new s(an());return[...t,...n]},Ti=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return I(e).elements;let t=Lr(e,()=>wi(e)),n=I(qr(t)).elements;return e.enumerated=tr(n),n},Ei=(e,t)=>{if(typeof e!=`object`||cr(e))return I(e).elements.some(t);let n=Hi.sets;n?.push(e),Ci(e);let r=ji(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Di=e=>{let t=[];return Ei(e,e=>(t.push(e),!1)),t},Oi=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ki=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ki);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ki)&&e.range.every(ki);case`SetOperation`:return e.operator!==`\\cup`&&ki(e.left)&&ki(e.right);case`FilteredSet`:return ki(e.base);case`ProductSet`:return e.factors.every(ki);default:return!1}},Ai=e=>typeof e!=`object`||cr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ai(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ai(e.left)||Ai(e.right):Oi(e)?.some(Ai)??!1,ji=(e,t)=>{if(e.kind===`Union`)return mi(e,Di).some((n,r)=>Ei(hi(n,r,e),t));if(e.kind===`FilteredSet`&&fi(e.base))return Ei(e.base,n=>e.test(n,!1)&&t(n));if(Oi(e)?.some(Ai))return Si(e,Di).some(t);if(e.kind!==`SetOperation`)return I(e).elements.some(t);if(e.operator===`\\cup`)return!fi(e.left)||!fi(e.right)?I(e).elements.some(t):Ei(e.left,t)||Ei(e.right,t);let n=e.operator===`\\`||fi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return fi(r)?Ei(r,n=>Gi(n,i)===(e.operator===`\\cap`)&&t(n)):I(e).elements.some(t)},Mi=e=>{if(typeof e!=`object`||!P(e))throw new y(`Shouldn't call isEmpty() on value ${R(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(Mi);case`RecordSet`:return e.sets.some(Mi);case`FunctionSet`:return!Mi(e.domain)&&Mi(e.range);case`Union`:return mi(e).every((t,n)=>Mi(hi(t,n,e)));default:return I(e).elements.length===0}},Ni=(e,t,n)=>e.reduce((e,r)=>{let i=e*Fi(r,t);if(i>2147483647)throw new y(n());return i},1),Pi=e=>`Overflow when computing the number of elements in:\n${R(e)}`,Fi=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${pn(e)} ${R(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${R(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Fi(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${R(e)}.`);case`Subset`:{let n=Fi(e.base,t);if(n>=31)throw new y(Pi(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Mi(e.domain))return 1;if(Mi(e.range))return 0;if(Fi(e.range,t)===1)return 1}let n=Fi(e.domain,t),r=Fi(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new y(Pi(e));return i}case`RecordSet`:return t!==`1.7.4`&&Mi(e)?0:Ni(e.sets,t,()=>Pi(e));case`ProductSet`:return t!==`1.7.4`&&Mi(e)?0:Ni(e.factors,t,()=>`Overflow when computing the number of elements in ${R(e)}`);default:return fr(e),I(e).elements.length}},Ii=e=>`Attempted to check if the set ${R(e)}is finite.`,Li=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${pn(e)} ${R(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${R(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Li(e.base)&&Mi(e.base);case`Subset`:return Li(e.base);case`FunctionSet`:{let t=Li(e.domain);if(t&&Mi(e.domain))return!0;let n=Li(e.range);return n&&Mi(e.range)?!0:n&&(t||Fi(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Li(e))n=!1;else if(Mi(e))return!0;return n}case`Union`:if(!fi(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${pi(e)}\nis a finite set.`);return I(e.base).elements.every(Li);case`SetOperation`:if(e.operator===`\\cup`)return Li(e.left)&&Li(e.right);if(e.operator===`\\cap`){if(!Li(e.left)&&!Li(e.right))throw new y(Ii(e));return!0}if(Li(e.left))return!0;if(!Li(e.right))throw new y(Ii(e));return!1;case`FilteredSet`:if(!Li(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${R(e.base)}\nis finite.`);return!0}},Ri=(e,t,n=Xn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},zi=(e,t)=>{let n=e.elements;if(n.length>rn())throw new s(an());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Ri(n,e);return!r[t]&&(r[t]=!0,!0)}),a=tr(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Bi=e=>{if(typeof e!=`object`||!un(e))return;if(e.kind===`LazyFunction`&&(!P(e.domain)||Un(e.domain)))throw new y(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=L(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Vi=(e,t)=>{let n=`Attempted to check if the value:\n${R(e)}\nis an element of the`;if(!un(t))return`${n} ${pn(t)} ${R(t)}`;let r=or(t);return r===`record`?`Attempted to check if element:\n${R(e)}\nis in the record:\n${R(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${R(t)}`},Hi={sets:void 0},Ui=(e,t,n,r)=>{let i=Hi.sets,a=Hi.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof y))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Wi=e=>(Hi.sets??[]).slice(e).some(e=>typeof e==`object`&&Hi.callStack?.sources.has(e)===!0),Gi=(e,t)=>{let n=Hi.sets;if(n===void 0)return Xi(e,t);n.push(t);let r=Xi(e,t);return n.pop(),r},Ki=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},qi=(e,t)=>Ri(t.elements,e)!==-1,Ji=(e,t)=>t.isNormalized?Rr(e,t.elements).isFound:zr(e,Br(t)),Yi=(e,t)=>{if(e.type!==void 0)throw new y(`Attempted to check if the typed model value ${N(R(e))} is an element of\n${N(R(t))}`);return!1},Xi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Ki(e,t)??Zi(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Zi(e,t)},Zi=(e,t)=>{if(!P(t))throw new y(Vi(e,t));switch(t.kind){case`Set`:return fr(e),Ui(qi,Ji,e,t);case`MixedSet`:return zr(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&(!dn(e)||e.type!==void 0))throw new y(`Attempted to check if the value:\n${R(e)}\nis in the integer interval ${R(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(dn(e))return Yi(e,t);if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new x(`Attempted to check if the value:\n${R(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!P(e)||Un(e))throw new y(`Attempted to check if the non-enumerable value\n${N(R(e))}\nis element of\n${N(R(t))}`);return I(e).elements.every(e=>Gi(e,t.base));case`FunctionSet`:{if(!un(e)){if(dn(e))return Yi(e,t);throw new y(`Attempted to check if \n${R(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(R(t))}`)}let n=L(e),r=br(e,n.domain);return(r===void 0?Ur(t.domain,tr(n.domain)):Ur({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Gi(e,t.range))}case`RecordSet`:{let n=un(e)?L(e):void 0;if(!n||!Sn(n.domain)){if(dn(e))return Yi(e,t);throw new y(`Attempted to check if non-record\n${R(e)}\nis in the set of records:\n${R(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Ri(n.domain,e);return i!==-1&&Gi(n.range[i],t.sets[r])})}case`ProductSet`:{let n=un(e)?Bi(e):void 0;if(n===void 0){let n=un(e)&&L(e).domain.every(e=>typeof e==`number`);if(dn(e))return Yi(e,t);if(n)return!1;throw new y(`Attempted to check if non-tuple\n${R(e)}\nis in the set of tuples:\n${R(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Gi(e,t.factors[n]))}case`FilteredSet`:try{return Gi(e,t.base)&&t.test(e,!0)}catch(n){throw!(n instanceof y)||!Nt(n)?n:new y(`Cannot decide if element:\n${N(R(e))}\n is element of:\n${N(R(t.base))}\nand satisfies the predicate ${t.source?.predicate}`)}case`Union`:{if(!fi(t.base))throw new y(`Attempted to check if:\n ${R(e)}\nis an element of the non-enumerable set:\n ${pi(t)}`);let n=I(t.base).elements;return n.length>1&&n.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),n.some(t=>Gi(e,t))}case`SetOperation`:return t.operator===`\\cup`?Gi(e,t.left)||Gi(e,t.right):Gi(e,t.left)&&Gi(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Bi(e);if(n===void 0){if(dn(e))return Yi(e,t);throw new x(`Attempted to check if the value:\n${N(R(e))}\nis an element of ${N(R(t))}.`)}return n.every(e=>Gi(e,t.base))}default:throw new y(Vi(e,t))}},Qi=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Gi(e,n):e.range.every((e,r)=>Qi(e,t.range[r],n.range)),L=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(F(e.domain)||Fi(e.domain),!P(e.domain))throw new y(`The domains of formal parameters must be enumerable.`);let t=si(e.domain);return e.enumerated=ar(rr(t,t.map(t=>e.apply(t))),or(e)),e.enumerated}throw new y(`Expected a function but found ${R(e)}`)},$i=(e,t,n)=>{let r=N(R(e)),i=N(R(t)),a=n===`1.7.4`;switch(or(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},ea=(e,t)=>{if(!Nn)return $i(e,t);let n=N(R(t));return or(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},ta=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},na=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${N(R(e))}`),ra=(e,t)=>Ri(e.domain,t),ia=(e,t,n)=>{let r=_n(e);throw Nn||r!==e.domain||r.length<32?r.forEach(e=>Fr(e,t)):Ri(r,t,Pr),n},aa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=or(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Nn&&typeof t!=`number`&&oi(r))throw na(t)}let i=ta(r,t);return i===-1?Ui(ra,ia,e,t):i},oa=(e,t,n)=>{let r=e.domain,i=Bi(n),a=(t,n,r)=>`In applying the function\n${N(R(e))},\nthe ${t} is:\n${N(R(n))}\nwhich ${r}.\n`,o=()=>new y(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new y(`Attempted to apply a function to ${R(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!Gi(n,r.factors[t]))throw new y(a(s,n,e===void 0?`is not in the function's domain ${R(r)}`:`is not in its domain`));if(e!==void 0&&Bi(n)?.length!==e)throw new y(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},sa=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Gi(t,e.lambdaDomain),ca=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return ca(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return oa(e,r,t),e.apply(t);if(!Gi(t,e.domain))throw new y(or(e)===`lambda`?$i(e,t):`Attempted to apply a function to ${R(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${R(e)}, which is not a function`);let r=n??$i;if(sa(e,t))throw new y(r(e,t));let i=aa(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},la=e=>oi(e)?ri.get(e)??ci(e.length):void 0,ua=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=L(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=la(t.domain);if(n)return n;let r=tr(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},da=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!Gi(t,e.domain))return e;let r=n(e.apply(t));return ar({kind:`LazyFunction`,domain:e.domain,apply:n=>Ur(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},or(e))}if(!un(e))throw new y(`Attempted to apply EXCEPT construct to the value ${N(R(e))}.`);let i=L(e);if(sa(i,t))return i;let a=aa(i,t,ea);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=ar(rr(i.domain,o),or(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==_a){let e=Sa(c);if(e!==_a){let t=Sa(i.domain[a]);l.hash=s===c?i.hash:i.hash-ga(t,Sa(s))+ga(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Ea(e,s)+Ea(e,c)|0}return l},fa=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},pa=(e,t)=>Math.imul(e^t,16777619),ma=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return fa(t)},ha=e=>fa(e+2654435769|0),ga=(e,t)=>fa(Math.imul(e,668265261)+t|0),_a=795548749,va=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Sa(t[e]);if(r===_a)return _a;n=n+ha(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Sa(e.domain[n]),i=Sa(e.range[n]);if(r===_a||i===_a)return _a;t=t+ga(r,i)|0}return t},ya=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${R(e)}`);if(P(e)){I(e).elements.forEach(ya);return}let t=L(e);t.domain.forEach(ya),t.range.forEach(ya)},ba=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Sa(e)===_a&&ya(e);return}catch(e){if(!(e instanceof y))throw e;return e}},xa=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Sa=e=>typeof e==`number`?fa(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ma(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=va(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?F(e.domain)?Sa(L(e)):_a:F(e)?Sa(I(e)):_a,Ca=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},wa=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ca(t)},Ta=e=>Ca(Oa(e)+2135587861|0),Ea=(e,t)=>Ca(Math.imul(Oa(e),374761393)+Oa(t)|0),Da=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Ta(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Ea(e.domain[n],e.range[n])|0;return t},Oa=e=>typeof e==`number`?Ca(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?wa(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Da(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Oa(L(e)):F(e)?Oa(I(e)):wa(ka(e)),ka=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Aa(e),Aa=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ka(e.base)}>`;if(e.kind===`FilteredSet`&&!F(e))throw new y(`Attempted to compare the non-enumerable set ${R(e)} with another value`);if(P(e))return F(e)?`{${I(e).elements.map(ka).join(`,`)}}`:`<${e.kind} ${R(e)}>`;let t=L(e);return`(${t.domain.map((e,n)=>`${ka(e)}:${ka(t.range[n])}`).join(`,`)})`},ja={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Ma=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>ja[e])}"`,Na=1999,Pa=e=>e.reduce((e,t)=>e===0?0:e*Fi(t),1),Fa=e=>{if(e.kind===`Subset`)return Fi(e.base)<=6?I(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return I(e);if(e.kind===`FunctionSet`){let t=Mi(e.domain)?0:Fi(e.domain);return(t===0?1:Fi(e.range)**t)<=Na?I(e):void 0}return Pa(e.kind===`RecordSet`?e.sets:e.factors)<=Na?I(e):void 0},Ia=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&un(e.base)&&(e.base.kind===`Function`||F(e.base.domain)))return Fa(e);if(F(e))try{return Fa(e)}catch(e){if(e instanceof y)return;throw e}},La=(e,t)=>{let n=e=>R(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return pi(e,t)}},Ra=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),za=e=>{if(F(e.domain))try{return L(e)}catch(e){if(e instanceof y||C(e))return;throw e}},Ba=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),I(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>R(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},R=(e,t=!1,n=!1)=>{let r=e=>R(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Ma(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(I(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Pn.isExpanded?Ia(e,t):void 0;return n?r(n):La(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Pn.isExpanded||!e.source?za(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${R(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Nn&&or(e)!==`tuple`)return`<< >>`;let a=r=>R(r,t,n&&or(e)!==`lambda`);if(i.domain.length===0&&or(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):yn(i);return or(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ra(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Va=(e,t)=>{if(e===void 0)return!1;try{return mr(e,t)}catch(e){if(e instanceof y)return!1;throw e}},Ha=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ua=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Ha,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
+
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(gt(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},Wa=(e,t)=>{let n=t?void 0:In.get(e);if(n)return n();let r=Object.entries(e),i=Rn.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
|
|
75
|
+
`:`/\\ %s = %s
|
|
76
|
+
`;if(typeof o!=`string`)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must be a string.`);return r.filter(([e])=>!(a&&e===`_format`)).filter(([e,n])=>!t||!Va(t[e],n)).map(([e,t])=>{let n=Ua(o,[e,N(R(t))]);if(n===void 0)throw new b(`The _format field of the ALIAS ${i} is ${R(o)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},Ga=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Ka=Ga[0];const qa=()=>Ka,Ja=/* @__PURE__ */ new Int32Array(256),Ya=/* @__PURE__ */ new Int32Array(256),Xa=/* @__PURE__ */ new Int32Array(256),Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256);let no=0,ro=0,io=0,ao=0;const oo=e=>{let t=(e^ao)&255;ao=(ao>>>8|io<<24)^Qa[t],io=io>>>8^Ja[t]},so=e=>{let t=Ga[e];Ka=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Ja[e]=Number(BigInt.asIntN(32,t>>32n)),Qa[e]=Number(BigInt.asIntN(32,t))}let i=[Ja,Ya,Xa,Za],a=[Qa,$a,eo,to];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Qa[o],i[e][r]=t[r]>>>8^Ja[o]}}no=Number(BigInt.asIntN(32,t>>32n)),ro=Number(BigInt.asIntN(32,t))};so(0);const co=e=>{let t=ao^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;ao=io^to[n]^eo[r]^$a[i]^Qa[a],io=Za[n]^Xa[r]^Ya[i]^Ja[a]},lo=e=>{if(typeof e==`boolean`)return oo(0),oo(e?116:102),2;if(typeof e==`number`)return oo(1),co(e),5;if(typeof e==`string`){oo(3),co(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)co(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)oo(e.charCodeAt(n));return 5+e.length}return oo(21),co(Vn(e.name)+1),5},uo=e=>{let t=io,n=ao;io=0,ao=0;let r=[lo(e),io,ao];return io=t,ao=n,r},fo=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,po=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,mo={integer:e=>`${fo(`1`)} ${po(e)}`,boolean:e=>`${fo(`0`)} ${fo(`(${e} ? 116 : 102)`)}`,set:e=>`${fo(`5`)} ${po(e)}`,function:e=>`${fo(`9`)} ${po(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${po(`0`)} } for (; r > 0; r--) { ${fo(`0`)} } h ^= ${t}; l ^= ${n}; }`},ho=()=>({H0:Ja,H1:Ya,H2:Xa,H3:Za,L0:Qa,L1:$a,L2:eo,L3:to,initialHigh:no,initialLow:ro}),go=(e,t)=>{let n=io,r=ao;ao=e[0],io=e[1],yo(t),e[0]=ao,e[1]=io,io=n,ao=r},_o=e=>{oo(5),co(e)},vo=e=>{oo(9),co(e)},yo=e=>{if(typeof e!=`object`||dn(e))lo(e);else if(un(e)){let t=L(e);vo(t.domain.length);for(let e=0;e<t.domain.length;e++)yo(t.domain[e]),yo(t.range[e])}else{let t=I(e).elements;_o(t.length);for(let e of t)yo(e)}},bo=e=>{let t=io,n=ao;io=no,ao=ro;for(let t of e)yo(t);let r=BigInt(io>>>0)<<32n|BigInt(ao>>>0);return io=t,ao=n,r},xo=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=io,a=ao;for(let n=0;n<e;n++)io=no,ao=ro,t(n),r[2*n]=ao,r[2*n+1]=io;return io=i,ao=a,n},So=(e,t)=>xo(e.length,n=>{for(let r of t)yo(e[n][r])}),Co=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),wo=1024,To=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*wo),relations:[]}),Eo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Do=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Oo=(e,t,n,r,i)=>{let a=t===`next`?Do(e,t,r):void 0;if(a!==void 0)return a;let o=Eo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},ko=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Ao=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?m(a):`Unknown location`}`:ko(r.body.location.range,a)||!a?`${r.name} ${m(i)}`:`${r.name} ${m(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},jo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,Mo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,No=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Po=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Fo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Io=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Lo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Ro=(e,t,n)=>{let r=new Set(n.map(jo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Co.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Eo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(jo(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Lo(t.bounds):t.params.map(e=>e.name);m(t.body,Io(n,e.scope)),t.kind===`Function`&&Fo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Io(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Io(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Po(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,Mo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,No(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,Mo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Io(Lo(e.bounds),t)),r(Fo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Io(Lo(e.bounds),t)),r(Fo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Io(Lo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Io(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Io(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},zo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=zo(e,r,n);if(t!==-1)return t}}return-1},Bo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=zo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:zo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Vo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Ho=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Uo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Wo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Go=(e,t)=>t.forEach((t,n)=>{let r=bo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*wo+i;e.registers[o]=Math.max(e.registers[o],Wo(a)+1)}),Ko=(e,t)=>{let n=e.registers.subarray(t*wo,(t+1)*wo),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*wo*wo/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*wo?a===0?i:wo*Math.log(wo/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},qo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Jo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>qo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Yo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Xo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Zo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Qo=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},$o=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Xo(e,t))&&Yo(n,a),Zo(e,t).forEach(e=>i(e).forEach(e=>Yo(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?m(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Zo(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Yo(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Xo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Jo(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Zo(e,t).forEach(e=>{i(e),s(e,0)}),n},es=[`init`,`next`,`invariant`,`constraint`,`implied`],ts=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,ns=e=>es.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>ts(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||ts(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),rs=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?m(i):`Unknown location`}`,distinct:Ko(e,r)}}),relations:ns(e).map(t=>({kind:t.kind,label:t.label,...Qo(e,t),expressions:$o(e,t.node)}))}),is=(e,t,n)=>{let r=Do(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},as=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),os=(e,t)=>as.has(e)?new y(t):new x(t),ss=(e,t,n,r)=>new x(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${R(r)}`),cs=(e,t,n=e)=>{if(!P(e)||Un(e))throw new x(`Applying ${t} to the following value,\nwhich is not a finite set:\n${R(n)}`);return I(e)},ls=e=>typeof e==`object`&&e.kind===`Operator`,z=(e,t,n)=>{let r=e[t];if(r===void 0||ls(r))throw os(n,`${n} expects a value as argument ${t+1}`);return r},us=(e,t,n)=>{let r=z(e,t,n);if(typeof r!=`boolean`)throw os(n,`${n} expects a boolean but received ${R(r)}`);return r},ds=(e,t,n)=>{let r=e[t];if(r===void 0||!ls(r))throw os(n,`${n} expects an operator as argument ${t+1}`);return r},fs=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),B=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ps=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ms=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),hs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(z(n,0,e),z(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),gs=e=>e>2147483647||e<-2147483648,_s=e=>new x(`Overflow when computing ${e}`),vs={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},ys={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},bs={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},xs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ss=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ys[e.operator];if(e.kind!==`Function`)return vs[e.kind];let t=or(e);return t===void 0?`FcnRcdValue`:xs[t]},Cs=e=>bs[Ss(e)],ws=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ts=(e,t)=>{let n=n=>(...r)=>{let i=Hi.sets?.length??0;try{return n(...r)}catch(n){if(!(n instanceof y)||n instanceof ne)throw n;let r=Wi(i);throw Hi.sets&&(Hi.sets.length=i),e.isLazy!==!0&&n instanceof x&&!r?n:ws(t,n.message)}},r=n(e.evaluate);return{...e,evaluate:(n,i)=>{if(n.length!==e.arity)throw ws(t,`array is not of length ${e.arity}`);return r(n,i)},evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Es=(e,t)=>{if(typeof e!=`number`)throw ws(t,`Cannot cast tlc2.value.impl.${Ss(e)} to tlc2.value.impl.IntValue`);return e},Ds=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Os=(e,t,n,r)=>{let i=Ds(e,n,`IntValue`,2);return hs(t,(e,n)=>{let a=Es(n,i),o=Es(e,i),s=r(o,a);if(gs(s))throw _s(`${o}${t}${a}`);return s})},ks=(e,t,n)=>{if(typeof e!=`number`)throw new x(`The ${t} argument of ${n} should be an integer, but instead it is:\n${R(e)}`);return e},As=(e,t,n=e)=>hs(e,(e,r)=>t(ks(e,`first`,n),ks(r,`second`,n))),js=(e,t,n)=>({...ms(e,t,n),isLazy:!0}),Ms=(e,t,n)=>{let r=ds(e,t,n);return()=>r.call([])},Ns=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Ps=()=>({implication:lg,negate:ug,equivalent:dg,body:fg,condition:(e,t)=>{if(typeof e!=`boolean`)throw Kh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw qh(t,n,e);return e},apply:ca,expectFunction:ag,tuple:li,set:qr,record:di,writtenRecord:bn,equal:mr,enumerate:yg,choiceElements:G_,noChoice:e=>{throw K_(e)},filterPredicate:W_,isReducible:ln,finiteElements:e=>I(e).elements,addBounded:on,normalizedSet:nr,isBeyondBound:sn,cardinality:Fi,functionDomain:si,sortedFunction:rr,unassigned:(e,t)=>{throw eg(e,t)},prime:h_,keepLazyContext:og,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>rg(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Fs,Is;const Ls=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Rs=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),zs=e=>`local${e.counter++}`,Bs=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),mt(e).forEach(e=>Bs(e,t)),t},Vs=(e,t,n)=>{let r=Bs(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=Rs(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},Hs=(e,t,n)=>`${Rs(e,C_(t,e.environment))}(${Vs(e,t,n)})`,Us=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Ws=(e,t,n,r)=>{let i=zs(e),a=zs(e),o=zs(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},Gs=(e,t,n)=>{let r=t.kind===`Forall`;return Us(e,n,n=>{let i=t.bounds.map(()=>zs(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${Qs(e,r.set,n)}, ${Rs(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=zs(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Qs(e,t.body,n)}, ${Rs(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Ws(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Ks=(e,t,n,r,i)=>Us(e,i,i=>{let a=zs(e),o=zs(e),s=Rs(e,t),c=`choiceElements(${Qs(e,n,i)}, ${s}, ${Rs(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Qs(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Ws(e,a,o,l)} return noChoice(${s});`}),qs=(e,t,n,r)=>Us(e,r,r=>{let i=zs(e),a=zs(e),o=zs(e),s=zs(e),c=Rs(e,t),l=`if (!isReducible(${i})) return ${Rs(e,U_(t,e.environment))}(${i}, ${Vs(e,t,r)});`,u=Qs(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${Qs(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Ws(e,a,s,d)} return normalizedSet(${o});`}),Js=(e,t,n,r)=>Us(e,r,r=>{let i=zs(e),a=zs(e),o=zs(e),s=zs(e),c=zs(e),l=zs(e),u=Rs(e,B_(t,e.environment)),d=Vs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Qs(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Qs(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Ws(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Ys=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Qs(e,r[0],n),a=Qs(e,r[1],n),o=Rs(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Qs(e,r[0],n)}, ${Rs(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)}, ${Rs(e,t)})`;if(M(t))return Hs(e,t,n);let i=Kg(t.operator,e.environment);if(i?.kind!==`Builtin`)return Hs(e,t,n);if(i.name===`DOMAIN`)return`${Rs(e,Xh(t))}(${Qs(e,r[0],n)})`;if(i.name===`TLCEval`)return Hs(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Rs(e,Zh(t,i))}(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&E_(r[0],a))return`${Rs(e,i.evaluateUnary)}(${Qs(e,r[0],n)})`;let o=r.length===2&&E_(r[0],a)&&E_(r[1],a);return i.evaluateBinary&&o?`${Rs(e,i.evaluateBinary)}(${Qs(e,r[0],n)}, ${Qs(e,r[1],n)})`:Hs(e,t,n)},Xs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=r_(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Xs(e.expression,t,n);case`FieldAccess`:return Xs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Xs(e,t,n));default:return!1}},Zs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Zs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Zs);default:return!1}},Qs=(e,t,n)=>{let r=(t,r=n)=>Qs(e,t,r);switch(t.kind){case`Number`:return mn(t.value)?String(t.value):Hs(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return Hs(e,t,n);let i=r_(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Rs(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Rs(e,i.value):Hs(e,t,n)}case`Apply`:return Ys(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Rs(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Rs(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{F_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Xs(t.function,n,e.environment)?r(t.function):Zs(t.function)?r(t.function,i):Hs(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Rs(e,t)}))`,o=Yh(e.environment.runtime.version),s=o?`, ${Rs(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Rs(e,Jh(t))}(${r(t.record)})`;case`Record`:{let i=J_(t.fields);if(Y_(i))return Hs(e,t,n);let a=Rs(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Rs(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?Hs(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?Gs(e,t,n):Hs(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Ks(e,t,t.set,t.pattern.name,n):Hs(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!z_(t)?Js(e,t,r.pattern.name,n):Hs(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?qs(e,t,t.bound.pattern.name,n):Hs(e,t,n);default:return Hs(e,t,n)}},$s=(e,t)=>{if(!Ns.has(e.kind)||(Is??=Ls(),!Is))return;let n={environment:t,references:[],helpers:[],counter:0},r=Qs(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
77
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Fs??=Ps(),Function(...Object.keys(Fs),...i,a)(...Object.values(Fs),...n.references)},ec={kind:`Local`},tc=/* @__PURE__ */ new WeakSet,nc=/* @__PURE__ */ new WeakMap,rc=/* @__PURE__ */ new WeakMap,ic=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ac=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),oc=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,sc=e=>e.kind===`Operator`?e.params.length:0,cc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],lc=e=>e.name.includes(`!`),uc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},dc=(e,t,n)=>{let r=t.bindings.get(e);return r&&oc(r.position,t.location)&&(!n||oc(r.position,n.start))?r:void 0},fc=(e,t)=>e!==void 0&&t!==void 0&&m(e)===m(t),pc=(e,t,n,r)=>{if(t===void 0)return!0;if(fc(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=m(i),o=t.range&&m(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},mc=(e,t,n,r)=>pc(t,uc(e,t)??dc(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,hc=(e,t,n)=>{pc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},gc=(e,t,n,r)=>t.reduce((e,t,i)=>mc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),_c=(e,t,n)=>t.reduce((e,t)=>mc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),vc=e=>e.kind===`Name`?[e.name]:e.names,yc=e=>e.flatMap(e=>vc(e.pattern)),bc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||oc(n.location,t.location))?n:void 0},xc=(e,t)=>{let n=bc(e,t);return n?{key:t.getKey(n),arity:sc(n),params:cc(n),kind:`Definition`}:t.imported.get(e)},Sc=(e,t,n)=>uc(t,e)??xc(e,n),Cc=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),wc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Cc(e.location,e.spelling??t)},Tc=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return oc(e.location,e.args[0].location)?`prefix`:`postfix`}},Ec=e=>!/^[\p{L}\d_]/u.test(e),Dc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Oc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,kc=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Ac=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?kc(e.name,[],void 0):kc(e.operator,e.args,e.argumentCounts),jc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Mc=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:yc(e.bounds),body:e.body,sets:jc(e.bounds)};case`SetMap`:return{names:yc(e.bounds),body:e.expression,sets:jc(e.bounds)};case`SetFilter`:return{names:vc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:vc(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Nc=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Pc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Fc=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ic=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Ic(e.body,t):mt(e).reduce((e,n)=>e??Ic(n,t),void 0)},Lc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Lc(i,t,n||Fc(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ic(e.set,t):Ic(e,t)},Rc=e=>e.kind===`Label`?Rc(e.body):e,zc=e=>typeof e==`number`?`argument selector ${e}`:e,Bc=`within the scope of a declaration
|
|
78
|
+
from outside that declaration's scope.`,Vc=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:m(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Rc(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:Lc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?Ic(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&Fc(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Bc}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=zc(n.operand);if(l.isSufficesOpen){if(Oc(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=Rc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Sc(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=Mc(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Nc(e);if(!c)return;let f=Oc(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Oc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(Fc(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Bc}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},Hc=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:m(e.location.range),message:n}),!0)},Uc=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=m(r),a=e.params.filter((r,i)=>{let a=uc(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:m(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Wc=(e,t,n,r)=>{if(!Pc(e))return!1;let i=Ac(e),a=i[0],o=i.length>1&&a.kind===`Name`?uc(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Vc(e,i,o,t,n,r),o!==void 0},Gc=(e,t,n,r)=>{let i=e.location;if(tl(e,n,r))return;let a=rc.get(e);if(a!==void 0)return a;if(ic(t))return e.kind===`Apply`?e.args.length:0;let o=uc(n,t);if(o?.isNonFact){r.errors.push({location:m(wc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Wc(e,n,r,!1)||Dc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=ec),o)return o.arity;let s=xc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,rc.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(uc(n,c)!==void 0||xc(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=m(e.kind===`Apply`&&l===`-.`?Cc(i,`-`):wc(e,t));if(!Ec(t)||Dc(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=Tc(e);d&&i.range&&r.errors.push({location:m(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},Kc=(e,t,n)=>(e.forEach(e=>V(e.set,t,n)),e.reduce((e,t)=>gc(e,vc(t.pattern),t.pattern.ranges,n),t)),qc=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>qc(e,t)),Jc=(e,t)=>{e.kind===`FunctionConstruction`&&qc(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>Jc(e,t))},Yc=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?yc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:m(o),message:e})},c=e.kind===`Function`?Kc(e.bounds,t,i):_c(t,e.params,i),l=uc(c,a)??dc(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(V(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Jc(e.body,a),e.isSelfReferential=qc(e.body,a)):V(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:pc(a,uc(t,a)??dc(a,i,o),{kind:`Definition`,arity:sc(e),range:o},i)},Xc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(uc(e,t.name)?.isPending)return e;let n={name:t.name,arity:sc(t),params:cc(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>sl(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ic(t.name)?e:s(e,e=>!oc(t.location,e.location)),o={name:t.name,arity:sc(t),kind:`Definition`,range:t.location.range,parent:a};if(lc(t))return{...o,params:cc(t)};let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ic(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Yc(t,a,u,i)?{...o,params:cc(t)}:a},a),()=>!0)},Zc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:uc(t,r)??dc(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Qc=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Zc(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:m(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},$c=(e,t,n)=>{if(Qc(e,t,n))return;let r=e.operator,i=Sc(r,t,n),a=Gc(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:m(e.argumentsRange??wc(e,r)),message:`The operator ${r} requires ${a-(Zc(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>el(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:m(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=Gc(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else V(i,t,n);return!0}if(i.kind===`Lambda`){V(i,t,n);let o=i.params.length===c;return!o&&tc.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??wc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return V(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Sc(u,t,n)?.params??[],f=Gc(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(wc(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},el=(e,t,n)=>{e.kind===`Identifier`?Gc(e,e.name,t,n):V(e,t,n)},tl=(e,t,n)=>{let r=nc.get(e);return r?(r.args.forEach(e=>el(e,t,n)),n.errors.push(r.error),!0):!1},V=(e,t,n)=>{if(tc.has(e)&&!n.isGenerated){V(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>V(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Qc(e,t,n))return;let r=e.name,i=Gc(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:m(wc(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:Gc(e,e.operator,t,n);return;case`Apply`:$c(e,t,n);return;case`Lambda`:V(e.body,gc(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:V(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&V(e.other,t,n);return;case`Let`:V(e.body,Xc(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:V(e.body,Kc(e.bounds,t,n),i(yc(e.bounds)));return;case`UnboundedQuantifier`:V(e.body,gc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&V(e.set,t,n),V(e.body,gc(t,vc(e.pattern),e.pattern.ranges,n),i(vc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:V(e.predicate,Kc([e.bound],t,n),i(vc(e.bound.pattern)));return;case`SetMap`:V(e.expression,Kc(e.bounds,t,n),i(yc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:m(r.location.range??Cc(r.location,r.name)),message:`Non-unique fields in constructor.`}),V(r.value,t,n)});return;case`Except`:V(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),V(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:V(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Hc(e,n))return;V(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Uc(e,t,n);return;case`Subexpression`:if(tl(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>el(e,t,n)),Wc(e,t,n,!1)}},nl=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Qc(e,t,n)||Wc(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&uc(t,r)?.isNonFact?n.errors.push({location:m(wc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||V(e,t,n)}),rl=(e,t,n)=>(e.set&&V(e.set,t,n),mc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),il=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:rl(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?il(t,e.scope,e.unit,!0):V(t,e.scope,e.unit),e),{scope:t,unit:n});return V(e.conclusion,i.scope,i.unit),i.scope},al=(e,t,n)=>e.kind===`AssumeProve`?il(e,t,n):(V(e,t,n),t),ol=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&nl(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>cl(t,e,r),t)},sl=(e,t,n)=>{let r=ml(e,t,n);return e.name===void 0?r:mc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},cl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=al(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return ol(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return ol(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return nl(r.facts,t,n),o(t);case`Instance`:return o(sl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?sl(t,e,i):Xc([t],e,n),t));case`Have`:case`Case`:return V(r.expression,t,i),ol(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>V(e,t,i)),a(t);case`Take`:return a(gc(Kc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=gc(Kc(r.bounds,t,i),r.names,r.nameRanges,i);return V(r.body,o,{...i,labelParams:[...i.labelParams,...yc(r.bounds),...r.names]}),ol(e.proof,a(t),n),a(o)}default:return ol(e.proof,a(t),n),a(t)}},ll=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:al(e.statement,void 0,t);e.name!==void 0&&hc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),ol(e.proof,n,t),r&&(r.isInProof=!1)},ul={line:0,column:0},dl=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),fl=(e,t)=>{let n=new Map([...ac,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},pl=(e,t,n,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){V(n,o,a);return}let i=Gc(n,n.name,o,a);if(i!==void 0&&i!==t.arity)throw new r(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){a.errors.push({location:m(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(n)?o&&a.errors.push({location:m(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):c.set(n,i)});let l=t.filter(e=>!c.has(e.name)),u=e=>!uc(o,e.name)&&!xc(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&a.errors.push({location:m(r),message:`Substitution missing for symbol ${t.name} declared at ${m(i)} \nand instantiated in module ${n}.`})}),c},ml=(e,t,n)=>{let r=n.getInstance(e);return pl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>mc(e,t,r,n),t)},hl=(e,t,n,r)=>{let i=fl(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),pl(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:ul}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},gl=(e,t)=>{let n=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>oc(e.location,t.location)?-1:+!!oc(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof r)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(n,e)),o.forEach(e=>i(t,e))}),n},_l=(e,t)=>{let n=fl(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...ac,...t.bound].map(([e,t])=>[e,{...t,position:ul}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c)=>({location:e,check:(l,u)=>c({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),l=(e,t)=>e.map(e=>c(e.location,void 0,!1,n=>hc(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return gl([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>c(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=pc(e.name,a.get(e.name),n,t);r&&(a.set(e.name,n),o.add(n)),s.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>c(t.location,t,!0,n=>{dl(e,t)?V(t.body,void 0,n):Yc(t,void 0,n,o)&&a.set(t.name,{kind:`Definition`,arity:sc(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>c(e.location,void 0,!1,n=>{_c(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>hc(t,e,n)),e.name!==void 0&&hc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>c(e.location,void 0,e.name!==void 0,t=>{V(e.expression,void 0,t),e.name!==void 0&&hc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>c(e.location,void 0,e.name!==void 0,t=>ll(e,t))),...e.uses.map(e=>c(e.location,void 0,!1,t=>nl(e.facts,void 0,t))),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:m(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},vl=/* @__PURE__ */ new WeakSet,yl=/* @__PURE__ */ new WeakMap,bl=(e,t)=>{if(t.length===0)return e;let n={...e};return vl.has(e)&&vl.add(n),yl.set(n,[...t,...yl.get(e)??[]]),n},xl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Dl(e,(e,r)=>xl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Sl=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Cl=/* @__PURE__ */ new WeakMap,wl=e=>Cl.get(e)??e.name,Tl=(e,t)=>(wl(t)!==e.name&&Cl.set(e,wl(t)),e),El=(e,t)=>Tl(e.kind===`Function`?{...e,bounds:Sl(e.bounds,e=>t(e,[])),body:t(e.body,yc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Dl=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>El(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Sl(e.bounds,n),body:t(e.body,yc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,vc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,vc(e.bound.pattern))};case`SetMap`:return{...e,bounds:Sl(e.bounds,n),expression:t(e.expression,yc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Ol=(e,t)=>{Dl(e,(e,n)=>(t(e,n),e))},kl=`LAMBDA`,Al=e=>`${e}@SUBSTITUTION`,jl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(jl),Ml=(e,t)=>{if(e.kind!==`Identifier`)return!jl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!jl(n.body)},Nl=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return Ol(e,(e,n)=>r.push(...Nl(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Pl=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Fl=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Il=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ll=(e,t)=>e.map(e=>({pattern:Il(e.pattern,t),set:e.set})),Rl=(e,t)=>e.kind===`Function`?{...e,bounds:Ll(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},zl=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Tl({...Rl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ll(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Il(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Il(e.bound.pattern,n),set:e.bound.set}};default:return e}},Bl=e=>`${e}@ENABLED`,Vl=(e,t)=>e.modes.get(t)??e,Hl=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),Ul=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Ul(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Hl(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Ul(r.body,t,/* @__PURE__ */ new Map):void 0},Wl=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Hl(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Bl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Xl(e.expression,Vl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Xl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Xl(e.subscript,Vl(t,`Primed`),n),location:r},Xl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Ul(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Bl(r),location:e.location},location:e.location},Xl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Gl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ec}),Kl=(e,t)=>e.map(e=>Gl(e.name,t)),ql=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:Kl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Jl=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...Kl(t,r),...i.map(e=>Gl(e,r))],location:r},location:r}},Yl=(e,t)=>e.instantiation.isParameterized(t)?Ql(e,t):void 0,Xl=(e,t,n)=>{let i=e=>Xl(e,t,n),a=t.instantiation,o=a.params,s=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Xl(e.expression,Vl(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Xl(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Vl(t,`Enabled`),n)};let c=Wl(e,t,n);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let n=a.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Ml(n,a)))return bl(n,[e]);if(n&&r){let t=Al(e.name);return r.set(t,n),Gl(t,e.location)}let i=Yl(t,e.name);if(i===void 0)return e;if(o.length===0)return{...e,name:i};let s=a.getDefinition(e.name);return s&&sc(s)>0?Jl(i,o,sc(s),e.location):{kind:`Apply`,operator:i,args:Kl(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let n=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||vl.has(e),l=e=>(c&&vl.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:n,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...n],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:kl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:kl,args:n,resolution:ec},location:e.location};if(s)throw new r(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Yl(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Kl(o,e.location),...n]}}if(e.kind===`OperatorReference`&&s(e.operator)){let n=a.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return bl(n,[e]);let r=Yl(t,e.operator);if(r===void 0)return e;let i=a.getDefinition(e.operator);return o.length>0&&i?Jl(r,o,sc(i),e.location):{...e,operator:r}}let l=Pl(t),u=Dl(e,(e,r)=>r.length===0?i(e):Xl(e,t,Fl(n,r,l)));return zl(u,n,l)},Zl=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Gl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ql=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Pl(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=Rl(El(i,(e,t)=>Xl(e,s,Fl(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&yl.set(l,[u,...yl.get(i.body)??[]]),Zl({...c,body:l},r.params,i.location)}):t},$l=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Nl(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Yl(i,e)??e,getQualifiedKey:t=>{let n=Yl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Zl(r,e.params,r.location)):t}}},eu=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(eu),tu=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Dl(e,e=>tu(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>oc(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},nu=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ru=(e,t)=>e.definitions.some(e=>eu(e.body))||e.assumptions.some(e=>eu(e.expression))||e.theorems.some(e=>{let t=nu(e);return t!==void 0&&eu(t)})?{...e,definitions:e.definitions.map(e=>El(e,e=>tu(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:tu(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=nu(e);return n===void 0?e:{...e,statement:tu(n,t,[])}})}:e,iu=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),au={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},ou=(e,t)=>{let n=au[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},su=(e,t)=>`${e}${t}`,cu=(e,t,n)=>`${e}${t}${n}`,lu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},uu=(e,t,n)=>`${e},${t},${n}`,du=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),fu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),pu=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),mu=(e,t)=>{t.constraints.forEach((t,n)=>fu(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>pu(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},hu=(e,t,n,r)=>({...du(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),gu=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,_u=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,vu=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...hu(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),yu=hu(`$Set`,0,[2],[1]),bu=hu(`$Junction`,0,[3],[1]),xu=hu(`$Choose`,0,[2],[1]),Su=hu(`$Function`,0,[3],[1]),Cu=hu(`$FcnApply`,0,[2,2],[1,1]),wu=hu(`$RcdSelect`,0,[2,0],[1,1]),Tu=hu(`'`,2,[1],[0]),Eu=hu(`ENABLED`,1,[2],[0]),Du=hu(`[]`,3,[3],[0]),Ou=hu(`$SquareAct`,2,[2,1],[0,0]),ku=hu(`$WF`,3,[1,2],[0,0]),Au=hu(`$TemporalExists`,3,[3],[0]),ju=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Mu=e=>e.map(e=>({name:e,arity:0})),Nu=(e,t)=>t.location.range?a(`${e}.`,t.location.range):new r(`${e} at line ${t.location.line}, column ${t.location.column}`),Pu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Fu=e=>e.kind!==`Let`&&e.kind!==`Label`,Iu=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=vu.get(t)??iu.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=du(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(cu(e,n,t))}),pu(r.argConstraints,su(e,n),t.data.level),mu(r,t.data)}),r},a=(e,t,n=[],i=[])=>{let a=e=>i.includes(e);if(t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>gu(e,n))throw new r(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new r(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},s=(t,n,r)=>e.conditions.has(uu(t,n,r)),c=du(Math.max(e.level,...t.filter((t,n)=>_u(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{_u(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>fu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||fu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>fu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||fu(c.constraints,t,gu(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>fu(c.constraints,e,gu(r,a)))}))}),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);n?.kind===`Operator`&&fu(c.constraints,t.param,gu(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>pu(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>pu(c.argConstraints,su(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&pu(c.argConstraints,su(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);n&&pu(c.argConstraints,su(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(lu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=lu(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(cu(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(cu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(cu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,Mu(e.params),e.body,t)};let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=du();return e.params.add(r),{kind:`Declared`,data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:du()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=ju(n,Mu(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Nu(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Nu(`Action used where only temporal formula or state predicate allowed`,e);Pu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Fu(n)&&n.kind!==r)throw Nu(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>mu(i,v(e,n))),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof r)||t.sany?t:Nu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return du();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=s(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(bu,n)}case`Prime`:case`Unchanged`:return c(Tu,[e.expression],t);case`Enabled`:return c(Eu,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Du,[n])}case`If`:return c(bu,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(bu,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(bu,[e.body],t,e.bounds.map(e=>e.set),yc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Nu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Au:bu,[e.body],t,[],e.names);case`Choose`:return c(xu,[e.body],t,e.set?[e.set]:[],vc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(yu,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(yu,[e.predicate],t,[e.bound.set],vc(e.bound.pattern));case`SetMap`:return c(yu,[e.expression],t,e.bounds.map(e=>e.set),yc(e.bounds));case`FunctionConstruction`:return c(Su,[e.body],t,e.bounds.map(e=>e.set),yc(e.bounds));case`Record`:return c(Su,e.fields.map(e=>e.value),t);case`RecordSet`:return c(yu,e.fields.map(e=>e.value),t);case`Except`:return c(yu,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Cu,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(yu,e.args,t)}]);case`Bracket`:return du();case`FieldAccess`:return a(wu,[o(e.record,t),{kind:`Value`,data:du()}]);case`BoxAction`:case`AngleAction`:return c(Ou,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(ku,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return du()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return mt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,ju(t,Mu(e.names))),i;default:return Ol(e,(e,n)=>a(e,r,ju(t,Mu(n)))),i}},_=(e,t,n,r)=>{let i=ju(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...du(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(su(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(cu(e.name,n,t.name))).map(e=>uu(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(lu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=lu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...du(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},Lu=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Lu(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=du(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),mu(a,e)}),a},Ru=(e,t,n,r)=>{let i=Iu(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Lu(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=m(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:m(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=gl([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Lu(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw te(n)}})),...n],r);if(l.length>0)throw te(l,!1,void 0,r)},zu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Bu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Vu=/* @__PURE__ */ new Set([...zu,...Bu,`Enabled`]),Hu=/* @__PURE__ */ new Set([`~>`,`-+->`]),Uu=/* @__PURE__ */ new Set([...Hu,`\\cdot`]),Wu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Gu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Ku=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),qu=(e,t)=>Wu.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ju=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(zu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Bu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Hu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Vu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Uu.has(e.operator))&&(r[0]|=1),Vu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=ht(e);if(u!==void 0&&!M(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{qu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Gu.has(u)&&(r[0]|=8),Ku.has(u)&&(r[0]|=256),!a&&qu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Yu=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Xu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Zu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Ju(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&270,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Yu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Yu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Xu(t[e],l[e*r])))),p=Yu(a,r,f,270);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&270:e),words:r}},Qu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?$u(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},$u=(e,t)=>{let n=t.facts.words,r=Ju(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Qu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Xu(e.callee,r[0])||(i[0]|=r[0]&270)}),i},ed=(e,t)=>!(Qu(e,t)[0]&1),td={any:2,repeated:4,streamed:8,replayed:260},nd=(e,t,n)=>($u(e,t)[0]&td[n])!==0,rd=(e,t,n=`any`)=>(Qu(e,t)[0]&td[n])!==0,id=(e,t)=>{let n=Qu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},ad=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},od=(e,t)=>{let n=$u([e],t);return n[0]&16?void 0:ad(n)},sd=(e,t)=>!!($u([e],t)[0]&1),cd=(e,t,n)=>new x(`Applying ${e} to the following value,\nwhich is not ${t}:\n${R(n)}`),ld=e=>un(e)?L(e):void 0,ud=`a function with a finite domain`,dd=(e,t,n)=>{let r=z(e,t,n),i=ld(r);if(!i)throw cd(n,ud,r);return i},fd=(e,t)=>{let n=z(e,1,t),r=ld(n),i=r&&gd(r,z(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw ss(`second`,t,`bag`,n);return i},pd=(e,t,n)=>{let r=t[n];if(!r||!hd(r))throw ss(n===0?`first`:`second`,`(+)`,`bag`,z(e,n,`(+)`));return r},md=(e,t)=>{if(!P(e)||!F(e))throw t();return I(e).elements},hd=e=>e.range.every(e=>typeof e==`number`&&e>0),gd=(e,t)=>{let n=e.domain.findIndex(e=>Ur(t,e));return n===-1?void 0:e.range[n]},_d=e=>{if(typeof e==`number`)return e;let t=`tlc2.value.impl.${Ss(e)}`;throw new y(`class ${t} cannot be cast to class tlc2.value.impl.IntValue (${t} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},vd=(e,t)=>{let n=_d(e)+_d(t);if(gs(n))throw _s(`${e}+${t}`);return n},yd=(e,t,n)=>{let r=_d(e.range[t]),i=gd(n,e.domain[t]);if(i===void 0)return r;let a=r-_d(i);if(gs(a))throw _s(`${r}-${i}`);return a},bd=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>Ur(t,e[0]));i?i[1]=vd(i[1],n):e.push([t,n])},xd=e=>e.domain.map((t,n)=>[t,e.range[n]]),Sd=rr([],[]),Cd=e=>[fs(`EmptyBag`,Sd),B(`IsABag`,1,e=>{let t=ld(z(e,0,`IsABag`));return t!==void 0&&hd(t)}),B(`BagCardinality`,1,e=>{let t=z(e,0,`BagCardinality`);return dd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw cd(`BagCardinality`,`a bag`,t);return vd(e,n)},0)}),B(`BagIn`,2,e=>{let t=fd(e,`BagIn`);return t!==void 0&&t>0}),B(`CopiesIn`,2,e=>fd(e,`CopiesIn`)??0),B(`\\oplus`,2,e=>{let t=[0,1].map(t=>ld(z(e,t,`(+)`))),n=pd(e,t,0),r=pd(e,t,1),i=xd(n);return r.domain.forEach((e,t)=>bd(i,e,r.range[t],n.domain.length)),Qr(i)}),B(`\\ominus`,2,e=>{let t=z(e,0,`(-)`),n=z(e,1,`(-)`),r=ld(t),i=ld(n);if(!r)throw ss(`first`,`(-)`,`bag`,t);if(!i)throw ss(`second`,`(-)`,`bag`,n);return Qr(r.domain.flatMap((e,t)=>{let n=yd(r,t,i);return n>0?[[e,n]]:[]}))}),B(`BagUnion`,1,e=>{let t=z(e,0,`BagUnion`),n=md(t,()=>cd(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??Sd;let r=e=>{let n=ld(e);if(!n)throw new x(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(t)}`);return n},i=xd(r(n[0]));return n.slice(1).forEach(e=>{let t=r(e);t.domain.forEach((e,n)=>bd(i,e,t.range[n]))}),Qr(i)}),B(`\\sqsubseteq`,2,e=>{let t=z(e,0,`\\sqsubseteq`),n=z(e,1,`\\sqsubseteq`),r=ld(t),i=ld(n);if(!r)throw cd(`\\sqsubseteq`,ud,t);if(!i)throw cd(`\\sqsubseteq`,ud,n);return r.domain.every((e,t)=>{let n=gd(i,e);return _d(r.range[t])<=(n===void 0?0:_d(n))})}),ps(`BagOfAll`,2,e=>{let t=ds(e,0,`BagOfAll`),n=z(e,1,`BagOfAll`),r=ld(n);if(!r)throw ss(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>bd(i,t.call([e]),r.range[n])),Qr(i)}),B(`SubBag`,1,t=>{let n=z(t,0,`SubBag`);if(!un(n))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Cs(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=L(n),i=I(qr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${R(r)}, which is not in its domain`);return Kr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>rr(e.map(e=>e[0]),e.map(e=>e[1]))))}),B(`BagToSet`,1,e=>ua(dd(e,0,`BagToSet`))),B(`SetToBag`,1,e=>{let t=z(e,0,`SetToBag`),n=md(t,()=>cd(`BagToSet`,ud,t));return rr([...n],n.map(()=>1))})],wd={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},H={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Td={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Ed=[{lower:`true`,upper:`TRUE`,token:H.true},{lower:`false`,upper:`FALSE`,token:H.false},{lower:`null`,upper:`NULL`,token:H.null}],Dd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
|
+
`],[`r`,`\r`],[`f`,`\f`]]),Od=1024,kd=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=H.none,s=0,c=[wd.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===wd.emptyArray||e===wd.nonemptyArray?`[${u[t]}]`:e===wd.emptyDocument||e===wd.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new y(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
80
|
+
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new y(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
81
|
+
`.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
82
|
+
`){r++,i=n;return}if(t===`\r`)return}},v=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
|
|
83
|
+
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},b=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
84
|
+
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=b();if(e===void 0)throw m();return e},x=()=>{let t=Ed.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return H.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return H.none}return n+r<e.length&&g(e[n+r])?H.none:(n+=r,t.token)},S=()=>{let t=Td.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===Od)return H.none;let a=e[n+i];if(a===`-`){if(t===Td.none)t=Td.sign;else if(t===Td.exponentE)t=Td.exponentSign;else return H.none}else if(a===`+`){if(t!==Td.exponentE)return H.none;t=Td.exponentSign}else if(a===`e`||a===`E`){if(t!==Td.digit&&t!==Td.fractionDigit)return H.none;t=Td.exponentE}else if(a===`.`){if(t!==Td.digit)return H.none;t=Td.decimal}else if(a<`0`||a>`9`){if(g(a))return H.none;break}else if(t===Td.sign||t===Td.none)r=a===`0`,t=Td.digit;else if(t===Td.digit){if(r)return H.none}else t===Td.decimal?t=Td.fractionDigit:(t===Td.exponentE||t===Td.exponentSign)&&(t=Td.exponentDigit)}return i===Od||t!==Td.digit&&t!==Td.fractionDigit&&t!==Td.exponentDigit?H.none:(s=i,H.number)},te=()=>{let t=c.length-1,r=c[t];if(r===wd.emptyArray)c[t]=wd.nonemptyArray;else if(r===wd.nonemptyArray){let e=ee();if(e===`]`)return H.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===wd.emptyObject||r===wd.nonemptyObject){if(c[t]=wd.danglingName,r===wd.nonemptyObject){let e=ee();if(e===`}`)return H.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=ee();if(e===`"`)return H.doubleQuotedName;if(e===`'`)return h(),H.singleQuotedName;if(e===`}`){if(r!==wd.nonemptyObject)return H.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return H.unquotedName;throw p(`Expected name`)}else if(r===wd.danglingName){c[t]=wd.nonemptyObject;let r=ee();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===wd.emptyDocument){if(b()===void 0)return H.eof;n--,e.startsWith(`)]}'
|
|
85
|
+
`,n)&&(n+=5),c[t]=wd.nonemptyDocument}else if(r===wd.nonemptyDocument){if(b()===void 0)return H.eof;h(),n--}let i=b();if(i===void 0){if(r===wd.emptyDocument)return H.eof;throw m()}if(i===`]`&&r===wd.emptyArray)return H.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==wd.emptyArray&&r!==wd.nonemptyArray)throw p(`Unexpected value`);return h(),n--,H.null}if(i===`'`)return h(),H.singleQuoted;if(i===`"`)return H.doubleQuoted;if(i===`[`)return H.beginArray;if(i===`{`)return H.beginObject;n--;let a=x();if(a!==H.none)return a;let o=S();if(o!==H.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),H.unquoted},C=()=>(o===H.none&&(o=te()),o),w=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=Dd.get(t);if(a!==void 0)return a;if(t===`
|
|
86
|
+
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},ne=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+w(),o=n):s===`
|
|
87
|
+
`&&(r++,i=n)}throw p(`Unterminated string`)},T=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},re=e=>{if(c.length-1>=255)throw new y(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=H.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=H.none},ae=()=>{let e=C();return e!==H.endObject&&e!==H.endArray&&e!==H.eof},oe=()=>{let e=C(),t=e===H.unquotedName?T():ne(e===H.singleQuotedName?`'`:`"`);return o=H.none,l[c.length-1]=t,t},se=t=>t===H.true||t===H.false?t===H.true:t===H.null?null:t===H.number?(n+=s,{literal:e.slice(n-s,n)}):t===H.unquoted?T():ne(t===H.singleQuoted?`'`:`"`),ce=()=>{let e=C();if(e===H.beginArray){re(wd.emptyArray);let e=[];for(;ae();)e.push(ce());return ie(),e}if(e===H.beginObject){re(wd.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),ce());return ie(),e}let t=se(e);return o=H.none,u[c.length-1]++,t};if(C()===H.eof)return null;let le=ce();return a=!1,le!==null&&C(),le},Ad=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),jd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Md=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Nd=e=>{if(!un(e))return;let t=L(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?ui(n):void 0},Pd=(e,t)=>{let n=`tlc2.value.impl.${Ss(e)}`,r=`tlc2.value.impl.${t}`;return new y(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Fd=e=>new y(`Cannot convert value: unsupported value type tlc2.value.impl.${Ss(e)}`),Id=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ld=e=>`[${e.map(Vd).join(`,`)}]`,Rd=e=>`{${yn(e).map(e=>`${Id(typeof e[0]==`string`?e[0]:R(e[0]))}:${Vd(e[1])}`).join(`,`)}}`,zd=e=>{let t=L(e),n=Bi(t);return n?Ld(n):Rd(t)},Bd=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Vd=e=>typeof e==`string`?Id(e):typeof e==`object`?e.kind===`ModelValue`?Id(e.name):Ss(e)===`RecordValue`?Rd(L(e)):Hd(e):String(e),Hd=e=>{let t=Ss(e);if(t===`TupleValue`)return Ld(L(e).range);if(Bd(t))return zd(e);if(fi(e))return Ld(I(e).elements);throw Fd(e)},Ud=e=>e.map(e=>`${Vd(e)}\n`).join(``),Wd=e=>{let t=Ss(e);if(t===`RecordValue`)return Rd(L(e));if(t===`TupleValue`)return`{${L(e).range.map((e,t)=>`"${t}":${Vd(e)}`).join(`,`)}}`;if(Bd(t))return zd(e);throw Fd(e)},Gd=e=>{if(e===null)throw new y(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Bn(e);if(Array.isArray(e))return li(e.map(Gd));if(e instanceof Map)return ui([...e].map(e=>[Bn(e[0]),Gd(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||gs(t))throw new y(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Kd=e=>{if(typeof e!=`string`)throw new y(`Cannot cast tlc2.value.impl.${Ss(e)} to tlc2.value.impl.StringValue`);return e},qd=(e,t)=>{let n=ca(e,t);if(typeof n!=`string`)throw Pd(n,`StringValue`);return n},Jd=e=>{if(!jd.has(e.toLowerCase()))throw Md.has(e.toLowerCase())?new t(`IOUtils!Serialize does not support the charset ${e}`):new y(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Yd=(e,n,r,i)=>{let a=r.find(e=>!Ad.has(e));if(a!==void 0)throw new y(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new y(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new y(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new t(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=e.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new y(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new y(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?e.writeFile?.(n,i):e.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Xd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Zd=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new y(`${t} (No such file or directory)`);return n},Qd=e=>[Ts(ms(`ToJson`,1,e=>Bn(Vd(z(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonArray`,1,e=>Bn(Hd(z(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`ToJsonObject`,1,e=>Bn(Wd(z(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Ts(ms(`JsonSerialize`,2,t=>{let n=Kd(z(t,0,`JsonSerialize`)),r=z(t,1,`JsonSerialize`);if(!Bi(r)&&!Nd(r))throw ss(`second`,`JsonSerialize`,`sequence or record`,r);return Xd(e,n),e.writeFile?.(n,Vd(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`ndJsonSerialize`,2,t=>{let n=Kd(z(t,0,`ndJsonSerialize`)),r=z(t,1,`ndJsonSerialize`),i=Bi(r);if(!i)throw ss(`second`,`ndJsonSerialize`,`sequence`,r);return Xd(e,n),e.writeFile?.(n,Ud(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Ts(ms(`JsonDeserialize`,1,t=>Gd(kd(Zd(e,Kd(z(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Ts(ms(`ndJsonDeserialize`,1,t=>li(Zd(e,Kd(z(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Gd(kd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],$d=(e,t)=>[Ts(js(`Serialize`,3,(n,r)=>{let i=Ms(n,2,`Serialize`)(),a=Nd(i);if(!a)throw ss(`third`,`ndJsonSerialize`,`sequence`,i);if(qd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ms(n,0,`Serialize`)(),s=Bi(o);if(!s)throw ss(`first`,`Serialize`,`sequence`,o);let c=Ms(n,1,`Serialize`)();if(typeof c!=`string`)throw ss(`second`,`ndJsonSerialize`,`sequence`,c);let l=ca(a,`openOptions`);if(Ss(l)!==`TupleValue`)throw Pd(l,`TupleValue`);let u=qd(a,`charset`),d=L(l).range.map(e=>{if(typeof e!=`string`)throw Pd(e,`StringValue`);return e});return Jd(u),Yd(e,c,d,Ud(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],ef={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},tf=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=er(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(ef.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(ef.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(ef.boolean),o(+!!e);return}if(typeof e==`number`){o(ef.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(ef.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(ef.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),P(e)){let t=I(e).elements;o(ef.set),c(t.length),t.forEach(f);return}let p=L(e),m=or(e);m===`tuple`?(o(ef.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(ef.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(ef.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ae(Uint8Array.from(t))},nf=e=>[Ts(ms(`_TLCTraceSerialize`,2,t=>{let n=Kd(z(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,tf(z(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],rf=25214903917n,af=(1n<<48n)-1n,of=e=>{let t=(BigInt.asUintN(64,e)^rf)&af,n=e=>(t=t*rf+11n&af,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^rf)&af},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},sf=[],cf=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},lf=()=>{for(let e=1277011;sf.length<1341;e++)cf(e)&&sf.push(e);return sf},uf=e=>{let t=lf(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},df=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},ff=e=>{for(let t=Math.max(e,9);;t++){let e=df(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},pf=(e,t,n)=>{if(t<=0)return[];let r=ff(t),i=BigInt(n.nextInt(t)),a=BigInt(uf(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},mf=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$t),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},hf=(1n<<63n)-1n-24n,gf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(hf*BigInt(n)+i)%t;return r<0n?r+t:r})},_f=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,vf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=si(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>rr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>ui(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:li}}},yf=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,bf=(e,t,n,r)=>{if(Mi(t))return[];let i=r===`1.7.4`?mf:pf;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=yf(t,r)?void 0:vf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?gf(e,t,n):i(e,Number(t),n)).map(e=>a.create(_f(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},xf=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...cs(e.domain,`RandomElement`,e).elements];return rr(n,n.map(()=>xf(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return ui(e.names.map((n,r)=>[n,xf(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return li(e.factors.map(e=>xf(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new y(`Attempted to retrieve out-of-bounds element from the interval value ${R(e)}.`);return e.low+r}let n=cs(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new y(`Index ${r} out of bounds for length ${n.length}`);return n[r]},Sf=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ss(t,n,`nonnegative integer`,e);return e},Cf=(e,t,n,r)=>Kr(Array.from({length:t},()=>Kr(e.filter(()=>r.nextDouble()<n)))),wf=(e,t)=>{let n=`RandomSetOfSubsets`,r=Sf(z(e,0,n),`first`,n),i=Sf(z(e,1,n),`second`,n),a=z(e,2,n);if(!P(a)||!F(a))throw ss(`third`,n,`finite set`,a);let o=I(a).elements;if(o.length<31&&r>2**o.length)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ss(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Cf(o,r,o.length===0?0:i/o.length,t.getRandom())},Tf=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,Ef=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Df=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Tf.test(t))return Number(t.replace(/[fFdD]$/,``));let n=Ef.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Of=e=>B(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Sf(z(t,0,n),`first`,n),i=z(t,1,n);if(typeof i!=`string`)throw ss(`second`,n,`string literal representing a probability`,i);let a=Df(i);if(a===void 0||a<0||a>1)throw ss(`second`,n,`string literal does not represent a parsable probability`,i);let o=z(t,2,n);if(!P(o)||Un(o)||!Li(o))throw ss(`third`,n,`finite set`,o);let s=Fi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ss(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Cf(I(o).elements,r,a,e.getRandom())}),kf=e=>[Ts(B(`RandomSubset`,2,t=>{let n=Sf(z(t,0,`RandomSubset`),`first`,`RandomSubset`),r=z(t,1,`RandomSubset`);if(!fi(r)||!Li(r))throw ss(`second`,`RandomSubset`,`a finite set`,r);let i=yf(r,e.version);if(i&&i.reduce((e,t)=>e*I(t).elements.length,1)>rn())throw new y(an());return Kr(bf(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),B(`RandomSetOfSubsets`,3,t=>wf(t,e)),B(`TestRandomSetOfSubsets`,3,t=>li(Array.from({length:5},()=>I(wf(t,e)).elements.length)))],Af=(e,t=0n)=>{let n=of(t),r=of(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>ui([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:bo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},jf=e=>Qr([...e.possibleCounts].map(([e,t])=>[e,t])),Mf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,jf(e)]]),Nf=e=>ui([[`name`,e??`UnnamedAction`],[`location`,ui([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Pf=/* @__PURE__ */ new WeakSet,Ff=(e,t)=>{let n=ui([[`action`,Kr(e)],[`state`,Kr(t)]]);return Pf.add(n),n},If=(e,t,n)=>{let r=e.map((e,t)=>li([t+1,ui(Object.entries(e))])),i=r.slice(1).map((e,n)=>li([r[n],t[n],e])),a=n?[li([r[r.length-1],n.action,r[n.start]])]:[];return Ff([...i,...a],r)},Lf=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Mf(e).get(t)},Rf=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0||!e.pause)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),R(r));else throw new x(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(n)}`)},zf=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:U(e),Bf=e=>e.every(e=>e!==void 0),Vf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>Vf(e,t,n)),o=i?pg(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Vf(o.body,t,n))),Math.max(0,...a)},Hf=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[js(`AssertError`,2,e=>{let t=ds(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new y(`In computing AssertError, a non-string expression (${zf(t)}) was used as the err of an AssertError(err, exp).`);let r=Ms(e,0,`AssertError`)();try{Ms(e,1,`AssertError`)()}catch(e){if(e instanceof y)return It(e.message,n.isTool)===r;throw e}return!1}),ms(`TLCGetOrDefault`,2,e=>Lf(n,z(e,0,`TLCGetOrDefault`))??z(e,1,`TLCGetOrDefault`)),ms(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Bf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new y(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?li(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return ui(i===void 0?r:[[`_action`,i],...r])})):li([ui([])])}),ms(`CounterExample`,0,()=>n.counterExample??Ff([],[])),B(`ToTrace`,1,e=>{let t=z(e,0,`ToTrace`);if(typeof t!=`object`||!Pf.has(t))throw new x(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(t)}`);let n=I(ca(t,`state`)).elements.map(e=>Bi(e)??[]);return li(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),B(`TLCModelValue`,1,e=>{let t=z(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new x(`The argument of ModelValue should be a string, but instead it is:\n${R(t)}`);return $n(t)}),js(`TLCDefer`,1,(e,t)=>{let r=ds(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),B(`TLCNoOp`,1,e=>z(e,0,`TLCNoOp`)),{...js(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!Bf(a)||i?.next&&n.isSeen(a))return!0;let o=ds(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new y(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Cs(s)}) was used as the condition of an IF.\n${o.expression?zf(o.expression):``}`);if(s||!i?.next||!i.state||!Bf(i.state))return!0;let c=i.state,l=n.getSuccessorAction(c,a),u=t=>e(Tt(n.isTool,St.moduleOverrideStdout,Ct.none,t));for(;;){u(`Extend behavior of length ${n.getLevel(c)} with a "${l?.name}" step [<Action ${l?.location.range&&m(l.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new ne;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)u(`${Wa(n.toRecord(c)).trimEnd()}\n~>\n${Wa(n.toRecord(a)).trimEnd()}`);else if(e[0]===`d`)u(Wa(n.toRecord(a),n.toRecord(c)));else if(e[0]===`e`){if(n.getSimulationValue===void 0)throw new t(`tla-ts can't mark a state explored while it checks a model.`);u(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},js(`TLCCache`,2,(e,t)=>{let i=ds(e,0,`TLCCache`),o=ka(Ms(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Vf(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),B(`TLCFP`,1,e=>{let t=z(e,0,`TLCFP`),n=ba(t);if(n)throw n;return Number(BigInt.asIntN(32,bo([t])))}),js(`TLCEvalDefinition`,1,(e,t)=>{let n=Ms(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new x(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${R(n)}`);let r=t?pg(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new x(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new x(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?W(r.body,t):W({kind:`Identifier`,name:n,location:r.location},t)})]},Uf=(e,t)=>[ms(`_Track`,2,e=>{let n=String(z(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,z(e,0,`_Track`)===!0?r+1:r),!0}),ms(`_Counts`,0,()=>jf(t)),ms(`_CheckName`,1,n=>{let r=String(z(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(jf(t),!0)),!1)}),ms(`_PrintCounts`,0,()=>(e(R(jf(t),!0)),!0))],Wf=e=>`${e.getUTCFullYear()}.${Lt(e.getUTCMonth()+1)}.${Lt(e.getUTCDate())}.${Lt(e.getUTCHours())}${Lt(e.getUTCMinutes())}${Lt(e.getUTCSeconds())}`,Gf=e=>Qr([...e].map(([e,t])=>[e,li([t])])),Kf=e=>ar($r(e),`record`),qf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Jf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Yf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Xf=(e,t,n)=>{if(e.version===`1.7.4`?!Jf.has(t)||!e.isStarted&&Yf.has(t):!e.isStarted&&qf.has(t))throw new x(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Kf([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Kf([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,qa()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Kf([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Bn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Bn(Wf(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Nf(void 0);case`all`:return Gf(e.registers);case`all:named`:return Gf(Mf(e))}if(t.startsWith(`s:`)){let n=Mf(e).get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Bn(e.properties.get(t.slice(2))??t);throw new x(`TLCGet(${t}) was undefined.`)},Zf=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new x(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new x(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(t)}`);return Xf(e,t,n?.state)},Qf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Qf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),$f=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach($f),e.kind===`Function`&&e.range.forEach($f))},ep=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return L(e);default:return I(e)}},tp=(e,t)=>[B(`Print`,2,t=>(e(Ba([z(t,0,`Print`),z(t,1,`Print`)]).map(N).join(` `)),z(t,1,`Print`))),B(`PrintT`,1,t=>(e(N(Ba([z(t,0,`PrintT`)])[0])),!0)),B(`Assert`,2,e=>{if(z(e,0,`Assert`)!==!0)throw new x(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(R(z(e,1,`Assert`)))}`,S.assertViolation);return!0}),B(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),B(`:>`,2,e=>Qr([[z(e,0,`:>`),z(e,1,`:>`)]])),B(`@@`,2,e=>{let t=z(e,0,`@@`),n=z(e,1,`@@`),r=un(t)?L(t):void 0,i=un(n)?L(n):void 0;if(!r)throw ss(`first`,`@@`,`function`,t);if(!i)throw ss(`second`,`@@`,`function`,n);let a=vn(r),o=vn(i).filter(e=>!a.some(t=>Ur(e[0],t[0])));return $r([...a,...o])}),B(`ToString`,1,e=>Bn(R(z(e,0,`ToString`),!0))),{...js(`TLCEval`,1,(e,t)=>{let n=ep(Ms(e,0,`TLCEval`)());return t===void 0&&$f(n),n}),isStateLevel:!1},B(`Permutations`,1,e=>{let t=cs(z(e,0,`Permutations`),`Permutations`).elements;return Kr(Qf(t).map(e=>Qr(t.map((t,n)=>[t,e[n]]))))}),ps(`SortSeq`,2,e=>{let t=z(e,0,`SortSeq`),n=Bi(t);if(!n)throw ss(`first`,`SortSeq`,`natural number`,t);let r=ds(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ss(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),li(a)}),t.version===`1.7.4`?Ts({...ms(`TLCGet`,1,(e,n)=>Zf(t,z(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ts(js(`TLCGet`,1,(e,n)=>Zf(t,Ms(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ms(`TLCSet`,2,n=>(Rf(t,e,z(n,0,`TLCSet`),z(n,1,`TLCSet`)),!0)),fs(`Any`,qn),B(`RandomElement`,1,e=>xf(z(e,0,`RandomElement`),t.getRandom()))],np=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),rp=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],ip=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),ap=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),op=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),sp=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
140
88
|
Nat == { }
|
|
141
89
|
a+b == {a, b}
|
|
142
90
|
a-b == CHOOSE n : b + n = a
|
|
@@ -452,9 +400,7 @@ _CheckName(name) ==
|
|
|
452
400
|
=> (PrintT(counts) /\\ FALSE)
|
|
453
401
|
_PrintCounts == PrintT(_Counts)
|
|
454
402
|
=============================================================================
|
|
455
|
-
`]]),Sf=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Cf=E(`EOF`),wf=E(`IDENTIFIER`),Tf=E(`DEFBREAK`),Ef=(e,t)=>Array.from({length:E(t)-E(e)+1},(t,n)=>E(e)+n),Df=new Set(Ef(`op_57`,`op_119`)),Of=new Set(Ef(`op_1`,`op_119`)),kf=new Set(Ef(`op_57`,`op_70`)),Af=/* @__PURE__ */ new Set([...Ef(`ACTION`,`EXCEPT`),E(`EXTENDS`),...Ef(`IF`,`SF`),E(`STATE`),...Ef(`THEN`,`WITH`),E(`US`),...Ef(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),jf=new Map([...U(`postfix`,160,160,!0,`[`),...U(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...U(`prefix`,120,120,!1,`-.`),...U(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...U(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...U(`prefix`,40,40,!0,`\\lnot`),...U(`nfix`,100,130,!0,`\\times`),...U(`infix`,140,140,!1,`^`,`^^`),...U(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...U(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...U(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...U(`infix`,100,110,!0,`|`,`||`,`%%`),...U(`infix`,100,110,!1,`%`),...U(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...U(`infix`,90,140,!1,`\\wr`),...U(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...U(`infix`,90,130,!1,`!!`),...U(`infix`,90,90,!1,`...`,`..`),...U(`infix`,80,80,!0,`\\intersect`,`\\union`),...U(`infix`,80,80,!1,`\\`),...U(`infix`,70,70,!1,`<:`,`:>`),...U(`infix`,60,60,!0,`@@`),...U(`infix`,50,140,!0,`\\cdot`),...U(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...U(`infix`,30,30,!0,`\\land`,`\\lor`),...U(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...U(`infix`,10,10,!1,`=>`)]),Mf=new Map([...jf,...gf.flatMap(e=>e.slice(1).map(t=>[t,jf.get(e[0])]))]),Nf=Mf.get(`[`),Pf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Ff=e=>({type:`tokens`,kinds:new Set(e)}),If=e=>typeof e==`string`?e.startsWith(`<`)?Ff([E(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(If)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),Lf=e=>(...t)=>({type:e,body:W(...t)}),K=Lf(`zeroOrMore`),Rf=Lf(`oneOrMore`),q=Lf(`optional`),J=e=>({type:`action`,run:t=>e(t)??void 0}),Y=e=>J(t=>{t.expecting=e}),X=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&W(...e.expansion),semantic:e.semantic}),zf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Bf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=zf(e,n);return n},Vf=(...e)=>{let t=e.map(E);return e=>t.includes(Bf(e,1).kind)},Hf=(e,t=Bf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Uf=e=>{let t=Bf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Wf=e=>Vf(`CASESEP`)(e)&&Hf(e),Gf=e=>{let t=Bf(e,1);Af.has(t.kind)&&(t.kind=wf)},Kf=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,qf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Jf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Yf=e=>e.operatorStacks[e.operatorStacks.length-1],Xf=(e,t)=>e.low>t.high,Zf=(e,t)=>e.high<t.low,Qf=e=>e.fix===`prefix`?e:Mf.get(`${e.name}.`),$f=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Nf?qf(`FcnAppl`,[n,...r.node.heirs]):qf(`PostfixExpr`,[n,r.node]),operator:void 0})},ep=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:qf(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:qf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},tp=e=>{let t=Yf(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return $f(t,n),tp(e);if(i.operator!==void 0){let t=Qf(r.operator);return t!==void 0&&Xf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Kf(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Kf(e,a.node.first,a.node.last)} and expression at location ${Kf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Zf(a.operator,r.operator)?void 0:Xf(a.operator,r.operator)?(ep(t,a.operator),tp(e)):`Precedence conflict between ops ${a.operator.name} in block ${Kf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Qf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Zf(s,r.operator))return;if(!Xf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Kf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return ep(t,s),tp(e);let c=Kf(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===Pf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},np=e=>J(t=>{let n=Yf(t),r=Jf(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:tp(t)}),rp=np(()=>!1),ip=np(()=>!0),ap=J(e=>{e.lastOperator=Mf.get(e.token.image)}),op=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},sp=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?op(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},cp=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Hf(e,n.first.beginColumn))return n;let t=cp(e,n);if(t!==void 0)return t}},lp=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(E),n=(e,...t)=>t.some(t=>e.kind===E(t)),r=e=>e!==void 0&&Df.has(e.kind),i=e.token,a=zf(e,i);i.next=void 0;let o=zf(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===wf&&(e=e.next)}else if(e.kind===wf){let t=e.next;!r(t)||kf.has(t.kind)||Of.has(t.kind)&&t.next?.kind!==wf||(e=t.next?.kind===E(`SUBSTITUTE`)?i:Of.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Tf&&(e.next={kind:Tf,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=zf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},up=e=>{let t=Bf(e,1);if(t.kind===E(`LAB`)){let n=1;for(;n!==0;)if(t=zf(e,t),t.kind===E(`LAB`)&&n++,t.kind===E(`RAB`)&&n--,t.kind===Cf)return!1;return zf(e,t).kind===E(`IN`)}if(t.kind!==wf)return!1;for(t=zf(e,t);t.kind===E(`COMMA`);){if(t=zf(e,t),t.kind!==wf)return!1;t=zf(e,t)}return t.kind===E(`IN`)},dp=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),fp=e=>e.proofLevels.at(-1)??-1,pp=e=>{let t=Bf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Vf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||fp(e)>=0&&dp(t)>fp(e):Vf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},mp=(e,t)=>{let n=dp(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},hp=e=>J(t=>mp(t,t.token)?void 0:`${Kf(t,t.token)}: ${e}`),gp=Ff([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(E)),_p=Ff([...gp.kinds,E(`op_76`)]),vp=Ff(Of),yp=Ff(kf),bp=Ff([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(E)),xp=()=>K(X({expansion:[G(gp,`<op_77>`)],semantic:Hf}),G(`PrefixOp`,`InfixOp`),ip),Sp=()=>G(W(X({expansion:[`OpenStart`],semantic:Hf}),`OpenExpression`,rp),W(X({semantic:Hf}),`ExtendableExpr`)),Cp=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),wp=()=>G(W(X({semantic:e=>Vf(`ASSUME`,`BOXASSUME`)(e)||Bf(e,2).kind===E(`COLONCOLON`)&&[E(`ASSUME`),E(`BOXASSUME`)].includes(Bf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Tp=()=>[`JuncItem`,K(X({semantic:Uf}),`JuncItem`)],Ep=e=>J(t=>{t.expecting=e,Gf(t)}),Dp=e=>J(t=>{t.isTerminalProof=e}),Op=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{lp(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),kp={CompilationUnit:Z(void 0,[J(lp),q(`Prelude`),`Module`]),Prelude:Z(void 0,[`<BEGIN_PRAGMA>`,K(G(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Z(`Module definition`,[Y(`---- MODULE`),`BeginModule`,Y(`EXTENDS clause or module body`),`Extends`,Y(`Module body`),`Body`,Y(`==== or more Module body`),`EndModule`]),BeginModule:Z(`Begin module`,[Y(`---- MODULE (beginning of module)`),G(`<_BM0>`,`<_BM1>`,`<_BM2>`),Ep(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,Ep(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Ep(`Identifier`),`Identifier`))]),Body:Z(`Module body`,[Y(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),K(G(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,W(X({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,W(X({amount:2}),`Instance`),W(X({amount:2}),`Assumption`),W(X({amount:2}),`Theorem`),W(X({amount:1}),`Module`,J(lp)),W(X({semantic:e=>Vf(`USE`)(e)&&Bf(e,2).kind!==E(`ONLY`)||Vf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(Op(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Op(`Expression`,X({expansion:[`<IDENTIFIER>`,yp]}),`PostfixLHS`,`Expression`),Op(`Expression`,X({expansion:[`<IDENTIFIER>`,vp]}),`InfixLHS`,`Expression`),Op(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),Op(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[_p,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,vp,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,yp]),IdentDecl:Z(`Identifier Declation`,[`Identifier`,Y(`( or ...`),q(`<LBR>`,Y(`_`),`<US>`,Y(`COMMA or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Z(`Op. Symbol Declaration`,[G(W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`infix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),Instance:Z(`Instance`,[Y(`LOCAL or instance`),q(`<LOCAL>`),`Instantiation`,Y(`COMMA or Module Body`)]),Instantiation:Z(`NonLocalInstance`,[`<INSTANCE>`,Ep(`Module identifier`),`Identifier`,Y(`WITH or another definition.`),q(`<WITH>`,Y(``),`Substitution`,Y(``),K(X({amount:3}),`<COMMA>`,Y(``),`Substitution`,Y(``)))]),Substitution:Z(`Substitution`,[G(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),Y(`<-`),`<SUBSTITUTE>`,Y(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Z(void 0,[gp,ap]),NonExpPrefixOp:Z(void 0,[_p,ap]),InfixOp:Z(`Infix Op`,[vp,ap]),PostfixOp:Z(void 0,[yp,ap]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{lp(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),wp(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),wp(),Y("PROVE or `,'")),G(`<PROVE>`,`<BOXPROVE>`),Y(`Expression`),`Expression`))]),NewSymb:Z(`NEW symbol declaration`,[Y(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),G(W(X({amount:2}),G(W(X({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),Y(`Constant declaration`),G(W(X({amount:2}),`IdentDecl`,q(`<IN>`,J(e=>{let t=Jf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Kf(e,t.first,t.last)}`:void 0}),Y(`Expression`),`Expression`)),`SomeFixDecl`)),W(X({amount:2}),q(`<NEW>`),`<VARIABLE>`,Y(`Identifier`),`Identifier`),W(X({amount:2}),q(`<NEW>`),G(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),Y(`Declaration`),G(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Z(`Domain binding`,[q(`<IN>`,Y(`Expression`),`Expression`)]),Theorem:Z(`Theorem`,[Y(`THEOREM, PROPOSITION`),G(`<THEOREM>`,`<PROPOSITION>`),Y(`Identifier, Assume-Prove or Expression`),q(X({amount:2}),`Identifier`,Y(`==`),`<DEF>`),J(lp),G(W(X({amount:3}),X({semantic:Vf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:pp}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Vf(`BY`)(e)||Bf(e,2).kind===E(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>Bf(e,2).kind!==E(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,Dp(!0),q(`<ONLY>`)),W(`<USE>`,Dp(!1),q(`<ONLY>`)),W(`<HIDE>`,Dp(!1))),Y("an expression, `MODULE' or `DEF'"),q(Cp(),K(`<COMMA>`,Y(`MODULE or expression`),Cp(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),Cp(),K(`<COMMA>`,Y(`MODULE or expression`),Cp(),J(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),J(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Z(`QED step`,[Y(`Step number`),bp,hp(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:pp}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),bp,hp(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:Vf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:Vf(`INSTANCE`)}),`Instantiation`),W(X({semantic:Vf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:pp}),J(e=>{let t=Jf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Kf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),Rf(X({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Z(`HaveStep`,[`<HAVE>`,Y(`expression`),`Expression`]),TakeStep:Z(`TakeStep`,[`<TAKE>`,Y(`identifier`),G(W(X({expansion:[G(W(`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,Y(`comma or step`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or proof step`))),W(`Identifier`,Y(`comma or proof step`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or proof step`))))]),WitnessStep:Z(`WitnessStep`,[`<WITNESS>`,Y(`expression`),`Expression`,K(`<COMMA>`,Y(`expression`),`Expression`,Y(`comma or colon`))]),PickStep:Z(`PickStep`,[`<PICK>`,Y(`identifier`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,Y(`comma, or colon`),K(`<COMMA>`,Y(`identifier`),`Identifier`,Y(`comma or colon`))),W(`QuantBound`,Y(`comma or colon`),K(`<COMMA>`,Y(`identifier or tuple of identifiers`),`QuantBound`,Y(`comma or colon`)))),`<COLON>`,Y(`expression`),`Expression`]),CaseStep:Z(`CaseStep`,[`<CASE>`,Y(`expression`),`Expression`]),AssertStep:Z(`AssertStep`,[q(`<SUFFICES>`,Y(`expression or ASSUME/PROVE`)),G(`Expression`,W(X({semantic:Vf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Z(void 0,[G(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Z(void 0,[G(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Z(`String`,[`<STRING_LITERAL>`]),Number:Z(void 0,[`<NUMBER_LITERAL>`,q(X({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Z(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,K(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Z(void 0,[G(W(X({amount:2,expansion:[G(_p,vp,yp),Ff([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(E))],semantic:Hf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Kf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Hf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Z(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Z(`Quantified form`,[G(`<EXISTS>`,`<FORALL>`),G(W(X({expansion:[`<IDENTIFIER>`,K(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,K(`<COMMA>`,`Identifier`)),W(`QuantBound`,K(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Z(`Bound Quantified Expression`,[G(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,K(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Z(`Quant Bound`,[G(`IdentifierTuple`,W(`Identifier`,K(`<COMMA>`,`Identifier`,Y(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Z(`Some { } form`,[`<LBC>`,q(G(W(X({semantic:up}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),Rf(`<COMMA>`,`Expression`)))),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,K(`<COMMA>`,`Expression`)),W(X({expansion:[G(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,K(`<COMMA>`,`QuantBound`)),W(`Expression`,q(G(W(`<COLON>`,J(e=>{let t=Jf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,K(`<COMMA>`,`QuantBound`)),Rf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:up}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>Bf(e,2).kind===E(`MAPTO`)&&Af.has(Bf(e,1).kind)}),J(e=>{Bf(e,1).kind=wf}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,K(`<COMMA>`,`FieldSet`),`<RSB>`),W(`Expression`,G(W(K(`<COMMA>`,`Expression`),`<RSB>`,J(e=>{let t=e.frames[e.frames.length-1];t.node=qf(`FcnAppl`,t.heirs),e.lastOperator=Nf})),W(`<ARROW>`,`Expression`,`<RSB>`),W(`<EXCEPT>`,`ExceptSpec`,K(`<COMMA>`,`ExceptSpec`),`<RSB>`),W(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Z(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Z(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Z(`Except Spec`,[`<BANG>`,Rf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Gf),`Identifier`),W(`<LSB>`,`Expression`,K(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Z(`Some << -- >> or >>_ Form`,[`<LAB>`,q(`Expression`,K(`<COMMA>`,`Expression`)),G(`<RAB>`,W(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Z(void 0,[`Identifier`,q(X({amount:2}),`OpArgs`),G(W(`<BANG>`,`NoOpExtension`),J(e=>{e.isFairnessHooked=e.token.kind===E(`RBR`)}))]),ReducedExpression:Z(`restricted form of expression`,[G(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Z(`Fairness Expression`,[J(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),G(`<WF>`,`<SF>`),`ReducedExpression`,q(X({amount:2}),`<LBR>`,`Expression`,`<RBR>`,J(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Z(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Z(`CASE Expression`,[`<CASE>`,`CaseArm`,K(X({semantic:e=>Wf(e)&&Bf(e,2).kind!==E(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Wf}),`<CASESEP>`,`OtherArm`)]),CaseArm:Z(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Z(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Z(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Z(`Let Definitions`,[Rf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=Bf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...Tp()),W(X({expansion:[`<AND>`]}),...Tp())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=cp(t,e.heirs[1]);return n&&`Item at ${Kf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Kf(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Z(`(Un)Bounded Choose`,[`<CHOOSE>`,G(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Z(`Lambda`,[`<LAMBDA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'"),K(`<COMMA>`,Y(`Identifier`),`Identifier`,Y("`,' or `:'")),`<COLON>`,Y(`Expression`),`Expression`]),Expression:Z(`Expression`,[J(e=>{e.operatorStacks.push([])}),xp(),Sp()],(e,t)=>{let n=Yf(t);n.push({node:e.heirs[0],operator:Pf});let r=tp(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Z(`ExtendableExpr`,[G(W(X({expansion:[G(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),rp,K(G(W(X({expansion:[`PostfixOp`],semantic:Hf}),`PostfixOp`,ip),W(X({expansion:[`<DOT>`],semantic:Hf}),`<DOT>`,J(Gf),X({semantic:Hf}),`Identifier`,J(e=>{let t=Yf(e);t[t.length-1].operator!==void 0&&$f(t,t.length),t[t.length-1]={node:qf(`RecordComponent`,[t[t.length-1].node,Jf(e,2),Jf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Hf}),Y(`function argument`),`SBracketCases`,np(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Hf}),`InfixOp`,ip,xp(),Sp()),W(X({expansion:[`<COLONCOLON>`],semantic:Hf}),`<COLONCOLON>`,J(e=>{let t=Yf(e);if(!sp(t[t.length-1].node))return`\`::' at ${Kf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Yf(e),n=Jf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Zf(r,e.lastOperator)){let t=Jf(e,3);return`Removing label at ${Kf(e,t.first,t.last)} would change expression parsing.`}t.push({node:qf(`Label`,[Jf(e,3),Jf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Hf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Hf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>fp(e)<0&&e.proofLevels.length<=1?`${Kf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Kf(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,W(X({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),q(X({amount:2}),`OpArgs`),K(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:op(e.heirs)===void 0?e.heirs.length===1?qf(`GeneralId`,e.heirs):void 0:qf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>Bf(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),q(X({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Z(`StructOp`,[Y("`<<' , `>>' , `:' , `@' , or number"),G(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,W(X({semantic:e=>Bf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Kf(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Ap=/* @__PURE__ */ new Map,jp=e=>{let t=Ap.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=jp(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,jp(kp[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return Ap.set(e,n),n},Mp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Np=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=zf(e,e.scanPosition)),e.scanPosition=zf(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},Pp=(e,t)=>{if(t.type===`tokens`)return Np(e,t.kinds);if(t.type===`call`)return Pp(e,kp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Mp(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=Pp(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||Mp(e,t.semantic)?Pp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Pp(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=Pp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Fp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Pp(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},Ip=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||jp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!jp(a).hasSemanticStart?jp(a).first.has(Bf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Fp(e,i,a)&&(o===void 0||o(e))}),Lp=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,Pp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=zf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Cf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=zf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ke(e.token.image)}" `},Rp=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??Lp(e)}\n\nResidual stack trace follows:\n${r}`,!1},zp=(e,t)=>{let n=zf(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,Rp(e))},Bp=(e,t)=>{let n=kp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Bf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Vp(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return Rp(e,i);let a=r.node??(r.heirs.length===0?void 0:qf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Vp=(e,t)=>{if(t.type===`tokens`)return zp(e,t.kinds);if(t.type===`call`)return Bp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Rp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Rp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Vp(e,t));if(t.type===`choice`){let n=Ip(e,t.alternatives);return n===-1?Rp(e):Vp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Vp(e,t.body))return!1;if(t.type===`optional`)return Ip(e,[t.body])===-1||Vp(e,t.body);for(;Ip(e,[t.body])===0;)if(!Vp(e,t.body))return!1;return!0},Hp=e=>{let t=We(e),n={kind:Cf,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Vp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},Up={low:15,high:15},Wp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Gp=new Map([[`=>`,Q(1,1,!1)],[`<=>`,Q(2,2,!1)],[`~>`,Q(2,2,!1)],[`-+->`,Q(2,2,!1)],[`/\\`,Q(3,3,!0)],[`\\/`,Q(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,Q(5,5,!1)]),[`\\cdot`,Q(5,14,!0)],[`@@`,Q(6,6,!0)],[`:>`,Q(7,7,!1)],[`<:`,Q(7,7,!1)],[`\\cup`,Q(8,8,!0)],[`\\cap`,Q(8,8,!0)],[`\\`,Q(8,8,!1)],[`..`,Q(9,9,!1)],[`...`,Q(9,9,!1)],[`##`,Q(9,13,!0)],[`$`,Q(9,13,!0)],[`$$`,Q(9,13,!0)],[`??`,Q(9,13,!0)],[`!!`,Q(9,13,!1)],[`\\sqcap`,Q(9,13,!0)],[`\\sqcup`,Q(9,13,!0)],[`\\uplus`,Q(9,13,!0)],[`\\wr`,Q(9,14,!1)],[`+`,Q(10,10,!0)],[`++`,Q(10,10,!0)],[`(+)`,Q(10,10,!0)],[`\\oplus`,Q(10,10,!0)],[`%`,Q(10,11,!1)],[`%%`,Q(10,11,!0)],[`|`,Q(10,11,!0)],[`||`,Q(10,11,!0)],[`\\X`,Q(10,13,!1)],[`-`,Q(11,11,!0)],[`--`,Q(11,11,!0)],[`(-)`,Q(11,11,!0)],[`\\ominus`,Q(11,11,!0)],[`*`,Q(13,13,!0)],[`**`,Q(13,13,!0)],[`/`,Q(13,13,!1)],[`//`,Q(13,13,!1)],[`\\div`,Q(13,13,!1)],[`\\o`,Q(13,13,!0)],[`(.)`,Q(13,13,!0)],[`\\odot`,Q(13,13,!0)],[`(/)`,Q(13,13,!1)],[`\\oslash`,Q(13,13,!1)],[`(\\X)`,Q(13,13,!0)],[`\\otimes`,Q(13,13,!0)],[`&`,Q(13,13,!0)],[`&&`,Q(13,13,!0)],[`\\star`,Q(13,13,!0)],[`\\bullet`,Q(13,13,!0)],[`\\bigcirc`,Q(13,13,!0)],[`^`,Q(14,14,!1)],[`^^`,Q(14,14,!1)]]),Kp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),qp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Jp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Yp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Xp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Zp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Kp]),Qp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),$p=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),em=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),tm=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),nm=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),rm=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),im=/* @__PURE__ */ new Set([``,`*`,`-`]),am=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),om=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),sm=/* @__PURE__ */ new Set([`NEW`,...om.keys()]),cm=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),lm=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),um=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),dm=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Gp.has(e.operator):Kp.has(e.operator)),fm=e=>Gp.has(e)||Kp.has(e)||e===`-.`,pm=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},mm=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
456
|
-
`)}\n`},hm=(e,t,n=xe(e))=>{let r=t===`tlapm`,i=r?n:n.map(_e),o={index:0,offsideColumns:[]},s={},c=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>c[c.length-1].has(e),m=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),h=[],ee=[],g=[],_=(e,t=o.index-1)=>{let n=e===t?g[e]:void 0;if(n)return n;let r=i[t];h[e]??=m(i[e]),ee[t]??={line:r.line,column:r.endColumn};let a={module:f[0].name,start:h[e],end:ee[t]};return e===t&&(g[e]=a),a},v=(e,t)=>(e.location.range=_(t),e),te=(e=0)=>i[Math.min(o.index+e,i.length-1)],y=(e=0)=>{let t=te(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),re={index:0},ie=e=>{let t=i.slice(re.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ae=e=>r&&(e.kind===`Keyword`||um.has(e.text)),oe=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},se=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:rm.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ae(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,le=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column;return new l(`${e} at line ${t.line}, column ${t.column}`,void 0,ue(e,t,a,n))},ue=(e,t,n,a)=>{if(r&&n){let e=i[i.length-1];return{reason:`Unexpected EOF`,...ie(oe(e)),isEnd:n}}return r&&a?{reason:`Unexpected ${se(a)}`,...oe(a),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=te())=>le(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ae(e),x=(e,t=0)=>{let n=y(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},S=()=>{let e=y();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o.index++,e},C=e=>x(e)?(o.index++,!0):!1,w=e=>{if(!x(e))throw de(`Expected ${JSON.stringify(e)} but found ${ne(y())}`);return S()},pe=()=>{let e=y();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ne(e)}`);if(ae(e))throw de(`Unexpected keyword ${e.text}`);return o.index++,e.text},me=()=>{let e=o.index;return{name:pe(),range:_(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=y();return e.kind!==`String`&&(Jp.has(e.text)||Gp.has(e.text)||Kp.has(e.text)||e.text===`'`)?(o.index++,e.text):pe()},ve={isUsed:!1},ye=()=>y().kind===`Identifier`||!fe(y())?pe():(ve.isUsed=!0,S().text),be=e=>{if(!r)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;C(t);)n.push(e());return n},Se=()=>{if(x(`<<`)){let e={value:1};for(;y(e.value).kind===`Identifier`||x(`,`,e.value);)e.value++;return x(`>>`,e.value)&&x(`\\in`,e.value+1)}let e={value:0};for(;y(e.value).kind===`Identifier`;){if(x(`\\in`,e.value+1))return!0;if(!x(`,`,e.value+1))return!1;e.value+=2}return!1},Ce=()=>{if(x(`::`))return!0;if(!x(`(`))return!1;let e={value:1};for(;y(e.value).kind===`Identifier`&&x(`,`,e.value+1);)e.value+=2;return y(e.value).kind===`Identifier`&&x(`)`,e.value+1)&&x(`::`,e.value+2)},we=()=>{if(!C(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(T(me));return w(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},E=()=>T(()=>{let e=T(we);w(`\\in`);let t=D();return e.map(e=>({pattern:e,set:t}))}).flat(),Te=()=>{let e=y();if(e.kind===`Identifier`){let t=o.index,n=[S().text];for(;x(`!`)&&y(1).kind===`Identifier`;)S(),n.push(pe());return v({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(x(`<<`)||x(`(`))return Be();throw de(`Expected a subscript but found ${ne(e)}`)},Ee=e=>{let t=y(1),n=y(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&x(`==`,Kp.has(n.text)?3:4))},De=e=>{let t=y(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||x(`,`,1)||x(`)`,1)||t.kind===`Keyword`&&$p.has(t.text)||Ee(e)},Oe=()=>{let e=y(),t=e.kind===`Operator`&&(Gp.has(e.text)||qp.has(e.text))&&De(e);if(r&&e.kind!==`String`&&(qp.has(e.text)||Zp.has(e.text)&&e.text!==`'`&&!Kp.has(e.text)||Xp.has(e.text)&&y(-1).text===`(`&&y(-1).line===e.line&&y(-1).endColumn+1===e.column&&y(1).text===`)`&&y(1).line===e.line&&y(1).column===e.endColumn+1)&&De(e))throw le(`incomplete expression`,e);if(t)return o.index++,v({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&Zp.has(e.text)&&De(e)){o.index++;let t=m(e);if(Kp.has(e.text))return v({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return v({kind:`Lambda`,params:[n.name],body:pm(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(x(`LAMBDA`)){let t=o.index;S();let n=he(T(me));w(`:`);let r=D();return v({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return D()},ke={range:void 0},Ae=()=>be(()=>{let e=o.index;w(`(`);let t=T(Oe);return w(`)`),ke.range=_(e),t}),je=()=>{let e=S();o.offsideColumns.push(e.column);let t=[D()];for(;te().text===e.text&&te().column===e.column;)o.index++,t.push(D());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},Me=e=>be(()=>{let t=m(e),n=y().kind===`Identifier`,i=x(`|->`,1)&&(n||fe(y()));if(i||n&&x(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=o.index,n=m(y()),r=e();return n.range=_(t),w(i?`|->`:`:`),{name:r,value:D(),location:n}},a=[r(()=>n?pe():S().text),...C(`,`)?T(()=>r(pe)):[]];return w(`]`),{kind:e,fields:a,location:t}}if(Se()){let e=E();w(`|->`);let n=D();return w(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=D();if(C(`->`)){let e=D();return w(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(C(`EXCEPT`)){let e=T(()=>{w(`!`);let e=[];for(;x(`.`)||x(`[`);)if(C(`.`)){if(!fe(y()))throw de(`Expected a field name but found ${ne(y())}`);e.push({kind:`Field`,name:S().text})}else w(`[`),e.push({kind:`Index`,args:T(()=>D())}),w(`]`);return w(`=`),{path:e,value:D()}});return w(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!r&&!x(`]_`)){let e=[a];for(;C(`,`);)e.push(D());return w(`]`),{kind:`Bracket`,args:e,location:t}}return w(`]_`),{kind:`BoxAction`,action:a,subscript:Te(),location:t}}),Ne=()=>{let e=o.index,t=v(He(),e),n=m(S());return v({kind:`Apply`,operator:`\\in`,args:[t,D()],location:n},e)},Pe=e=>be(()=>{let t=m(e);if(C(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(Se()&&(y(1).text===`\\in`||x(`<<`))){let e=o.index,n=we();w(`\\in`);let r=D();if(C(`:`)){let e=D();return w(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=y().kind===`Identifier`&&x(`\\in`,1)?Ne():D();if(C(`:`)){let e=E();return w(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;C(`,`);)r.push(D());return w(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Fe=e=>{let t=m(e),n=be(()=>x(`>>`)||x(`>>_`)?[]:T(()=>D()));if(C(`>>_`)){if(n.length!==1)throw le(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Te(),location:t}}return w(`>>`),{kind:`Tuple`,elements:n,location:t}},Ie=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&Se()){let e=E();return w(`:`),{kind:n,bounds:e,body:D(),location:t}}let i=he(T(me));return w(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:D(),isTemporal:r,location:t}},Le=e=>{let t=[];do{if(C(`OTHER`))return w(`->`),{kind:`Case`,arms:t,other:D(),location:m(e)};let n=D();w(`->`),t.push({condition:n,body:D()})}while(C(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Re=()=>{let e=y(1);return x(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Qp.has(e.text)||e.kind===`Operator`&&(Gp.has(e.text)||Kp.has(e.text)||qp.has(e.text)))},ze=()=>{let e=S();if(e.kind===`Number`)return{kind:`Operand`,operand:ce(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:Ae()}}return{kind:`Name`,name:e.text,args:x(`(`)?Ae():[]}},Be=e=>{let t=o.index,n=S(),i=m(n);if(r&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(pe);return w(`:`),{kind:`Lambda`,params:e,body:D(),location:i}}if(n.kind===`Number`){if(r&&/^\\[BOH]/.test(n.text))throw le(`incomplete expression`,n);return{kind:`Number`,value:ce(n.text),text:n.text,location:i}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:i};if(n.kind===`String`)return{kind:`String`,value:n.text,location:i};let a=n.kind===`Step`&&it(n);if(a&&tt()<0&&et.length<=1)throw le(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw le(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let c=a?at(n)??n.text:n.text;if(Ce()){let t=he(C(`(`)?T(me):[]);t.names.length>0&&w(`)`),w(`::`);let a=D();if(!r&&e!==void 0&&s.last!==void 0&&dm(a)&&e.high>=s.last.low)throw le(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:c,params:t.names,paramRanges:t.ranges,body:a,location:i}}let l=x(`(`);if(c===`@`&&!l&&!Re())return{kind:`ExceptAt`,location:i};let u=l?Ae():[],d=[l?ke.range:void 0];if(!Re())return l?{kind:`Apply`,operator:c,args:u,argumentsRange:ke.range,location:i}:{kind:`Identifier`,name:c,location:i};let f=[{kind:`Name`,name:c,args:u}],p=[_(t,t)];for(;Re();)S(),p.push(_(o.index,o.index)),ke.range=void 0,f.push(ze()),d.push(ke.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),ee=f.flatMap(e=>`args`in e?e.args:[]),g=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??_(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:i}:ee.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:i}:{kind:`Apply`,operator:h,args:ee,...g.slice(0,-1).some(e=>e>0)&&{argumentCounts:g},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:i}}if(n.kind===`Operator`&&fm(n.text)&&x(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:Ae(),location:i};if(n.kind===`Operator`&&fm(n.text)&&!r)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:i};switch(n.text){case`(`:{let e=be(()=>D());return w(`)`),e}case`[`:return Me(n);case`{`:return Pe(n);case`<<`:return Fe(n);case`@`:return{kind:`ExceptAt`,location:i};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ie(n);case`IF`:{let e=D();w(`THEN`);let t=D();return w(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:D(),location:i}}case`CASE`:return Le(n);case`LET`:{let e=[],t=[];for(c.push(/* @__PURE__ */ new Set);!C(`IN`);){if(r&&x(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`,ie(te()));if(C(`RECURSIVE`)){Ze();continue}let n=Ge(!1);n.kind===`Instance`?t.push(n):e.push(n)}c.pop();let n=D();return t.length===0?{kind:`Let`,definitions:e,body:n,location:i}:{kind:`Let`,definitions:e,instances:t,body:n,location:i}}case`CHOOSE`:{let e=we(),t=C(`\\in`)?D():void 0;return w(`:`),{kind:`Choose`,pattern:e,set:t,body:D(),location:i}}case`WF_`:case`SF_`:{let e=Te(),t=be(()=>{w(`(`);let e=D();return w(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:i}}}throw de(`Unexpected ${ne(n)}`,n)},Ve=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let i=D(n+1),a=y(),o=a.text===`'`||Kp.has(a.text)?Up.high:Gp.get(a.text)?.high;if(!r&&a.kind===`Operator`&&o!==void 0&&o>=t)throw le(`Precedence conflict between ${e.text} and ${a.text}`,a);return i},He=()=>{let e=s.preceding;s.preceding=void 0;let t=y(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return je();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return S(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:return S(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:return S(),{kind:`Always`,expression:Ve(t,4,15),location:n};case`<>`:return S(),{kind:`Eventually`,expression:Ve(t,4,15),location:n};case`ENABLED`:return S(),{kind:`Enabled`,expression:Ve(t,4,15),location:n};case`UNCHANGED`:return S(),{kind:`Unchanged`,expression:Ve(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return S(),{kind:`Apply`,operator:t.text,args:[r?D(9):Ve(t,10,13)],location:n}}return Be(e)},D=(e=0)=>{let t=o.index,n=He(),r={left:n.location.range?n:v(n,t),previous:void 0};for(;;){let n=y();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){S(),s.last=Up,r.left=v({kind:`Prime`,expression:r.left,location:i},t);continue}if(Kp.has(n.text)&&e<=15){S(),s.last=Up,r.left=v({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){S();let e=be(()=>T(()=>D()));be(()=>w(`]`)),s.last=Wp,r.left=v({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&fe(y(1))){S();let e=S().text;r.left=v({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=Gp.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw le(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(S(),a.low>12&&x(`-`))throw le(`Precedence conflict between ${n.text} and -`,y());s.last=s.preceding=a;let c=D(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[_(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=v(r.left,t),r.previous={...a,text:n.text}}return r.left},Ue=()=>{if(!C(`(`))return[];let e=Xe();return w(`)`),e},We=()=>{let e=m(y()),t=D(),n=i[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},Ge=e=>{let t=o.index;return v(qe(e),t)},Ke=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),qe=e=>{let t=y(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...We(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&y(1).kind===`Operator`&&Gp.has(y(1).text)&&y(2).kind===`Identifier`&&x(`==`,3)){let e=me(),t=S().text,n=me();return w(`==`),r(t,[Ke(e),Ke(n)])}let i=t.kind!==`String`&&Jp.has(t.text),a=t.kind===`Identifier`&&Kp.has(y(1).text)&&x(`==`,2);if(i||a){let e=i?t.text:y(1).text;i&&S();let n=me();return a&&S(),w(`==`),r(e,[Ke(n)])}let s=pe();if(C(`[`)){let t=be(()=>E());return w(`]`),w(`==`),{kind:`Function`,name:s,bounds:t,body:D(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=Ue();return w(`==`),x(`INSTANCE`)?{...Je(s,l,e,n),definitionRange:_(c)}:r(s,l)},Je=(e,t,n,r)=>{let i=o.index;return w(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:C(`WITH`)?T(()=>{let e=o.index,t=ge(),n=_(e);return w(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:_(i)}},Ye=()=>{let e=o.index;return v(O(),e)},O=()=>{let e=m(y());if(x(`_`)&&y(1).kind===`Operator`)return S(),{name:S().text,arity:C(`_`)?2:1,location:e};if(y().kind===`Operator`&&x(`_`,1)){let t=S().text;return S(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!C(`(`))return{name:t,arity:0,location:e};let n=T(()=>w(`_`));return w(`)`),{name:t,arity:n.length,location:e}},Xe=()=>T(Ye),Ze=()=>{let e=Xe();return e.forEach(e=>c[c.length-1].add(e.name)),e},Qe=e=>{let t={value:0,offset:e};do{let e=y(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&cm.has(e.text)&&t.value++,e.kind===`Operator`&&lm.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},$e=()=>{let e=y(),t=y(1);return e.kind===`Identifier`?x(`(`,1)||x(`[`,1)?x(`==`,Qe(1)):t.kind===`Operator`&&Kp.has(t.text)?x(`==`,2):t.kind===`Operator`&&Gp.has(t.text)?y(2).kind===`Identifier`&&x(`==`,3):x(`==`,1):e.kind!==`String`&&Jp.has(e.text)&&t.kind===`Identifier`&&x(`==`,2)},et=[],tt=()=>et[et.length-1]??-1,nt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),rt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},it=e=>!e.text.endsWith(`.`)&&!im.has(rt(e)),at=e=>{let t=rt(e);if(im.has(t))return;let n=nt(e);if(n>=0)return`<${n}>${t}`;let r=tt(),i=et[et.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},ot=e=>{if(e.kind===`Keyword`)return tm.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return et.length===0;if(e.text[1]===`+`||et.length===0)return!0;let t=tt();return t>=0&&nt(e)>t},k=e=>{let t=nt(e),n=et.length-1,r=et[n-1]??-1,i=et[n]<0;return i&&(et[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:et[n]===t},st=e=>!u.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),A=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!um.has(e.name)&&!st(e.name):!1,j=()=>{let e=y();return e.kind===`Step`?it(e):e.kind===`Keyword`?am.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!$e()},ct=()=>{let e=o.index,t=y();return t.kind===`Operator`&&!Yp.has(t.text)&&fm(t.text)?(o.index++,v({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):C(`MODULE`)?v({kind:`ModuleFact`,name:pe(),location:m(t)},e):D()},lt=e=>d[d.length-1]?.add(e),ut=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},dt=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ft=()=>{let e=o.index,t=y(),n=T(()=>{let e=y();if((e.kind!==`Identifier`||ae(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ne(e)}`,e);return o.index++,e.text},`!`),r=m(t);return v(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},pt=()=>{if(r)return T(ft);let e=T(ct),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&dt(e.name)):void 0;if(n)throw le(`DEF clause entry should describe a defined operator`,n.location);return e},mt=()=>({facts:j()?T(ct):[],defs:C(`DEF`)||C(`DEFS`)?pt():[]}),ht=()=>{let e=o.index,n=S(),r=n.text===`USE`&&C(`ONLY`),i=_(e),s={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...mt(),keyword:i,location:m(n)},c=s.kind===`Hide`&&t===`tlc`?s.facts.filter(e=>!A(e)):[];if(c.length>0)throw a(c.map(t=>({location:b(t.location.range??_(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
457
|
-
the name of a theorem, assumption, or step.`})));return v(s,e)},gt=()=>{let e=o.index,t=m(y()),n=C(`NEW`),r=y().kind===`Keyword`?om.get(y().text):void 0;if(!n&&r===void 0)throw de(`Expected a declaration but found ${ne(y())}`);if(r!==void 0&&S(),r===`Variable`){let n=me();return lt(n.name),v({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=Ye();lt(i.name);let a=(r??`Constant`)===`Constant`&&x(`\\in`);if(a&&i.arity>0)throw le(`declared symbol with arguments before \\in`);return a&&S(),v({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?D():void 0,nameRange:i.location.range,location:t},e)},_t=()=>{let e=o.index,t=m(w(`ASSUME`)),n=T(()=>x(`ASSUME`)?ut(_t):y().kind===`Keyword`&&sm.has(y().text)?gt():D());return w(`PROVE`),v({kind:`AssumeProve`,assumptions:n,conclusion:D(),location:t},e)},vt=e=>{let t={value:0};for(;y(t.value).kind===`Identifier`&&x(`,`,t.value+1);)t.value+=2;return y(t.value).kind===`Identifier`&&x(e,t.value+1)},yt=(e,t)=>{e.forEach(lt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(lt))},bt=()=>{let e=y();if(x(`USE`)||x(`HIDE`))return ht();if(x(`INSTANCE`)){let t=o.index;return v(Je(void 0,[],!1,m(e)),t)}if(x(`DEFINE`)||$e()){let t=o.index;C(`DEFINE`);let n=[Ge(!1)];for(;$e();)n.push(Ge(!1));let r={kind:`Define`,definitions:n,location:m(e)};return v(r,t)}if(C(`HAVE`))return{kind:`Have`,expression:D()};if(C(`TAKE`)){let e=Se(),t=he(e?[]:T(me)),n=e?E():[];return yt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(C(`WITNESS`))return{kind:`Witness`,expressions:T(()=>D())};if(C(`PICK`)){let e=vt(`:`),t=he(e?T(me):[]),n=e?[]:E();return yt(t.names,n),w(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:D()}}return C(`CASE`)?{kind:`Case`,expression:D()}:{kind:`Assert`,isSuffices:C(`SUFFICES`),statement:x(`ASSUME`)?_t():D()}},xt=e=>{let t=y();if(t.kind!==`Step`)throw de(`Expected a step number but found ${ne(t)}`,t);if(!k(t))throw le(`${e?`QED step`:`step`}'s number has bad level`,t);if(nt(t)<0&&at(t)!==void 0)throw le(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:at(t),token:t.text,location:m(t)}},St=()=>{let e=o.index,t=xt(x(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=C(`QED`)?{kind:`Qed`}:bt(),a=_(e),s=_(n),c=ot(y());if(c&&!nm.has(i.kind))throw le(`Proof of a step that does not take a proof`);let l=c?wt():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(lt),v({...t,body:i,head:a,statement:s,proof:l},e)},Ct=()=>{let e=m(y());if(x(`BY`)||x(`PROOF`)&&x(`BY`,1)){C(`PROOF`),S();let t=_(o.index-1);return{kind:`By`,isOnly:C(`ONLY`),...mt(),keyword:t,location:e}}let t=y(+!!x(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){C(`PROOF`),S();let n=_(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}C(`PROOF`);let n=[St()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(St());return{kind:`Steps`,level:tt(),steps:n,location:e}},wt=()=>{let e=o.index;et.push(-1);let t=ut(Ct);return et.pop(),v(t,e)},Tt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Et=e=>{let t=o.index,n=S(),r=y().kind===`Identifier`&&x(`==`,1)?pe():void 0;r!==void 0&&(u.add(r),S());let i=ut(()=>({statement:x(`ASSUME`)?_t():D(),proof:ot(y())?wt():void 0})),a=i.statement,s=v({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&Tt(e,v({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Dt=()=>{let e=o.index,t=S(),n=y().kind===`Identifier`&&x(`==`,1)?pe():void 0;return n!==void 0&&(u.add(n),S()),v({name:n,expression:D(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Ot=()=>{let e=m(w(`----`));w(`MODULE`);let t=ye();w(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),c.push(/* @__PURE__ */ new Set),C(`EXTENDS`)&&T(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(_(e))});;){let t=o.index;re.index=t;let r=y();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),c.pop(),n;if(r.kind===`Separator`){if(x(`MODULE`,1)){let e=Ot();n.modules.push(e),n.units.push({kind:`Module`,module:e}),w(`====`);continue}S()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(S()),r=Xe();n.constants.push(...r),e.range=_(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(S()),r=T(()=>{let e=o.index,t=m(y());return v({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=_(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Dt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Tt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(x(`USE`)&&x(`ONLY`,1))throw de(`Expected a module unit but found ${ne(r)}`);let e=ht();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:S(),n.units.push({kind:`Recursive`,declarations:Ze()});continue;case`INSTANCE`:kt(n,v(Je(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(S(),x(`INSTANCE`)){kt(n,v(Je(void 0,[],!0,m(r)),t));continue}kt(n,v(qe(!0),t));continue}r.kind===`Keyword`&&em.has(r.text)?Et(n):kt(n,Ge(!1))}}},kt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},At=Ot(),jt=ve.isUsed?Hp(e):void 0;if(jt!==void 0)throw new l(jt);return At},gm=e=>hm(e,`tlc`),_m=(e,t)=>hm(e,`tlc`,t),vm=e=>hm(e,`tlapm`),ym=e=>hm(e,`sany`),bm=10454148508367108822n,xm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:bm);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Sm=Int32Array.from(xm,e=>Number(BigInt.asIntN(32,e>>32n))),Cm=Int32Array.from(xm,e=>Number(BigInt.asIntN(32,e))),wm=Number(BigInt.asIntN(32,bm>>32n)),Tm=Number(BigInt.asIntN(32,bm));let Em=wm,Dm=Tm;const Om=e=>{let t=(e^Dm)&255;Dm=(Dm>>>8|Em<<24)^Cm[t],Em=Em>>>8^Sm[t]},km=(()=>{let e=[Sm],t=[Cm];for(let n=1;n<4;n++){let r=e[n-1],i=t[n-1],a=/* @__PURE__ */ new Int32Array(256),o=/* @__PURE__ */ new Int32Array(256);for(let e=0;e<256;e++){let t=i[e]&255;o[e]=(i[e]>>>8|r[e]<<24)^Cm[t],a[e]=r[e]>>>8^Sm[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),Am=km.highs[0],jm=km.highs[1],Mm=km.highs[2],Nm=km.highs[3],Pm=km.lows[0],Fm=km.lows[1],Im=km.lows[2],Lm=km.lows[3],Rm=e=>{let t=Dm^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Dm=Em^Lm[n]^Im[r]^Fm[i]^Pm[a],Em=Nm[n]^Mm[r]^jm[i]^Am[a]},zm=e=>{if(typeof e==`boolean`)return Om(0),Om(e?116:102),2;if(typeof e==`number`)return Om(1),Rm(e),5;if(typeof e==`string`){Om(3),Rm(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Rm(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)Om(e.charCodeAt(n));return 5+e.length}return Om(21),Rm(kt(e.name)+1),5},Bm=e=>{if(typeof e!=`object`||j(e))zm(e);else if(A(e)){let t=F(e);Om(9),Rm(t.domain.length);for(let e=0;e<t.domain.length;e++)Bm(t.domain[e]),Bm(t.range[e])}else{let t=N(e).elements;Om(5),Rm(t.length);for(let e of t)Bm(e)}},Vm=e=>{let t={high:Em,low:Dm};Em=wm,Dm=Tm;for(let t of e)Bm(t);let n=BigInt(Em>>>0)<<32n|BigInt(Dm>>>0);return Em=t.high,Dm=t.low,n},Hm=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=Em,a=Dm;return e.forEach((e,n)=>{Em=wm,Dm=Tm;for(let n of t)Bm(e[n]);r[2*n]=Dm,r[2*n+1]=Em}),Em=i,Dm=a,n},Um=25214903917n,Wm=(1n<<48n)-1n,Gm=2147483647,Km=e=>{let t={value:(BigInt.asUintN(64,e)^Um)&Wm},n=e=>(t.value=t.value*Um+11n&Wm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Um)&Wm},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=Gm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},qm=[],Jm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Ym=()=>{for(let e=1277011;qm.length<1341;e++)Jm(e)&&qm.push(e);return qm},Xm=e=>{let t=Ym(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Zm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},Qm=e=>{for(let t=Math.max(e,9);;t++){let e=Zm(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},$m=(e,t,n)=>{if(t<=0)return[];let r=Qm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Xm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},eh=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Gm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},th=(1n<<63n)-1n-24n,nh=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(th*BigInt(n)+i)%t;return r<0n?r+t:r})},rh=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,ih=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=qn(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>Bt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>Xn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:Yn}}},ah=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,oh=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?eh:$m;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=ah(t,r)?void 0:ih(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Gm)?nh(e,t,n):i(e,Number(t),n)).map(e=>a.create(rh(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},sh=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new h(`RandomElement of the empty set`);return n},ch=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...qn(e.domain)];return Bt(n,n.map(()=>ch(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Xn(e.names.map((n,r)=>[n,ch(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Yn(e.factors.map(e=>ch(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new h(`RandomElement of the empty set`);return e.low+r}return sh(N(e).elements,t)},lh=(e,t=0n)=>{let n=Km(t),r={random:Km(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Xn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Vm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.seededState&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.seededState=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},uh=e=>zn([...e.possibleCounts].map(([e,t])=>[e,t])),dh=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,uh(e)]]),fh=`----------------------------- MODULE Bags --------------------------------
|
|
403
|
+
`]]),cp=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),lp=`----------------------------- MODULE Bags --------------------------------
|
|
458
404
|
(**************************************************************************)
|
|
459
405
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
460
406
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -607,7 +553,7 @@ CopiesIn(e, B) ==
|
|
|
607
553
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
608
554
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
609
555
|
5 Dec 98 : Initial version.
|
|
610
|
-
`,
|
|
556
|
+
`,up=/* @__PURE__ */ new Map([[`Bags`,lp],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
611
557
|
(***************************************************************************)
|
|
612
558
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
613
559
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -863,7 +809,52 @@ TestRandomSetOfSubsets(k, n, S) ==
|
|
|
863
809
|
[i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
|
|
864
810
|
|
|
865
811
|
=============================================================================
|
|
866
|
-
`],[`RealTime
|
|
812
|
+
`],[`RealTime`,`----------------------------- MODULE RealTime -------------------------------
|
|
813
|
+
(***************************************************************************)
|
|
814
|
+
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
815
|
+
(* Systems". The type of specification described there cannot be handled *)
|
|
816
|
+
(* by the TLC model checker. *)
|
|
817
|
+
(***************************************************************************)
|
|
818
|
+
EXTENDS Reals
|
|
819
|
+
VARIABLE now
|
|
820
|
+
|
|
821
|
+
RTBound(A, v, D, E) ==
|
|
822
|
+
LET TNext(t) == t' = IF <<A>>_v \\/ ~(ENABLED <<A>>_v)'
|
|
823
|
+
THEN 0
|
|
824
|
+
ELSE t + (now'-now)
|
|
825
|
+
|
|
826
|
+
Timer(t) == (t=0) /\\ [][TNext(t)]_<<t, v, now>>
|
|
827
|
+
|
|
828
|
+
MaxTime(t) == [](t \\leq E)
|
|
829
|
+
|
|
830
|
+
MinTime(t) == [][A => t \\geq D]_v
|
|
831
|
+
IN \\EE t : Timer(t) /\\ MaxTime(t) /\\ MinTime(t)
|
|
832
|
+
-----------------------------------------------------------------------------
|
|
833
|
+
RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
834
|
+
/\\ UNCHANGED v
|
|
835
|
+
IN /\\ now \\in Real
|
|
836
|
+
/\\ [][NowNext]_now
|
|
837
|
+
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
838
|
+
=============================================================================
|
|
839
|
+
`],[`Reals`,`-------------------------------- MODULE Reals -------------------------------
|
|
840
|
+
(***************************************************************************)
|
|
841
|
+
(* This module provides dummy definitions of the operators that are *)
|
|
842
|
+
(* defined by the real Reals module. It is expected that any tool that *)
|
|
843
|
+
(* handles specifications that use real numbers will provide its own *)
|
|
844
|
+
(* implementations of these operators. TLC currently does not handle real *)
|
|
845
|
+
(* numbers and produces an error if a specification requires TLC to *)
|
|
846
|
+
(* evaluate the operators defined here or to evaluate any operator defined *)
|
|
847
|
+
(* in the Integers module that is applied to non-integer real numbers. *)
|
|
848
|
+
(* *)
|
|
849
|
+
(* See the book "Specifying Systems" for the real Reals module. *)
|
|
850
|
+
(***************************************************************************)
|
|
851
|
+
EXTENDS Integers
|
|
852
|
+
|
|
853
|
+
Real == "Reals"
|
|
854
|
+
a / b == CHOOSE m \\in Real : m * b = a
|
|
855
|
+
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
856
|
+
=============================================================================
|
|
857
|
+
`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
|
|
867
858
|
(***************************************************************************)
|
|
868
859
|
(* Defines operators on finite sequences, where a sequence of length n is *)
|
|
869
860
|
(* represented as a function whose domain is the set 1..n (the set *)
|
|
@@ -1267,7 +1258,34 @@ TLCEvalDefinition(definitionName) ==
|
|
|
1267
1258
|
TRUE \\* TODO
|
|
1268
1259
|
|
|
1269
1260
|
============================================================================
|
|
1270
|
-
`],[`Toolbox
|
|
1261
|
+
`],[`Toolbox`,`----------------------------- MODULE Toolbox --------------------------------
|
|
1262
|
+
(***************************************************************************)
|
|
1263
|
+
(* *)
|
|
1264
|
+
(***************************************************************************)
|
|
1265
|
+
LOCAL INSTANCE Naturals \\* a + b
|
|
1266
|
+
LOCAL INSTANCE FiniteSets \\* Cardinality
|
|
1267
|
+
LOCAL INSTANCE TLC \\* TLCGet
|
|
1268
|
+
|
|
1269
|
+
-----------------------------------------------------------------------------
|
|
1270
|
+
|
|
1271
|
+
(* Trace Exploration *)
|
|
1272
|
+
|
|
1273
|
+
_TETrace ==
|
|
1274
|
+
CHOOSE f \\in [ (Nat \\ {0}) -> STRING ] : TRUE
|
|
1275
|
+
|
|
1276
|
+
LOCAL _TETraceLength == Cardinality(DOMAIN _TETrace)
|
|
1277
|
+
|
|
1278
|
+
\\* When evaluated as part of a TLC ALIAS expression, \`_TEPosition\` should be
|
|
1279
|
+
\\* redefined as \`TLCGet("level"), or replace with \`TLCGet(level)\` right away.
|
|
1280
|
+
\\* The definition below accounts for several "peculiarities" of the
|
|
1281
|
+
\\* Toolbox's trace exploration.
|
|
1282
|
+
_TEPosition ==
|
|
1283
|
+
IF TLCGet("level") >= _TETraceLength
|
|
1284
|
+
THEN _TETraceLength
|
|
1285
|
+
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
1286
|
+
|
|
1287
|
+
=============================================================================
|
|
1288
|
+
`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
|
|
1271
1289
|
LOCAL INSTANCE TLC
|
|
1272
1290
|
LOCAL INSTANCE TLCExt
|
|
1273
1291
|
LOCAL INSTANCE GraphViz
|
|
@@ -1667,7 +1685,7 @@ _TLCTrace ==
|
|
|
1667
1685
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1668
1686
|
|
|
1669
1687
|
=============================================================================
|
|
1670
|
-
`]]),
|
|
1688
|
+
`]]),dp=new Map([...[...up].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,lp.replace(`
|
|
1671
1689
|
LOCAL INSTANCE Naturals
|
|
1672
1690
|
`,`
|
|
1673
1691
|
EXTENDS TLC
|
|
@@ -1759,7 +1777,17 @@ _TEPosition ==
|
|
|
1759
1777
|
ELSE TLCGet("level") + 1
|
|
1760
1778
|
|
|
1761
1779
|
=============================================================================
|
|
1762
|
-
`]]),hh=(e=`master`)=>e===`1.7.4`?mh:ph,gh=(e,t,r)=>new n(`Applying ${e} to the following value,\nwhich is not ${t}:\n${I(r)}`),_h=e=>A(e)?F(e):void 0,vh=(e,t,n)=>{let r=L(e,t,n),i=_h(r);if(!i)throw gh(n,`a function with a finite domain`,r);return i},yh=(e,t,n)=>{let r=L(e,t,n),i=_h(r);if(!i)throw gi(t===0?`first`:`second`,n,`bag`,r);return i},bh=(e,t)=>{if(!k(e)||!M(e))throw t();return N(e).elements},xh=e=>e.range.every(e=>typeof e==`number`&&e>0),Sh=(e,t)=>{let n=e.domain.findIndex(e=>Zt(e,t));return n===-1?void 0:e.range[n]},Ch=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,wh=Ch(`BagDiff`,`tlc2.value.impl.Value`,2),Th=Ch(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Eh=Ch(`BagUnion`,`tlc2.value.impl.Value`,1),Dh=Ch(`BagOfAll`,`tlc2.value.impl.Value`,2),Oh=Ch(`BagCup`,`tlc2.value.impl.Value`,2),kh=Ch(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Ah=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ii(e)}`;throw Ri(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},jh=(e,t,n)=>{let r=Ah(e,n)+Ah(t,n);if(Ai(r))throw ji(`${e}+${t}`);return r},Mh=(e,t,n,r)=>{let i=Sh(n,e.domain[t]),a=Ah(e.range[t],r);return i===void 0?a:a-Ah(i,r)|0},Nh=(e,t)=>zn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Zt(e[0],r));a?a[1]=jh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Ph=Bt([],[]),Fh=e=>[Ei(`EmptyBag`,Ph),R(`IsABag`,1,e=>{let t=_h(L(e,0,`IsABag`));return t!==void 0&&xh(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return vh(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw gh(`BagCardinality`,`a bag`,t);return jh(e,n,kh)},0)}),R(`BagIn`,2,e=>{let t=L(e,1,`BagIn`),n=Sh(vh(e,1,`BagIn`),L(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw gi(`second`,`BagIn`,`bag`,t);return n>0}),R(`CopiesIn`,2,e=>{let t=L(e,1,`CopiesIn`),n=Sh(vh(e,1,`CopiesIn`),L(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw gi(`second`,`CopiesIn`,`bag`,t);return n}),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=yh(e,t,`(+)`);if(!xh(n))throw gi(t===0?`first`:`second`,`(+)`,`bag`,L(e,t,`(+)`));return n});return Nh(t,Oh)}),R(`\\ominus`,2,e=>{let t=yh(e,0,`(-)`),n=yh(e,1,`(-)`);return zn(t.domain.flatMap((e,r)=>{let i=Mh(t,r,n,wh);return i>0?[[e,i]]:[]}))}),R(`BagUnion`,1,e=>{let t=L(e,0,`BagUnion`),r=bh(t,()=>gh(`BagUnion`,`a finite enumerable set`,t));if(r.length<2)return r[0]??Ph;let i=r.map(e=>{let r=_h(e);if(!r)throw new n(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(t)}`);return r});return Nh(i,Eh)}),R(`\\sqsubseteq`,2,e=>{let t=vh(e,0,`\\sqsubseteq`),n=vh(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Mh(t,r,n,Th)<=0)}),Di(`BagOfAll`,2,e=>{let t=Ti(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new n(`The first argument of BagOfAll should be an operator, but instead it is:\n${I(t.literalBody)}`);let r=L(e,1,`BagOfAll`),i=_h(r);if(!i)throw gi(`second`,`BagOfAll`,`function with a finite domain`,r);return Nh(i.domain.map((e,n)=>Bt([t.call([e])],[i.range[n]])),Dh)}),R(`SubBag`,1,t=>{let n=L(t,0,`SubBag`);if(!A(n))throw new h(`DOMAIN expects a function but received ${I(n)}`);let r=F(n),i=Nn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new h(`Attempted to apply a function to ${I(r)}, which is not in its domain`);return Nn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Bt(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>zr(vh(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=bh(t,()=>gh(`BagToSet`,`a function with a finite domain`,t));return Bt([...n],n.map(()=>1))})],Ih=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Lh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Rh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,zh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Bh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Vh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Hh=e=>{if(!A(e))return!1;let t=F(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Uh=(e,t)=>Ri(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ii(t)}`),Wh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Gh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Uh(t,e);return`[${N(e).elements.map(e=>qh(e,t)).join(`,`)}]`},Kh=(e,t)=>{let n=F(e),r=Sr(n);return r?`[${r.map(e=>qh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Wh(typeof e==`string`?e:I(e))}:${qh(n.range[r],t)}`).join(`,`)}}`},qh=(e,t)=>typeof e==`string`?Wh(e):typeof e==`object`?e.kind===`ModelValue`?Wh(e.name):k(e)?Gh(e,t):Kh(e,t):String(e),Jh=e=>{if(k(e))return Gh(e,Ih);if(!A(e)||Hh(e))throw Uh(Ih,e);return Kh(e,Ih)},Yh=e=>{if(!A(e))throw Uh(Lh,e);return Kh(e,Lh)},Xh=e=>{let[,t,n=`0`,r=``,i=`0`]=/^(-?)(\d+)(?:\.(\d*))?(?:[eE]([+-]?\d+))?$/.exec(e)??[],a=BigInt(n+r),o=Number(i)-r.length,s=o>=0?a*10n**BigInt(o):a/10n**BigInt(-o);return Number(BigInt.asIntN(32,t===`-`?-s:s))},Zh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Et(e);if(Array.isArray(e))return Yn(e.map(e=>Zh(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Et(e),Zh(n,t)]));throw Ri(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Qh=(e,t)=>{if(e.trim()===``)return Zh(null,t);try{return Zh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Xh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ri(t,e.message):e}},$h=(e,t)=>{if(typeof e!=`string`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.StringValue`);return e},eg=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ri(n,`${t} (No such file or directory)`);return r},tg=e=>[Oi(`ToJson`,1,e=>Et(qh(L(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Oi(`ToJsonArray`,1,e=>Et(Jh(L(e,0,`ToJsonArray`)))),Oi(`ToJsonObject`,1,e=>Et(Yh(L(e,0,`ToJsonObject`)))),Oi(`JsonSerialize`,2,t=>{let n=$h(L(t,0,`JsonSerialize`),Rh),r=L(t,1,`JsonSerialize`);if(!Sr(r)&&!Hh(r))throw gi(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,qh(r,Rh)),!0}),Oi(`ndJsonSerialize`,2,t=>{let n=$h(L(t,0,`ndJsonSerialize`),zh),r=L(t,1,`ndJsonSerialize`),i=Sr(r);if(!i)throw gi(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${qh(e,zh)}\n`).join(``)),!0}),Oi(`JsonDeserialize`,1,t=>{let n=$h(L(t,0,`JsonDeserialize`),Bh);return Qh(eg(e,n,Bh),Bh)}),Oi(`ndJsonDeserialize`,1,t=>{let n=$h(L(t,0,`ndJsonDeserialize`),Vh);return Yn(eg(e,n,Vh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Qh(e,Vh)))})],ng=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,rg=1e6,ig=(e,t,n)=>{if(typeof e!=`number`||e<0)throw gi(t,n,`nonnegative integer`,e);return e},ag=(e,t,n,r)=>Nn(Array.from({length:t},()=>Nn(e.filter(()=>r.nextDouble()<n)))),og=(e,t)=>{let n=`RandomSetOfSubsets`,r=ig(L(e,0,n),`first`,n),i=ig(L(e,1,n),`second`,n),a=L(e,2,n);if(!k(a)||!M(a))throw gi(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw gi(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw gi(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return ag(o,r,o.length===0?0:i/o.length,t.getRandom())},sg=e=>[Oi(`RandomSubset`,2,t=>{let n=L(t,0,`RandomSubset`);if(typeof n!=`number`)throw gi(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw Ri(ng,String(n));let r=L(t,1,`RandomSubset`);if(!k(r)||!P(r)&&!M(r))throw gi(`second`,`RandomSubset`,`a finite set`,r);let i=ah(r,e.version);if(i&&i.reduce((e,t)=>e*N(t).elements.length,1)>rg)throw Ri(ng,`Attempted to construct a set with too many elements (>${rg}).`);return Nn(oh(n,r,e.getRandom(),e.version))}),Oi(`RandomSetOfSubsets`,3,t=>og(t,e)),Oi(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>N(og(t,e)).elements.length)))],cg=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,lg=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${cg})`,ug=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${cg}) throws java.io.IOException`,dg=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${cg})`,fg=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),pg=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Yn([r[n],t[n],e])),a=n?[Yn([r[r.length-1],n.action,r[n.start]])]:[];return Xn([[`action`,Nn([...i,...a])],[`state`,Nn(r)]])},mg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return dh(e).get(t)},hg=(e,t,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),I(i));else throw new n(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(r)}`)},gg=e=>e.every(e=>e!==void 0),_g=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),vg=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!O(e)){if(t.variableIndex.has(r))return!0;let e=Fu(r,t);if(e&&!n.has(e)&&(n.add(e),vg(e.body,t,n)))return!0}return Ye(e).some(e=>vg(e,t,n))},yg=(t,r)=>{let i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new WeakMap,o=e=>{let t=a.get(e)??/* @__PURE__ */ new Map;return a.set(e,t),t};return[R(`AssertEq`,2,e=>{let n=L(e,0,`AssertEq`),r=L(e,1,`AssertEq`),i=Zt(n,r);return i||(t(I(`Assertion failed`,!0)),t(I(n,!0)),t(I(r,!0))),i}),Gi(`AssertError`,2,e=>{let t=Ti(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw Ri(lg,`In computing AssertError, a non-string expression (line ${t.location.line}, col ${t.location.column}) was used as the err of an AssertError(err, exp).`);let n=Ki(e,0,`AssertError`)();try{Ki(e,1,`AssertError`)()}catch(e){if(e instanceof h)return xa(e.message,r.isTool)===n;throw e}return!1}),Oi(`TLCGetOrDefault`,2,e=>{let t=L(e,0,`TLCGetOrDefault`);return mg(r,t)??L(e,1,`TLCGetOrDefault`)}),{...Di(`TLCGetAndSet`,4,e=>{let n=L(e,0,`TLCGetAndSet`),i=mg(r,n)??L(e,3,`TLCGetAndSet`),a=Ti(e,1,`TLCGetAndSet`);return hg(r,t,n,a.call([i,L(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Oi(`Trace`,0,(e,t)=>{let n=t?.state;if(!t||!n||!gg(n)){let e=(t?.environment.variables??[]).filter((e,t)=>n?.[t]===void 0);throw Ri(ug,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(r.getBehavior(n).map(e=>_g(e,t.environment)))}),Oi(`CounterExample`,0,()=>r.counterExample??Xn([[`action`,Nn([])],[`state`,Nn([])]])),R(`ToTrace`,1,e=>{let t=L(e,0,`ToTrace`);if(!A(t)||!Zt(zr(t),Nn([`action`,`state`])))throw new h(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(t)}`);let n=N(Lr(t,`state`)).elements.map(e=>Sr(e)??[]);return Yn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),R(`TLCModelValue`,1,e=>{let t=L(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new n(`The argument of ModelValue should be a string, but instead it is:\n${I(t)}`);return Rt(t)}),Gi(`TLCDefer`,1,()=>!0),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),Gi(`PickSuccessor`,1,(t,n)=>{let i=n?.next;if(!i||!gg(i))throw Ri(dg,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(r.isSeen(i)||Pu(Ki(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Gi(`TLCCache`,2,(e,t)=>{let n=Ti(e,0,`TLCCache`),r=ii(Ki(e,1,`TLCCache`)()),a=n.expression;if(!a||!t)return n.call([]);let s=vg(a,t.environment,/* @__PURE__ */ new Set)&&t.state?o(t.state):i,c=s.get(a)??/* @__PURE__ */ new Map;s.set(a,c);let l=c.get(r);if(l!==void 0)return l;let u=n.call([]);return c.set(r,u),u}),R(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Vm([L(e,0,`TLCFP`)])))),Oi(`TLCEvalDefinition`,1,(e,t)=>{let r=L(e,0,`TLCEvalDefinition`),i=typeof r==`string`&&t?Fu(r,t.environment):void 0;if(!i||typeof r!=`string`||!t)throw new n(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new n(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return H({kind:`Identifier`,name:r,location:i.location},t)})]},bg=(e,t)=>[Oi(`_Track`,2,e=>{let n=String(L(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,L(e,0,`_Track`)===!0?r+1:r),!0}),Oi(`_Counts`,0,()=>uh(t)),Oi(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(uh(t),!0)),!1)}),Oi(`_PrintCounts`,0,()=>(e(I(uh(t),!0)),!0))],xg=e=>String(e).padStart(2,`0`),Sg=e=>`${e.getUTCFullYear()}.${xg(e.getUTCMonth()+1)}.${xg(e.getUTCDate())}.${xg(e.getUTCHours())}${xg(e.getUTCMinutes())}${xg(e.getUTCSeconds())}`,Cg=e=>zn([...e].map(([e,t])=>[e,Yn([t])])),wg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Tg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Eg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Dg=(e,t,r)=>{if(e.version===`1.7.4`?!Tg.has(t)||!e.isStarted&&Eg.has(t):!e.isStarted&&wg.has(t))throw new n(`TLCGet(${t}) was undefined.`);let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Et(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Et(Sg(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return fg(void 0);case`all`:return Cg(e.registers);case`all:named`:return Cg(dh(e))}if(t.startsWith(`s:`)){let r=dh(e).get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(t.startsWith(`-D`))return Et(e.properties.get(t.slice(2))??t);throw new n(`TLCGet(${t}) was undefined.`)},Og=(e,t,r)=>{if(typeof t==`number`&&t>=0){let r=e.registers.get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(typeof t!=`string`)throw new n(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(t)}`);return Dg(e,t,r?.state)},kg=e=>e.length===0?[[]]:e.flatMap((t,n)=>kg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Ag=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(Ag),e.kind===`Function`&&e.range.forEach(Ag))},jg=(e,t)=>[R(`Print`,2,t=>(e(`${at(I(L(t,0,`Print`),!0,!0))} ${at(I(L(t,1,`Print`),!0,!0))}`),L(t,1,`Print`))),R(`PrintT`,1,t=>(e(at(I(L(t,0,`PrintT`),!0,!0))),!0)),R(`Assert`,2,e=>{if(L(e,0,`Assert`)!==!0)throw new n(`The first argument of Assert evaluated to FALSE; the second argument was:\n${at(I(L(e,1,`Assert`)))}`,m.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>zn([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=wi(e,0,`@@`),n=wi(e,1,`@@`);return Bn([...pt(t),...pt(n)])}),R(`ToString`,1,e=>Et(I(L(e,0,`ToString`),!0))),R(`TLCEval`,1,e=>{let t=L(e,0,`TLCEval`);return Ag(t),t}),R(`Permutations`,1,e=>{let t=Si(e,0,`Permutations`);return Nn(kg(t).map(e=>zn(t.map((t,n)=>[t,e[n]]))))}),Di(`SortSeq`,2,e=>{let t=Ti(e,1,`SortSeq`);return Yn(Ci(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),t.version===`1.7.4`?zi({...Oi(`TLCGet`,1,(e,n)=>Og(t,L(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):zi(Gi(`TLCGet`,1,(e,n)=>Og(t,Ki(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Oi(`TLCSet`,2,n=>{let r=L(n,0,`TLCSet`);return hg(t,e,r,L(n,1,`TLCSet`)),!0}),Ei(`Any`,Pt),R(`RandomElement`,1,e=>ch(xi(e,0,`RandomElement`),t.getRandom()))],Mg=(e,t)=>e.every(e=>Er(e,t)),Ng=Nn([!1,!0]),Pg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Rn(Pg(e,t,r),Pg(e,r,n))},Fg=[`\\cup`,`\\cap`,`\\`],Ig=e=>typeof e==`object`&&e.kind===`MixedSet`,Lg=(e,t,n)=>{let r=t.kind===`Interval`?N(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return Pn(r.filter(e=>Er(e,n)===t))}if(r.length===0)return n;if(!st(n))return qt({kind:`SetOperation`,operator:e,left:t,right:n});let i=N(n).elements.filter(e=>!Er(e,t));return Pn([...r,...i])},Rg=[Ei(`TRUE`,!0),Ei(`FALSE`,!1),Ei(`BOOLEAN`,Ng),Ei(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ki(`=`,jn),ki(`#`,(e,t)=>!jn(e,t)),R(`~`,1,e=>!yi(e,0,`~`)),R(`<=>`,2,e=>yi(e,0,`<=>`)===yi(e,1,`<=>`)),R(`/\\`,2,e=>yi(e,0,`/\\`)&&yi(e,1,`/\\`)),R(`\\/`,2,e=>yi(e,0,`\\/`)||yi(e,1,`\\/`)),R(`=>`,2,e=>!yi(e,0,`=>`)||yi(e,1,`=>`)),R(`\\in`,2,e=>Er(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!Er(L(e,0,`\\notin`),L(e,1,`\\notin`))),R(`\\subseteq`,2,e=>{let t=bi(e,0,`\\subseteq`),n=L(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&M(t.base)?Mg(N(t.base).elements,n.base):Mg(N(t).elements,n)}),...Fg.map(e=>R(e,2,t=>{let n=L(t,0,e),r=L(t,1,e);if(st(n)&&st(r)&&!Ig(n)&&!Ig(r)){if(e===`\\cup`&&P(n))return r;let t=e===`\\cup`?Rn:e===`\\cap`?Ln:In;return Tr((e,n)=>t(N(e),N(n)),(t,n)=>Lg(e,t,n),n,r)}return st(n)?Lg(e,n,r):e!==`\\`&&st(r)?Lg(e,r,n):qt({kind:`SetOperation`,operator:e,left:n,right:r})})),R(`SUBSET`,1,e=>({kind:`Subset`,base:L(e,0,`SUBSET`)})),R(`UNION`,1,e=>{let t=bi(e,0,`UNION`),n=ct(t)?t.elements.filter(ct):[];if(!ct(t)||n.length!==t.elements.length)return qt({kind:`Union`,base:t});if(Ig(t)||n.some(Ig)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Er(t,e)||e.elements.push(t)})),Pn(e.elements)}return n.length===0?Fn:Pg(n.map(N),0,n.length)}),R(`DOMAIN`,1,e=>{let t=L(e,0,`DOMAIN`);if(!A(t))throw new h(`DOMAIN expects a function but received ${I(t)}`);return zr(t)})],zg=Vi(`Integers`,`Neg`,`IntValue`,1),Bg=e=>{let t=Vi(e,`DotDot`,`IntervalValue`,2);return[Hi(e,`+`,`Plus`,(e,t)=>e+t),Hi(e,`-`,`Minus`,(e,t)=>e-t),Hi(e,`*`,`Times`,(e,t)=>e*t),Hi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new n(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new n(`0^0 is undefined.`);return e**t}),Hi(e,`\\div`,`Divide`,(t,r)=>{if(r===0)throw new n(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/r)|0;return e<0&&Math.imul(e,r)!==t?e-1:e}let i=Math.floor(t/r);if(Ai(i))throw ji(`${t} \\div ${r}`);return i}),Hi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new n(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),R(`..`,2,e=>({kind:`Interval`,low:Bi(L(e,0,`..`),t),high:Bi(L(e,1,`..`),t)}))]},Vg=Bg(`Naturals`),Hg=Bg(`Integers`),Ug=e=>{let t=Vg.indexOf(e);return t===-1?void 0:Hg[t]},Wg=[Ei(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Vg,Wi(`<`,(e,t)=>e<t),Wi(`>`,(e,t)=>e>t),Wi(`<=`,(e,t)=>e<=t),Wi(`>=`,(e,t)=>e>=t,`>`)],Gg=[Ei(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Hg,Wi(`>=`,(e,t)=>e>=t),R(`-.`,1,e=>{let t=Bi(L(e,0,`-`),zg);if(Ai(-t))throw ji(`-${t}`);return-t})],Kg=(e,t,r)=>{let i=L(e,t,r),a=Sr(i);if(!a)throw new n(`${r}\n${I(i)}`);return a},qg=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:Kg(e,t,n)},Jg=(e,t,n)=>typeof e==`string`?Et(e.slice(t,n)):Yn(e.slice(t,n)),Yg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Xg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Zg=(e,t)=>{let n=Sf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?zi(e,t):e}):t},Qg=e=>Zg(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>qg(e,0,Yg(``,`Len`)).length),R(`\\o`,2,e=>{let t=qg(e,0,Xg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Kg(e,1,Xg(`t \\o s`,`sequence`));return Yn([...t,...n])}let r=L(e,1,`\\o`);if(typeof r!=`string`)throw new n(`${Xg(`t \\o s`,`string`)}\n${I(r)}`);return Et(t+r)}),R(`Append`,2,t=>Yn([...Kg(t,0,Xg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(t,1,`Append`)])),R(`Head`,1,e=>{let t=Kg(e,0,Yg(``,`Head`));if(t.length===0)throw new n(`Attempted to apply Head to the empty sequence.`);return t[0]}),R(`Tail`,1,e=>{let t=qg(e,0,Yg(``,`Tail`));if(t.length===0)throw new n(`Attempted to apply Tail to the empty sequence.`);return Jg(t,1)}),R(`SubSeq`,3,e=>{let t=qg(e,0,Yg(`first `,`SubSeq`)),r=vi(e,1,`SubSeq`),i=vi(e,2,`SubSeq`);if(r>i)return Jg(t,0,0);let a=r<1||r>t.length?{position:`second`,value:r}:i>t.length?{position:`third`,value:i}:void 0;if(a)throw new n(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(e,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Jg(t,r-1,i)}),Di(`SelectSeq`,2,e=>{let t=Ti(e,1,`SelectSeq`);return Yn(Kg(e,0,Yg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw gi(`second`,`SelectSeq`,`operator`,n);return n}))})]),$g=e=>Zg(`FiniteSets`,[R(`IsFiniteSet`,1,e=>{let t=L(e,0,`IsFiniteSet`);if(k(t))return br(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new h(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${I(t)}\nis a finite set.`:`Attempted to check if the ${lt(t)} ${I(t)} is a finite set.`)}),R(`Cardinality`,1,t=>{let r=L(t,0,`Cardinality`);if(!k(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new n(`Attempted to compute cardinality of the value\n${I(r)}`);return vr(r,e)})]),e_=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),t_=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Wg};case`Integers`:return{extends:[`Naturals`],operators:Gg};case`Sequences`:return{extends:[],operators:Qg(n.version)};case`FiniteSets`:return{extends:[],operators:$g(n.version)};case`TLC`:return{extends:[],operators:Zg(`TLC`,jg(t,n))};case`Randomization`:return{extends:[],operators:sg(n)};case`_Possible`:return{extends:[],operators:bg(t,n)};case`Json`:return{extends:[],operators:tg(r)};case`Bags`:return{extends:[],operators:Fh(i)};case`TLCExt`:return{extends:[],operators:yg(t,n)};default:return}},n_=`$subexpression`,r_=(e,t)=>new l(`${e} at line ${t.line}, column ${t.column}`),i_=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return i_(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Ye(e)){let e=i_(r,t,n);if(e)return e}},a_=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),o_=(e,t)=>{let n=e.location,r=a_(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw r_(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw r_(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:n_,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:n_,args:e.args,location:n,resolution:Ia},location:n}},s_=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Ia})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ia}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ia};return o_({...t,params:[...t.params,...r]},a)},c_=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw r_(r,i);Ra.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:b(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw r_(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>os(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw r_(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Ua(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw r_(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&i_(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw r_(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||uo(t.operand,1)!==0)throw r_(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=ho(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[uo(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw r_(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=uo(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw r_(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw r_(`Unexpected subexpression selector`,i);let s=r?r.sets:go(n),c=s?.[uo(t.operand,s.length)];if(!c)throw r_(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return s_(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw r_(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return s_(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw r_(`Subexpression selection failed`,i);return o_(a,o.current)},l_=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return fo(e,t,n)},u_=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Ye(e).some(u_),d_=(e,t,n,r=!1)=>{if(!u_(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=ls(e,e=>d_(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>f_(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>d_(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:ls(e,e=>d_(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?l_(a.name,[],void 0,t):a.kind===`Apply`?l_(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=c_(o,t,a,r);return c!==a&&La.add(c),c},f_=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:d_(e.expression,t,n,!0)}))}),p_=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},m_=(e,t)=>f_(e,p_(t.definitions),()=>!1),h_=(e,t)=>{let n=p_([...t,...e.definitions]),r=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),i=e=>r.has(e),a=e=>d_(e,n,i),o=e=>i(e)||!n(e),s=e=>d_(e,n,o),c=e=>e.map(e=>e.kind===`ModuleFact`?e:s(e)),l=e=>e.map(e=>({...e,set:s(e.set)})),u=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&s(e.set)}:u(e)),conclusion:s(e.conclusion)}:s(e),d=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:c(e.facts)};case`Instance`:return f_(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?f_(e,n,o):cs(e,s))};case`Have`:case`Case`:return{...e,expression:s(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(s)};case`Take`:return{...e,bounds:l(e.bounds)};case`Pick`:return{...e,bounds:l(e.bounds),body:s(e.body)};case`Assert`:return{...e,statement:u(e.statement)};default:return e}},f=e=>e?.kind===`By`?{...e,facts:c(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:d(e.body),proof:f(e.proof)}))}:e,p={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:u(e.statement),proof:f(e.proof)})),uses:e.uses.map(e=>({...e,facts:c(e.facts)}))};return e.definitions.some(e=>u_(e.body))||e.assumptions.some(e=>u_(e.expression))?{...p,definitions:e.definitions.map(e=>cs(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},g_=(e,t)=>e.maxLevels[t]??3,__=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=fc({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Us(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Us(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ws(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Bs(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Us(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(pc(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,o=b(t.location.range??{module:t.instancer,start:t.location,end:t.location}),s=e=>r.set(`${o}\n${e}`,{location:o,message:e}),c=e(t.module),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&s(p(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=l.argConstraints.get(Rs(e.name,i));a!==void 0&&g_(r,i)<a&&s(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let n=Bs(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=g_(r,n.index);i.level>a&&s(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw a([...r.values()])}},v_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],y_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),b_=new Map(gf.flatMap(e=>e.map(t=>[t,e[0]]))),x_=e=>b_.get(e)??e,S_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},C_=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},w_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:S_(e)&2147483647,kind:t,isLocal:n}),T_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:x_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:x_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},E_=(e,t)=>{let n=[];for(let r=t;;){let t=T_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},D_=e=>({line:e.line,column:e.column}),O_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=E_(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},k_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,A_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},j_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&k_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&k_(e[n+1],e[n+2])?n+=k_(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>A_[e])}"`:r.text)}return t},M_=e=>e[2]?.text,N_=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},P_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>P_(e.modules,t)).find(Boolean),F_=e=>{let t=e===void 0?[]:xe(e),n={module:void 0};return{tokens:t,ranges:N_(t),getModule:()=>n.module??=e===void 0?gm(``):_m(e,t)}},I_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=F_(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:(bf.has(i)?t?.(i):void 0)??xf.get(i)??t?.(i)??mm(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(M_(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>P_(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},L_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=E_(t,e+1);i.push({location:D_(t[e]),apply:e=>r.forEach(t=>e.put(w_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:D_(u),apply:t=>t.put(w_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&E_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),y_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(D_(u)),i.push({location:D_(u),apply:e=>e.put(w_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(w_(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=x_(e.name);i.push({location:e.location,apply:n=>n.put(w_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(w_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(w_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=C_();n.set(i??``,o),hf.toReversed().forEach(e=>o.put(w_(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},R_=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},a=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),_f.forEach(r);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=O_(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),ee=m(e=>e.instances),g=/* @__PURE__ */ new Set([void 0]),_=/* @__PURE__ */ new Map;j_(o(void 0)).forEach((e,t)=>{t===3&&yf.forEach(r),r(e)});let v=l(void 0);for(;;){let t=h(v,/* @__PURE__ */ new Set)??ee(v,/* @__PURE__ */ new Set);if(!t)break;let[n,a]=t;if(d.add(`${n.key}>${a}`),_.set(n.unit,[..._.get(n.unit)??[],a]),!g.has(a)){if(g.add(a),e(a).tokens.length===0){let t=n.unit??M_(e(void 0).tokens);throw i(a,t)}j_(o(a)).forEach(r)}}v_.forEach(r);let te=/* @__PURE__ */ new Set,y=e=>{if(te.has(e))return;te.add(e);let t=_.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(y),o(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return y(void 0),vf.forEach(r),[...n]},z_=(e,t)=>{let n=I_(e,t),r=n.getParsed,i,a=()=>i??=L_(r);return{getStringOrder:e=>R_(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},B_=e=>{switch(e.kind){case`Number`:if(!ut(e.value))throw o(new n(`Integer overflow: ${e.value} is outside TLC's 32-bit range`),m.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Rt(e.name);case`Set`:return Nn(e.elements.map(B_))}},V_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],H_=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof l))throw n;let r=Hp(e);throw r===void 0?n:a([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},U_=e=>new l(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),W_=(e,t)=>e.location.range&&t.location.range&&{location:b(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${b(t.location.range)}.`},G_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,K_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:G_(e),q_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Cs(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),J_=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>I(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new h(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Zt(t,r)})});if(t)return t[1];throw new h(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Y_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Ye(e).some(e=>Y_(e,t)),X_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(vs(e),n.get(e)??n.size)),n},Z_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Q_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Cu(e);if(e.kind===`Number`&&!ut(e.value))throw wu(e);Q_(e.kind===`Let`?[...Ye(e),...Z_(e.instances??[])]:Ye(e))}),$_=(e,n)=>{let r=n.order??z_(n.source,n.loadModule),o=r.parseModule(n.source),s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,f=new Map(Rg.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=lh(e.checkDeadlock,n.seed);m.isWarningEnabled=n.isWarningEnabled??!0,m.isTool=n.isTool??!1,m.version=n.version??`master`;let ee=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,te=[],y=/* @__PURE__ */ new Map,ne=[],re=[],ie=(e,t)=>ne.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ae={value:0},oe=e=>`${e}#${ae.value++}`,se=[],ce=[],le=__(e=>{let t=v.get(e)??me(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>s.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>s.get(t.visible.get(e)?.key??e)}}),ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Map,x=e=>{let t=p.get(e);if(t)return t;let r=t_(e,n.print,m,n.files,f);if(!r)return;e_.get(e)?.forEach(x);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>x(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Fs.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ls(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},S=e=>{if(bf.has(e)&&n.loadModule?.(e)!==void 0)return;let t=x(e),r=e_.get(e)??[];return t&&ie(e,r),t&&r.includes(`Integers`)&&x(`Integers`),t},C=e=>(Q_([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Z_(e.instances)]),e.modules.forEach(C),e);C(o);let w=(e,t)=>{let o=n.loadModule?.(e)??$e.get(e)??mm(n.source,e);if(o===void 0)throw i(e,t);let s=H_(o,e,r);if(s.name!==e)throw a([{location:`Unknown location`,message:`File name '${e}' does not match the name '${s.name}' of the top level module it contains.`}],!0);return C(s)},pe=e=>{let t=re.indexOf(e.name);if(t!==-1){let n=[...re.slice(t),e.name].map(e=>`${e}.tla`);throw new l(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],o=[];re.push(e.name),ne.push(n);let s=Ce(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:ce,levelChecks:o});if(ne.pop(),re.pop(),i.length>0)throw a(i,!1,void 0,ce);let c=r.find(e=>n.has(e.name)),u=c&&ee.get(c.name),d=u&&W_(c,u.module);if(d)throw a([d],!1,void 0,ce);if(c)throw U_(c);return o.forEach(e=>e()),{linked:s,closure:n}},me=(e,t)=>{let r=ee.get(e);if(r)return ie(e,y.get(e)??[]),r;let i=pe(w(e,t));return(hh(m.version).has(e)?t_(e,n.print,m,n.files,f):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(f.set(t.key,e),s.delete(t.key))}),ee.set(e,i.linked),y.set(e,i.closure),ie(e,i.closure),i.linked},he=(e,t,n,r,i)=>{let a=i?void 0:S(e.module);if(a)return ge(e,a);let o=i??me(e.module,t.name);o.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let l=V_(o),f=`#${ae.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Qo(m_(e,t),l,t,n);se.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=As({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,rs(t,p)])),variables:new Set(o.variables),getDefinition:e=>s.get(e),isParameterized:e=>c.get(e)===!0,addDefinition:(n,i,a)=>{let o=oe(`${i}@${t.name}`),f=a(o);return s.set(o,f),l.length>0&&d.add(f),e.name!==void 0&&de.set(o,`${e.name}!${de.get(n)??i}`),c.set(o,!r),u.set(o,{source:n,prefix:e.params.length}),o},createName:oe});return _e(e,o.exported,l,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return l.length>0&&ue.set(r,{name:n,location:e.location}),e.name!==void 0&&fe.set(r,n),r})},ge=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),_e=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:c.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},ve=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:ws(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ye=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),be=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=ye(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ws(r,n),location:n}}},T=(e,t,n,r)=>{let i=e.location,a=r?void 0:S(e.module);if(a)return e.name===void 0?[]:[...a].map(([t,n])=>{let r=ye(n.arity);return ve(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let o=r??me(e.module,n),l=`#${ae.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=V_(o),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};se.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>Y_(f(e),p),h=d.map(t=>{let n=be(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),ee=[],g=As({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ws(e.params,i),location:i,resolution:Ia}:Cs(`${t.name}${l}`,i)])),variables:new Set(o.variables),getDefinition:e=>s.get(e),isParameterized:e=>c.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${ee.length}`,a=r(i);return ee.push(a.kind===`Operator`?{...a,name:i}:q_(a,i)),i},createName:oe}),_=new Set(d.map(e=>e.name)),v=[...o.exported].filter(([e])=>!_.has(e)).map(([t,n])=>{let r=g.getKey(n.key),a=ye(n.arity),o=[...e.params,...a];return ve(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...ee,...v]},xe=e=>[...e].flatMap(([e,t])=>{let n=s.get(t.key);return n?[{...n,name:e}]:[]}),Se=/* @__PURE__ */ new Map,Ce=(e,t)=>{let r=mf(e,n.loadClass?.(e.name),e===o);Se.set(e.name,r.overrides);let i=r.module,a=se.length,l=new Map([...Rg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...t.symbols]),u=/* @__PURE__ */ new Map,d={location:qo,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||b(n.range)===b(e.range))return;let r=b(e.range),i=b(n.range);K_(n.kind)===K_(e.kind)?d.warnings.push({location:r,message:`Warning: the ${G_(n.kind)} of '${t}' conflicts with \nits ${G_(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${G_(e.kind)} of '${t}' conflicts with \nits ${G_(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,ee=/* @__PURE__ */ new Map,g=[],y=[...i.constants],ne=i.variables.map(e=>e.name),re=i.variables.map(e=>e.location);i.extends.forEach(e=>{let n=t.modules.get(e),r=n?void 0:S(e);if(r){p(r);return}let a=n??me(e,i.name);y.push(...a.constants.filter(e=>y.every(t=>t.name!==e.name))),a.variables.forEach((e,t)=>{ne.includes(e)||(ne.push(e),re.push(a.variableLocations[t]))}),p(a.exported),a.facts.forEach(e=>h.add(e)),a.modules.forEach((e,t)=>ee.set(t,e)),g.push(a)});let ie=new Map(l),ae=[...i.constants.map(e=>({...e,kind:`Constant`})),...i.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ae.forEach(e=>m.set(e.name,oe(e)));let ue=e=>({key:x(e),arity:Ua(e),params:Wa(e),kind:Jo(i,e)?`Theorem`:`Definition`,range:e.location.range}),de=y.length===0&&ne.length===0,x=e=>i===o?e.name:`${e.name}@${t.id}`,C=/* @__PURE__ */ new Map,w=()=>new Map([...t.modules,...ee]),pe=e=>{let t=i.instances.find(t=>t.module===e.name);return t!==void 0&&Ha(e.location,t.location)},ve=e=>{let t=i.modules.find(t=>t.name===e.module);return t?pe(t)?ee.get(t.name):void 0:w().get(e.module)},ye=e=>({imported:l,getInstance:e=>{let t=ve(e),n=t?void 0:S(e.module);if(n)return{declarations:[],symbols:ge(e,n),instancer:i.name};let r=t??me(e.module,i.name),a=V_(r);return{declarations:a,symbols:_e(e,r.exported,a,e=>e),instancer:i.name}},bound:ie,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:x,instanced:C,facts:h,reports:f,warnings:t.warnings}),be=e=>[...ae.filter(t=>Ha(t.location,e)).map(e=>[e.name,oe(e)]),...i.definitions.filter(t=>Ha(t.location,e)).map(e=>[e.name,ue(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),we=e=>{let n=w(),r=n.get(e.name),i=r&&W_(e,r.module);if(r&&!i)throw U_(e);t.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=Ce(e,{id:`${t.id}/${e.name}`,symbols:be(e.location),modules:n,nested:t.nested,errors:a.errors,warnings:a.warnings,levelChecks:t.levelChecks});i&&a.errors.push(i),r||ee.set(e.name,o),_.has(e.name)||_.set(e.name,o)};[...i.instances.map(e=>({location:e.location,link:()=>{let t=he(e,i,ye(i),de,w().get(e.module));C.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...i.modules.map(e=>({location:e.location,link:()=>we(e)}))].sort((e,t)=>Ha(e.location,t.location)?-1:1).forEach(e=>e.link());let E=h_(Ps(i,(e,t)=>T(e,t,i.name,ve(e))),xe(l));t.errors.push(...es(E,ye(E))),E.definitions.forEach(e=>{let t=x(e);s.set(t,e),c.set(t,!de);let n=ue(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ha(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let Te={module:E,constants:y,variables:ne,variableLocations:re,visible:l,exported:m,modules:ee,extended:g,facts:/* @__PURE__ */ new Set([...h,...[...E.theorems,...E.assumptions].flatMap(e=>e.name??[])])};v.has(i.name)||v.set(i.name,Te);let Ee=se.splice(a).map(e=>({location:e.location,check:()=>le(e)}));return t.levelChecks.push(()=>mc(E,{constants:new Set(y.map(e=>e.name)),variables:new Set(ne),getDefinition:e=>s.get(l.get(e)?.key??e),getQualifiedName:e=>fe.get(l.get(e)?.key??e)},Ee,ce)),te.push(Te),Te},we=pe(o).linked;ce.length>0&&!n.isSanyReported&&n.print(t(ce));let E=e=>we.visible.get(e)?.key??e;we.visible.forEach((e,t)=>{let n=s.get(e.key);n&&e.key!==t&&s.set(t,n)});let Te=[],Ee=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Ee(e,t)),Te.push(...e.module.assumptions))};Ee(we,/* @__PURE__ */ new Set);let De=we.constants.map(e=>e.name),Oe=we.variables,ke=e=>e.module===void 0?[e.name,E(e.name)]:e.module===o.name||De.includes(e.name)?[]:[(ee.get(e.module)??_.get(e.module))?.visible.get(e.name)?.key??e.name],Ae=e=>{let t=s.get(e);return t?.kind===`Operator`?t.params.length:we.constants.find(t=>t.name===e)?.arity??0},je=/* @__PURE__ */ new Map,Me=/* @__PURE__ */ new Set,Ne=(e,t)=>{f.set(e,t),s.delete(e),je.delete(e),Me.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=B_(e.value);An(t),ke(e).forEach(e=>{let n=Ae(e);n===0?je.set(e,t):Ne(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Pe=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Pe.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new g(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(B_),B_(e.value)]),Pe.set(t,n)}),Pe.forEach(e=>ke(e).forEach(t=>Ne(t,J_(e.name,Ae(t)||e.rows[0][0].length,e.rows))));let Fe=new Map(e.substitutions.flatMap(e=>ke(e).map(t=>[t,E(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!De.includes(n)&&!we.visible.has(n))throw new g(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new g(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let i=E(r),a=s.get(i);if(!(a!==void 0||f.has(i)||je.has(i)||De.includes(r)||Oe.includes(r)))throw new g(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(a?.kind===`Operator`&&a.params.length!==(we.constants.find(e=>e.name===n)?.arity??we.visible.get(n)?.arity))throw new g(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Ie=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(ke)),Le=(e,t)=>{if(Ie.has(e))return{key:e,prefix:t};let n=u.get(e);return n&&Le(n.source,t+n.prefix)};u.forEach((e,t)=>{let n=Le(e.source,e.prefix),r=s.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],a=ve(t,n.key,i,i.slice(n.prefix),r.location);s.set(t,a),we.visible.forEach((e,n)=>{e.key===t&&n!==t&&s.set(n,a)})});let Re=De.filter(e=>!je.has(e)&&!Fe.has(e)&&!Me.has(e));if(Re.length>0&&!n.isUnconfigured){let e=r.getDeclarationOrder(`constant`).find(e=>Re.includes(e))??Re[0];throw new g(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&f.forEach((e,t)=>{let n=Ug(e);n&&f.set(t,n)});let ze=X_(Oe,te.flatMap(e=>e.module.variables.map(e=>e.name))),Be=Oc({definitions:s,substitutions:Fe,constants:je,variableIndex:ze,builtins:f,variables:Oe}),Ve={runtime:m,definitions:s,builtins:f,constants:je,substitutions:Fe,instanceNames:de,variables:Oe,variableIndex:ze,facts:Be,startupValues:Array.from({length:Be.ids.size},()=>void 0),substitutedDefinitions:d,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},He=fc({constants:new Set(je.keys()),variables:/* @__PURE__ */ new Set([...Oe,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>Fu(e,Ve)}),D=e=>{try{H(e,{environment:Ve,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof h)return e;throw e}};Fe.forEach((e,t)=>{let n=s.get(e),r=De.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&He.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?D(n.body):void 0;if(r){let n=va(r)?``:` - specifically: ${r.message}`;throw new g(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Ue=new Set(te.flatMap(e=>e.module.instances.map(e=>e.module))),We=r.createDefinitionOrder();return{environment:Ve,assumptions:Te,variableLocations:we.variableLocations,instanceActions:ue,startupDefinitions:te.filter(e=>!Ue.has(e.module.name)||V_(e).length===0).flatMap(e=>We(e===we?void 0:e.module.name).flatMap(t=>{let n=s.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:we.constants,rootSymbols:we.visible,javaOverrides:te.flatMap(e=>Se.get(e.module.name)??[])}},ev={kind:`Boolean`,value:!0},tv={kind:`Boolean`,value:!1},nv=e=>e?ev:tv,rv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,iv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),av=(e,t,n)=>({kind:e,operands:[t,n]}),ov=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?ov(e,t.operands).operands:[t])}),sv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return sv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,sv(t)),0)}},cv=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return cv(e.body);case`And`:case`Or`:return e.operands.some(cv)}},lv=/* @__PURE__ */ new WeakMap,uv={count:0},dv=e=>{let t=lv.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${uv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(dv).join(`,`)})`;default:return`${e.kind}(${dv(e.body)})`}})();return lv.set(e,n),n},fv=(e,t)=>e===t||dv(e)===dv(t),pv=(e,t)=>{let n=dv(t);return e.some(e=>e===t||dv(e)===n)},mv=e=>e===`And`?`Or`:`And`,hv=(e,t)=>{switch(e.kind){case`Boolean`:return t?nv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return hv(e.body,!t);case`And`:case`Or`:return ov(t?mv(e.kind):e.kind,e.operands.map(e=>hv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,hv(e.body,t))}}},gv=e=>{switch(e.kind){case`Boolean`:return nv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return ov(mv(e.kind),e.operands.map(gv));case`Always`:return $(`Eventually`,gv(e.body));case`Eventually`:return $(`Always`,gv(e.body));default:return $(`Not`,e)}},_v=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=_v(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return nv(t)}return n.length===0?nv(!t):n.length===1?n[0]:ov(e.kind,n)}case`Not`:{let t=_v(e.body);return t.kind===`Boolean`?nv(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=_v(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},vv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,yv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=yv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new h(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>ov(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=yv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=vv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:ov(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return ov(`Or`,n)}case`Not`:return rv(e.body)?e:yv(gv(e.body));default:return e}},bv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?bv(e.operands[0]):ov(e.kind,e.operands.map(bv));case`Not`:return e.body.kind===`Not`?bv(e.body.body):$(`Not`,bv(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,bv(e.body));default:return e}},xv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return xv(e.operands[0]);let t=Math.floor(e.operands.length/2);return av(e.kind,xv(ov(e.kind,e.operands.slice(0,t))),xv(ov(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,xv(e.body));default:return e}},Sv=(e,t)=>{e.kind===`Eventually`&&!pv(t,e)&&t.push(e),`body`in e&&Sv(e.body,t),`operands`in e&&e.operands.forEach(e=>Sv(e,t))},Cv=e=>{let t=e.filter(iv),n=e.flatMap(e=>e.kind===`Not`&&iv(e.body)?[e.body]:[]);return!t.some(e=>pv(n,e))},wv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new h(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Tv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:$(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Ev=(e,t,n)=>e.flatMap(e=>{let r=Tv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Dv=e=>[...new Set(e.map(dv))].sort().join(`|`),Ov=(e,t)=>{let n=new Set(t.map(Dv));return[...e.filter(e=>!n.has(Dv(e))),...t]},kv=e=>{let t=wv(e),n=Ev(t,`Always`,`And`),r=Ev(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Tv(t,`Eventually`,`Or`);if(n&&!(pv(e,n.first)||pv(e,n.second)))return Ov(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(pv(e,t.first)||pv(e,t.second))&&!pv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Cv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Tv(t[e],`Always`,`And`);n&&(pv(t,n.first)||t.push(n.first),pv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)pv(t,e.first)&&pv(t,e.second)&&!pv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Cv(t)?[]:i(t)};return a(e)},Av=e=>({particle:e,successors:[],statePredicates:e.filter(e=>sv(e)<=1)}),jv=e=>{let t=kv([e]).map(Av),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Dv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of kv(n)){let n=Dv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Av(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Mv=(e,t)=>!pv(e,t)||pv(e,t.body),Nv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&sv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=vv(e);if(n){let e=sv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(cv(e))throw new h(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Pv=(e,t)=>{let n=e.findIndex(e=>fv(e,t));return n===-1?(e.push(t),e.length-1):n},Fv=e=>{let t=yv(_v(hv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=bv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Nv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:ov(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:fv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&xv(e.formula),n=[];t&&Sv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Pv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Pv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Pv(i,e))}));return{tableau:t&&jv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Iv=()=>o(new h(`Temporal formula is a tautology (its negation is unsatisfiable).`),m.livenessEvaluationFailure),Lv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Rv=/* @__PURE__ */ new WeakSet,zv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Bv=(e,t)=>new h(`TLC cannot handle the temporal formula ${B(e)}${t===void 0?``:`:\n${t}`}`),Vv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ou(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Vv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Vv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Fu(e,n);if(t)return Pc(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isStateLevel&&!r.isLevelConstant?1:0},o=(e,t)=>r.has(e)?0:O(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return ls(e,(e,a)=>(i.value=Math.max(i.value,Vv(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return Lv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Hv=(e,t)=>{try{return Wu(e,t)}catch(e){if(!(e instanceof h))throw e;if(!va(e))return;throw o(new h(`${c}${e.message}`),m.error)}},Uv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Uv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,B(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Wv(e,t,n));if(e.kind===`Identifier`){let r=O(e)?Ou(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Fu(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Pc(a,n)>0){if(i.has(a))throw d();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=zv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Vv(e,t,n)===3)){let t=fd(e,c),r=O(e)?void 0:Fu(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,wd(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Vv(e.set,t,n)===0),u=l?Hv(e.bounds,c):void 0;if(l&&u){let n=[];if(Gu(e.bounds,u,t,t=>(n.push(...s(e.body,t,B(e.body))),!1)),n.length===0)throw Iv();return n}return[{expression:e,scope:t,name:o}]},Wv=(e,t,n)=>{let r=Ed(e.definitions,zv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Rv.add(e.binding);return r},Gv=(e,t,n)=>{let i=n.runtime.version===`1.7.4`,a=(e,t,r)=>{let a=r===0&&!i?Vv(e,t,n):r;if(a===0){let r=H(e,zv(n,t));if(typeof r!=`boolean`)throw new h(`TLC expected a boolean value, but did not find one. ${gu(e)}`);return nv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(e,t,n,r)=>{if(o.depth>=100)throw d();o.depth++;let i=m(e,t);o.depth--;let s=sv(i);return s>2?i:a(n,r,s)},c=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,a=zv(n,t),o=O(e)||Fu(r,n)===void 0?Ou(t,r):void 0;if(o?.kind===`Thunk`&&Rv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:O(e)?pd(r,a):dd(r,n);if(c?.kind!==`Closure`)throw Bv(e);let u=e.kind===`Apply`?e.args:[],d=!O(e)&&Fu(r,n)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,wd(c,u,a),e,t)),d)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof r||n&&!i;throw!(t instanceof h)||a?t:Bv(e)}},u=(e,t)=>{let i=Vv(e,t,n);if(!e.bounds.every(e=>Vv(e.set,t,n)===0)){if(i<=2)return a(e,t,i);throw Bv(e)}let o=[],s=e.kind===`Forall`;try{Ku(e.bounds,zv(n,t),t=>(o.push(m(e.body,t)),!1))}catch(n){if(!(n instanceof h)||n instanceof r)throw n;if(i<=2)return a(e,t,i);throw Bv(e,s&&!va(n)?n.message:void 0)}return o.length===0?nv(s):f(e,t,ov(s?`And`:`Or`,o))},f=(e,t,n)=>{let r=sv(n);return r>2?n:a(e,t,r)},p=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!O(e)||e.operator===`=>`),m=(e,t)=>{let r=Vv(e,t,n);if(r<=2&&!p(e))return a(e,t,r);switch(e.kind){case`Label`:return m(e.body,t);case`Let`:return m(e.body,Wv(e,t,n));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,av(`Or`,$(`Not`,m(n[0],t)),$(`Eventually`,m(n[1],t)))):e.operator===`~`&&!O(e)?f(e,t,$(`Not`,m(n[0],t))):e.operator===`=>`?f(e,t,av(`Or`,$(`Not`,m(n[0],t)),m(n[1],t))):c(e,t)}case`And`:case`Or`:return f(e,t,ov(e.kind,e.operands.map(e=>m(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Vv(e.condition,t,n)===0){let r=H(e.condition,zv(n,t));if(typeof r==`boolean`)return m(r?e.consequent:e.alternative,t)}let r=m(e.condition,t);return f(e,t,av(`Or`,av(`And`,r,m(e.consequent,t)),av(`And`,$(`Not`,r),m(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,m(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=$(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?$(`Always`,$(`Eventually`,av(`Or`,i,a))):av(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Bv(e)}};return m(e,t)},Kv=(e,t,n,r,i)=>{let a=e=>Kv(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?Pu(H(e.expression,a),`a temporal property predicate`):au(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Pu(H(e.unchanged,a),`a subscript`)?!1:Pu(H(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return Kv(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new h(`TLC cannot evaluate a temporal formula in a single step`)}},qv=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>qv(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return Kv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Jv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Yv=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},Xv=e=>o(new h(`${u}${e}`),m.error),Zv=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!j(e)||!j(i))throw Xv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Qv=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Qv);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},$v=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,ey=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new g(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Xv(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>H(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!k(a)||!M(a))throw Xv(`The symmetry operator must specify a set of functions.`);let o=N(a).elements;if(!o.every(A))throw Xv(`The symmetry values must be function records.`);let s=o.map(Zv),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=Qv($v(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ca.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(Jv(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=Yv(n,e),r=Jv(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!$v(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>j(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},ty=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=ry(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(ry(e[r],t));return a}},ny=(e,t)=>{let n=[],r=[];for(let i of e){let e=ry(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(It);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(It(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},ry=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=ny(e.elements,t);return n?zt(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=ty(n.domain,t),i=ty(n.range,t)??n.range;if(r){let e=zn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Bt(n.domain,e.range):e}return i===n.range?n:Bt(n.domain,i)}if(n===`Interval`||!k(e)||!M(e))return e;let r=N(e),i=ty(r.elements,t);return i?Nn(i):r},iy=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=ry(e[o],i),a===0&&(a=It(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},ay={line:0,column:0},oy=e=>({kind:`Identifier`,name:e,location:ay}),sy=/* @__PURE__ */ new Set([`name`,`property`]),cy=(e,t,n)=>{let r=Fu(t,n);if(!r)throw new g(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new g(sy.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},ly=(e,t,n)=>{if(jc(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return H(oy(e),jy(n,void 0,void 0))}catch(e){if(e instanceof h||f(e))return;throw e}},uy=(e,t,n)=>{let r=cy(e,t,n);if(ly(t,r,n)!==void 0)throw new g(`The ${e} ${t} cannot be a constant.`);return r},dy=(e,t,n)=>{let r=n.constants.has(t)?void 0:cy(e,t,n),i=r?ly(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new g(`The ${e} of ${t} is equal to ${I(i)}`);return i===void 0?r:void 0},fy=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},py=(e,t,n)=>{let r=e.environment,i=/* @__PURE__ */ new Set;r.runtime.warn=(e,t)=>{i.has(t)||(i.add(t),n?.({kind:`warning`,code:e,text:t}))},n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),cd(e.startupDefinitions,r),t.invariants.forEach(e=>{dy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},my=(e,t)=>{let n=fc({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Fu(e,t)});return e.flatMap(e=>{let r=dy(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1780
|
+
`]]),fp=(e=`master`)=>e===`1.7.4`?dp:up,pp=(e,t)=>e.every(e=>Gi(e,t)),mp=Kr([!1,!0]);Vr(mp);const hp=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Zr(hp(e,t,r),hp(e,r,n))},gp=[`\\cup`,`\\cap`,`\\`],_p=e=>typeof e==`object`&&e.kind===`MixedSet`,vp=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,yp=(e,t,n)=>{t.kind===`Interval`&&Fi(t);let r=t.kind===`Interval`?t:Br(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return cn(r,e=>{Gi(e,n)===i&&on(a,e)}),vp(t)?nr(a):qr(a)}if(Mi(t))return n;if(!ln(n))return ur({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return cn(r,e=>on(i,e)),cn(n.kind===`Interval`?n:I(n).elements,e=>{Gi(e,t)||on(i,e)}),qr(i)},bp=(e,t)=>{let n=(t,n)=>us([Ms(t,n,e)()],0,e);return{...B(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},xp=[fs(`TRUE`,!0),fs(`FALSE`,!1),fs(`BOOLEAN`,mp),fs(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),hs(`=`,Ur),hs(`#`,(e,t)=>!Ur(e,t)),B(`~`,1,e=>!us(e,0,`~`)),B(`<=>`,2,e=>us(e,0,`<=>`)===us(e,1,`<=>`)),bp(`/\\`,(e,t)=>e&&t()),bp(`\\/`,(e,t)=>e||t()),bp(`=>`,(e,t)=>!e||t()),B(`\\in`,2,e=>Gi(z(e,0,`\\in`),z(e,1,`\\in`))),B(`\\notin`,2,e=>!Gi(z(e,0,`\\notin`),z(e,1,`\\notin`))),hs(`\\subseteq`,(e,t)=>{if(!P(e))throw new y(`\\subseteq expects a set but received ${R(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&F(e.base))return pp(I(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!Gi(n,t))return!1;return!0}return!Ei(e,e=>!Gi(e,t))}),...gp.map(e=>B(e,2,t=>{let n=z(t,0,e),r=z(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(ln(n)&&ln(r)&&!_p(n)&&!_p(r)&&!i&&!sn(n)&&!sn(r)){if(e===`\\cup`&&Mi(n))return r;let t=e===`\\cup`?Zr:e===`\\cap`?Xr:Yr;return Ui((n,r)=>{let i=I(n),a=I(r),o=t(i,a);if(e===`\\cup`){let e=Br(i),t=Yr(a,i).elements,n=e===i.elements&&(t.length===0||Xn(e[e.length-1],t[0])<0);if(e.length+t.length>rn())throw new s(an());if(n&&!i.isNormalized)return o;let r=o===i?tr(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=vp(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Gi(e,o)))),o},(t,n)=>yp(e,t,n),n,r)}return ln(n)?yp(e,n,r):e!==`\\`&&ln(r)?yp(e,r,n):ur({kind:`SetOperation`,operator:e,left:n,right:r})})),B(`SUBSET`,1,e=>({kind:`Subset`,base:z(e,0,`SUBSET`)})),B(`UNION`,1,e=>{let t=z(e,0,`UNION`),n=fn(t)?Br(t):[],r=n.filter(fn);if(!fn(t)||r.length!==n.length)return ur({kind:`Union`,base:t});let i=r.flatMap(Br),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Gi(t,e)||on(e.elements,t)}),qr(e.elements)};return _p(t)||r.some(_p)?a():r.length===0?Jr:Ui(e=>zi(hp(e,0,e.length),i),a,r.map(I),void 0)}),B(`DOMAIN`,1,e=>{let t=z(e,0,`DOMAIN`);if(!un(t))throw new y(`DOMAIN expects a function but received ${R(t)}`);return ua(t)})],Sp=Ds(`Integers`,`Neg`,`IntValue`,1),Cp=e=>{let t=Ds(e,`DotDot`,`IntervalValue`,2);return[Os(e,`+`,`Plus`,(e,t)=>e+t),Os(e,`-`,`Minus`,(e,t)=>e-t),Os(e,`*`,`Times`,(e,t)=>e*t),Os(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new x(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new x(`0^0 is undefined.`);return e**t}),Os(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new x(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(gs(n))throw _s(`${e} \\div ${t}`);return n}),Os(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new x(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),B(`..`,2,e=>{let n=z(e,0,`..`),r=Es(z(e,1,`..`),t);return{kind:`Interval`,low:Es(n,t),high:r}})]},wp=Cp(`Naturals`),Tp=Cp(`Integers`),Ep=e=>{let t=wp.indexOf(e);return t===-1?void 0:Tp[t]},Dp=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Ts(As(`<`,(e,t)=>e<t),t(`LT`)),Ts(As(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Ts(As(`<=`,(e,t)=>e<=t),t(`LE`)),Ts(As(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Op=[fs(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...wp,...Dp(`Naturals`)],kp=[fs(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Tp,...Dp(`Integers`),B(`-.`,1,e=>{let t=Es(z(e,0,`-`),Sp);if(gs(-t))throw _s(`-${t}`);return-t})],Ap=(e,t,n)=>{let r=z(e,t,n),i=Bi(r);if(!i)throw new x(`${n}\n${R(r)}`);return i},jp=(e,t,n)=>{let r=z(e,t,n);return typeof r==`string`?r:Ap(e,t,n)},Mp=(e,t,n)=>{let r=z(e,t,`SubSeq`);if(typeof r!=`number`)throw ss(n,`SubSeq`,`natural number`,r);return r},Np=(e,t,n)=>typeof e==`string`?Bn(e.slice(t,n)):li(e.slice(t,n)),Pp=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Fp=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Ip=(e,t)=>{let n=cp.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ts(e,t):e}):t},Lp=e=>Ip(`Sequences`,[B(`Seq`,1,e=>({kind:`SequenceSet`,base:z(e,0,`Seq`)})),B(`Len`,1,e=>jp(e,0,Pp(``,`Len`)).length),B(`\\o`,2,e=>{let t=jp(e,0,Fp(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Ap(e,1,Fp(`t \\o s`,`sequence`));return li([...t,...n])}let n=z(e,1,`\\o`);if(typeof n!=`string`)throw new x(`${Fp(`t \\o s`,`string`)}\n${R(n)}`);return Bn(t+n)}),B(`Append`,2,t=>li([...Ap(t,0,Fp(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),z(t,1,`Append`)])),B(`Head`,1,e=>{let t=Ap(e,0,Pp(``,`Head`));if(t.length===0)throw new x(`Attempted to apply Head to the empty sequence.`);return t[0]}),B(`Tail`,1,e=>{let t=jp(e,0,Pp(``,`Tail`));if(t.length===0)throw new x(`Attempted to apply Tail to the empty sequence.`);return Np(t,1)}),B(`SubSeq`,3,e=>{let t=jp(e,0,Pp(`first `,`SubSeq`)),n=Mp(e,1,`second`),r=Mp(e,2,`third`);if(n>r)return Np(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new x(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${R(z(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Np(t,n-1,r)}),ps(`SelectSeq`,2,e=>{let t=ds(e,1,`SelectSeq`);return li(Ap(e,0,Pp(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new x(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${t.name}>`);return n}))})]),Rp=e=>Ip(`FiniteSets`,[B(`IsFiniteSet`,1,e=>Li(z(e,0,`IsFiniteSet`))),B(`Cardinality`,1,t=>{let n=z(t,0,`Cardinality`);if(!P(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new x(`Attempted to compute cardinality of the value\n${R(n)}`);return Fi(n,e)})]),zp=[Ts(B(`Warshall`,1,e=>{let t=z(e,0,`Warshall`);if(!P(t)||Un(t))throw new x(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${R(t)}`);Fi(t);let n=[],r=/* @__PURE__ */ new Map,i=e=>{let t=ka(e),i=r.get(t)??n.length;return i===n.length&&(r.set(t,i),n.push(e)),i},a=I(t).elements.map(e=>{let t=Bi(e);if(t?.length!==2)throw new x(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${R(e)}`);return[i(t[0]),i(t[1])]}),o=n.map(()=>n.map(()=>!1));a.forEach(e=>{o[e[0]][e[1]]=!0});for(let e=0;e<n.length;e++)for(let t=0;t<n.length;t++)if(o[t][e])for(let r=0;r<n.length;r++)o[e][r]&&(o[t][r]=!0);return qr(n.flatMap((e,t)=>n.flatMap((n,r)=>o[t][r]?[li([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Bp=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return zp;if(e===`AnySet`)return[fs(`ANY`,qn)];if(e===`IOUtils`)return $d(r,a);if(e===`_TLCTrace`)return nf(r);if(!fp(n.version).has(e))return;let o=Up(e,t,n,r,i);return e===`Randomization`&&o?[...o,Of(n)]:o},Vp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Hp=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Up=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Op;case`Integers`:return kp;case`Sequences`:return Lp(n.version);case`FiniteSets`:return Rp(n.version);case`TLC`:return Ip(`TLC`,tp(t,n));case`Randomization`:return kf(n);case`_Possible`:return Uf(t,n);case`Json`:return Qd(r);case`Bags`:return Ip(`Bags`,Cd(i));case`TLCExt`:return Ip(`TLCExt`,Hf(t,n));default:return}},Wp=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&yl.get(t)||[];r.expressions.push(...i,t);let a=Hi.sets,o=a??[],s=o.length;Hi.sets=o;try{return n()}catch(e){throw v_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Hi.sets=a}},Gp=(e,t,n)=>e.coverage?Bo(e.coverage,t,n):-1,Kp=(e,t,n)=>e.coverage?Ho(e.coverage,t,n):n(),qp=(e,t,n,r)=>Kp(e,t,()=>W(n,r)),Jp=(e,t,n,r)=>{let i=qp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Yp=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Xp=e=>!e.includes(void 0),Zp=e=>e.variables.map(()=>void 0),Qp=(e,t,n)=>{let r=[...e];return r[t]=n,r},$p=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},em=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,tm=e=>e.kind===`Identifier`?e.name:void 0,nm=(e,t,n)=>{if(t.kind===`Label`)return nm(e,t.body,n);let r=tm(t);if(r===void 0)return;let i=ng(n,r);if(i?.kind===`Thunk`)return nm(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=Kg(r,e);return o?.kind===`Closure`&&o.params.length===0?nm(e,o.body,o.scope):void 0},rm=(e,t,n)=>{if(t.kind===`Prime`)return nm(e,t.expression,n);if(t.kind===`Label`)return rm(e,t.body,n);let r=tm(t);if(r===void 0)return;let i=ng(n,r);if(i?.kind===`Thunk`)return rm(e,i.expression,i.scope);if(i)return;let a=Kg(r,e);return a?.kind===`Closure`&&a.params.length===0?rm(e,a.body,a.scope):void 0},im=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},am=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),om=(e,t,n,r)=>{let i=cm(e,t,n,r);return i&&e.coverage&&!e.isInit&&Vo(e.coverage,r),i},sm=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Vo(r,n),Vo(r,r.roots[n])),e.onState(t),!0},cm=(e,t,n,r)=>t===void 0?Xp(n)?sm(e,n,r):(e.onIncomplete?.(n),!1):Xp(n)&&am(e)?um(e,t,n,r):t.kind===`Predicate`?dm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?Dm(e,t.expression,t.rest,t.scope,n,t.node):lm(e,t,n)&&om(e,t.rest,n,t.node),lm=(e,t,n)=>{let r=e.environment,i=qp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return qp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?tg(t,r.runtime.version):t}})();try{return!Ur(i,a)}catch(t){throw e.callStack&&v_(e.callStack,[i],t),t}},um=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return Dm(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?lm(e,i,n):im(qp(e,i.node,i.expression,Yp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return sm(e,n,r)},dm=(e,t,n,r,i,a)=>fm(e,t,n,r,i,Gp(e,a,t)),fm=(e,t,n,r,i,a)=>Wp(e,t,()=>{switch(t.kind){case`Let`:{let o=Yp(e,r,i),s=t.definitions,c=e.coverage?l_(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):l_(s,o);return dm(e,t.body,n,c,i,a)}case`Label`:return dm(e,t.body,n,r,i,a);default:if(xm.has(t.kind))throw new y(`The state relation is not a boolean expression.`);return Wp(e,t,()=>Tm(e,t,n,r,i,a))}}),pm=(e,t,n,r,i)=>im(t)&&om(e,n,r,i),mm=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),hm=(e,t,n,r,i,a)=>{let o=Yp(e,r,i);if(t.kind===`Identifier`){let s=ng(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return dm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return dm(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:Kg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&ed(c,e.environment))?dm(e,l.body,n,l.scope,i,a):pm(e,Jp(e,a,t,o),n,i,a)}let s=qg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Kp(e,a,()=>a_(s,t.args,o));return dm(e,s.body,n,r,i,a)}let c=mm.has(t.operator)?qp(e,a,t,o):Jp(e,a,t,o);return pm(e,c,n,i,a)},gm=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?om(e,t,Qp(n,r,i),a):Ur(o,i)&&om(e,t,n,a)},_m=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),vm=(e,t,n)=>(e.coverage&&Uo(e.coverage,t,n.length+1),n),ym=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?nm(e.environment,o,r):rm(e.environment,o,r),l=Yp(e,r,i);if(c===void 0)return qp(e,a,t,l)===!0&&om(e,n,i,a);let u=qp(e,a,s,l),d=i[c];if(t.operator===`=`)return gm(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return qp(e,a,t,l)===!0&&om(e,n,i,a);if(!fi(f))throw new y(`The right side of \\IN is not enumerable.`);return vm(e,f,Di(f)).reduce((t,r)=>om(e,n,Qp(i,c,r),a)||t,!1)},bm=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),xm=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Sm={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Cm=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Sm[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${U(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${U(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${U(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`},wm=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Kp(e,r,()=>Sg(t.bounds,t=>{let r=W(t,n),i=yg(r,t,a);return Array.isArray(i)&&vm(e,r,i),i}));return wg(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},Tm=(e,t,n,r,i,a)=>{let o=Yp(e,r,i);switch(t.kind){case`Identifier`:return hm(e,t,n,r,i,a);case`Apply`:return bm.has(t.operator)&&t.args.length===2?ym(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?im(qp(e,a,t.args[0],o))?dm(e,t.args[1],n,r,i,a):om(e,n,i,a):hm(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>_m(`Predicate`,t,r,a,e),n);return dm(e,o[0],t,r,i,a)}let s=o[o.length-1];return fm(e,$p(t,o.length-1),_m(`Predicate`,s,r,a,n),r,i,em(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>dm(e,o,n,r,i,a)||t,!1);let s=fm(e,$p(t,o.length-1),n,r,i,em(e,a)),c=dm(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return wm(e,t,o,a).reduce((r,o)=>dm(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=wm(e,t,o,a);if(r.length===0)return om(e,n,i,a);let s=r.slice(1).reduce((e,n)=>_m(`Predicate`,t.body,n,a,e),n);return dm(e,t.body,s,r[0],i,a)}case`If`:return dm(e,im(qp(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>im(qp(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);return dm(e,s,n,r,i,a)}case`FunctionApplication`:{let r=Ag(qp(e,a,t.function,e.isInit?o:og(o)));if(r){let s=Kp(e,a,()=>jg(r,t,o));return dm(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return Dm(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=dm(e,t.action,n,r,i,a);return Dm(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return dm(e,t.action,_m(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?Cm(t):void 0;if(s!==void 0)throw new y(s);return pm(e,qp(e,a,t,o),n,i,a)},Em=(e,t,n)=>e.runtime.warn(St.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${U(n)}`),Dm=(e,t,n,r,i,a)=>Wp(e,t,()=>{let o=Gp(e,a,t),s=nm(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Ur(a,r)?(Em(e.environment,s,t),!1):gm(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return om(e,n,i,o);let c=s.reduceRight((e,t)=>_m(`Unchanged`,t,r,o,e),n);return Dm(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=ng(r,t.name);if(a?.kind===`Thunk`)return Dm(e,a.expression,n,a.scope,i,o);let s=a?void 0:Kg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return Dm(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Yp(e,r,i),s=qg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return Dm(e,s.body,n,a_(s,t.args,a),i,o)}let c=e.environment,l=qp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=qp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Ur(l,u)&&om(e,n,i,o)}),Om=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),km=/* @__PURE__ */ Error(`The replay found a successor`),Am=(e,t,n,r)=>{let i=Om(r,`enabled`,n,()=>{throw km}),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=_m(`Changed`,e.subscript,t,-1,void 0);dm(i,e.action,n,t,Zp(r),-1)}else dm(i,e,void 0,t,Zp(r),-1);return!1}catch(e){if(e!==km)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},jm=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Om(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>_m(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);dm(o,i.expression,s,i.scope,Zp(t),i.node??-1)},Mm=(e,t,n,r)=>{e.some(e=>xm.has(e.expression.kind))||e.forEach(e=>{let i=[];Nm(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},Nm=(e,t,n,r,i,a)=>{let o=Om(r,`next`,n,i,a);dm(o,e.expression,void 0,e.scope,Zp(r),t)},Pm=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(nm(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=ng(r,e.name)?void 0:Kg(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,l_(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){rm(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=ng(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?qg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:Kg(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,a_(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Fm=/* @__PURE__ */ new WeakMap,Im=/* @__PURE__ */ new WeakMap,Lm=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Rm=(e,t,n)=>{let r=e.slice();return r[t]=n,r},zm=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Bm=(e,t)=>{let n=new y(t);return e.isInit?n:v(n,S.error)},Vm=(e,t,n,r)=>{let i=Gh(n);return r&&xm.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${zm(e)}, TLC expected a boolean expression,\nbut instead found ${R(t)}.\n${i}`},Hm=(e,t,n)=>{let r=Cs(t),i=U(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${zm(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1781
|
+
`:``}${i}`},Um=(e,t,n)=>Km(e,t,W(t,n)),Wm=new Set(xp.map(e=>e.name)),Gm=e=>e.kind===`Apply`?Wm.has(e.operator):e.kind!==`Identifier`&&!xm.has(e.kind),Km=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;let i=Vm(e,n,t,r);throw e.isInit&&r&&Gm(t)?new ie(i):Bm(e,i)},qm=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=w_(n,r.environment))(r),Jm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ym=(e,t,n)=>{let r=n?Fm:Im,i=r.get(e);if(i)return i;let a=kh(e,t,n),o=n?void 0:Oh(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Xm=(e,t)=>{if(t.constants.has(e))return;let n=pg(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Zm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Zm(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Xm(e.name,t);if(a&&!r.has(a))return r.add(a),Zm(a.body,t,n,r)},Qm=(e,t,n)=>Zm(e,t,!n),$m=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return $m(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=l_(e.definitions,Lm(r,t,n));return $m(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ng(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return $m(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=Xm(e.name,r.environment);if(s)return $m(s.body,void 0,n,r,i)},eh=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,th=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>th(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Xm(e.name,t);if(i)return n.add(e.name),th(i.body,t,n)},nh=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),rh=(e,t,n)=>nh.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Jm(e.operator)&&(eh(e.args[0],n)||Qm(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ih=/* @__PURE__ */ new Set,ah=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Ol(e,(e,i)=>{let a=r?ah(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},oh=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||M(e)?void 0:pg(r,t);return i&&!n.has(i)&&(n.add(i),oh(i.body,t,n))?!0:mt(e).some(e=>oh(e,t,n))},sh=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Qm(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=th(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return rh(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Ym(e,t,n)}},ch=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(od(e,t)===void 0||oh(e,t,/* @__PURE__ */ new Set))return!0;let n=ah(e,ih);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},lh=(e,t,n)=>{let r=e.map(e=>sh(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=am(t);for(let s=e;s<r.length;s++){if(s>0&&f&&jh(u)){d??=Lm(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Ur(t,i[e.index])}):void 0;if(o){Em(t.environment,o.index,o.expression);return}let s=n.expression,c=qm(a,e,s,d);if(!Km(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Lm(t,n,u);let r=qm(i,s,e.expression,d);if(!Km(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Lm(t,n,u);let r=qm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Rm(u,e.index,r),d=void 0;else if(!Ur(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Ur(e,n[i.index])){Em(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},uh=e=>{let t=Cm(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Bm(n,t);Um(n,e,Lm(n,r,i))&&s(i,a)}},dh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Lm(r,i,a);if(a[l]!==void 0){Um(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!fi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${zm(r)}, the right side of \\IN is not enumerable.`;throw Bm(r,`${t}\n${U(e)}`)}let p=Di(f);if(r.generator){for(let e of bf(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Rm(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Rm(a,l,p[e]),o)}},fh=/* @__PURE__ */ new WeakMap,ph=e=>{let t=fh.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ph),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return fh.set(e,n),n},mh=(e,t)=>{let n=e.args[0],r=uh(e),i=(e,r,i)=>$m(n,r,i,e,!t)??-1,a=dh(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Lm(t,n,o));l(Rm(o,u,d),s)}},hh=(e,t,n)=>{let r=U(e);return(i,a,o,s,c,l)=>{let u=Lm(i,a,o),d=W(e.function,n?u:og(u)),f=Ag(d);if(f!==void 0){Ym(f.body,t,n)(i,jg(f,e,u),o,s,c,l);return}if(!un(d))throw Bm(i,`In computing ${zm(i)}, a non-function (${Cs(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw Bm(i,`In computing ${zm(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},gh=(e,t)=>{let n=ph(e);return th(e,t)?lh([n],t,!1):e.kind===`Tuple`?Ym(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ng(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Ym(ph(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Lm(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=qg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Ym(ph(n.body),t,!1)(r,a_(n,e.args,u),a,o,s,c);return}}Um(r,n,u)&&c(a,o)}},_h=(e,t,n)=>{let r=e.operator,i=uh(e),a=M(e)?void 0:Kg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=k_(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Ym(a.body,t,n),o(e,i(Lm(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Lm(a,o,s),f=qg(e,d);f?.kind===`Closure`?Ym(f.body,t,n)(a,a_(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},vh=(e,t,n)=>{let r=uh(e),i=M(e)?void 0:Xm(e.name,t),a;return(o,s,c,l,u,d)=>{let f=ng(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Ym(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Vg(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Ym(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},yh=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=Zm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},bh=e=>e.kind===`And`?e.operands.flatMap(bh):[e],xh=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&rh(e,t,!1),Sh=e=>{let t=[];return(n,r,i)=>{let a=Lm(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Km(n,i,qm(t,r,i,a)))return}}},Ch=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=bh(e),r=n.findIndex(e=>!xh(e,t)||yh(e,t)),i=r===-1?void 0:yh(n[r],t);return i?{...i,before:r===0?void 0:Sh(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Ch(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=Kg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Ch(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!M(o))return;let s=i.before,c=s&&k_(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Lm(e,t,n)),n))}},wh=(e,t,n)=>{let r=ng(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Th=(e,t,n)=>{let r=e.map(e=>Ym(e,t,n)),i=n?[]:e.map(e=>Ch(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&wh(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Eh=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=uf(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},Dh=(e,t)=>{let n=Ym(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Lm(r,i,a),u=t.runtime.version,d=Sg(e.bounds,e=>W(e,l)).map((n,r)=>bf(_g(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,ig(i,l,e)))};f(d.length-1,i)}},Oh=(e,t)=>{if(e.kind===`Exists`)return Dh(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Ym(e,t,!1));return e.isBulleted?Eh(n):n.reduce((e,t)=>Eh([e,t]))},kh=(e,t,n)=>{let r=e=>Ym(e,t,n);switch(e.kind){case`And`:return lh(e.operands,t,n);case`Or`:return Th(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=_g(W(a.set,Lm(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,rg(r,e,u[t]),o,s,c,l)}}let o=n?void 0:ch(e,t);if(o){let r=lh(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Lm(n,i,a),d=Sg(e.bounds,e=>_g(W(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=rg(t,o.names[e],r);if(e===d.length-1){let e=Lm(n,i,a);if(!o.guards.every(t=>Um(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Tg(e.bounds,Lm(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&od(e,t)!==void 0&&!oh(e.body,t,/* @__PURE__ */ new Set)?ah(e,ih):void 0;return(t,n,r,o,s,c)=>{let l=[];Tg(e.bounds,Lm(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ng(n,e)?.kind===`Value`)){u.every(n=>Um(t,e.body,Lm(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&jh(r)?u.slice(n).every(n=>Um(t,e.body,Lm(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,Lm(r,i,a));if(typeof l!=`boolean`)throw Bm(r,Hm(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Lm(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw Bm(r,`In computing ${zm(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Cs(t)}) was used as a guard condition of a CASE.\n${Gh(e.source)}`)})?.body??n;if(!u)throw Bm(r,`In computing ${zm(r)}, TLC encountered a CASE with no conditions true.\n${U(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=d_(e.definitions,t);return(t,r,a,o,s,c)=>n(t,l_(e.definitions,Lm(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Hh(e)}`)}:gh(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Um(e,i,Lm(e,n,r))}catch(n){throw e.isEnabled?tg(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return Th([e.action,ph(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return vh(e,t,n);case`FunctionApplication`:return hh(e,t,n);case`Apply`:{let i=e.args;if(Jm(e.operator)){let r=Qm(i[0],t,n);if(r!==void 0)return e.operator===`=`?lh([e],t,n):dh(e,()=>r);if(eh(i[0],n))return mh(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],Lm(n,r,a));if(typeof l!=`boolean`){let t=Cs(l),r=U(e);throw Bm(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return _h(e,t,n)}default:return uh(e)}},Ah=e=>e.variables.map(()=>void 0),jh=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Mh=(e,t)=>{let n=t.state;if(!n||!jh(n))throw new y(`ENABLED needs a complete state at ${Hh(e)}`);let r=t.environment;if(r.callStack)return Am(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Ym(e,r,!1)(i,t.scope,Ah(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Nh=(e,t,n,r,i)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Ym(e,t,!0)(a,r,Ah(t),void 0,!1,e=>{if(!a.isStopped){if(!jh(e)){if(i){a.isStopped=i([...e]);return}throw v(new d([...e]),S.error)}a.isStopped=n(e)}})},Ph=(e,t,n)=>{let r=[];return Nh(e,t,e=>(r.push(e),!1),n),r},Fh=(e,t,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return Ym(e,r,!1)(c,a,Ah(r),void 0,!1,(e,t)=>{if(!c.isStopped){if(!jh(e)){let i=r.variables.filter((t,n)=>e[n]===void 0);throw new n(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,e,t,i)}c.successors++,c.isStopped=i({state:e,action:t})}}),c.successors},Ih=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Ym(e,n,!1)(i,r,Ah(n),void 0,!1,e=>{jh(e)||(i.isStopped=!0)}),i.isStopped},Lh=(e,t,n,r)=>{let i=[];return Fh(e,t,n,e=>(i.push(e),!1),r),i},Rh=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),zh=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Bh=e=>zh.has(e.kind)||e.kind===`Apply`&&Rh.has(e.operator),Vh=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&ln(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Hh=e=>`line ${e.location.line}, column ${e.location.column}`,U=e=>{let t=e.location.range;return t?m(t):Hh(e)},Uh={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Wh=(e,t)=>new y(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${U(t)}`),Gh=e=>e.kind===`Number`?e.text??String(e.value):U(e),Kh=(e,t)=>new y(`A non-boolean expression (${Cs(t)}) was used as the condition of an IF.\n${U(e)}`),qh=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${Cs(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Gh(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Cs(n)}.\n${U({...e,location:{...e.location,range:{...r,end:i}}})}`)},Jh=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${N(R(n))}\n${U(e)}`,r=e=>`Attempted to apply function:\n${N(R(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!un(i))throw new y(`Attempted to select field "${t}" from a non-record value ${N(R(i))}\n${U(e)}`);let a=or(i);if(a===`tuple`)throw na(t);return ca(i.kind===`LazyFunction`?L(i):i,t,a===`record`?n:r)}},Yh=e=>e===`1.7.4`?(t,n)=>$i(t,n,e):void 0,Xh=e=>t=>{if(!un(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Cs(t)})\n${U(e)}`);return ua(t)},Zh=(e,t)=>(n,r)=>{if(!P(n)||Un(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${U(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},Qh=e=>v(new y(`TLC can't handle real numbers.\n${e.text}`),S.configParseError),$h=e=>v(new y(`TLC can't handle a number this big.\n${e.text??e.value}`),S.error),eg=(e,t)=>new u(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${U(t)}`,e),tg=(e,t)=>e instanceof u&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,ng=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},rg=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),ig=(e,t,n)=>{if(t.kind===`Name`)return rg(e,t.name,n);let r=Bi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new y(`Argument mismatch in operator application.${e?m(e):``}`)}return t.names.reduce((e,t,n)=>rg(e,t,r[n]),e)},ag=(e,t)=>{if(un(e))return e;throw new y(`A non-function (${Cs(e)}) was applied as a function.\n${U(t)}`)},og=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},sg=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),cg=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${R(e)}`);return e},lg=(e,t,n)=>{if(typeof e!=`boolean`)throw new y(`Attempted to evaluate an expression of form P => Q when ${n} was\n${Cs(e)}.\n${U(t)}`);return e},ug=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Attempted to apply the operator ~ to a non-boolean\n(${Cs(e)})\n${U(t)}`);return!e},dg=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new y(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${U(n)}`);return e===t},fg=(e,t)=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Gh(t)}`);return e},pg=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),mg=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},hg=(e,t,n)=>{if(!P(e)||Un(e)){let r=R(e),i=n===`1.7.4`?void 0:mg(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Gh(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Gh(t)}\n${i}`)}},gg=(e,t,n)=>(hg(e,t,n),typeof e==`object`&&e.kind===`Interval`?ai(e):yi(e)??Ti(e)),_g=(e,t,n)=>n===`1.7.4`?(hg(e,t,n),yi(e)??Di(e)):gg(e,t,n),vg=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Fi(e),e},yg=(e,t,n)=>vg(e)??_g(e,t,n),bg=(e,t,n)=>vg(e)??gg(e,t,n),xg=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Sg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),Cg=(e,t)=>Sg(e,e=>yg(W(e,t),e,t.environment.runtime.version)),wg=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):xg(t[n],t=>i(n-1,ig(a,e[n].pattern,t)));return i(e.length-1,n)},Tg=(e,t,n)=>wg(e,Cg(e,t),t.scope,n),Eg=(e,t)=>{let n=Sg(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Dg=(e,t,n)=>{if(e.length===1)return ig(t,e[0].pattern,n);let r=Bi(n)??[];return e.reduce((e,t,n)=>ig(e,t.pattern,r[n]),t)},Og=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,kg=e=>Object.assign(e.value,{lambda:e}),Ag=e=>Og(e)?e.lambda:void 0,jg=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:li(i),o=(e,n,i)=>`In applying the function\n${N(R(r))},\nthe ${e} is:\n${N(R(n))}${i}.\n${U(t.function)}`,s=e.bounds;if(s.length===1){if(!Gi(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Dg(s,e.scope,a)}let c=Bi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[],u=()=>new y(`In applying the function\n${N(R(r))},\nthe argument list is:\n${N(R(a))}\nwhich does not match its formal parameter.\n`);if(c===void 0||(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Gi(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1782
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Bi(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),c.length>s.length))throw u();return Dg(s,e.scope,a)},Mg=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:m(n)}},Ng=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Pg=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Fg=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Ig=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Lg=(e,t)=>{let n=Eg(e.bounds,t),r=Pg(n,(n,r)=>W(e.body,sg(t,Dg(e.bounds,rg(void 0,e.name,r),n))),Ng(Mg(e.bounds,e.body),e.bounds,n),Fg(e.bounds));kg({value:r,bounds:e.bounds,body:e.body,scope:rg(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Lg(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?sr(i):i},Rg=(e,t)=>{if(typeof t!=`object`||or(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ln(t.domain))return t;try{let e=L(t);return rr(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},zg=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new y(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>Lg(e,t):w_(Ig(e),t):w_(e.body,t),Bg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=zg(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(sg(e,void 0)):e=>a[i]??r(sg(e,void 0));return t.definitionEvaluators.set(e,o),o},Vg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Hg=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!ed(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>Rg(e,zg(e,t)(i)));Vr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof y)&&!C(e))throw e}}),Ug=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&mr(e[n],t))}catch(e){if(e instanceof y)return!1;throw e}},Wg=(e,t)=>{let n=e.cache;if(n!==void 0&&Ug(t.state,e.state)&&Ug(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?Ho(r,i,()=>W(e.expression,sg(t,e.scope))):W(e.expression,sg(t,e.scope));return(!e.isStreamed||ki(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Gg=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Kg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Kg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Gg(r):t.builtins.get(e)},qg=(e,t)=>M(e)?Jg(e.operator,t):Kg(e.operator,t.environment)??Jg(e.operator,t),Jg=(e,t)=>{let n=ng(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Kg(e,t.environment)},Yg=e=>e.kind===`Closure`?e.params.length:e.arity,Xg=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Jg(n,t);if(!r)throw new y(`Expected an operator argument at ${Hh(e)}`);return r},Zg=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>rg(e,n.name,t[r]),e.scope);return W(e.body,sg(n,r))},Qg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Yg(e),call:n=>Zg(e,n,t)},$g=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Jg(e.name,t);return n!==void 0&&Yg(n)>0},e_=(e,t)=>e.map(e=>$g(e,t)?Qg(Xg(e,t),t):W(e,t)),t_=(e,t)=>new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),n_=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),r_=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return r_(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},i_=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&mn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=n_(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:r_(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=ng(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:n_(e,t)}}return t=>n_(e,t)},a_=(e,t,n,r)=>{if(t.length!==e.params.length)throw t_(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:Xg(t[a],n)}:(r?.[a]??i_(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},o_=(e,t,n,r)=>e.kind===`Closure`?W(e.body,sg(n,a_(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(D_(t,n),n):e.evaluate(e_(t,n),n),s_=/* @__PURE__ */ new WeakMap,c_=e=>{let t=s_.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return s_.set(e,n),n},l_=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:c_(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},u_=(e,t,n)=>{let r=ng(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Wg(r,n);if(r?.kind===`Operator`){if(Yg(r.operator)===0)return Zg(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=r_(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw eg(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Bg(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${Hh(t)}`)},d_=(e,t)=>({impure:new Set(e.filter(e=>rd(e,t))),streamed:new Set(e.filter(e=>rd(e,t,`streamed`)))}),f_=e=>[...e.facts.ids.keys()].some(t=>rd(t,e)),p_=e=>[...e.facts.ids.keys()].some(t=>rd(t,e,`repeated`)),m_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,h_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),g_=e=>t=>{let n=e(t);return mr(n,e(h_(t)))},__=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Hi.sets,o=Hi.callStack,c=a??[],l=c.length;Hi.sets=c,Hi.callStack=r;try{let a=t(i),o=m_(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Bh(e)&&r.sources.set(o,e),o}catch(t){t instanceof s&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Vh(e,r.values),a=i&&!mt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!un(a)?void 0:a;throw v_(r,[o,...c.slice(l).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),c.length=l,Hi.sets=a,Hi.callStack=o}},v_=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},y_=(e,t,n)=>{if(!(n instanceof y))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},b_=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),x_=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},S_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=Bo(n,i,e);Vo(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},C_=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Z_(e,t),i=t.callStack,a=i&&yl.get(e),o=i?__(e,r,t,i):r,s=i&&a?x_(e,a,o,i):o,c=t.coverage,l=c?S_(e,s,c):s;return t.evaluators.set(e,l),l},w_=(e,t)=>{if(t.callStack||t.coverage)return C_(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=$s(e,t)??C_(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>w_(e,t.environment)(t),T_=(e,t)=>{let n=e.name,r=M(e)?void 0:r_(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw eg(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=Bg(e,t))(r)}return t=>u_(n,e,t)},E_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=Kg(e.name,t);return n===void 0||Yg(n)===0},D_=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),O_=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(D_(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&E_(t[0],n)){let e=C_(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&E_(t[0],n)&&E_(t[1],n);if(i&&a){let e=C_(t[0],n),r=C_(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(e_(t,n),n)},k_=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw t_(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:i_(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:Xg(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},A_=(e,t,n)=>{let r=k_(e,t,n),i;return t=>(i??=w_(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},j_=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=C_(n[0],t),i=C_(n[1],t);return t=>!lg(r(t),e,`P`)||lg(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=C_(n[0],t);return t=>ug(r(t),e)}if(e.operator===`<=>`){let r=C_(n[0],t),i=C_(n[1],t);return t=>dg(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Wh(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:Kg(e.operator,t);if(r?.kind===`Closure`)return A_(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=C_(n[0],t),i=Xh(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!vl.has(e)&&!sd(n[0],t);return e=>r.evaluate(D_(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=C_(n[0],t),a=C_(n[1],t),o=Zh(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return O_(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>i_(e,t));return r=>{let a=Jg(e.operator,r);if(a)return o_(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${Hh(e)}`)}},M_=(e,t)=>{let n=e.kind===`Forall`,r=C_(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=C_(i.set,t);return s=>xg(yg(o(s),i.set,t.runtime.version),t=>fg(r(sg(s,rg(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=Sg(a,e=>yg(C_(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?fg(r(sg(o,a)),e)!==n:xg(s[t],e=>c(t-1,rg(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>Tg(a,t,i=>fg(r(sg(t,i)),e)!==n)?!n:n},N_=(e,t)=>{if(e.kind===`Tuple`)return li(e.names.map(e=>{let n=ng(t,e);return n?.kind===`Value`&&n.value}));let n=ng(t,e.name);return n?.kind===`Value`?n.value:void 0},P_=/* @__PURE__ */ new WeakSet,F_=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&P_.add(e)},I_=/* @__PURE__ */ new WeakMap,L_=e=>{if(I_.has(e))return I_.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=ht(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),mt(e).every(n)},r=n(e)?[...t]:void 0;return I_.set(e,r),r},R_=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=ng(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),z_=e=>P_.has(e),B_=(e,t)=>{let n=z_(e),r=C_(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(sg(t,rg(t.scope,n,e)));if(sn(e))return Fi(e),cn(e,i),d(e,t);let o=si(e),s=rr(o,o.map(i));return ln(e)?s:(s.lambdaDomain=e,sr(s))}let n=[],s=Sg(i,e=>bg(W(e,t),e,t.environment.runtime.version));return wg(i,s,t.scope,e=>{let o=i.length===1?N_(a.pattern,e)??!1:li(i.map(t=>N_(t.pattern,e)??!1));return n.push([o,r(sg(t,e))]),!1}),Qr(n)},c=Mg(i,e.body),l=Fg(i),u=L_(e.body),d=(t,n)=>{let a=R_(n.scope,u),o=sg(n,a),s=kg({value:Pg(t,e=>r(sg(o,Dg(i,a,e))),Ng(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?sr(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!F(t))return d(t,r);if(!(i.length===1?ln(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(ln))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof y))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw y_(f,e,t),t}},createLazy:d}},V_=(e,t)=>{let n=B_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=C_(r[0].set,t);return t=>n(e(t),t)}return e=>n(Eg(r,e),e)},H_=(e,t)=>{let n=P_.has(e);n&&F_(e.function);let r=C_(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>C_(e,t))}),value:C_(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):li(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(sg(i,rg(i.scope,`@`,e))):da(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(St.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${U(e.function)}`)}return n}},U_=(e,t)=>{let n=C_(e.predicate,t),r=e.bound.pattern,i=e.predicate.location.range,a=i&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:m(i)},o=Gh(e.predicate),s=t.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=Ho(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(t,n,i,s)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Bi(e)?.length!==r.names.length)throw new y(`Attempted to check if the value:\n${N(R(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(s,t,()=>i(sg(n,ig(n.scope,r,e))));if(typeof a!=`boolean`)throw new y(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${o} yielded non-Boolean value.`);return a},source:a,rebind:r=>l(t,{...n,environment:r},C_(e.predicate,r),-1)});return(e,t,r=-1)=>l(e,t,n,r)},W_=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Cs(e)}.\n${Gh(t.predicate)}`);return e},G_=(e,t,n,r)=>{if(!P(e)||Un(e))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${U(t)}`);return Hr(e),bg(e,n,r)},K_=e=>new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${U(e)}`),q_=(e,t)=>{if(e.kind===`SetFilter`){let n=C_(e.predicate,t),r=C_(e.bound.set,t),i=U_(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!ln(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(sg(t,ig(t.scope,a,r)));W_(i,e)&&on(c,r)},u=s.kind===`Interval`?s:I(s).elements;return cn(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),nr(c)}}if(e.kind===`SetMap`){let n=C_(e.expression,t);return t=>{let r=[];return Tg(e.bounds,t,e=>(on(r,n(sg(t,e))),!1)),qr(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${U(e)}`)};let r=C_(e.body,t),i=C_(n,t);return t=>{let a=G_(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(xg(a,n=>{if(s.kind===`Tuple`&&Bi(n)?.length!==s.names.length)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${U(e)}`);let i=ig(t.scope,s,n);return fg(r(sg(t,i)),e)?(o=N_(s,i),!0):!1}),o===void 0)throw K_(e);return o}},J_=e=>[...e].sort((e,t)=>Xn(e.name,t.name)),Y_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),X_=(e,t)=>{let n=J_(e),r=Y_(n),i=n.map(e=>C_(e.value,t));if(r)return e=>ui(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>bn(a,i.map(t=>t(e)),o):e=>di(a,i.map(t=>t(e)))},Z_=(e,t)=>{let n=e=>C_(e,t);switch(e.kind){case`Number`:{let t=e.value;return mn(t)?()=>t:()=>{throw $h(e)}}case`Decimal`:return()=>{throw Qh(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return T_(e,t);case`Apply`:return j_(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Hh(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Hh(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw qh(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw qh(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return e=>t(h_(e))}case`Unchanged`:return g_(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Kh(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new y(`A non-boolean expression (${Cs(t)}) was used as a condition of a CASE. ${Gh(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${U(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(sg(n,l_(e.definitions,n)))}case`Forall`:case`Exists`:return M_(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Wh(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new y(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${U(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return q_(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>qr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>li(t.map(t=>t(e)))}case`FunctionConstruction`:return V_(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return X_(e.fields,t);case`RecordSet`:{let t=J_(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return H_(e,t);case`ExceptAt`:return t=>{let n=ng(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Hh(e)}`);return n.value};case`FunctionApplication`:{F_(e.function);let r=n(e.function),i=t=>ag(r(og(t)),e),a=e.args.map(n),o=Yh(t.runtime.version);if(a.length===1){let e=a[0];return t=>ca(i(t),e(t),o)}return e=>ca(i(e),li(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Jh(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=g_(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new y(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${U(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Mh(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Hh(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Wh(Uh[e.kind],e)}}},Q_=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},$_=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Sa(e[t]),16777619),r=Math.imul(r^Oa(e[t]),1540483477);t[0]=Q_(n)||1,t[1]=Q_(r)},ev=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},tv=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),nv=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=pa(t,Sa(e[n]));return t&1073741823},rv=(e,t)=>{for(let n=0;n<t.length;n++)if(!gr(e[n],t[n]))return!1;return!0},iv=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,av=(e,t,n)=>{let r=e.slots.length-1;for(let i=iv(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&rv(e.states[r-1],n))return r-1}},ov=(e,t,n)=>{let r=e.slots.length-1,i=iv(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},sv=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&ov(e,t[n],t[n+1])}ov(e,t,n+1)},cv=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},lv=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),uv=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return cv(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},dv=e=>Atomics.load(e.used,0)*2>=e.slots.length,fv=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&cv(t,n);return{slots:t,used:e.used}},pv={kind:`Boolean`,value:!0},mv={kind:`Boolean`,value:!1},hv=e=>e?pv:mv,gv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,_v=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,vv=(e,t)=>({kind:e,body:t}),yv=(e,t,n)=>({kind:e,operands:[t,n]}),bv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?bv(e,t.operands).operands:[t])}),xv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return xv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,xv(t)),0)}},Sv=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return Sv(e.body);case`And`:case`Or`:return e.operands.some(Sv)}},Cv=/* @__PURE__ */ new WeakMap;let wv=0;const Tv=e=>{let t=Cv.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${wv++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Tv).join(`,`)})`;default:return`${e.kind}(${Tv(e.body)})`}})();return Cv.set(e,n),n},Ev=(e,t)=>e===t||Tv(e)===Tv(t),Dv=(e,t)=>{let n=Tv(t);return e.some(e=>e===t||Tv(e)===n)},Ov=e=>e===`And`?`Or`:`And`,kv=(e,t)=>{switch(e.kind){case`Boolean`:return t?hv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?vv(`Not`,e):e;case`Not`:return kv(e.body,!t);case`And`:case`Or`:return bv(t?Ov(e.kind):e.kind,e.operands.map(e=>kv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return vv(n,kv(e.body,t))}}},Av=e=>{switch(e.kind){case`Boolean`:return hv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return bv(Ov(e.kind),e.operands.map(Av));case`Always`:return vv(`Eventually`,Av(e.body));case`Eventually`:return vv(`Always`,Av(e.body));default:return vv(`Not`,e)}},jv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=jv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return hv(t)}return n.length===0?hv(!t):n.length===1?n[0]:bv(e.kind,n)}case`Not`:{let t=jv(e.body);return t.kind===`Boolean`?hv(!t.value):vv(`Not`,t)}case`Always`:case`Eventually`:{let t=jv(e.body);return vv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Mv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Nv=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Nv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>bv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Nv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Mv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:bv(`Or`,t);n.push(vv(`Always`,vv(`Eventually`,e)))}return bv(`Or`,n)}case`Not`:return gv(e.body)?e:Nv(Av(e.body));default:return e}},Pv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Pv(e.operands[0]):bv(e.kind,e.operands.map(Pv));case`Not`:return e.body.kind===`Not`?Pv(e.body.body):vv(`Not`,Pv(e.body));case`Always`:case`Eventually`:case`Next`:return vv(e.kind,Pv(e.body));default:return e}},Fv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Fv(e.operands[0]);let t=Math.floor(e.operands.length/2);return yv(e.kind,Fv(bv(e.kind,e.operands.slice(0,t))),Fv(bv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return vv(e.kind,Fv(e.body));default:return e}},Iv=(e,t)=>{e.kind===`Eventually`&&!Dv(t,e)&&t.push(e),`body`in e&&Iv(e.body,t),`operands`in e&&e.operands.forEach(e=>Iv(e,t))},Lv=e=>{let t=e.filter(_v),n=e.flatMap(e=>e.kind===`Not`&&_v(e.body)?[e.body]:[]);return!t.some(e=>Dv(n,e))},Rv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,vv(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},zv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:vv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Bv=(e,t,n)=>e.flatMap(e=>{let r=zv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Vv=e=>[...new Set(e.map(Tv))].sort().join(`|`),Hv=(e,t)=>{let n=new Set(t.map(Vv));return[...e.filter(e=>!n.has(Vv(e))),...t]},Uv=e=>{let t=Rv(e),n=Bv(t,`Always`,`And`),r=Bv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=zv(t,`Eventually`,`Or`);if(n&&!(Dv(e,n.first)||Dv(e,n.second)))return Hv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Dv(e,t.first)||Dv(e,t.second))&&!Dv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Lv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=zv(t[e],`Always`,`And`);n&&(Dv(t,n.first)||t.push(n.first),Dv(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)Dv(t,e.first)&&Dv(t,e.second)&&!Dv(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!Lv(t)?[]:i(t)};return a(e)},Wv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>xv(e)<=1)}),Gv=e=>{let t=Uv([e]).map(Wv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Vv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Uv(n)){let n=Vv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Wv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Kv=(e,t)=>!Dv(e,t)||Dv(e,t.body),qv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&xv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Mv(e);if(n){let e=xv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Sv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Jv=(e,t)=>{let n=e.findIndex(e=>Ev(e,t));return n===-1?(e.push(t),e.length-1):n},Yv=e=>{let t=Nv(jv(kv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Pv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])qv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:bv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Ev(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Fv(e.formula),n=[];t&&Iv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Jv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Jv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Jv(i,e))}));return{tableau:t&&Gv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Xv=()=>v(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),S.livenessEvaluationFailure),Zv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Qv=/* @__PURE__ */ new WeakSet,$v=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),ey=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),ty=(e,t)=>new y(`TLC cannot handle the temporal formula ${U(e)}${t===void 0?``:`:\n${t}`}`),ny=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=ny(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=ng(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=pg(e,n);if(t)return id(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Dl(e,(e,o)=>(a=Math.max(a,ny(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(Zv.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:Kg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,a_(o,e.args,ey(n,t)))}default:return l(e)}},ry=(e,t)=>{try{return Cg(e,t)}catch(e){if(!(e instanceof y))throw e;if(!Nt(e))return;throw v(new y(`${p}${e.message}`),S.error)}},iy=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>iy(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,U(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Let`)return a(e.body,ay(e,t,n));if(e.kind===`Identifier`){let r=M(e)?ng(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,Qv.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:pg(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(id(o,n)>0||Vg(o,n)===void 0)){if(i.expanding.has(o))throw h();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=ey(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||ny(e,t,n)===3)){let t=qg(e,o),r=M(e)?void 0:pg(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,a_(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>ny(e.set,t,n)===0),c=s?ry(e.bounds,o):void 0;if(s&&c){let n=[];if(wg(e.bounds,c,t,t=>(n.push(...a(e.body,t,U(e.body))),!1)),n.length===0)throw Xv();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},ay=(e,t,n)=>{let r=l_(e.definitions,ey(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Qv.add(e.binding);return r},oy=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?ny(e,t,n):i;if(a===0){let r=W(e,ey(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${Gh(e)}`);return hv(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},a=0,o=(e,t,r,o)=>{if(a>=100)throw h();a++;let s=f(e,t);a--;let c=xv(s),l=c===0&&ny(r,o,n)>2;return c>2||l?s:i(r,o,c)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=ey(n,t),s=M(e)||pg(i,n)===void 0?ng(t,i):void 0;if(s?.kind===`Thunk`&&!s.isReleased&&Qv.has(s))return l(e,()=>o(s.expression,s.scope,e,t));let c=s?.kind===`Operator`?s.operator:s?void 0:M(e)?Jg(i,a):Kg(i,n),u=e.kind===`Apply`?e.args:[],p=c?.kind===`Builtin`&&u.length===2?$v.get(c.name):void 0;if(p){let n=u.map(e=>f(e,t));return d(e,t,bv(p,n))}if(c?.kind!==`Closure`)throw ty(e);let m=!M(e)&&pg(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(c.body,a_(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof c||n&&!r;throw!(t instanceof y)||i?t:ty(e)}},u=(e,t)=>{let r=ny(e,t,n),a=[],o=e.kind===`Forall`;try{Tg(e.bounds,ey(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof c)throw n;if(r<=2)return i(e,t,r);throw ty(e,o&&!Nt(n)?n.message:void 0)}return a.length===0?hv(o):d(e,t,bv(o?`And`:`Or`,a))},d=(e,t,n)=>{let r=xv(n);return r>2?n:i(e,t,r)},f=(e,t)=>{let a=ny(e,t,n);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,ay(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,vv(`Not`,f(n[0],t)));if(e.operator===`=>`)return d(e,t,yv(`Or`,vv(`Not`,f(n[0],t)),f(n[1],t)));break}case`And`:case`Or`:return d(e,t,bv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&ny(e.condition,t,n)===0){let r=W(e.condition,ey(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return d(e,t,yv(`Or`,yv(`And`,i,f(e.consequent,t)),yv(`And`,vv(`Not`,i),f(e.alternative,t))))}}if(a<=2)return i(e,t,a);switch(e.kind){case`Identifier`:return s(e,t);case`Apply`:return e.operator===`~>`?vv(`Always`,yv(`Or`,vv(`Not`,f(e.args[0],t)),vv(`Eventually`,f(e.args[1],t)))):s(e,t);case`Always`:case`Eventually`:return vv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=vv(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?vv(`Always`,vv(`Eventually`,yv(`Or`,i,a))):yv(`Or`,vv(`Eventually`,vv(`Always`,i)),vv(`Always`,vv(`Eventually`,a)))}default:throw ty(e)}};return f(e,t)},sy=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?W(t.expression,r):Mh(t.step,r);if(typeof i!=`boolean`)throw new y(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&Ur(W(a,{environment:e,scope:i,state:n,next:void 0}),W(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=W(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new y(`Encountered an action predicate that's not a boolean.`);return o}}),cy=(e,t,n,r,i)=>{let a=e=>cy(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return cy(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},ly=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>ly(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return cy(e,t[r],t[a(r)],sy(i),/* @__PURE__ */ new Map)}},uy=`UnnamedAction`,dy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},fy=e=>{let t=e.range??dy;return ui([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},py=(e,t)=>{let n=[[`name`,e.name],[`location`,fy(e.location)]];return e.parameters.length>0&&n.push([`context`,ui(e.parameters)],[`parameters`,li(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),ui(n)},my=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),hy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),gy=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,_y=e=>e.kind===`Apply`?e.args:[],vy=(e,t,n)=>{let r=gy(e);if(r===void 0)return;if(M(e)){let e=ng(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=Kg(r,n);return i?.kind===`Closure`?i:void 0},yy=(e,t)=>{try{return W(e,hy(t,void 0)),!0}catch(e){if(e instanceof re)return!1;throw e}},by=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&ed(e,t)&&yy(e.body,t),xy=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&by(e,t),Sy=(e,t)=>{let n=pg(e.name,t);return n?.body===e.body&&xy(n,t)},Cy=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=ng(t,e.name);return n?.kind===`Thunk`?n:void 0},wy=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:l_(e.definitions,hy(n,t))};let r=Cy(e,t);return r&&{expression:r.expression,scope:r.scope}},Ty=(e,t,n,r)=>t.kind===`Apply`?a_(e,t.args,hy(r,n)):e.scope,Ey=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ng(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Dy=(e,t)=>{try{return e()}catch(e){if(e instanceof re)return t();throw e}},Oy=(e,t,n,r,i)=>{let a=_y(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>ny(e,n,i)!==0)?o():Dy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,hy(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},ky=(e,t,n,r,a)=>{let o=()=>({name:n?.name??uy,location:e.location,parameters:Ey(n,t),expression:e,scope:t});if(xm.has(e.kind))throw v(new y(`${i}The next state relation is not a boolean expression.\n${Gh(e)}`),S.error);switch(e.kind){case`Let`:return ky(e.body,l_(e.definitions,hy(r,t)),n,r,a);case`Label`:return ky(e.body,t,n,r,a);case`Or`:return e.operands.flatMap(e=>ky(e,t,n,r,a));case`Exists`:return Dy(()=>{let i=[];return Tg(e.bounds,hy(r,t),t=>(i.push(...ky(e.body,t,n,r,a)),!1)),i.length===0?[o()]:i},()=>[o()])}let s=M(e)?void 0:a.get(gy(e)??``),c=vy(e,t,r);if(s)return Oy(s,e,t,c,r);if(!c)return[o()];let l=_y(e),u=M(e)?c.name:r.instanceNames.get(gy(e)??``)??c.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return Sy(c,r)||l.some(e=>ny(e,t,r)!==0)?d():Dy(()=>{let e=l.reduce((e,n,i)=>({name:c.params[i].name,binding:{kind:`Value`,value:W(n,hy(r,t))},parent:e}),c.scope);return ky(c.body,e,{...c,name:u},r,a)},d)},Ay=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Ay(e,t,n,r,i,o),s=(e,t,n)=>my(e,bl(t,a),n),c=wy(e,t,n);if(c){o(c.expression,c.scope);return}let l=vy(e,t,n);if(l&&Sy(l,n))return;let u=l?[...a,...yl.get(l.body)??[]]:a;if(l&&l.params.length===0){if(ny(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,a_(l,e.args,hy(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(uy,e,t));return}let d=ny(e,t,n);d<=1?r.inits.push(s(uy,e,t)):d===3&&r.temporals.push(s(uy,e,t))},jy=(e,t,n,r,i)=>{let a=(t,n)=>jy(e,t,n,r,i),o=wy(t,n,r);if(o){a(o.expression,o.scope);return}let s=vy(t,n,r);if(s&&Sy(s,r))return;if(s&&s.params.length===_y(t).length){a(s.body,Ty(s,t,n,r));return}if(t.kind===`Forall`&&Dy(()=>(Tg(t.bounds,hy(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(my(e,a)):ny(a,n,r)<2?i.invariants.push(my(e,a)):i.impliedTemporals.push(my(e,t));return}let c=ny(t,n,r);c<=1?i.impliedInits.push(my(e,t)):c===3&&i.impliedTemporals.push(my(e,t))},My=(e,t)=>{let n=pg(e,t);return n?.kind===`Operator`&&!xy(n,t)?n:void 0},Ny=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:My(e.specification,t);a&&(Ay(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:uy,location:e.frames[0].location,parameters:[],expression:bl(e.expression,e.frames),scope:e.scope}]:ky(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Kg(e.init,t);o?.kind===`Closure`&&r.inits.push(my(e.init??``,o.body));let s=e.next===void 0?void 0:Kg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...ky(s.body,s.scope,s,t,n)),r},Py=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=wy(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?ng(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=vy(e,t,n);if(!s||s.params.length!==_y(e).length)return!0;let c=pg(s.name,n);return c?.body===s.body&&by(c,n)?!0:i(s.body,Ty(s,e,t,n))};return i(e,t)?r:void 0},Fy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>R(e[1])).join(`,`)})`,Iy=(e,t,n=!1)=>`${e.name===uy?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Fy(e)} ${m(e.location.range??dy)}`,Ly=e=>`${e.name}${Fy(e)}`,Ry=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=My(e,n);t&&i.invariants.push(my(e,t.body))}),t.properties.forEach(e=>{let t=My(e,n);t&&jy(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Kr(e.map(e=>{let n=a&&t&&is(a,t,e.expression);return py(e,n&&ui(n))})),s=e=>Kr(e.flatMap(e=>{let t=My(e,n);return t?[ui([[`name`,t.name],[`location`,fy(t.location)]])]:[]}));return ui([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Kr(n.variables.map((e,t)=>ui([[`name`,e],[`location`,fy(r[t])],...a?[[`coverage`,ui([[`distinct`,Ko(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},zy=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return zy(e.body);case`And`:case`Or`:return e.operands.some(zy);default:return!1}},By=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Vy=e=>e.promises.some(e=>zy(e.body))||e.models.some(e=>!By(e)),Hy=(e,t)=>e.every((e,n)=>gr(e,t[n])),Uy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Wy=e=>({data:e(1024),length:0,create:e}),Gy=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},Ky=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},qy=e=>new Int32Array(e).fill(-1),Jy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Yy=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Xy=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Zy=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),Qy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},$y=2**53-1,eb=(e,t,n)=>{let r=t.map(e=>oy(e.expression,e.scope,n)),i=e.map(e=>vv(`Not`,oy(e.expression,e.scope,n))),a=i.length===1?i[0]:bv(`Or`,i);return{formula:r.length===0?a:bv(`And`,[...r,a]),negations:i}},tb=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},nb=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>nb(e,t));return;default:nb(e.body,t)}},rb=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>nb(e,t));return[...t]},ib=e=>rb(e).flatMap(e=>tb(e).map(e=>e.expression)),ab=(e,t,n,r)=>{if(e.length===0)return;let i=eb(e,t,n),a=/* @__PURE__ */ new Set;nb(i.formula,a);let o=[...a].flatMap(tb),s=o.every(e=>e.scope===void 0)?!nd(o.map(e=>e.expression),n,`repeated`):!p_(n),c={environment:n,atoms:sy(n)},l=Yv(i.formula),u=ob(l,{atoms:{holdsState:(e,t)=>c.atoms.holdsState(e,t),holdsAction:(e,t,n)=>c.atoms.holdsAction(e,t,n)},isShared:s,isSame:Hy,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},r,n.runtime.version!==`1.7.4`),d=(e,t)=>{if(e===void 0)return t();c.atoms=sy(e);try{return t()}finally{c.atoms=sy(n)}};return{branches:u.branches,solutions:l,addInitialState:(e,t,n)=>d(n,()=>u.addInitialState(e,t)),addState:(e,t,n,r)=>d(r,()=>u.addState(e,t,n)),findViolation:u.findViolation,getViolatedProperties:(t,r)=>[...new Set(e.filter((e,a)=>!ly(i.negations[a].body,t,r,0,n)).map(e=>e.name))]}},ob=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=Tv(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Wy(e=>new Int32Array(e)),edgeActions:Wy(e=>new Uint8Array(e)),stateResults:Wy(e=>new Uint8Array(e)),initial:[],firstNodes:Wy(qy),lastNodes:Wy(qy),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),b=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},x=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),S=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Ky(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},C=(e,t,n)=>{let r=Zy(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Ky(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],Ky(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?Gy(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Gy(e.lastNodes,t,[r]),r},w=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;Gy(e.edgeTargets,o,n),i.forEach((t,n)=>Gy(e.edgeActions,(o+n)*s,r,t*s,s)),Gy(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},ne={slots:/* @__PURE__ */ new Int32Array},T=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;ne.slots=ne.slots.length===s?ne.slots.fill(0):new Int32Array(s);let c=e=>{let r=ne.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=ne.slots.length>>1){let e=ne.slots;ne.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}ne.slots.length>s&&a++;let u=[];for(let e of ne.slots)e!==0&&u.push(o[e-1]);return u},re=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&b(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!x(e,n,a,r,s,c))continue;if(S(t,n)&&e.errorNode===void 0&&e.solution.models.some(By)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??C(e,a,n);h.push(l),f.push(0),i===void 0&&re(e,t,r,a,l,s,c)}let _=n.getSuccessors(a,r),y=new Uint8Array((_.length+1)*d);y.set(g);let ee=m(_.length);_.forEach((n,o)=>{let l=p(1);b(e,a,r,s,c,n.state,ee,o*i.size,y,(o+1)*d);let m=e.isDone[n.index]===!0;for(let r of u.successors){if(!x(e,r,a,n.state,l,0)||n.index===-1)continue;let i=te(e,n.index,r);if(i!==void 0&&h.includes(i))continue;let s=i??C(e,n.index,r);h.push(s),f.push(o+1),i===void 0&&m&&re(e,t,n.state,n.index,s,l,0)}}),h.length>0&&w(e,o,h,y,f,l)},ie=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),e.isDone[o]=!0;for(let c of Qy(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??C(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&re(e,t,i.state,i.index,p,r,a*s)}}),w(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:se(e,e.errorNode)},ae=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Zy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{Jy(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),w(e,i,a,n,o,r)},oe=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Jy(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of Yy(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Jy(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},se=(e,t)=>Uy(oe(e,t).reverse().map(t=>e.nodeStates[t])),ce=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>Jy(e,t)),c=[],l=t=>{let n=Yy(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Kv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=$y;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=$y,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>Xy(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>Yy(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=se(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&Xy(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(Yy(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_=t,c=Yy(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let b=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];b[b.length-1]!==n&&b.push(n)}let ee=c[c.length-1];return b[b.length-1]===ee&&b.pop(),{prefix:c.slice(0,-1),cycle:[ee,...b.reverse()],isCycleConstrained:Vy(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Yy(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=0;for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r,n.push(t,l,-42),c.push(l);let u=r++;Yy(e,l).forEach((t,r)=>{Jy(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)x(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??C(r,e,a))}},addState:(e,t,n)=>{let r=T(e,t,n),a=p(r.length),o=r.findIndex(t=>t.index===e)*l.size,s=m(r.length);for(let n of _){let c=n.checks.actions.length,l=new Uint8Array(r.length*c);r.forEach((r,u)=>b(n,e,t,a,o,r.state,s,u*i.size,l,u*c));let u=v(n,e,t,a,o),d=n.solution.tableau;if(!d){ae(n,r,l,u,e);continue}let f=ie(n,d,r,a,l,u,e);if(f)return f}},findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=ce(e,t);if(n)return n}}}},sb=e=>{switch(e.kind){case`Number`:if(!mn(e.value))throw v(new x(`TLC can't handle a number this big.\n${e.value}`),S.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return $n(e.name);case`Set`:return I({kind:`MixedSet`,elements:e.elements.map(sb)})}},cb=e=>{try{return sb(e)}catch(e){throw!(e instanceof y)||e instanceof x||e instanceof T?e:v(new y(`${i}${e.message}`),S.error)}},lb=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>R(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&mr(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:R(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},ub=e=>new _(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),db=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=cb(e.value);Vr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new _(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(sb),sb(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,lb(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new _(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new _(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new _(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw ub(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw ub(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new _(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new _(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let v=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),y=(e,n)=>{if(v.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&y(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=y(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=ql(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let b=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(b.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>b.includes(e))??b[0];throw new _(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},fb=`tlc2/value/impl/`,pb={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},mb={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},hb=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},gb=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),_b=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],vb=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??gb.get(e[3])}${`[]`.repeat(e[1].length)}`),yb=(e,t)=>e[e[t].first].text,bb=(e,t)=>yb(e,t).replaceAll(`/`,`.`),xb=e=>{let t=hb(e);if(t.readUint32()!==3405691582)throw new r(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],i=t.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let r=t.readUint8(),i={tag:r,text:``,value:0,first:0,second:0};n[e]=i,r===pb.utf8?i.text=a.decode(t.readBytes(t.readUint16())):r===pb.integer?i.value=t.readInt32():r===pb.float?t.readUint32():r===pb.long||r===pb.double?(t.readBytes(8),e++):r===pb.class||r===pb.string||r===pb.methodType||r===pb.module||r===pb.package?i.first=t.readUint16():r===pb.methodHandle?(t.readUint8(),i.first=t.readUint16()):(i.first=t.readUint16(),i.second=t.readUint16())}t.readUint16();let o=bb(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let s=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,a=i.indexOf(`)`),c=vb(i.slice(1,a)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:hb(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>bb(n,d.readUint16())):[],p=_b.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=vb(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:s}},Sb=(e,t)=>{let n=e[t],r=e[n.second];return{className:yb(e,n.first),name:e[r.first].text}},Cb=(e,n,r,i)=>{let a=()=>new t(`The Java override ${r}.${e.name} computes its value, which tla-ts cannot run`),o=e.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===pb.integer)return t.value;if(t.tag===pb.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=mb.iconstM1&&t<=mb.iconst5)s.push(t-mb.iconst0),e+=1;else if(t===mb.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===mb.sipush)s.push(r()<<16>>16),e+=3;else if(t===mb.ldc)s.push(l(o[e+1])),e+=2;else if(t===mb.ldcW)s.push(l(r())),e+=3;else if(t===mb.dup){let t=c();s.push(t,t),e+=1}else if(t===mb.getstatic){let t=Sb(n,r());if(t.className!==`${fb}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===mb.invokestatic){let t=Sb(n,r()),o=c();if(t.className!==`${fb}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===mb.new)s.push({className:yb(n,r()),value:void 0}),e+=3;else if(t===mb.invokespecial){let t=Sb(n,r()),o=c(),s=c();if(!(t.className===`${fb}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===mb.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},wb=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=xb(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:Cb(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},Tb=A(`EOF`),Eb=A(`IDENTIFIER`),Db=A(`DEFBREAK`),Ob=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),kb=new Set(Ob(`op_57`,`op_119`)),Ab=new Set(Ob(`op_1`,`op_119`)),jb=new Set(Ob(`op_57`,`op_70`)),Mb=/* @__PURE__ */ new Set([...Ob(`ACTION`,`EXCEPT`),A(`EXTENDS`),...Ob(`IF`,`SF`),A(`STATE`),...Ob(`THEN`,`WITH`),A(`US`),...Ob(`op_112`,`op_116`)]),Nb=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Pb=new Map([...Nb(`postfix`,160,160,!0,`[`),...Nb(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Nb(`prefix`,120,120,!1,`-.`),...Nb(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Nb(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Nb(`prefix`,40,40,!0,`\\lnot`),...Nb(`nfix`,100,130,!0,`\\times`),...Nb(`infix`,140,140,!1,`^`,`^^`),...Nb(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Nb(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Nb(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Nb(`infix`,100,110,!0,`|`,`||`,`%%`),...Nb(`infix`,100,110,!1,`%`),...Nb(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Nb(`infix`,90,140,!1,`\\wr`),...Nb(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Nb(`infix`,90,130,!1,`!!`),...Nb(`infix`,90,90,!1,`...`,`..`),...Nb(`infix`,80,80,!0,`\\intersect`,`\\union`),...Nb(`infix`,80,80,!1,`\\`),...Nb(`infix`,70,70,!1,`<:`,`:>`),...Nb(`infix`,60,60,!0,`@@`),...Nb(`infix`,50,140,!0,`\\cdot`),...Nb(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Nb(`infix`,30,30,!0,`\\land`,`\\lor`),...Nb(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Nb(`infix`,10,10,!1,`=>`)]),Fb=new Map([...Pb,...rp.flatMap(e=>e.slice(1).map(t=>[t,Pb.get(e[0])]))]),Ib=Fb.get(`[`),Lb={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Rb=e=>({type:`tokens`,kinds:new Set(e)}),zb=e=>typeof e==`string`?e.startsWith(`<`)?Rb([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(zb)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Bb=e=>(...t)=>({type:e,body:G(...t)}),q=Bb(`zeroOrMore`),Vb=Bb(`oneOrMore`),J=Bb(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),Hb=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Ub=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Hb(e,n);return n},Wb=(...e)=>{let t=e.map(A);return e=>t.includes(Ub(e,1).kind)},Gb=(e,t=Ub(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Kb=e=>{let t=Ub(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},qb=e=>Wb(`CASESEP`)(e)&&Gb(e),Jb=e=>{let t=Ub(e,1);Mb.has(t.kind)&&(t.kind=Eb)},Yb=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Xb=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Zb=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Qb=e=>e.operatorStacks[e.operatorStacks.length-1],$b=(e,t)=>e.low>t.high,ex=(e,t)=>e.high<t.low,tx=e=>e.fix===`prefix`?e:Fb.get(`${e.name}.`),nx=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Ib?Xb(`FcnAppl`,[n,...r.node.heirs]):Xb(`PostfixExpr`,[n,r.node]),operator:void 0})},rx=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Xb(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Xb(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},ix=e=>{let t=Qb(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return nx(t,n),ix(e);if(i.operator!==void 0){let t=tx(r.operator);return t!==void 0&&$b(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Yb(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Yb(e,a.node.first,a.node.last)} and expression at location ${Yb(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return ex(a.operator,r.operator)?void 0:$b(a.operator,r.operator)?(rx(t,a.operator),ix(e)):`Precedence conflict between ops ${a.operator.name} in block ${Yb(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=tx(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(ex(s,r.operator))return;if(!$b(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Yb(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return rx(t,s),ix(e);let c=Yb(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===Lb?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},ax=e=>Y(t=>{let n=Qb(t),r=Zb(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:ix(t)}),ox=ax(()=>!1),sx=ax(()=>!0),cx=Y(e=>{e.lastOperator=Fb.get(e.token.image)}),lx=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},ux=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?lx(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},dx=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Gb(e,n.first.beginColumn))return n;let t=dx(e,n);if(t!==void 0)return t}},fx=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&kb.has(e.kind),i=e.token,a=Hb(e,i);i.next=void 0;let o=Hb(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===Eb&&(e=e.next)}else if(e.kind===Eb){let t=e.next;!r(t)||jb.has(t.kind)||Ab.has(t.kind)&&t.next?.kind!==Eb||(e=t.next?.kind===A(`SUBSTITUTE`)?i:Ab.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Db&&(e.next={kind:Db,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Hb(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},px=e=>{let t=Ub(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=Hb(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===Tb)return!1;return Hb(e,t).kind===A(`IN`)}if(t.kind!==Eb)return!1;for(t=Hb(e,t);t.kind===A(`COMMA`);){if(t=Hb(e,t),t.kind!==Eb)return!1;t=Hb(e,t)}return t.kind===A(`IN`)},mx=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),hx=e=>e.proofLevels.at(-1)??-1,gx=e=>{let t=Ub(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Wb(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||hx(e)>=0&&mx(t)>hx(e):Wb(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},_x=(e,t)=>{let n=mx(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},vx=e=>Y(t=>_x(t,t.token)?void 0:`${Yb(t,t.token)}: ${e}`),yx=Rb([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),bx=Rb([...yx.kinds,A(`op_76`)]),xx=Rb(Ab),Sx=Rb(jb),Cx=Rb([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),wx=()=>q(Z({expansion:[K(yx,`<op_77>`)],semantic:Gb}),K(`PrefixOp`,`InfixOp`),sx),Tx=()=>K(G(Z({expansion:[`OpenStart`],semantic:Gb}),`OpenExpression`,ox),G(Z({semantic:Gb}),`ExtendableExpr`)),Ex=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),Dx=()=>K(G(Z({semantic:e=>Wb(`ASSUME`,`BOXASSUME`)(e)||Ub(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Ub(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Ox=()=>[`JuncItem`,q(Z({semantic:Kb}),`JuncItem`)],kx=e=>Y(t=>{t.expecting=e,Jb(t)}),Ax=e=>Y(t=>{t.isTerminalProof=e}),jx=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{fx(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Mx={CompilationUnit:Q(void 0,[Y(fx),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),kx(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,kx(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,kx(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(fx)),G(Z({semantic:e=>Wb(`USE`)(e)&&Ub(e,2).kind!==A(`ONLY`)||Wb(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(jx(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),jx(`Expression`,Z({expansion:[`<IDENTIFIER>`,Sx]}),`PostfixLHS`,`Expression`),jx(`Expression`,Z({expansion:[`<IDENTIFIER>`,xx]}),`InfixLHS`,`Expression`),jx(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),jx(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[bx,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,xx,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Sx]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,kx(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[yx,cx]),NonExpPrefixOp:Q(void 0,[bx,cx]),InfixOp:Q(`Infix Op`,[xx,cx]),PostfixOp:Q(void 0,[Sx,cx]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{fx(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),Dx(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),Dx(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=Zb(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Yb(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(fx),K(G(Z({amount:3}),Z({semantic:Wb(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:gx}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>Wb(`BY`)(e)||Ub(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Ub(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,Ax(!0),J(`<ONLY>`)),G(`<USE>`,Ax(!1),J(`<ONLY>`)),G(`<HIDE>`,Ax(!1))),X("an expression, `MODULE' or `DEF'"),J(Ex(),q(`<COMMA>`,X(`MODULE or expression`),Ex(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),Ex(),q(`<COMMA>`,X(`MODULE or expression`),Ex(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),Cx,vx(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:gx}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),Cx,vx(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:Wb(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:Wb(`INSTANCE`)}),`Instantiation`),G(Z({semantic:Wb(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:gx}),Y(e=>{let t=Zb(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Yb(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Vb(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:Wb(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(bx,xx,Sx),Rb([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:Gb}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Yb(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Gb}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:px}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Vb(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=Zb(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),Vb(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:px}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Ub(e,2).kind===A(`MAPTO`)&&Mb.has(Ub(e,1).kind)}),Y(e=>{Ub(e,1).kind=Eb}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=Xb(`FcnAppl`,t.heirs),e.lastOperator=Ib})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,Vb(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Jb),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>qb(e)&&Ub(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:qb}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[Vb(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Ub(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...Ox()),G(Z({expansion:[`<AND>`]}),...Ox())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=dx(t,e.heirs[1]);return n&&`Item at ${Yb(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Yb(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),wx(),Tx()],(e,t)=>{let n=Qb(t);n.push({node:e.heirs[0],operator:Lb});let r=ix(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),ox,q(K(G(Z({expansion:[`PostfixOp`],semantic:Gb}),`PostfixOp`,sx),G(Z({expansion:[`<DOT>`],semantic:Gb}),`<DOT>`,Y(Jb),Z({semantic:Gb}),`Identifier`,Y(e=>{let t=Qb(e);t[t.length-1].operator!==void 0&&nx(t,t.length),t[t.length-1]={node:Xb(`RecordComponent`,[t[t.length-1].node,Zb(e,2),Zb(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Gb}),X(`function argument`),`SBracketCases`,ax(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Gb}),`InfixOp`,sx,wx(),Tx()),G(Z({expansion:[`<COLONCOLON>`],semantic:Gb}),`<COLONCOLON>`,Y(e=>{let t=Qb(e);if(!ux(t[t.length-1].node))return`\`::' at ${Yb(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Qb(e),n=Zb(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!ex(r,e.lastOperator)){let t=Zb(e,3);return`Removing label at ${Yb(e,t.first,t.last)} would change expression parsing.`}t.push({node:Xb(`Label`,[Zb(e,3),Zb(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Gb}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Gb}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>hx(e)<0&&e.proofLevels.length<=1?`${Yb(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Yb(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:lx(e.heirs)===void 0?e.heirs.length===1?Xb(`GeneralId`,e.heirs):void 0:Xb(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Ub(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>Ub(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Yb(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Nx=/* @__PURE__ */ new Map,Px=e=>{let t=Nx.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Px(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,Px(Mx[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return Nx.set(e,n),n},Fx=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Ix=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Hb(e,e.scanPosition)),e.scanPosition=Hb(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},Lx=(e,t)=>{if(t.type===`tokens`)return Ix(e,t.kinds);if(t.type===`call`)return Lx(e,Mx[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Fx(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=Lx(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||Fx(e,t.semantic)?Lx(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Lx(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=Lx(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Rx=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Lx(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},zx=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||Px(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Px(a).hasSemanticStart?Px(a).first.has(Ub(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Rx(e,i,a)&&(o===void 0||o(e))}),Bx=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,Lx(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Hb(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Tb){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Hb(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${$e(e.token.image)}" `},Vx=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??Bx(e)}\n\nResidual stack trace follows:\n${r}`,!1},Hx=(e,t)=>{let n=Hb(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,Vx(e))},Ux=(e,t)=>{let n=Mx[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Ub(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Wx(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return Vx(e,i);let a=r.node??(r.heirs.length===0?void 0:Xb(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Wx=(e,t)=>{if(t.type===`tokens`)return Hx(e,t.kinds);if(t.type===`call`)return Ux(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Vx(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Vx(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Wx(e,t));if(t.type===`choice`){let n=zx(e,t.alternatives);return n===-1?Vx(e):Wx(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Wx(e,t.body))return!1;if(t.type===`optional`)return zx(e,[t.body])===-1||Wx(e,t.body);for(;zx(e,[t.body])===0;)if(!Wx(e,t.body))return!1;return!0},Gx=e=>{let t=Ze(e),n={kind:Tb,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Wx(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
1783
|
+
`)},Kx={low:15,high:15},qx={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Jx=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),Yx=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,Xx=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),Zx={low:17,high:17},Qx=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),$x=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),eS=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),tS=/* @__PURE__ */ new Set([...eS,`'`]),nS=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),rS=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),iS=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),aS=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),oS=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...tS]),sS=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),cS=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),lS=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),uS=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),dS=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),fS=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),pS=/* @__PURE__ */ new Set([``,`*`,`-`]),mS={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},hS=(e,t)=>e.line-t.line||e.column-t.column,gS=(e,t)=>({start:hS(e.start,t.start)<=0?e.start:t.start,stop:hS(e.stop,t.stop)>=0?e.stop:t.stop}),_S=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),vS={printed:``,set:``},yS={printed:`
|
|
1784
|
+
`,set:``},bS={printed:`
|
|
1785
|
+
`,set:`
|
|
1786
|
+
`},xS=(e,t,n,i=`Proof.Parser`)=>new r(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:i,printed:`${e}${n.printed}`}}),SS=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),CS=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),wS=/* @__PURE__ */ new Set([`NEW`,...CS.keys()]),TS=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),ES=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),DS=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),OS=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Jx.has(e.operator):eS.has(e.operator)),kS=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,AS=e=>Jx.has(e)||eS.has(e)||e===`-.`,jS=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},MS=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
1787
|
+
`)}\n`},NS=(e,t,n=Ee(e,t===`tlapm`))=>{let i=t===`tlapm`,a=i?n:n.map(xe),o=0,s=[],c,l,u=[],d=/* @__PURE__ */ new Set,f=[],p=[],h,g=0,_=[],v=/* @__PURE__ */ new WeakMap,y=e=>u[u.length-1].has(e),b=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],x=[],S=[],C=(e,t=o-1)=>{let n=e===t?S[e]:void 0;if(n)return n;let r=a[t];ee[e]??=b(a[e]),x[t]??={line:r.line,column:r.endColumn};let i={module:p[0].name,start:ee[e],end:x[t]};return e===t&&(S[e]=i),i},w=(e,t)=>(e.location.range=C(t),e),ne=(e=0)=>a[Math.min(o+e,a.length-1)],T=(e=0)=>{let t=ne(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},re=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie=e=>i&&(e.kind===`Keyword`||DS.has(e.text)),ae=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:fS.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ie(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,se=(e,t=ne(),n)=>{let i=a[a.length-1],o=t.line===i.line&&t.column===i.column,s=new r(`${e} at line ${t.line}, column ${t.column}`,void 0,ce(e,t,o,n));return h!==void 0&&v.set(s,h),s},ce=(e,t,n,r)=>{if(!i)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=a[_[0]-1],s=r?`Unexpected ${oe(r)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=r?ae(r):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},le=(e,t=ne())=>se(e,t,t),ue=e=>{let t={cursor:o,frame:h,restorePoints:_.length,offsideColumns:s.length,recursiveScopes:u.length},n=++g;h=n;try{let n=e();return h=t.frame,n}catch(e){if(!(e instanceof r)||v.get(e)!==n)throw e;o=t.cursor,h=t.frame,_.length=t.restorePoints,s.length=t.offsideColumns,u.length=t.recursiveScopes;return}},de=e=>{let t=h;h=void 0;let n=e();return h=t,n},pe=e=>{_.push(o);let t=e();return _.pop(),t},me=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ie(e),E=(e,t=0)=>{let n=T(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},D=()=>{let e=T();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o++,e},O=e=>E(e)?(o++,!0):!1,k=e=>{if(!E(e))throw le(`Expected ${JSON.stringify(e)} but found ${re(T())}`);return D()},he=()=>{let e=T();if(e.kind!==`Identifier`)throw le(`Expected an identifier but found ${re(e)}`);if(ie(e))throw le(`Unexpected keyword ${e.text}`);return o++,e.text},ge=()=>{let e=o;return{name:he(),range:C(e)}},_e=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ve=()=>{let e=T();return e.kind!==`String`&&(rS.has(e.text)||Jx.has(e.text)||tS.has(e.text))?(o++,e.text):he()},ye=!1,be=()=>T().kind===`Identifier`||!me(T())?he():(ye=!0,D().text),Se=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},Ce=(e,t=`,`)=>{let n=[e()];for(;O(t);)n.push(e());return n},we=(e=0)=>{if(E(`<<`,e)){let t=e+1;for(;T(t).kind===`Identifier`||E(`,`,t);)t++;return E(`>>`,t)&&E(`\\in`,t+1)}let t=e;for(;T(t).kind===`Identifier`;){if(E(`\\in`,t+1))return!0;if(!E(`,`,t+1))return!1;t+=2}return!1},Te=()=>{if(E(`::`))return!0;if(!E(`(`))return!1;let e=1;for(;T(e).kind===`Identifier`&&E(`,`,e+1);)e+=2;return T(e).kind===`Identifier`&&E(`)`,e+1)&&E(`::`,e+2)},De=()=>{if(!O(`<<`)){let e=ge();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=_e(E(`>>`)?[]:Ce(ge));return k(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Oe=()=>{let e=()=>{let e=Ce(De);k(`\\in`);let t=de(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;E(`,`)&&(!i||we(1));)D(),t.push(e());return t.flat()},ke=()=>{let e=T();if(i&&DS.has(e.text)){let t=o;D();let n={kind:`Identifier`,name:e.text,location:b(e)};return{subscript:w(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||E(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(C(o,o)),n.push(he()),e&&E(`(`)?Ne():[]),s=[a(!i)];for(;E(`!`)&&T(1).kind===`Identifier`;)D(),s.push(a(!0));let c=s.slice(0,-1),l=b(e);l.range={...C(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(E(`<<`)||E(`(`)||E(`{`)||E(`[`)||t){let e=o,t=Ue();return{subscript:t.location.range?t:w(t,e),lastArgs:[]}}throw le(`Expected a subscript but found ${re(e)}`)},A=e=>{let t=T(1),n=T(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&E(`==`,tS.has(n.text)?3:4))},Ae=e=>{let t=T(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||E(`,`,1)||E(`)`,1)||t.kind===`Keyword`&&cS.has(t.text)||A(e)},je=()=>{let e=T(),t=e.kind===`Operator`&&(Jx.has(e.text)||nS.has(e.text))&&Ae(e);if(i&&e.kind!==`String`&&(nS.has(e.text)||oS.has(e.text)&&e.text!==`'`&&!eS.has(e.text)||aS.has(e.text)&&T(-1).text===`(`&&T(-1).line===e.line&&T(-1).endColumn+1===e.column&&T(1).text===`)`&&T(1).line===e.line&&T(1).column===e.endColumn+1)&&Ae(e))throw se(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw se(`\\X may not be used as an infix operator`,e);if(t)return o++,w({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:b(e)},o-1);if(e.kind!==`String`&&oS.has(e.text)&&Ae(e)){o++;let t=b(e);if(eS.has(e.text))return w({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return w({kind:`Lambda`,params:[n.name],body:jS(e.text,n,t),operator:e.text,location:b(e)},o-1)}if(E(`LAMBDA`)){let t=o;D();let n=_e(Ce(ge));k(`:`);let r=j();return w({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:b(e)},t)}if(!i)return j();let n=ue(j);if(n)return n;throw le(`Unexpected ${re(T())}`)},Me,Ne=()=>Se(()=>{let e=o;k(`(`);let t=Ce(je);return k(`)`),Me=C(e),t}),Pe=()=>{let e=D();s.push(e.column);let t=[j()],n=()=>{for(;kS(ne())&&ne().text===e.text&&ne().column===e.column;)o++,t.push(j())};return i?de(n):n(),s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:b(e)}},Fe=e=>Se(()=>{let t=b(e),n=T().kind===`Identifier`,r=E(`|->`,1)&&(n||me(T()));if(r||n&&E(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=b(T()),i=e();return n.range=C(t),k(r?`|->`:`:`),{name:i,value:j(),location:n}},a=[i(()=>n?he():D().text),...O(`,`)?Ce(()=>i(he)):[]];return k(`]`),{kind:e,fields:a,location:t}}if(we()){let e=o,n=Oe();if(!i||E(`|->`)){k(`|->`);let e=j();return k(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=j();if(O(`->`)){let e=j();return k(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(O(`EXCEPT`)){let e=Ce(()=>{k(`!`);let e=[];for(;E(`.`)||E(`[`);)if(O(`.`)){if(!me(T()))throw le(`Expected a field name but found ${re(T())}`);if(!i&&E(`@`))throw le(`@ used in !.@`);e.push({kind:`Field`,name:D().text})}else k(`[`),e.push({kind:`Index`,args:Ce(()=>j())}),k(`]`);return k(`=`),{path:e,value:j()}});return k(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!E(`]_`)){let e=[a];for(;O(`,`);)e.push(j());return k(`]`),{kind:`Bracket`,args:e,location:t}}return k(`]_`),{kind:`BoxAction`,action:a,subscript:ke().subscript,location:t}}),Ie=()=>{let e=o,t=w(Ge(),e),n=b(D());return w({kind:`Apply`,operator:`\\in`,args:[t,de(j)],location:n},e)},Le=e=>Se(()=>{let t=b(e);if(O(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(we()&&(T(1).text===`\\in`||E(`<<`))){let e=o,n=De();k(`\\in`);let r=de(j);if(O(`:`)){let e=de(j);return k(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=T().kind===`Identifier`&&E(`\\in`,1)?Ie():j();if(O(`:`)){let e=Oe();return k(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;O(`,`);)r.push(j());return k(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Re=e=>{let t=b(e),n=Se(()=>E(`>>`)||E(`>>_`)?[]:Ce(()=>j()));if(O(`>>_`)){if(n.length!==1)throw se(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:de(ke).subscript,location:t}}return k(`>>`),{kind:`Tuple`,elements:n,location:t}},ze=e=>{let t=b(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&we()){let e=Oe();return k(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=_e(Ce(ge));return k(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Be=e=>{let t=[];do{let n=o;if(O(`OTHER`))return k(`->`),{kind:`Case`,arms:t,other:j(),otherRange:C(n),location:b(e)};let r=j();k(`->`),t.push({condition:r,body:j()})}while(O(`[]`));return{kind:`Case`,arms:t,other:void 0,location:b(e)}},Ve=()=>{let e=T(1);return E(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||sS.has(e.text)||e.kind===`Operator`&&(Jx.has(e.text)||tS.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&rS.has(e.text))},He=()=>{let e=D();if(e.kind===`Number`)return{kind:`Operand`,operand:fe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:Ne()}}return{kind:`Name`,name:e.text,args:E(`(`)?Ne():[]}},Ue=e=>{let n=o,r=D(),a=b(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=Ce(he);return k(`:`),{kind:`Lambda`,params:e,body:j(),location:a}}if(r.kind===`Number`)return{kind:`Number`,value:fe(r.text),text:r.text,location:a};if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&wt(r);if(!i&&s&&N()<0&&xt.length<=1)throw se(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw se(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let t=s?Tt(r)??r.text:r.text;if(Te()){let o=_e(O(`(`)?Ce(ge):[]);o.names.length>0&&k(`)`),k(`::`);let s=C(n),l=j();if(!i&&e!==void 0&&c!==void 0&&OS(l)&&e.high>=c.low)throw se(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:t,params:o.names,paramRanges:o.ranges,head:s,body:l,location:a}}let l=E(`(`);if(t===`@`&&!l&&!Ve())return{kind:`ExceptAt`,location:a};let u=l?Ne():[],d=[l?Me:void 0];if(!Ve())return l?{kind:`Apply`,operator:t,args:u,argumentsRange:Me,location:a}:{kind:`Identifier`,name:t,location:a};let f=[{kind:`Name`,name:t,args:u}],p=[C(n,n)];for(;Ve();)D(),p.push(C(o,o)),Me=void 0,f.push(He()),d.push(Me);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??C(n);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&AS(r.text)&&E(`(`)){let e=Ne();return t===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&AS(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=Se(()=>j());return k(`)`),e}case`[`:return Fe(r);case`{`:return Le(r);case`<<`:return Re(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return ze(r);case`IF`:{let e=j();k(`THEN`);let t=j();return k(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:a}}case`CASE`:return Be(r);case`LET`:{let e=[],t=[];for(u.push(/* @__PURE__ */ new Set);!O(`IN`);){if(i&&E(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`);if(O(`RECURSIVE`)){vt();continue}let n=ft(!i&&O(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}u.pop();let n=j();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=De(),t=O(`\\in`)?j():void 0;return k(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:a}}case`WF_`:case`SF_`:{let e=ke(),t=!E(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:Se(()=>{k(`(`);let e=j();return k(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw le(`Unexpected ${re(r)}`,r)},We=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=T(),a=tS.has(i.text)?Kx.high:Jx.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw se(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Ge=()=>{let e=l;l=void 0;let t=T(),n=b(t);if(t.kind===`Operator`&&kS(t))return Pe();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return D(),{kind:`Apply`,operator:`~`,args:[We(t,4,4)],location:n};case`-`:return D(),{kind:`Apply`,operator:`-.`,args:[We(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return D(),jS(t.text,We(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return D(),{kind:`Apply`,operator:t.text,args:[We(t,10,13)],location:n}}return Ue(e)},Ke=(e,t,n,r,i)=>{let a=b(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},qe=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:b(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:b(e)},Je=()=>{D();let e=Se(()=>Ce(()=>j()));return Se(()=>k(`]`)),e},Ye=e=>{let t=o,n=Ge(),r=n.location.range?n:w(n,t),i;for(;;){let n=T();if(n.kind!==`Operator`)break;let a=b(n);if(tS.has(n.text)&&e<=15){D(),c=Kx,r=w(qe(n,r),t);continue}if(n.text===`[`){let e=Je();c=qx,r=w({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&me(T(1))){D();let e=D().text;r=w({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=Jx.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw se(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(D(),o.low>12&&E(`-`))throw se(`Precedence conflict between ${n.text} and -`,T());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=w(Ke(n,r,s,u,C(t).end),t),i={...o,text:n.text}}return r},Xe=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&wt(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&Qx.has(e.text),Ze=(e,t)=>({start:t,end:o-1,expression:e.location.range?e:w(e,t)}),Qe=(e,t,n,r)=>({...n,start:e,end:o-1,fixity:t,isLeft:!1,apply:r}),$e=e=>e.kind===`Operator`&&tS.has(e.text)&&E(`(`,1)?ue(()=>Se(()=>{D(),D();let t=j(),n=o-1;return k(`)`),{end:n,expression:qe(e,t)}})):void 0,et=()=>{let e=0;for(let t=o+1;t<a.length;t++){let n=a[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(a[t-1].text!==`!`&&(TS.has(n.text)&&e++,ES.has(n.text)&&--e===0))return!1}}return!1},tt=e=>E(`(`,1)&&et()?ue(()=>Se(()=>{D(),D();let t=j();k(`,`);let n=j();return k(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:b(e)}})):void 0,nt=e=>{let t=o,n=T(),r=b(n),i=n.kind===`Operator`||n.kind===`Keyword`,a=i?Jx.get(n.text):void 0;if(!e){if(E(`[`)){let e=Je();return Qe(t,`Postfix`,Zx,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(E(`.`)&&me(T(1))){D();let e=D().text;return Qe(t,`Postfix`,Zx,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(a){if(tt(n)){o=t;return}return D(),{...Qe(t,`Infix`,a,e=>Ke(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,C(e[0].start,e[1].end).end)),isLeft:Yx(n.text,a),joins:n.text}}if(n.kind!==`Operator`||!tS.has(n.text))return;if($e(n)){o=t;return}return D(),Qe(t,`Postfix`,Kx,e=>qe(n,e[0].expression))}if(n.kind===`Operator`&&kS(n))return Ze(Pe(),t);let s=a?tt(n):void 0;if(s)return Ze(s,t);let c=$e(n);if(c)return c.expression.location.range=C(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?Xx.get(n.text):void 0;if(l)return D(),Qe(t,`Prefix`,l,e=>jS(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Xe(n))return;let u=n.kind===`Operator`&&$x.has(n.text);return Ze(u?Ue():de(Ue),t)},rt=e=>e!==void 0&&`fixity`in e,it=e=>e!==void 0&&!(`fixity`in e),at=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=C(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},ot=e=>{let t=e.pop(),n=e.pop();if(!it(t)||!rt(n))throw se(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(at(n,it(r)?[r,t]:[t]))},st=e=>{let t=e[e.length-2];return rt(t)?t:void 0},ct=(e,t)=>t!==void 0&&e.high<t.low,lt=()=>pe(()=>{let e=ue(()=>nt(!0));if(e===void 0){let e=ne();throw e.kind===`End`?le(`Unexpected end of expression`,e):se(`required expressions(s) missing before '${oe(e)}'`,e)}return de(()=>{let t=[e];for(;;){let e=ue(()=>nt(rt(t[t.length-1])));if(e===void 0)break;if(it(e)||e.fixity===`Prefix`){t.push(e);continue}for(;ct(e,st(t));)ot(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&it(n)){t.splice(-1,1,at(e,[n]));continue}let r=st(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!ct(r,e)&&ot(t),t.push(e)}for(;t.length>1;)ot(t);let n=t[0];if(!it(n))throw se(`incomplete expression`);return n.expression})}),j=(e=0)=>i?lt():Ye(e),ut=()=>{if(!O(`(`))return[];let e=_t();return k(`)`),e},dt=()=>{let e=b(T()),t=j(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:p[0].name,start:e,end:r}}},ft=e=>{let t=o;return w(mt(e),t)},pt=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),mt=e=>{let t=T(),n=o,r=b(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:C(n,o-2),...dt(),isLocal:e,isRecursive:y(t),location:r});if(t.kind===`Identifier`&&T(1).kind===`Operator`&&Jx.has(T(1).text)&&T(2).kind===`Identifier`&&E(`==`,3)){let e=ge(),t=D().text,n=ge();return k(`==`),i(t,[pt(e),pt(n)])}let a=t.kind!==`String`&&rS.has(t.text),s=t.kind===`Identifier`&&tS.has(T(1).text)&&E(`==`,2);if(a||s){let e=a?t.text:T(1).text;a&&D();let n=ge();return s&&D(),k(`==`),i(e,[pt(n)])}let c=he();if(O(`[`)){let t=Se(()=>Oe());return k(`]`),k(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:y(c),location:r}}let l=o,u=ut();return k(`==`),E(`INSTANCE`)?{...ht(c,u,e,r),definitionRange:C(l)}:i(c,u)},ht=(e,t,n,r)=>{let i=o;return k(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:be(),substitutions:O(`WITH`)?Ce(()=>{let e=o,t=ve(),n=C(e);return k(`<-`),{name:t,nameRange:n,expression:je()}}):[],isLocal:n,location:r,instanceRange:C(i)}},M=()=>{let e=o;return w(gt(),e)},gt=()=>{let e=b(T());if(E(`_`)&&T(1).kind===`Operator`)return D(),{name:D().text,arity:O(`_`)?2:1,location:e};if(T().kind!==`String`&&(rS.has(T().text)||i&&T().kind===`Operator`)&&E(`_`,1)){let t=D().text;return D(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=he();if(!O(`(`))return{name:t,arity:0,location:e};let n=Ce(()=>k(`_`));return k(`)`),{name:t,arity:n.length,location:e}},_t=()=>Ce(M),vt=()=>{let e=_t();return e.forEach(e=>u[u.length-1].add(e.name)),e},yt=e=>{let t=0,n=e;do{let e=T(n);if(e.kind===`End`)return n;e.kind===`Operator`&&TS.has(e.text)&&t++,e.kind===`Operator`&&ES.has(e.text)&&t--,n++}while(t>0);return n},bt=()=>{let e=T(),t=T(1);return e.kind===`Identifier`?E(`(`,1)||E(`[`,1)?E(`==`,yt(1)):t.kind===`Operator`&&tS.has(t.text)?E(`==`,2):t.kind===`Operator`&&Jx.has(t.text)?T(2).kind===`Identifier`&&E(`==`,3):E(`==`,1):e.kind!==`String`&&rS.has(e.text)&&t.kind===`Identifier`&&E(`==`,2)},xt=[],N=()=>xt[xt.length-1]??-1,St=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Ct=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},wt=e=>!e.text.endsWith(`.`)&&!pS.has(Ct(e)),Tt=e=>{let t=Ct(e);if(pS.has(t))return;let n=St(e);if(n>=0)return`<${n}>${t}`;let r=N(),i=xt[xt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},Et=e=>{if(e.kind===`Keyword`)return uS.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return xt.length===0;if(e.text[1]===`+`||xt.length===0)return!0;let t=N();return t>=0&&St(e)>t},Dt=e=>{let t=St(e),n=xt.length-1,r=xt[n-1]??-1,i=xt[n]<0;return i&&(xt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:xt[n]===t},Ot=e=>!d.has(e)&&p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),kt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!DS.has(e.name)&&!Ot(e.name):!1,At=()=>{let e=T();return e.kind===`Step`?wt(e):e.kind===`Keyword`?SS.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!bt()},jt=()=>{let e=o,t=T();return t.kind===`Operator`&&!iS.has(t.text)&&AS(t.text)?(o++,w({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:b(t)},e)):O(`MODULE`)?w({kind:`ModuleFact`,name:he(),location:b(t)},e):j()},Mt=e=>f[f.length-1]?.add(e),Nt=e=>{f.push(/* @__PURE__ */ new Set);let t=e();return f.pop(),t},Pt=e=>f.some(t=>t.has(e))||p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),Ft=()=>{let e=o,t=T(),n=Ce(()=>{let e=T();if((e.kind!==`Identifier`||ie(e))&&e.kind!==`Operator`)throw le(`Expected a definition name but found ${re(e)}`,e);return o++,e.text},`!`),r=b(t);return w(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},It=()=>{if(i)return Ce(Ft);let e=Ce(jt),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&Pt(e.name)):void 0;if(n)throw se(`DEF clause entry should describe a defined operator`,n.location);return e},Lt=()=>{let e=ue(j);if(!e)return[];let t=[e];return pe(()=>{for(;E(`,`);){let e=ue(()=>(D(),j()));if(!e)return;t.push(e)}}),t},Rt=()=>{let e=i?Lt():At()?Ce(jt):[],t=O(`DEF`)||O(`DEFS`);if(i&&e.length===0&&!t)throw le(`Expected a fact`);return{facts:e,defs:t?It():[]}},zt=()=>{let e=o,n=D(),r=n.text===`USE`&&O(`ONLY`),i=C(e),a={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...Rt(),keyword:i,location:b(n)},s=a.kind===`Hide`&&t===`tlc`?a.facts.filter(e=>!kt(e)):[];if(s.length>0)throw te(s.map(t=>({location:m(t.location.range??C(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
1788
|
+
the name of a theorem, assumption, or step.`})));return w(a,e)},Bt=()=>{let e=o,t=b(T()),n=O(`NEW`),r=i?o:e,a=i?b(T()):t,s=T().kind===`Keyword`?CS.get(T().text):void 0;if(!n&&s===void 0)throw le(`Expected a declaration but found ${re(T())}`);if(s!==void 0&&D(),s===`Variable`){let e=ge();return Mt(e.name),w({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=M();Mt(c.name);let l=(s??`Constant`)===`Constant`&&E(`\\in`);if(l&&c.arity>0)throw se(`declared symbol with arguments before \\in`);return l&&D(),w({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:a},r)},Vt=()=>{if(T().kind===`Identifier`&&E(`::`,1)&&E(`ASSUME`,2)&&(D(),D()),E(`ASSUME`))return Nt(Ut);if(T().kind===`Keyword`&&wS.has(T().text))return i?de(Bt):Bt();if(!i)return j();let e=ue(j);if(e===void 0)throw le(`Expected a hypothesis`);return e},Ht=()=>{let e=[Vt()];return pe(()=>{for(;;){let t=ue(()=>(k(`,`),Vt()));if(t===void 0)break;e.push(t)}}),e},Ut=()=>{let e=o,t=b(k(`ASSUME`)),n=()=>{let n=i?Ht():Ce(Vt);return k(`PROVE`),w({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return i?de(n):n()},Wt=e=>{let t=0;for(;T(t).kind===`Identifier`&&E(`,`,t+1);)t+=2;return T(t).kind===`Identifier`&&E(e,t+1)},Gt=(e,t)=>{e.forEach(Mt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(Mt))},Kt=()=>{let e=T();if(E(`USE`)||E(`HIDE`))return zt();if(!i&&E(`INSTANCE`)){let t=o;return w(ht(void 0,[],!1,b(e)),t)}if(E(`DEFINE`)||bt()){let t=o;O(`DEFINE`);let n=[ft(!1)];for(;bt();)n.push(ft(!1));let r={kind:`Define`,definitions:n,location:b(e)};return w(r,t)}if(O(`HAVE`))return{kind:`Have`,expression:j()};if(O(`TAKE`)){let e=we(),t=_e(e?[]:Ce(ge)),n=e?Oe():[];return Gt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(O(`WITNESS`))return{kind:`Witness`,expressions:Ce(()=>j())};if(O(`PICK`)){let e=Wt(`:`),t=_e(e?Ce(ge):[]),n=e?[]:Oe();return Gt(t.names,n),k(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return O(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:O(`SUFFICES`),statement:E(`ASSUME`)?Ut():j()}},qt=e=>{let n=T();if(n.kind!==`Step`)throw le(`Expected a step number but found ${re(n)}`,n);if(!Dt(n))throw se(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&St(n)<0&&Tt(n)!==void 0)throw se(`<*> and <+> cannot be used for a named step`,n);return o++,{name:Tt(n),token:n.text,location:b(n)}},Jt=()=>{let e=o,t=qt(E(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;f.push(r);let i=O(`QED`)?{kind:`Qed`}:Kt(),a=C(e),s=C(n),c=Et(T());if(c&&!dS.has(i.kind))throw se(`Proof of a step that does not take a proof`);let l=c?Zt():void 0;return f.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(Mt),w({...t,body:i,head:a,statement:s,proof:l},e)},Yt=e=>{if(O(`BY`)){let t=C(o-1);return{kind:`By`,isOnly:O(`ONLY`),...Rt(),keyword:t,location:e}}let t=T();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;D();let n=C(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Xt=()=>{let e=b(T());O(`PROOF`);let t=Yt(e);if(t)return t;let n=[Jt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Jt());return{kind:`Steps`,level:N(),steps:n,location:e}},Zt=()=>{let e=o;xt.push(-1);let t=Nt(Xt);return xt.pop(),w(t,e)},Qt=()=>T().kind===`Step`||T().kind===`Keyword`&&uS.has(T().text),$t=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return _S(e);let n=t.defs[t.defs.length-1]?.location.range;return gS(_S({...e,end:e.start}),_S(n??t.keyword))},en=()=>{let e=o,t=b(T()),n=O(`PROOF`),r=Yt(t);if(r){let t=w(r,e);return{kind:`Leaf`,proof:t,span:_S(t.keyword),first:e,end:o-1}}let i=T();if(i.kind!==`Step`)throw le(`Expected a step number but found ${re(i)}`);let a=o;D();let s=o,c=O(`QED`)?{kind:`Qed`}:Kt(),l=C(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:C(s),span:$t(l,c),first:e,start:a,end:o-1}},tn=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=nn(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...b(a[i.first]),range:C(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},nn=(e,t,n,r,i)=>{let a=e[t];if(!a)throw xS(`Unexpected end of (sub)proof at level ${n} before QED step`,r,bS);if(a.kind===`Leaf`)throw xS(`Expecting a proof step but found a${mS[a.proof.kind]} leaf proof`,a.span,bS);if(!i&&a.isProof)throw xS(`PROOF keyword found in step that does not begin subproof`,a.span,yS);let o=a.token.text[1];if(o===`+`&&!i)throw xS(`<+> used but no subproof expected`,a.span,yS);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:St(a.token);if(s<n||!i&&s>n)return;let c=dS.has(a.body.kind)?tn(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Tt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...b(a.token),range:C(a.start,l)}},d=gS(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=nn(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:gS(d,f.span)}},rn=()=>{if(!Qt())return;let e=[];for(;Qt();)e.push(en());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=tn(e,0,0,t.span),r=e[n.next];if(r)throw xS(`extra step(s) after finished proof`,r.span,vS,`Proof.Parser.toplevel`);return n.proof},an=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},on=()=>{if(T().kind!==`Identifier`||!E(`==`,1))return;let e=he();return d.add(e),D(),e},sn=()=>{if(!i)return j();let e=ne(),t=ue(j);if(t)return t;throw le(`Expected "====" but found ${re(e)}`,e)},cn=e=>{let t=o,n=D(),r=on(),a=Nt(()=>{let e=E(`ASSUME`)?Ut():sn();return i?{statement:e,proof:rn()}:{statement:e,proof:Et(T())?Zt():void 0}}),s=a.statement,c=w({name:r,statement:s,proof:a.proof,location:b(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&an(e,r,s,c.location)},P=()=>{let e=o,t=D(),n=on();return w({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:b(t)},e)},ln=()=>{let e=b(k(`----`));k(`MODULE`);let t=be();k(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(p.push(n),u.push(/* @__PURE__ */ new Set),O(`EXTENDS`)&&Ce(()=>{let e=o;n.extends.push(be()),n.extendsRanges.push(C(e))});;){let t=o,r=T();if(r.kind===`ModuleEnd`)return e.range={module:p[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},p.pop(),u.pop(),n;if(r.kind===`Separator`){if(E(`MODULE`,1)){let e=ln();n.modules.push(e),n.units.push({kind:`Module`,module:e}),k(`====`);continue}D()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=b(D()),r=_t();n.constants.push(...r),e.range=C(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=b(D()),r=Ce(()=>{let e=o,t=b(T());return w({name:he(),arity:0,location:t},e)});n.variables.push(...r),e.range=C(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=P();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&an(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(E(`USE`)&&E(`ONLY`,1))throw le(`Expected a module unit but found ${re(r)}`);let e=zt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=b(D()),r=vt();e.range=C(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:un(n,w(ht(void 0,[],!1,b(r)),t));continue;case`LOCAL`:if(D(),E(`INSTANCE`)){un(n,w(ht(void 0,[],!0,b(r)),t));continue}un(n,w(mt(!0),t));continue}r.kind===`Keyword`&&lS.has(r.text)?cn(n):un(n,ft(!1))}}},un=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},dn=ln(),fn=ye?Gx(e):void 0;if(fn!==void 0)throw new r(fn);return dn},PS=e=>NS(e,`tlc`),FS=(e,t)=>NS(e,`tlc`,t),IS=e=>NS(e,`tlapm`),LS=e=>NS(e,`sany`),RS=`$subexpression`,zS=(e,t)=>new r(`${e} at line ${t.line}, column ${t.column}`),BS=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return BS(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of mt(e)){let e=BS(r,t,n);if(e)return e}},VS=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),HS=(e,t)=>{let n=e.location,r=VS(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw zS(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw zS(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:RS,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:RS,args:e.args,location:n,resolution:ec},location:n}},US=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:ec})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ec}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ec};return HS({...t,params:[...t.params,...r]},a)},WS=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s,c=!1,l=(t,r)=>{if(!t)throw zS(r,i);nc.set(n,{args:e.slice(0,o).flatMap(e=>`args`in e?e.args:[]),error:{location:m(t),message:r}}),c=!0},u=n=>{let r=[],a=[];for(;o<e.length;){let s=e[o];if(s.kind!==`Name`)throw zS(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>wl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o++}throw zS(`Unknown operator ${r.join(`!`)}`,i)},d=t=>{let c=u(t),d=c.definition,f=sc(d),p=o===e.length-1;if(c.args.length!==f&&(!r||c.args.length!==0))return l(n.argumentRanges?.[o]??i.range,`The operator ${c.name} requires ${f-c.earlier} arguments.`);if(p)return{definition:d,args:c.args};if(d.kind!==`Operator`)throw zS(`Cannot select a subexpression of ${d.name}`,i);a.params.push(...d.params),a.args.push(...c.args),s=d.body,o++},f=()=>{for(;o<e.length&&!c;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],c=s&&BS(s,t.name,[]);if(!c)return l(i,`Cannot find label \`${t.name}'.`);let u=c.label.params;if(!r&&t.args.length!==u.length)return l(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),s=c.label.body,o++}},p=t=>{if(!s)throw zS(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(s.kind===`Label`){s=s.body,p(t);return}if(s.kind===`Let`){if(t.kind!==`Operand`||Oc(t.operand,1)!==0)throw zS(`A LET/IN expression has only one operand`,i);a.lets.push(s.definitions),s=s.body;return}let n=Mc(s);if(n&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...n.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),s=n.body;return}if(s.kind===`Case`&&t.kind===`Operand`){let n=[...s.arms,...s.other?[{condition:void 0,body:s.other}]:[]],r=n[Oc(t.operand,n.length)],a=e[o+1];if(!r||a?.kind!==`Operand`)throw zS(`A subexpression of CASE must have the form !i!j`,i);o++;let c=Oc(a.operand,2),l=c===0?r.condition:c===1?r.body:void 0;if(!l)throw zS(`Nonexistent CASE operand`,i);s=l;return}if(t.kind!==`Operand`)throw zS(`Unexpected subexpression selector`,i);let r=n?n.sets:Nc(s),c=r?.[Oc(t.operand,r.length)];if(!c)throw zS(`Nonexistent operand specified by the selector`,i);s=c},h=d(void 0);if(c)return n;if(h)return US(h.definition,{...a,args:h.args});for(f();o<e.length&&!c;){let t=e[o];if(t.kind===`Name`){for(;s?.kind===`Label`;)s=s.body;if(s?.kind!==`Let`)throw zS(`A name selector here must be from a LET clause`,i);a.lets.push(s.definitions);let e=d(s.definitions);if(c)return n;if(e)return US(e.definition,{...a,args:[...a.args,...e.args]});f()}else p(t),o++}if(c)return n;if(!s)throw zS(`Subexpression selection failed`,i);return HS(a,s)},GS=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return kc(e,t,n)},KS=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(KS),qS=(e,t,n,r=!1)=>{if(!KS(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Dl(e,e=>qS(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>JS(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>qS(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Dl(e,e=>qS(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?GS(a.name,[],void 0,t):a.kind===`Apply`?GS(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=WS(o,t,a,r);return c!==a&&tc.add(c),c},JS=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:qS(e.expression,t,n,!0)}))}),YS=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},XS=(e,t)=>JS(e,YS(t.definitions),()=>!1),ZS=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=YS([...t,...e.definitions]),a=e=>n.has(e),o=YS([...t,...e.definitions,...r]),s=e=>qS(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>qS(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return JS(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?JS(e,i,c):El(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>KS(e.body))||e.assumptions.some(e=>KS(e.expression))?{...h,definitions:e.definitions.map(e=>El(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},QS=(e,t)=>e.maxLevels[t]??3,$S=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Iu({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>fu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>fu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>pu(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=lu(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&fu(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Lu(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=m(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=c.argConstraints.get(su(e.name,n));i!==void 0&&QS(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),c.argParams.forEach(e=>{let n=lu(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=QS(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw te([...r.values()])}},eC=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],tC=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),nC=new Map(rp.flatMap(e=>e.map(t=>[t,e[0]]))),rC=e=>nC.get(e)??e,iC=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},aC=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),oC=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:rC(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:rC(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},sC=(e,t)=>{let n=[];for(let r=t;;){let t=oC(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},cC=e=>({line:e.line,column:e.column}),lC=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=sC(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}}return{references:s,end:e.length}};return i(0,t??``).references},uC=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,dC={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},fC=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&uC(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&uC(e[n+1],e[n+2])?n+=uC(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>dC[e])}"`:r.text)}return t},pC=e=>e[2]?.text,mC=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},hC=(e,t)=>e.find(e=>e.name===t)??e.map(e=>hC(e.modules,t)).find(Boolean),gC=e=>{let t=e===void 0?[]:Ee(e),n;return{tokens:t,ranges:mC(t),getModule:()=>n??=e===void 0?PS(``):FS(e,t)}},_C=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=gC(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??sp.get(i)??up.get(i)??MS(e,i),c=a(s),l=c.tokens,u=c.ranges.get(pC(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>hC(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},vC=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=sC(t,e+1);i.push({location:cC(t[e]),apply:e=>r.forEach(t=>e.put(aC(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:cC(n),apply:t=>t.put(aC(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&sC(t,u+1).every(e=>s.has(e))&&o(u,`definition`),tC.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(cC(n)),i.push({location:cC(n),apply:e=>e.put(aC(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(aC(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=rC(e.name);i.push({location:e.location,apply:n=>n.put(aC(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(aC(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(aC(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>oc(e.location,t.location)?-1:+!!oc(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=iC();n.set(i??``,o),np.toReversed().forEach(e=>o.put(aC(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},yC=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),ip.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=lC(a(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;fC(a(void 0)).forEach((e,t)=>{t===3&&op.forEach(r),r(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),v.set(n.unit,[...v.get(n.unit)??[],i]),!_.has(i)){if(_.add(i),e(i).tokens.length===0){let t=n.unit??pC(e(void 0).tokens);throw o(i,t)}fC(a(i)).forEach(r)}}eC.forEach(r);let b=/* @__PURE__ */ new Set,ee=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return ee(void 0),ap.forEach(r),[...n]},bC=(e,t)=>{let n=_C(e,t),r=n.getParsed,i,a=()=>i??=vC(r);return{getStringOrder:e=>yC(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},xC=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),SC=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],CC=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof r))throw n;let i=Gx(e);throw i===void 0?n:te([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,i)}},wC=e=>new r(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),TC=(e,t)=>e.location.range&&t.location.range&&{location:m(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${m(t.location.range)}.`},EC=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,DC=e=>e===`Theorem`?`ThmOrAssumpDefNode`:EC(e),OC=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Gl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),kC=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>kC(e,t))},AC=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Bl(e),n.get(e)??n.size)),n},jC=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),MC=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Qh(e);if(e.kind===`Number`&&!mn(e.value))throw $h(e);MC(e.kind===`Let`?[...mt(e),...jC(e.instances??[])]:mt(e))}),NC=(e,t)=>{let n=t.order??bC(t.source,t.loadModule),i=n.parseModule(t.source),a=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(xp.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=Af(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`,p.readLine=t.readLine;let h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,b=[],ee=/* @__PURE__ */ new Map,x=[],S=[],C=(e,t)=>x.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),w=0,ne=e=>`${e}#${w++}`,T=[],re=[],ie=$S(e=>{let t=v.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=f.get(e);if(n)return n;let r=Up(e,t.print,p,t.files,d);if(!r)return;Vp.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Hp.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:iu.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:ou(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},le=e=>{let n=Vp.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&C(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},ue=e=>(MC([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...jC(e.instances)]),e.modules.forEach(ue),e);ue(i);let de=(e,r)=>{let i=t.loadModule?.(e)??fp(p.version).get(e)??MS(t.source,e);if(i===void 0)throw o(e,r);let a=CC(i,e,n);if(a.name!==e)throw te([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return ue(a)},fe=e=>{let t=S.indexOf(e.name);if(t!==-1){let n=[...S.slice(t),e.name].map(e=>`${e}.tla`);throw new r(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,i=[],a=[],o=[];S.push(e.name),x.push(n);let s=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:re,levelChecks:o});if(x.pop(),S.pop(),a.length>0)throw te(a,!1,void 0,re);let c=i.find(e=>n.has(e.name)),l=c&&h.get(c.name),u=l&&TC(c,l.module);if(u)throw te([u],!1,void 0,re);if(c)throw wC(c);return o.forEach(e=>e()),{linked:s,closure:n}},pe=(e,n)=>{let r=h.get(e);if(r)return C(e,ee.get(e)??[]),r;let i=fe(de(e,n)),o=/* @__PURE__ */ new Map;return Bp(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new y(`No definition of ${e} to fall back to`);return W(r.body,{environment:n.environment,scope:a_(Gg(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&xC.has(e))return;let r=a.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),a.delete(n.key)}),h.set(e,i.linked),ee.set(e,i.closure),C(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let o=i?void 0:le(e.module);if(o)return E(e,o);let d=i??pe(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=SC(d),p=`#${w++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=hl(XS(e,t),f,t,n);T.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=$l({params:g,substitutions:new Map([...h].map(([e,t])=>[e,xl(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,o)=>{let u=ne(`${i}@${t.name}`),d=o(u);return a.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??i}`),s.set(u,!r),c.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return D(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},E=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),D=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},O=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),k=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=O(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Kl(r,n),location:n}}},he=(e,t,n,r)=>{let i=e.location,o=r?void 0:le(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=O(n.arity,n.params);return ql(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${w++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=SC(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};T.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>kC(f(e),p),h=d.map(t=>{let n=k(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=$l({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Kl(e.params,i),location:i,resolution:ec}:Gl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:OC(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=O(n.arity,n.params),o=[...e.params,...a];return ql(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},ge=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let r=wb(e,t.loadClass?.(e.name),e===i);_e.set(e.name,r.overrides);let o=r.module,c=T.length,l=new Map([...xp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:ul,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||m(n.range)===m(e.range))return;let r=m(e.range),i=m(n.range);DC(n.kind)===DC(e.kind)?d.warnings.push({location:r,message:`Warning: the ${EC(n.kind)} of '${t}' conflicts with \nits ${EC(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${EC(e.kind)} of '${t}' conflicts with \nits ${EC(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,y=[],ee=[...o.constants],x=o.variables.filter((e,t)=>o.variables.findIndex(t=>t.name===e.name)===t),S=x.map(e=>e.name),te=x.map(e=>e.location);o.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:le(e);if(r){p(r);return}let i=t??pe(e,o.name);ee.push(...i.constants.filter(e=>ee.every(t=>t.name!==e.name)&&!S.includes(e.name))),i.variables.forEach((e,t)=>{S.includes(e)||ee.some(t=>t.name===e)||(S.push(e),te.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),y.push(i)});let C=new Map(l),w=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],ne=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,ne(e)));let ae=e=>({key:ce(e),arity:sc(e),params:cc(e),kind:dl(o,e)?`Theorem`:`Definition`,range:e.location.range}),oe=ee.length===0&&S.length===0,ce=e=>o===i?e.name:`${e.name}@${n.id}`,ue=/* @__PURE__ */ new Map,de=()=>new Map([...n.modules,..._]),fe=e=>{let t=o.modules.find(t=>t.name===e.module);return t?oc(t.location,e.location)?_.get(t.name):void 0:de().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=fe(e),n=t?void 0:le(e.module);if(n)return{declarations:[],symbols:E(e,n),instancer:o.name};let r=t??pe(e.module,o.name),i=SC(r);return{declarations:i,symbols:D(e,r.exported,i,e=>e),instancer:o.name}},bound:C,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,instanced:ue,facts:g,reports:f,warnings:n.warnings}),k=e=>[...w.filter(t=>oc(t.location,e)).map(e=>[e.name,ne(e)]),...o.definitions.filter(t=>oc(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),ye=e=>{let t=de(),r=t.get(e.name),i=r&&TC(e,r.module);if(r&&!i)throw wC(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:k(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||_.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=me(e,o,O(o),oe,de().get(e.module));ue.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>oc(e.location,t.location)?-1:1).forEach(e=>e.link());let be=ZS(ru(o,(e,t)=>he(e,t,o.name,fe(e))),ge(l));n.errors.push(..._l(be,O(be))),be.definitions.forEach(e=>{let t=ce(e);a.set(t,e),s.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!oc(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let xe={module:be,constants:ee,variables:S,variableLocations:te,visible:l,exported:h,modules:_,extended:y,facts:/* @__PURE__ */ new Set([...g,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};v.has(o.name)||v.set(o.name,xe);let Se=T.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>Ru(be,{constants:new Set(ee.map(e=>e.name)),variables:new Set(S),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,re)),b.push(xe),xe},ye=fe(i).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=pe(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});b.push(...b.splice(b.indexOf(ye),1)),re.length>0&&!t.isSanyReported&&t.print(g(re)),ye.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(ye,/* @__PURE__ */ new Set);let Te=ye.constants.map(e=>e.name),Ee=ye.variables,De=db(e,{root:ye,moduleSymbols:new Map([...f,...[...h].map(([e,t])=>[e,t.visible]),[i.name,ye.visible]]),definitions:a,builtins:d,copySources:c,operatorConstants:new Map(Se.flatMap(e=>pe(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),Oe=De.constants,ke=De.substitutions;be!==void 0&&d.forEach((e,t)=>{let n=Ep(e);n&&d.set(t,n)});let A=AC(Ee,b.flatMap(e=>e.module.variables.map(e=>e.name))),Ae=Zu({definitions:a,substitutions:ke,constants:Oe,variableIndex:A,builtins:d,variables:Ee}),je={runtime:p,definitions:a,builtins:d,constants:Oe,substitutions:ke,instanceNames:oe,variables:Ee,variableIndex:A,facts:Ae,startupValues:Array.from({length:Ae.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Me=Iu({constants:new Set(Oe.keys()),variables:/* @__PURE__ */ new Set([...Ee,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>pg(e,je)}),Ne=e=>{try{W(e,{environment:je,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};ke.forEach((e,t)=>{let n=a.get(e),r=Te.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Me.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ne(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new _(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Pe=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Fe=n.createDefinitionOrder();return{environment:je,assumptions:Ce,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:b.filter(e=>!Pe.has(e.module.name)||SC(e).length===0).flatMap(e=>Fe(e===ye?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:b.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,rootName:i.name}},PC=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),FC=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},IC=e=>v(new y(`${i}${e}`),S.error),LC=e=>{let t=L(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!dn(e)||!dn(i))throw IC(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},RC=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${zC(t)}`:n},zC=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(zC).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${RC(e.pattern,e.set)}:${zC(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(zC).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${zC(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>RC(e.pattern,e.set)).join(`,`)}|->${zC(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(zC);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},BC=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,VC=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new _(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw IC(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!P(a)||!F(a))throw IC(`The symmetry operator must specify a set of functions.`);let o=I(a).elements;if(!o.every(un))throw IC(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=zC(BC(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(LC).forEach(e=>{e.size>0&&d.set(PC(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=FC(n,e),r=PC(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!BC(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>dn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},HC=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=WC(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(WC(e[r],t));return a}},UC=(e,t)=>{let n=[],r=[];for(let i of e){let e=WC(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Xn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Xn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},WC=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=UC(e.elements,t);return n?tr(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=L(e),r=HC(n.domain,t),i=HC(n.range,t)??n.range;if(r){let e=Qr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?rr(n.domain,e.range):e}return i===n.range?n:rr(n.domain,i)}if(n===`Interval`||!P(e)||!F(e))return e;let r=I(e),i=HC(r.elements,t);return i?Kr(i):r},GC=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=WC(e[o],i),a===0&&(a=Xn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},KC={line:0,column:0},qC=e=>({kind:`Identifier`,name:e,location:KC}),JC=e=>({name:e,expression:qC(e),scope:void 0}),YC=/* @__PURE__ */ new Set([`name`,`property`]),XC=(e,t,n)=>{let r=pg(t,n);if(!r)throw new _(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new _(YC.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},ZC=e=>e.body.kind===`Number`||e.body.kind===`String`,QC=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(ed(t,n)&&!ZC(t))try{return W(qC(e),Cw(n,void 0,void 0))}catch(e){if(e instanceof y||C(e))return;throw e}},$C=(e,t,n)=>{if(n.constants.has(t))throw new _(`The ${e} ${t} cannot be a constant.`);let r=XC(e,t,n);if(QC(t,r,n)!==void 0)throw new _(`The ${e} ${t} cannot be a constant.`);return r},ew=(e,t,n)=>{let r=n.constants.has(t)?void 0:XC(e,t,n),i=r?QC(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new _(`The ${e} of ${t} is equal to ${R(i)}`);return i===void 0?r:void 0},tw=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},nw=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Hg(e.startupDefinitions,r),t.invariants.forEach(e=>{ew(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},rw=(e,t)=>{let n=Iu({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=ew(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1763
1789
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1764
1790
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1765
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw o(new g(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),m.safetyEvaluationFailure)}return[{name:e,expression:oy(e),scope:void 0}]})},hy=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>hy(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Fu(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return hy(n.body,t)}return[e]},gy=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Vv(r,e.scope,t)>0)return!1;let i=H(r,jy(t,void 0,void 0,e.scope));if(i===!1)throw new g(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new g(`The operator ${r.name}, which equals ${I(i)},\ncannot be used as a ${n}`);return!0},_y=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return uy(n,e,t),oy(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[]}}if(e.init!==void 0||e.next!==void 0)throw new g(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],i=[],a=cy(`name`,e.specification,t),s=ly(e.specification,a,t);if(s!==void 0)throw new g(`The value of ${e.specification} is equal to ${I(s)}`);if(Uv(a.body,void 0,t,!1).forEach(a=>{let s=a.expression;if(gy(a,t,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw o(new g(`TLC does not support temporal existential, nor universal, quantification over state variables.`),m.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){r.push({expression:s.expression.action,scope:a.scope});return}if(s.kind===`Always`&&Vv(s.expression,a.scope,t)<2)throw o(new h(`TLC cannot handle the temporal formula ${B(s.expression)}`),m.error);let c=Vv(s,a.scope,t);if(c===3)i.push(a);else{if(c===2)throw new g(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(a)}}),r.length>1)throw new g(`The specification ${e.specification} must contain at most one [][Next]_vars`);let c=[...n,...r],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:n.length===0?void 0:{kind:`And`,operands:n.map(d),location:ay},next:r.length===0?void 0:d(r[0],n.length),scope:u,temporals:i}},vy=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=dy(`property`,e,t);if(!i)return;Vv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Uv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(gy(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Vv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!O(e)?Fu(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Vv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new g(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},yy=(e,t,n)=>t.flatMap(t=>dy(e,t,n)?[{name:t,expression:oy(t),scope:void 0}]:[]),by=(e,t)=>{let n=Fu(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},xy=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new g(`_POSSIBLE lists ${n} more than once`);uy(`possible`,n,t);let i=oy(n);if(Vv(i,void 0,t)===3)throw new g(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Sy=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||O(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Cy=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Fu(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},wy=(e,t)=>e.flatMap(e=>hy(e.expression,t).map(n=>{let r=e.scope===void 0?Ic(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Sy(n,r,t),predicate:Cy(e.expression,t)}})),Ty=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},Ey=/[\u0100-\uffff]/,Dy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Oy=e=>e.kind===`String`?Ey.test(e.value):e.kind===`Set`&&e.elements.some(Oy),ky=e=>e.kind===`String`&&Ey.test(e.value)||e.kind===`Apply`&&Dy.has(e.operator)||Ye(e).some(ky),Ay=(e,t)=>e.constants.some(e=>Oy(e.value)||(e.args??[]).some(Oy))||[...t.definitions.values()].some(e=>ky(e.body)||e.kind===`Function`&&e.bounds.some(e=>ky(e.set))),jy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),My=(e,t,n)=>Pu(H(e,t),n),Ny=(e,t,n=Py)=>{let r=H(e,t);if(typeof r!=`boolean`)throw new h(n(e,t.environment));return r},Py=(e,t)=>{let n=e.kind===`Identifier`?Fu(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${i&&r.kind!==`Number`?hu(i):gu(r)}`},Fy=(e,t)=>Ny(e.expression,t,(n,r)=>(Ny(e.predicate,t),Py(n,r))),Iy=()=>{},Ly=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=My(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ry=(e,t,n)=>{try{return My(e,jy(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof h)return{message:e.message};throw e}},zy=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ry(n.expression,t,`an assumption`);if(e)return{name:B(n.expression),trace:[],message:e.message}}},By=(e,t,n,r)=>{let i=my(e.invariants,t),a=_y(e,t),s=vy(e,t,r),c=wy([...i,...s.invariants],t),l=[...new Map(c.map(e=>[e.predicate,e])).values()],d=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(a.init===void 0&&(d||s.initialPredicates.length>0||t.variables.length>0))throw new g(t.runtime.version===`1.7.4`?fa:`The configuration file did not specify the initial state predicate.`);if(a.next===void 0&&d)throw new g(`The configuration file did not specify the next state predicate.`);let f=wy(yy(`constraint`,e.constraints,t),t),p=yy(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&cy(`rlreward`,e.rlReward,t),e.periodic!==void 0&&cy(`periodic`,e.periodic,t);let ee=xy(e.possible,t);if(t.variables.length===0)return;let _=e.symmetry===void 0?void 0:ey(e.symmetry,t,e.substitutions);e.view!==void 0&&cy(`view function`,e.view,t);let v=e.view===void 0?void 0:{name:e.view,expression:oy(e.view),scope:void 0},te=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:ay};return{...e,unchanged:t}}),y=e=>Vv(e.expression,void 0,t)>=2,b=ee.filter(e=>!y(e)),ne=ee.filter(y),re=t.runtime,ie={indices:void 0},ae=()=>{if(ie.indices)return ie.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ie.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),ie.indices},oe=(e,n)=>H(e,jy(t,n,void 0)),se=e=>{let t=ae(),n=_===void 0?e:iy(e,_,t);return Vm(v===void 0?t.map(e=>n[e]):[oe(v.expression,n)])},ce=/* @__PURE__ */ new WeakSet,le=(e,n,r)=>{let i=r&&!ce.has(r)?r:void 0;if(Ty(e,n,i))return!1;try{let r=jy(t,n,void 0,e.scope),a=e.membership;return i&&a?!Ar(n[a.variable],i[a.variable],H(a.set,r)):!Fy(e,r)}catch(t){throw r?Ea(o(t,m.safetyEvaluationFailure),ca.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},ue=Ay(e,t);re.getFingerprint=se;let de=()=>{let e=ee.find(e=>!re.possibleCounts.get(e.name));if(!e)return;let n=by(e.name,t),r=n?` at ${hu(n)}`:``;return{name:e.name,code:ca.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:at(I(uh(re),!0))}};return{properties:s,spec:a,isSymmetric:_!==void 0,isConstrained:f.length>0||p.length>0,getTlcOrder:ae,getStoredFingerprints:(e,t)=>v!==void 0||ue?BigInt64Array.from(e,se):Hm(t,ae()),getFingerprintState:e=>{if(ue)return[String(se(e))];let t=_===void 0?e:iy(e,_,ae());return v===void 0?t:[oe(v.expression,t)]},findViolatedInvariant:(e,t)=>{let n=c.find(n=>le(n,e,t));return n&&ce.add(e),n},getViolatedInvariants:e=>{let t=l.filter(t=>c.some(n=>n.predicate===t.predicate&&le(n,e,void 0)));return t.length>0&&ce.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Ny(n,jy(t,e,void 0,r));f.every(e=>r(e.predicate,e.scope))&&n();let i=l.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=s.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(f.every(e=>Ny(e.predicate,jy(n,t,void 0,e.scope)))&&p.every(r=>Ny(r.expression,jy(n,e,t,r.scope))))||r())||l.every(e=>Ny(e.predicate,jy(n,t,void 0,e.scope))))&&te.every(r=>Ny(r.box,jy(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>f.every(r=>Ty(r,e,n)||Fy(r,jy(t,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(n=>!Ny(n.expression,jy(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>te.find(r=>{try{return!Ny(r.action,jy(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${B(r.box)}`)&&!My(r.unchanged,jy(t,e,n,r.scope),`a subscript`)}catch(e){throw Ea(Vy(e),ca.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>p.every(r=>Ny(r.expression,jy(t,e,n),e=>`${u}${Py(e,t)}`)),trackStatePossible:b.length===0?Iy:e=>Ly(b,re,jy(t,e,void 0)),trackActionPossible:ne.length===0?Iy:(e,n)=>Ly(ne,re,jy(t,e,n)),findUnwitnessedPossible:de,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=Fu(e,t);return n!==void 0&&sd(n,t)!==void 0});if(r!==void 0){if(n)return;throw o(new h(`${u}The post condition ${r} cannot be a constant.`),m.error)}let i=de();if(i)return i;for(let n of e.postconditions){let e=Ry(oy(n),t,`a postcondition`);if(!e)continue;let r=by(n,t),i=r?` at ${hu(r)}`:``;return e.message===void 0?{name:n,code:ca.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:ca.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},Vy=e=>e instanceof n?o(e,e.exitCode):e,Hy=(e,t)=>e*((t-e)/2**64),Uy=e=>e.includes(`.`)?e:`${e}.0`,Wy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Uy(String(e));let[n,r]=e.toExponential().split(`e`);return`${Uy(n)}E${r.replace(`+`,``)}`},Gy=e=>e!==void 0&&e>=`0`&&e<=`9`,Ky=e=>{if(e===0)return`0.0`;let t=Wy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Gy(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;Gy(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Gy(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Gy(t[n.next])&&Number(t[n.next])>=5&&(n.result=qy(n.result));Gy(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},qy=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${qy(r)}.`:n===`9`?`${qy(r)}0`:`${r}${Number(n)+1}`},Jy=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},Yy=(e,t,n)=>{if(Hy(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},Xy=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Zy=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Qy=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ri(e[t]),1540483477);t[0]=Zy(n)||1,t[1]=Zy(r)},$y=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},eb=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},tb=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),nb=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return eb(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},rb=e=>Atomics.load(e.used,0)*2>=e.slots.length,ib=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&eb(t,n);return{slots:t,used:e.used}},ab=[void 0,`lambda`,`tuple`,`record`],ob=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Rr(e.domain);return t?(r(7),r(ab.indexOf(Ut(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(ab.indexOf(Ut(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},sb=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Rt(t.strings[n[r.index++]]);if(e===5)return zt(i(n[r.index++]));let a=ab[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Ht(Bt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Ht(Bt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Fu as $,dv as A,pi as At,mm as B,Ct as Bt,Kv as C,Ma as Ct,ov as D,Xn as Dt,Gv as E,Rt as Et,pg as F,Dt as Ft,gf as G,qe as Gt,ym as H,F as Ht,mh as I,Zr as It,Fd as J,w as Jt,Ed as K,Je as Kt,ph as L,A as Lt,$_ as M,Yr as Mt,z_ as N,Xr as Nt,$ as O,Nn as Ot,fg as P,Ot as Pt,hu as Q,hh as R,$t as Rt,Iv as S,Da as St,Vv as T,nn as Tt,vm as U,Ye as Ut,gm as V,Tt as Vt,Hp as W,O as Wt,H as X,_e as Xt,B as Y,me as Yt,Ku as Z,xe as Zt,uy as _,Ca as _t,ib as a,cu as at,py as b,ja as bt,Qy as c,dl as ct,Yy as d,ca as dt,Ad as et,Hy as f,la as ft,zy as g,wa as gt,By as h,xa as ht,tb as i,ou as it,Mv as j,I as jt,Fv as k,Yn as kt,Ky as l,fl as lt,oy as m,ba as mt,ob as n,Ou as nt,nb as o,su as ot,Xy as p,da as pt,wd as q,Be as qt,$y as r,dd as rt,rb as s,lu as st,sb as t,kd as tt,Jy as u,jc as ut,jy as v,_a as vt,qv as w,Hr as wt,Vy as x,va as xt,fy as y,Fa as yt,Vm as z,Xt as zt};
|
|
1791
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw v(new _(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),S.safetyEvaluationFailure)}return[JC(e)]})},iw=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>iw(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=pg(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&Vg(n,t)===void 0)return iw(n.body,t)}return[e]},aw=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||ny(r,e.scope,t)>0)return!1;let i=W(r,Cw(t,void 0,void 0,e.scope));if(i===!1)throw new _(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new _(`The operator ${r.name}, which equals ${R(i)},\ncannot be used as a ${n}`);return!0},ow=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return $C(n,e,t),qC(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new _(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):QC(e.specification,XC(`name`,e.specification,t),t);if(c!==void 0)throw new _(`The value of ${e.specification} is equal to ${R(c)}`);let l=XC(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;iy(l.body,void 0,t,!1).forEach(e=>{let c=e.expression;if(aw(e,t,`spec`))return;let l=c.kind===`Identifier`&&!M(c)?t.variableIndex.get(c.name):void 0;if(c.kind===`Identifier`&&l!==void 0){let e=n[l].range;throw new _(`The operator ${c.name}, which equals ${e?m(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw v(new _(`TLC does not support temporal existential, nor universal, quantification over state variables.`),S.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=Py(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:St.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1792
|
+
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:St.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new _(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1793
|
+
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&ny(c.expression,e.scope,t)<2)throw v(new y(`TLC cannot handle the temporal formula ${U(c.expression)}`),S.error);let f=ny(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new _(`TLC cannot handle this conjunct of the spec:\n${U(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,h=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:KC},next:o.length===0?void 0:g(o[0],a.length),scope:h,temporals:s,isPropertyFairness:s.length>0&&!d}},sw=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=ew(`property`,e,t);if(!i)return;ny(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;iy(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(aw(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&ny(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?pg(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=ny(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=U(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new _(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},cw=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},lw=(e,t,n)=>t.flatMap(t=>ew(e,t,n)?[JC(t)]:[]),uw=(e,t)=>{let n=pg(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},dw=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);$C(`possible`,n,t);let i=JC(n);if(ny(i.expression,void 0,t)===3)throw new _(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),fw=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},pw=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=pg(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},mw=(e,t)=>e.flatMap(e=>iw(e.expression,t).map(n=>{let r=e.scope===void 0?od(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:fw(n,r,t),predicate:pw(e.expression,t)}})),hw=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},gw=/[\u0100-\uffff]/,_w=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),vw=e=>e.kind===`String`?gw.test(e.value):e.kind===`Set`&&e.elements.some(vw),yw=e=>e.kind===`String`&&gw.test(e.value)||e.kind===`Apply`&&_w.has(e.operator)||mt(e).some(yw),bw=(e,t)=>e.constants.some(e=>vw(e.value)||(e.args??[]).some(vw))||[...t.definitions.values()].some(e=>yw(e.body)||e.kind===`Function`&&e.bounds.some(e=>yw(e.set))),xw=e=>{if(!un(e))return;let t=vn(L(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},Sw=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},Cw=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),ww=(e,t,n)=>cg(W(e,t),n),Tw=(e,t,n=Dw)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},Ew=(e,t,n)=>{let r=t.kind===`Identifier`?pg(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?m(a):Gh(i)}`},Dw=(e,t)=>Ew(`boolean`,e,t),Ow=(e,t)=>Tw(e.expression,t,(n,r)=>(Tw(e.predicate,t),Dw(n,r))),kw=()=>{},Aw=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=ww(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),jw=(e,t)=>{try{return e(Cw(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},Mw=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=jw(e=>fg(W(n.expression,e),n.expression),t);if(e)return{name:Gh(n.expression),trace:[],message:e.message}}},Nw=(e,t,n,r=!1)=>{let i=bC(t.source,t.loadModule);return An(i.getStringOrder(e)),Fn(t),so(t.fingerprintPolynomial??0),r&&jn(),{order:i,specification:NC(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine})}},Pw=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=Nw(t,e,e.onPrint??console.log),r=n.specification;nw(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Ny(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Ry(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:Lw(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators),getDescription:o}},Fw=(e,t,n)=>{let r=Mw(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),S.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),S.assumptionViolation},Iw=e=>v(new y(`${i}Could not find operator: ${e.operator} in module: ${e.module}`),S.error),Lw=(e,t,n,r,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw Iw(e);return{name:e.operator,key:e.key}}),c=rw(e.invariants,t),l=ow(e,t,n,r,a),u=sw(e,t,a),d=e.properties[0],f=d&&pg(d,t)?.location.range,p=e.specification,h=p&&pg(p,t)?.location.range;l.isPropertyFairness&&f&&h&&a?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${m(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${m(h)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let g=mw([...c,...u.invariants],t),b=[...new Map(g.map(e=>[e.predicate,e])).values()],ee=g.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(ee||u.initialPredicates.length>0||t.variables.length>0))throw new _(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&ee)throw new _(`The configuration file did not specify the next state predicate.`);let x=lw(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),te=mw(x,t),C=lw(`action constraint`,e.actionConstraints,t),w=t.coverage,ne=(e,n,r=!0)=>n.flatMap(n=>{if(!w)return[];let i=r?pw(n.expression,t):n.expression,a=Ao(r?n.name:void 0,i,t),o=Oo(w,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),T=[...ne(`invariant`,c),...ne(`invariant`,u.invariants,!1)],re=ne(`constraint`,C),ie=ne(`constraint`,x),ae=ne(`implied`,u.initialPredicates,!1),oe=ne(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),se=(e,n,r,i)=>{try{return Ho(e,n.node,()=>W(n.expression,Cw(t,r,i,n.scope)))}catch{return}},ce=(e,t,n)=>w!==void 0&&e.every(e=>se(w,e,t,n)===!0),le=(e,t,n)=>{if(w){for(let r of e){let e=se(w,r,t,n);if(typeof e!=`boolean`)return;if(!e)return w.primary[r.node]++,!1;w.secondary[r.node]++}return!0}};e.rlReward!==void 0&&XC(`rlreward`,e.rlReward,t),e.periodic!==void 0&&XC(`periodic`,e.periodic,t);let ue=dw(e.possible,t);if(t.variables.length===0)return;let de=e.symmetry===void 0?void 0:VC(e.symmetry,t,e.substitutions),fe=e.view===void 0?void 0:$C(`view function`,e.view,t),pe=e.view??s(`view`)[0]?.name,me=pe===void 0?void 0:JC(pe),E=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:KC};return{...e,unchanged:t}}),D=e=>ny(e.expression,void 0,t)>=2,O=ue.filter(e=>!D(e)),k=ue.filter(D),he=t.runtime,ge,_e=()=>{if(ge)return ge;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ge=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),ge},ve=(e,n)=>W(e,Cw(t,n,void 0)),ye=e=>{let t=de===void 0?e:GC(e,de,_e());return bo(me===void 0?_e().map(e=>t[e]):[ve(me.expression,t)])},be=e=>ce(ae,e)?void 0:u.initialPredicates.find(n=>!Tw(n.expression,Cw(t,e,void 0,n.scope))),xe=/* @__PURE__ */ new WeakSet,Se=(e,n,r)=>{let i=r&&!xe.has(r)?r:void 0;if(hw(e,n,i))return!1;try{let r=Cw(t,n,void 0,e.scope),a=e.membership;return i&&a?!Qi(n[a.variable],i[a.variable],W(a.set,r)):!Ow(e,r)}catch(t){throw r?Vt(v(t,S.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},Ce=bw(e,t);he.getFingerprint=ye;let we=()=>{let e=ue.find(e=>!he.possibleCounts.get(e.name));if(!e)return;let n=uw(e.name,t),r=n?` at ${m(n)}`:``;return{name:e.name,code:St.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:N(R(jf(he),!0))}},Te=fe?.body.kind===`Tuple`?fe.body.elements:[],Ee=Te.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),De=fe?.body.kind===`Tuple`&&Ee.length===Te.length&&new Set(Ee).size===Ee.length,Oe=(e,n)=>De?_e().filter(e=>Ee.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(R(n[e]))}\n`).join(``):N(R(ve(e,n))),ke=(e,n,r)=>Tw(e.expression,Cw(t,n,r),e=>`${i}${Dw(e,t)}`),A=e=>{let n=Object.fromEntries(_e().map(n=>[t.variables[n],e[n]]));return me===void 0?n:Ln(n,()=>Oe(me.expression,e))};return he.toRecord=A,{properties:u,spec:l,toRecord:A,evaluateAlias:(e,n,r,i)=>{try{$C(`alias`,e,t);let i=W(qC(e),Cw(t,n,r)),a=xw(i);return a===void 0?A(n):zn(a,e)}catch(e){if(!(e instanceof _||e instanceof y))throw e;return{...A(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:de!==void 0,isConstrained:te.length>0||C.length>0,getTypedChecks:n=>{if(w!==void 0||ue.length>0||e.periodic!==void 0||[...g,...te].some(e=>e.scope!==void 0)||C.length>0||u.actionProperties.some(e=>e.scope!==void 0)||u.liveness.length>0&&(n===void 0||me!==void 0)||l.init===void 0||l.next===void 0)return;let r=b.map(e=>e.predicate),i=[...new Set(te.map(e=>e.predicate))],a=u.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=cw(l.scope),c=e=>Vg(e,t)===void 0&&rd(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&ed(e,t)&&c(e))||nd([l.init,l.next,...r,...i,...a,...u.actionProperties.flatMap(e=>[e.action,e.subscript]),...me?[me.expression]:[],...s,...ib(n??[])],t,`replayed`))?void 0:{init:l.init,next:l.next,scope:l.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>be(e)===void 0,actionProperties:u.actionProperties,symmetry:de,view:me?.expression,variableOrder:_e(),liveness:n}},getTlcOrder:_e,getStoredFingerprints:(e,t)=>me!==void 0||Ce?BigInt64Array.from(e,ye):So(t,_e()),getFingerprintState:e=>{if(Ce)return[String(ye(e))];let t=de===void 0?e:GC(e,de,_e());return me===void 0?t:[ve(me.expression,t)]},findViolatedInvariant:(e,t)=>{if(ce(T,e))return;let n=g.find(n=>Se(n,e,t));return n&&xe.add(e),n},getViolatedInvariants:e=>{let t=b.filter(t=>g.some(n=>n.predicate===t.predicate&&Se(n,e,void 0)));return t.length>0&&xe.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Tw(n,Cw(t,e,void 0,r));te.every(e=>r(e.predicate,e.scope))&&n();let i=b.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>Tw(e.predicate,Cw(n,t,void 0,e.scope)))&&C.every(r=>Tw(r.expression,Cw(n,e,t,r.scope))))||r())||b.every(e=>Tw(e.predicate,Cw(n,t,void 0,e.scope))))&&E.every(r=>Tw(r.box,Cw(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>le(ie,e)??te.every(r=>hw(r,e,n)||Ow(r,Cw(t,e,void 0))),findFailedInitialPredicate:be,findViolatedActionProperty:(e,n)=>ce(oe,e,n)?void 0:E.find(r=>{try{return!Tw(r.action,Cw(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${U(r.box)}`)&&!ww(r.unchanged,Cw(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(Rw(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>le(re,e,t)??C.every(n=>ke(n,e,t)),getExcludingConstraints:(e,n)=>[...te.filter(e=>!Ow(e,Cw(t,n,void 0))),...C.filter(t=>!ke(t,e,n))].map(e=>{let n=uw(e.name,t);return n?m(n):e.name}),trackStatePossible:O.length===0?kw:e=>Aw(O,he,Cw(t,e,void 0)),trackActionPossible:k.length===0?kw:(e,n)=>Aw(k,he,Cw(t,e,n)),findUnwitnessedPossible:we,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=qC(e.rlReward),o=W(a,Cw(t,n,r));if(typeof o!=`number`)throw new y(Ew(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=pg(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!ZC(n)&&Vg(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw v(new y(i),S.configParseError)}let a=(e,n)=>{let r=jw(e=>Tw(qC(n),e),t);if(!r)return;let i=pg(n,t)?.body,a=uw(n,t),o=a?` at ${i?.kind===`Number`?Gh(i):m(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=we();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},Rw=e=>e instanceof x?v(e,e.exitCode):e,zw=(e,t)=>e*((t-e)/2**64),Bw=e=>e.includes(`.`)?e:`${e}.0`,Vw=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Bw(String(e));let[n,r]=e.toExponential().split(`e`);return`${Bw(n)}E${r.replace(`+`,``)}`},Hw=e=>e!==void 0&&e>=`0`&&e<=`9`,Uw=e=>{if(e===0)return`0.0`;let t=Vw(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;Hw(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;Hw(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;Hw(t[n])&&r<2;)i+=t[n++],r++;for(Hw(t[n])&&Number(t[n])>=5&&(i=Ww(i));Hw(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},Ww=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ww(r)}.`:n===`9`?`${Ww(r)}0`:`${r}${Number(n)+1}`},Gw=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},Kw=(e,t,n)=>{if(zw(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},qw=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Jw=[void 0,`lambda`,`tuple`,`record`],Yw=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=la(e.domain);return t?(a(7),a(Jw.indexOf(or(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(Jw.indexOf(or(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},Xw=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return $n(t.strings[n[r++]]);if(e===5)return tr(i(n[r++]));let a=Jw[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=si({kind:`Interval`,low:e,high:e+t-1});return ar(rr(o,i(t)),a)}let o=n[r++],s=i(o);return ar(rr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Fh as $,I as $t,Ny as A,$t as At,uv as B,li as Bt,IS as C,Ao as Ct,rb as D,ho as Dt,ab as E,go as Et,lv as F,ui as Ft,b_ as G,rn as Gt,dv as H,R as Ht,tv as I,Kr as It,r_ as J,Di as Jt,U as K,er as Kt,av as L,rr as Lt,py as M,yr as Mt,Xv as N,Qr as Nt,Iy as O,uo as Ot,ev as P,$n as Pt,Nh as Q,pr as Qt,nv as R,di as Rt,LS as S,To as St,ob as T,mo as Tt,sv as U,ba as Ut,rv as V,Wa as Vt,$_ as W,xa as Wt,Vg as X,F as Xt,pg as Y,Mn as Yt,f_ as Z,gr as Zt,nw as _,tt as _n,nd as _t,Kw as a,zt as an,jm as at,MS as b,Ee as bn,Ro as bt,Nw as c,Zt as cn,dp as ct,Mw as d,Ht as dn,rp as dt,St as en,Ph as et,Cw as f,Jt as fn,Nf as ft,tw as g,ft as gn,ed as gt,Fw as h,mt as hn,uf as ht,Gw as i,It as in,Pm as it,Ry as j,Xn as jt,Ly as k,bo as kt,Iw as l,qt as ln,up as lt,Pw as m,gt as mn,of as mt,Yw as n,Et as nn,oh as nt,zw as o,Rt as on,Mm as ot,Sw as p,Lt as pn,If as pt,W as q,nn as qt,Uw as r,Ft as rn,Ih as rt,qw as s,Mt as sn,Nm as st,Xw as t,Ct as tn,Lh as tt,Lw as u,Nt as un,fp as ut,Rw as v,Ke as vn,oc as vt,Gx as w,rs as wt,PS as x,Go as xt,WC as y,xe as yn,Oo as yt,fv as z,tr as zt};
|