tla-ts 0.0.4-dev.fa107ef → 0.0.5-dev.cc59f31
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 +37 -126
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +44 -12
- package/dist/index.d.ts +44 -12
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +1006 -0
- package/dist/prove.js +1006 -0
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +76 -92
- package/dist/transfer.js +76 -92
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/ast.ts +2 -2
- package/src/bags.ts +22 -23
- package/src/builtins.ts +16 -8
- package/src/check.ts +131 -1153
- package/src/{cli-options.ts → cli/options.ts} +54 -9
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/{run-cli.ts → cli/tlc.ts} +115 -721
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +1 -1
- package/src/codegen.ts +43 -22
- package/src/config.ts +5 -5
- package/src/dependencies.ts +4 -6
- package/src/environment.ts +55 -60
- package/src/errors.ts +97 -35
- package/src/evaluate.ts +135 -120
- package/src/exit-codes.ts +1 -1
- package/src/fingerprints.ts +3 -3
- package/src/index.ts +10 -0
- package/src/instances.ts +56 -46
- package/src/java-overrides.ts +79 -41
- package/src/json.ts +31 -36
- package/src/levels.ts +10 -13
- package/src/{live-check.ts → liveness-checker.ts} +169 -142
- package/src/liveness.ts +38 -34
- package/src/{obligation-action.ts → obligations/action.ts} +248 -74
- package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +618 -0
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/obligations/generate.ts +457 -0
- package/src/{obligations.ts → obligations/index.ts} +46 -32
- package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
- package/src/obligations/module.ts +445 -0
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +195 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/obligations/regroup.ts +100 -0
- package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
- package/src/{obligation-source.ts → obligations/source.ts} +172 -216
- package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +39 -51
- package/src/parallel.ts +39 -66
- package/src/parser.ts +67 -74
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
- package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
- package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
- package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
- package/src/prover/decide-pool.ts +95 -0
- package/src/prover/deciders.ts +33 -0
- package/src/prover/first-order.ts +175 -0
- package/src/prover/isabelle/LICENSE +36 -0
- package/src/prover/isabelle/LICENSE-tlapm +26 -0
- package/src/prover/isabelle/decide.ts +44 -0
- package/src/prover/isabelle/encode.ts +445 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prover/isabelle/isar/method.ts +367 -0
- package/src/prover/isabelle/isar/proof.ts +28 -0
- package/src/prover/isabelle/isar/statement.ts +57 -0
- package/src/prover/isabelle/isar/theory.ts +192 -0
- package/src/prover/isabelle/isar/type-check.ts +278 -0
- package/src/prover/isabelle/provers/blast/blast.ts +258 -0
- package/src/prover/isabelle/provers/blast/branch.ts +322 -0
- package/src/prover/isabelle/provers/blast/prove.ts +347 -0
- package/src/prover/isabelle/provers/blast/rules.ts +330 -0
- package/src/prover/isabelle/provers/blast/state.ts +180 -0
- package/src/prover/isabelle/provers/blast/term.ts +546 -0
- package/src/prover/isabelle/provers/clasimp.ts +150 -0
- package/src/prover/isabelle/provers/classical.ts +389 -0
- package/src/prover/isabelle/provers/hypsubst.ts +433 -0
- package/src/prover/isabelle/pure/bicompose.ts +174 -0
- package/src/prover/isabelle/pure/consts.ts +32 -0
- package/src/prover/isabelle/pure/conv.ts +79 -0
- package/src/prover/isabelle/pure/drule.ts +264 -0
- package/src/prover/isabelle/pure/envir.ts +331 -0
- package/src/prover/isabelle/pure/goal.ts +53 -0
- package/src/prover/isabelle/pure/interrupt.ts +16 -0
- package/src/prover/isabelle/pure/list.ts +12 -0
- package/src/prover/isabelle/pure/logic.ts +330 -0
- package/src/prover/isabelle/pure/name.ts +98 -0
- package/src/prover/isabelle/pure/net.ts +215 -0
- package/src/prover/isabelle/pure/object-logic.ts +41 -0
- package/src/prover/isabelle/pure/pattern.ts +631 -0
- package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prover/isabelle/pure/rewriter.ts +602 -0
- package/src/prover/isabelle/pure/search.ts +68 -0
- package/src/prover/isabelle/pure/seq.ts +133 -0
- package/src/prover/isabelle/pure/simplifier.ts +106 -0
- package/src/prover/isabelle/pure/table.ts +201 -0
- package/src/prover/isabelle/pure/tactic.ts +168 -0
- package/src/prover/isabelle/pure/tactical.ts +264 -0
- package/src/prover/isabelle/pure/term-ord.ts +105 -0
- package/src/prover/isabelle/pure/term.ts +688 -0
- package/src/prover/isabelle/pure/thm.ts +783 -0
- package/src/prover/isabelle/pure/type.ts +121 -0
- package/src/prover/isabelle/pure/unify.ts +753 -0
- package/src/prover/isabelle/pure/variable.ts +25 -0
- package/src/prover/isabelle/tla/classical-setup.ts +101 -0
- package/src/prover/isabelle/tla/context.ts +74 -0
- package/src/prover/isabelle/tla/logic-data.ts +5 -0
- package/src/prover/isabelle/tla/logic.ts +215 -0
- package/src/prover/isabelle/tla/simpdata.ts +241 -0
- package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prover/ocaml.ts +22 -0
- package/src/prover/prep/action.ts +508 -0
- package/src/prover/prep/enabled-axioms.ts +189 -0
- package/src/prover/prep/fingerprint.ts +388 -0
- package/src/prover/prep/level-comparison.ts +529 -0
- package/src/prover/prep/md5.ts +60 -0
- package/src/prover/prep/methods.ts +221 -0
- package/src/prover/prep/normalize.ts +309 -0
- package/src/prover/prove-worker.ts +22 -0
- package/src/prover/prove.ts +492 -0
- package/src/prover/ptl/decide.ts +68 -0
- package/src/prover/ptl/encode.ts +244 -0
- package/src/prover/ptl/sat.ts +151 -0
- package/src/prover/ptl/tableau.ts +276 -0
- package/src/prover/smt/axioms.ts +209 -0
- package/src/prover/smt/context.ts +108 -0
- package/src/prover/smt/data.ts +636 -0
- package/src/prover/smt/encode.ts +275 -0
- package/src/prover/smt/extensionality.ts +65 -0
- package/src/prover/smt/flatten.ts +112 -0
- package/src/prover/smt/format.ts +154 -0
- package/src/prover/smt/instances.ts +181 -0
- package/src/prover/smt/rewrite.ts +766 -0
- package/src/prover/smt/solver/act-cache.ts +265 -0
- package/src/prover/smt/solver/arith-rewriter.ts +962 -0
- package/src/prover/smt/solver/array.ts +22 -0
- package/src/prover/smt/solver/asserted-formulas.ts +469 -0
- package/src/prover/smt/solver/ast-lt.ts +157 -0
- package/src/prover/smt/solver/ast-util.ts +91 -0
- package/src/prover/smt/solver/ast.ts +1315 -0
- package/src/prover/smt/solver/auf-solver.ts +572 -0
- package/src/prover/smt/solver/case-split-queue.ts +178 -0
- package/src/prover/smt/solver/cg-table.ts +175 -0
- package/src/prover/smt/solver/clause.ts +276 -0
- package/src/prover/smt/solver/conflict-resolution.ts +343 -0
- package/src/prover/smt/solver/context.ts +1292 -0
- package/src/prover/smt/solver/ctx-simplify.ts +334 -0
- package/src/prover/smt/solver/der.ts +224 -0
- package/src/prover/smt/solver/dyn-ack.ts +141 -0
- package/src/prover/smt/solver/e-matching.ts +659 -0
- package/src/prover/smt/solver/enode.ts +259 -0
- package/src/prover/smt/solver/expr-ref.ts +21 -0
- package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prover/smt/solver/fingerprints.ts +92 -0
- package/src/prover/smt/solver/flat-literals.ts +51 -0
- package/src/prover/smt/solver/goal.ts +138 -0
- package/src/prover/smt/solver/hash.ts +173 -0
- package/src/prover/smt/solver/hashtable.ts +166 -0
- package/src/prover/smt/solver/internalizer.ts +1381 -0
- package/src/prover/smt/solver/lbool.ts +5 -0
- package/src/prover/smt/solver/literal.ts +24 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prover/smt/solver/lp/constraints.ts +78 -0
- package/src/prover/smt/solver/lp/containers.ts +296 -0
- package/src/prover/smt/solver/lp/core-solver.ts +504 -0
- package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prover/smt/solver/lp/dependency.ts +51 -0
- package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prover/smt/solver/lp/explanation.ts +46 -0
- package/src/prover/smt/solver/lp/gomory.ts +255 -0
- package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prover/smt/solver/lp/hnf.ts +281 -0
- package/src/prover/smt/solver/lp/int-cube.ts +295 -0
- package/src/prover/smt/solver/lp/int-solver.ts +514 -0
- package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prover/smt/solver/lp/lar-term.ts +62 -0
- package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prover/smt/solver/lp/nex.ts +120 -0
- package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prover/smt/solver/lp/nla-core.ts +968 -0
- package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prover/smt/solver/lp/nla-order.ts +307 -0
- package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prover/smt/solver/lp/nla-types.ts +124 -0
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prover/smt/solver/lp/pdd.ts +971 -0
- package/src/prover/smt/solver/lp/random-updater.ts +138 -0
- package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prover/smt/solver/lp/union-find.ts +96 -0
- package/src/prover/smt/solver/mam-compiler.ts +847 -0
- package/src/prover/smt/solver/mam-interpreter.ts +400 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prover/smt/solver/model-checker.ts +347 -0
- package/src/prover/smt/solver/model-evaluator.ts +262 -0
- package/src/prover/smt/solver/model-finder.ts +155 -0
- package/src/prover/smt/solver/model-generator.ts +97 -0
- package/src/prover/smt/solver/model-macro-solver.ts +728 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prover/smt/solver/nlsat/explain.ts +607 -0
- package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prover/smt/solver/nlsat/solver.ts +911 -0
- package/src/prover/smt/solver/nlsat/types.ts +43 -0
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prover/smt/solver/nnf.ts +469 -0
- package/src/prover/smt/solver/pattern-inference.ts +351 -0
- package/src/prover/smt/solver/poly-rewriter.ts +477 -0
- package/src/prover/smt/solver/propagate-values.ts +83 -0
- package/src/prover/smt/solver/proto-model.ts +551 -0
- package/src/prover/smt/solver/pull-quant.ts +139 -0
- package/src/prover/smt/solver/qe-lite-der.ts +526 -0
- package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prover/smt/solver/qe-lite.ts +381 -0
- package/src/prover/smt/solver/qi-queue.ts +362 -0
- package/src/prover/smt/solver/quant-tactics.ts +117 -0
- package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prover/smt/solver/quantifier-manager.ts +186 -0
- package/src/prover/smt/solver/random-gen.ts +10 -0
- package/src/prover/smt/solver/rational.ts +165 -0
- package/src/prover/smt/solver/ref-vector.ts +62 -0
- package/src/prover/smt/solver/relevancy.ts +247 -0
- package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prover/smt/solver/rewriter.ts +843 -0
- package/src/prover/smt/solver/rlimit.ts +79 -0
- package/src/prover/smt/solver/smtlib-parser.ts +526 -0
- package/src/prover/smt/solver/solver.ts +71 -0
- package/src/prover/smt/solver/sort.ts +35 -0
- package/src/prover/smt/solver/sticky-generations.ts +69 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prover/smt/solver/theory-lra-model.ts +243 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prover/smt/solver/theory-lra-state.ts +43 -0
- package/src/prover/smt/solver/theory-lra.ts +56 -0
- package/src/prover/smt/solver/var-subst.ts +258 -0
- package/src/prover/smt/solver/z3-license.txt +10 -0
- package/src/prover/smt/table.ts +170 -0
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/prover/tlapm/tlapm.ts +96 -0
- package/src/prover/tlaps-module.ts +510 -0
- package/src/prover/verdict.ts +13 -0
- package/src/prover/zenon/LICENSE +32 -0
- package/src/prover/zenon/check/check.ts +105 -0
- package/src/prover/zenon/check/definitions.ts +144 -0
- package/src/prover/zenon/check/equality.ts +182 -0
- package/src/prover/zenon/check/functions.ts +62 -0
- package/src/prover/zenon/check/keys.ts +125 -0
- package/src/prover/zenon/check/propositional.ts +104 -0
- package/src/prover/zenon/check/records.ts +188 -0
- package/src/prover/zenon/check/relations.ts +121 -0
- package/src/prover/zenon/check/rewrites.ts +224 -0
- package/src/prover/zenon/check/sets.ts +302 -0
- package/src/prover/zenon/check/terms.ts +127 -0
- package/src/prover/zenon/check/tla.ts +126 -0
- package/src/prover/zenon/decide.ts +107 -0
- package/src/prover/zenon/encode.ts +378 -0
- package/src/prover/zenon/eqrel.ts +300 -0
- package/src/prover/zenon/equality-rules.ts +435 -0
- package/src/prover/zenon/expr.ts +551 -0
- package/src/prover/zenon/index-table.ts +350 -0
- package/src/prover/zenon/isar-case.ts +513 -0
- package/src/prover/zenon/isar.ts +1249 -0
- package/src/prover/zenon/limits.ts +15 -0
- package/src/prover/zenon/llproof.ts +173 -0
- package/src/prover/zenon/mltoll.ts +1566 -0
- package/src/prover/zenon/node.ts +297 -0
- package/src/prover/zenon/ocaml.ts +169 -0
- package/src/prover/zenon/parse.ts +247 -0
- package/src/prover/zenon/phrase.ts +191 -0
- package/src/prover/zenon/proof.ts +198 -0
- package/src/prover/zenon/propositional-rules.ts +387 -0
- package/src/prover/zenon/rules.ts +94 -0
- package/src/prover/zenon/search.ts +288 -0
- package/src/prover/zenon/tla/functions.ts +151 -0
- package/src/prover/zenon/tla/llproof.ts +480 -0
- package/src/prover/zenon/tla/records.ts +225 -0
- package/src/prover/zenon/tla/rewrites.ts +447 -0
- package/src/prover/zenon/tla/sets.ts +304 -0
- package/src/prover/zenon/tla/terms.ts +162 -0
- package/src/prover/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +19 -24
- package/src/resolve.ts +15 -22
- package/src/runtime.ts +8 -8
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +38 -55
- package/src/{sany-levels.ts → sany/levels.ts} +45 -48
- package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +16 -17
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
- package/src/{sany-source.ts → sany/source.ts} +6 -7
- package/src/{sany-xml.ts → sany/xml.ts} +5 -6
- package/src/search.ts +969 -0
- package/src/spec-description.ts +26 -20
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +21 -22
- package/src/state-graph.ts +9 -8
- package/src/substitution-levels.ts +2 -2
- package/src/successors.ts +38 -22
- package/src/symmetry.ts +1 -1
- package/src/tableau.ts +6 -7
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +3 -190
- package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
- package/src/{tlc-version.ts → tlc/version.ts} +8 -7
- package/src/transfer.ts +32 -32
- package/src/values.ts +154 -105
- package/src/worker.ts +62 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -55
- package/dist/run-cli.js +0 -55
- package/src/canonical.ts +0 -40
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/standard-ranges.ts +0 -116
- package/src/value-sources.ts +0 -29
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
package/dist/transfer.cjs
CHANGED
|
@@ -6,78 +6,18 @@
|
|
|
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
|
-
const e=
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
`),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=Se(o.width,e[o.position]);return Se(o.width,e[a.index])},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
|
|
17
|
-
`&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new u(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
|
|
18
|
-
`||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
|
|
19
|
-
`,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=ye(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,ye(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||`
|
|
20
|
-
\r`.includes(e[a.index]))throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
|
|
21
|
-
`,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=de.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(he(t)){let t=e.slice(a.index,ye(e,a.index,he));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let i=r.get(t)??t;r.set(i,i),c(E.has(t)?`Keyword`:`Identifier`,i,t.length);continue}if(`ℕℤℝ`.includes(t)){c(`Identifier`,r.get(t)??t,1),r.set(t,t);continue}let o=be(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=O(e,a.index);if(u){let t=e.slice(a.index,a.index+u.length);c(`Operator`,u.text,u.length,t===u.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},we=[[`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`]],k=we.map(e=>e[0]),Te=new Map(k.map((e,t)=>[e,t]).reverse()),A=e=>{let t=Te.get(e);if(t===void 0)throw new l(`Unknown SANY token kind ${e}`);return t},Ee=new Map(we.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),De=Math.max(...[...Ee.keys()].map(e=>e.length)),Oe=Array.from({length:De},(e,t)=>De-t),ke=/----+ *MODULE/y,Ae=[/_\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],je=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`)),Me=je(String.raw`\.\/\\`),Ne=je(String.raw`\.\\\/`),Pe=String.raw`<(?:[0-9]+|\+|\*)>`,Fe=[[`_BM0`,[ke]],[`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`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Pe}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Pe,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Pe}(?:\*\.*|-\.*|\.+)`,`y`)]]],Ie=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[ke]]],Le=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[ke]],[`BAND`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae]],j=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Re=(e,t,n)=>e.map(([e,r])=>({kind:A(e),length:Math.max(...r.map(e=>j(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),ze=(e,t)=>{let n=Oe.find(n=>Ee.has(e.slice(t,t+n))),r=Re(Fe,e,t);if(n===void 0)return r;let i={kind:Ee.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Be=e=>e+8-e%8,Ve=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
|
|
9
|
+
const e=require("./worker.cjs"),t=/* @__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(`.`)),n=/* @__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`]]),r=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),i=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),a=/* @__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`]]),o=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,s=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),c=e=>e.startsWith(`\\`)?parseInt(e.slice(2),s.get(e[1].toLowerCase())):Number(e),l=/-{4,}[ \t]*MODULE\b/,u=e=>/[A-Za-z0-9_]/.test(e),d=(e,t)=>{let o=e[t];if(o===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let r=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,i={value:r.length};for(;i.value>0&&!n.has(r.slice(0,i.value));)i.value--;let a=n.get(r.slice(0,i.value));return{text:a??`\\`,length:a===void 0?1:i.value+1}}let s=[e.slice(t,t+2),o].find(e=>a.has(e));if(s!==void 0)return{text:a.get(s)??``,length:s.length};let c=i.find(n=>e.startsWith(n,t));return c?{text:r.get(c)??c,length:c.length}:o===`\\`?{text:`\\`,length:1}:void 0},f=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),p=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>a.has(e)||f.has(e));return n===void 0?void 0:{text:n,length:n.length}},m=e=>e!==void 0&&e>=`0`&&e<=`9`,h=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},ee=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:h(e,t+1,m);if(n===t+1||e[n]!==`>`)return 0;let r=h(e,n+1,u),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return h(e,i?r+1:r,e=>e===`.`)-t},te=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,g=(e,t)=>t===` `?e+8-e%8:e+1,ne=n=>{let r=l.exec(n);if(!r)throw new e.D(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,s=n.slice(0,r.index).split(`
|
|
10
|
+
`),c={index:r.index,line:s.length,lineStart:r.index-s[s.length-1].length,moduleDepth:0},f={lineStart:-1,position:0,width:0},p=()=>{for((f.lineStart!==c.lineStart||f.position>c.index)&&(f.lineStart=c.lineStart,f.position=c.lineStart,f.width=0);f.position<c.index;f.position++)f.width=g(f.width,n[f.position]);return g(f.width,n[c.index])},m=(e,t,n,r)=>{let a=p();i.push({kind:e,text:t,spelling:r,line:c.line,column:a,endColumn:a+n-1}),c.index+=n},te=e=>{for(let t=0;t<e;t++)n[c.index]===`
|
|
11
|
+
`&&(c.line++,c.lineStart=c.index+1),c.index++},ne=t=>new e.D(`${t} at line ${c.line}, column ${p()}`,void 0,{reason:t,line:c.line,column:p(),isEnd:c.index>=n.length});for(;c.index<n.length;){let e=n[c.index];if(e===`
|
|
12
|
+
`||e===` `||e===` `||e===`\r`){te(1);continue}if(n.startsWith(`\\*`,c.index)){let e=n.indexOf(`
|
|
13
|
+
`,c.index);te((e===-1?n.length:e)-c.index);continue}if(n.startsWith(`(*`,c.index)){let e={value:0};do{if(c.index>=n.length)throw ne(`Unterminated comment`);n.startsWith(`(*`,c.index)?(e.value++,te(2)):n.startsWith(`*)`,c.index)?(e.value--,te(2)):te(1)}while(e.value>0);continue}if(n.startsWith(`----`,c.index)){let e=h(n,c.index,e=>e===`-`)-c.index;n.slice(c.index+e).trimStart().startsWith(`MODULE`)&&c.moduleDepth++,m(`Separator`,`----`,e);continue}if(n.startsWith(`====`,c.index)){if(m(`ModuleEnd`,`====`,h(n,c.index,e=>e===`=`)-c.index),c.moduleDepth--,c.moduleDepth<=0)break;continue}if(e===`"`){let e=c.line,t=p(),r=[];for(te(1);n[c.index]!==`"`;){if(c.index>=n.length||`
|
|
14
|
+
\r`.includes(n[c.index]))throw ne(`Unterminated string`);if(n[c.index]===`\\`){let e=n[c.index+1];if(e===void 0||!`ntrf\\"`.includes(e))throw ne(`Invalid escape in string`);r.push({n:`
|
|
15
|
+
`,t:` `,r:`\r`,f:`\f`}[e]??e),te(2)}else r.push(n[c.index]),te(1)}te(1),i.push({kind:`String`,text:r.join(``),line:e,column:t,endColumn:p()-1});continue}let r=o.exec(n.slice(c.index,c.index+64));if(r){m(`Number`,r[0],r[0].length);continue}if(u(e)){let e=n.slice(c.index,h(n,c.index,u));if(/^\d+$/.test(e)){let t=/^\d+(\.\d+)?/.exec(n.slice(c.index))?.[0]??e;m(t.includes(`.`)?`Decimal`:`Number`,t,t.length);continue}let r=/^(_|\d+)/.exec(e)?.[0];if(r!==void 0&&!/[A-Za-z]/.test(e)){m(r===`_`?`Operator`:`Number`,r,r.length);continue}if(e.startsWith(`WF_`)||e.startsWith(`SF_`)){m(`Keyword`,e.slice(0,3),3);continue}let i=a.get(e)??e;a.set(i,i),m(t.has(e)?`Keyword`:`Identifier`,i,e.length);continue}if(`ℕℤℝ`.includes(e)){m(`Identifier`,a.get(e)??e,1),a.set(e,e);continue}let s=ee(n,c.index);if(s>0){m(`Step`,n.slice(c.index,c.index+s),s);continue}let l=d(n,c.index);if(l){let e=n.slice(c.index,c.index+l.length);m(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw ne(`Unexpected character ${JSON.stringify(e)}`)}let _=p();return i.push({kind:`End`,text:``,line:c.line,column:_,endColumn:_}),i},_=[[`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`]],re=_.map(e=>e[0]),v=new Map(re.map((e,t)=>[e,t]).reverse()),y=t=>{let n=v.get(t);if(n===void 0)throw new e.h(`Unknown SANY token kind ${t}`);return n},ie=new Map(_.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),ae=Math.max(...[...ie.keys()].map(e=>e.length)),oe=Array.from({length:ae},(e,t)=>ae-t),se=/----+ *MODULE/y,ce=[/_\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],le=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`)),ue=le(String.raw`\.\/\\`),de=le(String.raw`\.\\\/`),fe=String.raw`<(?:[0-9]+|\+|\*)>`,b=[[`_BM0`,[se]],[`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`,ue],[`BOR`,de],[`IDENTIFIER`,ce],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${fe}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(fe,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${fe}(?:\*\.*|-\.*|\.+)`,`y`)]]],x=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[se]]],S=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[se]],[`BAND`,ue],[`BOR`,de],[`IDENTIFIER`,ce]],C=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),pe=(e,t,n)=>e.map(([e,r])=>({kind:y(e),length:Math.max(...r.map(e=>C(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),me=(e,t)=>{let n=oe.find(n=>ie.has(e.slice(t,t+n))),r=pe(b,e,t);if(n===void 0)return r;let i={kind:ie.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},he=e=>e+8-e%8,ge=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
|
|
22
16
|
`?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
|
|
23
|
-
`?r.isAfterLf=!0:i===` `&&(r.column=
|
|
24
|
-
`||e[a]===`\r`?
|
|
25
|
-
\r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=
|
|
26
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),
|
|
27
|
-
`);t.length>1&&(n.line+=t.length-1,n.lineStart=n.index+e.length-t[t.length-1].length),n.index+=e.length};for(;n.index<e.length;){let o=e.slice(n.index),s=/^\s+/.exec(o)?.[0];if(s){a(s);continue}if(o.startsWith(`\\*`)){let e=o.indexOf(`
|
|
28
|
-
`);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=et.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=_e(e,n.index)??O(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},nt=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),rt=(e,t)=>nt(e,`The keyword ${t} appeared twice.`),M=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),it=/* @__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`]]),at=(e,t=`master`)=>{let n=t===`1.7.4`?$e:Ze,r=tt(e),i={index:0},a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw nt(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw nt(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw nt(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw nt(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw nt(e,``);r.token=c()}if(r.token.text!==`=`)throw nt(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?M.get(e):void 0,i=n.has(e)?it.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw nt(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw rt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw nt(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw rt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!Qe.includes(e))throw nt(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw rt(t,e);s.add(e),p.token=c()}}return a},ot={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:` `}},st=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},ct=e=>e!==void 0&&/^\p{Nd}$/u.test(e),lt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ut=e=>{let t=t=>{let n=ye(e,t,st);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=ye(e,t,ct);if(e.startsWith(`..`,n)&&ct(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,ct)-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=ct(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,ct)-1,children:[]};if(lt(n))return{kind:`Constant`,first:t,last:ye(e,t,lt)-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)},dt=e=>{let t=e.length===0?void 0:ut(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=ot[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},N=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ft=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),P=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),F=e=>typeof e==`object`&&e.kind===`ModelValue`,pt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:N(e)?`set`:`function`,mt=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new S(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ht={isUsed:!1},gt=(e,t)=>(ht.isUsed=!0,e.writtenKeys=t,e),_t=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Sr(e.domain,t)]]),vt=(e,t,n)=>gt(tn(e,t),n),yt=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(yt);e.writtenKeys=void 0,e.range.forEach(yt)}},bt=e=>e.every(e=>typeof e==`string`),xt=(e,t)=>e.length>0&&t.length>0&&bt(e)!==bt(t),St=(e,t)=>{ht.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return xt(n,r)?Cn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=zt(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=zt(i[e],a[e]);if(t!==0)return t}return 0},Ct=(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=zt(n[e],r[e]);if(t!==0)return t}return 0},wt=e=>F(e)?e.type:void 0,Tt=(e,t,n)=>{let r=wt(e),i=wt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(F(e)&&F(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${z(e)} and ${z(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${z(t)} and the non-model value\n${z(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${z(e)} and non-model value\n${z(t)}`)},Et={ranks:Object.create(null),size:0},Dt=e=>{Et.ranks=Object.create(null),Et.size=0,Bt.clear();for(let t of e)At(t)},Ot={is174:!1},kt=e=>{Ot.is174=e===`1.7.4`},At=e=>(Et.ranks[e]===void 0&&(Et.ranks[e]=Et.size++),e),jt=()=>Et.size,Mt=e=>Et.ranks[At(e)],Nt=(e,t)=>{if(e===t)return 0;let n=Et.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},Pt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ft=(e,t)=>(Pt(e)||Pt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),It=(e,t,n)=>{if(!Pt(e))throw new y(`Attempted to ${n} the set ${z(I(e)?L(e):e,!0)} with the value:\n${z(t,!0)}`);if(!Pt(t))throw new y(`Attempted to compare overridden value ${z(e,!0)} with non-overridden value:\n${z(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 y(`Attempted to compare ${z(e,!0)} with the value\n${z(t,!0)}`)},Lt={kind:`InfiniteSet`,name:`Any`},Rt=e=>{throw new y(`Attempted to compare ANY with the value\n${z(e)}`)},zt=(e,t)=>{if(e===t)return ht.isUsed&&yt(e),e===Lt?Rt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return St(e,t);if(n===`Set`&&r===`Set`)return Ct(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&&Tt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Tt(e,t,!1),n===`ModelValue`?-1:1;if(e===Lt||t===Lt)return Rt(e===Lt?t:e);if(N(e)&&N(t)&&Ft(e,t))return It(e,t,`compare`);let i=N(e);if(i!==N(t))throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`);return i?Ct(L(e),L(t)):St(Ar(e),Ar(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Nt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Tt(e,t,!1),F(e))return-1;if(F(t))return 1;throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`)},Bt=/* @__PURE__ */ new Map,Vt=e=>{let t=Bt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Mt(e)};return Bt.set(e,n),n},Ht=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),Ut=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Wt={isPresent:!1},Gt=(e,t)=>(t===`lambda`&&(Wt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Kt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,qt=e=>Gt(e,`lambda`),Jt=/* @__PURE__ */ new WeakSet,Yt=/* @__PURE__ */ new WeakSet,Xt={isPresent:!1},Zt=e=>(Xt.isPresent=!0,e),Qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),$t=e=>{Xt.isPresent&&typeof e==`object`&&Qt.has(e.kind)&&Yt.add(e)},en=e=>{if((Wt.isPresent||Xt.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(Jt.has(e))return;Jt.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(en),e.range.forEach(en)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(en):N(e)&&I(e)&&($t(e),L(e).elements.forEach(en))}},tn=(e,t)=>Gt(Ut(e,t),`record`),nn=(e,t)=>{if($t(e),e===t)return ht.isUsed&&yt(e),e!==Lt||Rt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Tt(e,t,!0),zt(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 St(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Ct(e,t)===0;if(F(e)||F(t))return Tt(e,t,!0),F(e)&&F(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return nn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=R(e.domain),r=R(t.domain);if(n||r)return n===r;let i=R(e.range),a=R(t.range);return i||a?i===a:nn(e.domain,t.domain)&&nn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(R(e))return R(t);if(R(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]&&nn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return R(e)?R(t):!R(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>nn(e,t.factors[n]));let n=N(e)&&N(t)&&!(I(e)&&I(t));if(n&&Ft(e,t))return It(e,t,`check equality of`)===0;if(n){if(!Pt(e)){let n=L(e);if(!Pt(t))return Ct(n,L(t))===0}return oi(e)===oi(t)}return zt(e,t)===0},rn=e=>{let t=(e,t)=>e===t||e.length===t.length&&e.every((e,r)=>n(e,t[r])),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):oi(n)===oi(r);return n},an=rn(!1),on=rn(!0),sn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},cn=e=>{if(!P(e))return;let t=Ar(e);return{domain:t.domain,range:t.range,low:sn(t.domain)}},ln=e=>{if(!P(e))return;let t=Ar(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},un=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to compare the typed model value ${z(e)} and the non-model value\n${z(t)}`);return 1},dn=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${z(e)} and the non-model value\n${z(t)}`);return!1},fn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)?e.rank-t.rank:-1;if(!F(t))throw new y(`Attempted to compare the typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${z(e)} and ${z(t)}`);return e.rank-t.rank},pn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)&&e.name===t.name;if(!F(t))throw new y(`Attempted to check equality of typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${z(e)} and ${z(t)}`);return e.name===t.name},mn={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`}},hn=(e,t,n)=>{let r=mn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},gn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return un(n,t);throw new y(`Attempted to compare the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>_n(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 _n(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 y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${z(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},_n=(e,t)=>{for(let n=0;n<e.length;n++){let r=Cn(e[n],t[n]);if(r!==0)return r}return 0},vn=(e,t)=>{let n=Ar(e);if(e.kind===`Function`&&Cr(n)!==void 0){let r=P(t)?Cr(t):void 0;return r?n.range.length-r.length||_n(n.range,r):gn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return un(t,e);throw new y(`Attempted to compare record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length-r.domain.length||_n(n.domain,r.domain)||_n(n.range,r.range)}return gn({...n,low:sn(n.domain)},e,t)},yn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),bn=(e,t)=>Pt(e)||Pt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),xn=(e,t)=>{let n=yn(t)?t:L(t);return{elements:L(e).elements,otherElements:L(n).elements}},Sn=(e,t)=>{if(bn(e,t))return zt(e,t);if(!yn(e))return Sn(L(e),t);if(!N(t)){if(F(t))return un(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length-n.otherElements.length||_n(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return zt(e,t);if(F(t))return un(t,e);throw new y(hn(e,t,!1))}return e.kind===`ModelValue`?fn(e,t):P(e)?vn(e,t):Sn(e,t)},wn=(e,t)=>e.every((e,n)=>On(e,t[n])),Tn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return dn(n,t);throw new y(`Attempted to check equality of the function ${z(t)} with the value:\n${z(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)&&wn(e.range,r.range);let i=e.low??r.low;return i===void 0?wn(e.domain,r.domain)&&wn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${z(e)}.`);return e===i+t})&&wn(e.range,r.range)},En=(e,t)=>{let n=Ar(e);if(e.kind===`Function`&&Cr(n)!==void 0){let r=P(t)?Cr(t):void 0;return r?n.range.length===r.length&&wn(n.range,r):Tn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length===r.domain.length&&wn(n.domain,r.domain)&&wn(n.range,r.range)}return Tn({...n,low:sn(n.domain)},e,t)},Dn=(e,t)=>{if(bn(e,t))return nn(e,t);if(!yn(e))return Dn(L(e),t);if(!N(t)){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length===n.otherElements.length&&wn(n.elements,n.otherElements)},On=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(F(t))return dn(t,e);throw new y(hn(e,t,!0))}return e.kind===`ModelValue`?pn(e,t):P(e)?En(e,t):Dn(e,t)},kn=e=>{let t=[];for(let n of e){let e=jn(n,t);e.isFound||t.splice(e.index,0,n)}return t},An=(e,t)=>{let n=Tr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},jn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=An(e,()=>Cn(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}},Mn=(e,t)=>t.some(t=>An(t,()=>On(t,e))),Nn=/* @__PURE__ */ new WeakSet,Pn=e=>{typeof e==`object`&&(e.kind===`Set`&&(Nn.add(e),e.elements.forEach(Pn)),e.kind===`Function`&&(e.domain.forEach(Pn),e.range.forEach(Pn)))},Fn=(e,t)=>Er(()=>nn(e,t),()=>On(e,t)),In=e=>{for(let t=1;t<e.length;t++)if(zt(e[t-1],e[t])>=0)return!1;return!0},Ln=e=>{for(let t=1;t<e.length;t++)$t(e[t]);if(e.length<2||In(e))return Ht(e);let t=[...e].sort(zt),n=[t[0]];for(let e=1;e<t.length;e++)zt(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ht(n)},Rn=e=>Er(()=>Ln(e),()=>({kind:`MixedSet`,elements:e})),zn=Ht([]),Bn=(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&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ht(i)},Vn=(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&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ht(i)},Hn=(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=zt(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=Ht(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+ti(a[e])|0;c.fingerprint=t}return c},Un=e=>{let t=e.length<2?e:[...e].sort((e,t)=>zt(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&zt(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Ut(n,r)},Wn=e=>{let t=Un(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:gt(t,e.map(e=>e[0]))},Gn=[],Kn=[],qn=/* @__PURE__ */ new WeakMap,Jn=e=>{let t=Gn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Gn[e]=n,n},Yn=e=>{if(yr(e),e.low===1&&e.high>=1)return Jn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Xn=e=>e.length>0&&(e===Gn[e.length]||qn.has(e)),Zn=e=>{let t=L(e).elements;return Xn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Qn=e=>{let t=Kn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Kn[e]=n,n},$n=e=>Gt(Ut(Jn(e.length),e),`tuple`),er=e=>Gt(Un(e),`record`),tr=e=>N(e)&&!Pt(e),nr=(e,t=!1)=>`UNION(${z(e.base,t)})`,rr=(e,t=e=>L(e).elements)=>{if(!tr(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${nr(e)}`);return t(e.base)},ir=(e,t,n)=>{if(tr(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${z(e)}\nwhen enumerating:\n${nr(n)}`)},I=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 I(e.base);case`FunctionSet`:return I(e.domain)&&I(e.range)||ar(e.domain)===!0||ar(e)===!0;case`RecordSet`:return e.sets.every(I)||ar(e)===!0;case`ProductSet`:return e.factors.every(I)||ar(e)===!0;case`Union`:return I(e.base)&&pr(e.base).every(I);case`SetOperation`:return e.operator===`\\cup`?I(e.left)&&I(e.right):e.operator===`\\cap`?I(e.left)||I(e.right):I(e.left);default:return!1}},ar=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=ar(e.domain);return t===void 0?void 0:!t&&ar(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=ar(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return I(e)?L(e).elements.length===0:void 0;default:return}},or=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},sr=(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},cr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Pt(e.base))return;let t=L(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=[]:sr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Ht(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)})},lr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ht(r.map(t=>e[t])));while(sr(r,e.length))}return t},ur=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Pt(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},dr=(e,t=e=>L(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${z(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return kn(e.elements);case`Interval`:{let t=Yn(e);return t!==Gn[t.length]&&qn.set(t,e),t}case`Subset`:{if(yr(e.base)===0)return lr([]);if(!N(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${dt(z(e.base))}`);let t=L(e.base).elements;if(t.length>30)throw new y(vr(e));return lr(t)}case`FunctionSet`:{if(!Ot.is174&&R(e))return[];if(Pt(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(e.domain)}\ncannot be enumerated.`);let n=Zn(e.domain);if((n.length>0||Ot.is174)&&Pt(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return or(n.map(()=>r)).map(e=>Ut(n,e))}case`RecordSet`:{if(!Ot.is174&&R(e))return[];let n=ur(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${z(t)}`);return or(n).map(t=>er(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Ot.is174&&R(e))return[];let n=ur(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${z(e)}`);return or(n).map($n)}case`FilteredSet`:if(!N(e.base)||Pt(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(e.base)}\nis not enumerable`);return L(e.base).elements.filter(e.test);case`Union`:{let t=rr(e).flatMap((t,n)=>L(ir(t,n,e)).elements);return L(Rn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!tr(e.left)||!tr(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${z(e.left)}\nand T:\n${z(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!tr(e.left)&&!tr(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${z(e.left)}\nnor T:\n${z(e.right)}\nis enumerable`);if(e.operator===`\\`&&!tr(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Hn(L(e.left),L(e.right)).elements;let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return L(n).elements.filter(t=>Dr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${z(e)}`);default:throw new y(`Expected a set but found ${z(e)}`)}},fr=/* @__PURE__ */ new WeakMap,L=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ht(dr(e));let t=typeof e==`object`?fr.get(e):void 0;if(t)return t;let n=Tr.sets;n?.push(e);let r=dr(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`)?Ht(r):Ln(r);return typeof e==`object`&&fr.set(e,i),i},pr=e=>{if(typeof e!=`object`||Yt.has(e))return L(e).elements;let t=Tr.sets;t?.push(e);let n=gr(e);return t?.pop(),n},mr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,hr=e=>typeof e!=`object`||Yt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?hr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||hr(e.left)||hr(e.right):mr(e)?.some(hr)??!1,gr=e=>{if(e.kind===`Union`)return rr(e,pr).flatMap((t,n)=>pr(ir(t,n,e)));if(e.kind===`FilteredSet`&&!Pt(e.base))return pr(e.base).filter(e.test);if(mr(e)?.some(hr))return dr(e,pr);if(e.kind!==`SetOperation`)return L(e).elements;if(e.operator===`\\cup`)return!tr(e.left)||!tr(e.right)?L(e).elements:[...pr(e.left),...pr(e.right)];let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return tr(n)?pr(n).filter(t=>Dr(t,r)===(e.operator===`\\cap`)):L(e).elements},R=e=>{if(typeof e!=`object`||!N(e))throw new y(`Shouldn't call isEmpty() on value ${z(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(R);case`RecordSet`:return e.sets.some(R);case`FunctionSet`:return!R(e.domain)&&R(e.range);case`Union`:return rr(e).every((t,n)=>R(ir(t,n,e)));default:return L(e).elements.length===0}},_r=(e,t,n)=>e.reduce((e,r)=>{let i=e*yr(r,t);if(i>2147483647)throw new y(n());return i},1),vr=e=>`Overflow when computing the number of elements in:\n${z(e)}`,yr=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${z(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${z(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return yr(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 ${z(e)}.`);case`Subset`:{let n=yr(e.base,t);if(n>=31)throw new y(vr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(R(e.domain))return 1;if(R(e.range))return 0;if(yr(e.range,t)===1)return 1}let n=yr(e.domain,t),r=yr(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 y(vr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&R(e)?0:_r(e.sets,t,()=>vr(e));case`ProductSet`:return t!==`1.7.4`&&R(e)?0:_r(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return $t(e),L(e).elements.length}},br=e=>`Attempted to check if the set ${z(e)}is finite.`,xr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${pt(e)} ${z(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${z(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return xr(e.base)&&R(e.base);case`Subset`:return xr(e.base);case`FunctionSet`:{let t=xr(e.domain);if(t&&R(e.domain))return!0;let n=xr(e.range);return n&&R(e.range)?!0:n&&(t||yr(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(!xr(e))n.isAllFinite=!1;else if(R(e))return!0;return n.isAllFinite}case`Union`:if(!tr(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${nr(e)}\nis a finite set.`);return L(e.base).elements.every(xr);case`SetOperation`:if(e.operator===`\\cup`)return xr(e.left)&&xr(e.right);if(e.operator===`\\cap`){if(!xr(e.left)&&!xr(e.right))throw new y(br(e));return!0}if(xr(e.left))return!0;if(!xr(e.right))throw new y(br(e));return!1;case`FilteredSet`:if(!xr(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${z(e.base)}\nis finite.`);return!0}},Sr=(e,t,n=zt)=>{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},Cr=e=>{if(typeof e!=`object`||!P(e))return;let t=Ar(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},wr=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!P(t))return`${n} ${pt(t)} ${z(t)}`;let r=Kt(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},Tr={sets:void 0},Er=(e,t)=>{let n=Tr.sets,r=Tr.callStack,i=n?.length??0,a=r&&{...r,length:r.expressions.length};try{return e()}catch(e){if(!(e instanceof y))throw e;return n&&(n.length=i),r&&a&&(r.expressions.length=a.length,r.isFrozen=a.isFrozen,r.fingerprint=a.fingerprint),t(e)}},Dr=(e,t)=>{let n=Tr.sets;if(n===void 0)return Or(e,t);n.push(t);let r=Or(e,t);return n.pop(),r},Or=(e,t)=>{if(!N(t))throw new y(wr(e,t));switch(t.kind){case`Set`:return $t(e),Er(()=>Sr(t.elements,e)!==-1,()=>Nn.has(t)?jn(e,t.elements).isFound:Mn(e,t.elements));case`MixedSet`:return Mn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!F(e))throw new y(`Attempted to check if the value:\n${z(e)}\nis in the integer interval ${z(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(F(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new y(`Attempted to check if the value:\n${z(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!N(e)||Pt(e))throw new y(`Attempted to check if the non-enumerable value\n${dt(z(e))}\nis element of\n${dt(z(t))}`);return L(e).elements.every(e=>Dr(e,t.base));case`FunctionSet`:{if(!P(e)){if(F(e))return!1;throw new y(`Attempted to check if \n${z(e)}\nwhich is not a TLC function value, is in the set of functions:\n${dt(z(t))}`)}let n=Ar(e),r=sn(n.domain);return(r===void 0?Fn(t.domain,Ht(n.domain)):Fn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Dr(e,t.range))}case`RecordSet`:{let n=P(e)?Ar(e):void 0;if(!n||!bt(n.domain)){if(F(e))return!1;throw new y(`Attempted to check if non-record\n${z(e)}\nis in the set of records:\n${z(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Sr(n.domain,e);return i!==-1&&Dr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=P(e)?Cr(e):void 0;if(n===void 0){if(P(e)&&Ar(e).domain.every(e=>typeof e==`number`)||F(e))return!1;throw new y(`Attempted to check if non-tuple\n${z(e)}\nis in the set of tuples:\n${z(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Dr(e,t.factors[n]))}case`FilteredSet`:return Dr(e,t.base)&&t.test(e);case`Union`:if(!tr(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${nr(t)}`);return L(t.base).elements.some(t=>Dr(e,t));case`SetOperation`:return t.operator===`\\cup`?Dr(e,t.left)||Dr(e,t.right):Dr(e,t.left)&&Dr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Cr(e);if(n===void 0){if(F(e))return!1;throw new y(`Attempted to check if the value:\n${dt(z(e))}\nis an element of ${dt(z(t))}.`)}return n.every(e=>Dr(e,t.base))}default:throw new y(wr(e,t))}},kr=(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?Dr(e,n):e.range.every((e,r)=>kr(e,t.range[r],n.range)),Ar=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){I(e.domain)||yr(e.domain);let t=Zn(e.domain);return Gt(Ut(t,t.map(t=>e.apply(t))),Kt(e))}throw new y(`Expected a function but found ${z(e)}`)},jr=(e,t,n)=>{let r=dt(z(e)),i=dt(z(t)),a=n===`1.7.4`;switch(Kt(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(!Ot.is174)return jr(e,t);let n=dt(z(t));return Kt(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}if(e.length<=8){for(let n=0;n<e.length;n++)if(e[n]===t)return n}return Sr(e,t)},Pr=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${dt(z(e))}`),Fr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Kt(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&&!Ot.is174&&Xn(r))throw Pr(t)}return Er(()=>Nr(r,t),e=>{throw Ot.is174||r.length<32?r.forEach(e=>On(e,t)):Sr(r,t,Cn),e})},Ir=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Dr(t,e.domain))throw new y(Kt(e)===`lambda`?jr(e,t):`Attempted to apply a function to ${z(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${z(e)}, which is not a function`);let r=n??jr,i=Fr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Lr=e=>Xn(e)?qn.get(e)??Qn(e.length):void 0,Rr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=Ar(e).domain;return Lr(t)??Ht(t)},zr=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!I(e.domain))){if(!Dr(t,e.domain))return e;let r=n(e.apply(t));return Gt({kind:`LazyFunction`,domain:e.domain,apply:n=>Fn(t,n)?r:e.apply(n),source:e.source},Kt(e))}if(!P(e))throw new y(`Attempted to apply EXCEPT construct to the value ${dt(z(e))}.`);let i=Ar(e),a=Fr(i,t,Mr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Gt(Ut(i.domain,o),Kt(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-ni(e,s)+ni(e,c)|0}return l},Br=/* @__PURE__ */ new WeakMap,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===`ModelValue`)return Vr(Hr(Ur(e.name),109));if(N(e)){if(!I(e))return Kr;let t=L(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}if(e.kind===`LazyFunction`&&!I(e.domain))return Kr;let t=Ar(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Zr(t.domain[e]),i=Zr(t.range[e]);if(r===Kr||i===Kr)return Kr;n=n+Gr(r,i)|0}return n},Jr=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 ${z(e)}`);if(N(e)){L(e).elements.forEach(Jr);return}let t=Ar(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 y))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=>{if(typeof e==`number`)return Vr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Ur(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=qr(e)),e.hash;let t=Br.get(e);if(t!==void 0)return t;let n=qr(e);return Br.set(e,n),n},Qr=/* @__PURE__ */ new WeakMap,$r=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},ei=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return $r(t)},ti=e=>$r(ii(e)+2135587861|0),ni=(e,t)=>$r(Math.imul(ii(e),374761393)+ii(t)|0),ri=e=>{if(e.kind===`ModelValue`)return $r(ei(e.name)^60);if(N(e)){if(!I(e))return ei(oi(e));let t=L(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ti(t[e])|0;return n}let t=Ar(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+ni(t.domain[e],t.range[e])|0;return n},ii=e=>{if(typeof e==`number`)return $r(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return ei(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=ri(e)),e.fingerprint;let t=Qr.get(e);if(t!==void 0)return t;let n=ri(e);return Qr.set(e,n),n},ai=/* @__PURE__ */ new WeakMap,oi=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=ai.get(e);if(t!==void 0)return t;let n=si(e);return ai.set(e,n),n},si=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${oi(e.base)}>`;if(e.kind===`FilteredSet`&&!I(e))throw new y(`Attempted to compare the non-enumerable set ${z(e)} with another value`);if(N(e))return I(e)?`{${L(e).elements.map(oi).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=Ar(e);return`(${t.domain.map((e,n)=>`${oi(e)}:${oi(t.range[n])}`).join(`,`)})`},ci=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,li=e=>e.reduce((e,t)=>e===0?0:e*yr(t),1),ui=e=>{if(e.kind===`Subset`)return yr(e.base)<=6?L(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return L(e);if(e.kind===`FunctionSet`&&I(e.domain)&&yr(e.domain)===0)return Ht([Ut([],[])]);let t=e.kind===`FunctionSet`?yr(e.range)**yr(e.domain):li(e.kind===`RecordSet`?e.sets:e.factors);return t===0?zn:t<=1999?L(e):void 0},di=(e,t)=>{if(t)return ui(e);if(I(e))try{return ui(e)}catch(e){if(e instanceof y)return;throw e}},fi=(e,t)=>{let n=e=>z(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 nr(e,t)}},pi=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),mi=e=>{if(I(e.domain))try{return Ar(e)}catch(e){if(e instanceof y)return;throw e}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ci(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(L(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=di(e,t);return n?r(n):fi(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?mi(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ot.is174&&Kt(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&Kt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Kt(e)===`record`||i.domain.every(e=>typeof e==`string`&&pi(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):_t(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},hi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${dt(z(n))}\n`).join(``)},gi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},_i=()=>{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||on(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||on(i[e],n))return i[e]}return n.kind===`Set`?gi(n.elements,t):(gi(n.domain,t),gi(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}},vi=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(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),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:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,yi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),bi=(e,t)=>yi.has(e)?new y(t):new S(t),xi=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||xi(r))throw bi(n,`${n} expects a value as argument ${t+1}`);return r},Si=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw bi(n,`${n} expects an integer but received ${z(r)}`);return r},Ci=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw bi(n,`${n} expects a boolean but received ${z(r)}`);return r},wi=(e,t,n)=>{let r=V(e,t,n);if(!N(r))throw bi(n,`${n} expects a set but received ${z(r)}`);return r},Ti=(e,t,n)=>{let r=wi(e,t,n);if(!I(r))throw bi(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Ei=(e,t,n)=>L(Ti(e,t,n)),Di=(e,t,n)=>Ei(e,t,n).elements,Oi=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw bi(n,`${n} expects a sequence but received ${z(r)}`);return i},ki=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw bi(n,`${n} expects a function but received ${z(r)}`);return Ar(r)},Ai=(e,t,n)=>{let r=e[t];if(r===void 0||!xi(r))throw bi(n,`${n} expects an operator as argument ${t+1}`);return r},ji=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(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}),Mi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ni=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Pi=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Fi=e=>e>2147483647||e<-2147483648,Ii=e=>new S(`Overflow when computing ${e}`),Li={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`},Ri={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},zi={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`},Bi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Vi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ri[e.operator];if(e.kind!==`Function`)return Li[e.kind];let t=Kt(e);return t===void 0?`FcnRcdValue`:Bi[t]},Hi=e=>zi[Vi(e)],Ui=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Wi=(e,t)=>{let n=n=>(...r)=>{let i=Tr.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof S))?(Tr.sets&&(Tr.sets.length=i),Ui(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Gi=(e,t)=>{if(typeof e!=`number`)throw Ui(t,`Cannot cast tlc2.value.impl.${Vi(e)} to tlc2.value.impl.IntValue`);return e},Ki=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,qi=(e,t,n,r)=>{let i=Ki(e,n,`IntValue`,2);return Pi(t,(e,n)=>{let a=Gi(e,i),o=Gi(n,i),s=r(a,o);if(Fi(s))throw Ii(`${a}${t}${o}`);return s})},Ji=(e,t,n)=>{if(typeof e!=`number`)throw new S(`The ${t} argument of ${n} should be an integer, but instead it is:\n${z(e)}`);return e},Yi=(e,t,n=e)=>Pi(e,(e,r)=>t(Ji(e,`first`,n),Ji(r,`second`,n))),Xi=(e,t,n)=>({...Ni(e,t,n),isLazy:!0}),Zi=(e,t,n)=>{let r=Ai(e,t,n);return()=>r.call([])},Qi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),$i=()=>({bool:gl,condition:(e,t)=>{if(typeof e!=`boolean`)throw nl(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw rl(t,n,e);return e},apply:Ir,expectFunction:pl,tuple:$n,set:Rn,record:tn,writtenRecord:vt,equal:nn,enumerate:Dl,unassigned:(e,t)=>{throw Dd(e,t)},primeOutsideAction:e=>{throw kd(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:ml,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>dl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),ea={value:void 0},ta=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),na=e=>`local${e.counter++}`,ra=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),vi(e).forEach(e=>ra(e,t)),t),ia=(e,t,n)=>{let r=ta(e,Wu(t,e.environment)),i=ra(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=ta(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},aa=(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(()=>na(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${ca(e,t.set,s)}, ${ta(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=na(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${ca(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=na(e),a=na(e),o=na(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; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},oa=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${ca(e,r[0],n)}, "the left side of =>") ? bool(${ca(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ia(e,t,n);let i=$l(t.operator,e.environment);if(i?.kind!==`Builtin`)return ia(e,t,n);if(i.name===`DOMAIN`)return`${ta(e,ol(t))}(${ca(e,r[0],n)})`;if(i.name===`TLCEval`)return ia(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${ta(e,sl(t,i))}(${ca(e,r[0],n)}, ${ca(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Zu(r[0],a))return`${ta(e,i.evaluateUnary)}(${ca(e,r[0],n)})`;let o=r.length===2&&Zu(r[0],a)&&Zu(r[1],a);return i.evaluateBinary&&o?`${ta(e,i.evaluateBinary)}(${ca(e,r[0],n)}, ${ca(e,r[1],n)})`:ia(e,t,n)},sa=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=lu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return sa(e.expression,t,n);case`FieldAccess`:return sa(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>sa(e,t,n));default:return!1}},ca=(e,t,n)=>{let r=(t,r=n)=>ca(e,t,r);if(Fu(t)&&Au(t,e.environment))return ia(e,t,n);switch(t.kind){case`Number`:return _u(t.value)?String(t.value):ia(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return ia(e,t,n);let i=lu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=ta(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?ta(e,i.value):ia(e,t,n)}case`Apply`:return oa(e,t,n);case`And`:case`Or`:{let n=ta(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)}, ${ta(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{xd(t.function);let i=`expectFunction(${sa(t.function,n,e.environment)?r(t.function):ia(e,t.function,{...n,context:`keepLazyContext(${n.context})`})}, ${ta(e,t)})`,a=al(e.environment.runtime.version),o=a?`, ${ta(e,a)}`:``;return t.args.length===1?`apply(${i}, ${r(t.args[0])}${o})`:`apply(${i}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${o})`}case`FieldAccess`:return`${ta(e,il(t))}(${r(t.record)})`;case`Record`:{let i=Td(t.fields);if(Ed(i))return ia(e,t,n);let a=ta(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}, ${ta(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=ta(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`)?aa(e,t,n):ia(e,t,n);default:return ia(e,t,n)}},la=(e,t)=>{if(!Qi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=ca(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(`
|
|
29
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; return ${r}; };`;ea.value??=$i();let o=ea.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ua={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},da={none:0,error:1,warning:3,state:4},fa={0:``,1:`Error: `,3:`Warning: `,4:`State `},pa=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===da.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
|
|
30
|
-
(Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${fa[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},ma=`The configuration file did not specify the initial state predicate.
|
|
31
|
-
Can also be caused by trying to run TLC on a specification from
|
|
32
|
-
a module imported with a parameterized INSTANCE statement.`,ha=[[1005,b,!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:
|
|
33
|
-
%1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
34
|
-
%1%,
|
|
35
|
-
but it produced the following error:
|
|
36
|
-
%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.
|
|
37
|
-
`,!1],[2155,`Attempted to compare %1% with the value
|
|
38
|
-
%2%`,!0],[2158,`Attempted to check if the value:
|
|
39
|
-
%1%
|
|
40
|
-
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
41
|
-
the following value:
|
|
42
|
-
%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:
|
|
43
|
-
%4%`,!0],[2176,`Applying %1% to the following value,
|
|
44
|
-
which is not %2%:
|
|
45
|
-
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
46
|
-
element is not a bag:
|
|
47
|
-
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
48
|
-
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
49
|
-
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
50
|
-
%4%
|
|
51
|
-
, but instead it is
|
|
52
|
-
%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
|
|
53
|
-
on the right-hand side of a <- after already appearing on the
|
|
54
|
-
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
|
|
55
|
-
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,ma,!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],[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:
|
|
56
|
-
%1%`,!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.
|
|
57
|
-
%1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
58
|
-
but instead found %3%.
|
|
59
|
-
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
60
|
-
but didn't find one.
|
|
61
|
-
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
62
|
-
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
63
|
-
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
64
|
-
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
65
|
-
%4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
66
|
-
%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:
|
|
67
|
-
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
68
|
-
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
69
|
-
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
70
|
-
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
71
|
-
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
72
|
-
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
73
|
-
`,!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]],ga={value:void 0},_a=()=>ga.value??=ha.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),va=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,ya=e=>va.test(e)?void 0:_a().find(t=>t.pattern.test(e))?.message,ba=e=>e instanceof S||ya(e.message)?.isEvalException===!0,xa=/* @__PURE__ */ new Map([[1e3,`
|
|
74
|
-
: `],[2105,`failed.
|
|
75
|
-
`],[2154,`but it produced the following error:
|
|
76
|
-
`],[2213,`:
|
|
77
|
-
`],[2281,` - specifically: `]]),Sa=(e,t,n)=>{let r=n?xa.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)}${Ca(t.slice(a),n)}`},Ca=(e,t)=>{let n=t?ya(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${da.none} @!@!@\n${Sa(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},wa=e=>String(e).padStart(2,`0`),Ta=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 ${wa(r%24)}h`:e>36e5?`${wa(r%24)}h ${wa(n)}min`:e>6e4?`${wa(n)}min ${wa(t)}s`:`${wa(t)}s`},Ea=e=>`${e.getFullYear()}-${wa(e.getMonth()+1)}-${wa(e.getDate())} ${wa(e.getHours())}:${wa(e.getMinutes())}:${wa(e.getSeconds())}`,Da={kind:`Local`},Oa=/* @__PURE__ */ new WeakSet,ka=/* @__PURE__ */ new WeakMap,Aa=/* @__PURE__ */ new WeakMap,ja=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Ma=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Na=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Pa=e=>e.kind===`Operator`?e.params.length:0,Fa=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ia=e=>e.name.includes(`!`),La=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ra=(e,t,n)=>{let r=t.bindings.get(e);return r&&Na(r.position,t.location)&&(!n||Na(r.position,n.start))?r:void 0},za=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),Ba=(e,t,n,r)=>{if(t===void 0)return!0;if(za(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=g(i),o=t.range&&g(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},Va=(e,t,n,r)=>Ba(t,La(e,t)??Ra(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ha=(e,t,n)=>{Ba(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ua=(e,t,n,r)=>t.reduce((e,t,i)=>Va(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Wa=(e,t,n)=>t.reduce((e,t)=>Va(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ga=e=>e.kind===`Name`?[e.name]:e.names,Ka=e=>e.flatMap(e=>Ga(e.pattern)),qa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Na(n.location,t.location))?n:void 0},Ja=(e,t)=>{let n=qa(e,t);return n?{key:t.getKey(n),arity:Pa(n),params:Fa(n),kind:`Definition`}:t.imported.get(e)},Ya=(e,t,n)=>La(t,e)??Ja(e,n),Xa=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Za=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Xa(e.location,e.spelling??t)},Qa=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Na(e.location,e.args[0].location)?`prefix`:`postfix`}},$a=e=>!/^[\p{L}\d_]/u.test(e),eo=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),to=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,no=(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])}})},ro=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?no(e.name,[],void 0):no(e.operator,e.args,e.argumentCounts),io=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),ao=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ka(e.bounds),body:e.body,sets:io(e.bounds)};case`SetMap`:return{names:Ka(e.bounds),body:e.expression,sets:io(e.bounds)};case`SetFilter`:return{names:Ga(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ga(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}},oo=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}},so=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,co=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),lo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?lo(e.body,t):vi(e).reduce((e,n)=>e??lo(n,t),void 0)},uo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??uo(i,t,n||co(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&lo(e.set,t):lo(e,t)},fo=e=>e.kind===`Label`?fo(e.body):e,po=e=>typeof e==`number`?`argument selector ${e}`:e,mo=`within the scope of a declaration
|
|
78
|
-
from outside that declaration's scope.`,ho=(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:g(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`&&fo(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:uo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?lo(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&co(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${mo}`);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=po(n.operand);if(l.isSufficesOpen){if(to(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=fo(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ya(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=ao(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:oo(e);if(!c)return;let f=to(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=to(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(co(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${mo}`);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.`))},go=(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:g(e.location.range),message:n}),!0)},_o=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=La(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(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)},vo=(e,t,n,r)=>{if(!so(e))return!1;let i=ro(e),a=i[0],o=i.length>1&&a.kind===`Name`?La(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&ho(e,i,o,t,n,r),o!==void 0},yo=(e,t,n,r)=>{let i=e.location;if(ko(e,n,r))return;let a=Aa.get(e);if(a!==void 0)return a;if(ja(t))return e.kind===`Apply`?e.args.length:0;let o=La(n,t);if(o?.isNonFact){r.errors.push({location:g(Za(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(vo(e,n,r,!1)||eo(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Da),o)return o.arity;let s=Ja(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Aa.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(La(n,c)!==void 0||Ja(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=g(e.kind===`Apply`&&l===`-.`?Xa(i,`-`):Za(e,t));if(!$a(t)||eo(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=Qa(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},bo=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>Ua(e,Ga(t.pattern),t.pattern.ranges,n),t)),xo=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||vi(e).some(e=>xo(e,t)),So=(e,t)=>{e.kind===`FunctionConstruction`&&xo(e.body,t)&&(e.isRecursive=!0),vi(e).forEach(e=>So(e,t))},Co=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ka(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?bo(e.bounds,t,i):Wa(t,e.params,i),l=La(c,a)??Ra(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`?(U(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),So(e.body,a),e.isSelfReferential=xo(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Ba(a,La(t,a)??Ra(a,i,o),{kind:`Definition`,arity:Pa(e),range:o},i)},wo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(La(e,t.name)?.isPending)return e;let n={name:t.name,arity:Pa(t),params:Fa(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)=>Fo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=ja(t.name)?e:s(e,e=>!Na(t.location,e.location)),o={name:t.name,arity:Pa(t),kind:`Definition`,range:t.location.range,parent:a};if(Ia(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||ja(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Co(t,a,u,i)?{...o,params:Fa(t)}:a},a),()=>!0)},To=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:La(t,r)??Ra(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Eo=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=To(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:g(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Do=(e,t,n)=>{if(Eo(e,t,n))return;let r=e.operator,i=Ya(r,t,n),a=yo(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??Za(e,r)),message:`The operator ${r} requires ${a-(To(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Oo(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:g(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=yo(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else U(i,t,n);return!0}if(i.kind===`Lambda`){U(i,t,n);let o=i.params.length===c;return!o&&Oa.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)??Za(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 U(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=Ya(u,t,n)?.params??[],f=yo(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(Za(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.`)})},Oo=(e,t,n)=>{e.kind===`Identifier`?yo(e,e.name,t,n):U(e,t,n)},ko=(e,t,n)=>{let r=ka.get(e);return r?(r.args.forEach(e=>Oo(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Oa.has(e)&&!n.isGenerated){U(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>U(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(Eo(e,t,n))return;let r=e.name,i=yo(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(Za(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:yo(e,e.operator,t,n);return;case`Apply`:Do(e,t,n);return;case`Lambda`:U(e.body,Ua(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`:U(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&&U(e.other,t,n);return;case`Let`:U(e.body,wo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,bo(e.bounds,t,n),i(Ka(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,Ua(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,Ua(t,Ga(e.pattern),e.pattern.ranges,n),i(Ga(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,bo([e.bound],t,n),i(Ga(e.bound.pattern)));return;case`SetMap`:U(e.expression,bo(e.bounds,t,n),i(Ka(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:g(r.location.range??Xa(r.location,r.name)),message:`Non-unique fields in constructor.`}),U(r.value,t,n)});return;case`Except`:U(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:U(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(go(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),_o(e,t,n);return;case`Subexpression`:if(ko(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Oo(e,t,n)),vo(e,t,n,!1)}},Ao=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Eo(e,t,n)||vo(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&La(t,r)?.isNonFact?n.errors.push({location:g(Za(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||U(e,t,n)}),jo=(e,t,n)=>(e.set&&U(e.set,t,n),Va(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Mo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:jo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Mo(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},No=(e,t,n)=>e.kind===`AssumeProve`?Mo(e,t,n):(U(e,t,n),t),Po=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Ao(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Io(t,e,r),t)},Fo=(e,t,n)=>{let r=Ho(e,t,n);return e.name===void 0?r:Va(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Io=(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=No(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Po(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Po(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 Ao(r.facts,t,n),o(t);case`Instance`:return o(Fo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Fo(t,e,i):wo([t],e,n),t));case`Have`:case`Case`:return U(r.expression,t,i),Po(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),a(t);case`Take`:return a(Ua(bo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ua(bo(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,o,{...i,labelParams:[...i.labelParams,...Ka(r.bounds),...r.names]}),Po(e.proof,a(t),n),a(o)}default:return Po(e.proof,a(t),n),a(t)}},Lo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:No(e.statement,void 0,t);e.name!==void 0&&Ha(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Po(e.proof,n,t),r&&(r.isInProof=!1)},Ro={line:0,column:0},zo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Bo=(e,t)=>{let n=new Map([...Ma,...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},Vo=(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`){U(n,a,i);return}let r=yo(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new u(`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:g(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:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),l=e=>!La(a,e.name)&&!Ja(e.name,i);return c.filter(e=>!l(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(l).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},Ho=(e,t,n)=>{let r=n.getInstance(e);return Vo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Va(e,t,r,n),t)},Uo=(e,t,n,r)=>{let i=Bo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Vo(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:Ro}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Wo=(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)=>Na(e.location,t.location)?-1:+!!Na(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof u)||!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},Go=(e,t)=>{let n=Bo(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([...Ma,...t.bound].map(([e,t])=>[e,{...t,position:Ro}])),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)=>Ha(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Wo([...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=Ba(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);zo(e,t)?U(t.body,void 0,i):Co(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:Pa(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);Wa(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Ha(t,e,i)),e.name!==void 0&&Ha(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);U(e.expression,void 0,r),e.name!==void 0&&Ha(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Lo(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Ao(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:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Ko=/* @__PURE__ */ new WeakSet,qo=/* @__PURE__ */ new WeakSet,Jo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=es(e,(e,r)=>Jo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Yo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Xo=/* @__PURE__ */ new WeakMap,Zo=e=>Xo.get(e)??e.name,Qo=(e,t)=>(Zo(t)!==e.name&&Xo.set(e,Zo(t)),e),$o=(e,t)=>Qo(e.kind===`Function`?{...e,bounds:Yo(e.bounds,e=>t(e,[])),body:t(e.body,Ka(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),es=(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=>$o(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Yo(e.bounds,n),body:t(e.body,Ka(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,Ga(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,Ga(e.bound.pattern))};case`SetMap`:return{...e,bounds:Yo(e.bounds,n),expression:t(e.expression,Ka(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)}}},ts=`LAMBDA`,ns=(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 es(e,(e,n)=>(r.push(...ns(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},rs=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}},is=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),as=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},os=(e,t)=>e.map(e=>({pattern:as(e.pattern,t),set:e.set})),ss=(e,t)=>e.kind===`Function`?{...e,bounds:os(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},cs=(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=>Qo({...ss(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:os(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:as(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:as(e.bound.pattern,n),set:e.bound.set}};default:return e}},ls=e=>`${e}@ENABLED`,us=(e,t)=>e.modes.get(t)??e,ds=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),fs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>fs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(ds(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?fs(r.body,t,/* @__PURE__ */ new Map):void 0},ps=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ds(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ls(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:vs(e.expression,us(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[vs(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:vs(e.subscript,us(t,`Primed`),n),location:r},vs(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=fs(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:ls(r),location:e.location},location:e.location},vs({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ms=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),hs=(e,t)=>e.map(e=>ms(e.name,t)),gs=(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:[...hs(t,r),...i.map(e=>ms(e,r))],location:r},location:r}},_s=(e,t)=>e.instantiation.isParameterized(t)?bs(e,t):void 0,vs=(e,t,n)=>{let r=e=>vs(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!B(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:vs(e.expression,us(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:vs(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},us(t,`Enabled`),n)};let s=ps(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Ko.add(n),n;let r=_s(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&&Pa(o)>0?gs(r,a,Pa(o),e.location):{kind:`Apply`,operator:r,args:hs(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||qo.has(e),c=e=>(s&&qo.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:ts,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:ts,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=_s(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...hs(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=_s(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?gs(n,a,Pa(r),e.location):{...e,operator:n}}let c=rs(t),l=es(e,(e,i)=>i.length===0?r(e):vs(e,t,is(n,i,c)));return cs(l,n,c)},ys=(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:ms(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},bs=(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=rs(e),o=ss($o(i,(t,n)=>vs(t,e,is(/* @__PURE__ */ new Map,n,a))),a);return ys(o,r.params,i.location)}):t},xs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ns(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=>_s(i,e)??e,getQualifiedKey:t=>{let n=_s(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ys(r,e.params,r.location)):t}}},Ss=e=>e.kind===`Let`&&e.instances!==void 0||vi(e).some(Ss),Cs=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=es(e,e=>Cs(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Na(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}},ws=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Ts=(e,t)=>e.definitions.some(e=>Ss(e.body))||e.assumptions.some(e=>Ss(e.expression))||e.theorems.some(e=>{let t=ws(e);return t!==void 0&&Ss(t)})?{...e,definitions:e.definitions.map(e=>$o(e,e=>Cs(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Cs(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ws(e);return n===void 0?e:{...e,statement:Cs(n,t,[])}})}:e,Es=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=Tr.sets,a=i??[],o=a.length;Tr.sets=a;try{return n()}catch(e){throw Vu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,Tr.sets=i}},Ds=(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},Os=e=>!e.includes(void 0),ks=e=>e.variables.map(()=>void 0),As=(e,t,n)=>{let r=[...e];return r[t]=n,r},js=(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}},Ms=e=>e.kind===`Identifier`?e.name:void 0,Ns=(e,t,n)=>{if(t.kind===`Label`)return Ns(e,t.body,n);let r=Ms(t);if(r===void 0)return;let i=ul(n,r);if(i?.kind===`Thunk`)return Ns(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=$l(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Ns(e,o.body,o.scope):void 0},Ps=(e,t,n)=>{if(t.kind===`Prime`)return Ns(e,t.expression,n);if(t.kind===`Label`)return Ps(e,t.body,n);let r=Ms(t);if(r===void 0)return;let i=ul(n,r);if(i?.kind===`Thunk`)return Ps(e,i.expression,i.scope);if(i)return;let a=$l(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Ps(e,a.body,a.scope):void 0},Fs=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},Is=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Ls=(e,t,n)=>{t===void 0?Os(n)&&e.onState(n):Os(n)&&Is(e)?zs(e,t,n):t.kind===`Predicate`?Bs(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Ys(e,t.expression,t.rest,t.scope,n):Rs(e,t,n)&&Ls(e,t.rest,n)},Rs=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Od(t,r.runtime.version):t}})();return!nn(i,a)},zs=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Ys(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Rs(e,r,n):!Fs(W(r.expression,Ds(e,r.scope,n))))return}e.onState(n)},Bs=(e,t,n,r,i)=>Es(e,t,()=>{switch(t.kind){case`Let`:Bs(e,t.body,n,hu(t.definitions,Ds(e,r,i)),i);return;case`Label`:Bs(e,t.body,n,r,i);return;default:if(qs.has(t.kind))throw new y(`The state relation is not a boolean expression.`);Es(e,t,()=>Js(e,t,n,r,i))}}),Vs=(e,t,n,r)=>{Fs(t)&&Ls(e,n,r)},Hs=(e,t,n,r,i)=>{let a=Ds(e,r,i);if(t.kind===`Identifier`){let o=ul(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Bs(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Bs(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:$l(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&xl(s,e.environment))){Bs(e,c.body,n,c.scope,i);return}Vs(e,W(t,a),n,i);return}let o=tu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Bs(e,o.body,n,pu(o,t.args,a),i):Vs(e,W(t,a),n,i)},Us=(e,t,n,r,i)=>{let a=n[r];a===void 0?Ls(e,t,As(n,r,i)):nn(a,i)&&Ls(e,t,n)},Ws=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Gs=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Ns(e,a,r):Ps(e,a,r),c=Ds(e,r,i);if(s===void 0){W(t,c)===!0&&Ls(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){Us(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&Ls(e,n,i);else{if(!tr(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of pr(d))Ls(e,n,As(i,s,t))}},Ks=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),qs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Js=(e,t,n,r,i)=>{let a=Ds(e,r,i);switch(t.kind){case`Identifier`:Hs(e,t,n,r,i);return;case`Apply`:if(Ks.has(t.operator)&&t.args.length===2){Gs(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(Fs(W(t.args[0],a))){Bs(e,t.args[1],n,r,i);return}Ls(e,n,i);return}Hs(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)=>Ws(`Predicate`,t,r,e),n);Bs(e,a[0],t,r,i);return}let o=a[a.length-1];Bs(e,js(t,a.length-1),Ws(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Bs(e,t,n,r,i));return}Bs(e,js(t,a.length-1),n,r,i),Bs(e,a[a.length-1],n,r,i);return}case`Exists`:Ml(t.bounds,a,r=>(Bs(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Ml(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Ls(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Ws(`Predicate`,t.body,n,e),n);Bs(e,t.body,o,r[0],i);return}case`If`:Bs(e,Fs(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>Fs(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);Bs(e,o,n,r,i);return}case`FunctionApplication`:{let r=Ll(W(t.function,e.isInit?a:ml(a)));if(r){Bs(e,r.body,n,Rl(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){Ys(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Bs(e,t.action,n,r,i),Ys(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Bs(e,t.action,Ws(`Changed`,t.subscript,r,n),r,i);return}}Vs(e,W(t,a),n,i)},Ys=(e,t,n,r,i)=>Es(e,t,()=>{let a=Ns(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Us(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Ls(e,n,i);return}let s=o.reduceRight((e,t)=>Ws(`Unchanged`,t,r,e),n);Ys(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ul(r,t.name);if(a?.kind===`Thunk`){Ys(e,a.expression,n,a.scope,i);return}let o=a?void 0:$l(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Ys(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});nn(s,c)&&Ls(e,n,i)}),Xs=(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}},Zs=/* @__PURE__ */ Error(`The replay found a successor`),Qs=(e,t,n,r)=>{let i=Xs(r,!1,n,()=>{throw Zs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Ws(`Changed`,e.subscript,t,void 0);Bs(i,e.action,n,t,ks(r))}else Bs(i,e,void 0,t,ks(r));return!1}catch(e){if(e!==Zs)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},$s=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Xs(t,!0,void 0,n),o=i.reduceRight((e,t)=>Ws(`Predicate`,t.expression,t.scope,e),void 0);Bs(a,r.expression,o,r.scope,ks(t))},ec=(e,t,n,r)=>{e.some(e=>qs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Xs(n,!1,t,e=>i.push(e));Bs(a,e.expression,void 0,e.scope,ks(n)),i.forEach(t=>r(t,e))})},tc=/* @__PURE__ */ new WeakMap,nc=/* @__PURE__ */ new WeakMap,rc=(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},ic=(e,t,n)=>{let r=e.slice();return r[t]=n,r},ac=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,oc=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},sc=(e,t,n,r)=>{let i=tl(n);return r&&qs.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 ${ac(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},cc=(e,t,n)=>{let r=Hi(t),i=el(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 ${ac(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
79
|
-
`:``}${i}`},lc=(e,t,n,r=!0)=>{let i=W(t,n);if(typeof i==`boolean`)return i;throw oc(e,sc(e,i,t,r))},uc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,dc=(e,t,n)=>{let r=n?tc:nc,i=r.get(e);if(i)return i;let a=Rc(e,t,n);return r.set(e,a),a},fc=(e,t)=>{if(t.constants.has(e))return;let n=_l(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},pc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return pc(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=fc(e.name,t);if(a&&!r.has(a))return r.add(a),pc(a.body,t,n,r)},mc=(e,t,n)=>pc(e,t,!n),hc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return hc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=hu(e.definitions,rc(r,t,n));return hc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ul(t,e.name);if(a?.kind===`Thunk`)return hc(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=fc(e.name,r.environment);if(s)return hc(s.body,void 0,n,r,i)},gc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,_c=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>_c(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=fc(e.name,t);if(i)return n.add(e.name),_c(i.body,t,n)},vc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),yc=(e,t,n)=>vc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||uc(e.operator)&&(gc(e.args[0],n)||mc(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,bc=/* @__PURE__ */ new Set,xc=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return es(e,(e,i)=>{let a=r.isReadOnly?xc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Sc=(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||B(e)?void 0:_l(r,t);return i&&!n.has(i)&&(n.add(i),Sc(i.body,t,n))?!0:vi(e).some(e=>Sc(e,t,n))},Cc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=mc(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=_c(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return yc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:dc(e,t,n)}},wc=(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(Pd(e,t)===void 0||Sc(e,t,/* @__PURE__ */ new Set))return!0;let n=xc(e,bc);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)}},Tc=(e,t,n)=>{let r=e.map(e=>Cc(e,t,n)),i=(e,t,n,a,o,s)=>{let c=a,l,u=Is(t);for(let a=e;a<r.length;a++){if(a>0&&u&&Hc(c)){l??=rc(t,n,c);for(let e=a;e<r.length;e++)if(!lc(t,r[e].expression,l,!1))return;s(c,o);return}let e=r[a];if(e.kind===`Guard`){if(l??=rc(t,n,c),!lc(t,e.expression,l))return;continue}if(e.kind===`Assign`){l??=rc(t,n,c);let r=W(e.value,l),i=c[e.index];if(i===void 0)c=ic(c,e.index,r),l=void 0;else if(!nn(i,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=c[t];if(e===void 0)c=ic(c,t,n[t]),l=void 0;else if(!nn(e,n[t]))return}continue}let d=a+1;e.runner(t,n,c,o,!0,(e,r)=>i(d,t,n,e,r,s));return}s(c,o)};return(e,t,n,r,a,o)=>i(0,e,t,n,r,o)},Ec=e=>(t,n,r,i,a,o)=>{lc(t,e,rc(t,n,r))&&o(r,i)},Dc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=rc(r,i,a);if(a[l]!==void 0){lc(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!tr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${ac(r)}, the right side of \\IN is not enumerable.`;throw oc(r,`${t}\n${el(e)}`)}let p=pr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(ic(a,l,p[e]),o)}},Oc=/* @__PURE__ */ new WeakMap,kc=e=>{let t=Oc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(kc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Oc.set(e,n),n},Ac=(e,t)=>{let n=e.args[0],r=Ec(e),i=(e,r,i)=>hc(n,r,i,e,!t)??-1,a=Dc(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],rc(t,n,o));l(ic(o,u,d),s)}},jc=(e,t,n)=>{let r=el(e);return(i,a,o,s,c,l)=>{let u=rc(i,a,o),d=W(e.function,n?u:ml(u)),f=Ll(d);if(f!==void 0){dc(f.body,t,n)(i,Rl(f,e,u),o,s,c,l);return}if(!P(d))throw oc(i,`In computing ${ac(i)}, a non-function (${Hi(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw oc(i,`In computing ${ac(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Mc=(e,t)=>{if(_c(e,t))return Tc([kc(e)],t,!1);if(e.kind===`Tuple`)return dc(kc(e),t,!1);let n=kc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ul(i,e.name):void 0;l?.kind===`Thunk`?dc(kc(l.expression),t,!1)(r,l.scope,a,o,s,c):lc(r,n,rc(r,i,a))&&c(a,o)}},Nc=(e,t,n)=>{let r=e.operator,i=Ec(e),a=B(e)?void 0:$l(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=ed(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=dc(a.body,t,n),o.body(e,i(rc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=rc(a,o,s),f=tu(e,d);f?.kind===`Closure`?dc(f.body,t,n)(a,pu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Pc=(e,t,n)=>{let r=Ec(e),i=B(e)?void 0:fc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ul(s,e.name);f?.kind===`Thunk`?dc(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=dc(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Fc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||B(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!B(a))return;let o=pc(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Fc(e,t,n)),i=r[0],a=r.every(e=>e!==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}}if(e.kind!==`Apply`||B(e))return;let r=$l(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Fc(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`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Ic=(e,t,n)=>{let r=ul(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},Lc=(e,t,n)=>{let r=e.map(e=>dc(e,t,n)),i=n?[]:e.map(e=>Fc(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?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Ic(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Rc=(e,t,n)=>{let r=e=>dc(e,t,n);switch(e.kind){case`And`:return Tc(e.operands,t,n);case`Or`:return Lc(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=Tl(W(a.set,rc(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,dl(r,e,u[t]),o,s,c,l)}}let o=n?void 0:wc(e,t);if(o){let r=Tc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=rc(n,i,a),d=e.bounds.map(e=>Tl(W(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=dl(t,o.names[e],r);if(e===d.length-1){let e=rc(n,i,a);if(!o.guards.every(t=>lc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Ml(e.bounds,rc(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Pd(e,t)!==void 0&&!Sc(e.body,t,/* @__PURE__ */ new Set)?xc(e,bc):void 0;return(t,n,r,o,s,c)=>{let l=[];Ml(e.bounds,rc(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ul(n,e)?.kind===`Value`)){u.every(n=>lc(t,e.body,rc(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Hc(r)?u.slice(n).every(n=>lc(t,e.body,rc(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,rc(r,i,a));if(typeof l!=`boolean`)throw oc(r,cc(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=rc(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw oc(r,`In computing ${ac(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Hi(t)}) was used as a guard condition of a CASE.\n${tl(e.source)}`)})?.body??n;if(!u)throw oc(r,`In computing ${ac(r)}, TLC encountered a CASE with no conditions true.\n${el(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Eu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,hu(e.definitions,rc(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${Qc(e)}`)}:Mc(e.expression,t);case`AngleAction`:{let n=r(e.action),i=kc(e.subscript),a=(e,n,r)=>{try{return lc(e,i,rc(e,n,r))}catch(n){throw e.isEnabled?Od(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,kc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Pc(e,t,n);case`FunctionApplication`:return jc(e,t,n);case`Apply`:{let i=e.args;if(uc(e.operator)){let r=mc(i[0],t,n);if(r!==void 0)return e.operator===`=`?Tc([e],t,n):Dc(e,()=>r);if(gc(i[0],n))return Ac(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],rc(t,n,r));(typeof c==`boolean`?c:gl(c,`the left side of => at ${Qc(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Nc(e,t,n)}default:return Ec(e)}},zc=/* @__PURE__ */ new WeakMap,Bc=e=>{let t=zc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return zc.set(e,n),n},Vc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Hc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Uc=(e,t)=>{let n=t.state;if(!n||!Hc(n))throw new y(`ENABLED needs a complete state at ${Qc(e)}`);let r=t.environment;if(r.callStack)return Qs(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return dc(e,r,!1)(i,t.scope,Bc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Wc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};dc(t,r,!0)(o,a,Bc(r),void 0,!1,t=>{if(!o.isStopped){if(!Hc(t))throw n(new ne([...t]),e.error);o.isStopped=i(t)}})},Gc=(e,t,n)=>{let r=[];return Wc(e,t,e=>(r.push(e),!1),n),r},Kc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return dc(e,n,!1)(a,i,Bc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Hc(e)){let r=Vc(e,n);throw new ee(`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},qc=(e,t,n,r)=>{let i=[];return Kc(e,t,n,e=>(i.push(e),!1),r),i},Jc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Yc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Xc=e=>Yc.has(e.kind)||e.kind===`Apply`&&Jc.has(e.operator),Zc=(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&&ft(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Qc=e=>`line ${e.location.line}, column ${e.location.column}`,$c=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,el=e=>{let t=e.location.range;return t?$c(t):Qc(e)},tl=e=>e.kind===`Number`?e.text??String(e.value):el(e),nl=(e,t)=>new y(`A non-boolean expression (${Hi(t)}) was used as the condition of an IF.\n${el(e)}`),rl=(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 (${Hi(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${tl(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${Hi(n)}.\n${el({...e,location:{...e.location,range:{...r,end:i}}})}`)},il=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${el(e)}`,r=e=>`Attempted to apply function:\n${dt(z(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!P(i))throw new y(`Attempted to select field "${t}" from a non-record value ${dt(z(i))}\n${el(e)}`);let a=Kt(i);if(a===`tuple`)throw Pr(t);return Ir(i,t,a===`record`?n:r)}},al=e=>e===`1.7.4`?(t,n)=>jr(t,n,e):void 0,ol=e=>t=>{if(!P(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Hi(t)})\n${el(e)}`);return Rr(t)},sl=(e,t)=>(n,r)=>{if(!N(n)||Pt(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${el(e)}`);return t.evaluate([n,r])},cl=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${Qc(t)}`),e.configParseError),ll=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${Qc(t)}`),e.error),ul=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},dl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),fl=(e,t,n)=>{if(t.kind===`Name`)return dl(e,t.name,n);let r=Cr(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${z(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>dl(e,t,r[n]),e)},pl=(e,t)=>{if(P(e))return e;throw new y(`A non-function (${Hi(e)}) was applied as a function.\n${el(t)}`)},ml=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},hl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),gl=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},_l=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),vl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),yl=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),bl=(e,t)=>{if(vl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&yl.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=_l(n,t);if(e&&!t.constants.has(n)&&!xl(e,t))return!0}return vi(e).some(e=>bl(e,t))},xl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!bl(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>bl(e.set,t)));return t.constantLevels.set(e,r),r},Sl=(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.`},Cl=(e,t,n)=>{if(!N(e)||Pt(e)){let r=z(e),i=n===`1.7.4`?void 0:Sl(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${tl(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${tl(t)}\n${i}`)}},wl=(e,t,n)=>(Cl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Yn(e):cr(e)??L(e).elements),Tl=(e,t,n)=>n===`1.7.4`?(Cl(e,t,n),cr(e)??pr(e)):wl(e,t,n),El=e=>{if(typeof e==`object`&&e.kind===`Interval`)return yr(e),e},Dl=(e,t,n)=>El(e)??Tl(e,t,n),Ol=(e,t,n)=>El(e)??wl(e,t,n),kl=(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},Al=(e,t)=>e.map(e=>Dl(W(e.set,t),e.set,t.environment.runtime.version)),jl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):kl(t[n],t=>i(n-1,fl(a,e[n].pattern,t)));return i(e.length-1,n)},Ml=(e,t,n)=>jl(e,Al(e,t),t.scope,n),Nl=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Pl=(e,t,n)=>{if(e.length===1)return fl(t,e[0].pattern,n);let r=Cr(n)??[];return e.reduce((e,t,n)=>fl(e,t.pattern,r[n]),t)},Fl=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Il=e=>Object.assign(e.value,{lambda:e}),Ll=e=>Fl(e)?e.lambda:void 0,Rl=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:$n(i),o=(e,n,i)=>`In applying the function\n${dt(z(r))},\nthe ${e} is:\n${dt(z(n))}${i}.\n${el(t.function)}`,s=e.bounds;if(s.length===1){if(!Dr(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Pl(s,e.scope,a)}let c=Cr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new y(`Attempted to apply a function to an argument not in its domain.\n${el(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Dr(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
80
|
-
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Cr(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),Pl(s,e.scope,$n(c.slice(0,s.length)))},zl=/* @__PURE__ */ new WeakMap,Bl=(e,t)=>{let n=zl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={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:$c(r)};return zl.set(t,i),i},Vl=(e,t,n)=>{let r=Bl(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Hl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Zr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(an(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Ul=/* @__PURE__ */ new WeakMap,Wl=e=>{let t=Ul.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Ul.set(e,n),n},Gl=(e,t)=>{let n=Nl(e.bounds,t),r=Hl(n,(n,r)=>W(e.body,hl(t,Pl(e.bounds,dl(void 0,e.name,r),n))),Vl(e.bounds,e.body,n));return Il({value:r,bounds:e.bounds,body:e.body,scope:dl(void 0,e.name,r)}),e.bounds.length===1?qt(r):r},Kl=(e,t)=>{if(typeof t!=`object`||Kt(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ft(t.domain))return t;try{let e=Ar(t);return Ut(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},ql=(e,t)=>e.kind===`Function`?e.isSelfReferential?Gl(e,t):W(Wl(e),t):W(e.body,t),Jl=(e,t)=>{let n=xl(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new y(`Operator ${e.name} requires ${e.params.length} arguments`);let i=hl(t,void 0);if(!n)return ql(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Kl(e,ql(e,i)));return t.environment.definitionValues.set(e,a),a},Yl=(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))&&xl(e,t))try{Pn(Jl(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),Xl=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,hl(t,e.scope));return n&&(e.cache=r),r},Zl=/* @__PURE__ */ new WeakMap,Ql=e=>{let t=Zl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Zl.set(e,n),n},$l=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return $l(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Ql(r):t.builtins.get(e)},eu=/* @__PURE__ */ new WeakMap,tu=(e,t)=>{if(B(e))return nu(e.operator,t);let n=eu.get(e),r=n===void 0?$l(e.operator,t.environment)??null:n;return n===void 0&&eu.set(e,r),r??nu(e.operator,t)},nu=(e,t)=>{let n=ul(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return $l(e,t.environment)},ru=e=>e.kind===`Closure`?e.params.length:e.arity,iu=(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:nu(n,t);if(!r)throw new y(`Expected an operator argument at ${Qc(e)}`);return r},au=(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)=>dl(e,n.name,t[r]),e.scope);return W(e.body,hl(n,r))},ou=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:ru(e),call:n=>au(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},su=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=nu(e.name,t);return n!==void 0&&ru(n)>0},cu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0}),lu=(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 lu(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([])}},uu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&_u(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:lu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ul(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:cu(e,t)}}return t=>cu(e,t)},du=/* @__PURE__ */ new WeakMap,fu=(e,t)=>{let n=du.get(e);if(n)return n;let r=uu(e,t);return du.set(e,r),r},pu=(e,t,n)=>{if(t.length!==e.params.length)throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:iu(t[i],n)}:fu(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},mu=(e,t,n)=>e.kind===`Closure`?W(e.body,hl(n,pu(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Qu(t,n),n):e.evaluate(t.map(e=>su(e,n)?ou(iu(e,n),n):W(e,n)),n),hu=(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},i):r.params.length>0||n?.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},i)},t.scope),gu=(e,t,n)=>{let r=ul(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Xl(r,n);if(r?.kind===`Operator`){if(ru(r.operator)===0)return au(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=lu(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Dd(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Jl(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${Qc(t)}`)},_u=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,vu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),yu=(e,t)=>vu.has(e)||t.builtins.get(e)?.isStateLevel===!0,bu={builtins:vu,definitions:/* @__PURE__ */ new WeakMap},xu={builtins:new Set([...vu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},Su=(e,t)=>e.kind===`Operator`&&e.params.length===0&&xl(e,t),Cu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=_l(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!Su(e,t)&&wu(e,t,n))return!0}return vi(e).some(e=>Cu(e,t,n))},wu=(e,t,n=bu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Cu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Cu(e.set,t,n));return n.definitions.set(e,i),i},Tu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Eu=(e,t)=>new Set(e.filter(e=>wu(e,t)||wu(e,t,Tu))),Du=e=>[...e.definitions.values()].some(t=>wu(t,e)),Ou=e=>[...e.definitions.values()].some(t=>wu(t,e,xu)),ku=/* @__PURE__ */ new WeakMap,Au=(e,t)=>{let n=ku.get(e);if(n!==void 0)return n;let r=Pu(e,t,Mu);return ku.set(e,r),r},ju=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Mu=/* @__PURE__ */ new Set,Nu=(e,t,n)=>n.size===0?Au(e,t):Pu(e,t,n),Pu=(e,t,n)=>{if(!ju.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=lu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&Su(n.definition,t)}if(e.kind===`Apply`){if(yu(e.operator,t)||Tu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=$l(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=_l(e.operator,t);if(!n||!xl(n,t)||wu(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Nu(e,t,n))}let r={value:!0};return es(e,(e,i)=>(r.value&&=Nu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Fu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Iu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Lu=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return es(e,(e,r)=>(n.value||=Lu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Ru=(e,t)=>Ko.has(e)&&Fu(e)&&Pd(e,t)!==void 0&&!Lu(e,Mu),zu=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Bu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Tr.sets,o=Tr.callStack,s=a??[],c=s.length;Tr.sets=s,Tr.callStack=r;try{let a=t(i),o=zu(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Xc(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=Zc(e,r.values),a=i&&!vi(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!P(a)?void 0:a;throw Vu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Tr.sets=a,Tr.callStack=o}},Vu=(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},Hu=(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}},Uu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Wu=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=jd(e,t),i=t.callStack,a=i?Bu(e,r,t,i):Fu(e)&&Au(e,t)?Iu(r):Ru(e,t)?Yu(r):r;return t.evaluators.set(e,a),a},Gu=/* @__PURE__ */ new WeakMap,Ku=(e,t)=>{if(t.callStack)return Wu(e,t);let n=Gu.get(e);if(n)return n;let r=(Fu(e)&&Au(e,t)?void 0:la(e,t))??Wu(e,t);return Gu.set(e,r),r},W=(e,t)=>Ku(e,t.environment)(t),qu=(e,t)=>{let n=e.name,r=B(e)?void 0:lu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Dd(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&xl(e,t))return t=>Jl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Ku(e.body,t),n.body(hl(r,void 0)));return Ju(e,t)?Yu(r):r}return t=>Jl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Jl(e,t);return xl(e,t)||!Ju(e,t)?n:Yu(n)}return t=>gu(n,e,t)},Ju=(e,t)=>Pd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Pd(e.set,t)!==void 0)),Yu=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Xu=(e,t)=>{let n=$l(e,t);return n!==void 0&&ru(n)>0},Zu=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&Xu(e.name,t)),Qu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),$u=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Qu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Zu(t[0],n)){let e=Wu(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Zu(t[0],n)&&Zu(t[1],n);if(i&&a){let e=Wu(t[0],n),r=Wu(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>su(e,n)?ou(iu(e,n),n):W(e,n)),n)},ed=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:fu(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:iu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},td=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),nd=/* @__PURE__ */ new WeakMap,rd=e=>{let t=nd.get(e);if(t)return t;let n={constant:td(),state:td()};return nd.set(e,n),n},id=e=>e.kind===`ExceptAt`||vi(e).some(id),ad=/* @__PURE__ */ new WeakMap,od=(e,t)=>{let n=ad.get(e);if(n!==void 0)return n;let r=Pd(e,t)!==void 0&&xc(e,Mu),i=r&&[...new Set(id(e)?[...r,`@`]:r)];return ad.set(e,i??!1),i??!1},sd=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,cd={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},ld=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:Zr(e),ud=e=>sd(e)?(cd.sources[cd.sourceCount++]=void 0,cd.args[cd.argCount++]=e,cd.hash=Hr(cd.hash,ld(e)),!0):!1,dd=(e,t,n)=>{if(!t)return!1;cd.sources[cd.sourceCount++]=e,cd.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=ul(n,t[e]);if(r?.kind!==`Value`||!sd(r.value))return!1;cd.args[cd.argCount++]=r.value,cd.hash=Hr(cd.hash,ld(r.value))}return!0},fd=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&_u(e.value))return()=>ud(e.value);if(e.kind===`Identifier`){let n=B(e)?void 0:lu(e.name,t);if(n?.kind===`Value`)return()=>ud(n.value);if(n===void 0)return n=>{let r=ul(n.scope,e.name);return r?.kind===`Value`?ud(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:dd(r.expression,od(r.expression,t),r.scope)}}let n=od(e,t);return t=>dd(e,n,t.scope)},pd=e=>{if(e.args.length!==cd.argCount||e.sources.length!==cd.sourceCount)return!1;for(let t=0;t<cd.sourceCount;t++)if(e.sources[t]!==cd.sources[t])return!1;for(let t=0;t<cd.argCount;t++)if(!an(e.args[t],cd.args[t]))return!1;return!0},md=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(pd(e[t]))return e[t]}},hd=(e,t)=>{let n=_l(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!wu(n,t))return xl(n,t)?`constant`:Ju(n,t)?`state`:void 0},gd=(e,t,n,r)=>{let i=ed(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Ku(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=rd(e),c=t.map(e=>fd(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);cd.sourceCount=0,cd.argCount=0,cd.hash=t.length,cd.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||cd.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=cd.hash&1073741823,d=a.calls.get(u),f=md(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=cd.sources.slice(0,cd.sourceCount),m=cd.args.slice(0,cd.argCount),h=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:h};d?d.push(e):a.calls.set(u,[e])}return h}},_d=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Wu(n[0],t),r=Wu(n[1],t);return t=>!gl(e(t),`the left side of =>`)||gl(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new y(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=B(e)?void 0:$l(e.operator,t);if(r?.kind===`Closure`){let i=t.callStack?void 0:hd(e,t);return gd(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Wu(n[0],t),i=ol(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Wu(n[0],t);return qo.has(e)||bl(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=Wu(n[0],t),a=Wu(n[1],t),o=sl(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?$u(r,n,t):e.operator===`\\cdot`&&n.length===2?()=>{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.`)}:r=>{let i=nu(e.operator,r);if(i)return mu(i,n,r);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 ${Qc(e)}`)}},vd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Wu(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Wu(a.set,t);return s=>kl(Dl(o(s),a.set,t.runtime.version),t=>gl(i(hl(s,dl(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=>Wu(e.set,t));return s=>{let c=a.map((e,n)=>Dl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?gl(i(hl(s,a)),r)!==n:kl(c[t],n=>l(t-1,dl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Ml(o,e,t=>gl(i(hl(e,t)),r)!==n)?!n:n},yd=(e,t)=>{if(e.kind===`Tuple`)return $n(e.names.map(e=>{let n=ul(t,e);return n?.kind===`Value`&&n.value}));let n=ul(t,e.name);return n?.kind===`Value`?n.value:void 0},bd=/* @__PURE__ */ new WeakSet,xd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&bd.add(e)},Sd=(e,t)=>{let n=bd.has(e),r=Wu(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Wu(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=Zn(e),o=Ut(i,i.map(e=>r(hl(t,dl(t.scope,n,e)))));return ft(e)?o:qt(o)}let n=[],s=i.map(e=>Ol(W(e.set,t),e.set,t.environment.runtime.version));return jl(i,s,t.scope,e=>{let o=i.length===1?yd(a.pattern,e)??!1:$n(i.map(t=>yd(t.pattern,e)??!1));return n.push([o,r(hl(t,e))]),!1}),Un(n)},l=(t,n)=>{let a=Il({value:Hl(t,e=>r(hl(n,Pl(i,n.scope,e))),Vl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?qt(a):a},u=t.callStack;return t=>{let r=o?s(t):Nl(i,t);if(e.isRecursive||n||t.isKeepLazy||!I(r))return l(r,t);if(!ft(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof y))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Hu(u,e,t),t}}},Cd=(e,t)=>{let n=bd.has(e);n&&xd(e.function);let r=Wu(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=>Wu(e,t))}),value:Wu(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):$n(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(hl(i,dl(i.scope,`@`,e))):zr(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(ua.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${el(e.function)}`)}return n}},wd=(e,t)=>{if(e.kind===`SetFilter`){let n=Wu(e.predicate,t),r=Wu(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:$c(a)},s=(e,t)=>n=>gl(e(hl(t,fl(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},Wu(e.predicate,r))});return e=>{let t=r(e);return ft(t)?Ht(L(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Wu(e.expression,t);return t=>{let r=[];return Ml(e.bounds,t,e=>(r.push(n(hl(t,e))),!1)),Rn(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${Qc(e)}`)};let r=Wu(e.body,t),i=Wu(n,t);return t=>{let a=i(t);if(!N(a)||Pt(a))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${el(e)}`);let o={value:void 0},s=Ol(a,n,t.environment.runtime.version);if(kl(s,n=>{let i=fl(t.scope,e.pattern,n);return gl(r(hl(t,i)),`the body of CHOOSE`)?(o.value=yd(e.pattern,i),!0):!1}),o.value===void 0)throw 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${el(e)}`);return o.value}},Td=e=>[...e].sort((e,t)=>zt(e.name,t.name)),Ed=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Dd=(e,t)=>new te(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${el(t)}`,e),Od=(e,t)=>e instanceof te&&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,kd=e=>new y(`A primed expression appears outside an action at ${Qc(e)}`),Ad=(e,t)=>{let n=Td(e),r=Ed(n),i=n.map(e=>Wu(e.value,t));if(r)return e=>er(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=>vt(a,i.map(t=>t(e)),o):e=>tn(a,i.map(t=>t(e)))},jd=(e,t)=>{let n=e=>Wu(e,t);switch(e.kind){case`Number`:{let t=e.value;return _u(t)?()=>t:()=>{throw ll(e)}}case`Decimal`:return()=>{throw cl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return qu(e,t);case`Apply`:return _d(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${Qc(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${Qc(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 rl(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 rl(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw kd(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=>nn(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 nl(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 (${Hi(t)}) was used as a condition of a CASE. ${tl(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${el(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(hl(n,hu(e.definitions,n)))}case`Forall`:case`Exists`:return vd(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${Qc(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return wd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Rn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>$n(t.map(t=>t(e)))}case`FunctionConstruction`:return Sd(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 Ad(e.fields,t);case`RecordSet`:{let t=Td(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 Cd(e,t);case`ExceptAt`:return t=>{let n=ul(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${Qc(e)}`);return n.value};case`FunctionApplication`:{xd(e.function);let r=n(e.function),i=t=>pl(r(ml(t)),e),a=e.args.map(n),o=al(t.runtime.version);if(a.length===1){let e=a[0];return t=>Ir(i(t),e(t),o)}return e=>Ir(i(e),$n(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=il(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?gl(t(e),`an action`)||r(e):gl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Uc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${Qc(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a state at ${Qc(e)}`)}}},Md=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Nd=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Pd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(Md.has(e.kind))return!1;let a=Nd(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&yu(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return vi(e).every(i)};return i(e)?[...n]:void 0},Fd=`-------------------------------- MODULE Reals -------------------------------
|
|
17
|
+
`?r.isAfterLf=!0:i===` `&&(r.column=he(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},_e=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,ve=new Set([...ie.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),w=(e,t)=>{let n=0;for(;ve.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,C(_e,e,t)))},T=e=>{let t=ge(e),n={offset:0,mode:`DEFAULT`},r=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),i=()=>r(y(`EOF`),e.length-1,0),a=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?xe(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
18
|
+
`||e[a]===`\r`?xe(o+1,0,void 0,i):xe(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},o=()=>{let t=n.offset;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return a(t,e.length,``);n.offset+=r+1;return}let r=0,i=t,o=t;for(;o<e.length;)if(e.startsWith(`(*`,o))r++,o+=2,r>1&&(i=o);else if(e.startsWith(`*)`,o)){if(r--,o+=2,i=o,r===0){n.offset=o;return}}else o++;return n.offset=o,i===e.length?void 0:a(i,o,``)},s=t=>{for(;n.offset<e.length;){let i=pe(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,re[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),re[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(x);if(n.mode===`PRAGMA`)return s(S);for(;n.offset<e.length;){let t=n.offset;if(`
|
|
19
|
+
\r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=me(e,t);if(i.length===0){let n=w(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),o=r<e.length?n:i.length>1?i:``;return a(t,r,o)}let o=r(i.kind,t,i.length);return n.offset+=i.length,o}}return i()}},ye=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
20
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),be=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>ye.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),xe=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${be(n)}" (${n.charCodeAt(0)}), `}after : "${be(r)}"`,Se=e=>{let t=T(e);for(let e=t();typeof e!=`string`&&e.kind!==y(`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===` `?he(e):e+1,e.beginColumn);return xe(e.beginLine,n,e.image[t],e.image.slice(0,t))}},E=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(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),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:[])}},D=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ce=`-------------------------------- MODULE Reals -------------------------------
|
|
81
21
|
(***************************************************************************)
|
|
82
22
|
(* This module provides dummy definitions of the operators that are *)
|
|
83
23
|
(* defined by the real Reals module. It is expected that any tool that *)
|
|
@@ -94,7 +34,7 @@ EXTENDS Integers
|
|
|
94
34
|
Real == "Reals"
|
|
95
35
|
a / b == CHOOSE m \\in Real : m * b = a
|
|
96
36
|
Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
|
|
97
|
-
=============================================================================`,
|
|
37
|
+
=============================================================================`,we=`----------------------------- MODULE RealTime -------------------------------
|
|
98
38
|
(***************************************************************************)
|
|
99
39
|
(* This standard module is described in Chapter 9 of the book "Specifying *)
|
|
100
40
|
(* Systems". The type of specification described there cannot be handled *)
|
|
@@ -120,7 +60,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
|
|
|
120
60
|
IN /\\ now \\in Real
|
|
121
61
|
/\\ [][NowNext]_now
|
|
122
62
|
/\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
|
|
123
|
-
=============================================================================`,
|
|
63
|
+
=============================================================================`,Te=`----------------------------- MODULE Toolbox --------------------------------
|
|
124
64
|
(***************************************************************************)
|
|
125
65
|
(* *)
|
|
126
66
|
(***************************************************************************)
|
|
@@ -146,7 +86,60 @@ _TEPosition ==
|
|
|
146
86
|
THEN _TETraceLength
|
|
147
87
|
ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
|
|
148
88
|
|
|
149
|
-
=============================================================================`,Rd=/* @__PURE__ */ new Map([[`Reals`,Fd],[`RealTime`,Id],[`Toolbox`,Ld]]),zd=`tlc2/value/impl/`,Bd=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)}},Vd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Hd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Ud=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Vd.get(e[3])}${`[]`.repeat(e[1].length)}`),Wd=(e,t)=>e[e[t].first].text,Gd=(e,t)=>Wd(e,t).replaceAll(`/`,`.`),Kd=e=>{let t=Bd(e);if(t.readUint32()!==3405691582)throw new u(`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===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=Gd(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=Ud(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:Bd(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()},()=>Gd(n,d.readUint16())):[],p=Hd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Ud(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}},qd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Wd(e,n.first),name:e[r.first].text}},Jd=(e,t,n,r)=>{let i=()=>new C(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=qd(t,l());if(n.className!==`${zd}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=qd(t,l()),a=s();if(n.className!==`${zd}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:Wd(t,l()),value:void 0}),e+=3;else if(n===183){let n=qd(t,l()),a=s(),o=s();if(!(n.className===`${zd}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Yd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Kd(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:Jd(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)}))}},Xd=/* @__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(`,`),Zd=[[`\\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`,`≀`],[`^+`,`⁺`]],Qd=/* @__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(`,`),$d=/* @__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(`.`),ef=/* @__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(`.`),tf=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),nf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
89
|
+
=============================================================================`,Ee=/* @__PURE__ */ new Map([[`Reals`,Ce],[`RealTime`,we],[`Toolbox`,Te]]),De={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:` `}},Oe=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},ke=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ae=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),je=e=>{let t=t=>{let n=h(e,t,Oe);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=h(e,t,ke);if(e.startsWith(`..`,n)&&ke(e[n+2]))return{kind:`Constant`,first:t,last:h(e,n+2,ke)-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=ke(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:h(e,t+1,ke)-1,children:[]};if(Ae(n))return{kind:`Constant`,first:t,last:h(e,t,Ae)-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)},Me=e=>{let t=e.length===0?void 0:je(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=De[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},O=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ne=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),k=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),A=e=>typeof e==`object`&&e.kind===`ModelValue`,Pe=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Fe=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:O(e)?`set`:`function`,j=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Ie={isUsed:!1},Le=(e,t)=>(Ie.isUsed=!0,e.writtenKeys=t,e),Re=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Wn(e.domain,t)]]),ze=(e,t,n)=>Le(xn(e,t),n),Be=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(Be);e.writtenKeys=void 0,e.range.forEach(Be)}},Ve=e=>e.every(e=>typeof e==`string`),He=(e,t)=>e.length>0&&t.length>0&&Ve(e)!==Ve(t),Ue=(e,t)=>{Ie.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return He(n,r)?Ht(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=M(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:M(t,n);if(r!==0)return r}return 0},We=(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=M(n[e],r[e]);if(t!==0)return t}return 0},Ge=e=>A(e)?e.type:void 0,Ke=(t,n,r)=>{let i=Ge(t),a=Ge(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(A(t)&&A(n)){if(i===void 0||a===void 0||i===a)return;throw new e.g(`Attempted to ${o} the differently-typed model values ${L(t)} and ${L(n)}`)}throw i===void 0?new e.g(`Attempted to ${o} the typed model value ${L(n)} and the non-model value\n${L(t)}`):new e.g(`Attempted to ${o}${r?``:` the`} typed model value ${L(t)} and non-model value\n${L(n)}`)},qe={ranks:Object.create(null),size:0},Je=e=>{qe.ranks=Object.create(null),qe.size=0,ot.clear();for(let t of e)Ze(t)},Ye={is174:!1},Xe=e=>{Ye.is174=e===`1.7.4`},Ze=e=>(qe.ranks[e]===void 0&&(qe.ranks[e]=qe.size++),e),Qe=()=>qe.size,$e=e=>qe.ranks[Ze(e)],et=(e,t)=>{if(e===t)return 0;let n=qe.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},tt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),nt=(e,t)=>(tt(e)||tt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),rt=(t,n,r)=>{if(!tt(t))throw new e.g(`Attempted to ${r} the set ${L(N(t)?P(t):t,!0)} with the value:\n${L(n,!0)}`);if(!tt(n))throw new e.g(`Attempted to compare overridden value ${L(t,!0)} with non-overridden value:\n${L(n,!0)}`);let i=t.kind===`InfiniteSet`?t.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new e.g(`Attempted to compare ${L(t,!0)} with the value\n${L(n,!0)}`)},it={kind:`InfiniteSet`,name:`Any`},at=t=>{throw new e.g(`Attempted to compare ANY with the value\n${L(t)}`)},M=(t,n)=>{if(t===n)return Ie.isUsed&&Be(t),t===it?at(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return Ue(t,n);if(r===`Set`&&i===`Set`)return We(t,n);if(r===`Interval`&&i===`Interval`){let e=Math.max(0,t.high-t.low+1),r=Math.max(0,n.high-n.low+1);return e!==r||e===0?e-r:t.low-n.low}if(r===`ModelValue`&&i===`ModelValue`)return t.type!==void 0&&n.type!==void 0&&Ke(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return Ke(t,n,!1),r===`ModelValue`?-1:1;if(t===it||n===it)return at(t===it?n:t);if(O(t)&&O(n)&&nt(t,n))return rt(t,n,`compare`);let a=O(t);if(a!==O(n))throw new e.g(`Attempted to compare ${Fe(t)} ${L(t)} with ${Fe(n)} ${L(n)}`);return a?We(P(t),P(n)):Ue(I(t),I(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return et(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(Ke(t,n,!1),A(t))return-1;if(A(n))return 1;throw new e.g(`Attempted to compare ${Fe(t)} ${L(t)} with ${Fe(n)} ${L(n)}`)},ot=/* @__PURE__ */ new Map,st=e=>{let t=ot.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:$e(e)};return ot.set(e,n),n},ct=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),lt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),ut={isPresent:!1},dt=(e,t)=>(t===`lambda`&&(ut.isPresent=!0),t!==void 0&&(e.functionClass=t),e),ft=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,pt=e=>dt(e,`lambda`),mt=/* @__PURE__ */ new WeakSet,ht=/* @__PURE__ */ new WeakSet,gt={isPresent:!1},_t=e=>(gt.isPresent=!0,e),vt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),yt=e=>{gt.isPresent&&typeof e==`object`&&vt.has(e.kind)&&ht.add(e)},bt=e=>{if((ut.isPresent||gt.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(mt.has(e))return;mt.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(bt),e.range.forEach(bt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(bt):O(e)&&N(e)&&(yt(e),P(e).elements.forEach(bt))}},xt=(e,t)=>{if(yt(e),e===t)return Ie.isUsed&&Be(e),e!==it||at(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Ke(e,t,!0),M(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 Ue(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return We(e,t)===0;if(A(e)||A(t))return Ke(e,t,!0),A(e)&&A(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return xt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:xt(e.domain,t.domain)&&xt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(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]&&xt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>xt(e,t.factors[n]));let n=O(e)&&O(t)&&!(N(e)&&N(t));if(n&&nt(e,t))return rt(e,t,`check equality of`)===0;if(n){if(!tt(e)){let n=P(e);if(!tt(t))return We(n,P(t))===0}return Ar(e)===Ar(t)}return M(e,t)===0},St=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):Ar(n)===Ar(r);return n},Ct=St(!1),wt=St(!0),Tt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Et=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=xr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||wt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||wt(i[e],n))return i[e]}return n.kind===`Set`?Tt(n.elements,t):(Tt(n.domain,t),Tt(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}},Dt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Ot=e=>{if(!k(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Dt(t.domain)}},kt=e=>{if(!k(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},At=(e,t)=>(Ke(t,e,!1),1),jt=(e,t)=>(Ke(t,e,!0),!1),Mt=(e,t)=>(e.type!==void 0&&Ke(e,t,!1),A(t)?e.rank-t.rank:-1),Nt=(e,t)=>(e.type!==void 0&&Ke(e,t,!0),A(t)&&e.name===t.name),Pt={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`}},Ft=(e,t,n)=>{let r=Pt[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},It=(t,n,r)=>{let i=Ot(r);if(!i){if(A(r))return At(r,n);throw new e.g(`Attempted to compare the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Lt(t.range,i.range);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&i.low!==void 0)return t.low===i.low?a():t.low-i.low;let o=t.low??i.low;if(o===void 0)return Lt(t.domain,i.domain)||a();let s=t.low===void 0?t.domain:i.domain;for(let n=0;n<s.length;n++){let r=s[n];if(typeof r!=`number`)throw new e.g(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${L(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Lt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Ht(e[n],t[n]);if(r!==0)return r}return 0},Rt=(t,n)=>{let r=I(t);if(t.kind===`Function`&&Gn(r)!==void 0){let e=k(n)?Gn(n):void 0;return e?r.range.length-e.length||Lt(r.range,e):It({...r,low:1},t,n)}if(ft(t)===`record`){let i=kt(n);if(!i){if(A(n))return At(n,t);throw new e.g(`Attempted to compare record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length-i.domain.length||Lt(r.domain,i.domain)||Lt(r.range,i.range)}return It({...r,low:Dt(r.domain)},t,n)},zt=(e,t)=>tt(e)||tt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Bt=(e,t)=>{let n=Pe(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},Vt=(t,n)=>{if(zt(t,n))return M(t,n);if(!Pe(t))return Vt(P(t),n);if(!O(n)){if(A(n))return At(n,t);throw new e.g(`Attempted to compare the set ${L(t)} with the value:\n${L(n)}`)}let r=Bt(t,n);return r.elements.length-r.otherElements.length||Lt(r.elements,r.otherElements)},Ht=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return M(t,n);if(A(n))return At(n,t);throw new e.g(Ft(t,n,!1))}return t.kind===`ModelValue`?Mt(t,n):k(t)?Rt(t,n):Vt(t,n)},Ut=(e,t)=>e.every((e,n)=>qt(e,t[n])),Wt=(t,n,r)=>{let i=Ot(r);if(!i){if(A(r))return jt(r,n);throw new e.g(`Attempted to check equality of the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==i.range.length)return!1;if(t.low!==void 0&&i.low!==void 0)return(t.range.length===0||t.low===i.low)&&Ut(t.range,i.range);let a=t.low??i.low;return a===void 0?Ut(t.domain,i.domain)&&Ut(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e.g(`Attempted to compare an integer with non-integer:\n${L(t)}.`);return t===a+n})&&Ut(t.range,i.range)},Gt=(t,n)=>{let r=I(t);if(t.kind===`Function`&&Gn(r)!==void 0){let e=k(n)?Gn(n):void 0;return e?r.range.length===e.length&&Ut(r.range,e):Wt({...r,low:1},t,n)}if(ft(t)===`record`){let i=kt(n);if(!i){if(A(n))return jt(n,t);throw new e.g(`Attempted to check equality of record:\n${L(t)}\nwith non-record\n${L(n)}`)}return r.domain.length===i.domain.length&&Ut(r.domain,i.domain)&&Ut(r.range,i.range)}return Wt({...r,low:Dt(r.domain)},t,n)},Kt=(t,n)=>{if(zt(t,n))return xt(t,n);if(!Pe(t))return Kt(P(t),n);if(!O(n)){if(A(n))return jt(n,t);throw new e.g(`Attempted to check equality of the set ${L(t)} with the value:\n${L(n)}`)}let r=Bt(t,n);return r.elements.length===r.otherElements.length&&Ut(r.elements,r.otherElements)},qt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(A(n))return jt(n,t);throw new e.g(Ft(t,n,!0))}return t.kind===`ModelValue`?Nt(t,n):k(t)?Gt(t,n):Kt(t,n)},Jt=e=>{let t=[];for(let n of e){let e=Xt(n,t);e.isFound||t.splice(e.index,0,n)}return t},Yt=(e,t)=>{let n=qn.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Xt=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Yt(e,()=>Ht(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}},Zt=(e,t)=>t.some(t=>Yt(t,()=>qt(t,e))),Qt=/* @__PURE__ */ new WeakSet,$t=e=>{typeof e==`object`&&(e.kind===`Set`&&(Qt.add(e),e.elements.forEach($t)),e.kind===`Function`&&(e.domain.forEach($t),e.range.forEach($t)))},en=(e,t)=>Jn(xt,qt,e,t),tn=e=>{for(let t=1;t<e.length;t++)if(M(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||tn(e))return ct(e);let t=[...e].sort(M),n=[t[0]];for(let e=1;e<t.length;e++)M(n[n.length-1],t[e])!==0&&n.push(t[e]);return ct(n)},rn=e=>Jn(nn,e=>({kind:`MixedSet`,elements:e}),e,void 0),an=ct([]),on=(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&&M(r[a],t)<0;)a++;a<r.length&&M(r[a],t)===0||i.push(t)}return i.length===n.length?e:ct(i)},sn=(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&&M(r[a],t)<0;)a++;a<r.length&&M(r[a],t)===0&&i.push(t)}return i.length===n.length?e:ct(i)},cn=(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=M(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=ct(i);if(e.hash!==0&&e.hash!==gr){let t=e.hash,n=0;for(;n<a.length;n++){let e=xr(a[n]);if(e===gr)break;t=t+mr(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+Tr(a[e])|0;c.fingerprint=t}return c},ln=e=>{let t=e.length<2?e:[...e].sort((e,t)=>M(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&M(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return lt(n,r)},un=e=>{let t=ln(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Le(t,e.map(e=>e[0]))},dn=[],fn=[],pn=/* @__PURE__ */ new WeakMap,mn=e=>{let t=dn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return dn[e]=n,n},hn=e=>{if(Vn(e),e.low===1&&e.high>=1)return mn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},gn=e=>e.length>0&&(e===dn[e.length]||pn.has(e)),_n=e=>{let t=P(e).elements;return gn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},vn=e=>{let t=fn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return fn[e]=n,n},yn=e=>dt(lt(mn(e.length),e),`tuple`),bn=e=>dt(ln(e),`record`),xn=(e,t)=>dt(lt(e,t),`record`),Sn=e=>O(e)&&!tt(e),Cn=(e,t=!1)=>`UNION(${L(e.base,t)})`,wn=(t,n=e=>P(e).elements)=>{if(!Sn(t.base))throw new e.g(`Attempted to enumerate the nonenumerable set:\n${Cn(t)}`);return n(t.base)},Tn=(t,n,r)=>{if(Sn(t))return t;throw new e.g(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(t)}\nwhen enumerating:\n${Cn(r)}`)},N=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 N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||En(e.domain)===!0||En(e)===!0;case`RecordSet`:return e.sets.every(N)||En(e)===!0;case`ProductSet`:return e.factors.every(N)||En(e)===!0;case`Union`:return N(e.base)&&Pn(e.base).every(N);case`SetOperation`:return e.operator===`\\cup`?N(e.left)&&N(e.right):e.operator===`\\cap`?N(e.left)||N(e.right):N(e.left);default:return!1}},En=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=En(e.domain);return t===void 0?void 0:!t&&En(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=En(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return N(e)?P(e).elements.length===0:void 0;default:return}},Dn=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},On=(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},kn=e=>{if(typeof e!=`object`||e.kind!==`Subset`||tt(e.base))return;let t=P(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=[]:On(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return ct(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)})},An=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(ct(r.map(t=>e[t])));while(On(r,e.length))}return t},jn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(tt(o))throw new e.g(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Mn=(t,n=e=>P(e).elements)=>{if(typeof t!=`object`)throw new e.g(`Expected a set but found ${L(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return Jt(t.elements);case`Interval`:{let e=hn(t);return e!==dn[e.length]&&pn.set(e,t),e}case`Subset`:{if(Vn(t.base)===0)return An([]);if(!O(t.base))throw new e.g(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${Me(L(t.base))}`);let n=P(t.base).elements;if(n.length>30)throw new e.g(Bn(t));return An(n)}case`FunctionSet`:{if(!Ye.is174&&F(t))return[];if(tt(t.domain))throw new e.g(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(t.domain)}\ncannot be enumerated.`);let r=_n(t.domain);if((r.length>0||Ye.is174)&&tt(t.range))throw new e.g(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Dn(r.map(()=>i)).map(e=>lt(r,e))}case`RecordSet`:{if(!Ye.is174&&F(t))return[];let e=jn(t.sets,n,(e,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${t.names[n]}' field:\n${L(e)}`);return Dn(e).map(e=>bn(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!Ye.is174&&F(t))return[];let e=jn(t.factors,n,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${L(e)}`);return Dn(e).map(yn)}case`FilteredSet`:if(!O(t.base)||tt(t.base))throw new e.g(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(t.base)}\nis not enumerable`);return P(t.base).elements.filter(t.test);case`Union`:{let e=wn(t).flatMap((e,n)=>P(Tn(e,n,t)).elements);return P(rn(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!Sn(t.left)||!Sn(t.right)))throw new e.g(`Attempted to enumerate S \\cup T when S:\n${L(t.left)}\nand T:\n${L(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!Sn(t.left)&&!Sn(t.right))throw new e.g(`Attempted to enumerate S \\cap T when neither S:\n${L(t.left)}\nnor T:\n${L(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Sn(t.left))throw new e.g(`Attempted to enumerate S \\ T when S:\n${L(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return cn(P(t.left),P(t.right)).elements;let n=t.operator===`\\`||Sn(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return P(r).elements.filter(e=>Yn(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e.g(`Attempted to enumerate the non-enumerable set ${L(t)}`);default:throw new e.g(`Expected a set but found ${L(t)}`)}},Nn=/* @__PURE__ */ new WeakMap,P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return ct(Mn(e));let t=typeof e==`object`?Nn.get(e):void 0;if(t)return t;let n=qn.sets;n?.push(e);let r=Mn(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`)?ct(r):nn(r);return typeof e==`object`&&Nn.set(e,i),i},Pn=e=>{if(typeof e!=`object`||ht.has(e))return P(e).elements;let t=qn.sets;t?.push(e);let n=Rn(e);return t?.pop(),n},Fn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,In=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(In);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(In)&&e.range.every(In);case`SetOperation`:return e.operator!==`\\cup`&&In(e.left)&&In(e.right);case`FilteredSet`:return In(e.base);case`ProductSet`:return e.factors.every(In);default:return!1}},Ln=e=>typeof e!=`object`||ht.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ln(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ln(e.left)||Ln(e.right):Fn(e)?.some(Ln)??!1,Rn=e=>{if(e.kind===`Union`)return wn(e,Pn).flatMap((t,n)=>Pn(Tn(t,n,e)));if(e.kind===`FilteredSet`&&!tt(e.base))return Pn(e.base).filter(e.test);if(Fn(e)?.some(Ln))return Mn(e,Pn);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Sn(e.left)||!Sn(e.right)?P(e).elements:[...Pn(e.left),...Pn(e.right)];let t=e.operator===`\\`||Sn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Sn(n)?Pn(n).filter(t=>Yn(t,r)===(e.operator===`\\cap`)):P(e).elements},F=t=>{if(typeof t!=`object`||!O(t))throw new e.g(`Shouldn't call isEmpty() on value ${L(t)}`);switch(t.kind){case`Set`:case`MixedSet`:return t.elements.length===0;case`Interval`:return t.low>t.high;case`InfiniteSet`:if(t.name===`Any`)throw new e.g(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(F);case`RecordSet`:return t.sets.some(F);case`FunctionSet`:return!F(t.domain)&&F(t.range);case`Union`:return wn(t).every((e,n)=>F(Tn(e,n,t)));default:return P(t).elements.length===0}},zn=(t,n,r)=>t.reduce((t,i)=>{let a=t*Vn(i,n);if(a>2147483647)throw new e.g(r());return a},1),Bn=e=>`Overflow when computing the number of elements in:\n${L(e)}`,Vn=(t,n)=>{if(typeof t!=`object`)throw new e.g(`Attempted to compute the number of elements in the ${Fe(t)} ${L(t)}.`);switch(t.kind){case`ModelValue`:throw new e.g(`Attempted to compute the number of elements in the model value ${L(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Vn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.g(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.g(`Attempted to compute the number of elements in the overridden value ${L(t)}.`);case`Subset`:{let r=Vn(t.base,n);if(r>=31)throw new e.g(Bn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(F(t.domain))return 1;if(F(t.range))return 0;if(Vn(t.range,n)===1)return 1}let r=Vn(t.domain,n),i=Vn(t.range,n);if(i<=1)return r===0?1:i;let a={value:1};for(let n=0;n<r;n++)if(a.value*=i,a.value>2147483647)throw new e.g(Bn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&F(t)?0:zn(t.sets,n,()=>Bn(t));case`ProductSet`:return n!==`1.7.4`&&F(t)?0:zn(t.factors,n,()=>`Overflow when computing the number of elements in ${L(t)}`);default:return yt(t),P(t).elements.length}},Hn=e=>`Attempted to check if the set ${L(e)}is finite.`,Un=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.g(`Attempted to check if the ${Fe(t)} ${L(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e.g(`Attempted to check if the function:\n${L(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Un(t.base)&&F(t.base);case`Subset`:return Un(t.base);case`FunctionSet`:{let e=Un(t.domain);if(e&&F(t.domain))return!0;let n=Un(t.range);return n&&F(t.range)?!0:n&&(e||Vn(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n={isAllFinite:!0};for(let t of e)if(!Un(t))n.isAllFinite=!1;else if(F(t))return!0;return n.isAllFinite}case`Union`:if(!Sn(t.base))throw new e.g(`Attempted to check if the nonenumerable set:\n${Cn(t)}\nis a finite set.`);return P(t.base).elements.every(Un);case`SetOperation`:if(t.operator===`\\cup`)return Un(t.left)&&Un(t.right);if(t.operator===`\\cap`){if(!Un(t.left)&&!Un(t.right))throw new e.g(Hn(t));return!0}if(Un(t.left))return!0;if(!Un(t.right))throw new e.g(Hn(t));return!1;case`FilteredSet`:if(!Un(t.base))throw new e.g(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(t.base)}\nis finite.`);return!0}},Wn=(e,t,n=M)=>{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},Gn=e=>{if(typeof e!=`object`||!k(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Kn=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!k(t))return`${n} ${Fe(t)} ${L(t)}`;let r=ft(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},qn={sets:void 0},Jn=(t,n,r,i)=>{let a=qn.sets,o=qn.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.g))throw t;return a&&(a.length=s),o&&c&&(o.expressions.length=c.length,o.isFrozen=c.isFrozen,o.fingerprint=c.fingerprint),n(r,i,t)}},Yn=(e,t)=>{let n=qn.sets;if(n===void 0)return Qn(e,t);n.push(t);let r=Qn(e,t);return n.pop(),r},Xn=(e,t)=>Wn(t.elements,e)!==-1,Zn=(e,t)=>Qt.has(t)?Xt(e,t.elements).isFound:Zt(e,t.elements),Qn=(t,n)=>{if(!O(n))throw new e.g(Kn(t,n));switch(n.kind){case`Set`:return yt(t),Jn(Xn,Zn,t,n);case`MixedSet`:return Zt(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&!A(t))throw new e.g(`Attempted to check if the value:\n${L(t)}\nis in the integer interval ${L(n)}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(A(t))return!1;if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.g(`Attempted to check if the value:\n${L(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!O(t)||tt(t))throw new e.g(`Attempted to check if the non-enumerable value\n${Me(L(t))}\nis element of\n${Me(L(n))}`);return P(t).elements.every(e=>Yn(e,n.base));case`FunctionSet`:{if(!k(t)){if(A(t))return!1;throw new e.g(`Attempted to check if \n${L(t)}\nwhich is not a TLC function value, is in the set of functions:\n${Me(L(n))}`)}let r=I(t),i=Dt(r.domain);return(i===void 0?en(n.domain,ct(r.domain)):en({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>Yn(e,n.range))}case`RecordSet`:{let r=k(t)?I(t):void 0;if(!r||!Ve(r.domain)){if(A(t))return!1;throw new e.g(`Attempted to check if non-record\n${L(t)}\nis in the set of records:\n${L(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=Wn(r.domain,e);return i!==-1&&Yn(r.range[i],n.sets[t])})}case`ProductSet`:{let r=k(t)?Gn(t):void 0;if(r===void 0){if(k(t)&&I(t).domain.every(e=>typeof e==`number`)||A(t))return!1;throw new e.g(`Attempted to check if non-tuple\n${L(t)}\nis in the set of tuples:\n${L(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>Yn(e,n.factors[t]))}case`FilteredSet`:return Yn(t,n.base)&&n.test(t);case`Union`:if(!Sn(n.base))throw new e.g(`Attempted to check if:\n ${L(t)}\nis an element of the non-enumerable set:\n ${Cn(n)}`);return P(n.base).elements.some(e=>Yn(t,e));case`SetOperation`:return n.operator===`\\cup`?Yn(t,n.left)||Yn(t,n.right):Yn(t,n.left)&&Yn(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Gn(t);if(r===void 0){if(A(t))return!1;throw new e.g(`Attempted to check if the value:\n${Me(L(t))}\nis an element of ${Me(L(n))}.`)}return r.every(e=>Yn(e,n.base))}default:throw new e.g(Kn(t,n))}},$n=(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?Yn(e,n):e.range.every((e,r)=>$n(e,t.range[r],n.range)),I=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){N(t.domain)||Vn(t.domain);let e=_n(t.domain);return dt(lt(e,e.map(e=>t.apply(e))),ft(t))}throw new e.g(`Expected a function but found ${L(t)}`)},er=(e,t,n)=>{let r=Me(L(e)),i=Me(L(t)),a=n===`1.7.4`;switch(ft(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.`}},tr=(e,t)=>{if(!Ye.is174)return er(e,t);let n=Me(L(t));return ft(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},rr=t=>new e.g(`Attempted to apply function with integer domain to the non-integer argument ${Me(L(t))}`),ir=(e,t,n)=>{throw Ye.is174||e.length<32?e.forEach(e=>qt(e,t)):Wn(e,t,Ht),n},ar=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=ft(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.g(r(t,n));if(o===void 0&&!Ye.is174&&gn(i))throw rr(n)}let a=nr(i,n);return a===-1?Jn(Wn,ir,i,n):a},or=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!Yn(n,t.domain))throw new e.g(ft(t)===`lambda`?er(t,n):`Attempted to apply a function to ${L(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e.g(`Attempted to apply ${L(t)}, which is not a function`);let i=r??er,a=ar(t,n,i);if(a===-1)throw new e.g(i(t,n));return t.range[a]},sr=e=>gn(e)?pn.get(e)??vn(e.length):void 0,cr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return sr(t)??ct(t)},lr=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!N(t.domain))){if(!Yn(n,t.domain))return t;let e=r(t.apply(n));return dt({kind:`LazyFunction`,domain:t.domain,apply:r=>en(n,r)?e:t.apply(r),source:t.source},ft(t))}if(!k(t))throw new e.g(`Attempted to apply EXCEPT construct to the value ${Me(L(t))}.`);let a=I(t),o=ar(a,n,tr);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=dt(lt(a.domain,s),ft(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==gr){let e=xr(l);if(e!==gr){let t=xr(a.domain[o]);u.hash=c===l?a.hash:a.hash-hr(t,xr(c))+hr(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Er(e,c)+Er(e,l)|0}return u},ur=/* @__PURE__ */ new WeakMap,dr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},fr=(e,t)=>Math.imul(e^t,16777619),pr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return dr(t)},mr=e=>dr(e+2654435769|0),hr=(e,t)=>dr(Math.imul(e,668265261)+t|0),gr=795548749,_r=e=>{if(e.kind===`ModelValue`)return dr(fr(pr(e.name),109));if(O(e)){if(!N(e))return gr;let t=P(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=xr(t[e]);if(r===gr)return gr;n=n+mr(r)|0}return n}if(e.kind===`LazyFunction`&&!N(e.domain))return gr;let t=I(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=xr(t.domain[e]),i=xr(t.range[e]);if(r===gr||i===gr)return gr;n=n+hr(r,i)|0}return n},vr=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.g(`TLC has found a state in which the value of a variable contains ${L(t)}`);if(O(t)){P(t).elements.forEach(vr);return}let n=I(t);n.domain.forEach(vr),n.range.forEach(vr)},yr=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{xr(t)===gr&&vr(t);return}catch(t){if(!(t instanceof e.g))throw t;return t}},br=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[]}},xr=e=>{if(typeof e==`number`)return dr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return pr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=_r(e)),e.hash;let t=ur.get(e);if(t!==void 0)return t;let n=_r(e);return ur.set(e,n),n},Sr=/* @__PURE__ */ new WeakMap,Cr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},wr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Cr(t)},Tr=e=>Cr(Or(e)+2135587861|0),Er=(e,t)=>Cr(Math.imul(Or(e),374761393)+Or(t)|0),Dr=e=>{if(e.kind===`ModelValue`)return Cr(wr(e.name)^60);if(O(e)){if(!N(e))return wr(Ar(e));let t=P(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Tr(t[e])|0;return n}let t=I(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Er(t.domain[e],t.range[e])|0;return n},Or=e=>{if(typeof e==`number`)return Cr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return wr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Dr(e)),e.fingerprint;let t=Sr.get(e);if(t!==void 0)return t;let n=Dr(e);return Sr.set(e,n),n},kr=/* @__PURE__ */ new WeakMap,Ar=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=kr.get(e);if(t!==void 0)return t;let n=jr(e);return kr.set(e,n),n},jr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Ar(t.base)}>`;if(t.kind===`FilteredSet`&&!N(t))throw new e.g(`Attempted to compare the non-enumerable set ${L(t)} with another value`);if(O(t))return N(t)?`{${P(t).elements.map(Ar).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${Ar(e)}:${Ar(n.range[t])}`).join(`,`)})`},Mr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,Nr=e=>e.reduce((e,t)=>e===0?0:e*Vn(t),1),Pr=e=>{if(e.kind===`Subset`)return Vn(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`&&N(e.domain)&&Vn(e.domain)===0)return ct([lt([],[])]);let t=e.kind===`FunctionSet`?Vn(e.range)**Vn(e.domain):Nr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?an:t<=1999?P(e):void 0},Fr=(t,n)=>{if(n)return Pr(t);if(N(t))try{return Pr(t)}catch(t){if(t instanceof e.g)return;throw t}},Ir=(e,t)=>{let n=e=>L(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 Cn(e,t)}},Lr=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Rr=t=>{if(N(t.domain))try{return I(t)}catch(t){if(t instanceof e.g)return;throw t}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Mr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(P(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=Fr(e,t);return n?r(n):Ir(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Rr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ye.is174&&ft(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&ft(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:ft(e)===`record`||i.domain.every(e=>typeof e==`string`&&Lr(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Re(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},zr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${Me(L(n))}\n`).join(``)},Br=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),Vr=(t,n)=>Br.has(t)?new e.g(n):new e.S(n),Hr=(t,n,r,i)=>new e.S(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${L(i)}`),Ur=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Ur(r))throw Vr(n,`${n} expects a value as argument ${t+1}`);return r},Wr=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw Vr(n,`${n} expects an integer but received ${L(r)}`);return r},Gr=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Vr(n,`${n} expects a boolean but received ${L(r)}`);return r},Kr=(e,t,n)=>{let r=R(e,t,n);if(!O(r))throw Vr(n,`${n} expects a set but received ${L(r)}`);return r},qr=(e,t,n)=>{let r=Kr(e,t,n);if(!N(r))throw Vr(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},Jr=(e,t,n)=>P(qr(e,t,n)).elements,Yr=(e,t,n)=>{let r=R(e,t,n),i=Gn(r);if(!i)throw Vr(n,`${n} expects a sequence but received ${L(r)}`);return i},Xr=(e,t,n)=>{let r=R(e,t,n);if(!k(r))throw Vr(n,`${n} expects a function but received ${L(r)}`);return I(r)},Zr=(e,t,n)=>{let r=e[t];if(r===void 0||!Ur(r))throw Vr(n,`${n} expects an operator as argument ${t+1}`);return r},Qr=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(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}),$r=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ei=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ti=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ni=e=>e>2147483647||e<-2147483648,ri=t=>new e.S(`Overflow when computing ${t}`),ii={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`},ai={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},oi={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`},si={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},ci=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return ai[e.operator];if(e.kind!==`Function`)return ii[e.kind];let t=ft(e);return t===void 0?`FcnRcdValue`:si[t]},li=e=>oi[ci(e)],ui=(t,n)=>new e.g(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),di=(t,n)=>{let r=r=>(...i)=>{let a=qn.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e.g&&(t.isLazy===!0||!(r instanceof e.S))?(qn.sets&&(qn.sets.length=a),ui(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},fi=(e,t)=>{if(typeof e!=`number`)throw ui(t,`Cannot cast tlc2.value.impl.${ci(e)} to tlc2.value.impl.IntValue`);return e},pi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,mi=(e,t,n,r)=>{let i=pi(e,n,`IntValue`,2);return ti(t,(e,n)=>{let a=fi(e,i),o=fi(n,i),s=r(a,o);if(ni(s))throw ri(`${a}${t}${o}`);return s})},hi=(t,n,r)=>{if(typeof t!=`number`)throw new e.S(`The ${n} argument of ${r} should be an integer, but instead it is:\n${L(t)}`);return t},gi=(e,t,n=e)=>ti(e,(e,r)=>t(hi(e,`first`,n),hi(r,`second`,n))),_i=(e,t,n)=>({...ei(e,t,n),isLazy:!0}),vi=(e,t,n)=>{let r=Zr(e,t,n);return()=>r.call([])},yi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),bi=()=>({bool:nl,condition:(e,t)=>{if(typeof e!=`boolean`)throw zc(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Bc(t,n,e);return e},apply:or,expectFunction:$c,tuple:yn,set:rn,record:xn,writtenRecord:ze,equal:xt,enumerate:pl,unassigned:(e,t)=>{throw qc(e,t)},primeOutsideAction:e=>{throw Yc(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:el,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Zc(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),xi={value:void 0},Si=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ci=e=>`local${e.counter++}`,wi=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),E(e).forEach(e=>wi(e,t)),t),Ti=(e,t,n)=>{let r=Si(e,V(t,e.environment)),i=wi(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Si(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Ei=(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(()=>Ci(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Ai(e,t.set,s)}, ${Si(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Ci(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Ai(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Ci(e),a=Ci(e),o=Ci(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})`},Di=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Ai(e,r[0],n)}, "the left side of =>") ? bool(${Ai(e,r[1],n)}, "the right side of =>") : true)`;if(D(t))return Ti(e,t,n);let i=zl(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ti(e,t,n);if(i.name===`DOMAIN`)return`${Si(e,Uc(t))}(${Ai(e,r[0],n)})`;if(i.name===`TLCEval`)return Ti(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Si(e,Wc(t,i))}(${Ai(e,r[0],n)}, ${Ai(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Iu(r[0],a))return`${Si(e,i.evaluateUnary)}(${Ai(e,r[0],n)})`;let o=r.length===2&&Iu(r[0],a)&&Iu(r[1],a);return i.evaluateBinary&&o?`${Si(e,i.evaluateBinary)}(${Ai(e,r[0],n)}, ${Ai(e,r[1],n)})`:Ti(e,t,n)},Oi=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(D(e))return!1;let r=Zl(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Oi(e.expression,t,n);case`FieldAccess`:return Oi(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Oi(e,t,n));default:return!1}},ki=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return ki(e.record);case`FunctionApplication`:return[e.function,...e.args].every(ki);default:return!1}},Ai=(e,t,n)=>{let r=(t,r=n)=>Ai(e,t,r);if(Su(t)&&_u(t,e.environment))return Ti(e,t,n);switch(t.kind){case`Number`:return j(t.value)?String(t.value):Ti(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(D(t))return Ti(e,t,n);let i=Zl(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Si(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Si(e,i.value):Ti(e,t,n)}case`Apply`:return Di(e,t,n);case`And`:case`Or`:{let n=Si(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)}, ${Si(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{ad(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Oi(t.function,n,e.environment)?r(t.function):ki(t.function)?r(t.function,i):Ti(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Si(e,t)}))`,o=Hc(e.environment.runtime.version),s=o?`, ${Si(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`${Si(e,Vc(t))}(${r(t.record)})`;case`Record`:{let i=ld(t.fields);if(ud(i))return Ti(e,t,n);let a=Si(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}, ${Si(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=Si(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`)?Ei(e,t,n):Ti(e,t,n);default:return Ti(e,t,n)}},ji=(e,t)=>{if(!yi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ai(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(`
|
|
90
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;xi.value??=bi();let o=xi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Mi={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},Ni={none:0,error:1,warning:3,state:4},Pi={0:``,1:`Error: `,3:`Warning: `,4:`State `},Fi=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===Ni.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
|
|
91
|
+
(Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${Pi[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},Ii=`The configuration file did not specify the initial state predicate.
|
|
92
|
+
Can also be caused by trying to run TLC on a specification from
|
|
93
|
+
a module imported with a parameterized INSTANCE statement.`,Li=[[1005,e.l,!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:
|
|
94
|
+
%1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
95
|
+
%1%,
|
|
96
|
+
but it produced the following error:
|
|
97
|
+
%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.
|
|
98
|
+
`,!1],[2155,`Attempted to compare %1% with the value
|
|
99
|
+
%2%`,!0],[2158,`Attempted to check if the value:
|
|
100
|
+
%1%
|
|
101
|
+
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
102
|
+
the following value:
|
|
103
|
+
%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:
|
|
104
|
+
%4%`,!0],[2176,`Applying %1% to the following value,
|
|
105
|
+
which is not %2%:
|
|
106
|
+
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
107
|
+
element is not a bag:
|
|
108
|
+
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
109
|
+
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
110
|
+
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
111
|
+
%4%
|
|
112
|
+
, but instead it is
|
|
113
|
+
%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
|
|
114
|
+
on the right-hand side of a <- after already appearing on the
|
|
115
|
+
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
|
|
116
|
+
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,Ii,!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],[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:
|
|
117
|
+
%1%`,!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.
|
|
118
|
+
%1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
119
|
+
but instead found %3%.
|
|
120
|
+
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
121
|
+
but didn't find one.
|
|
122
|
+
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
123
|
+
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
124
|
+
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
125
|
+
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
126
|
+
%4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
127
|
+
%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:
|
|
128
|
+
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
129
|
+
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
130
|
+
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
131
|
+
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
132
|
+
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
133
|
+
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
134
|
+
`,!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]],Ri={value:void 0},zi=()=>Ri.value??=Li.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),Bi=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,Vi=e=>Bi.test(e)?void 0:zi().find(t=>t.pattern.test(e))?.message,Hi=t=>t instanceof e.S||Vi(t.message)?.isEvalException===!0,Ui=/* @__PURE__ */ new Map([[1e3,`
|
|
135
|
+
: `],[2105,`failed.
|
|
136
|
+
`],[2154,`but it produced the following error:
|
|
137
|
+
`],[2213,`:
|
|
138
|
+
`],[2281,` - specifically: `]]),Wi=(e,t,n)=>{let r=n?Ui.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)}${Gi(t.slice(a),n)}`},Gi=(e,t)=>{let n=t?Vi(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ni.none} @!@!@\n${Wi(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Ki=e=>String(e).padStart(2,`0`),qi=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 ${Ki(r%24)}h`:e>36e5?`${Ki(r%24)}h ${Ki(n)}min`:e>6e4?`${Ki(n)}min ${Ki(t)}s`:`${Ki(t)}s`},Ji=e=>`${e.getFullYear()}-${Ki(e.getMonth()+1)}-${Ki(e.getDate())} ${Ki(e.getHours())}:${Ki(e.getMinutes())}:${Ki(e.getSeconds())}`,Yi=/* @__PURE__ */ new WeakMap,Xi=(t,n,r)=>{if(!(t instanceof e.g))return t;let i=e.G(new e.g(`${r}\n${t.message}`,t),e.B(t));return Yi.set(i,{code:n,headline:r,inner:t}),i},Zi=e=>Yi.has(e),Qi=e.N.slice(0,e.N.indexOf(`
|
|
139
|
+
`)),$i=`${e.N}tlc2.tool.EvalException: `,ea=`${e.N}util.Assert$TLCRuntimeException: `,ta=e=>Hi(e)?$i:ea,na=t=>{try{return t()}catch(t){throw t instanceof e.g?Hi(t)?new e.g(`${e.M}${t.message}`):Vi(t.message)?t:new e.g(`${e.N}${t.message}`):t}},ra=[$i,ea,e.N,e.M],ia=(e,t)=>{let n=Yi.get(e);if(n)return`${n.headline}\n${ia(n.inner,t)}`;let r=e.message,i=ra.find(e=>r.startsWith(e))??``;return`${i}${Gi(r.slice(i.length),t)}`},aa=(t,n)=>{let r=Yi.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:ia(t,!0)};if(n&&Hi(t))return{code:Vi(i)?.code??Mi.general,message:i,toolMessage:i};let a=n&&!i.startsWith(Qi)?e.N:``;return{code:Mi.general,message:`${a}${i}`,toolMessage:`${a}${ia(t,!0)}`}},oa=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),sa=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},ca=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(oa.has(e.kind))return!1;let a=sa(e);if(a!==void 0&&!D(e)&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&ou(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return E(e).every(i)};return i(e)?[...n]:void 0},la={kind:`Local`},ua=/* @__PURE__ */ new WeakSet,da=/* @__PURE__ */ new WeakMap,fa=/* @__PURE__ */ new WeakMap,pa=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ma=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ha=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,ga=e=>e.kind===`Operator`?e.params.length:0,_a=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],va=e=>e.name.includes(`!`),ya=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ba=(e,t,n)=>{let r=t.bindings.get(e);return r&&ha(r.position,t.location)&&(!n||ha(r.position,n.start))?r:void 0},xa=(t,n)=>t!==void 0&&n!==void 0&&e.R(t)===e.R(n),Sa=(t,n,r,i)=>{if(n===void 0)return!0;if(xa(n.range,r.range))return!1;let a=r.range;if(a===void 0||i.isGenerated||n.kind!==`Builtin`&&!n.range)return!0;let o=e.R(a),s=n.range&&e.R(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${t} is a built-in operator, and cannot be redefined.`}):r.kind===`Parameter`||n.kind!==r.kind||n.arity!==r.arity?i.errors.push({location:o,message:`Multiply-defined symbol '${t}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${t}. \nThis duplicates the one at ${s}.`}),!1},Ca=(e,t,n,r)=>Sa(t,ya(e,t)??ba(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,wa=(e,t,n)=>{Sa(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ta=(e,t,n,r)=>t.reduce((e,t,i)=>Ca(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ea=(e,t,n)=>t.reduce((e,t)=>Ca(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Da=e=>e.kind===`Name`?[e.name]:e.names,Oa=e=>e.flatMap(e=>Da(e.pattern)),ka=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ha(n.location,t.location))?n:void 0},Aa=(e,t)=>{let n=ka(e,t);return n?{key:t.getKey(n),arity:ga(n),params:_a(n),kind:`Definition`}:t.imported.get(e)},ja=(e,t,n)=>ya(t,e)??Aa(e,n),Ma=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Na=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Ma(e.location,e.spelling??t)},Pa=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ha(e.location,e.args[0].location)?`prefix`:`postfix`}},Fa=e=>!/^[\p{L}\d_]/u.test(e),Ia=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),La=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Ra=(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])}})},za=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Ra(e.name,[],void 0):Ra(e.operator,e.args,e.argumentCounts),Ba=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Va=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Oa(e.bounds),body:e.body,sets:Ba(e.bounds)};case`SetMap`:return{names:Oa(e.bounds),body:e.expression,sets:Ba(e.bounds)};case`SetFilter`:return{names:Da(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Da(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}},Ha=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}},Ua=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Wa=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ga=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Ga(e.body,t):E(e).reduce((e,n)=>e??Ga(n,t),void 0)},Ka=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Ka(i,t,n||Wa(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ga(e.set,t):Ga(e,t)},qa=e=>e.kind===`Label`?qa(e.body):e,Ja=e=>typeof e==`number`?`argument selector ${e}`:e,Ya=`within the scope of a declaration
|
|
140
|
+
from outside that declaration's scope.`,Xa=(t,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:t.selectorRanges?.[n])??t.location.range;i&&a.errors.push({location:e.R(i),message:r})},c=r.isSuffices===r.isInProof,l=r.statement,u={node:l,isGoal:!0,isSufficesOpen:r.isSuffices};for(let[e,t]of n.slice(1).entries()){let r=e+1,o=u.node;if(t.kind===`Name`){if(n[r-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&qa(o).kind===`Let`?void 0:s(r-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],i=r===1?e.map((e,n)=>({position:n,label:Ka(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?Ga(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Wa(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${Ya}`);if(t.args.length!==i.label.params.length)return s(r,`Label \`${t.name}' used with wrong number of arguments.`);u.node=i.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(t.kind!==`Operand`)return;let d=Ja(t.operand);if(u.isSufficesOpen){if(La(t.operand,1)!==0)return s(r,o.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);u.isSufficesOpen=!1;continue}if(o.kind===`NewSymbol`)return;if(o.kind!==`AssumeProve`){let e=qa(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?ja(e.name,i,a)?.kind:void 0;if(n===`Variable`||n?.startsWith(`New`))return s(r,`Choosing operand \`${d}' of subexpression with no operands.`);let c=Va(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Ha(e);if(!l)return;let f=La(t.operand,l.length);if(f===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=La(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Wa(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${Ya}`);let m=f[p];if(m.kind===`NewSymbol`&&r!==n.length-1)return s(r,`Selected a subexpression of a NEW clause of an ASSUME.`);u.node=m,u.isGoal=!1}o||(u.node.kind===`AssumeProve`&&s(void 0,`Selected ASSUME/PROVE instead of expression.`),u.node.kind===`NewSymbol`&&s(void 0,`Selected a NEW declaration as an expression or operator.`))},Za=(t,n)=>{let r=n.isGenerated?void 0:n.hasLabelScope?n.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:n.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return r===void 0||!t.location.range?!1:(n.errors.push({location:e.R(t.location.range),message:r}),!0)},Qa=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.R(i),o=t.params.filter((i,a)=>{let o=ya(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.R(s),message:`Illegal parameter ${i} of label \`${t.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(e=>r.errors.push({location:a,message:`Repeated formal parameter ${e} \nin label \`${t.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(e=>r.errors.push({location:a,message:`Label ${t.name} must contain formal parameter \`${e}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...t.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${t.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(t.name)&&r.errors.push({location:a,message:`Duplicate label \`${t.name}'.`}),r.labels.add(t.name)},$a=(e,t,n,r)=>{if(!Ua(e))return!1;let i=za(e),a=i[0],o=i.length>1&&a.kind===`Name`?ya(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Xa(e,i,o,t,n,r),o!==void 0},eo=(t,n,r,i)=>{let a=t.location;if(uo(t,r,i))return;let o=fa.get(t);if(o!==void 0)return o;if(pa(n))return t.kind===`Apply`?t.args.length:0;let s=ya(r,n);if(s?.isNonFact){i.errors.push({location:e.R(Na(t,n)),message:`Step number of non-expression step used as an expression.`});return}if($a(t,r,i,!1)||Ia(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=la),s)return s.arity;let c=Aa(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,fa.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(ya(r,l)!==void 0||Aa(l,i)!==void 0||i.facts.has(l)))return t.kind===`Apply`?t.args.length:0;let u=(t.kind===`Identifier`?void 0:t.spelling)??n,d=e.R(t.kind===`Apply`&&u===`-.`?Ma(a,`-`):Na(t,n));if(!Fa(n)||Ia(n)){i.errors.push({location:d,message:`Unknown operator: \`${n}'.`});return}i.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Pa(t);f&&a.range&&i.errors.push({location:e.R(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},to=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Ta(e,Da(t.pattern),t.pattern.ranges,n),t)),no=(e,t)=>e.kind===`Identifier`&&e.name===t&&D(e)||E(e).some(e=>no(e,t)),ro=(e,t)=>{e.kind===`FunctionConstruction`&&no(e.body,t)&&(e.isRecursive=!0),E(e).forEach(e=>ro(e,t))},io=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Oa(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.R(s),message:t})},l=t.kind===`Function`?to(t.bounds,n,a):Ea(n,t.params,a),u=ya(l,o)??ba(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${t.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(t.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),t.kind===`Function`?(B(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),ro(t.body,o),t.isSelfReferential=no(t.body,o)):B(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:Sa(o,ya(n,o)??ba(o,a,s),{kind:`Definition`,arity:ga(t),range:s},a)},ao=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(ya(e,t.name)?.isPending)return e;let n={name:t.name,arity:ga(t),params:_a(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)=>_o(t,e,n),e)};return s(e.reduce((e,t)=>{let a=pa(t.name)?e:s(e,e=>!ha(t.location,e.location)),o={name:t.name,arity:ga(t),kind:`Definition`,range:t.location.range,parent:a};if(va(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||pa(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return io(t,a,u,i)?{...o,params:_a(t)}:a},a),()=>!0)},oo=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ya(t,r)??ba(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},so=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=oo(t.kind===`Identifier`?t.name:t.operator,n,r),a=t.kind===`Apply`?t.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(t.kind===`Apply`?t.argumentRanges?.[0]:void 0)??t.location.range;return o&&r.errors.push({location:e.R(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},co=(t,n,r)=>{if(so(t,n,r))return;let i=t.operator,a=ja(i,n,r),o=eo(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.R(t.argumentsRange??Na(t,i)),message:`The operator ${i} requires ${o-(oo(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>lo(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.R(t),message:n})};t.args.map((e,a)=>{let o=s[a]??0,l=e.location.range;if(o===0){if(e.kind===`Lambda`&&e.operator!==void 0)c(l,`The operator ${e.operator} requires 1 arguments.`);else if(e.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let t=eo(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else B(e,n,r);return!0}if(e.kind===`Lambda`){B(e,n,r);let s=e.params.length===o;return!s&&ua.has(e)?c(l,`Expected arity ${o} but found operator of arity ${e.params.length}.`):!s&&l&&e.operator===void 0&&c(t.selectorRanges?.at(-1)??Na(t,i),`Lambda expression with arity ${e.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(e.kind===`Subexpression`)return B(e,n,r),!0;if(e.kind===`Apply`&&e.argumentCounts?.at(-1)===0){let t=e.argumentCounts.findIndex(e=>e>0);return c(e.selectorRanges?.[t],`Selector \`${e.operator.split(`!`)[t]}' should not have argument(s).`),!1}if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${i}', in a position an operator is required.`),!1;let u=e.kind===`Identifier`?e.name:e.operator,d=ja(u,n,r)?.params??[],f=eo(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Na(e,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((e,n)=>{e||c(t.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},lo=(e,t,n)=>{e.kind===`Identifier`?eo(e,e.name,t,n):B(e,t,n)},uo=(e,t,n)=>{let r=da.get(e);return r?(r.args.forEach(e=>lo(e,t,n)),n.errors.push(r.error),!0):!1},B=(t,n,r)=>{if(ua.has(t)&&!r.isGenerated){B(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(t.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(so(t,n,r))return;let i=t.name,a=eo(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.R(Na(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:eo(t,t.operator,n,r);return;case`Apply`:co(t,n,r);return;case`Lambda`:B(t.body,Ta(n,t.params,t.paramRanges,r),a(t.params));return;case`And`:case`Or`:i(t.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(t.expression,n,r);return;case`If`:i([t.condition,t.consequent,t.alternative]);return;case`Case`:i(t.arms.flatMap(e=>[e.condition,e.body])),t.other&&B(t.other,n,r);return;case`Let`:B(t.body,ao(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(t.body,to(t.bounds,n,r),a(Oa(t.bounds)));return;case`UnboundedQuantifier`:B(t.body,Ta(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&B(t.set,n,r),B(t.body,Ta(n,Da(t.pattern),t.pattern.ranges,r),a(Da(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:B(t.predicate,to([t.bound],n,r),a(Da(t.bound.pattern)));return;case`SetMap`:B(t.expression,to(t.bounds,n,r),a(Oa(t.bounds)));return;case`FunctionSet`:i([t.domain,t.range]);return;case`Record`:case`RecordSet`:t.fields.forEach((i,a)=>{t.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:e.R(i.location.range??Ma(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:B(t.record,n,r);return;case`Product`:i(t.factors);return;case`BoxAction`:case`AngleAction`:i([t.action,t.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([t.subscript,t.action]);return;case`Label`:if(Za(t,r))return;B(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),Qa(t,n,r);return;case`Subexpression`:if(uo(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>lo(e,n,r)),$a(t,n,r,!1)}},fo=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||so(t,n,r)||$a(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&ya(n,i)?.isNonFact?r.errors.push({location:e.R(Na(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||B(t,n,r)}),po=(e,t,n)=>(e.set&&B(e.set,t,n),Ca(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),mo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:po(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?mo(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},ho=(e,t,n)=>e.kind===`AssumeProve`?mo(e,t,n):(B(e,t,n),t),go=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&fo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>vo(t,e,r),t)},_o=(e,t,n)=>{let r=wo(e,t,n);return e.name===void 0?r:Ca(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},vo=(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 go(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return go(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 fo(r.facts,t,n),o(t);case`Instance`:return o(_o(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?_o(t,e,i):ao([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),go(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Ta(to(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ta(to(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Oa(r.bounds),...r.names]}),go(e.proof,a(t),n),a(o)}default:return go(e.proof,a(t),n),a(t)}},yo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ho(e.statement,void 0,t);e.name!==void 0&&wa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),go(e.proof,n,t),r&&(r.isInProof=!1)},bo={line:0,column:0},xo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),So=(e,t)=>{let n=new Map([...ma,...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},Co=(t,n,r,i,a)=>{let o=t.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){B(r,o,a);return}let i=eo(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.D(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${t.module} at line ${t.location.line}, column ${t.location.column}`)},c=/* @__PURE__ */ new Map;t.substitutions.forEach(t=>{let r=t.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:e.R(t.nameRange),message:`Identifier '${r}' 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 o=t.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:e.R(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!ya(o,e.name)&&!Aa(e.name,a);return l.filter(e=>!u(e)).forEach(e=>{let n={kind:`Identifier`,name:e.name,location:t.location};s(e,n),c.set(e.name,n)}),l.filter(u).forEach(n=>{let i=t.location.range,o=n.location.range;i&&o&&a.errors.push({location:e.R(i),message:`Substitution missing for symbol ${n.name} declared at ${e.R(o)} \nand instantiated in module ${r}.`})}),c},wo=(e,t,n)=>{let r=n.getInstance(e);return Co(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ca(e,t,r,n),t)},To=(e,t,n,r)=>{let i=So(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Co(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:bo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Eo=(t,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return t.toSorted((e,t)=>ha(e.location,t.location)?-1:+!!ha(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.D)||!t.sany&&a.length===0)throw t;a.push(...t.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Do=(t,n)=>{let r=So(t,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...t.theorems,...t.assumptions].flatMap(e=>e.name??[])]),a=new Map(t.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...ma,...n.bound].map(([e,t])=>[e,{...t,position:bo}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c,l)=>({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),u=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>wa(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Eo([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(t.constants,`Constant`),...u(t.variables,`Variable`),...t.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=Sa(e.name,o.get(e.name),r,l(e.location,void 0,t,n,!1));i&&(o.set(e.name,r),s.add(r)),c.push({declaration:e,binding:i?r:void 0})}})),...t.definitions.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,e,n,r,!0);xo(t,e)?B(e.body,void 0,i):io(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:ga(e),range:e.location.range,position:e.location})}})),...t.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);Ea(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>wa(t,e,i)),e.name!==void 0&&wa(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...t.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&wa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>yo(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>fo(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:t.location.range?.end??t.location,check:t=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&t.push({location:e.R(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Oo=/* @__PURE__ */ new WeakSet,ko=/* @__PURE__ */ new WeakSet,Ao=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Io(e,(e,r)=>Ao(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&D(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&D(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},jo=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Mo=/* @__PURE__ */ new WeakMap,No=e=>Mo.get(e)??e.name,Po=(e,t)=>(No(t)!==e.name&&Mo.set(e,No(t)),e),Fo=(e,t)=>Po(e.kind===`Function`?{...e,bounds:jo(e.bounds,e=>t(e,[])),body:t(e.body,Oa(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Io=(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=>Fo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:jo(e.bounds,n),body:t(e.body,Oa(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,Da(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,Da(e.bound.pattern))};case`SetMap`:return{...e,bounds:jo(e.bounds,n),expression:t(e.expression,Oa(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)}}},Lo=`LAMBDA`,Ro=(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 Io(e,(e,n)=>(r.push(...Ro(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},zo=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}},Bo=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Vo=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Ho=(e,t)=>e.map(e=>({pattern:Vo(e.pattern,t),set:e.set})),Uo=(e,t)=>e.kind===`Function`?{...e,bounds:Ho(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Wo=(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=>Po({...Uo(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Ho(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Vo(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Vo(e.bound.pattern,n),set:e.bound.set}};default:return e}},Go=e=>`${e}@ENABLED`,Ko=(e,t)=>e.modes.get(t)??e,qo=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!D(e)&&t.instantiation.variables.has(e.name),Jo=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Jo(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(qo(e,t,n))return[e.name];let r=D(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Jo(r.body,t,/* @__PURE__ */ new Map):void 0},Yo=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return qo(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Go(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:es(e.expression,Ko(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[es(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:es(e.subscript,Ko(t,`Primed`),n),location:r},es(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Jo(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:Go(r),location:e.location},location:e.location},es({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Xo=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:la}),Zo=(e,t)=>e.map(e=>Xo(e.name,t)),Qo=(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:[...Zo(t,r),...i.map(e=>Xo(e,r))],location:r},location:r}},$o=(e,t)=>e.instantiation.isParameterized(t)?ns(e,t):void 0,es=(t,n,r)=>{let i=e=>es(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!D(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:es(t.expression,Ko(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:es(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},Ko(n,`Enabled`),r)};let c=Yo(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name);if(e)return Oo.add(e),e;let r=$o(n,t.name);if(r===void 0)return t;if(o.length===0)return{...t,name:r};let i=a.getDefinition(t.name);return i&&ga(i)>0?Qo(r,o,ga(i),t.location):{kind:`Apply`,operator:r,args:Zo(o,t.location),location:t.location}}if(t.kind===`Apply`&&s(t.operator)){let r=t.args.map(i),s=a.substitutions.get(t.operator),c=a.substitutions.size>0||o.length>0||ko.has(t),l=e=>(c&&ko.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let e=s.kind===`Identifier`?s.name:s.operator;return l({...t,operator:e,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...t,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Lo,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Lo,args:r,resolution:la},location:t.location};if(s)throw new e.D(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=$o(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...Zo(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=$o(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?Qo(e,o,ga(r),t.location):{...t,operator:e}}let l=zo(n),u=Io(t,(e,t)=>t.length===0?i(e):es(e,n,Bo(r,t,l)));return Wo(u,r,l)},ts=(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:Xo(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ns=(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=zo(e),o=Uo(Fo(i,(t,n)=>es(t,e,Bo(/* @__PURE__ */ new Map,n,a))),a);return ts(o,r.params,i.location)}):t},rs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Ro(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=>$o(i,e)??e,getQualifiedKey:t=>{let n=$o(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ts(r,e.params,r.location)):t}}},is=e=>e.kind===`Let`&&e.instances!==void 0||E(e).some(is),as=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Io(e,e=>as(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}},os=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,ss=(e,t)=>e.definitions.some(e=>is(e.body))||e.assumptions.some(e=>is(e.expression))||e.theorems.some(e=>{let t=os(e);return t!==void 0&&is(t)})?{...e,definitions:e.definitions.map(e=>Fo(e,e=>as(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:as(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=os(e);return n===void 0?e:{...e,statement:as(n,t,[])}})}:e,cs=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=qn.sets,a=i??[],o=a.length;qn.sets=a;try{return n()}catch(e){throw Ou(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,qn.sets=i}},ls=(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},us=e=>!e.includes(void 0),ds=e=>e.variables.map(()=>void 0),fs=(e,t,n)=>{let r=[...e];return r[t]=n,r},ps=(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}},ms=e=>e.kind===`Identifier`?e.name:void 0,hs=(e,t,n)=>{if(t.kind===`Label`)return hs(e,t.body,n);let r=ms(t);if(r===void 0)return;let i=Xc(n,r);if(i?.kind===`Thunk`)return hs(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=zl(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?hs(e,o.body,o.scope):void 0},gs=(e,t,n)=>{if(t.kind===`Prime`)return hs(e,t.expression,n);if(t.kind===`Label`)return gs(e,t.body,n);let r=ms(t);if(r===void 0)return;let i=Xc(n,r);if(i?.kind===`Thunk`)return gs(e,i.expression,i.scope);if(i)return;let a=zl(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?gs(e,a.body,a.scope):void 0},_s=t=>{if(typeof t!=`boolean`)throw new e.g(`TLC expected a boolean expression.`);return t},vs=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),ys=(e,t,n)=>{t===void 0?us(n)&&e.onState(n):us(n)&&vs(e)?xs(e,t,n):t.kind===`Predicate`?Ss(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?js(e,t.expression,t.rest,t.scope,n):bs(e,t,n)&&ys(e,t.rest,n)},bs=(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?Jc(t,r.runtime.version):t}})();return!xt(i,a)},xs=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){js(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!bs(e,r,n):!_s(H(r.expression,ls(e,r.scope,n))))return}e.onState(n)},Ss=(t,n,r,i,a)=>cs(t,n,()=>{switch(n.kind){case`Let`:Ss(t,n.body,r,ru(n.definitions,ls(t,i,a)),a);return;case`Label`:Ss(t,n.body,r,i,a);return;default:if(ks.has(n.kind))throw new e.g(`The state relation is not a boolean expression.`);cs(t,n,()=>As(t,n,r,i,a))}}),Cs=(e,t,n,r)=>{_s(t)&&ys(e,n,r)},ws=(e,t,n,r,i)=>{let a=ls(e,r,i);if(t.kind===`Identifier`){let o=Xc(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ss(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ss(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:zl(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&sl(s,e.environment))){Ss(e,c.body,n,c.scope,i);return}Cs(e,H(t,a),n,i);return}let o=Vl(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ss(e,o.body,n,tu(o,t.args,a),i):Cs(e,H(t,a),n,i)},Ts=(e,t,n,r,i)=>{let a=n[r];a===void 0?ys(e,t,fs(n,r,i)):xt(a,i)&&ys(e,t,n)},Es=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Ds=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?hs(t,o,i):gs(t,o,i),l=ls(t,i,a);if(c===void 0){H(n,l)===!0&&ys(t,r,a);return}let u=H(s,l),d=a[c];if(n.operator===`=`){Ts(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)H(n,l)===!0&&ys(t,r,a);else{if(!Sn(f))throw new e.g(`The right side of \\IN is not enumerable.`);for(let e of Pn(f))ys(t,r,fs(a,c,e))}},Os=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),ks=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),As=(t,n,r,i,a)=>{let o=ls(t,i,a);switch(n.kind){case`Identifier`:ws(t,n,r,i,a);return;case`Apply`:if(Os.has(n.operator)&&n.args.length===2){Ds(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(_s(H(n.args[0],o))){Ss(t,n.args[1],r,i,a);return}ys(t,r,a);return}ws(t,n,r,i,a);return;case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>Es(`Predicate`,t,i,e),r);Ss(t,e[0],n,i,a);return}let o=e[e.length-1];Ss(t,ps(n,e.length-1),Es(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>Ss(t,e,r,i,a));return}Ss(t,ps(n,e.length-1),r,i,a),Ss(t,e[e.length-1],r,i,a);return}case`Exists`:vl(n.bounds,o,e=>(Ss(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(vl(n.bounds,o,t=>(e.push(t),!1)),e.length===0){ys(t,r,a);return}let i=e.slice(1).reduce((e,t)=>Es(`Predicate`,n.body,t,e),r);Ss(t,n.body,i,e[0],a);return}case`If`:Ss(t,_s(H(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>_s(H(e.condition,o)))?.body??n.other;if(s===void 0)throw new e.g(`TLC encountered a CASE with no conditions true.`);Ss(t,s,r,i,a);return}case`FunctionApplication`:{let e=Cl(H(n.function,t.isInit?o:el(o)));if(e){Ss(t,e.body,r,wl(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){js(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){Ss(t,n.action,r,i,a),js(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){Ss(t,n.action,Es(`Changed`,n.subscript,i,r),i,a);return}}Cs(t,H(n,o),r,a)},js=(e,t,n,r,i)=>cs(e,t,()=>{let a=hs(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Ts(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){ys(e,n,i);return}let s=o.reduceRight((e,t)=>Es(`Unchanged`,t,r,e),n);js(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=Xc(r,t.name);if(a?.kind===`Thunk`){js(e,a.expression,n,a.scope,i);return}let o=a?void 0:zl(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){js(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});xt(s,c)&&ys(e,n,i)}),Ms=(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}},Ns=/* @__PURE__ */ Error(`The replay found a successor`),Ps=(e,t,n,r)=>{let i=Ms(r,!1,n,()=>{throw Ns},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Es(`Changed`,e.subscript,t,void 0);Ss(i,e.action,n,t,ds(r))}else Ss(i,e,void 0,t,ds(r));return!1}catch(e){if(e!==Ns)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Fs=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Ms(t,!0,void 0,n),o=i.reduceRight((e,t)=>Es(`Predicate`,t.expression,t.scope,e),void 0);Ss(a,r.expression,o,r.scope,ds(t))},Is=(e,t,n,r)=>{e.some(e=>ks.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Ms(n,!1,t,e=>i.push(e));Ss(a,e.expression,void 0,e.scope,ds(n)),i.forEach(t=>r(t,e))})},Ls=/* @__PURE__ */ new WeakMap,Rs=/* @__PURE__ */ new WeakMap,zs=(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},Bs=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Vs=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Hs=(t,n)=>{let r=new e.g(n);return t.isInit?r:e.G(r,e.U.error)},Us=(e,t,n,r)=>{let i=Rc(n);return r&&ks.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 ${Vs(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Ws=(e,t,n)=>{let r=li(t),i=Lc(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 ${Vs(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
141
|
+
`:``}${i}`},Gs=(e,t,n)=>Ks(e,t,H(t,n)),Ks=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw Hs(e,Us(e,n,t,r))},qs=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=Mu(n,r.environment))(r),Js=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Ys=(e,t,n)=>{let r=n?Ls:Rs,i=r.get(e);if(i)return i;let a=Sc(e,t,n);return r.set(e,a),a},Xs=(e,t)=>{if(t.constants.has(e))return;let n=rl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Zs=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Zs(e.expression,t,!1,r);if(e.kind!==`Identifier`||D(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Xs(e.name,t);if(a&&!r.has(a))return r.add(a),Zs(a.body,t,n,r)},Qs=(e,t,n)=>Zs(e,t,!n),$s=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return $s(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=ru(e.definitions,zs(r,t,n));return $s(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Xc(t,e.name);if(a?.kind===`Thunk`)return $s(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=Xs(e.name,r.environment);if(s)return $s(s.body,void 0,n,r,i)},ec=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||D(e))||!t&&e.kind===`Prime`,tc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>tc(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=Xs(e.name,t);if(i)return n.add(e.name),tc(i.body,t,n)},nc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),rc=(e,t,n)=>nc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Js(e.operator)&&(ec(e.args[0],n)||Qs(e.args[0],t,n)!==void 0)||D(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ic=/* @__PURE__ */ new Set,ac=(e,t)=>{if(D(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Io(e,(e,i)=>{let a=r.isReadOnly?ac(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},oc=(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||D(e)?void 0:rl(r,t);return i&&!n.has(i)&&(n.add(i),oc(i.body,t,n))?!0:E(e).some(e=>oc(e,t,n))},sc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Qs(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=tc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return rc(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Ys(e,t,n)}},cc=(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(ca(e,t)===void 0||oc(e,t,/* @__PURE__ */ new Set))return!0;let n=ac(e,ic);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)}},lc=(e,t,n)=>{let r=e.map(e=>sc(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=vs(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Tc(u)){d??=zs(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=qs(a,e,n,d);if(!Ks(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=zs(t,n,u);let r=qs(i,s,e.expression,d);if(!Ks(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=zs(t,n,u);let r=qs(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Bs(u,e.index,r),d=void 0;else if(!xt(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=u[t];if(e===void 0)u=Bs(u,t,n[t]),d=void 0;else if(!xt(e,n[t]))return}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)},uc=e=>(t,n,r,i,a,o)=>{Gs(t,e,zs(t,n,r))&&o(r,i)},dc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=zs(r,i,a);if(a[l]!==void 0){Gs(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Sn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Vs(r)}, the right side of \\IN is not enumerable.`;throw Hs(r,`${t}\n${Lc(e)}`)}let p=Pn(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Bs(a,l,p[e]),o)}},fc=/* @__PURE__ */ new WeakMap,pc=e=>{let t=fc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(pc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return fc.set(e,n),n},mc=(e,t)=>{let n=e.args[0],r=uc(e),i=(e,r,i)=>$s(n,r,i,e,!t)??-1,a=dc(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],zs(t,n,o));l(Bs(o,u,d),s)}},hc=(e,t,n)=>{let r=Lc(e);return(i,a,o,s,c,l)=>{let u=zs(i,a,o),d=H(e.function,n?u:el(u)),f=Cl(d);if(f!==void 0){Ys(f.body,t,n)(i,wl(f,e,u),o,s,c,l);return}if(!k(d))throw Hs(i,`In computing ${Vs(i)}, a non-function (${li(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw Hs(i,`In computing ${Vs(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},gc=(e,t)=>{if(tc(e,t))return lc([pc(e)],t,!1);if(e.kind===`Tuple`)return Ys(pc(e),t,!1);let n=pc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Xc(i,e.name):void 0;l?.kind===`Thunk`?Ys(pc(l.expression),t,!1)(r,l.scope,a,o,s,c):Gs(r,n,zs(r,i,a))&&c(a,o)}},_c=(e,t,n)=>{let r=e.operator,i=uc(e),a=D(e)?void 0:zl(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=zu(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Ys(a.body,t,n),o.body(e,i(zs(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=zs(a,o,s),f=Vl(e,d);f?.kind===`Closure`?Ys(f.body,t,n)(a,tu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},vc=(e,t,n)=>{let r=uc(e),i=D(e)?void 0:Xs(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=Xc(s,e.name);f?.kind===`Thunk`?Ys(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Ys(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},yc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||D(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!D(a))return;let o=Zs(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>yc(e,t,n)),i=r[0],a=r.every(e=>e!==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}}if(e.kind!==`Apply`||D(e))return;let r=zl(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=yc(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`&&D(o))return{variable:i.variable,argument:o.name,labels:i.labels}},bc=(e,t,n)=>{let r=Xc(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},xc=(e,t,n)=>{let r=e.map(e=>Ys(e,t,n)),i=n?[]:e.map(e=>yc(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?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&bc(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Sc=(t,n,r)=>{let i=e=>Ys(e,n,r);switch(t.kind){case`And`:return lc(t.operands,n,r);case`Or`:return xc(t.operands,n,r);case`Exists`:{let e=i(t.body),a=t.bounds[0];if(t.bounds.length===1&&a.pattern.kind===`Name`){let t=a.pattern.name;return(r,i,o,s,c,l)=>{let u=dl(H(a.set,zs(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,Zc(i,t,u[n]),o,s,c,l)}}let o=r?void 0:cc(t,n);if(o){let e=lc(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=zs(r,i,a),d=t.bounds.map(e=>dl(H(e.set,u),e.set,n.runtime.version));if(d.some(e=>e.length===0))return;let f=(t,n)=>{if(t<0)e(r,n,a,s,c,l);else for(let e of d[t]){if(r.isStopped)return;let i=Zc(n,o.names[t],e);if(t===d.length-1){let e=zs(r,i,a);if(!o.guards.every(t=>Gs(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{vl(t.bounds,zs(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&ca(t,n)!==void 0&&!oc(t.body,n,/* @__PURE__ */ new Set)?ac(t,ic):void 0;return(n,r,i,o,s,c)=>{let l=[];vl(t.bounds,zs(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Xc(r,e)?.kind===`Value`)){u.every(e=>Gs(n,t.body,zs(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Tc(i)?u.slice(r).every(e=>Gs(n,t.body,zs(n,e,i)))&&c(i,a):e(n,u[r],i,a,!0,(e,t)=>d(r+1,e,t))};d(0,i,o)}}case`If`:{let e=i(t.consequent),n=i(t.alternative);return(r,i,a,o,s,c)=>{let l=H(t.condition,zs(r,i,a));if(typeof l!=`boolean`)throw Hs(r,Ws(r,l,t));(l?e:n)(r,i,a,o,s,c)}}case`Case`:{let e=t.arms.map(e=>({condition:e.condition,source:e.body,body:i(e.body)})),n=t.other?i(t.other):void 0;return(r,i,a,o,s,c)=>{let l=zs(r,i,a),u=e.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw Hs(r,`In computing ${Vs(r)}, a non-boolean expression${r.isEnabled?``:` `}(${li(t)}) was used as a guard condition of a CASE.\n${Rc(e.source)}`)})?.body??n;if(!u)throw Hs(r,`In computing ${Vs(r)}, TLC encountered a CASE with no conditions true.\n${Lc(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=pu(t.definitions,n);return(n,i,a,o,s,c)=>e(n,ru(t.definitions,zs(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.g(`UNCHANGED appears in an initial predicate at ${Fc(t)}`)}:gc(t.expression,n);case`AngleAction`:{let e=i(t.action),r=pc(t.subscript),a=(e,t,i)=>{try{return Gs(e,r,zs(e,t,i))}catch(t){throw e.isEnabled?Jc(t,n.runtime.version):t}};return(t,n,r,i,o,s)=>e(t,n,r,i,o,(e,r)=>{a(t,n,e)||s(e,r)})}case`BoxAction`:return i({kind:`Or`,operands:[t.action,pc(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return vc(t,n,r);case`FunctionApplication`:return hc(t,n,r);case`Apply`:{let e=t.args;if(Js(t.operator)){let i=Qs(e[0],n,r);if(i!==void 0)return t.operator===`=`?lc([t],n,r):dc(t,()=>i);if(ec(e[0],r))return mc(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=H(e[0],zs(n,r,i));(typeof c==`boolean`?c:nl(c,`the left side of => at ${Fc(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return _c(t,n,r)}default:return uc(t)}},Cc=/* @__PURE__ */ new WeakMap,wc=e=>{let t=Cc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Cc.set(e,n),n},Tc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ec=(t,n)=>{let r=n.state;if(!r||!Tc(r))throw new e.g(`ENABLED needs a complete state at ${Fc(t)}`);let i=n.environment;if(i.callStack)return Ps(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return Ys(t,i,!1)(a,n.scope,wc(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Dc=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};Ys(t,n,!0)(a,i,wc(n),void 0,!1,t=>{if(!a.isStopped){if(!Tc(t))throw e.G(new e._([...t]),e.U.error);a.isStopped=r(t)}})},Oc=(e,t,n)=>{let r=[];return Dc(e,t,e=>(r.push(e),!1),n),r},kc=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return Ys(t,r,!1)(o,a,wc(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!Tc(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.v(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}s.successors++,o.isStopped=i({state:t,action:n})}}),s.successors},Ac=(e,t,n,r)=>{let i=[];return kc(e,t,n,e=>(i.push(e),!1),r),i},jc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Mc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Nc=e=>Mc.has(e.kind)||e.kind===`Apply`&&jc.has(e.operator),Pc=(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&&Ne(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Fc=e=>`line ${e.location.line}, column ${e.location.column}`,Ic=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Lc=e=>{let t=e.location.range;return t?Ic(t):Fc(e)},Rc=e=>e.kind===`Number`?e.text??String(e.value):Lc(e),zc=(t,n)=>new e.g(`A non-boolean expression (${li(n)}) was used as the condition of an IF.\n${Lc(t)}`),Bc=(t,n,r)=>{let i=t.location.range;if(i?.start.line===t.location.line&&i.start.column===t.location.column||!i)return new e.g(`A non-boolean expression (${li(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Rc(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.g(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${li(r)}.\n${Lc({...t,location:{...t.location,range:{...i,end:a}}})}`)},Vc=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${L(e)}\n${Lc(t)}`,i=e=>`Attempted to apply function:\n${Me(L(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!k(a))throw new e.g(`Attempted to select field "${n}" from a non-record value ${Me(L(a))}\n${Lc(t)}`);let o=ft(a);if(o===`tuple`)throw rr(n);return or(a,n,o===`record`?r:i)}},Hc=e=>e===`1.7.4`?(t,n)=>er(t,n,e):void 0,Uc=t=>n=>{if(!k(n))throw new e.g(`Attempted to apply the operator DOMAIN to a non-function\n(${li(n)})\n${Lc(t)}`);return cr(n)},Wc=(t,n)=>(r,i)=>{if(!O(r)||tt(r))throw new e.g(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Lc(t)}`);return n.evaluate([r,i])},Gc=t=>e.G(new e.g(`TLC can't handle real numbers: ${t.text} at ${Fc(t)}`),e.U.configParseError),Kc=t=>e.G(new e.g(`TLC can't handle a number this big: ${t.text??t.value} at ${Fc(t)}`),e.U.error),qc=(t,n)=>new e.O(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${Lc(n)}`,t),Jc=(t,n)=>t instanceof e.O&&n!==`1.7.4`?new e.g(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${t.variable} occurring in the state formula v.\n`):t,Yc=t=>new e.g(`A primed expression appears outside an action at ${Fc(t)}`),Xc=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Zc=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Qc=(t,n,r)=>{if(n.kind===`Name`)return Zc(t,n.name,r);let i=Gn(r);if(!i||i.length!==n.names.length)throw new e.g(`Cannot bind <<${n.names.join(`, `)}>> to ${L(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>Zc(e,t,i[n]),t)},$c=(t,n)=>{if(k(t))return t;throw new e.g(`A non-function (${li(t)}) was applied as a function.\n${Lc(n)}`)},el=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},tl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),nl=(t,n)=>{if(typeof t!=`boolean`)throw new e.g(`Expected ${n} to be a boolean but found ${L(t)}`);return t},rl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),il=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),al=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),ol=(e,t)=>{if(il.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&al.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=rl(n,t);if(e&&!t.constants.has(n)&&!sl(e,t))return!0}return E(e).some(e=>ol(e,t))},sl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!ol(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>ol(e.set,t)));return t.constantLevels.set(e,r),r},cl=(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.`},ll=(t,n,r)=>{if(!O(t)||tt(t)){let i=L(t),a=r===`1.7.4`?void 0:cl(t,i);throw new e.g(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Rc(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Rc(n)}\n${a}`)}},ul=(e,t,n)=>(ll(e,t,n),typeof e==`object`&&e.kind===`Interval`?hn(e):kn(e)??P(e).elements),dl=(e,t,n)=>n===`1.7.4`?(ll(e,t,n),kn(e)??Pn(e)):ul(e,t,n),fl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Vn(e),e},pl=(e,t,n)=>fl(e)??dl(e,t,n),ml=(e,t,n)=>fl(e)??ul(e,t,n),hl=(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},gl=(e,t)=>e.map(e=>pl(H(e.set,t),e.set,t.environment.runtime.version)),_l=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):hl(t[n],t=>i(n-1,Qc(a,e[n].pattern,t)));return i(e.length-1,n)},vl=(e,t,n)=>_l(e,gl(e,t),t.scope,n),yl=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},bl=(e,t,n)=>{if(e.length===1)return Qc(t,e[0].pattern,n);let r=Gn(n)??[];return e.reduce((e,t,n)=>Qc(e,t.pattern,r[n]),t)},xl=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Sl=e=>Object.assign(e.value,{lambda:e}),Cl=e=>xl(e)?e.lambda:void 0,wl=(t,n,r)=>{let i=t.value,a=n.args.map(e=>H(e,r)),o=a.length===1?a[0]:yn(a),s=(e,t,r)=>`In applying the function\n${Me(L(i))},\nthe ${e} is:\n${Me(L(t))}${r}.\n${Lc(n.function)}`,c=t.bounds;if(c.length===1){if(!Yn(o,i.domain))throw new e.g(s(`first argument`,o,`which is not in its domain`));return bl(c,t.scope,o)}let l=Gn(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e.g(`Attempted to apply a function to an argument not in its domain.\n${Lc(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!Yn(r,u[n]))throw new e.g(s(i,r,`${t.pattern.kind===`Name`?``:`
|
|
142
|
+
`}which is not in its domain`));if(t.pattern.kind===`Tuple`&&Gn(r)?.length!==t.pattern.names.length)throw new e.g(s(i,r,`which does not match its formal parameter`))}),bl(c,t.scope,yn(l.slice(0,c.length)))},Tl=/* @__PURE__ */ new WeakMap,El=(e,t)=>{let n=Tl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={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:Ic(r)};return Tl.set(t,i),i},Dl=(e,t,n)=>{let r=El(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Ol=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=xr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Ct(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},kl=/* @__PURE__ */ new WeakMap,Al=e=>{let t=kl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return kl.set(e,n),n},jl=(e,t)=>{let n=yl(e.bounds,t),r=Ol(n,(n,r)=>H(e.body,tl(t,bl(e.bounds,Zc(void 0,e.name,r),n))),Dl(e.bounds,e.body,n));return Sl({value:r,bounds:e.bounds,body:e.body,scope:Zc(void 0,e.name,r)}),e.bounds.length===1?pt(r):r},Ml=(t,n)=>{if(typeof n!=`object`||ft(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Ne(n.domain))return n;try{let e=I(n);return lt(e.domain,e.range)}catch(t){if(t instanceof e.g)return n;throw t}},Nl=(e,t)=>e.kind===`Function`?e.isSelfReferential?jl(e,t):H(Al(e),t):H(e.body,t),Pl=(t,n)=>{let r=sl(t,n.environment),i=r?n.environment.definitionValues.get(t):void 0;if(i!==void 0)return i;if(t.kind===`Operator`&&t.params.length>0)throw new e.g(`Operator ${t.name} requires ${t.params.length} arguments`);let a=tl(n,void 0);if(!r)return Nl(t,a);let o=n.environment.runtime.evaluateAtStartup(()=>Ml(t,Nl(t,a)));return n.environment.definitionValues.set(t,o),o},Fl=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(!(n.constants.has(r)||n.substitutions.has(r))&&sl(t,n))try{$t(Pl(t,{environment:n,scope:void 0,state:void 0,next:void 0}))}catch(t){if(!(t instanceof e.g)&&!e.H(t))throw t}}),Il=(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,tl(t,e.scope));return n&&(!e.isStreamed||In(r))&&(e.cache=r),r},Ll=/* @__PURE__ */ new WeakMap,Rl=e=>{let t=Ll.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Ll.set(e,n),n},zl=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return zl(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Rl(r):t.builtins.get(e)},Bl=/* @__PURE__ */ new WeakMap,Vl=(e,t)=>{if(D(e))return Hl(e.operator,t);let n=Bl.get(e),r=n===void 0?zl(e.operator,t.environment)??null:n;return n===void 0&&Bl.set(e,r),r??Hl(e.operator,t)},Hl=(e,t)=>{let n=Xc(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return zl(e,t.environment)},Ul=e=>e.kind===`Closure`?e.params.length:e.arity,Wl=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:t.params.map(e=>({name:e,arity:0})),body:t.body,scope:n.scope};let r=t.kind===`OperatorReference`?t.operator:t.kind===`Identifier`?t.name:void 0,i=r===void 0?void 0:Hl(r,n);if(!i)throw new e.g(`Expected an operator argument at ${Fc(t)}`);return i},Gl=(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)=>Zc(e,n.name,t[r]),e.scope);return H(e.body,tl(n,r))},Kl=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Ul(e),call:n=>Gl(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},ql=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Hl(e.name,t);return n!==void 0&&Ul(n)>0},Jl=(e,t)=>e.map(e=>ql(e,t)?Kl(Wl(e,t),t):H(e,t)),Yl=(t,n)=>new e.g(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),Xl=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Zl=(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 Zl(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([])}},Ql=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&j(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=D(e)?void 0:Zl(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=Xc(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:Xl(e,t)}}return t=>Xl(e,t)},$l=/* @__PURE__ */ new WeakMap,eu=(e,t)=>{let n=$l.get(e);if(n)return n;let r=Ql(e,t);return $l.set(e,r),r},tu=(e,t,n,r)=>{if(t.length!==e.params.length)throw Yl(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:Wl(t[a],n)}:(r?.[a]??eu(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},nu=(e,t,n,r,i)=>{if(e.kind===`Closure`){let a=tl(n,tu(e,t,n,i));return n.environment.callStack?H(e.body,a):(r.entry?.body===e.body?r.entry:r.entry={body:e.body,evaluator:Mu(e.body,n.environment)}).evaluator(a)}return e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(Lu(t,n),n):e.evaluate(Jl(t,n),n)},ru=(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),iu=(t,n,r)=>{let i=Xc(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Il(i,r);if(i?.kind===`Operator`){if(Ul(i.operator)===0)return Gl(i.operator,[],r);throw new e.g(`Operator ${t} is used without arguments`)}let a=Zl(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw qc(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Pl(a.definition,r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.g(`Unknown identifier ${t} at ${Fc(n)}`)},au=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),ou=(e,t)=>au.has(e)||t.builtins.get(e)?.isStateLevel===!0,su={builtins:au,definitions:/* @__PURE__ */ new WeakMap},cu={builtins:new Set([...au].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},lu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&sl(e,t),uu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!D(e)){let e=rl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!lu(e,t)&&du(e,t,n))return!0}return E(e).some(e=>uu(e,t,n))},du=(e,t,n=su)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=uu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>uu(e.set,t,n));return n.definitions.set(e,i),i},fu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},pu=(e,t)=>({impure:new Set(e.filter(e=>du(e,t))),streamed:new Set(e.filter(e=>du(e,t,fu)))}),mu=e=>[...e.definitions.values()].some(t=>du(t,e)),hu=e=>[...e.definitions.values()].some(t=>du(t,e,cu)),gu=/* @__PURE__ */ new WeakMap,_u=(e,t)=>{let n=gu.get(e);if(n!==void 0)return n;let r=xu(e,t,yu);return gu.set(e,r),r},vu=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),yu=/* @__PURE__ */ new Set,bu=(e,t,n)=>n.size===0?_u(e,t):xu(e,t,n),xu=(e,t,n)=>{if(!vu.has(e.kind))return!1;if(e.kind===`Identifier`&&D(e))return n.has(e.name);if(D(e))return!1;if(e.kind===`Identifier`){let n=Zl(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&lu(n.definition,t)}if(e.kind===`Apply`){if(ou(e.operator,t)||fu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=zl(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=rl(e.operator,t);if(!n||!sl(n,t)||du(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&bu(e,t,n))}let r={value:!0};return Io(e,(e,i)=>(r.value&&=bu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Su=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Cu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},wu=(e,t)=>{if(e.kind===`Identifier`&&D(e))return!t.has(e.name);if(D(e))return!0;let n={value:!1};return Io(e,(e,r)=>(n.value||=wu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Tu=(e,t)=>Oo.has(e)&&Su(e)&&ca(e,t)!==void 0&&!wu(e,yu),Eu=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Du=(e,t,n,r)=>i=>{r.expressions.push(e);let a=qn.sets,o=qn.callStack,s=a??[],c=s.length;qn.sets=s,qn.callStack=r;try{let a=t(i),o=Eu(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Nc(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=Pc(e,r.values),a=i&&!E(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!k(a)?void 0:a;throw Ou(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,qn.sets=a,qn.callStack=o}},Ou=(t,n,r)=>{let i=[...new Set(n)].flatMap(e=>{let n=typeof e==`object`?t.sources.get(e):void 0;return n?[n]:[]});if(i.length>0&&r instanceof e.g){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},ku=(t,n,r)=>{if(!(r instanceof e.g))return;t.isFrozen||t.expressions.push(n),t.isFrozen=!0;let i=t.fingerprint;t.fingerprint={sources:[n,...i?.sources??[]],reason:i?.reason??r.message}},Au=e=>({...e,evaluators:/* @__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=fd(e,t),i=t.callStack,a=i?Du(e,r,t,i):Su(e)&&_u(e,t)?Cu(r):Tu(e,t)?Fu(r):r;return t.evaluators.set(e,a),a},ju=/* @__PURE__ */ new WeakMap,Mu=(e,t)=>{if(t.callStack)return V(e,t);let n=ju.get(e);if(n)return n;let r=(Su(e)&&_u(e,t)?void 0:ji(e,t))??V(e,t);return ju.set(e,r),r},H=(e,t)=>Mu(e,t.environment)(t),Nu=(e,t)=>{let n=e.name,r=D(e)?void 0:Zl(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw qc(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&sl(e,t))return t=>Pl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Mu(e.body,t),n.body(tl(r,void 0)));return Pu(e,t)?Fu(r):r}return t=>Pl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Pl(e,t);return sl(e,t)||!Pu(e,t)?n:Fu(n)}return t=>iu(n,e,t)},Pu=(e,t)=>ca(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>ca(e.set,t)!==void 0)),Fu=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Iu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||D(e))return!0;let n=zl(e.name,t);return n===void 0||Ul(n)===0},Lu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Ru=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Lu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Iu(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Iu(t[0],n)&&Iu(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(Jl(t,n),n)},zu=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Yl(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:eu(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:Wl(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Bu=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),Vu=/* @__PURE__ */ new WeakMap,Hu=e=>{let t=Vu.get(e);if(t)return t;let n={constant:Bu(),state:Bu()};return Vu.set(e,n),n},Uu=e=>e.kind===`ExceptAt`||E(e).some(Uu),Wu=/* @__PURE__ */ new WeakMap,Gu=(e,t)=>{let n=Wu.get(e);if(n!==void 0)return n;let r=ca(e,t)!==void 0&&ac(e,yu),i=r&&[...new Set(Uu(e)?[...r,`@`]:r)];return Wu.set(e,i??!1),i??!1},Ku=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,U={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},qu=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:xr(e),Ju=e=>Ku(e)?(U.sources[U.sourceCount++]=void 0,U.args[U.argCount++]=e,U.hash=fr(U.hash,qu(e)),!0):!1,Yu=(e,t,n)=>{if(!t)return!1;U.sources[U.sourceCount++]=e,U.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=Xc(n,t[e]);if(r?.kind!==`Value`||!Ku(r.value))return!1;U.args[U.argCount++]=r.value,U.hash=fr(U.hash,qu(r.value))}return!0},Xu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&j(e.value))return()=>Ju(e.value);if(e.kind===`Identifier`){let n=D(e)?void 0:Zl(e.name,t);if(n?.kind===`Value`)return()=>Ju(n.value);if(n===void 0)return n=>{let r=Xc(n.scope,e.name);return r?.kind===`Value`?Ju(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:Yu(r.expression,Gu(r.expression,t),r.scope)}}let n=Gu(e,t);return t=>Yu(e,n,t.scope)},Zu=e=>{if(e.args.length!==U.argCount||e.sources.length!==U.sourceCount)return!1;for(let t=0;t<U.sourceCount;t++)if(e.sources[t]!==U.sources[t])return!1;for(let t=0;t<U.argCount;t++)if(!Ct(e.args[t],U.args[t]))return!1;return!0},Qu=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(Zu(e[t]))return e[t]}},$u=(e,t)=>{let n=rl(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!du(n,t))return sl(n,t)?`constant`:Pu(n,t)?`state`:void 0},ed=(e,t,n,r)=>{let i=zu(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Mu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=Hu(e),c=t.map(e=>Xu(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);U.sourceCount=0,U.argCount=0,U.hash=t.length,U.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||U.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=U.hash&1073741823,d=a.calls.get(u),f=Qu(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=U.sources.slice(0,U.sourceCount),m=U.args.slice(0,U.argCount),h=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:h};d?d.push(e):a.calls.set(u,[e])}return h}},td=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=V(r[0],n),t=V(r[1],n);return n=>!nl(e(n),`the left side of =>`)||nl(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e.g(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=D(t)?void 0:zl(t.operator,n);if(i?.kind===`Closure`){let e=n.callStack?void 0:$u(t,n);return ed(i,r,n,e)}if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=V(r[0],n),i=Uc(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=V(r[0],n);return ko.has(t)||ol(r[0],n)?e:t=>t.scope===void 0?i.evaluate([e(t)]):e(t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=V(r[0],n),a=V(r[1],n),o=Wc(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Ru(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.g(n.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 a={entry:void 0},o=r.map(e=>eu(e,n));return i=>{let s=Hl(t.operator,i);if(s)return nu(s,r,i,a,o);throw n.definitions.get(t.operator)?.kind===`Function`?new e.g(`${t.operator} is a function; apply it with brackets`):new e.g(`Unknown operator ${t.operator} at ${Fc(t)}`)}},nd=(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=>hl(pl(o(s),a.set,t.runtime.version),t=>nl(i(tl(s,Zc(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)=>pl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?nl(i(tl(s,a)),r)!==n:hl(c[t],n=>l(t-1,Zc(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>vl(o,e,t=>nl(i(tl(e,t)),r)!==n)?!n:n},rd=(e,t)=>{if(e.kind===`Tuple`)return yn(e.names.map(e=>{let n=Xc(t,e);return n?.kind===`Value`&&n.value}));let n=Xc(t,e.name);return n?.kind===`Value`?n.value:void 0},id=/* @__PURE__ */ new WeakSet,ad=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&id.add(e)},od=(t,n)=>{let r=id.has(t),i=V(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=V(o.set,n),l=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=_n(e),a=lt(r,r.map(e=>i(tl(t,Zc(t.scope,n,e)))));return Ne(e)?a:pt(a)}let n=[],r=a.map(e=>ml(H(e.set,t),e.set,t.environment.runtime.version));return _l(a,r,t.scope,e=>{let r=a.length===1?rd(o.pattern,e)??!1:yn(a.map(t=>rd(t.pattern,e)??!1));return n.push([r,i(tl(t,e))]),!1}),ln(n)},u=(e,n)=>{let r=Sl({value:Ol(e,e=>i(tl(n,bl(a,n.scope,e))),Dl(a,t.body,e)),bounds:a,body:t.body,scope:n.scope});return a.length===1?pt(r):r},d=n.callStack;return n=>{let i=s?c(n):yl(a,n);if(t.isRecursive||r||n.isKeepLazy||!N(i))return u(i,n);if(!Ne(i)){if(d)return u(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e.g))throw t;return u(i,n)}}if(!d)return l(i,n);try{return l(i,n)}catch(e){throw ku(d,t,e),e}}},sd=(e,t)=>{let n=id.has(e);n&&ad(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(tl(i,Zc(i.scope,`@`,e))):lr(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(Mi.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Lc(e.function)}`)}return n}},cd=(t,n)=>{if(t.kind===`SetFilter`){let e=V(t.predicate,n),r=V(t.bound.set,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:Ic(a)},s=(e,t)=>n=>nl(e(tl(t,Qc(t.scope,i,n))),`a set filter predicate`),c=(e,n,r)=>({kind:`FilteredSet`,base:e,test:s(r,n),source:o,rebind:r=>c(e,{...n,environment:r},V(t.predicate,r))});return t=>{let n=r(t);return Ne(n)?ct(P(n).elements.filter(s(e,t))):c(n,t,e)}}if(t.kind===`SetMap`){let e=V(t.expression,n);return n=>{let r=[];return vl(t.bounds,n,t=>(r.push(e(tl(n,t))),!1)),rn(r)}}let r=t.set;if(!r)return()=>{throw new e.g(`TLC cannot evaluate an unbounded CHOOSE at ${Fc(t)}`)};let i=V(t.body,n),a=V(r,n);return n=>{let o=a(n);if(!O(o)||tt(o))throw new e.g(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Lc(t)}`);let s={value:void 0},c=ml(o,r,n.environment.runtime.version);if(hl(c,e=>{let r=Qc(n.scope,t.pattern,e);return nl(i(tl(n,r)),`the body of CHOOSE`)?(s.value=rd(t.pattern,r),!0):!1}),s.value===void 0)throw new e.g(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Lc(t)}`);return s.value}},ld=e=>[...e].sort((e,t)=>M(e.name,t.name)),ud=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),dd=(e,t)=>{let n=ld(e),r=ud(n),i=n.map(e=>V(e.value,t));if(r)return e=>bn(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=>ze(a,i.map(t=>t(e)),o):e=>xn(a,i.map(t=>t(e)))},fd=(t,n)=>{let r=e=>V(e,n);switch(t.kind){case`Number`:{let e=t.value;return j(e)?()=>e:()=>{throw Kc(t)}}case`Decimal`:return()=>{throw Gc(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Nu(t,n);case`Apply`:return td(t,n);case`Bracket`:return()=>{throw new e.g(`A bracket without a function or subscript is not an expression at ${Fc(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.g(`An operator cannot be used as a value at ${Fc(t)}`)};case`And`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw Bc(t,r,i);if(!i)return!1}return!0}}case`Or`:{let e=t.operands.map(r);return n=>{for(let r=0;r<e.length;r++){let i=e[r](n);if(typeof i!=`boolean`)throw Bc(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw Yc(t);return e({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let e=r({kind:`Prime`,expression:t.expression,location:t.location}),n=r(t.expression);return t=>xt(e(t),n(t))}case`If`:{let e=r(t.condition),n=r(t.consequent),i=r(t.alternative);return r=>{let a=e(r);if(typeof a!=`boolean`)throw zc(t,a);return a?n(r):i(r)}}case`Case`:{let n=t.arms.map(e=>({source:e.condition,condition:r(e.condition),body:r(e.body)})),i=t.other?r(t.other):void 0;return r=>{for(let t of n){let n=t.condition(r);if(typeof n!=`boolean`)throw new e.g(`A non-boolean expression (${li(n)}) was used as a condition of a CASE. ${Rc(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.g(`Attempted to evaluate a CASE with no conditions true.\n${Lc(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(tl(n,ru(t.definitions,n)))}case`Forall`:case`Exists`:return nd(t,n);case`UnboundedQuantifier`:return()=>{throw new e.g(`TLC cannot evaluate an unbounded quantifier at ${Fc(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return cd(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>rn(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>yn(e.map(e=>e(t)))}case`FunctionConstruction`:return od(t,n);case`FunctionSet`:{let e=r(t.domain),n=r(t.range);return t=>({kind:`FunctionSet`,domain:e(t),range:n(t)})}case`Record`:return dd(t.fields,n);case`RecordSet`:{let e=ld(t.fields),n=e.map(e=>e.name),i=e.map(e=>r(e.value));return e=>({kind:`RecordSet`,names:n,sets:i.map(t=>t(e))})}case`Except`:return sd(t,n);case`ExceptAt`:return n=>{let r=Xc(n.scope,`@`);if(r?.kind!==`Value`)throw new e.g(`@ appears outside an EXCEPT at ${Fc(t)}`);return r.value};case`FunctionApplication`:{ad(t.function);let e=r(t.function),i=n=>$c(e(el(n)),t),a=t.args.map(r),o=Hc(n.runtime.version);if(a.length===1){let e=a[0];return t=>or(i(t),e(t),o)}return e=>or(i(e),yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Vc(t);return t=>n(e(t))}case`Product`:{let e=t.factors.map(r);return t=>({kind:`ProductSet`,factors:e.map(e=>e(t))})}case`BoxAction`:case`AngleAction`:{let e=r(t.action),n=r({kind:`Unchanged`,expression:t.subscript,location:t.location}),i=t.kind===`BoxAction`;return t=>i?nl(e(t),`an action`)||n(t):nl(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>Ec(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.g(`The subexpression reference at ${Fc(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e.g(`TLC cannot evaluate a temporal formula in a state at ${Fc(t)}`)}}},pd=`tlc2/value/impl/`,md={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},hd={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},gd=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)}},_d=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),vd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],yd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??_d.get(e[3])}${`[]`.repeat(e[1].length)}`),bd=(e,t)=>e[e[t].first].text,xd=(e,t)=>bd(e,t).replaceAll(`/`,`.`),Sd=t=>{let n=gd(t);if(n.readUint32()!==3405691582)throw new e.D(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===md.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===md.integer?i.value=n.readInt32():t===md.float?n.readUint32():t===md.long||t===md.double?(n.readBytes(8),e++):t===md.class||t===md.string||t===md.methodType||t===md.module||t===md.package?i.first=n.readUint16():t===md.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=xd(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=yd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:gd(n.readBytes(n.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()},()=>xd(r,d.readUint16())):[],p=vd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=yd(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${h}`})}return{pool:r,methods:s}},Cd=(e,t)=>{let n=e[t],r=e[n.second];return{className:bd(e,n.first),name:e[r.first].text}},wd=(t,n,r,i)=>{let a=()=>new e.k(`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===md.integer)return t.value;if(t.tag===md.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>=hd.iconstM1&&t<=hd.iconst5)s.push(t-hd.iconst0),e+=1;else if(t===hd.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===hd.sipush)s.push(r()<<16>>16),e+=3;else if(t===hd.ldc)s.push(l(o[e+1])),e+=2;else if(t===hd.ldcW)s.push(l(r())),e+=3;else if(t===hd.dup){let t=c();s.push(t,t),e+=1}else if(t===hd.getstatic){let t=Cd(n,r());if(t.className!==`${pd}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===hd.invokestatic){let t=Cd(n,r()),o=c();if(t.className!==`${pd}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===hd.new)s.push({className:bd(n,r()),value:void 0}),e+=3;else if(t===hd.invokespecial){let t=Cd(n,r()),o=c(),s=c();if(!(t.className===`${pd}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===hd.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()},Td=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Sd(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:wd(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)}))}},Ed=/* @__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(`,`),Dd=[[`\\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`,`≀`],[`^+`,`⁺`]],Od=/* @__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(`,`),kd=/* @__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(`.`),Ad=/* @__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(`.`),jd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Md=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
150
143
|
Nat == { }
|
|
151
144
|
a+b == {a, b}
|
|
152
145
|
a-b == CHOOSE n : b + n = a
|
|
@@ -462,9 +455,9 @@ _CheckName(name) ==
|
|
|
462
455
|
=> (PrintT(counts) /\\ FALSE)
|
|
463
456
|
_PrintCounts == PrintT(_Counts)
|
|
464
457
|
=============================================================================
|
|
465
|
-
`]]),rf=/* @__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)`]])]]),af=A(`EOF`),of=A(`IDENTIFIER`),sf=A(`DEFBREAK`),cf=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),lf=new Set(cf(`op_57`,`op_119`)),uf=new Set(cf(`op_1`,`op_119`)),df=new Set(cf(`op_57`,`op_70`)),ff=/* @__PURE__ */ new Set([...cf(`ACTION`,`EXCEPT`),A(`EXTENDS`),...cf(`IF`,`SF`),A(`STATE`),...cf(`THEN`,`WITH`),A(`US`),...cf(`op_112`,`op_116`)]),pf=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),mf=new Map([...pf(`postfix`,160,160,!0,`[`),...pf(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...pf(`prefix`,120,120,!1,`-.`),...pf(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...pf(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...pf(`prefix`,40,40,!0,`\\lnot`),...pf(`nfix`,100,130,!0,`\\times`),...pf(`infix`,140,140,!1,`^`,`^^`),...pf(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...pf(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...pf(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...pf(`infix`,100,110,!0,`|`,`||`,`%%`),...pf(`infix`,100,110,!1,`%`),...pf(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...pf(`infix`,90,140,!1,`\\wr`),...pf(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...pf(`infix`,90,130,!1,`!!`),...pf(`infix`,90,90,!1,`...`,`..`),...pf(`infix`,80,80,!0,`\\intersect`,`\\union`),...pf(`infix`,80,80,!1,`\\`),...pf(`infix`,70,70,!1,`<:`,`:>`),...pf(`infix`,60,60,!0,`@@`),...pf(`infix`,50,140,!0,`\\cdot`),...pf(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...pf(`infix`,30,30,!0,`\\land`,`\\lor`),...pf(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...pf(`infix`,10,10,!1,`=>`)]),hf=new Map([...mf,...Zd.flatMap(e=>e.slice(1).map(t=>[t,mf.get(e[0])]))]),gf=hf.get(`[`),_f={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},vf=e=>({type:`tokens`,kinds:new Set(e)}),yf=e=>typeof e==`string`?e.startsWith(`<`)?vf([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(yf)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),bf=e=>(...t)=>({type:e,body:G(...t)}),q=bf(`zeroOrMore`),xf=bf(`oneOrMore`),J=bf(`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}),Sf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Cf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Sf(e,n);return n},wf=(...e)=>{let t=e.map(A);return e=>t.includes(Cf(e,1).kind)},Tf=(e,t=Cf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Ef=e=>{let t=Cf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Df=e=>wf(`CASESEP`)(e)&&Tf(e),Of=e=>{let t=Cf(e,1);ff.has(t.kind)&&(t.kind=of)},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}`,Af=(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]},Mf=e=>e.operatorStacks[e.operatorStacks.length-1],Nf=(e,t)=>e.low>t.high,Pf=(e,t)=>e.high<t.low,Ff=e=>e.fix===`prefix`?e:hf.get(`${e.name}.`),If=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===gf?Af(`FcnAppl`,[n,...r.node.heirs]):Af(`PostfixExpr`,[n,r.node]),operator:void 0})},Lf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Af(`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:Af(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Rf=e=>{let t=Mf(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 If(t,n),Rf(e);if(i.operator!==void 0){let t=Ff(r.operator);return t!==void 0&&Nf(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 Pf(a.operator,r.operator)?void 0:Nf(a.operator,r.operator)?(Lf(t,a.operator),Rf(e)):`Precedence conflict between ops ${a.operator.name} in block ${kf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Ff(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Pf(s,r.operator))return;if(!Nf(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 Lf(t,s),Rf(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===_f?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},zf=e=>Y(t=>{let n=Mf(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:Rf(t)}),Bf=zf(()=>!1),Vf=zf(()=>!0),Hf=Y(e=>{e.lastOperator=hf.get(e.token.image)}),Uf=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},Wf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Uf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Gf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Tf(e,n.first.beginColumn))return n;let t=Gf(e,n);if(t!==void 0)return t}},Kf=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&&lf.has(e.kind),i=e.token,a=Sf(e,i);i.next=void 0;let o=Sf(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===of&&(e=e.next)}else if(e.kind===of){let t=e.next;!r(t)||df.has(t.kind)||uf.has(t.kind)&&t.next?.kind!==of||(e=t.next?.kind===A(`SUBSTITUTE`)?i:uf.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==sf&&(e.next={kind:sf,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Sf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},qf=e=>{let t=Cf(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=Sf(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===af)return!1;return Sf(e,t).kind===A(`IN`)}if(t.kind!==of)return!1;for(t=Sf(e,t);t.kind===A(`COMMA`);){if(t=Sf(e,t),t.kind!==of)return!1;t=Sf(e,t)}return t.kind===A(`IN`)},Jf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Yf=e=>e.proofLevels.at(-1)??-1,Xf=e=>{let t=Cf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:wf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Yf(e)>=0&&Jf(t)>Yf(e):wf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Zf=(e,t)=>{let n=Jf(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},Qf=e=>Y(t=>Zf(t,t.token)?void 0:`${kf(t,t.token)}: ${e}`),$f=vf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),ep=vf([...$f.kinds,A(`op_76`)]),tp=vf(uf),np=vf(df),rp=vf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),ip=()=>q(Z({expansion:[K($f,`<op_77>`)],semantic:Tf}),K(`PrefixOp`,`InfixOp`),Vf),ap=()=>K(G(Z({expansion:[`OpenStart`],semantic:Tf}),`OpenExpression`,Bf),G(Z({semantic:Tf}),`ExtendableExpr`)),op=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),sp=()=>K(G(Z({semantic:e=>wf(`ASSUME`,`BOXASSUME`)(e)||Cf(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Cf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),cp=()=>[`JuncItem`,q(Z({semantic:Ef}),`JuncItem`)],lp=e=>Y(t=>{t.expecting=e,Of(t)}),up=e=>Y(t=>{t.isTerminalProof=e}),dp=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Kf(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),fp={CompilationUnit:Q(void 0,[Y(Kf),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>`),lp(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,lp(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,lp(`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(Kf)),G(Z({semantic:e=>wf(`USE`)(e)&&Cf(e,2).kind!==A(`ONLY`)||wf(`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(dp(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),dp(`Expression`,Z({expansion:[`<IDENTIFIER>`,np]}),`PostfixLHS`,`Expression`),dp(`Expression`,Z({expansion:[`<IDENTIFIER>`,tp]}),`InfixLHS`,`Expression`),dp(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),dp(`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`,[ep,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,tp,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,np]),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>`,lp(`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,[$f,Hf]),NonExpPrefixOp:Q(void 0,[ep,Hf]),InfixOp:Q(`Infix Op`,[tp,Hf]),PostfixOp:Q(void 0,[np,Hf]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Kf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),sp(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),sp(),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=jf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${kf(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(Kf),K(G(Z({amount:3}),Z({semantic:wf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Xf}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>wf(`BY`)(e)||Cf(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=>Cf(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,up(!0),J(`<ONLY>`)),G(`<USE>`,up(!1),J(`<ONLY>`)),G(`<HIDE>`,up(!1))),X("an expression, `MODULE' or `DEF'"),J(op(),q(`<COMMA>`,X(`MODULE or expression`),op(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),op(),q(`<COMMA>`,X(`MODULE or expression`),op(),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`),rp,Qf(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Xf}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),rp,Qf(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:wf(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:wf(`INSTANCE`)}),`Instantiation`),G(Z({semantic:wf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Xf}),Y(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:Q(`DefStep`,[J(`<DEFINE>`),xf(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:wf(`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(ep,tp,np),vf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:Tf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(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`)),G(Z({expansion:[`<LAMBDA>`],semantic:Tf}),`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:qf}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),xf(`<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=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`,q(`<COMMA>`,`QuantBound`)),xf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:qf}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Cf(e,2).kind===A(`MAPTO`)&&ff.has(Cf(e,1).kind)}),Y(e=>{Cf(e,1).kind=of}),`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=Af(`FcnAppl`,t.heirs),e.lastOperator=gf})),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>`,xf(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Of),`Identifier`),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=>Df(e)&&Cf(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Df}),`<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`,[xf(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Cf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...cp()),G(Z({expansion:[`<AND>`]}),...cp())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Gf(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: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([])}),ip(),ap()],(e,t)=>{let n=Mf(t);n.push({node:e.heirs[0],operator:_f});let r=Rf(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`),Bf,q(K(G(Z({expansion:[`PostfixOp`],semantic:Tf}),`PostfixOp`,Vf),G(Z({expansion:[`<DOT>`],semantic:Tf}),`<DOT>`,Y(Of),Z({semantic:Tf}),`Identifier`,Y(e=>{let t=Mf(e);t[t.length-1].operator!==void 0&&If(t,t.length),t[t.length-1]={node:Af(`RecordComponent`,[t[t.length-1].node,jf(e,2),jf(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Tf}),X(`function argument`),`SBracketCases`,zf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Tf}),`InfixOp`,Vf,ip(),ap()),G(Z({expansion:[`<COLONCOLON>`],semantic:Tf}),`<COLONCOLON>`,Y(e=>{let t=Mf(e);if(!Wf(t[t.length-1].node))return`\`::' at ${kf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Mf(e),n=jf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Pf(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:Af(`Label`,[jf(e,3),jf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Tf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Tf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Yf(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`,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:Uf(e.heirs)===void 0?e.heirs.length===1?Af(`GeneralId`,e.heirs):void 0:Af(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Cf(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=>Cf(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:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},pp=/* @__PURE__ */ new Map,mp=e=>{let t=pp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=mp(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,mp(fp[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 pp.set(e,n),n},hp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},gp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Sf(e,e.scanPosition)),e.scanPosition=Sf(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`},_p=(e,t)=>{if(t.type===`tokens`)return gp(e,t.kinds);if(t.type===`call`)return _p(e,fp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||hp(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=_p(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||hp(e,t.semantic)?_p(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=_p(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=_p(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},vp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=_p(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},yp=(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||mp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!mp(a).hasSemanticStart?mp(a).first.has(Cf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):vp(e,i,a)&&(o===void 0||o(e))}),bp=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,_p(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Sf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===af){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Sf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${qe(e.token.image)}" `},xp=(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??bp(e)}\n\nResidual stack trace follows:\n${r}`,!1},Sp=(e,t)=>{let n=Sf(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,xp(e))},Cp=(e,t)=>{let n=fp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Cf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!wp(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 xp(e,i);let a=r.node??(r.heirs.length===0?void 0:Af(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},wp=(e,t)=>{if(t.type===`tokens`)return Sp(e,t.kinds);if(t.type===`call`)return Cp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||xp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||xp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||wp(e,t));if(t.type===`choice`){let n=yp(e,t.alternatives);return n===-1?xp(e):wp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!wp(e,t.body))return!1;if(t.type===`optional`)return yp(e,[t.body])===-1||wp(e,t.body);for(;yp(e,[t.body])===0;)if(!wp(e,t.body))return!1;return!0},Tp=e=>{let t=Ge(e),n={kind:af,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=wp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},Ep={low:15,high:15},Dp={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Op=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)]]),kp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Ap=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),jp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Mp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Np=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Pp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...kp]),Fp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Op.has(e.operator):kp.has(e.operator)),Ip=e=>Op.has(e)||kp.has(e)||e===`-.`,Lp=(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}}},Rp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),zp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Bp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Vp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Hp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Up=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Wp=/* @__PURE__ */ new Set([``,`*`,`-`]),Gp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Kp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),qp=/* @__PURE__ */ new Set([`NEW`,...Kp.keys()]),Jp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Yp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Xp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Zp=(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(`
|
|
466
|
-
`)}\n`},Qp=(e,t)=>{let n=t===`tlapm`,r=n?Ce(e):Ce(e).map(xe),i={index:0,offsideColumns:[]},a={},o=[],s=/* @__PURE__ */ new Set,c=[],l=[],d=e=>o[o.length-1].has(e),f=e=>({line:e.line,column:n&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],_=[],v=(e,t=i.index-1)=>{let n=e===t?_[e]:void 0;if(n)return n;let a=r[t];m[e]??=f(r[e]),h[t]??={line:a.line,column:a.endColumn};let o={module:l[0].name,start:m[e],end:h[t]};return e===t&&(_[e]=o),o},y=(e,t)=>(e.location.range=v(t),e),b=(e=0)=>r[Math.min(i.index+e,r.length-1)],x=(e=0)=>{let t=b(e),n=i.offsideColumns[i.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ee=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),te={index:0},S=e=>{let t=r.slice(te.index,i.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>n&&(e.kind===`Keyword`||Xp.has(e.text)),re=e=>{let t=r.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},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Up.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(e,t=b(),n)=>{let i=r[r.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,ae(e,t,a,n))},ae=(e,t,i,a)=>{if(n&&i){let e=r[r.length-1];return{reason:`Unexpected EOF`,...S(re(e)),isEnd:i}}return n&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:t.line,column:t.column,isEnd:i}},oe=(e,t=b())=>C(e,t,t),se=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw C(`Unexpected end of expression`);return i.index++,e},E=e=>w(e)?(i.index++,!0):!1,D=e=>{if(!w(e))throw oe(`Expected ${JSON.stringify(e)} but found ${ee(x())}`);return T()},ce=()=>{let e=x();if(e.kind!==`Identifier`)throw oe(`Expected an identifier but found ${ee(e)}`);if(ne(e))throw oe(`Unexpected keyword ${e.text}`);return i.index++,e.text},le=()=>{let e=i.index;return{name:ce(),range:v(e)}},ue=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),de=()=>{let e=x();return e.kind!==`String`&&(jp.has(e.text)||Op.has(e.text)||kp.has(e.text)||e.text===`'`)?(i.index++,e.text):ce()},fe={isUsed:!1},me=()=>x().kind===`Identifier`||!se(x())?ce():(fe.isUsed=!0,T().text),he=e=>{if(!n)return e();i.offsideColumns.push(-1);let t=e();return i.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},ge=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},_e=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},ve=()=>{if(!E(`<<`)){let e=le();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ue(O(le));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},ye=()=>O(()=>{let e=O(ve);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),be=()=>{let e=x();if(e.kind===`Identifier`){let t=i.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(ce());return y({kind:`Identifier`,name:n.join(`!`),location:f(e)},t)}if(w(`<<`)||w(`(`))return Fe();throw oe(`Expected a subscript but found ${ee(e)}`)},Se=e=>{let t=x(1),n=x(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`&&w(`==`,kp.has(n.text)?3:4))},we=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&zp.has(t.text)||Se(e)},k=()=>{let e=x(),t=e.kind===`Operator`&&(Op.has(e.text)||Ap.has(e.text))&&we(e);if(n&&e.kind!==`String`&&(Ap.has(e.text)||Pp.has(e.text)&&e.text!==`'`&&!kp.has(e.text)||Np.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&we(e))throw C(`incomplete expression`,e);if(t)return i.index++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:f(e)},i.index-1);if(e.kind!==`String`&&Pp.has(e.text)&&we(e)){i.index++;let t=f(e);if(kp.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},i.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Lp(e.text,n,t),operator:e.text,location:f(e)},i.index-1)}if(w(`LAMBDA`)){let t=i.index;T();let n=ue(O(le));D(`:`);let r=j();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:f(e)},t)}return j()},Te={range:void 0},A=()=>he(()=>{let e=i.index;D(`(`);let t=O(k);return D(`)`),Te.range=v(e),t}),Ee=()=>{let e=T();i.offsideColumns.push(e.column);let t=[j()];for(;b().text===e.text&&b().column===e.column;)i.index++,t.push(j());return i.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:f(e)}},De=e=>he(()=>{let t=f(e),r=x().kind===`Identifier`,a=w(`|->`,1)&&(r||se(x()));if(a||r&&w(`:`,1)){let e=a?`Record`:`RecordSet`,n=e=>{let t=i.index,n=f(x()),r=e();return n.range=v(t),D(a?`|->`:`:`),{name:r,value:j(),location:n}},o=[n(()=>r?ce():T().text),...E(`,`)?O(()=>n(ce)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(ge()){let e=ye();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!se(x()))throw oe(`Expected a field name but found ${ee(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!n&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:be(),location:t}}),Oe=()=>{let e=i.index,t=y(Le(),e),n=f(T());return y({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},ke=e=>he(()=>{let t=f(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ge()&&(x(1).text===`\\in`||w(`<<`))){let e=i.index,n=ve();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}i.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Oe():j();if(E(`:`)){let e=ye();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ae=e=>{let t=f(e),n=he(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:be(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},je=e=>{let t=f(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ge()){let e=ye();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=ue(O(le));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Me=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:f(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:f(e)}},Ne=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Rp.has(e.text)||e.kind===`Operator`&&(Op.has(e.text)||kp.has(e.text)||Ap.has(e.text)))},Pe=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return i.index--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:w(`(`)?A():[]}},Fe=e=>{let t=i.index,r=T(),s=f(r);if(n&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=O(ce);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:s}}if(r.kind===`Number`){if(n&&/^\\[BOH]/.test(r.text))throw C(`incomplete expression`,r);return{kind:`Number`,value:pe(r.text),text:r.text,location:s}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:s};if(r.kind===`String`)return{kind:`String`,value:r.text,location:s};let c=r.kind===`Step`&&et(r);if(c&&Ze()<0&&Xe.length<=1)throw C(`Step number used outside proof`,r);if(c&&r.text[1]===`+`)throw C(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||c){let o=c?tt(r)??r.text:r.text;if(_e()){let t=ue(E(`(`)?O(le):[]);t.names.length>0&&D(`)`),D(`::`);let i=j();if(!n&&e!==void 0&&a.last!==void 0&&Fp(i)&&e.high>=a.last.low)throw C(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:o,params:t.names,paramRanges:t.ranges,body:i,location:s}}let l=w(`(`);if(o===`@`&&!l&&!Ne())return{kind:`ExceptAt`,location:s};let u=l?A():[],d=[l?Te.range:void 0];if(!Ne())return l?{kind:`Apply`,operator:o,args:u,argumentsRange:Te.range,location:s}:{kind:`Identifier`,name:o,location:s};let f=[{kind:`Name`,name:o,args:u}],p=[v(t,t)];for(;Ne();)T(),p.push(v(i.index,i.index)),Te.range=void 0,f.push(Pe()),d.push(Te.range);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),y=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:s}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:s}:_.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:h,args:g,argumentCounts:_,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}:{kind:`Apply`,operator:h,args:g,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}}if(r.kind===`Operator`&&Ip(r.text)&&w(`(`))return{kind:`Apply`,operator:r.text,spelling:r.spelling,args:A(),location:s};if(r.kind===`Operator`&&Ip(r.text)&&!n)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:s};switch(r.text){case`(`:{let e=he(()=>j());return D(`)`),e}case`[`:return De(r);case`{`:return ke(r);case`<<`:return Ae(r);case`@`:return{kind:`ExceptAt`,location:s};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return je(r);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:s}}case`CASE`:return Me(r);case`LET`:{let e=[],t=[];for(o.push(/* @__PURE__ */ new Set);!E(`IN`);){if(n&&w(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,S(b()));if(E(`RECURSIVE`)){qe();continue}let r=Be(!1);r.kind===`Instance`?t.push(r):e.push(r)}o.pop();let r=j();return t.length===0?{kind:`Let`,definitions:e,body:r,location:s}:{kind:`Let`,definitions:e,instances:t,body:r,location:s}}case`CHOOSE`:{let e=ve(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:s}}case`WF_`:case`SF_`:{let e=be(),t=he(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:s}}}throw oe(`Unexpected ${ee(r)}`,r)},Ie=(e,t,r)=>{a.last=a.preceding={low:t,high:r};let i=j(r+1),o=x(),s=o.text===`'`||kp.has(o.text)?Ep.high:Op.get(o.text)?.high;if(!n&&o.kind===`Operator`&&s!==void 0&&s>=t)throw C(`Precedence conflict between ${e.text} and ${o.text}`,o);return i},Le=()=>{let e=a.preceding;a.preceding=void 0;let t=x(),r=f(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ee();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Ie(t,4,4)],location:r};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Ie(t,12,12)],location:r};case`[]`:return T(),{kind:`Always`,expression:Ie(t,4,15),location:r};case`<>`:return T(),{kind:`Eventually`,expression:Ie(t,4,15),location:r};case`ENABLED`:return T(),{kind:`Enabled`,expression:Ie(t,4,15),location:r};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Ie(t,4,15),location:r};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[n?j(9):Ie(t,10,13)],location:r}}return Fe(e)},j=(e=0)=>{let t=i.index,n=Le(),r={left:n.location.range?n:y(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=f(n);if(n.text===`'`&&e<=15){T(),a.last=Ep,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(kp.has(n.text)&&e<=15){T(),a.last=Ep,r.left=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=he(()=>O(()=>j()));he(()=>D(`]`)),a.last=Dp,r.left=y({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&se(x(1))){T();let e=T().text;r.left=y({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let o=Op.get(n.text);if(!o||o.low<e)break;let s=r.previous;if(s){let e=!(s.low>o.high||s.high<o.low),t=s.text===n.text&&o.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw C(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),o.low>12&&w(`-`))throw C(`Precedence conflict between ${n.text} and -`,x());a.last=a.preceding=o;let c=j(o.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[v(t).end];r.left=l.kind===e&&s?.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`&&s?.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=y(r.left,t),r.previous={...o,text:n.text}}return r.left},Re=()=>{if(!E(`(`))return[];let e=Ke();return D(`)`),e},ze=()=>{let e=f(x()),t=j(),n=r[i.index-1],a={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:l[0].name,start:e,end:a}}},Be=e=>{let t=i.index;return y(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=x(),n=f(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...ze(),isLocal:e,isRecursive:d(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&Op.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=le(),t=T().text,n=le();return D(`==`),r(t,[Ve(e),Ve(n)])}let a=t.kind!==`String`&&jp.has(t.text),o=t.kind===`Identifier`&&kp.has(x(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:x(1).text;a&&T();let n=le();return o&&T(),D(`==`),r(e,[Ve(n)])}let s=ce();if(E(`[`)){let t=he(()=>ye());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:d(s),location:n}}let c=i.index,l=Re();return D(`==`),w(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:v(c)}:r(s,l)},Ue=(e,t,n,r)=>{let a=i.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:E(`WITH`)?O(()=>{let e=i.index,t=de(),n=v(e);return D(`<-`),{name:t,nameRange:n,expression:k()}}):[],isLocal:n,location:r,instanceRange:v(a)}},We=()=>{let e=i.index;return y(Ge(),e)},Ge=()=>{let e=f(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ce();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Ke=()=>O(We),qe=()=>{let e=Ke();return e.forEach(e=>o[o.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Jp.has(e.text)&&t.value++,e.kind===`Operator`&&Yp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Je(1)):t.kind===`Operator`&&kp.has(t.text)?w(`==`,2):t.kind===`Operator`&&Op.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&jp.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=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)},et=e=>!e.text.endsWith(`.`)&&!Wp.has($e(e)),tt=e=>{let t=$e(e);if(Wp.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return Vp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},M=e=>!s.has(e)&&l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),it=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Xp.has(e.name)&&!M(e.name):!1,at=()=>{let e=x();return e.kind===`Step`?et(e):e.kind===`Keyword`?Gp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},ot=()=>{let e=i.index,t=x();return t.kind===`Operator`&&!Mp.has(t.text)&&Ip(t.text)?(i.index++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:f(t)},e)):E(`MODULE`)?y({kind:`ModuleFact`,name:ce(),location:f(t)},e):j()},st=e=>c[c.length-1]?.add(e),ct=e=>{c.push(/* @__PURE__ */ new Set);let t=e();return c.pop(),t},lt=e=>c.some(t=>t.has(e))||l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ut=()=>{let e=i.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw oe(`Expected a definition name but found ${ee(e)}`,e);return i.index++,e.text},`!`),r=f(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},dt=()=>{if(n)return O(ut);let e=O(ot),r=t===`tlc`?e.find(e=>e.kind===`Identifier`&<(e.name)):void 0;if(r)throw C(`DEF clause entry should describe a defined operator`,r.location);return e},N=()=>({facts:at()?O(ot):[],defs:E(`DEF`)||E(`DEFS`)?dt():[]}),ft=()=>{let e=i.index,n=T(),r=n.text===`USE`&&E(`ONLY`),a=v(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...N(),keyword:a,location:f(n)},s=o.kind===`Hide`&&t===`tlc`?o.facts.filter(e=>!it(e)):[];if(s.length>0)throw p(s.map(t=>({location:g(t.location.range??v(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
467
|
-
the name of a theorem, assumption, or step.`})));return y(o,e)},P=()=>{let e=i.index,t=f(x()),n=E(`NEW`),r=x().kind===`Keyword`?Kp.get(x().text):void 0;if(!n&&r===void 0)throw oe(`Expected a declaration but found ${ee(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=le();return st(n.name),y({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let a=We();st(a.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw C(`declared symbol with arguments before \\in`);return o&&T(),y({kind:`NewSymbol`,name:a.name,arity:a.arity,level:r??`Constant`,set:o?j():void 0,nameRange:a.location.range,location:t},e)},F=()=>{let e=i.index,t=f(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?ct(F):x().kind===`Keyword`&&qp.has(x().text)?P():j());return D(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},pt=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},mt=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},ht=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return ft();if(w(`INSTANCE`)){let t=i.index;return y(Ue(void 0,[],!1,f(e)),t)}if(w(`DEFINE`)||Ye()){let t=i.index;E(`DEFINE`);let n=[Be(!1)];for(;Ye();)n.push(Be(!1));let r={kind:`Define`,definitions:n,location:f(e)};return y(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=ge(),t=ue(e?[]:O(le)),n=e?ye():[];return mt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=pt(`:`),t=ue(e?O(le):[]),n=e?[]:ye();return mt(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?F():j()}},gt=e=>{let t=x();if(t.kind!==`Step`)throw oe(`Expected a step number but found ${ee(t)}`,t);if(!rt(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return i.index++,{name:tt(t),token:t.text,location:f(t)}},_t=()=>{let e=i.index,t=gt(w(`QED`,1)),n=i.index,r=/* @__PURE__ */ new Set;c.push(r);let a=E(`QED`)?{kind:`Qed`}:ht(),o=v(e),s=v(n),l=nt(x());if(l&&!Hp.has(a.kind))throw C(`Proof of a step that does not take a proof`);let u=l?yt():void 0;return c.pop(),(a.kind!==`Assert`||a.isSuffices)&&r.forEach(st),y({...t,body:a,head:o,statement:s,proof:u},e)},vt=()=>{let e=f(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=v(i.index-1);return{kind:`By`,isOnly:E(`ONLY`),...N(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=v(i.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[_t()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(_t());return{kind:`Steps`,level:Ze(),steps:n,location:e}},yt=()=>{let e=i.index;Xe.push(-1);let t=ct(vt);return Xe.pop(),y(t,e)},bt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},xt=e=>{let t=i.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?ce():void 0;r!==void 0&&(s.add(r),T());let a=ct(()=>({statement:w(`ASSUME`)?F():j(),proof:nt(x())?yt():void 0})),o=a.statement,c=y({name:r,statement:o,proof:a.proof,location:f(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&o.kind!==`AssumeProve`&&bt(e,y({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:f(n)},t))},St=()=>{let e=i.index;return y(Ct(),e)},Ct=()=>{let e=T(),t=f(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=ce();return s.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},wt=()=>{let e=f(D(`----`));D(`MODULE`);let t=me();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(l.push(n),o.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=i.index;n.extends.push(me()),n.extendsRanges.push(v(e))});;){let t=i.index;te.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:l[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},l.pop(),o.pop(),n;if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=wt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=f(T()),r=Ke();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=f(T()),r=O(()=>{let e=i.index,t=f(x());return y({name:ce(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=St();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&bt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw oe(`Expected a module unit but found ${ee(r)}`);let e=ft();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Tt(n,y(Ue(void 0,[],!1,f(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){Tt(n,y(Ue(void 0,[],!0,f(r)),t));continue}Tt(n,y(He(!0),t));continue}r.kind===`Keyword`&&Bp.has(r.text)?xt(n):Tt(n,Be(!1))}}},Tt=(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}))},Et=wt(),Dt=fe.isUsed?Tp(e):void 0;if(Dt!==void 0)throw new u(Dt);return Et},$p=e=>Qp(e,`tlc`),em=e=>Qp(e,`tlapm`),tm=e=>Qp(e,`sany`),nm=25214903917n,rm=(1n<<48n)-1n,im=2147483647,am=e=>{let t={value:(BigInt.asUintN(64,e)^nm)&rm},n=e=>(t.value=t.value*nm+11n&rm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^nm)&rm},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<=im)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},om=10454148508367108822n,sm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:om);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),cm=Int32Array.from(sm,e=>Number(BigInt.asIntN(32,e>>32n))),lm=Int32Array.from(sm,e=>Number(BigInt.asIntN(32,e))),um=Number(BigInt.asIntN(32,om>>32n)),dm=Number(BigInt.asIntN(32,om));let fm=um,pm=dm;const mm=e=>{let t=(e^pm)&255;pm=(pm>>>8|fm<<24)^lm[t],fm=fm>>>8^cm[t]},hm=e=>{for(let t=0;t<32;t+=8)mm(e>>>t)},gm=e=>{if(typeof e==`boolean`)mm(0),mm(e?116:102);else if(typeof e==`number`)mm(1),hm(e);else if(typeof e==`string`){mm(3),hm(e.length);for(let t=0;t<e.length;t++)mm(e.charCodeAt(t))}else if(F(e))mm(21),hm(Mt(e.name)+1);else if(P(e)){let t=Ar(e);mm(9),hm(t.domain.length);for(let e=0;e<t.domain.length;e++)gm(t.domain[e]),gm(t.range[e])}else{let t=L(e).elements;mm(5),hm(t.length);for(let e of t)gm(e)}},_m=e=>{let t={high:fm,low:pm};fm=um,pm=dm;for(let t of e)gm(t);let n=BigInt(fm>>>0)<<32n|BigInt(pm>>>0);return fm=t.high,pm=t.low,n},vm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||F(e))return 5;if(typeof e==`string`)return 5+e.length;if(P(e)){let t=Ar(e);return t.domain.reduce((e,n,r)=>e+vm(n)+vm(t.range[r]),5)}return L(e).elements.reduce((e,t)=>e+vm(t),5)},ym=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){fm=n<32?0:1<<n-32,pm=n<32?1<<n:0;for(let t=0;t<e;t++)mm(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^fm,t[n+1]=t[a+1]^pm}}return t},bm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=r.get(e);if(t!==void 0)return t;let n=vm(e);return fm=0,pm=0,gm(e),r.set(e,i.length),i.push(n,fm,pm),i.length-3},o=e=>{let t=n.get(e);if(t)return t;let r=ym(e);return n.set(e,r),r};return(n,r)=>{let s={high:fm,low:pm},c={high:um,low:dm};for(let t of e){let e=a(n[t]),r=o(i[e]),s={high:i[e+1],low:i[e+2]};for(let e=0;e<8;e++){let t=e<4?c.low:c.high,n=(e*256+(t>>>(e&3)*8&255))*2;s.high^=r[n],s.low^=r[n+1]}c.high=s.high,c.low=s.low}fm=s.high,pm=s.low,t[2*r]=c.low,t[2*r+1]=c.high}},xm=[],Sm=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Cm=()=>{for(let e=1277011;xm.length<1341;e++)Sm(e)&&xm.push(e);return xm},wm=e=>{let t=Cm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Tm=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},Em=e=>{for(let t=Math.max(e,9);;t++){let e=Tm(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)}}},Dm=(e,t,n)=>{if(t<=0)return[];let r=Em(t),i={index:BigInt(n.nextInt(t))},a=BigInt(wm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Om=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:im),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},km=(1n<<63n)-1n-24n,Am=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(km*BigInt(n)+i)%t;return r<0n?r+t:r})},jm=(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,Mm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Zn(e.domain),n=L(e.range).elements;return{lists:t.map(()=>n),create:e=>Ut(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>L(e).elements),create:t=>er(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>L(e).elements),create:$n}}},Nm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Pm=(e,t,n,r)=>{if(R(t))return[];let i=r===`1.7.4`?Om:Dm;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=Nm(t,r)?void 0:Mm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(im)?Am(e,t,n):i(e,Number(t),n)).map(e=>a.create(jm(a.lists,e)))}let o=L(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Fm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new y(`RandomElement of the empty set`);return n},Im=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Zn(e.domain)];return Ut(n,n.map(()=>Im(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return er(e.names.map((n,r)=>[n,Im(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return $n(e.factors.map(e=>Im(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(`RandomElement of the empty set`);return e.low+r}return Fm(L(e).elements,t)},Lm=(e,t=0n)=>{let n=am(t),r={random:am(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>er([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:_m,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=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},Rm=e=>Un([...e.possibleCounts].map(([e,t])=>[e,t])),zm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Rm(e)]]),Bm=`----------------------------- MODULE Bags --------------------------------
|
|
458
|
+
`]]),Nd=/* @__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)`]])]]),Pd=y(`EOF`),Fd=y(`IDENTIFIER`),Id=y(`DEFBREAK`),Ld=(e,t)=>Array.from({length:y(t)-y(e)+1},(t,n)=>y(e)+n),Rd=new Set(Ld(`op_57`,`op_119`)),zd=new Set(Ld(`op_1`,`op_119`)),Bd=new Set(Ld(`op_57`,`op_70`)),Vd=/* @__PURE__ */ new Set([...Ld(`ACTION`,`EXCEPT`),y(`EXTENDS`),...Ld(`IF`,`SF`),y(`STATE`),...Ld(`THEN`,`WITH`),y(`US`),...Ld(`op_112`,`op_116`)]),Hd=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),Ud=new Map([...Hd(`postfix`,160,160,!0,`[`),...Hd(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Hd(`prefix`,120,120,!1,`-.`),...Hd(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Hd(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Hd(`prefix`,40,40,!0,`\\lnot`),...Hd(`nfix`,100,130,!0,`\\times`),...Hd(`infix`,140,140,!1,`^`,`^^`),...Hd(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Hd(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Hd(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Hd(`infix`,100,110,!0,`|`,`||`,`%%`),...Hd(`infix`,100,110,!1,`%`),...Hd(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Hd(`infix`,90,140,!1,`\\wr`),...Hd(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Hd(`infix`,90,130,!1,`!!`),...Hd(`infix`,90,90,!1,`...`,`..`),...Hd(`infix`,80,80,!0,`\\intersect`,`\\union`),...Hd(`infix`,80,80,!1,`\\`),...Hd(`infix`,70,70,!1,`<:`,`:>`),...Hd(`infix`,60,60,!0,`@@`),...Hd(`infix`,50,140,!0,`\\cdot`),...Hd(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Hd(`infix`,30,30,!0,`\\land`,`\\lor`),...Hd(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Hd(`infix`,10,10,!1,`=>`)]),Wd=new Map([...Ud,...Dd.flatMap(e=>e.slice(1).map(t=>[t,Ud.get(e[0])]))]),Gd=Wd.get(`[`),Kd={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},qd=e=>({type:`tokens`,kinds:new Set(e)}),Jd=e=>typeof e==`string`?e.startsWith(`<`)?qd([y(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(Jd)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),Yd=e=>(...t)=>({type:e,body:W(...t)}),K=Yd(`zeroOrMore`),Xd=Yd(`oneOrMore`),q=Yd(`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}),Zd=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Qd=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Zd(e,n);return n},$d=(...e)=>{let t=e.map(y);return e=>t.includes(Qd(e,1).kind)},ef=(e,t=Qd(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},tf=e=>{let t=Qd(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},nf=e=>$d(`CASESEP`)(e)&&ef(e),rf=e=>{let t=Qd(e,1);Vd.has(t.kind)&&(t.kind=Fd)},af=(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}`,of=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),sf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},cf=e=>e.operatorStacks[e.operatorStacks.length-1],lf=(e,t)=>e.low>t.high,uf=(e,t)=>e.high<t.low,df=e=>e.fix===`prefix`?e:Wd.get(`${e.name}.`),ff=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Gd?of(`FcnAppl`,[n,...r.node.heirs]):of(`PostfixExpr`,[n,r.node]),operator:void 0})},pf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:of(`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:of(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},mf=e=>{let t=cf(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 ff(t,n),mf(e);if(i.operator!==void 0){let t=df(r.operator);return t!==void 0&&lf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${af(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 ${af(e,a.node.first,a.node.last)} and expression at location ${af(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return uf(a.operator,r.operator)?void 0:lf(a.operator,r.operator)?(pf(t,a.operator),mf(e)):`Precedence conflict between ops ${a.operator.name} in block ${af(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=df(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(uf(s,r.operator))return;if(!lf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${af(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return pf(t,s),mf(e);let c=af(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===Kd?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},hf=e=>J(t=>{let n=cf(t),r=sf(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:mf(t)}),gf=hf(()=>!1),_f=hf(()=>!0),vf=J(e=>{e.lastOperator=Wd.get(e.token.image)}),yf=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},bf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?yf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},xf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!ef(e,n.first.beginColumn))return n;let t=xf(e,n);if(t!==void 0)return t}},Sf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(y),n=(e,...t)=>t.some(t=>e.kind===y(t)),r=e=>e!==void 0&&Rd.has(e.kind),i=e.token,a=Zd(e,i);i.next=void 0;let o=Zd(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===Fd&&(e=e.next)}else if(e.kind===Fd){let t=e.next;!r(t)||Bd.has(t.kind)||zd.has(t.kind)&&t.next?.kind!==Fd||(e=t.next?.kind===y(`SUBSTITUTE`)?i:zd.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==Id&&(e.next={kind:Id,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Zd(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Cf=e=>{let t=Qd(e,1);if(t.kind===y(`LAB`)){let n=1;for(;n!==0;)if(t=Zd(e,t),t.kind===y(`LAB`)&&n++,t.kind===y(`RAB`)&&n--,t.kind===Pd)return!1;return Zd(e,t).kind===y(`IN`)}if(t.kind!==Fd)return!1;for(t=Zd(e,t);t.kind===y(`COMMA`);){if(t=Zd(e,t),t.kind!==Fd)return!1;t=Zd(e,t)}return t.kind===y(`IN`)},wf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Tf=e=>e.proofLevels.at(-1)??-1,Ef=e=>{let t=Qd(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:$d(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Tf(e)>=0&&wf(t)>Tf(e):$d(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Df=(e,t)=>{let n=wf(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},Of=e=>J(t=>Df(t,t.token)?void 0:`${af(t,t.token)}: ${e}`),kf=qd([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(y)),Af=qd([...kf.kinds,y(`op_76`)]),jf=qd(zd),Mf=qd(Bd),Nf=qd([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(y)),Pf=()=>K(X({expansion:[G(kf,`<op_77>`)],semantic:ef}),G(`PrefixOp`,`InfixOp`),_f),Ff=()=>G(W(X({expansion:[`OpenStart`],semantic:ef}),`OpenExpression`,gf),W(X({semantic:ef}),`ExtendableExpr`)),If=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),Lf=()=>G(W(X({semantic:e=>$d(`ASSUME`,`BOXASSUME`)(e)||Qd(e,2).kind===y(`COLONCOLON`)&&[y(`ASSUME`),y(`BOXASSUME`)].includes(Qd(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Rf=()=>[`JuncItem`,K(X({semantic:tf}),`JuncItem`)],zf=e=>J(t=>{t.expecting=e,rf(t)}),Bf=e=>J(t=>{t.isTerminalProof=e}),Vf=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Sf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),Hf={CompilationUnit:Z(void 0,[J(Sf),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>`),zf(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,zf(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,zf(`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(Sf)),W(X({semantic:e=>$d(`USE`)(e)&&Qd(e,2).kind!==y(`ONLY`)||$d(`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(Vf(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Vf(`Expression`,X({expansion:[`<IDENTIFIER>`,Mf]}),`PostfixLHS`,`Expression`),Vf(`Expression`,X({expansion:[`<IDENTIFIER>`,jf]}),`InfixLHS`,`Expression`),Vf(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),Vf(`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`,[Af,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,jf,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,Mf]),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>`,zf(`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,[kf,vf]),NonExpPrefixOp:Z(void 0,[Af,vf]),InfixOp:Z(`Infix Op`,[jf,vf]),PostfixOp:Z(void 0,[Mf,vf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Sf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),Lf(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),Lf(),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=sf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${af(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(Sf),G(W(X({amount:3}),X({semantic:$d(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Ef}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>$d(`BY`)(e)||Qd(e,2).kind===y(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>Qd(e,2).kind!==y(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,Bf(!0),q(`<ONLY>`)),W(`<USE>`,Bf(!1),q(`<ONLY>`)),W(`<HIDE>`,Bf(!1))),Y("an expression, `MODULE' or `DEF'"),q(If(),K(`<COMMA>`,Y(`MODULE or expression`),If(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),If(),K(`<COMMA>`,Y(`MODULE or expression`),If(),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`),Nf,Of(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Ef}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),Nf,Of(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:$d(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:$d(`INSTANCE`)}),`Instantiation`),W(X({semantic:$d(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Ef}),J(e=>{let t=sf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${af(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),Xd(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:$d(`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(Af,jf,Mf),qd([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(y))],semantic:ef}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${af(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:ef}),`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:Cf}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),Xd(`<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=sf(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`)),Xd(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Cf}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>Qd(e,2).kind===y(`MAPTO`)&&Vd.has(Qd(e,1).kind)}),J(e=>{Qd(e,1).kind=Fd}),`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=of(`FcnAppl`,t.heirs),e.lastOperator=Gd})),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>`,Xd(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(rf),`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===y(`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=>nf(e)&&Qd(e,2).kind!==y(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:nf}),`<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`,[Xd(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=Qd(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...Rf()),W(X({expansion:[`<AND>`]}),...Rf())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=xf(t,e.heirs[1]);return n&&`Item at ${af(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${af(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([])}),Pf(),Ff()],(e,t)=>{let n=cf(t);n.push({node:e.heirs[0],operator:Kd});let r=mf(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`),gf,K(G(W(X({expansion:[`PostfixOp`],semantic:ef}),`PostfixOp`,_f),W(X({expansion:[`<DOT>`],semantic:ef}),`<DOT>`,J(rf),X({semantic:ef}),`Identifier`,J(e=>{let t=cf(e);t[t.length-1].operator!==void 0&&ff(t,t.length),t[t.length-1]={node:of(`RecordComponent`,[t[t.length-1].node,sf(e,2),sf(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:ef}),Y(`function argument`),`SBracketCases`,hf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:ef}),`InfixOp`,_f,Pf(),Ff()),W(X({expansion:[`<COLONCOLON>`],semantic:ef}),`<COLONCOLON>`,J(e=>{let t=cf(e);if(!bf(t[t.length-1].node))return`\`::' at ${af(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=cf(e),n=sf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!uf(r,e.lastOperator)){let t=sf(e,3);return`Removing label at ${af(e,t.first,t.last)} would change expression parsing.`}t.push({node:of(`Label`,[sf(e,3),sf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:ef}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:ef}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>Tf(e)<0&&e.proofLevels.length<=1?`${af(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${af(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:yf(e.heirs)===void 0?e.heirs.length===1?of(`GeneralId`,e.heirs):void 0:of(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>Qd(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=>Qd(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${af(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Uf=/* @__PURE__ */ new Map,Wf=e=>{let t=Uf.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Wf(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,Wf(Hf[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 Uf.set(e,n),n},Gf=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Kf=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Zd(e,e.scanPosition)),e.scanPosition=Zd(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`},qf=(e,t)=>{if(t.type===`tokens`)return Kf(e,t.kinds);if(t.type===`call`)return qf(e,Hf[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Gf(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=qf(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||Gf(e,t.semantic)?qf(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=qf(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=qf(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Jf=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=qf(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},Yf=(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||Wf(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Wf(a).hasSemanticStart?Wf(a).first.has(Qd(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Jf(e,i,a)&&(o===void 0||o(e))}),Xf=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,qf(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Zd(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Pd){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Zd(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${be(e.token.image)}" `},Zf=(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??Xf(e)}\n\nResidual stack trace follows:\n${r}`,!1},Qf=(e,t)=>{let n=Zd(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,Zf(e))},$f=(e,t)=>{let n=Hf[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Qd(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!ep(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 Zf(e,i);let a=r.node??(r.heirs.length===0?void 0:of(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},ep=(e,t)=>{if(t.type===`tokens`)return Qf(e,t.kinds);if(t.type===`call`)return $f(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Zf(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Zf(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||ep(e,t));if(t.type===`choice`){let n=Yf(e,t.alternatives);return n===-1?Zf(e):ep(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!ep(e,t.body))return!1;if(t.type===`optional`)return Yf(e,[t.body])===-1||ep(e,t.body);for(;Yf(e,[t.body])===0;)if(!ep(e,t.body))return!1;return!0},tp=e=>{let t=T(e),n={kind:Pd,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=ep(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},np={low:15,high:15},rp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),ip=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)]]),ap=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),op=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),sp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),cp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),lp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),up=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...ap]),dp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),fp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),pp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),mp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),hp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),gp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),_p=/* @__PURE__ */ new Set([``,`*`,`-`]),vp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),yp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),bp=/* @__PURE__ */ new Set([`NEW`,...yp.keys()]),xp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Sp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Cp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),wp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?ip.has(e.operator):ap.has(e.operator)),Tp=e=>ip.has(e)||ap.has(e)||e===`-.`,Ep=(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}}},Dp=(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(`
|
|
459
|
+
`)}\n`},Op=(t,n)=>{let r=n===`tlapm`,i=r?ne(t):ne(t).map(te),a={index:0,offsideColumns:[]},o={},s=[],l=/* @__PURE__ */ new Set,u=[],d=[],f=e=>s[s.length-1].has(e),p=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],ee=[],g=(e,t=a.index-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];m[e]??=p(i[e]),h[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:m[e],end:h[t]};return e===t&&(ee[e]=o),o},_=(e,t)=>(e.location.range=g(t),e),re=(e=0)=>i[Math.min(a.index+e,i.length-1)],v=(e=0)=>{let t=re(e),n=a.offsideColumns[a.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},y=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie={index:0},ae=e=>{let t=i.slice(ie.index,a.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>r&&(e.kind===`Keyword`||Cp.has(e.text)),se=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},ce=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:gp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):oe(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,le=(t,n=re(),r)=>{let a=i[i.length-1],o=n.line===a.line&&n.column===a.column;return new e.D(`${t} at line ${n.line}, column ${n.column}`,void 0,ue(t,n,o,r))},ue=(e,t,n,a)=>{if(r&&n){let e=i[i.length-1];return{reason:`Unexpected EOF`,...ae(se(e)),isEnd:n}}return r&&a?{reason:`Unexpected ${ce(a)}`,...se(a),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=re())=>le(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!oe(e),b=(e,t=0)=>{let n=v(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=v();if(e.kind===`End`)throw le(`Unexpected end of expression`);return a.index++,e},S=e=>b(e)?(a.index++,!0):!1,C=e=>{if(!b(e))throw de(`Expected ${JSON.stringify(e)} but found ${y(v())}`);return x()},pe=()=>{let e=v();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${y(e)}`);if(oe(e))throw de(`Unexpected keyword ${e.text}`);return a.index++,e.text},me=()=>{let e=a.index;return{name:pe(),range:g(e)}},he=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),ge=()=>{let e=v();return e.kind!==`String`&&(sp.has(e.text)||ip.has(e.text)||ap.has(e.text)||e.text===`'`)?(a.index++,e.text):pe()},_e={isUsed:!1},ve=()=>v().kind===`Identifier`||!fe(v())?pe():(_e.isUsed=!0,x().text),w=e=>{if(!r)return e();a.offsideColumns.push(-1);let t=e();return a.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},ye=()=>{if(b(`<<`)){let e={value:1};for(;v(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;v(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},be=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;v(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return v(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},xe=()=>{if(!S(`<<`)){let e=me();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=he(T(me));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Se=()=>T(()=>{let e=T(xe);C(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),E=()=>{let e=v();if(e.kind===`Identifier`){let t=a.index,n=[x().text];for(;b(`!`)&&v(1).kind===`Identifier`;)x(),n.push(pe());return _({kind:`Identifier`,name:n.join(`!`),location:p(e)},t)}if(b(`<<`)||b(`(`))return A();throw de(`Expected a subscript but found ${y(e)}`)},D=e=>{let t=v(1),n=v(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`&&b(`==`,ap.has(n.text)?3:4))},Ce=e=>{let t=v(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&fp.has(t.text)||D(e)},we=()=>{let e=v(),t=e.kind===`Operator`&&(ip.has(e.text)||op.has(e.text))&&Ce(e);if(r&&e.kind!==`String`&&(op.has(e.text)||up.has(e.text)&&e.text!==`'`&&!ap.has(e.text)||lp.has(e.text)&&v(-1).text===`(`&&v(-1).line===e.line&&v(-1).endColumn+1===e.column&&v(1).text===`)`&&v(1).line===e.line&&v(1).column===e.endColumn+1)&&Ce(e))throw le(`incomplete expression`,e);if(t)return a.index++,_({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:p(e)},a.index-1);if(e.kind!==`String`&&up.has(e.text)&&Ce(e)){a.index++;let t=p(e);if(ap.has(e.text))return _({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return _({kind:`Lambda`,params:[n.name],body:Ep(e.text,n,t),operator:e.text,location:p(e)},a.index-1)}if(b(`LAMBDA`)){let t=a.index;x();let n=he(T(me));C(`:`);let r=j();return _({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:p(e)},t)}return j()},Te={range:void 0},Ee=()=>w(()=>{let e=a.index;C(`(`);let t=T(we);return C(`)`),Te.range=g(e),t}),De=()=>{let e=x();a.offsideColumns.push(e.column);let t=[j()];for(;re().text===e.text&&re().column===e.column;)a.index++,t.push(j());return a.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:p(e)}},Oe=e=>w(()=>{let t=p(e),n=v().kind===`Identifier`,i=b(`|->`,1)&&(n||fe(v()));if(i||n&&b(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a.index,n=p(v()),r=e();return n.range=g(t),C(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?pe():x().text),...S(`,`)?T(()=>r(pe)):[]];return C(`]`),{kind:e,fields:o,location:t}}if(ye()){let e=Se();C(`|->`);let n=j();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(S(`->`)){let e=j();return C(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(S(`EXCEPT`)){let e=T(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!fe(v()))throw de(`Expected a field name but found ${y(v())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:T(()=>j())}),C(`]`);return C(`=`),{path:e,value:j()}});return C(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!b(`]_`)){let e=[o];for(;S(`,`);)e.push(j());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:o,subscript:E(),location:t}}),ke=()=>{let e=a.index,t=_(Fe(),e),n=p(x());return _({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},Ae=e=>w(()=>{let t=p(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ye()&&(v(1).text===`\\in`||b(`<<`))){let e=a.index,n=xe();C(`\\in`);let r=j();if(S(`:`)){let e=j();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a.index=e}let n=v().kind===`Identifier`&&b(`\\in`,1)?ke():j();if(S(`:`)){let e=Se();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(j());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),je=e=>{let t=p(e),n=w(()=>b(`>>`)||b(`>>_`)?[]:T(()=>j()));if(S(`>>_`)){if(n.length!==1)throw le(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:E(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Me=e=>{let t=p(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ye()){let e=Se();return C(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=he(T(me));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},O=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:j(),location:p(e)};let n=j();C(`->`),t.push({condition:n,body:j()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:p(e)}},Ne=()=>{let e=v(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||dp.has(e.text)||e.kind===`Operator`&&(ip.has(e.text)||ap.has(e.text)||op.has(e.text)))},k=()=>{let e=x();if(e.kind===`Number`)return{kind:`Operand`,operand:c(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a.index--,{kind:`Bound`,args:Ee()}}return{kind:`Name`,name:e.text,args:b(`(`)?Ee():[]}},A=e=>{let t=a.index,n=x(),i=p(n);if(r&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(pe);return C(`:`),{kind:`Lambda`,params:e,body:j(),location:i}}if(n.kind===`Number`){if(r&&/^\\[BOH]/.test(n.text))throw le(`incomplete expression`,n);return{kind:`Number`,value:c(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 l=n.kind===`Step`&&Qe(n);if(l&&Ye()<0&&Je.length<=1)throw le(`Step number used outside proof`,n);if(l&&n.text[1]===`+`)throw le(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||l){let s=l?$e(n)??n.text:n.text;if(be()){let t=he(S(`(`)?T(me):[]);t.names.length>0&&C(`)`),C(`::`);let a=j();if(!r&&e!==void 0&&o.last!==void 0&&wp(a)&&e.high>=o.last.low)throw le(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:i}}let c=b(`(`);if(s===`@`&&!c&&!Ne())return{kind:`ExceptAt`,location:i};let u=c?Ee():[],d=[c?Te.range:void 0];if(!Ne())return c?{kind:`Apply`,operator:s,args:u,argumentsRange:Te.range,location:i}:{kind:`Identifier`,name:s,location:i};let f=[{kind:`Name`,name:s,args:u}],p=[g(t,t)];for(;Ne();)x(),p.push(g(a.index,a.index)),Te.range=void 0,f.push(k()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),ee=f.flatMap(e=>`args`in e?e.args:[]),te=f.map(e=>`args`in e?e.args.length:0),ne=d.at(-1)??g(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,...te.slice(0,-1).some(e=>e>0)&&{argumentCounts:te},argumentsRange:ne,selectorRanges:p,argumentRanges:d,location:i}}if(n.kind===`Operator`&&Tp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:Ee(),location:i};if(n.kind===`Operator`&&Tp(n.text)&&!r)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:i};switch(n.text){case`(`:{let e=w(()=>j());return C(`)`),e}case`[`:return Oe(n);case`{`:return Ae(n);case`<<`:return je(n);case`@`:return{kind:`ExceptAt`,location:i};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Me(n);case`IF`:{let e=j();C(`THEN`);let t=j();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:i}}case`CASE`:return O(n);case`LET`:{let e=[],t=[];for(s.push(/* @__PURE__ */ new Set);!S(`IN`);){if(r&&b(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`,ae(re()));if(S(`RECURSIVE`)){Ge();continue}let n=Re(!1);n.kind===`Instance`?t.push(n):e.push(n)}s.pop();let n=j();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=xe(),t=S(`\\in`)?j():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:i}}case`WF_`:case`SF_`:{let e=E(),t=w(()=>{C(`(`);let e=j();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:i}}}throw de(`Unexpected ${y(n)}`,n)},Pe=(e,t,n)=>{o.last=o.preceding={low:t,high:n};let i=j(n+1),a=v(),s=a.text===`'`||ap.has(a.text)?np.high:ip.get(a.text)?.high;if(!r&&a.kind===`Operator`&&s!==void 0&&s>=t)throw le(`Precedence conflict between ${e.text} and ${a.text}`,a);return i},Fe=()=>{let e=o.preceding;o.preceding=void 0;let t=v(),n=p(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return De();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[Pe(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[Pe(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:Pe(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:Pe(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:Pe(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:Pe(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[r?j(9):Pe(t,10,13)],location:n}}return A(e)},j=(e=0)=>{let t=a.index,n=Fe(),r={left:n.location.range?n:_(n,t),previous:void 0};for(;;){let n=v();if(n.kind!==`Operator`)break;let i=p(n);if(n.text===`'`&&e<=15){x(),o.last=np,r.left=_({kind:`Prime`,expression:r.left,location:i},t);continue}if(ap.has(n.text)&&e<=15){x(),o.last=np,r.left=_({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=w(()=>T(()=>j()));w(()=>C(`]`)),o.last=rp,r.left=_({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&fe(v(1))){x();let e=x().text;r.left=_({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=ip.get(n.text);if(!a||a.low<e)break;let s=r.previous;if(s){let e=!(s.low>a.high||s.high<a.low),t=s.text===n.text&&a.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw le(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw le(`Precedence conflict between ${n.text} and -`,v());o.last=o.preceding=a;let c=j(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[g(t).end];r.left=l.kind===e&&s?.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`&&s?.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=_(r.left,t),r.previous={...a,text:n.text}}return r.left},Ie=()=>{if(!S(`(`))return[];let e=We();return C(`)`),e},Le=()=>{let e=p(v()),t=j(),n=i[a.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},Re=e=>{let t=a.index;return _(Be(e),t)},ze=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Be=e=>{let t=v(),n=p(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...Le(),isLocal:e,isRecursive:f(t),location:n});if(t.kind===`Identifier`&&v(1).kind===`Operator`&&ip.has(v(1).text)&&v(2).kind===`Identifier`&&b(`==`,3)){let e=me(),t=x().text,n=me();return C(`==`),r(t,[ze(e),ze(n)])}let i=t.kind!==`String`&&sp.has(t.text),o=t.kind===`Identifier`&&ap.has(v(1).text)&&b(`==`,2);if(i||o){let e=i?t.text:v(1).text;i&&x();let n=me();return o&&x(),C(`==`),r(e,[ze(n)])}let s=pe();if(S(`[`)){let t=w(()=>Se());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:f(s),location:n}}let c=a.index,l=Ie();return C(`==`),b(`INSTANCE`)?{...Ve(s,l,e,n),definitionRange:g(c)}:r(s,l)},Ve=(e,t,n,r)=>{let i=a.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:S(`WITH`)?T(()=>{let e=a.index,t=ge(),n=g(e);return C(`<-`),{name:t,nameRange:n,expression:we()}}):[],isLocal:n,location:r,instanceRange:g(i)}},He=()=>{let e=a.index;return _(Ue(),e)},Ue=()=>{let e=p(v());if(b(`_`)&&v(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(v().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=pe();if(!S(`(`))return{name:t,arity:0,location:e};let n=T(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},We=()=>T(He),Ge=()=>{let e=We();return e.forEach(e=>s[s.length-1].add(e.name)),e},Ke=e=>{let t={value:0,offset:e};do{let e=v(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&xp.has(e.text)&&t.value++,e.kind===`Operator`&&Sp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},qe=()=>{let e=v(),t=v(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,Ke(1)):t.kind===`Operator`&&ap.has(t.text)?b(`==`,2):t.kind===`Operator`&&ip.has(t.text)?v(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&sp.has(e.text)&&t.kind===`Identifier`&&b(`==`,2)},Je=[],Ye=()=>Je[Je.length-1]??-1,Xe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),Ze=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)},Qe=e=>!e.text.endsWith(`.`)&&!_p.has(Ze(e)),$e=e=>{let t=Ze(e);if(_p.has(t))return;let n=Xe(e);if(n>=0)return`<${n}>${t}`;let r=Ye(),i=Je[Je.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},et=e=>{if(e.kind===`Keyword`)return mp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Je.length===0;if(e.text[1]===`+`||Je.length===0)return!0;let t=Ye();return t>=0&&Xe(e)>t},tt=e=>{let t=Xe(e),n=Je.length-1,r=Je[n-1]??-1,i=Je[n]<0;return i&&(Je[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Je[n]===t},nt=e=>!l.has(e)&&d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),rt=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Cp.has(e.name)&&!nt(e.name):!1,it=()=>{let e=v();return e.kind===`Step`?Qe(e):e.kind===`Keyword`?vp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!qe()},at=()=>{let e=a.index,t=v();return t.kind===`Operator`&&!cp.has(t.text)&&Tp(t.text)?(a.index++,_({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:p(t)},e)):S(`MODULE`)?_({kind:`ModuleFact`,name:pe(),location:p(t)},e):j()},M=e=>u[u.length-1]?.add(e),ot=e=>{u.push(/* @__PURE__ */ new Set);let t=e();return u.pop(),t},st=e=>u.some(t=>t.has(e))||d.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ct=()=>{let e=a.index,t=v(),n=T(()=>{let e=v();if((e.kind!==`Identifier`||oe(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${y(e)}`,e);return a.index++,e.text},`!`),r=p(t);return _(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},lt=()=>{if(r)return T(ct);let e=T(at),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&st(e.name)):void 0;if(t)throw le(`DEF clause entry should describe a defined operator`,t.location);return e},ut=()=>({facts:it()?T(at):[],defs:S(`DEF`)||S(`DEFS`)?lt():[]}),dt=()=>{let t=a.index,r=x(),i=r.text===`USE`&&S(`ONLY`),o=g(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...ut(),keyword:o,location:p(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!rt(e)):[];if(c.length>0)throw e.F(c.map(n=>({location:e.R(n.location.range??g(t)),message:`The only expression allowed as a fact in a HIDE is
|
|
460
|
+
the name of a theorem, assumption, or step.`})));return _(s,t)},ft=()=>{let e=a.index,t=p(v()),n=S(`NEW`),r=v().kind===`Keyword`?yp.get(v().text):void 0;if(!n&&r===void 0)throw de(`Expected a declaration but found ${y(v())}`);if(r!==void 0&&x(),r===`Variable`){let n=me();return M(n.name),_({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=He();M(i.name);let o=(r??`Constant`)===`Constant`&&b(`\\in`);if(o&&i.arity>0)throw le(`declared symbol with arguments before \\in`);return o&&x(),_({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:o?j():void 0,nameRange:i.location.range,location:t},e)},pt=()=>{let e=a.index,t=p(C(`ASSUME`)),n=T(()=>b(`ASSUME`)?ot(pt):v().kind===`Keyword`&&bp.has(v().text)?ft():j());return C(`PROVE`),_({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},mt=e=>{let t={value:0};for(;v(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return v(t.value).kind===`Identifier`&&b(e,t.value+1)},ht=(e,t)=>{e.forEach(M),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(M))},gt=()=>{let e=v();if(b(`USE`)||b(`HIDE`))return dt();if(b(`INSTANCE`)){let t=a.index;return _(Ve(void 0,[],!1,p(e)),t)}if(b(`DEFINE`)||qe()){let t=a.index;S(`DEFINE`);let n=[Re(!1)];for(;qe();)n.push(Re(!1));let r={kind:`Define`,definitions:n,location:p(e)};return _(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:j()};if(S(`TAKE`)){let e=ye(),t=he(e?[]:T(me)),n=e?Se():[];return ht(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:T(()=>j())};if(S(`PICK`)){let e=mt(`:`),t=he(e?T(me):[]),n=e?[]:Se();return ht(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return S(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?pt():j()}},_t=e=>{let t=v();if(t.kind!==`Step`)throw de(`Expected a step number but found ${y(t)}`,t);if(!tt(t))throw le(`${e?`QED step`:`step`}'s number has bad level`,t);if(Xe(t)<0&&$e(t)!==void 0)throw le(`<*> and <+> cannot be used for a named step`,t);return a.index++,{name:$e(t),token:t.text,location:p(t)}},vt=()=>{let e=a.index,t=_t(b(`QED`,1)),n=a.index,r=/* @__PURE__ */ new Set;u.push(r);let i=S(`QED`)?{kind:`Qed`}:gt(),o=g(e),s=g(n),c=et(v());if(c&&!hp.has(i.kind))throw le(`Proof of a step that does not take a proof`);let l=c?bt():void 0;return u.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(M),_({...t,body:i,head:o,statement:s,proof:l},e)},yt=()=>{let e=p(v());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=g(a.index-1);return{kind:`By`,isOnly:S(`ONLY`),...ut(),keyword:t,location:e}}let t=v(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=g(a.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[vt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(vt());return{kind:`Steps`,level:Ye(),steps:n,location:e}},bt=()=>{let e=a.index;Je.push(-1);let t=ot(yt);return Je.pop(),_(t,e)},xt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},St=e=>{let t=a.index,n=x(),r=v().kind===`Identifier`&&b(`==`,1)?pe():void 0;r!==void 0&&(l.add(r),x());let i=ot(()=>({statement:b(`ASSUME`)?pt():j(),proof:et(v())?bt():void 0})),o=i.statement,s=_({name:r,statement:o,proof:i.proof,location:p(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&o.kind!==`AssumeProve`&&xt(e,_({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:p(n)},t))},Ct=()=>{let e=a.index,t=x(),n=v().kind===`Identifier`&&b(`==`,1)?pe():void 0;return n!==void 0&&(l.add(n),x()),_({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:p(t)},e)},wt=()=>{let e=p(C(`----`));C(`MODULE`);let t=ve();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),s.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&T(()=>{let e=a.index;n.extends.push(ve()),n.extendsRanges.push(g(e))});;){let t=a.index;ie.index=t;let r=v();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),s.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=wt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=p(x()),r=We();n.constants.push(...r),e.range=g(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=p(x()),r=T(()=>{let e=a.index,t=p(v());return _({name:pe(),arity:0,location:t},e)});n.variables.push(...r),e.range=g(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Ct();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&xt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(b(`USE`)&&b(`ONLY`,1))throw de(`Expected a module unit but found ${y(r)}`);let e=dt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:Ge()});continue;case`INSTANCE`:Tt(n,_(Ve(void 0,[],!1,p(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Tt(n,_(Ve(void 0,[],!0,p(r)),t));continue}Tt(n,_(Be(!0),t));continue}r.kind===`Keyword`&&pp.has(r.text)?St(n):Tt(n,Re(!1))}}},Tt=(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}))},Et=wt(),Dt=_e.isUsed?tp(t):void 0;if(Dt!==void 0)throw new e.D(Dt);return Et},kp=e=>Op(e,`tlc`),Ap=e=>Op(e,`tlapm`),jp=e=>Op(e,`sany`),Mp=10454148508367108822n,Np=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Mp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Pp=Int32Array.from(Np,e=>Number(BigInt.asIntN(32,e>>32n))),Fp=Int32Array.from(Np,e=>Number(BigInt.asIntN(32,e))),Ip=Number(BigInt.asIntN(32,Mp>>32n)),Lp=Number(BigInt.asIntN(32,Mp));let Rp=Ip,zp=Lp;const Bp=e=>{let t=(e^zp)&255;zp=(zp>>>8|Rp<<24)^Fp[t],Rp=Rp>>>8^Pp[t]},Vp=e=>{for(let t=0;t<32;t+=8)Bp(e>>>t)},Hp=e=>{if(typeof e==`boolean`)Bp(0),Bp(e?116:102);else if(typeof e==`number`)Bp(1),Vp(e);else if(typeof e==`string`){Bp(3),Vp(e.length);for(let t=0;t<e.length;t++)Bp(e.charCodeAt(t))}else if(A(e))Bp(21),Vp($e(e.name)+1);else if(k(e)){let t=I(e);Bp(9),Vp(t.domain.length);for(let e=0;e<t.domain.length;e++)Hp(t.domain[e]),Hp(t.range[e])}else{let t=P(e).elements;Bp(5),Vp(t.length);for(let e of t)Hp(e)}},Up=e=>{let t={high:Rp,low:zp};Rp=Ip,zp=Lp;for(let t of e)Hp(t);let n=BigInt(Rp>>>0)<<32n|BigInt(zp>>>0);return Rp=t.high,zp=t.low,n},Wp=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||A(e))return 5;if(typeof e==`string`)return 5+e.length;if(k(e)){let t=I(e);return t.domain.reduce((e,n,r)=>e+Wp(n)+Wp(t.range[r]),5)}return P(e).elements.reduce((e,t)=>e+Wp(t),5)},Gp=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){Rp=n<32?0:1<<n-32,zp=n<32?1<<n:0;for(let t=0;t<e;t++)Bp(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^Rp,t[n+1]=t[a+1]^zp}}return t},Kp=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=n.get(e);if(t)return t;let r=Gp(e);return n.set(e,r),r},o=e=>{if(typeof e!=`object`||A(e))return Hp(e),Wp(e);let t=s(e),n={high:Rp,low:zp},r=a(i[t]);Rp=i[t+1],zp=i[t+2];for(let e=0;e<8;e++){let t=e<4?n.low:n.high,i=(e*256+(t>>>(e&3)*8&255))*2;Rp^=r[i],zp^=r[i+1]}return i[t]},s=e=>{let t=r.get(e);if(t!==void 0)return t;let n={high:Rp,low:zp};Rp=0,zp=0;let a={value:5};if(k(e)){let t=I(e);Bp(9),Vp(t.domain.length);for(let e=0;e<t.domain.length;e++)a.value+=o(t.domain[e]),a.value+=o(t.range[e])}else{let t=P(e).elements;Bp(5),Vp(t.length);for(let e of t)a.value+=o(e)}let s=i.length;return r.set(e,s),i.push(a.value,Rp,zp),Rp=n.high,zp=n.low,s};return(n,r)=>{let i={high:Rp,low:zp};Rp=Ip,zp=Lp;for(let t of e)o(n[t]);t[2*r]=zp,t[2*r+1]=Rp,Rp=i.high,zp=i.low}},qp=25214903917n,Jp=(1n<<48n)-1n,Yp=2147483647,Xp=e=>{let t={value:(BigInt.asUintN(64,e)^qp)&Jp},n=e=>(t.value=t.value*qp+11n&Jp,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^qp)&Jp},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<=Yp)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Zp=[],Qp=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},$p=()=>{for(let e=1277011;Zp.length<1341;e++)Qp(e)&&Zp.push(e);return Zp},em=e=>{let t=$p(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},tm=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},nm=e=>{for(let t=Math.max(e,9);;t++){let e=tm(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)}}},rm=(e,t,n)=>{if(t<=0)return[];let r=nm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(em(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},im=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Yp),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},am=(1n<<63n)-1n-24n,om=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(am*BigInt(n)+i)%t;return r<0n?r+t:r})},sm=(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,cm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=_n(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>lt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>bn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:yn}}},lm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,um=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?im:rm;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=lm(t,r)?void 0:cm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Yp)?om(e,t,n):i(e,Number(t),n)).map(e=>a.create(sm(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},dm=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e.g(`RandomElement of the empty set`);return r},fm=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[..._n(t.domain)];return lt(e,e.map(()=>fm(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return bn(t.names.map((e,r)=>[e,fm(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return yn(t.factors.map(e=>fm(e,n)));if(typeof t==`object`&&t.kind===`Interval`){let r=Math.max(0,t.high-t.low+1),i=Math.floor(n.nextDouble()*r);if(i>=r)throw new e.g(`RandomElement of the empty set`);return t.low+i}return dm(P(t).elements,n)},pm=(e,t=0n)=>{let n=Xp(t),r={random:Xp(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>bn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Up,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},mm=e=>ln([...e.possibleCounts].map(([e,t])=>[e,t])),hm=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,mm(e)]]),gm=`----------------------------- MODULE Bags --------------------------------
|
|
468
461
|
(**************************************************************************)
|
|
469
462
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
470
463
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -617,7 +610,7 @@ CopiesIn(e, B) ==
|
|
|
617
610
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
618
611
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
619
612
|
5 Dec 98 : Initial version.
|
|
620
|
-
`,
|
|
613
|
+
`,_m=/* @__PURE__ */ new Map([[`Bags`,gm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
621
614
|
(***************************************************************************)
|
|
622
615
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
623
616
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -873,7 +866,7 @@ TestRandomSetOfSubsets(k, n, S) ==
|
|
|
873
866
|
[i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
|
|
874
867
|
|
|
875
868
|
=============================================================================
|
|
876
|
-
`],[`RealTime`,`${
|
|
869
|
+
`],[`RealTime`,`${we}\n`],[`Reals`,`${Ce}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
|
|
877
870
|
(***************************************************************************)
|
|
878
871
|
(* Defines operators on finite sequences, where a sequence of length n is *)
|
|
879
872
|
(* represented as a function whose domain is the set 1..n (the set *)
|
|
@@ -1277,7 +1270,7 @@ TLCEvalDefinition(definitionName) ==
|
|
|
1277
1270
|
TRUE \\* TODO
|
|
1278
1271
|
|
|
1279
1272
|
============================================================================
|
|
1280
|
-
`],[`Toolbox`,`${
|
|
1273
|
+
`],[`Toolbox`,`${Te}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
|
|
1281
1274
|
LOCAL INSTANCE TLC
|
|
1282
1275
|
LOCAL INSTANCE TLCExt
|
|
1283
1276
|
LOCAL INSTANCE GraphViz
|
|
@@ -1677,7 +1670,7 @@ _TLCTrace ==
|
|
|
1677
1670
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1678
1671
|
|
|
1679
1672
|
=============================================================================
|
|
1680
|
-
`]]),
|
|
1673
|
+
`]]),vm=new Map([...[..._m].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,gm.replace(`
|
|
1681
1674
|
LOCAL INSTANCE Naturals
|
|
1682
1675
|
`,`
|
|
1683
1676
|
EXTENDS TLC
|
|
@@ -1769,16 +1762,7 @@ _TEPosition ==
|
|
|
1769
1762
|
ELSE TLCGet("level") + 1
|
|
1770
1763
|
|
|
1771
1764
|
=============================================================================
|
|
1772
|
-
`]]),Um=(e=`master`)=>e===`1.7.4`?Hm:Vm,Wm=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),Gm=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),Km=e=>P(e)?Ar(e):void 0,qm=(e,t,n)=>{let r=V(e,t,n),i=Km(r);if(!i)throw Wm(n,`a function with a finite domain`,r);return i},Jm=(e,t,n)=>{let r=V(e,t,n),i=Km(r);if(!i)throw Gm(t===0?`first`:`second`,n,`bag`,r);return i},Ym=(e,t)=>{if(!N(e)||!I(e))throw t();return L(e).elements},Xm=e=>e.range.every(e=>typeof e==`number`&&e>0),Zm=(e,t)=>{let n=e.domain.findIndex(e=>nn(e,t));return n===-1?void 0:e.range[n]},Qm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,$m=Qm(`BagDiff`,`tlc2.value.impl.Value`,2),eh=Qm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),th=Qm(`BagUnion`,`tlc2.value.impl.Value`,1),nh=Qm(`BagOfAll`,`tlc2.value.impl.Value`,2),rh=Qm(`BagCup`,`tlc2.value.impl.Value`,2),ih=Qm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),ah=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Vi(e)}`;throw Ui(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')`)},oh=(e,t,n)=>{let r=ah(e,n)+ah(t,n);if(Fi(r))throw Ii(`${e}+${t}`);return r},sh=(e,t,n,r)=>{let i=Zm(n,e.domain[t]),a=ah(e.range[t],r);return i===void 0?a:a-ah(i,r)|0},ch=(e,t)=>Un(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>nn(e[0],r));a?a[1]=oh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),lh=Ut([],[]),uh=e=>[ji(`EmptyBag`,lh),H(`IsABag`,1,e=>{let t=Km(V(e,0,`IsABag`));return t!==void 0&&Xm(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return qm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Wm(`BagCardinality`,`a bag`,t);return oh(e,n,ih)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=Zm(qm(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Gm(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=Zm(qm(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Gm(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Jm(e,t,`(+)`);if(!Xm(n))throw Gm(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return ch(t,rh)}),H(`\\ominus`,2,e=>{let t=Jm(e,0,`(-)`),n=Jm(e,1,`(-)`);return Un(t.domain.flatMap((e,r)=>{let i=sh(t,r,n,$m);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=Ym(t,()=>Wm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??lh;let r=n.map(e=>{let n=Km(e);if(!n)throw new S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return ch(r,th)}),H(`\\sqsubseteq`,2,e=>{let t=qm(e,0,`\\sqsubseteq`),n=qm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>sh(t,r,n,eh)<=0)}),Mi(`BagOfAll`,2,e=>{let t=Ai(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=Km(n);if(!r)throw Gm(`second`,`BagOfAll`,`function with a finite domain`,n);return ch(r.domain.map((e,n)=>Ut([t.call([e])],[r.range[n]])),nh)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!P(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Ar(n),i=Ln(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 ${z(r)}, which is not in its domain`);return Ln(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Ut(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Rr(qm(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=Ym(t,()=>Wm(`BagToSet`,`a function with a finite domain`,t));return Ut([...n],n.map(()=>1))})],dh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,fh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,ph=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,mh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,hh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,gh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,_h=e=>{if(!P(e))return!1;let t=Ar(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},vh=(e,t)=>Ui(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Vi(t)}`),yh=(e,t)=>Ui(e,`Cannot cast tlc2.value.impl.${Vi(t)} to tlc2.value.impl.StringValue`),bh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),xh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw vh(t,e);return`[${L(e).elements.map(e=>Ch(e,t)).join(`,`)}]`},Sh=(e,t)=>{let n=Ar(e),r=Cr(n);return r?`[${r.map(e=>Ch(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${bh(typeof e==`string`?e:z(e))}:${Ch(n.range[r],t)}`).join(`,`)}}`},Ch=(e,t)=>typeof e==`string`?bh(e):typeof e==`object`?e.kind===`ModelValue`?bh(e.name):N(e)?xh(e,t):Sh(e,t):String(e),wh=e=>{if(N(e))return xh(e,dh);if(!P(e)||_h(e))throw vh(dh,e);return Sh(e,dh)},Th=e=>{if(!P(e))throw vh(fh,e);return Sh(e,fh)},Eh=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))},Dh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return At(e);if(Array.isArray(e))return $n(e.map(e=>Dh(e,t)));if(typeof e==`object`&&e)return er(Object.entries(e).map(([e,n])=>[At(e),Dh(n,t)]));throw Ui(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Oh=(e,t)=>{if(e.trim()===``)return Dh(null,t);try{return Dh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Eh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ui(t,e.message):e}},kh=(e,t)=>{if(typeof e!=`string`)throw yh(t,e);return e},Ah=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ui(n,`${t} (No such file or directory)`);return r},jh=e=>[Ni(`ToJson`,1,e=>At(Ch(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Ni(`ToJsonArray`,1,e=>At(wh(V(e,0,`ToJsonArray`)))),Ni(`ToJsonObject`,1,e=>At(Th(V(e,0,`ToJsonObject`)))),Ni(`JsonSerialize`,2,t=>{let n=kh(V(t,0,`JsonSerialize`),ph),r=V(t,1,`JsonSerialize`);if(!Cr(r)&&!_h(r))throw new S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,Ch(r,ph)),!0}),Ni(`ndJsonSerialize`,2,t=>{let n=kh(V(t,0,`ndJsonSerialize`),mh),r=V(t,1,`ndJsonSerialize`),i=Cr(r);if(!i)throw new S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${Ch(e,mh)}\n`).join(``)),!0}),Ni(`JsonDeserialize`,1,t=>{let n=kh(V(t,0,`JsonDeserialize`),hh);return Oh(Ah(e,n,hh),hh)}),Ni(`ndJsonDeserialize`,1,t=>{let n=kh(V(t,0,`ndJsonDeserialize`),gh);return $n(Ah(e,n,gh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Oh(e,gh)))})],Mh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Nh=1e6,Ph=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Fh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Ph(t,n,`nonnegative integer`,z(e));return e},Ih=(e,t,n,r)=>{if(!N(e)||!I(e))throw Ph(t,n,r,z(e));return L(e).elements},Lh=(e,t,n,r)=>Ln(Array.from({length:t},()=>Ln(e.filter(()=>r.nextDouble()<n)))),Rh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Fh(V(e,0,n),`first`,n),i=Fh(V(e,1,n),`second`,n),a=Ih(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Ph(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Ph(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Lh(a,r,a.length===0?0:i/a.length,t.getRandom())},zh=e=>[Ni(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw Ph(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw Ui(Mh,String(n));let r=V(t,1,`RandomSubset`);if(!N(r)||!R(r)&&!I(r))throw Ph(`second`,`RandomSubset`,`a finite set`,z(r));let i=Nm(r,e.version);if(i&&i.reduce((e,t)=>e*L(t).elements.length,1)>Nh)throw Ui(Mh,`Attempted to construct a set with too many elements (>${Nh}).`);return Ln(Pm(n,r,e.getRandom(),e.version))}),Ni(`RandomSetOfSubsets`,3,t=>Rh(t,e)),Ni(`TestRandomSetOfSubsets`,3,t=>$n(Array.from({length:5},()=>L(Rh(t,e)).elements.length)))],Bh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Vh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Bh})`,Hh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Bh}) throws java.io.IOException`,Uh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Bh})`,Wh=()=>er([[`action`,Ln([])],[`state`,Ln([])]]),Gh=()=>er([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Kh=e=>er([[`name`,e??`UnnamedAction`],[`location`,Gh()]]),qh=(e,t,n)=>{let r=e.map((e,t)=>$n([t+1,er(Object.entries(e))])),i=r.slice(1).map((e,n)=>$n([r[n],t[n],e])),a=n?[$n([r[r.length-1],n.action,r[n.start]])]:[];return er([[`action`,Ln([...i,...a])],[`state`,Ln(r)]])},Jh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return zm(e).get(t)},Yh=(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)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),z(r));else throw new S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},Xh=e=>e.every(e=>e!==void 0),Zh=(e,t)=>er(t.variables.map((t,n)=>[t,e[n]])),Qh=(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&&!B(e)){if(t.variableIndex.has(r))return!0;let e=_l(r,t);if(e&&!n.has(e)&&(n.add(e),Qh(e.body,t,n)))return!0}return vi(e).some(e=>Qh(e,t,n))},$h=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=nn(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),Xi(`AssertError`,2,e=>{let n=Ai(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ui(Vh,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Zi(e,0,`AssertError`)();try{Zi(e,1,`AssertError`)()}catch(e){if(e instanceof y)return Ca(e.message,t.isTool)===r;throw e}return!1}),Ni(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return Jh(t,n)??V(e,1,`TLCGetOrDefault`)}),{...Mi(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=Jh(t,r)??V(n,3,`TLCGetAndSet`),a=Ai(n,1,`TLCGetAndSet`);return Yh(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Ni(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!Xh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ui(Hh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return $n(t.getBehavior(r).map(e=>Zh(e,n.environment)))}),Ni(`CounterExample`,0,()=>t.counterExample??Wh()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!P(t)||!nn(Rr(t),Ln([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=L(Ir(t,`state`)).elements.map(e=>Cr(e)??[]);return $n(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new S(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Vt(t)}),Xi(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),Xi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!Xh(r))throw Ui(Uh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||gl(Zi(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Xi(`TLCCache`,2,(e,t)=>{let r=Ai(e,0,`TLCCache`),a=oi(Zi(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Qh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,_m([V(e,0,`TLCFP`)])))),Ni(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?_l(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},eg=(e,t)=>[Ni(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Ni(`_Counts`,0,()=>Rm(t)),Ni(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(Rm(t),!0)),!1)}),Ni(`_PrintCounts`,0,()=>(e(z(Rm(t),!0)),!0))],tg=e=>String(e).padStart(2,`0`),ng=e=>`${e.getUTCFullYear()}.${tg(e.getUTCMonth()+1)}.${tg(e.getUTCDate())}.${tg(e.getUTCHours())}${tg(e.getUTCMinutes())}${tg(e.getUTCSeconds())}`,rg=e=>Un([...e].map(([e,t])=>[e,$n([t])])),ig=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),ag=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),og=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),sg=(e,t,n)=>{if(e.version===`1.7.4`?!ag.has(t)||!e.isStarted&&og.has(t):!e.isStarted&&ig.has(t))throw new S(`TLCGet(${t}) was undefined.`);let r=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 r;case`stats`:return er([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return er([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return er([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,At(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,At(ng(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Kh(void 0);case`all`:return rg(e.registers);case`all:named`:return rg(zm(e))}if(t.startsWith(`s:`)){let n=zm(e).get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return At(e.properties.get(t.slice(2))??t);throw new S(`TLCGet(${t}) was undefined.`)},cg=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return sg(e,t,n?.state)},lg=e=>e.length===0?[[]]:e.flatMap((t,n)=>lg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),ug=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&L(e).elements.forEach(ug),e.kind===`Function`&&e.range.forEach(ug))},dg=(t,n)=>[H(`Print`,2,e=>(t(`${dt(z(V(e,0,`Print`),!0,!0))} ${dt(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(dt(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${dt(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>Un([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=ki(e,0,`@@`),n=ki(e,1,`@@`);return Wn([..._t(t),..._t(n)])}),H(`ToString`,1,e=>At(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return ug(t),t}),H(`Permutations`,1,e=>{let t=Di(e,0,`Permutations`);return Ln(lg(t).map(e=>Un(t.map((t,n)=>[t,e[n]]))))}),Mi(`SortSeq`,2,e=>{let t=Ai(e,1,`SortSeq`);return $n(Oi(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)]},[]))}),n.version===`1.7.4`?Wi({...Ni(`TLCGet`,1,(e,t)=>cg(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Wi(Xi(`TLCGet`,1,(e,t)=>cg(n,Zi(e,0,`TLCGet`)(),t)),`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)`),Ni(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return Yh(n,t,r,V(e,1,`TLCSet`)),!0}),ji(`Any`,Lt),H(`RandomElement`,1,e=>Im(Ti(e,0,`RandomElement`),n.getRandom()))],fg=(e,t)=>e.every(e=>Dr(e,t)),pg=Ln([!1,!0]),mg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Hn(mg(e,t,r),mg(e,r,n))},hg=[`\\cup`,`\\cap`,`\\`],gg=e=>typeof e==`object`&&e.kind===`MixedSet`,_g=e=>e.kind===`Interval`?L(e).elements:e.elements,vg=(e,t,n)=>{let r=_g(t);if(e!==`\\cup`){let t=e===`\\cap`;return Rn(r.filter(e=>Dr(e,n)===t))}if(r.length===0)return n;if(!ft(n))return Zt({kind:`SetOperation`,operator:e,left:t,right:n});let i=L(n).elements.filter(e=>!Dr(e,t));return Rn([...r,...i])},yg=[ji(`TRUE`,!0),ji(`FALSE`,!1),ji(`BOOLEAN`,pg),ji(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Pi(`=`,Fn),Pi(`#`,(e,t)=>!Fn(e,t)),H(`~`,1,e=>!Ci(e,0,`~`)),H(`<=>`,2,e=>Ci(e,0,`<=>`)===Ci(e,1,`<=>`)),H(`/\\`,2,e=>Ci(e,0,`/\\`)&&Ci(e,1,`/\\`)),H(`\\/`,2,e=>Ci(e,0,`\\/`)||Ci(e,1,`\\/`)),H(`=>`,2,e=>!Ci(e,0,`=>`)||Ci(e,1,`=>`)),H(`\\in`,2,e=>Dr(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!Dr(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=wi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&I(t.base)?fg(L(t.base).elements,n.base):fg(L(t).elements,n)}),...hg.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(ft(n)&&ft(r)&&!gg(n)&&!gg(r)){if(e===`\\cup`&&R(n))return r;let t=e===`\\cup`?Hn:e===`\\cap`?Vn:Bn;return Er(()=>t(L(n),L(r)),()=>vg(e,n,r))}return ft(n)?vg(e,n,r):e!==`\\`&&ft(r)?vg(e,r,n):Zt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=wi(e,0,`UNION`),n=yn(t)?t.elements.filter(yn):[];if(!yn(t)||n.length!==t.elements.length)return Zt({kind:`Union`,base:t});if(gg(t)||n.some(gg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Dr(t,e)||e.elements.push(t)})),Rn(e.elements)}return n.length===0?zn:mg(n.map(L),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!P(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Rr(t)})],bg=Ki(`Integers`,`Neg`,`IntValue`,1),xg=e=>{let t=Ki(e,`DotDot`,`IntervalValue`,2);return[qi(e,`+`,`Plus`,(e,t)=>e+t),qi(e,`-`,`Minus`,(e,t)=>e-t),qi(e,`*`,`Times`,(e,t)=>e*t),qi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new S(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new S(`0^0 is undefined.`);return e**t}),qi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new S(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Fi(r))throw Ii(`${t} \\div ${n}`);return r}),qi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new S(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Gi(V(e,0,`..`),t),high:Gi(V(e,1,`..`),t)}))]},Sg=xg(`Naturals`),Cg=xg(`Integers`),wg=e=>{let t=Sg.indexOf(e);return t===-1?void 0:Cg[t]},Tg=[ji(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Sg,Yi(`<`,(e,t)=>e<t),Yi(`>`,(e,t)=>e>t),Yi(`<=`,(e,t)=>e<=t),Yi(`>=`,(e,t)=>e>=t,`>`)],Eg=[ji(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Cg,Yi(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Gi(V(e,0,`-`),bg);if(Fi(-t))throw Ii(`-${t}`);return-t})],Dg=(e,t,n)=>{let r=V(e,t,n),i=Cr(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},Og=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:Dg(e,t,n)},kg=(e,t,n)=>typeof e==`string`?At(e.slice(t,n)):$n(e.slice(t,n)),Ag=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,jg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Mg=(e,t)=>{let n=rf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Wi(e,t):e}):t},Ng=e=>Mg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>Og(e,0,Ag(``,`Len`)).length),H(`\\o`,2,e=>{let t=Og(e,0,jg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Dg(e,1,jg(`t \\o s`,`sequence`));return $n([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${jg(`t \\o s`,`string`)}\n${z(n)}`);return At(t+n)}),H(`Append`,2,t=>$n([...Dg(t,0,jg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=Dg(e,0,Ag(``,`Head`));if(t.length===0)throw new S(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=Og(e,0,Ag(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return kg(t,1)}),H(`SubSeq`,3,e=>{let t=Og(e,0,Ag(`first `,`SubSeq`)),n=Si(e,1,`SubSeq`),r=Si(e,2,`SubSeq`);if(n>r)return kg(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 S(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return kg(t,n-1,r)}),Mi(`SelectSeq`,2,e=>{let t=Ai(e,1,`SelectSeq`);return $n(Dg(e,0,Ag(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),Pg=e=>Mg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(N(t))return xr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${pt(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!N(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new S(`Attempted to compute cardinality of the value\n${z(n)}`);return yr(n,e)})]),Fg=/* @__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`]]]),Ig=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Tg};case`Integers`:return{extends:[`Naturals`],operators:Eg};case`Sequences`:return{extends:[],operators:Ng(n.version)};case`FiniteSets`:return{extends:[],operators:Pg(n.version)};case`TLC`:return{extends:[],operators:Mg(`TLC`,dg(t,n))};case`Randomization`:return{extends:[],operators:zh(n)};case`_Possible`:return{extends:[],operators:eg(t,n)};case`Json`:return{extends:[],operators:jh(r)};case`Bags`:return{extends:[],operators:uh(i)};case`TLCExt`:return{extends:[],operators:$h(t,n)};default:return}},Lg=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}])),Rg={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]}},zg=(e,t)=>{let n=Rg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Bg=`$subexpression`,Vg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Hg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Hg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of vi(e)){let e=Hg(r,t,n);if(e)return e}},Ug=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Wg=(e,t)=>{let n=e.location,r=Ug(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 Vg(`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 Vg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Bg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Bg,args:e.args,location:n,resolution:Da},location:n}},Gg=(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:Da})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Da}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Da};return Wg({...t,params:[...t.params,...r]},a)},Kg=(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 Vg(r,i);ka.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(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 Vg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>Zo(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw Vg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=Pa(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 Vg(`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&&Hg(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 Vg(`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`||to(t.operand,1)!==0)throw Vg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=ao(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[to(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw Vg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=to(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw Vg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw Vg(`Unexpected subexpression selector`,i);let s=r?r.sets:oo(n),c=s?.[to(t.operand,s.length)];if(!c)throw Vg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return Gg(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 Vg(`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 Gg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw Vg(`Subexpression selection failed`,i);return Wg(a,o.current)},qg=(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 no(e,t,n)},Jg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||vi(e).some(Jg),Yg=(e,t,n,r=!1)=>{if(!Jg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=es(e,e=>Yg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Xg(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)=>Yg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:es(e,e=>Yg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?qg(a.name,[],void 0,t):a.kind===`Apply`?qg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Kg(o,t,a,r);return c!==a&&Oa.add(c),c},Xg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Yg(e.expression,t,n,!0)}))}),Zg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Qg=(e,t)=>Xg(e,Zg(t.definitions),()=>!1),$g=(e,t)=>{let n=Zg([...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=>Yg(e,n,i),o=e=>i(e)||!n(e),s=e=>Yg(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 Xg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Xg(e,n,o):$o(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=>Jg(e.body))||e.assumptions.some(e=>Jg(e.expression))?{...p,definitions:e.definitions.map(e=>$o(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},e_=(e,t)=>`${e}${t}`,t_=(e,t,n)=>`${e}${t}${n}`,n_=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},r_=(e,t,n)=>`${e},${t},${n}`,i_=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),a_=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),o_=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),s_=(e,t,n,r)=>({...i_(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),c_=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,l_=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,u_=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,{...s_(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),d_=s_(`$Set`,0,[2],[1]),f_=s_(`$Junction`,0,[3],[1]),p_=s_(`$Choose`,0,[2],[1]),m_=s_(`$Function`,0,[3],[1]),h_=s_(`$FcnApply`,0,[2,2],[1,1]),g_=s_(`$RcdSelect`,0,[2,0],[1,1]),__=s_(`'`,2,[1],[0]),v_=s_(`ENABLED`,1,[2],[0]),y_=s_(`[]`,3,[3],[0]),b_=s_(`$SquareAct`,2,[2,1],[0,0]),x_=s_(`$WF`,3,[1,2],[0,0]),S_=s_(`$TemporalExists`,3,[3],[0]),C_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),w_=e=>e.map(e=>({name:e,arity:0})),T_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),E_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),D_=e=>e.kind!==`Let`&&e.kind!==`Label`,O_=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=u_.get(t)??Lg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=i_(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(t_(e,n,t))}),t.data.constraints.forEach((e,t)=>a_(r.constraints,t,e)),o_(r.argConstraints,e_(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>o_(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>c_(e,n))throw new u(`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 u(`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(r_(t,n,r)),s=i_(Math.max(e.level,...t.filter((t,n)=>l_(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)=>{l_(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)=>a_(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||a_(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>a_(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||a_(s.constraints,t,c_(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=>a_(s.constraints,e,c_(r,a)))}))}),e.argParams.forEach(e=>{let t=n_(e),n=a(t.operator)?.operator;n&&a_(s.constraints,t.param,c_(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>o_(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>o_(s.argConstraints,e_(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&o_(s.argConstraints,e_(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=n_(e),n=a(t.operator);n&&o_(s.argConstraints,e_(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(n_(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=n_(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(t_(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(t_(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(t_(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,w_(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=i_();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=C_(n,w_(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),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw T_(`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 T_(`Action used where only temporal formula or state predicate allowed`,e);E_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&D_(n)&&n.kind!==r)throw T_(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=v(e,n);t.constraints.forEach((e,t)=>a_(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>o_(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 u)||t.sany?t:T_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return i_();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 l(n,e),i(f_,n)}case`Prime`:case`Unchanged`:return s(__,[e.expression],t);case`Enabled`:return s(v_,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(y_,[n])}case`If`:return s(f_,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(f_,[...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(f_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw T_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?S_:f_,[e.body],t,[],e.names);case`Choose`:return s(p_,[e.body],t,e.set?[e.set]:[],Ga(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(d_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(d_,[e.predicate],t,[e.bound.set],Ga(e.bound.pattern));case`SetMap`:return s(d_,[e.expression],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`FunctionConstruction`:return s(m_,[e.body],t,e.bounds.map(e=>e.set),Ka(e.bounds));case`Record`:return s(m_,e.fields.map(e=>e.value),t);case`RecordSet`:return s(d_,e.fields.map(e=>e.value),t);case`Except`:return s(d_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(h_,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(d_,e.args,t)}]);case`Bracket`:return i_();case`FieldAccess`:return i(g_,[a(e.record,t),{data:i_()}]);case`BoxAction`:case`AngleAction`:return s(b_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(x_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return i_()}},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 vi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,C_(t,w_(e.names))),i;default:return es(e,(e,n)=>(a(e,r,C_(t,w_(n))),e)),i}},_=(e,t,n,r)=>{let i=C_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...i_(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(e_(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(t_(e.name,n,t.name))).map(e=>r_(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(n_(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=n_(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,{...i_(),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:a}},k_=(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`?k_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=i_(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>a_(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>o_(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},A_=(e,t,n,r)=>{let i=O_(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`?k_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(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:g(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=Wo([...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`?k_(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 p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},j_=(e,t)=>e.maxLevels[t]??3,M_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=O_({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=>a_(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>a_(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>o_(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=n_(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)&&a_(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(k_(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=g(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);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.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;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(e_(e.name,i));a!==void 0&&j_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=n_(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=j_(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 p([...r.values()])}},N_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],P_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),F_=new Map(Zd.flatMap(e=>e.map(t=>[t,e[0]]))),I_=e=>F_.get(e)??e,L_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},R_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(L_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},z_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),B_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:I_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:I_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},V_=(e,t)=>{let n=[];for(let r=t;;){let t=B_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},H_=e=>({line:e.line,column:e.column}),U_=(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=V_(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},W_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,G_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},K_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&W_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&W_(e[n+1],e[n+2])?n+=W_(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=>G_[e])}"`:r.text)}return t},q_=e=>e[2]?.text,J_=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},Y_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Y_(e.modules,t)).find(Boolean),X_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(tf.has(i)?t?.(i):void 0)??nf.get(i)??t?.(i)??Zp(e,i),s=o===void 0?[]:Ce(o),c=J_(s),l=c.get(q_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=$p(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>Y_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},Z_=(e,t)=>{let n=X_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=V_(t,e+1);r.push({location:H_(t[e]),apply:e=>i.forEach(t=>e.put(z_(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,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:H_(u),apply:t=>t.put(z_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&V_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),P_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(H_(u)),r.push({location:H_(u),apply:e=>e.put(z_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(z_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=I_(e.name);r.push({location:e.location,apply:n=>n.put(z_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(z_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(z_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Na(e.location,t.location)?-1:+!!Na(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=R_();i.set(e??``,s),Xd.toReversed().forEach(e=>s.put(z_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},Q_=(e,t,n)=>Z_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),$_=(e,t)=>{let n=Z_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},ev=(e,t)=>Q_(e,t,`variable`),tv=(e,t,n)=>{let r=X_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Qd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=U_(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;K_(s(void 0)).forEach((e,t)=>{t===3&&ef.forEach(a),a(e)});let x=u(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??q_(r(void 0).tokens);throw m(n,e)}K_(s(n)).forEach(a)}}N_.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),$d.forEach(a),[...i]},nv=t=>{switch(t.kind){case`Number`:try{return mt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Vt(t.name);case`Set`:return Ln(t.elements.map(nv))}},rv=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],iv=(e,t)=>{try{return $p(e)}catch(n){if(!(n instanceof u))throw n;let r=Tp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},av=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),ov=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},sv=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,cv=e=>e===`Theorem`?`ThmOrAssumpDefNode`:sv(e),lv=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Da},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),uv=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(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`)&&nn(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:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},dv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||vi(e).some(e=>dv(e,t)),fv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ls(e),n.get(e)??n.size)),n},pv=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),mv=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw cl(e);if(e.kind===`Number`&&!_u(e.value))throw ll(e);mv(e.kind===`Let`?[...vi(e),...pv(e.instances??[])]:vi(e))}),hv=(e,t)=>{let n=$p(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(yg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Lm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,ee=[],te=[],S=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=M_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,w=/* @__PURE__ */ new Map,T=e=>{let n=c.get(e);if(n)return n;let r=Ig(e,t.print,l,t.files,s);if(!r)return;Fg.get(e)?.forEach(T);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>T(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Lg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:zg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{if(tf.has(e)&&t.loadModule?.(e)!==void 0)return;let n=T(e),r=Fg.get(e)??[];return n&&S(e,r),n&&r.includes(`Integers`)&&T(`Integers`),n},D=e=>(mv([...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]),...pv(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??Rd.get(e)??Zp(t.source,e);if(r===void 0)throw m(e,n);let i=iv(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return D(i)},le=e=>{let t=te.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...te.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];te.push(e.name),ee.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:C,levelChecks:a});if(ee.pop(),te.pop(),i.length>0)throw p(i,!1,void 0,C);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&ov(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw av(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,n)=>{let i=d.get(e);if(i)return S(e,x.get(e)??[]),i;let a=le(ce(e,n));return(Um(l.version).has(e)?Ig(e,t.print,l,t.files,s):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(s.set(t.key,e),r.delete(t.key))}),d.set(e,a.linked),x.set(e,a.closure),S(e,a.closure),a.linked},de=(e,t,n,s,c)=>{let l=c?void 0:E(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=rv(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Uo(Qg(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=xs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Jo(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=re(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:re});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&w.set(r,n),r})},fe=(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}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.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:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Da})),he=(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:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(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);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=rv(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ie.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>dv(f(e),p),h=d.map(t=>{let n=ge(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=xs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:Da}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Da}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.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}:lv(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=O(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=Yd(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...yg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Ro,errors:[],warnings:[]},p=[d],m=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||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);cv(n.kind)===cv(e.kind)?d.warnings.push({location:r,message:`Warning: the ${sv(n.kind)} of '${t}' conflicts with \nits ${sv(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${sv(e.kind)} of '${t}' conflicts with \nits ${sv(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,x=[],ee=[...s.constants],te=s.variables.map(e=>e.name),S=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){m(n);return}let r=t??ue(e,s.name);ee.push(...r.constants.filter(e=>ee.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),x.push(r)});let ne=new Map(l),re=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:D(e),arity:Pa(e),params:Fa(e),kind:zo(s,e)?`Theorem`:`Definition`,range:e.location.range}),T=ee.length===0&&te.length===0,D=e=>s===n?e.name:`${e.name}@${a.id}`,ce=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Na(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:E(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=rv(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:ce,facts:v,reports:p,warnings:a.warnings}),ge=e=>[...re.filter(t=>Na(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Na(t.location,e)).map(e=>[e.name,se(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),xe=e=>{let t=le(),n=t.get(e.name),r=n&&ov(e,n.module);if(n&&!r)throw av(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:ge(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,O(s),T,le().get(e.module));ce.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))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Na(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=$g(Ts(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Go(Se,O(Se))),Se.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!T);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Na(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:te,variableLocations:S,visible:l,exported:h,modules:y,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=ie.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>A_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(te),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>w.get(l.get(e)?.key??e)},we,C)),b.push(Ce),Ce},xe=le(n).linked;C.length>0&&!t.isSanyReported&&t.print(h(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=nv(e.value);Pn(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(nv),nv(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,uv(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${Q_(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=wg(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:fv(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=O_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>_l(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${ba(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let j=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Re=$_(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||rv(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},gv={kind:`Boolean`,value:!0},_v={kind:`Boolean`,value:!1},vv=e=>e?gv:_v,yv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,bv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,xv=(e,t)=>({kind:e,body:t}),Sv=(e,t,n)=>({kind:e,operands:[t,n]}),Cv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Cv(e,t.operands).operands:[t])}),wv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return wv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,wv(t)),0)}},Tv=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 Tv(e.body);case`And`:case`Or`:return e.operands.some(Tv)}},Ev=/* @__PURE__ */ new WeakMap,Dv={count:0},Ov=e=>{let t=Ev.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`#${Dv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Ov).join(`,`)})`;default:return`${e.kind}(${Ov(e.body)})`}})();return Ev.set(e,n),n},kv=(e,t)=>e===t||Ov(e)===Ov(t),Av=(e,t)=>{let n=Ov(t);return e.some(e=>e===t||Ov(e)===n)},jv=e=>e===`And`?`Or`:`And`,Mv=(e,t)=>{switch(e.kind){case`Boolean`:return t?vv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?xv(`Not`,e):e;case`Not`:return Mv(e.body,!t);case`And`:case`Or`:return Cv(t?jv(e.kind):e.kind,e.operands.map(e=>Mv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return xv(n,Mv(e.body,t))}}},Nv=e=>{switch(e.kind){case`Boolean`:return vv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Cv(jv(e.kind),e.operands.map(Nv));case`Always`:return xv(`Eventually`,Nv(e.body));case`Eventually`:return xv(`Always`,Nv(e.body));default:return xv(`Not`,e)}},Pv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Pv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return vv(t)}return n.length===0?vv(!t):n.length===1?n[0]:Cv(e.kind,n)}case`Not`:{let t=Pv(e.body);return t.kind===`Boolean`?vv(!t.value):xv(`Not`,t)}case`Always`:case`Eventually`:{let t=Pv(e.body);return xv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Fv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Iv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Iv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>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.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=>Cv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Iv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Fv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Cv(`Or`,t);n.push(xv(`Always`,xv(`Eventually`,e)))}return Cv(`Or`,n)}case`Not`:return yv(e.body)?e:Iv(Nv(e.body));default:return e}},Lv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Lv(e.operands[0]):Cv(e.kind,e.operands.map(Lv));case`Not`:return e.body.kind===`Not`?Lv(e.body.body):xv(`Not`,Lv(e.body));case`Always`:case`Eventually`:case`Next`:return xv(e.kind,Lv(e.body));default:return e}},Rv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Rv(e.operands[0]);let t=Math.floor(e.operands.length/2);return Sv(e.kind,Rv(Cv(e.kind,e.operands.slice(0,t))),Rv(Cv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return xv(e.kind,Rv(e.body));default:return e}},zv=(e,t)=>{e.kind===`Eventually`&&!Av(t,e)&&t.push(e),`body`in e&&zv(e.body,t),`operands`in e&&e.operands.forEach(e=>zv(e,t))},Bv=e=>{let t=e.filter(bv),n=e.flatMap(e=>e.kind===`Not`&&bv(e.body)?[e.body]:[]);return!t.some(e=>Av(n,e))},Vv=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,xv(`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},Hv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:xv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Uv=(e,t,n)=>e.flatMap(e=>{let r=Hv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Wv=e=>[...new Set(e.map(Ov))].sort().join(`|`),Gv=(e,t)=>{let n=new Set(t.map(Wv));return[...e.filter(e=>!n.has(Wv(e))),...t]},Kv=e=>{let t=Vv(e),n=Uv(t,`Always`,`And`),r=Uv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Hv(t,`Eventually`,`Or`);if(n&&!(Av(e,n.first)||Av(e,n.second)))return Gv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Av(e,t.first)||Av(e,t.second))&&!Av(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Bv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Hv(t[e],`Always`,`And`);n&&(Av(t,n.first)||t.push(n.first),Av(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Av(t,e.first)&&Av(t,e.second)&&!Av(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Bv(t)?[]:i(t)};return a(e)},qv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>wv(e)<=1)}),Jv=e=>{let t=Kv([e]).map(qv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Wv(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=Wv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(qv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Yv=(e,t)=>!Av(e,t)||Av(e,t.body),Xv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&wv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Fv(e);if(n){let e=wv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Tv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Zv=(e,t)=>{let n=e.findIndex(e=>kv(e,t));return n===-1?(e.push(t),e.length-1):n},Qv=e=>{let t=Iv(Pv(Mv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Lv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Xv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Cv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:kv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Rv(e.formula),n=[];t&&zv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Zv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Zv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Zv(i,e))}));return{tableau:t&&Jv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},$v=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),ey=()=>n(new x,e.error),ty=/* @__PURE__ */ new Set([`~>`,`-+->`]),ny=/* @__PURE__ */ new WeakMap,ry=/* @__PURE__ */ new WeakSet,iy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),ay=(e,t)=>new y(`TLC cannot handle the temporal formula ${el(e)}${t===void 0?``:`:\n${t}`}`),oy=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ul(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return oy(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?oy(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=_l(e,n);if(t)return sy(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return es(e,(e,a)=>(i.value=Math.max(i.value,oy(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 ty.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},sy=(e,t)=>{let n=ny.get(e);if(n!==void 0)return n;ny.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(oy(e.body,void 0,t),...r.map(e=>oy(e.set,void 0,t)));return ny.set(e,i),i},cy=(t,r)=>{try{return Al(t,r)}catch(t){if(!(t instanceof y))throw t;if(!ba(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},ly=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>ly(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,el(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,uy(e,t,n));if(e.kind===`Identifier`){let r=B(e)?ul(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:_l(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&sy(a,n)>0){if(i.has(a))throw ey();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=iy(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||oy(e,t,n)===3)){let t=tu(e,c),r=B(e)?void 0:_l(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,pu(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>oy(e.set,t,n)===0),u=l?cy(e.bounds,c):void 0;if(l&&u){let n=[];if(jl(e.bounds,u,t,t=>(n.push(...s(e.body,t,el(e.body))),!1)),n.length===0)throw $v();return n}return[{expression:e,scope:t,name:o}]},uy=(e,t,n)=>{let r=hu(e.definitions,iy(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&ry.add(e.binding);return r},dy=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),fy=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?oy(e,t,n):i;if(a===0){let r=W(e,iy(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${tl(e)}`);return vv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw ey();a.depth++;let o=f(e,t);a.depth--;let s=wv(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=iy(n,t),s=B(e)||_l(i,n)===void 0?ul(t,i):void 0;if(s?.kind===`Thunk`&&ry.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?nu(i,a):$l(i,n);if(l?.kind!==`Closure`)throw ay(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&_l(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,pu(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof x||n&&!r;throw!(t instanceof y)||i?t:ay(e)}},l=(e,t)=>{let r=oy(e,t,n);if(!e.bounds.every(e=>oy(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw ay(e)}let a=[],o=e.kind===`Forall`;try{Ml(e.bounds,iy(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof x)throw n;if(r<=2)return i(e,t,r);throw ay(e,o&&!ba(n)?n.message:void 0)}return a.length===0?vv(o):u(e,t,Cv(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=wv(n);return r>2?n:i(e,t,r)},d=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===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=oy(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,uy(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?xv(`Always`,Sv(`Or`,xv(`Not`,f(n[0],t)),xv(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,xv(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,Sv(`Or`,xv(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,Cv(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&oy(e.condition,t,n)===0){let r=W(e.condition,iy(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,Sv(`Or`,Sv(`And`,i,f(e.consequent,t)),Sv(`And`,xv(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return xv(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=dy(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=xv(`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`?xv(`Always`,xv(`Eventually`,Sv(`Or`,i,a))):Sv(`Or`,xv(`Eventually`,xv(`Always`,i)),xv(`Always`,xv(`Eventually`,a)))}default:throw ay(e)}};return f(e,t)},py=(e,t,n,r,i)=>{let a=e=>py(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`?gl(W(e.expression,a),`a temporal property predicate`):Uc(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&&gl(W(e.unchanged,a),`a subscript`)?!1:gl(W(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 py(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`)}},my=(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)=>my(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 py(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},hy=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return hy(e.body);case`And`:case`Or`:return e.operands.some(hy);default:return!1}},gy=e=>e.promises.some(e=>hy(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),_y=(e,t)=>e.every((e,n)=>an(e,t[n])),vy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),yy=e=>({data:e(1024),length:0,create:e}),by=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},xy=(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}},Sy=e=>new Int32Array(e).fill(-1),Cy=(e,t)=>(e.edgeStarts[t]??-1)!==-1,wy=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Ty=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Ey=(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),Dy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Oy=2**53-1,ky=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>fy(e.expression,e.scope,n)),a=e.map(e=>xv(`Not`,fy(e.expression,e.scope,n))),o=a.length===1?a[0]:Cv(`Or`,a),s=i.length===0?o:Cv(`And`,[...i,o]),c=Qv(s);if(c.length===0)throw $v();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Ov(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:yy(e=>new Int32Array(e)),edgeActions:yy(e=>new Uint8Array(e)),stateResults:yy(e=>new Uint8Array(e)),initial:[],firstNodes:yy(Sy),lastNodes:yy(Sy),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),d={multiplier:1},f=!Ou(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>py(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!py(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!py(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},te=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),S=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=xy(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n)=>{let r=Ey(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),xy(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],xy(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?by(e.firstNodes,t,[r]):e.nextSiblings[a]=r,by(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;by(e.edgeTargets,a,n),r.forEach((t,n)=>by(e.edgeActions,(a+n)*o,t)),by(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&_y(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&te(e)){e.errorNode=a;return}let o=S(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=S(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of Dy(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return vy(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Ey(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{Cy(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Cy(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 wy(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}Cy(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}`)},w=(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=>Cy(e,t)),c=[],l=t=>{let n=wy(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Yv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=Oy;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]=Oy,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>Ty(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>wy(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=vy(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&Ty(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(wy(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=wy(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:gy(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of wy(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),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={link: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.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};wy(e,l).forEach((t,r)=>{Cy(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(S(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=w(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!my(a[i].body,t,r,0,n)).map(e=>e.name))]}},Ay=`UnnamedAction`,jy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},My=e=>{let t=e.range??jy;return er([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Ny=e=>{let t=[[`name`,e.name],[`location`,My(e.location)]];return e.parameters.length===0?er(t):er([...t,[`context`,er(e.parameters)],[`parameters`,$n(e.parameters.map(e=>e[0]))]])},Py=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Fy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Iy=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Ly=e=>e.kind===`Apply`?e.args:[],Ry=(e,t,n)=>{let r=Iy(e);if(r===void 0)return;if(B(e)){let e=ul(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=$l(r,n);return i?.kind===`Closure`?i:void 0},zy=(e,t)=>{try{return W(e,Fy(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},By=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&xl(e,t)&&zy(e.body,t),Vy=(e,t)=>{let n=_l(e.name,t);return n?.body===e.body&&By(n,t)},Hy=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=ul(t,e.name);return n?.kind===`Thunk`?n:void 0},Uy=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ul(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Wy=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Gy=(e,t,n,r,i)=>{let a=Ly(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>oy(e,n,i)!==0)?o():Wy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,Fy(i,n))]),expression:t,scope:n}],o)},Ky=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Ay,location:e.location,parameters:Uy(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Ky(e.body,hu(e.definitions,Fy(r,t)),n,r,i);case`Label`:return Ky(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Ky(e,t,n,r,i));case`Exists`:return Wy(()=>{let o=[];return Ml(e.bounds,Fy(r,t),t=>(o.push(...Ky(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(Iy(e)??``),s=Ry(e,t,r);if(o)return Gy(o,e,t,s,r);if(!s)return[a()];let c=Ly(e),l=B(e)?s.name:r.instanceNames.get(Iy(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return Vy(s,r)||c.some(e=>oy(e,t,r)!==0)?u():Wy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,Fy(r,t))},parent:e}),s.scope);return Ky(s.body,e,{...s,name:l},r,i)},u)},qy=(e,t,n,r,i)=>{let a=(e,t)=>qy(e,t,n,r,i);if(e.kind===`Let`){a(e.body,hu(e.definitions,Fy(n,t)));return}let o=Hy(e,t);if(o){a(o.expression,o.scope);return}let s=Ry(e,t,n);if(s&&Vy(s,n))return;if(s&&s.params.length===0){if(oy(s.body,s.scope,n)===1){r.inits.push(Py(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,pu(s,e.args,Fy(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(Py(Ay,e));return}let c=oy(e,t,n);c<=1?r.inits.push(Py(Ay,e)):c===3&&r.temporals.push(Py(Ay,e))},Jy=(e,t,n,r,i)=>{let a=(t,n)=>Jy(e,t,n,r,i);if(t.kind===`Let`){a(t.body,hu(t.definitions,Fy(r,n)));return}let o=Hy(t,n);if(o){a(o.expression,o.scope);return}let s=Ry(t,n,r);if(s&&Vy(s,r))return;if(s&&s.params.length===Ly(t).length){a(s.body,t.kind===`Apply`?pu(s,t.args,Fy(r,n)):s.scope);return}if(t.kind===`Forall`&&Wy(()=>(Ml(t.bounds,Fy(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(Py(e,a)):oy(a,n,r)<2?i.invariants.push(Py(e,a)):i.impliedTemporals.push(Py(e,t));return}let c=oy(t,n,r);c<=1?i.impliedInits.push(Py(e,t)):c===3&&i.impliedTemporals.push(Py(e,t))},Yy=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`&&!By(n,t)?n:void 0},Xy=e=>er([[`name`,e.name],[`location`,My(e.location)]]),Zy=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Yy(e.specification,t);a&&(qy(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Ky(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:$l(e.init,t);o?.kind===`Closure`&&r.inits.push(Py(e.init??``,o.body));let s=e.next===void 0?void 0:$l(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Ky(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Yy(e,t);n&&r.invariants.push(Py(e,n.body))}),e.properties.forEach(e=>{let n=Yy(e,t);n&&Jy(e,n.body,void 0,t,r)}),r},Qy=(e,t,n)=>Zy(e,t,n).inits,$y=(e,t,n)=>Zy(e,t,n).actions,eb=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,tb=(e,t)=>`${e.name===Ay?`Action`:e.name}${t===`1.7.4`?``:eb(e)} ${g(e.location.range??jy)}`,nb=e=>`${e.name}${eb(e)}`,rb=(e,t,n,r)=>{let i=Zy(e,t,r),a=e=>Ln(e.map(Ny)),o=e=>Ln(e.flatMap(e=>{let n=Yy(e,t);return n?[Xy(n)]:[]}));return er([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Ln(t.variables.map((e,t)=>er([[`name`,e],[`location`,My(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},ib=`paired12`,ab=(e,t=16)=>e<=t*.75?t:ab(e,t*2),ob=(e,t)=>{let n=ab(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},sb=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),cb=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),lb=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),ub=e=>lb(e).replaceAll(`
|
|
1773
|
-
`,`\\n`),db=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},fb=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
|
|
1774
|
-
`,r?``:`node [shape=box,style=rounded]
|
|
1775
|
-
`,e.colorize?`edge [colorscheme="${ib}"]\n`:``,`nodesep=0.35;
|
|
1776
|
-
`,`subgraph cluster_graph {
|
|
1777
|
-
`,`color="white";
|
|
1778
|
-
`],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=e=>{let t=a.get(e.level)??/* @__PURE__ */ new Set;a.set(e.level,t.add(e.fingerprint))},c=e=>{if(!e)return 1;let t=o.get(e.name)??o.size+2;return o.set(e.name,t),t},l=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
|
|
1779
|
-
`,`node [ labeljust="l",colorscheme="${ib}",style=filled,shape=record ]\n`,...ob([...o.keys()],cb).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...ob([...a],e=>e[0]).map(e=>`{rank = same; ${ob([...e[1]],sb).map(e=>`${e};`).join(``)}}\n`),`}
|
|
1780
|
-
`,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${ub(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?lb(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${ub(n.getText())}"`;i.push(`${n.fingerprint} [label="${ub(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},pb=(e,t,n)=>e.dot?fb(e,t,n):db(e,t),mb=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),hb=(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},gb=t=>n(new y(`${s}${t}`),e.error),_b=e=>{let t=Ar(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!F(e)||!F(i))throw gb(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},vb=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(vb);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},yb=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,bb=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw gb(`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(!N(a)||!I(a))throw gb(`The symmetry operator must specify a set of functions.`);let o=L(a).elements;if(!o.every(P))throw gb(`The symmetry values must be function records.`);let s=o.map(_b),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=vb(yb(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ua.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(mb(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=hb(n,e),r=mb(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(!yb(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=>F(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},xb=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=wb(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(wb(e[r],t));return a}},Sb=(e,t)=>{let n=[],r=[];for(let i of e){let e=wb(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(zt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(zt(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},Cb=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,wb=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Cb(e);if(n===0||n>64)return Tb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Tb(e,t),a=i!==e&&an(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},Tb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Sb(e.elements,t);return n?Ht(n):e}if(n===`Function`||n===`LazyFunction`&&I(e.domain)){let n=Ar(e),r=xb(n.domain,t),i=xb(n.range,t)??n.range;if(r){let e=Un(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ut(n.domain,e.range):e}return i===n.range?n:Ut(n.domain,i)}if(n===`Interval`||!N(e)||!I(e))return e;let r=L(e),i=xb(r.elements,t);return i?Ln(i):r},Eb=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},Db=(e,t,n)=>e.images[t]??=wb(e.images[0],n.permutations[t-1]),Ob=(e,t,n,r)=>{let i=Eb(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=zt(Db(i,t,r),Db(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},kb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?Ob(i,t,n,r):0;if(o!==0)return o<0}return!1},Ab=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>kb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?Db(Eb(e,t),r,t):e)},jb=(e,t)=>e*((t-e)/2**64),Mb=e=>e.includes(`.`)?e:`${e}.0`,Nb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Mb(String(e));let[n,r]=e.toExponential().split(`e`);return`${Mb(n)}E${r.replace(`+`,``)}`},Pb=e=>e!==void 0&&e>=`0`&&e<=`9`,Fb=e=>{if(e===0)return`0.0`;let t=Nb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Pb(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(;Pb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Pb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Pb(t[n.next])&&Number(t[n.next])>=5&&(n.result=Ib(n.result));Pb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Ib=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ib(r)}.`:n===`9`?`${Ib(r)}0`:`${r}${Number(n)+1}`},Lb=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}`)},Rb=(e,t,n)=>{if(jb(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},zb=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}).`},Bb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),Vb={line:0,column:0},Hb=`Failed to recover the initial state from its fingerprint.`,Ub=`Failed to recover the next state from its fingerprint.`,Wb=e=>({kind:`Identifier`,name:e,location:Vb}),Gb=/* @__PURE__ */ new Set([`name`,`property`]),Kb=(e,t,n)=>{let r=_l(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Gb.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},qb=(e,t,n)=>{if(xl(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Wb(e),gx(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},Jb=(e,t,n)=>{let r=Kb(e,t,n);if(qb(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},Yb=(e,t,n)=>{let r=n.constants.has(t)?void 0:Kb(e,t,n),i=r?qb(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},Xb=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Zb=(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})),Yl(e.startupDefinitions,r),t.invariants.forEach(e=>{Yb(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Qb=(t,r)=>{let i=O_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>_l(e,r)});return t.flatMap(t=>{let a=Yb(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
|
|
1765
|
+
`]]),ym=(e=`master`)=>e===`1.7.4`?vm:_m,bm=(t,n,r)=>new e.S(`Applying ${t} to the following value,\nwhich is not ${n}:\n${L(r)}`),xm=e=>k(e)?I(e):void 0,Sm=(e,t,n)=>{let r=R(e,t,n),i=xm(r);if(!i)throw bm(n,`a function with a finite domain`,r);return i},Cm=(e,t,n)=>{let r=R(e,t,n),i=xm(r);if(!i)throw Hr(t===0?`first`:`second`,n,`bag`,r);return i},wm=(e,t)=>{if(!O(e)||!N(e))throw t();return P(e).elements},Tm=e=>e.range.every(e=>typeof e==`number`&&e>0),Em=(e,t)=>{let n=e.domain.findIndex(e=>xt(e,t));return n===-1?void 0:e.range[n]},Dm=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Om=Dm(`BagDiff`,`tlc2.value.impl.Value`,2),km=Dm(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Am=Dm(`BagUnion`,`tlc2.value.impl.Value`,1),jm=Dm(`BagOfAll`,`tlc2.value.impl.Value`,2),Mm=Dm(`BagCup`,`tlc2.value.impl.Value`,2),Nm=Dm(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Pm=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${ci(e)}`;throw ui(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')`)},Fm=(e,t,n)=>{let r=Pm(e,n)+Pm(t,n);if(ni(r))throw ri(`${e}+${t}`);return r},Im=(e,t,n,r)=>{let i=Em(n,e.domain[t]),a=Pm(e.range[t],r);return i===void 0?a:a-Pm(i,r)|0},Lm=(e,t)=>ln(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>xt(e[0],r));a?a[1]=Fm(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Rm=lt([],[]),zm=t=>[Qr(`EmptyBag`,Rm),z(`IsABag`,1,e=>{let t=xm(R(e,0,`IsABag`));return t!==void 0&&Tm(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Sm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw bm(`BagCardinality`,`a bag`,t);return Fm(e,n,Nm)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=Em(Sm(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Hr(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=Em(Sm(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Hr(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Cm(e,t,`(+)`);if(!Tm(n))throw Hr(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return Lm(t,Mm)}),z(`\\ominus`,2,e=>{let t=Cm(e,0,`(-)`),n=Cm(e,1,`(-)`);return ln(t.domain.flatMap((e,r)=>{let i=Im(t,r,n,Om);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=wm(n,()=>bm(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Rm;let i=r.map(t=>{let r=xm(t);if(!r)throw new e.S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(n)}`);return r});return Lm(i,Am)}),z(`\\sqsubseteq`,2,e=>{let t=Sm(e,0,`\\sqsubseteq`),n=Sm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Im(t,r,n,km)<=0)}),$r(`BagOfAll`,2,t=>{let n=Zr(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.S(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(n.literalBody)}`);let r=R(t,1,`BagOfAll`),i=xm(r);if(!i)throw Hr(`second`,`BagOfAll`,`function with a finite domain`,r);return Lm(i.domain.map((e,t)=>lt([n.call([e])],[i.range[t]])),jm)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!k(r))throw new e.g(`DOMAIN expects a function but received ${L(r)}`);let i=I(r),a=nn(i.range).elements,o=a.find(e=>typeof e!=`number`);o!==void 0&&t.get(`>=`)?.evaluateBinary?.(a[0],o);let s=i.range.filter(e=>typeof e==`number`);if(s.some(e=>e<1))throw new e.g(`Attempted to apply a function to ${L(i)}, which is not in its domain`);return nn(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>lt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>cr(Sm(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=wm(t,()=>bm(`BagToSet`,`a function with a finite domain`,t));return lt([...n],n.map(()=>1))})],Bm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Vm=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Hm=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Um=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Wm=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Gm=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Km=e=>{if(!k(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},qm=(e,t)=>ui(e,`Cannot convert value: unsupported value type tlc2.value.impl.${ci(t)}`),Jm=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ym=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw qm(t,e);return`[${P(e).elements.map(e=>Zm(e,t)).join(`,`)}]`},Xm=(e,t)=>{let n=I(e),r=Gn(n);return r?`[${r.map(e=>Zm(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Jm(typeof e==`string`?e:L(e))}:${Zm(n.range[r],t)}`).join(`,`)}}`},Zm=(e,t)=>typeof e==`string`?Jm(e):typeof e==`object`?e.kind===`ModelValue`?Jm(e.name):O(e)?Ym(e,t):Xm(e,t):String(e),Qm=e=>{if(O(e))return Ym(e,Bm);if(!k(e)||Km(e))throw qm(Bm,e);return Xm(e,Bm)},$m=e=>{if(!k(e))throw qm(Vm,e);return Xm(e,Vm)},eh=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))},th=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Ze(e);if(Array.isArray(e))return yn(e.map(e=>th(e,t)));if(typeof e==`object`&&e)return bn(Object.entries(e).map(([e,n])=>[Ze(e),th(n,t)]));throw ui(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},nh=(e,t)=>{if(e.trim()===``)return th(null,t);try{return th(JSON.parse(e,(e,t,n)=>typeof t==`number`?eh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?ui(t,e.message):e}},rh=(e,t)=>{if(typeof e!=`string`)throw ui(t,`Cannot cast tlc2.value.impl.${ci(e)} to tlc2.value.impl.StringValue`);return e},ih=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw ui(n,`${t} (No such file or directory)`);return r},ah=e=>[ei(`ToJson`,1,e=>Ze(Zm(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),ei(`ToJsonArray`,1,e=>Ze(Qm(R(e,0,`ToJsonArray`)))),ei(`ToJsonObject`,1,e=>Ze($m(R(e,0,`ToJsonObject`)))),ei(`JsonSerialize`,2,t=>{let n=rh(R(t,0,`JsonSerialize`),Hm),r=R(t,1,`JsonSerialize`);if(!Gn(r)&&!Km(r))throw Hr(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,Zm(r,Hm)),!0}),ei(`ndJsonSerialize`,2,t=>{let n=rh(R(t,0,`ndJsonSerialize`),Um),r=R(t,1,`ndJsonSerialize`),i=Gn(r);if(!i)throw Hr(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${Zm(e,Um)}\n`).join(``)),!0}),ei(`JsonDeserialize`,1,t=>{let n=rh(R(t,0,`JsonDeserialize`),Wm);return nh(ih(e,n,Wm),Wm)}),ei(`ndJsonDeserialize`,1,t=>{let n=rh(R(t,0,`ndJsonDeserialize`),Gm);return yn(ih(e,n,Gm).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>nh(e,Gm)))})],oh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,sh=1e6,ch=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Hr(t,n,`nonnegative integer`,e);return e},lh=(e,t,n,r)=>nn(Array.from({length:t},()=>nn(e.filter(()=>r.nextDouble()<n)))),uh=(e,t)=>{let n=`RandomSetOfSubsets`,r=ch(R(e,0,n),`first`,n),i=ch(R(e,1,n),`second`,n),a=R(e,2,n);if(!O(a)||!N(a))throw Hr(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw Hr(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Hr(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return lh(o,r,o.length===0?0:i/o.length,t.getRandom())},dh=e=>[ei(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw Hr(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw ui(oh,String(n));let r=R(t,1,`RandomSubset`);if(!O(r)||!F(r)&&!N(r))throw Hr(`second`,`RandomSubset`,`a finite set`,r);let i=lm(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>sh)throw ui(oh,`Attempted to construct a set with too many elements (>${sh}).`);return nn(um(n,r,e.getRandom(),e.version))}),ei(`RandomSetOfSubsets`,3,t=>uh(t,e)),ei(`TestRandomSetOfSubsets`,3,t=>yn(Array.from({length:5},()=>P(uh(t,e)).elements.length)))],fh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,ph=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${fh})`,mh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${fh}) throws java.io.IOException`,hh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${fh})`,gh=e=>bn([[`name`,e??`UnnamedAction`],[`location`,bn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),_h=(e,t,n)=>{let r=e.map((e,t)=>yn([t+1,bn(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 bn([[`action`,nn([...i,...a])],[`state`,nn(r)]])},vh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return hm(e).get(t)},yh=(t,n,r,i)=>{if(typeof r==`number`&&r>=0)t.registers.set(r,i);else if(r===`exit`)i===!0&&(t.isStopped=!0);else if(r===`pause`){if(i!==!0)return;n(`Press enter to resume model checking.`),t.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))t.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))t.properties.set(r.slice(2),L(i));else throw new e.S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},bh=e=>e.every(e=>e!==void 0),xh=(e,t)=>bn(t.variables.map((t,n)=>[t,e[n]])),Sh=(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&&!D(e)){if(t.variableIndex.has(r))return!0;let e=rl(r,t);if(e&&!n.has(e)&&(n.add(e),Sh(e.body,t,n)))return!0}return E(e).some(e=>Sh(e,t,n))},Ch=(t,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[z(`AssertEq`,2,e=>{let n=R(e,0,`AssertEq`),r=R(e,1,`AssertEq`),i=xt(n,r);return i||(t(L(`Assertion failed`,!0)),t(L(n,!0)),t(L(r,!0))),i}),_i(`AssertError`,2,t=>{let r=Zr(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw ui(ph,`In computing AssertError, a non-string expression (line ${r.location.line}, col ${r.location.column}) was used as the err of an AssertError(err, exp).`);let i=vi(t,0,`AssertError`)();try{vi(t,1,`AssertError`)()}catch(t){if(t instanceof e.g)return Gi(t.message,n.isTool)===i;throw t}return!1}),ei(`TLCGetOrDefault`,2,e=>{let t=R(e,0,`TLCGetOrDefault`);return vh(n,t)??R(e,1,`TLCGetOrDefault`)}),{...$r(`TLCGetAndSet`,4,e=>{let r=R(e,0,`TLCGetAndSet`),i=vh(n,r)??R(e,3,`TLCGetAndSet`),a=Zr(e,1,`TLCGetAndSet`);return yh(n,t,r,a.call([i,R(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},ei(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!bh(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw ui(mh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return yn(n.getBehavior(r).map(e=>xh(e,t.environment)))}),ei(`CounterExample`,0,()=>n.counterExample??bn([[`action`,nn([])],[`state`,nn([])]])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(!k(n)||!xt(cr(n),nn([`action`,`state`])))throw new e.g(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(n)}`);let r=P(or(n,`state`)).elements.map(e=>Gn(e)??[]);return yn(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,t=>{let n=R(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.S(`The argument of ModelValue should be a string, but instead it is:\n${L(n)}`);return st(n)}),_i(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),_i(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!bh(i))throw ui(hh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||nl(vi(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.k(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),_i(`TLCCache`,2,(e,t)=>{let n=Zr(e,0,`TLCCache`),i=Ar(vi(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Sh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?a(t.state):r,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(i);if(l!==void 0)return l;let u=n.call([]);return c.set(i,u),u}),z(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Up([R(e,0,`TLCFP`)])))),ei(`TLCEvalDefinition`,1,(t,n)=>{let r=R(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?rl(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.S(`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},n)})]},wh=(e,t)=>[ei(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),ei(`_Counts`,0,()=>mm(t)),ei(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(mm(t),!0)),!1)}),ei(`_PrintCounts`,0,()=>(e(L(mm(t),!0)),!0))],Th=e=>String(e).padStart(2,`0`),Eh=e=>`${e.getUTCFullYear()}.${Th(e.getUTCMonth()+1)}.${Th(e.getUTCDate())}.${Th(e.getUTCHours())}${Th(e.getUTCMinutes())}${Th(e.getUTCSeconds())}`,Dh=e=>ln([...e].map(([e,t])=>[e,yn([t])])),Oh=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),kh=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Ah=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),jh=(t,n,r)=>{if(t.version===`1.7.4`?!kh.has(n)||!t.isStarted&&Ah.has(n):!t.isStarted&&Oh.has(n))throw new e.S(`TLCGet(${n}) was undefined.`);let i=Math.floor((Date.now()-t.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:t.getLevel(r);case`diameter`:return t.diameter;case`generated`:return t.generatedStates;case`distinct`:return t.distinctStates;case`queue`:return t.queueSize;case`duration`:return i;case`stats`:return bn([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return bn([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return bn([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,Ze(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Ze(Eh(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return gh(void 0);case`all`:return Dh(t.registers);case`all:named`:return Dh(hm(t))}if(n.startsWith(`s:`)){let r=hm(t).get(n);if(r===void 0)throw new e.S(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Ze(t.properties.get(n.slice(2))??n);throw new e.S(`TLCGet(${n}) was undefined.`)},Mh=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.S(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(n)}`);return jh(t,n,r?.state)},Nh=e=>e.length===0?[[]]:e.flatMap((t,n)=>Nh([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Ph=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Ph),e.kind===`Function`&&e.range.forEach(Ph))},Fh=(t,n)=>[z(`Print`,2,e=>(t(`${Me(L(R(e,0,`Print`),!0,!0))} ${Me(L(R(e,1,`Print`),!0,!0))}`),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(Me(L(R(e,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,t=>{if(R(t,0,`Assert`)!==!0)throw new e.S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${Me(L(R(t,1,`Assert`)))}`,e.U.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ln([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=Xr(e,0,`@@`),n=Xr(e,1,`@@`);return un([...Re(t),...Re(n)])}),z(`ToString`,1,e=>Ze(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return Ph(t),t}),z(`Permutations`,1,e=>{let t=Jr(e,0,`Permutations`);return nn(Nh(t).map(e=>ln(t.map((t,n)=>[t,e[n]]))))}),$r(`SortSeq`,2,e=>{let t=Zr(e,1,`SortSeq`);return yn(Yr(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)]},[]))}),n.version===`1.7.4`?di({...ei(`TLCGet`,1,(e,t)=>Mh(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):di(_i(`TLCGet`,1,(e,t)=>Mh(n,vi(e,0,`TLCGet`)(),t)),`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)`),ei(`TLCSet`,2,e=>{let r=R(e,0,`TLCSet`);return yh(n,t,r,R(e,1,`TLCSet`)),!0}),Qr(`Any`,it),z(`RandomElement`,1,e=>fm(qr(e,0,`RandomElement`),n.getRandom()))],Ih=(e,t)=>e.every(e=>Yn(e,t)),Lh=nn([!1,!0]),Rh=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return cn(Rh(e,t,r),Rh(e,r,n))},zh=[`\\cup`,`\\cap`,`\\`],Bh=e=>typeof e==`object`&&e.kind===`MixedSet`,Vh=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return rn(r.filter(e=>Yn(e,n)===t))}if(r.length===0)return n;if(!Ne(n))return _t({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!Yn(e,t));return rn([...r,...i])},Hh=[Qr(`TRUE`,!0),Qr(`FALSE`,!1),Qr(`BOOLEAN`,Lh),Qr(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ti(`=`,en),ti(`#`,(e,t)=>!en(e,t)),z(`~`,1,e=>!Gr(e,0,`~`)),z(`<=>`,2,e=>Gr(e,0,`<=>`)===Gr(e,1,`<=>`)),z(`/\\`,2,e=>Gr(e,0,`/\\`)&&Gr(e,1,`/\\`)),z(`\\/`,2,e=>Gr(e,0,`\\/`)||Gr(e,1,`\\/`)),z(`=>`,2,e=>!Gr(e,0,`=>`)||Gr(e,1,`=>`)),z(`\\in`,2,e=>Yn(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Yn(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=Kr(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?Ih(P(t.base).elements,n.base):Ih(P(t).elements,n)}),...zh.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if(Ne(n)&&Ne(r)&&!Bh(n)&&!Bh(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?cn:e===`\\cap`?sn:on;return Jn((e,n)=>t(P(e),P(n)),(t,n)=>Vh(e,t,n),n,r)}return Ne(n)?Vh(e,n,r):e!==`\\`&&Ne(r)?Vh(e,r,n):_t({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=Kr(e,0,`UNION`),n=Pe(t)?t.elements.filter(Pe):[];if(!Pe(t)||n.length!==t.elements.length)return _t({kind:`Union`,base:t});if(Bh(t)||n.some(Bh)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Yn(t,e)||e.elements.push(t)})),rn(e.elements)}return n.length===0?an:Rh(n.map(P),0,n.length)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!k(n))throw new e.g(`DOMAIN expects a function but received ${L(n)}`);return cr(n)})],Uh=pi(`Integers`,`Neg`,`IntValue`,1),Wh=t=>{let n=pi(t,`DotDot`,`IntervalValue`,2);return[mi(t,`+`,`Plus`,(e,t)=>e+t),mi(t,`-`,`Minus`,(e,t)=>e-t),mi(t,`*`,`Times`,(e,t)=>e*t),mi(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.S(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.S(`0^0 is undefined.`);return t**n}),mi(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.S(`The second argument of \\div is 0.`);if(t===`Naturals`){let e=Math.trunc(n/r)|0;return e<0&&Math.imul(e,r)!==n?e-1:e}let i=Math.floor(n/r);if(ni(i))throw ri(`${n} \\div ${r}`);return i}),mi(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.S(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),z(`..`,2,e=>({kind:`Interval`,low:fi(R(e,0,`..`),n),high:fi(R(e,1,`..`),n)}))]},Gh=Wh(`Naturals`),Kh=Wh(`Integers`),qh=e=>{let t=Gh.indexOf(e);return t===-1?void 0:Kh[t]},Jh=[Qr(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Gh,gi(`<`,(e,t)=>e<t),gi(`>`,(e,t)=>e>t),gi(`<=`,(e,t)=>e<=t),gi(`>=`,(e,t)=>e>=t,`>`)],Yh=[Qr(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Kh,gi(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=fi(R(e,0,`-`),Uh);if(ni(-t))throw ri(`-${t}`);return-t})],Xh=(t,n,r)=>{let i=R(t,n,r),a=Gn(i);if(!a)throw new e.S(`${r}\n${L(i)}`);return a},Zh=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Xh(e,t,n)},Qh=(e,t,n)=>typeof e==`string`?Ze(e.slice(t,n)):yn(e.slice(t,n)),$h=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,eg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,tg=(e,t)=>{let n=Nd.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?di(e,t):e}):t},ng=t=>tg(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Zh(e,0,$h(``,`Len`)).length),z(`\\o`,2,t=>{let n=Zh(t,0,eg(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=Xh(t,1,eg(`t \\o s`,`sequence`));return yn([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.S(`${eg(`t \\o s`,`string`)}\n${L(r)}`);return Ze(n+r)}),z(`Append`,2,e=>yn([...Xh(e,0,eg(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=Xh(t,0,$h(``,`Head`));if(n.length===0)throw new e.S(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,t=>{let n=Zh(t,0,$h(``,`Tail`));if(n.length===0)throw new e.S(`Attempted to apply Tail to the empty sequence.`);return Qh(n,1)}),z(`SubSeq`,3,t=>{let n=Zh(t,0,$h(`first `,`SubSeq`)),r=Wr(t,1,`SubSeq`),i=Wr(t,2,`SubSeq`);if(r>i)return Qh(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new e.S(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Qh(n,r-1,i)}),$r(`SelectSeq`,2,e=>{let t=Zr(e,1,`SelectSeq`);return yn(Xh(e,0,$h(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw Hr(`second`,`SelectSeq`,`operator`,n);return n}))})]),rg=t=>tg(`FiniteSets`,[z(`IsFiniteSet`,1,t=>{let n=R(t,0,`IsFiniteSet`);if(O(n))return Un(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e.g(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${L(n)}\nis a finite set.`:`Attempted to check if the ${Fe(n)} ${L(n)} is a finite set.`)}),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!O(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.S(`Attempted to compute cardinality of the value\n${L(r)}`);return Vn(r,t)})]),ig=/* @__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`]]]),ag=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Jh};case`Integers`:return{extends:[`Naturals`],operators:Yh};case`Sequences`:return{extends:[],operators:ng(n.version)};case`FiniteSets`:return{extends:[],operators:rg(n.version)};case`TLC`:return{extends:[],operators:tg(`TLC`,Fh(t,n))};case`Randomization`:return{extends:[],operators:dh(n)};case`_Possible`:return{extends:[],operators:wh(t,n)};case`Json`:return{extends:[],operators:ah(r)};case`Bags`:return{extends:[],operators:zm(i)};case`TLCExt`:return{extends:[],operators:Ch(t,n)};default:return}},og=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}])),sg={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]}},cg=(e,t)=>{let n=sg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},lg=`$subexpression`,ug=(t,n)=>new e.D(`${t} at line ${n.line}, column ${n.column}`),dg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return dg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of E(e)){let e=dg(r,t,n);if(e)return e}},fg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),pg=(e,t)=>{let n=e.location,r=fg(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 ug(`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 ug(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:lg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:lg,args:e.args,location:n,resolution:la},location:n}},mg=(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:la})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:la}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:la};return pg({...t,params:[...t.params,...r]},a)},hg=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s={index:0,current:void 0,isFailed:!1},c=(n,i)=>{if(!n)throw ug(i,a);da.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.R(n),message:i}}),s.isFailed=!0},l=e=>{let r=[],i=[];for(;s.index<t.length;){let o=t[s.index];if(o.kind!==`Name`)throw ug(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>No(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw ug(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=ga(u),f=s.index===t.length-1;if(n.args.length!==d&&(!i||n.args.length!==0))return c(r.argumentRanges?.[s.index]??a.range,`The operator ${n.name} requires ${d-n.earlier} arguments.`);if(f)return{definition:u,args:n.args};if(u.kind!==`Operator`)throw ug(`Cannot select a subexpression of ${u.name}`,a);o.params.push(...u.params),o.args.push(...n.args),s.current=u.body,s.index++},d=()=>{for(;s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&dg(s.current,e.name,[]);if(!a)return c(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return c(n,`Label \`${e.name}' used with wrong number of arguments.`);o.lets.push(...a.lets),o.params.push(...l.map(e=>({name:e,arity:0}))),o.args.push(...e.args),s.current=a.label.body,s.index++}},f=e=>{let n=s.current;if(!n)throw ug(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(e);return}if(n.kind===`Let`){if(e.kind!==`Operand`||La(e.operand,1)!==0)throw ug(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=Va(n);if(r&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),s.current=r.body;return}if(n.kind===`Case`&&e.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[La(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw ug(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=La(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw ug(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw ug(`Unexpected subexpression selector`,a);let i=r?r.sets:Ha(n),c=i?.[La(e.operand,i.length)];if(!c)throw ug(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return mg(p.definition,{...o,args:p.args});for(d();s.index<t.length&&!s.isFailed;){let e=t[s.index];if(e.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw ug(`A name selector here must be from a LET clause`,a);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return r;if(e)return mg(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw ug(`Subexpression selection failed`,a);return pg(o,s.current)},gg=(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 Ra(e,t,n)},_g=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||E(e).some(_g),vg=(e,t,n,r=!1)=>{if(!_g(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Io(e,e=>vg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>yg(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)=>vg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Io(e,e=>vg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?gg(a.name,[],void 0,t):a.kind===`Apply`?gg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=hg(o,t,a,r);return c!==a&&ua.add(c),c},yg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:vg(e.expression,t,n,!0)}))}),bg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},xg=(e,t)=>yg(e,bg(t.definitions),()=>!1),Sg=(e,t)=>{let n=bg([...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=>vg(e,n,i),o=e=>i(e)||!n(e),s=e=>vg(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 yg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?yg(e,n,o):Fo(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=>_g(e.body))||e.assumptions.some(e=>_g(e.expression))?{...p,definitions:e.definitions.map(e=>Fo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Cg=(e,t)=>`${e}${t}`,wg=(e,t,n)=>`${e}${t}${n}`,Tg=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Eg=(e,t,n)=>`${e},${t},${n}`,Dg=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Og=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),kg=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Ag=(e,t,n,r)=>({...Dg(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),jg=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Mg=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Ng=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,{...Ag(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Pg=Ag(`$Set`,0,[2],[1]),Fg=Ag(`$Junction`,0,[3],[1]),Ig=Ag(`$Choose`,0,[2],[1]),Lg=Ag(`$Function`,0,[3],[1]),Rg=Ag(`$FcnApply`,0,[2,2],[1,1]),zg=Ag(`$RcdSelect`,0,[2,0],[1,1]),Bg=Ag(`'`,2,[1],[0]),Vg=Ag(`ENABLED`,1,[2],[0]),Hg=Ag(`[]`,3,[3],[0]),Ug=Ag(`$SquareAct`,2,[2,1],[0,0]),Wg=Ag(`$WF`,3,[1,2],[0,0]),Gg=Ag(`$TemporalExists`,3,[3],[0]),Kg=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),qg=e=>e.map(e=>({name:e,arity:0})),Jg=(t,n)=>n.location.range?e.I(`${t}.`,n.location.range):new e.D(`${t} at line ${n.location.line}, column ${n.location.column}`),Yg=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Xg=e=>e.kind!==`Let`&&e.kind!==`Label`,Zg=t=>{let n=/* @__PURE__ */ new Map,r=(e,n)=>{let r=n.get(e);if(r?.kind===`Formal`)return{kind:`Declared`,name:e,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:g(r.definition,r.scope)};if(t.constants.has(e))return{kind:`Declared`,name:e,level:0,arity:0};if(t.variables.has(e))return{kind:`Declared`,name:e,level:1,arity:0};let i=t.getDefinition(e);if(i){let n=g(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Ng.get(e)??og.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Dg(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(wg(e,n,t))}),t.data.constraints.forEach((e,t)=>Og(r.constraints,t,e)),kg(r.argConstraints,Cg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>kg(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>jg(t,r))throw new e.D(`Level error in applying operator ${t.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new e.D(`Level error in applying operator ${t.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=e=>{let r=t.formals.findIndex(t=>t.name===e);return r===-1?void 0:n[r]},s=(e,n,r)=>t.conditions.has(Eg(e,n,r)),c=Dg(Math.max(t.level,...n.filter((e,n)=>Mg(t,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return t.params.forEach(e=>c.params.add(e)),n.forEach((e,n)=>{Mg(t,n)===1&&e.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),t.constraints.forEach((e,t)=>Og(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Og(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Og(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Og(c.constraints,e,jg(t,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Og(c.constraints,e,jg(r,a)))}))}),t.argParams.forEach(e=>{let t=Tg(e),n=o(t.operator)?.operator;n&&Og(c.constraints,t.param,jg(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>kg(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>kg(c.argConstraints,Cg(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&kg(c.argConstraints,Cg(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=Tg(e),n=o(t.operator);n&&kg(c.argConstraints,Cg(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Tg(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Tg(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(wg(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(wg(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(wg(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=te(`LAMBDA`,qg(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,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=Dg();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Kg(n,qg(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 Jg(`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 Jg(`Action used where only temporal formula or state predicate allowed`,e);Yg.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Xg(n)&&n.kind!==r)throw Jg(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=g(e,n);t.constraints.forEach((e,t)=>Og(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>kg(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.D)||n.sany?n:Jg(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Dg();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(Fg,n)}case`Prime`:case`Unchanged`:return c(Bg,[e.expression],t);case`Enabled`:return c(Vg,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Hg,[n])}case`If`:return c(Fg,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Fg,[...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(Fg,[e.body],t,e.bounds.map(e=>e.set),Oa(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Jg(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Gg:Fg,[e.body],t,[],e.names);case`Choose`:return c(Ig,[e.body],t,e.set?[e.set]:[],Da(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Pg,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Pg,[e.predicate],t,[e.bound.set],Da(e.bound.pattern));case`SetMap`:return c(Pg,[e.expression],t,e.bounds.map(e=>e.set),Oa(e.bounds));case`FunctionConstruction`:return c(Lg,[e.body],t,e.bounds.map(e=>e.set),Oa(e.bounds));case`Record`:return c(Lg,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Pg,e.fields.map(e=>e.value),t);case`Except`:return c(Pg,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(Rg,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(Pg,e.args,t)}]);case`Bracket`:return Dg();case`FieldAccess`:return a(zg,[o(e.record,t),{data:Dg()}]);case`BoxAction`:case`AngleAction`:return c(Ug,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Wg,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Dg()}},ee=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>ee(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||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 E(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,Kg(t,qg(e.names))),i;default:return Io(e,(e,r)=>(a(e,n,Kg(t,qg(r))),e)),i}},te=(e,t,n,r)=>{let i=Kg(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=ee(n,i),c={...Dg(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(Cg(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(wg(e.name,n,t.name))).map(e=>Eg(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(Tg(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Tg(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},g=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Dg(),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=te(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:g,toOperand:o}},Qg=(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`?Qg(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Dg(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Og(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>kg(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},$g=(t,n,r,i)=>{let a=Zg(n),o=e=>Math.max(0,...e.map(e=>a.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`?Qg(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.R(t.statement),r=()=>s(t)===0;return t.body.kind===`Have`||t.body.kind===`Take`||t.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:t.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...c(t.proof)]:t.body.kind===`Qed`?c(t.proof):[]}):[],l=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=t.body,r=()=>s(t)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(t=>t.set.location.range?[{location:e.R(t.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(t.proof),...i,...t.proof?.kind===`Steps`&&r()?c(t.proof):[]]}):[],u=Eo([...t.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...t.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...t.theorems.map(t=>({location:t.location,check:()=>{let n=t.statement.kind===`AssumeProve`?Qg(t.statement,/* @__PURE__ */ new Map,a):a.analyze(t.statement,/* @__PURE__ */ new Map),r=[...l(t.proof),...n.level===3?c(t.proof):[]];if(r.length>0)throw e.F(r)}})),...r],i);if(u.length>0)throw e.F(u,!1,void 0,i)},e_=(e,t)=>e.maxLevels[t]??3,t_=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Zg({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),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=>Og(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Og(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>kg(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Tg(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)&&Og(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(Qg(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=e.R(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),c=t(n.module),l=a(n.module),u=r(n.instancer),d=/* @__PURE__ */ new Map;n.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 t=n.substitutions.get(e.name);if(!t)return[];if(e.arity===0){let n=u.analyze(t,d);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(t,d);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),p=(e,t)=>`Level error in instantiating module '${n.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${t}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(p(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let t=l.constraints.get(e.name);t!==void 0&&e.level>t&&s(p(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=l.argConstraints.get(Cg(e.name,i));a!==void 0&&e_(r,i)<a&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let t=Tg(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=e_(r,t.index);i.level>a&&s(`Level error when instantiating module '${n.module}':\nThe level of the argument ${t.index} of the operator ${t.operator}' \nmust be at most ${a}.`)}),i.size>0)throw e.F([...i.values()])}},n_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],r_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),i_=new Map(Dd.flatMap(e=>e.map(t=>[t,e[0]]))),a_=e=>i_.get(e)??e,o_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},s_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(o_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},c_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),l_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:a_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:a_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},u_=(e,t)=>{let n=[];for(let r=t;;){let t=l_(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}),f_=(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=u_(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},p_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,m_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},h_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&p_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&p_(e[n+1],e[n+2])?n+=p_(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=>m_[e])}"`:r.text)}return t},g_=e=>e[2]?.text,__=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},v_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>v_(e.modules,t)).find(Boolean),y_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(jd.has(i)?t?.(i):void 0)??Md.get(i)??t?.(i)??Dp(e,i),s=o===void 0?[]:ne(o),c=__(s),l=c.get(g_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=kp(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>v_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},b_=(e,t)=>{let n=y_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=u_(t,e+1);r.push({location:d_(t[e]),apply:e=>i.forEach(t=>e.put(c_(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,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:d_(u),apply:t=>t.put(c_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&u_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),r_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(d_(u)),r.push({location:d_(u),apply:e=>e.put(c_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(c_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=a_(e.name);r.push({location:e.location,apply:n=>n.put(c_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(c_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(c_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>ha(e.location,t.location)?-1:+!!ha(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=s_();i.set(e??``,s),Ed.toReversed().forEach(e=>s.put(c_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},x_=(e,t,n)=>b_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),S_=(e,t)=>{let n=b_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},C_=(e,t)=>x_(e,t,`variable`),w_=(t,n,r)=>{let i=y_(t,r),a=/* @__PURE__ */ new Set,o=e=>{a.add(e)},s=e=>{e.kind===`ModelValue`&&o(e.name),e.kind===`String`&&o(e.value),e.kind===`Set`&&e.elements.forEach(s)};n.constants.forEach(e=>{e.args?.forEach(s),s(e.value)}),Od.forEach(o);let c=e=>{let t=i(e);return t.tokens.slice(t.start,t.end)},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=e=>{let t=u.get(e);if(t)return t;let n=f_(c(e),e,l);return u.set(e,n),n},f=e=>l.get(e)??d(e),p=/* @__PURE__ */ new Set,m=(e,t)=>l.has(t)||p.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(f),...e.instances.filter(t=>m(e,t)).map(f),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},ee=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!m(n,e));return i===void 0?h(n,r,t):[n,i]};return t},te=ee(e=>e.extends),g=ee(e=>e.instances),ne=/* @__PURE__ */ new Set([void 0]),_=/* @__PURE__ */ new Map;h_(c(void 0)).forEach((e,t)=>{t===3&&Ad.forEach(o),o(e)});let re=d(void 0);for(;;){let t=te(re,/* @__PURE__ */ new Set)??g(re,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(p.add(`${n.key}>${r}`),_.set(n.unit,[..._.get(n.unit)??[],r]),!ne.has(r)){if(ne.add(r),i(r).tokens.length===0){let t=n.unit??g_(i(void 0).tokens);throw e.P(r,t)}h_(c(r)).forEach(o)}}n_.forEach(o);let v=/* @__PURE__ */ new Set,y=e=>{if(v.has(e))return;v.add(e);let t=_.get(e)??[],n=d(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(y),c(e).forEach(e=>{e.kind===`String`&&o(e.text)})};return y(void 0),kd.forEach(o),[...a]},T_=t=>{switch(t.kind){case`Number`:if(!j(t.value))throw e.G(new e.S(`Integer overflow: ${t.value} is outside TLC's 32-bit range`),e.U.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return st(t.name);case`Set`:return nn(t.elements.map(T_))}},E_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],D_=(t,n)=>{try{return kp(t)}catch(r){if(!(r instanceof e.D))throw r;let i=tp(t);throw i===void 0?r:e.F([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},O_=t=>new e.D(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),k_=(t,n)=>t.location.range&&n.location.range&&{location:e.R(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.R(n.location.range)}.`},A_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,j_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:A_(e),M_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Xo(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),N_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:t,arity:n,evaluate:t=>{let n=r.find(n=>{if(n[0].length!==t.length)throw new e.g(`Attempted to apply the operator ${i}\nwith wrong number of arguments.`);return n[0].every((e,n)=>{let r=t[n];return(typeof r!=`object`||r.kind!==`Operator`)&&xt(e,r)})});if(n)return n[1];throw new e.g(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},P_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||E(e).some(e=>P_(e,t)),F_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Go(e),n.get(e)??n.size)),n},I_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),L_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Gc(e);if(e.kind===`Number`&&!j(e.value))throw Kc(e);L_(e.kind===`Let`?[...E(e),...I_(e.instances??[])]:E(e))}),R_=(t,n)=>{let r=kp(n.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set,c=new Map(Hh.map(e=>[e.name,e])),l=/* @__PURE__ */ new Map,u=pm(t.checkDeadlock,n.seed);u.isWarningEnabled=n.isWarningEnabled??!0,u.isTool=n.isTool??!1,u.version=n.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=/* @__PURE__ */ new Map,ee=[],te=[],g=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},_=e=>`${e}#${ne.value++}`,re=[],v=[],y=t_(e=>{let t=p.get(e)??fe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),ie=/* @__PURE__ */ new Map,ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=e=>{let t=l.get(e);if(t)return t;let r=ag(e,n.print,u,n.files,c);if(!r)return;ig.get(e)?.forEach(se);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>se(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{c.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:og.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:cg(e,t.name)??i.get(t.name)?.range})}),l.set(e,i),i},ce=e=>{if(jd.has(e)&&n.loadModule?.(e)!==void 0)return;let t=se(e),r=ig.get(e)??[];return t&&g(e,r),t&&r.includes(`Integers`)&&se(`Integers`),t},le=e=>(L_([...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]),...I_(e.instances)]),e.modules.forEach(le),e);le(r);let ue=(t,r)=>{let i=n.loadModule?.(t)??Ee.get(t)??Dp(n.source,t);if(i===void 0)throw e.P(t,r);let a=D_(i,t);if(a.name!==t)throw e.F([{location:`Unknown location`,message:`File name '${t}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return le(a)},de=t=>{let n=te.indexOf(t.name);if(n!==-1){let r=[...te.slice(n),t.name].map(e=>`${e}.tla`);throw new e.D(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];te.push(t.name),ee.push(r);let s=ve(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:v,levelChecks:o});if(ee.pop(),te.pop(),a.length>0)throw e.F(a,!1,void 0,v);let c=i.find(e=>r.has(e.name)),l=c&&d.get(c.name),u=l&&k_(c,l.module);if(u)throw e.F([u],!1,void 0,v);if(c)throw O_(c);return o.forEach(e=>e()),{linked:s,closure:r}},fe=(e,t)=>{let r=d.get(e);if(r)return g(e,h.get(e)??[]),r;let a=de(ue(e,t));return(ym(u.version).has(e)?ag(e,n.print,u,n.files,c):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(c.set(t.key,e),i.delete(t.key))}),d.set(e,a.linked),h.set(e,a.closure),g(e,a.closure),a.linked},b=(e,t,n,r,c)=>{let l=c?void 0:ce(e.module);if(l)return x(e,l);let u=c??fe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=E_(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=To(xg(e,t),d,t,n);re.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=rs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Ao(t,p)])),variables:new Set(u.variables),getDefinition:e=>i.get(e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,c,l)=>{let u=_(`${c}@${t.name}`),f=l(u);return i.set(u,f),d.length>0&&s.add(f),e.name!==void 0&&ae.set(u,`${e.name}!${ae.get(n)??c}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:_});return S(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&ie.set(r,{name:n,location:e.location}),e.name!==void 0&&oe.set(r,n),r})},x=(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}])),S=(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:a.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}]}))},C=(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:Zo(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),pe=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),me=(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=pe(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Zo(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:ce(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=pe(n.arity);return C(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=r??fe(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=E_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};re.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>P_(f(e),p),h=d.map(t=>{let n=me(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),ee=[],te=rs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Zo(e.params,o),location:o,resolution:la}:Xo(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),isParameterized:e=>a.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}:M_(a,i)),i},createName:_}),g=new Set(d.map(e=>e.name)),v=[...c.exported].filter(([e])=>!g.has(e)).map(([t,n])=>{let r=te.getKey(n.key),i=pe(n.arity),a=[...e.params,...i];return C(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...ee,...v]},ge=e=>[...e].flatMap(([e,t])=>{let n=i.get(t.key);return n?[{...n,name:e}]:[]}),_e=/* @__PURE__ */ new Map,ve=(t,o)=>{let s=Td(t,n.loadClass?.(t.name),t===r);_e.set(t.name,s.overrides);let c=s.module,l=re.length,u=new Map([...Hh.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...o.symbols]),d=/* @__PURE__ */ new Map,h={location:bo,errors:[],warnings:[]},ee=[h],te=t=>t.forEach((t,n)=>{let r=g.get(n);if(!r){u.set(n,t),g.set(n,t);return}if(!r.range||!t.range||e.R(r.range)===e.R(t.range))return;let i=e.R(t.range),a=e.R(r.range);j_(r.kind)===j_(t.kind)?h.warnings.push({location:i,message:`Warning: the ${A_(r.kind)} of '${n}' conflicts with \nits ${A_(r.kind)} at ${a}.`}):h.errors.push({location:i,message:`The ${A_(t.kind)} of '${n}' conflicts with \nits ${A_(r.kind)} at ${a}.`})}),g=/* @__PURE__ */ new Map,ne=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,ie=[],ae=[...c.constants],se=c.variables.map(e=>e.name),le=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=o.modules.get(e),n=t?void 0:ce(e);if(n){te(n);return}let r=t??fe(e,c.name);ae.push(...r.constants.filter(e=>ae.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{se.includes(e)||(se.push(e),le.push(r.variableLocations[t]))}),te(r.exported),r.facts.forEach(e=>ne.add(e)),r.modules.forEach((e,t)=>_.set(t,e)),ie.push(r)});let ue=new Map(u),de=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],C=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});de.forEach(e=>g.set(e.name,C(e)));let pe=e=>({key:w(e),arity:ga(e),params:_a(e),kind:xo(c,e)?`Theorem`:`Definition`,range:e.location.range}),me=ae.length===0&&se.length===0,w=e=>c===r?e.name:`${e.name}@${o.id}`,T=/* @__PURE__ */ new Map,ye=()=>new Map([...o.modules,..._]),be=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&ha(e.location,t.location)},xe=e=>{let t=c.modules.find(t=>t.name===e.module);return t?be(t)?_.get(t.name):void 0:ye().get(e.module)},Se=e=>({imported:u,getInstance:e=>{let t=xe(e),n=t?void 0:ce(e.module);if(n)return{declarations:[],symbols:x(e,n),instancer:c.name};let r=t??fe(e.module,c.name),i=E_(r);return{declarations:i,symbols:S(e,r.exported,i,e=>e),instancer:c.name}},bound:ue,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:w,instanced:T,facts:ne,reports:ee,warnings:o.warnings}),E=e=>[...de.filter(t=>ha(t.location,e)).map(e=>[e.name,C(e)]),...c.definitions.filter(t=>ha(t.location,e)).map(e=>[e.name,pe(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),D=e=>{let t=ye(),n=t.get(e.name),r=n&&k_(e,n.module);if(n&&!r)throw O_(e);o.nested.push(e);let i={location:e.location,errors:[],warnings:[]};ee.push(i);let a=ve(e,{id:`${o.id}/${e.name}`,symbols:E(e.location),modules:t,nested:o.nested,errors:i.errors,warnings:i.warnings,levelChecks:o.levelChecks});r&&i.errors.push(r),n||_.set(e.name,a),f.has(e.name)||f.set(e.name,a)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=b(e,c,Se(c),me,ye().get(e.module));T.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||g.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>D(e)}))].sort((e,t)=>ha(e.location,t.location)?-1:1).forEach(e=>e.link());let Ce=Sg(ss(c,(e,t)=>he(e,t,c.name,xe(e))),ge(u));o.errors.push(...Do(Ce,Se(Ce))),Ce.definitions.forEach(e=>{let t=w(e);i.set(t,e),a.set(t,!me);let n=pe(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ha(r,e.location))&&(u.set(e.name,n),e.isLocal||g.set(e.name,n))});let we={module:Ce,constants:ae,variables:se,variableLocations:le,visible:u,exported:g,modules:_,extended:ie,facts:/* @__PURE__ */ new Set([...ne,...[...Ce.theorems,...Ce.assumptions].flatMap(e=>e.name??[])])};p.has(c.name)||p.set(c.name,we);let Te=re.splice(l).map(e=>({location:e.location,check:()=>y(e)}));return o.levelChecks.push(()=>$g(Ce,{constants:new Set(ae.map(e=>e.name)),variables:new Set(se),getDefinition:e=>i.get(u.get(e)?.key??e),getQualifiedName:e=>oe.get(u.get(e)?.key??e)},Te,v)),m.push(we),we},w=de(r).linked;v.length>0&&!n.isSanyReported&&n.print(e.z(v));let T=e=>w.visible.get(e)?.key??e;w.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)});let ye=[],be=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>be(e,t)),ye.push(...e.module.assumptions))};be(w,/* @__PURE__ */ new Set);let xe=w.constants.map(e=>e.name),Se=w.variables,E=e=>e.module===void 0?[e.name,T(e.name)]:e.module===r.name||xe.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],D=e=>{let t=i.get(e);return t?.kind===`Operator`?t.params.length:w.constants.find(t=>t.name===e)?.arity??0},Ce=/* @__PURE__ */ new Map,we=/* @__PURE__ */ new Set,Te=(e,t)=>{c.set(e,t),i.delete(e),Ce.delete(e),we.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=T_(e.value);$t(t),E(e).forEach(e=>{let n=D(e);n===0?Ce.set(e,t):Te(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let De=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=De.get(n)??{name:t.name,module:t.module,rows:[]};if(r.rows.length>0&&r.rows[0][0].length!==t.args.length)throw new e.m(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(T_),T_(t.value)]),De.set(n,r)}),De.forEach(e=>E(e).forEach(t=>Te(t,N_(e.name,D(t)||e.rows[0][0].length,e.rows))));let Oe=new Map(t.substitutions.flatMap(e=>E(e).map(t=>[t,T(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,a=n.target;if(!xe.includes(r)&&!w.visible.has(r))throw new e.m(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===a))throw new e.m(`In the configuration file, the identifier ${a} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let o=T(a),s=i.get(o);if(!(s!==void 0||c.has(o)||Ce.has(o)||xe.includes(a)||Se.includes(a)))throw new e.m(`The configuration file substitutes for ${r} with the undefined identifier ${a}.`);if(s?.kind===`Operator`&&s.params.length!==(w.constants.find(e=>e.name===r)?.arity??w.visible.get(r)?.arity))throw new e.m(`The configuration file substitutes for ${r} with ${a} of different number of arguments.`)});let ke=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(E)),Ae=(e,t)=>{if(ke.has(e))return{key:e,prefix:t};let n=o.get(e);return n&&Ae(n.source,t+n.prefix)};o.forEach((e,t)=>{let n=Ae(e.source,e.prefix),r=i.get(t);if(!n||!r)return;let a=r.kind===`Operator`?r.params:[],o=C(t,n.key,a,a.slice(n.prefix),r.location);i.set(t,o),w.visible.forEach((e,n)=>{e.key===t&&n!==t&&i.set(n,o)})});let je=xe.filter(e=>!Ce.has(e)&&!Oe.has(e)&&!we.has(e));if(je.length>0&&!n.isUnconfigured){let t=x_(n.source,n.loadModule,`constant`).find(e=>je.includes(e))??je[0];throw new e.m(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&c.forEach((e,t)=>{let n=qh(e);n&&c.set(t,n)});let Me={runtime:u,definitions:i,builtins:c,constants:Ce,substitutions:Oe,instanceNames:ae,variables:Se,variableIndex:F_(Se,m.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:s,evaluators:/* @__PURE__ */ new WeakMap},O=Zg({constants:new Set(Ce.keys()),variables:/* @__PURE__ */ new Set([...Se,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>c.has(e))]),getDefinition:e=>rl(e,Me)}),Ne=t=>{try{H(t,{environment:Me,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.g)return t;throw t}};Oe.forEach((t,n)=>{let r=i.get(t),a=xe.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&O.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Ne(r.body):void 0;if(a){let r=Hi(a)?``:` - specifically: ${a.message}`;throw new e.m(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),u.version!==`1.7.4`&&(u.isStarted=!0);let k=new Set(m.flatMap(e=>e.module.instances.map(e=>e.module))),A=S_(n.source,n.loadModule);return{environment:Me,assumptions:ye,variableLocations:w.variableLocations,instanceActions:ie,startupDefinitions:m.filter(e=>!k.has(e.module.name)||E_(e).length===0).flatMap(e=>A(e===w?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:w.constants,rootSymbols:w.visible,javaOverrides:m.flatMap(e=>_e.get(e.module.name)??[])}},z_={kind:`Boolean`,value:!0},B_={kind:`Boolean`,value:!1},V_=e=>e?z_:B_,H_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,U_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),W_=(e,t,n)=>({kind:e,operands:[t,n]}),G_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?G_(e,t.operands).operands:[t])}),K_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return K_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,K_(t)),0)}},q_=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 q_(e.body);case`And`:case`Or`:return e.operands.some(q_)}},J_=/* @__PURE__ */ new WeakMap,Y_={count:0},X_=e=>{let t=J_.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`#${Y_.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(X_).join(`,`)})`;default:return`${e.kind}(${X_(e.body)})`}})();return J_.set(e,n),n},Z_=(e,t)=>e===t||X_(e)===X_(t),Q_=(e,t)=>{let n=X_(t);return e.some(e=>e===t||X_(e)===n)},$_=e=>e===`And`?`Or`:`And`,ev=(e,t)=>{switch(e.kind){case`Boolean`:return t?V_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return ev(e.body,!t);case`And`:case`Or`:return G_(t?$_(e.kind):e.kind,e.operands.map(e=>ev(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,ev(e.body,t))}}},tv=e=>{switch(e.kind){case`Boolean`:return V_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return G_($_(e.kind),e.operands.map(tv));case`Always`:return $(`Eventually`,tv(e.body));case`Eventually`:return $(`Always`,tv(e.body));default:return $(`Not`,e)}},nv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=nv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return V_(t)}return n.length===0?V_(!t):n.length===1?n[0]:G_(e.kind,n)}case`Not`:{let t=nv(e.body);return t.kind===`Boolean`?V_(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=nv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},rv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,iv=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=iv(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r.value*=t.operands.length,r.value>2147483647))throw new e.g(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r.value===1)return{kind:`And`,operands:n};let i=Array.from({length:r.value},()=>[]),a={groups:1,repeat:r.value};for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}a.repeat/=e.operands.length;let t={value:0};for(let n=0;n<a.groups;n++)for(let n of e.operands)for(let e=0;e<a.repeat;e++)i[t.value++].push(n);a.groups*=e.operands.length}return{kind:`Or`,operands:i.map(e=>G_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=iv(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=rv(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:G_(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return G_(`Or`,n)}case`Not`:return H_(t.body)?t:iv(tv(t.body));default:return t}},av=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?av(e.operands[0]):G_(e.kind,e.operands.map(av));case`Not`:return e.body.kind===`Not`?av(e.body.body):$(`Not`,av(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,av(e.body));default:return e}},ov=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return ov(e.operands[0]);let t=Math.floor(e.operands.length/2);return W_(e.kind,ov(G_(e.kind,e.operands.slice(0,t))),ov(G_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,ov(e.body));default:return e}},sv=(e,t)=>{e.kind===`Eventually`&&!Q_(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(U_),n=e.flatMap(e=>e.kind===`Not`&&U_(e.body)?[e.body]:[]);return!t.some(e=>Q_(n,e))},lv=t=>{let n=[...t],r=[];for(;n.length>0;){let t=n.pop();if(!t)break;switch(t.kind){case`Not`:n.push(t.body);break;case`Next`:r.push(t),n.push(t.body);break;case`Always`:case`Eventually`:r.push(t,$(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.g(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},uv=(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]}},dv=(e,t,n)=>e.flatMap(e=>{let r=uv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),fv=e=>[...new Set(e.map(X_))].sort().join(`|`),pv=(e,t)=>{let n=new Set(t.map(fv));return[...e.filter(e=>!n.has(fv(e))),...t]},mv=e=>{let t=lv(e),n=dv(t,`Always`,`And`),r=dv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=uv(t,`Eventually`,`Or`);if(n&&!(Q_(e,n.first)||Q_(e,n.second)))return pv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Q_(e,t.first)||Q_(e,t.second))&&!Q_(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=uv(t[e],`Always`,`And`);n&&(Q_(t,n.first)||t.push(n.first),Q_(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Q_(t,e.first)&&Q_(t,e.second)&&!Q_(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!cv(t)?[]:i(t)};return a(e)},hv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>K_(e)<=1)}),gv=e=>{let t=mv([e]).map(hv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=fv(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 mv(n)){let n=fv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(hv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},_v=(e,t)=>!Q_(e,t)||Q_(e,t.body),vv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&K_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=rv(t);if(r){let e=K_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(q_(t))throw new e.g(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},yv=(e,t)=>{let n=e.findIndex(e=>Z_(e,t));return n===-1?(e.push(t),e.length-1):n},bv=e=>{let t=iv(nv(ev(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=av(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])vv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:G_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Z_(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&ov(e.formula),n=[];t&&sv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>yv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>yv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>yv(i,e))}));return{tableau:t&&gv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},xv=()=>e.G(new e.g(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.U.livenessEvaluationFailure),Sv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Cv=/* @__PURE__ */ new WeakMap,wv=/* @__PURE__ */ new WeakSet,Tv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ev=(t,n)=>new e.g(`TLC cannot handle the temporal formula ${Lc(t)}${n===void 0?``:`:\n${n}`}`),Dv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Xc(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return Dv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?Dv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=rl(e,n);if(t)return Ov(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:D(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Io(e,(e,a)=>(i.value=Math.max(i.value,Dv(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 Sv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Ov=(e,t)=>{let n=Cv.get(e);if(n!==void 0)return n;Cv.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(Dv(e.body,void 0,t),...r.map(e=>Dv(e.set,void 0,t)));return Cv.set(e,i),i},kv=(t,n)=>{try{return gl(t,n)}catch(t){if(!(t instanceof e.g))throw t;if(!Hi(t))return;throw e.G(new e.g(`${e.M}${t.message}`),e.U.error)}},Av=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s)=>{let c=(e,t,n=s,c=a,l)=>Av(e,t,r,i,c,o||l!==void 0&&r.substitutedDefinitions.has(l),n);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,n,Lc(e)));if(t.kind===`Label`)return c(t.body,n);if(t.kind===`Let`)return c(t.body,jv(t,n,r));if(t.kind===`Identifier`){let i=D(t)?Xc(n,t.name):void 0;if(i?.kind===`Thunk`)return c(i.expression,i.scope);let o=r.constants.has(t.name)?void 0:rl(t.name,r);if(!i&&o?.kind===`Operator`&&o.params.length===0&&Ov(o,r)>0){if(a.has(o))throw e.L();return c(o.body,void 0,o.name,/* @__PURE__ */ new Set([...a,o]),o)}}let l=Tv(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||Dv(t,n,r)===3)){let e=Vl(t,l),n=D(t)?void 0:rl(t.operator,r);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&!o)return c(e.body,tu(e,t.args,l),t.operator,a,n)}let u=i&&t.kind===`Forall`&&t.bounds.every(e=>Dv(e.set,n,r)===0),d=u?kv(t.bounds,l):void 0;if(u&&d){let e=[];if(_l(t.bounds,d,n,n=>(e.push(...c(t.body,n,Lc(t.body))),!1)),e.length===0)throw xv();return e}return[{expression:t,scope:n,name:s}]},jv=(e,t,n)=>{let r=ru(e.definitions,Tv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&wv.add(e.binding);return r},Mv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?Dv(t,n,r):a;if(o===0){let i=H(t,Tv(r,n));if(typeof i!=`boolean`)throw new e.g(`TLC expected a boolean value, but did not find one. ${Rc(t)}`);return V_(i)}return o===1?{kind:`State`,expression:t,scope:n}:{kind:`Action`,expression:t,unchanged:void 0,scope:n}},o={depth:0},s=(t,n,r,i)=>{if(o.depth>=100)throw e.L();o.depth++;let s=p(t,n);o.depth--;let c=K_(s);return c>2?s:a(r,i,c)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=Tv(r,t),o=D(e)||rl(n,r)===void 0?Xc(t,n):void 0;if(o?.kind===`Thunk`&&wv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:D(e)?Hl(n,a):zl(n,r);if(c?.kind!==`Closure`)throw Ev(e);let u=e.kind===`Apply`?e.args:[],d=!D(e)&&rl(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,tu(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.E||r&&!i;throw!(n instanceof e.g)||a?n:Ev(t)}},u=(t,n)=>{let i=Dv(t,n,r);if(!t.bounds.every(e=>Dv(e.set,n,r)===0)){if(i<=2)return a(t,n,i);throw Ev(t)}let o=[],s=t.kind===`Forall`;try{vl(t.bounds,Tv(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e.g)||r instanceof e.E)throw r;if(i<=2)return a(t,n,i);throw Ev(t,s&&!Hi(r)?r.message:void 0)}return o.length===0?V_(s):d(t,n,G_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=K_(n);return r>2?n:a(e,t,r)},f=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===`~`&&!D(e)||e.operator===`=>`),p=(e,t)=>{let n=Dv(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,jv(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,W_(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!D(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,W_(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,G_(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&Dv(e.condition,t,r)===0){let n=H(e.condition,Tv(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,W_(`Or`,W_(`And`,n,p(e.consequent,t)),W_(`And`,$(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return $(e.kind,p(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`,W_(`Or`,i,a))):W_(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Ev(e)}};return p(t,n)},Nv=(t,n,r,i,a)=>{let o=e=>Nv(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let e=a.get(t);if(e!==void 0)return e;let r={environment:i,scope:t.scope,state:n,next:void 0},o=t.kind===`State`?nl(H(t.expression,r),`a temporal property predicate`):Ec(t.step,r);return a.set(t,o),o}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let e={environment:i,scope:t.scope,state:n,next:r};return t.unchanged&&nl(H(t.unchanged,e),`a subscript`)?!1:nl(H(t.expression,e),`an action predicate`)}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return Nv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.g(`TLC cannot evaluate a temporal formula in a single step`)}},Pv=(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)=>Pv(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 Nv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Fv=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Iv=(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},Lv=t=>e.G(new e.g(`${e.N}${t}`),e.U.error),Rv=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!A(e)||!A(i))throw Lv(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},zv=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(zv);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Bv=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Vv=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.m(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Lv(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>H(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!O(o)||!N(o))throw Lv(`The symmetry operator must specify a set of functions.`);let s=P(o).elements;if(!s.every(k))throw Lv(`The symmetry values must be function records.`);let c=s.map(Rv),l=i.body.kind===`Apply`?i.body.args:[],u=new Map(r.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),d=e=>{if(e.length===0)return;let t=e.map(e=>{let t=zv(Bv(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Mi.symmetrySetTooSmall,`The set${r?`s`:``} ${t.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(l.length>=s.length){d(l);return}let f=/* @__PURE__ */ new Map;c.forEach(e=>{e.size>0&&f.set(Fv(e),e)});let p=[...f.values()],m={start:0};for(;m.start<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m.start,t).forEach(e=>{let t=Iv(n,e),r=Fv(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),ee=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!Bv(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||ee.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>A(e)&&h.has(e.name))})),f.size===0)return;let te=Math.max(256,Math.floor(4194304/f.size));return{permutations:[...f.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:te})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:te}},Hv=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Gv(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(Gv(e[r],t));return a}},Uv=(e,t)=>{let n=[],r=[];for(let i of e){let e=Gv(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(M);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(M(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},Wv=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Gv=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Wv(e);if(n===0||n>64)return Kv(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Kv(e,t),a=i!==e&&Ct(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},Kv=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Uv(e.elements,t);return n?ct(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=Hv(n.domain,t),i=Hv(n.range,t)??n.range;if(r){let e=ln(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?lt(n.domain,e.range):e}return i===n.range?n:lt(n.domain,i)}if(n===`Interval`||!O(e)||!N(e))return e;let r=P(e),i=Hv(r.elements,t);return i?nn(i):r},qv=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},Jv=(e,t,n)=>e.images[t]??=Gv(e.images[0],n.permutations[t-1]),Yv=(e,t,n,r)=>{let i=qv(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=M(Jv(i,t,r),Jv(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},Xv=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?Yv(i,t,n,r):0;if(o!==0)return o<0}return!1},Zv=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>Xv(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?Jv(qv(e,t),r,t):e)},Qv={line:0,column:0},$v=e=>({kind:`Identifier`,name:e,location:Qv}),ey=/* @__PURE__ */ new Set([`name`,`property`]),ty=(t,n,r)=>{let i=rl(n,r);if(!i)throw new e.m(`The ${t} ${n} specified in the configuration file\nis not defined in the specification.`);if(i.kind===`Operator`&&i.params.length>0)throw new e.m(ey.has(t)?`TLC requires ${n} not to take any argument.`:`TLC requires ${t} not to take any argument, but one was given: ${n}`);return i},ny=(t,n,r)=>{if(sl(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return H($v(t),wy(r,void 0,void 0))}catch(t){if(t instanceof e.g||e.H(t))return;throw t}},ry=(t,n,r)=>{let i=ty(t,n,r);if(ny(n,i,r)!==void 0)throw new e.m(`The ${t} ${n} cannot be a constant.`);return i},iy=(t,n,r)=>{let i=r.constants.has(n)?void 0:ty(t,n,r),a=i?ny(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.m(`The ${t} of ${n} is equal to ${L(a)}`);return a===void 0?i:void 0},ay=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},oy=(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})),Fl(e.startupDefinitions,r),t.invariants.forEach(e=>{iy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},sy=(t,n)=>{let r=Zg({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>rl(e,n)});return t.flatMap(t=>{let i=iy(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
|
|
1781
1766
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1782
1767
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1783
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Wb(t),scope:void 0}]})},$b=(e,t)=>{if(!P(e))return;let n=Ar(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},ex=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>ex(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=_l(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return ex(n.body,t)}return[e]},tx=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||oy(r,e.scope,t)>0)return!1;let i=W(r,gx(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},nx=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Jb(t,e,r),Wb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=Kb(`name`,t.specification,r),c=qb(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if(ly(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(tx(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&oy(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${el(c.expression)}`),e.error);let l=oy(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:Vb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},rx=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Yb(`property`,e,t);if(!i)return;oy(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;ly(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(tx(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`&&oy(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?_l(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=oy(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},ix=(e,t,n)=>t.flatMap(t=>Yb(e,t,n)?[{name:t,expression:Wb(t),scope:void 0}]:[]),ax=(e,t)=>{let n=_l(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ox=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);Jb(`possible`,n,t);let i=Wb(n);if(oy(i,void 0,t)===3)throw new v(`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}}),sx=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},cx=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=_l(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},lx=(e,t)=>e.flatMap(e=>ex(e.expression,t).map(n=>{let r=e.scope===void 0?Pd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:sx(n,r,t),predicate:cx(e.expression,t)}})),ux=(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},dx=/[\u0100-\uffff]/,fx=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),px=e=>e.kind===`String`?dx.test(e.value):e.kind===`Set`&&e.elements.some(px),mx=e=>e.kind===`String`&&dx.test(e.value)||e.kind===`Apply`&&fx.has(e.operator)||vi(e).some(mx),hx=(e,t)=>e.constants.some(e=>px(e.value)||(e.args??[]).some(px))||[...t.definitions.values()].some(e=>mx(e.body)||e.kind===`Function`&&e.bounds.some(e=>mx(e.set))),gx=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),_x=(e,t,n)=>gl(W(e,t),n),vx=(e,t,n=yx)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},yx=(e,t)=>{let n=e.kind===`Identifier`?_l(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`?$c(i):tl(r)}`},bx=(e,t)=>vx(e.expression,t,(n,r)=>(vx(e.predicate,t),yx(n,r))),xx=()=>{},Sx=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=_x(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Cx=(e,t,n)=>{try{return _x(e,gx(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},wx=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Cx(n.expression,t,`an assumption`);if(e)return{name:el(n.expression),trace:[],message:e.message}}},Tx=(t,r,i,a)=>{let o=Qb(t.invariants,r),c=nx(t,r),l=rx(t,r,a),u=lx([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?ma:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=lx(ix(`constraint`,t.constraints,r),r),m=ix(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Kb(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Kb(`periodic`,t.periodic,r);let h=ox(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:bb(t.symmetry,r,t.substitutions);t.view!==void 0&&Kb(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Wb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Vb};return{...e,unchanged:t}}),x=e=>oy(e.expression,void 0,r)>=2,ee=h.filter(e=>!x(e)),te=h.filter(x),S=r.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ne.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ne.indices},ie=(e,t)=>W(e,gx(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:Ab(e,g,t);return _m(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=hx(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=ax(e.name,r),n=t?` at ${$c(t)}`:``;return{name:e.name,code:ua.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${n} 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:dt(z(Rm(S),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=bm(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:Ab(e,g,re());return _===void 0?t:[ie(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(ux(a,t,i))return!1;try{let e=gx(r,t,void 0,a.scope),n=a.membership;return i&&n?!kr(t[n.variable],i[n.variable],W(n.set,e)):!bx(a,e)}catch(t){throw i?Mx(n(t,e.safetyEvaluationFailure),ua.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>vx(n,gx(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>vx(e.predicate,gx(n,t,void 0,e.scope)))&&m.every(r=>vx(r.expression,gx(n,e,t,r.scope))))||r())||d.every(e=>vx(e.predicate,gx(n,t,void 0,e.scope))))&&b.every(r=>vx(r.box,gx(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>ux(n,e,t)||bx(n,gx(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!vx(t.expression,gx(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!vx(n.action,gx(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${el(n.box)}`)&&!_x(n.unchanged,gx(r,e,t,n.scope),`a subscript`)}catch(e){throw Mx(Ex(e),ua.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>vx(n.expression,gx(r,e,t),e=>`${s}${yx(e,r)}`)),trackStatePossible:ee.length===0?xx:e=>Sx(ee,S,gx(r,e,void 0)),trackActionPossible:te.length===0?xx:(e,t)=>Sx(te,S,gx(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=_l(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=Cx(Wb(e),r,`a postcondition`);if(!t)continue;let n=ax(e,r),i=n?` at ${$c(n)}`:``;return t.message===void 0?{name:e,code:ua.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:ua.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},Ex=e=>e instanceof S?n(e,e.exitCode):e,Dx=/* @__PURE__ */ Error(`The replay stopped`),Ox=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),kx=t=>{let n=ya(t.message);return n&&!n.isEvalException&&Ox.has(n.code)?e.configParseError:oe(t)},Ax=t=>{let n=t.cause;return n instanceof y?Ax(n):t instanceof S?t.exitCode:e.specEvaluationFailure},jx=/* @__PURE__ */ new WeakMap,Mx=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return jx.set(i,{code:t,headline:r,inner:e}),i},Nx=s.slice(0,s.indexOf(`
|
|
1784
|
-
`)),Px=`${s}tlc2.tool.EvalException: `,Fx=`${s}util.Assert$TLCRuntimeException: `,Ix=o(`tlc2.tool.EvalException`),Lx=e=>ba(e)?Px:Fx,Rx=e=>{try{return e()}catch(e){throw e instanceof y?ba(e)?new y(`${Ix}${e.message}`):ya(e.message)?e:new y(`${s}${e.message}`):e}},zx=[Px,Fx,s,Ix],Bx=(e,t)=>{let n=jx.get(e);if(n)return`${n.headline}\n${Bx(n.inner,t)}`;let r=e.message,i=zx.find(e=>r.startsWith(e))??``;return`${i}${Ca(r.slice(i.length),t)}`},Vx=(e,t)=>{let n=jx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Bx(e,!0)};if(t&&ba(e))return{code:ya(r)?.code??ua.general,message:r,toolMessage:r};let i=t&&!r.startsWith(Nx)?s:``;return{code:ua.general,message:`${i}${r}`,toolMessage:`${i}${Bx(e,!0)}`}},Hx=e=>{let t=e.dump&&pb(e.dump,e.writeFile,e.version);try{return Wx(e,t)}catch(e){throw c(e)?Ux():e}finally{t?.close()}},Ux=()=>n(new x,e.error),Wx=(t,i)=>{let o=typeof t.config==`string`?at(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};Dt(tv(t.source,o,t.loadModule)),kt(t.version);let p=hv(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});Zb(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>rb(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),te=Array.from({length:32},()=>0),re={newStates:0},ie=()=>Math.min(re.newStates,31),C=()=>te.map((e,t)=>t===ie()?e+1:e),ae=()=>g?[...te]:C(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),w=(e,t=[...te])=>({...e,violationOutDegrees:t}),T=()=>({...b(`success`),outDegrees:[...te],fingerprintDistance:Rb(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=Tx(o,m,()=>ev(t.source,t.loadModule),t.onProgress),D=()=>wx(p.assumptions,m);if(!E){h.isStarted=!0;let e=D();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),T())}let ce=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?Ny(t):Kh(e.action)},fe=(e,t)=>{ce&&(h.counterExample=qh(e.map(ue),e.slice(1).map(de),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=E.spec,he=E.getFingerprintState,O={value:void 0},ge=()=>O.value??=$y(o,m,p.instanceActions),_e=e=>{let t=Uu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=Xr(e).find(e=>Yr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Yr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(en)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if($s(Qy(o,m,p.instanceActions),r,i=>{if(Xb(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),Dx}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();ec(ge(),n,t,(o,s)=>{if(!E.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,N?{name:s.name,signature:nb(s)}:void 0),n}))throw Dx})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let k=a(()=>Rx(()=>ky(E.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,Kc(me.next,t,m,e=>{if(je(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=E.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=_i(),Me=e=>Object.fromEntries(E.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Jb(`alias`,e,m).body,i=W(Wb(e),gx(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return $b(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:Ca(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=ge(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>qc(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&tb(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Gc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=qc(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Xe(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||Du(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(Hb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ze(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,Hb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof S?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:Ax(t):n.isInitial?kx(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new x:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...Vx(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof S)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=ge(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Vt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return w({...f,failure:f.failure&&{...f.failure,code:ua.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&tb(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,Ub),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(Ub);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Hr(t,Zr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Yr(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!an(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},it=e=>e===-1?[]:[...it(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...it(M.index),e]:it(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>hi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>hi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=E.satisfiesConstraints(e);if(r&&(E.trackStatePossible(e),Ye(t),e.forEach(en)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=E.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=E.satisfiesConstraints(t.state,o);d&&E.trackStatePossible(t.state);let p=d&&E.satisfiesActionConstraints(o,t.state);p&&(E.trackActionPossible(o,t.state),Ye(s),t.state.forEach(en));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:nb(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),re.newStates++),m===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return w(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,Bb(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=E.findViolatedActionProperty(o,t.state);if(_)return w(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},lt={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let ut=D();if(ut)return b(`assumption-violation`,ut);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Wc(me.init,m,e=>{Xb(h.initialStates,t.onProgress);try{lt.result=st(e)}catch(t){let n=f(xe);lt.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return lt.result!==void 0},me.scope)}catch(e){if(e instanceof ne){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Vt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(lt.result)return lt.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let dt=me.next;if(dt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let N=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),ft=(e,t)=>{if(!N)return Kc(dt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+Kc(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},P=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},F=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return P(e,t)}},pt=(e,t)=>{let n=f(()=>F(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},mt=e=>Ge(Ux(),He(e)),ht=(e,t,n)=>{if(c(e))return mt(t);let r=pt(t,n);return Ge(Ex(e),Bb(He(t),r.lines),{isNextState:!0,...r.result})},gt=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=ft(a,(e,n)=>{try{lt.result=ct(t,e,r,l,n)}catch(n){if(c(n))return lt.result=mt(t),!0;let i=g?f(()=>Se(t)):pt(t,r);if(g&&n instanceof y&&!jx.has(n))return lt.result=Ge(new y(`${Lx(n)}${n.message}`,n),Bb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>Yr(e)!==void 0)&&n instanceof y?Vx(ba(n)?new y(`${Ix}${n.message}`):n,!0):void 0;lt.result=Ge(n,Bb(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return lt.result!==void 0});M.isExpanding=!1;let d=lt.result;if(d?.violation&&!g){let e=f(()=>F(t,r));return{...d,violation:Bb(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:P(t,r)}}}),i=e.violation?{...e,violation:Bb(e.violation,n.lines)}:e,a=w(i,n.result.isFailed?ae():C());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${ba(i)?Ix:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},_t=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:ua.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=_l(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:ua.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${$c(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},vt=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&tb(d.result,t.version),warning:p?_t():void 0},()=>c===l?de(o[o.length-1]):d.result?Ny(d.result):Kh(ze(u,c)?.action))},yt=k!==void 0&&t.livenessCheck!==`final`,bt=performance.now(),xt={at:bt+3e3,size:1,time:0},St=e=>{let n=performance.now();if(!((e-xt.size)/xt.size>.1)||xt.time>(n-bt)*.2||(xt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),xt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{lt.result=gt(e,n)}catch(t){lt.result=t instanceof ee?Ke(e,t):ht(t,e,n)}if(lt.result)return lt.result;if(te[ie()]++,re.newStates=0,(yt||t.onProgress)&&performance.now()>=xt.at){xt.at=performance.now()+6e4;let n=yt?St(e+1):void 0;if(k&&n)return vt(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let Ct=k?.findViolation();if(k&&Ct)return vt(k,Ct);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return T()},Gx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Kx=(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^ii(e[t]),1540483477);t[0]=Gx(n)||1,t[1]=Gx(r)},qx=()=>{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)}}},Jx=(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}},Yx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Xx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Jx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Zx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Qx=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Jx(t,n);return{slots:t,used:e.used}},$x=[void 0,`lambda`,`tuple`,`record`],eS=()=>{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=Lr(e.domain);return t?(r(7),r($x.indexOf(Kt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r($x.indexOf(Kt(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})}},tS=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 Vt(t.strings[n[r.index++]]);if(e===5)return Ht(i(n[r.index++]));let a=$x[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Zn({kind:`Interval`,low:e,high:e+t-1});return Gt(Ut(o,i(t)),a)}let o=n[r.index++],s=i(o);return Gt(Ut(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Be}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return Tp}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Ca}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Hm}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return $p}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Zp}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return qc}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return _i}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Ta}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return jt}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return hi}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return da}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return el}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return Du}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return tm}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Gc}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Ye}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return pa}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return ev}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Um}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return ya}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Ea}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return vi}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return kt}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Dt}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return at}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return jb}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return o}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Qx}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return v}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return Q_}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Kx}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return ae}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return wx}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return xe}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Xb}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Rb}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Lb}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Yx}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return w}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return Zd}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return em}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return Hx}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Fb}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return ie}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return eS}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Xx}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Zb}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return C}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return z}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return qx}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Zx}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return tS}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return Ce}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Tx}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return zb}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Vm}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return tv}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return hv}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return n}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return Sa}});
|
|
1768
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.G(new e.m(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.U.safetyEvaluationFailure)}return[{name:t,expression:$v(t),scope:void 0}]})},cy=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>cy(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=rl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return cy(n.body,t)}return[e]},ly=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||Dv(i,t.scope,n)>0)return!1;let a=H(i,wy(n,void 0,void 0,t.scope));if(a===!1)throw new e.m(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.m(`The operator ${i.name}, which equals ${L(a)},\ncannot be used as a ${r}`);return!0},uy=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return ry(t,e,n),$v(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new e.m(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=ty(`name`,t.specification,n),s=ny(t.specification,o,n);if(s!==void 0)throw new e.m(`The value of ${t.specification} is equal to ${L(s)}`);if(Av(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(ly(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.G(new e.m(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.U.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){i.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Dv(s.expression,o.scope,n)<2)throw e.G(new e.g(`TLC cannot handle the temporal formula ${Lc(s.expression)}`),e.U.error);let c=Dv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.m(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.m(`The specification ${t.specification} must contain at most one [][Next]_vars`);let c=[...r,...i],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:r.length===0?void 0:{kind:`And`,operands:r.map(d),location:Qv},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},dy=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=iy(`property`,t,n);if(!a)return;Dv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;Av(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(ly(r,n,`property`))return;let o=r.name??t;if(a.kind===`Always`&&a.expression.kind===`BoxAction`){i.actionProperties.push({name:o,box:a.expression,action:a.expression.action,subscript:a.expression.subscript,scope:r.scope});return}if(a.kind===`Always`&&Dv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!D(e)?rl(e.name,n):void 0;i.invariants.push({name:t?.name??(e.kind===`Identifier`?e.name:o),expression:e,scope:r.scope});return}let s=Dv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2)throw new e.m(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},fy=(e,t,n)=>t.flatMap(t=>iy(e,t,n)?[{name:t,expression:$v(t),scope:void 0}]:[]),py=(e,t)=>{let n=rl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},my=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.m(`_POSSIBLE lists ${r} more than once`);ry(`possible`,r,n);let a=$v(r);if(Dv(a,void 0,n)===3)throw new e.m(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:r,expression:a,scope:void 0}}),hy=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||D(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},gy=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=rl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},_y=(e,t)=>e.flatMap(e=>cy(e.expression,t).map(n=>{let r=e.scope===void 0?ca(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:hy(n,r,t),predicate:gy(e.expression,t)}})),vy=(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},yy=/[\u0100-\uffff]/,by=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),xy=e=>e.kind===`String`?yy.test(e.value):e.kind===`Set`&&e.elements.some(xy),Sy=e=>e.kind===`String`&&yy.test(e.value)||e.kind===`Apply`&&by.has(e.operator)||E(e).some(Sy),Cy=(e,t)=>e.constants.some(e=>xy(e.value)||(e.args??[]).some(xy))||[...t.definitions.values()].some(e=>Sy(e.body)||e.kind===`Function`&&e.bounds.some(e=>Sy(e.set))),wy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Ty=(e,t,n)=>nl(H(e,t),n),Ey=(t,n,r=Dy)=>{let i=H(t,n);if(typeof i!=`boolean`)throw new e.g(r(t,n.environment));return i},Dy=(e,t)=>{let n=e.kind===`Identifier`?rl(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`?Ic(i):Rc(r)}`},Oy=(e,t)=>Ey(e.expression,t,(n,r)=>(Ey(e.predicate,t),Dy(n,r))),ky=()=>{},Ay=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Ty(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),jy=(t,n,r)=>{try{return Ty(t,wy(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e.g)return{message:t.message};throw t}},My=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=jy(n.expression,t,`an assumption`);if(e)return{name:Lc(n.expression),trace:[],message:e.message}}},Ny=(t,n,r,i)=>{let a=sy(t.invariants,n),o=uy(t,n),s=dy(t,n,i),c=_y([...a,...s.invariants],n),l=[...new Map(c.map(e=>[e.predicate,e])).values()],u=c.length>0||s.actionProperties.length>0||s.liveness.length>0;if(o.init===void 0&&(u||s.initialPredicates.length>0||n.variables.length>0))throw new e.m(n.runtime.version===`1.7.4`?Ii:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.m(`The configuration file did not specify the next state predicate.`);let d=_y(fy(`constraint`,t.constraints,n),n),f=fy(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&ty(`rlreward`,t.rlReward,n),t.periodic!==void 0&&ty(`periodic`,t.periodic,n);let p=my(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:Vv(t.symmetry,n,t.substitutions);t.view!==void 0&&ty(`view function`,t.view,n);let h=t.view===void 0?void 0:{name:t.view,expression:$v(t.view),scope:void 0},ee=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Qv};return{...e,unchanged:t}}),te=e=>Dv(e.expression,void 0,n)>=2,g=p.filter(e=>!te(e)),ne=p.filter(te),_=n.runtime,re={indices:void 0},v=()=>{if(re.indices)return re.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return re.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),re.indices},y=(e,t)=>H(e,wy(n,t,void 0)),ie=e=>{let t=v(),n=m===void 0?e:Zv(e,m,t);return Up(h===void 0?t.map(e=>n[e]):[y(h.expression,n)])},ae=Cy(t,n);_.getFingerprint=ie;let oe=()=>{let e=p.find(e=>!_.possibleCounts.get(e.name));if(!e)return;let t=py(e.name,n),r=t?` at ${Ic(t)}`:``;return{name:e.name,code:Mi.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:Me(L(mm(_),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:v,getStoredFingerprints:(e,t)=>{if(h!==void 0||ae)return BigInt64Array.from(e,ie);let n=new BigInt64Array(t.length),r=Kp(v(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(ie(e))];let t=m===void 0?e:Zv(e,m,v());return h===void 0?t:[y(h.expression,t)]},findViolatedInvariant:(t,r)=>c.find(i=>{if(vy(i,t,r))return!1;try{let e=wy(n,t,void 0,i.scope),a=i.membership;return r&&a?!$n(t[a.variable],r[a.variable],H(a.set,e)):!Oy(i,e)}catch(t){throw r?Xi(e.G(t,e.U.safetyEvaluationFailure),Mi.invariantEvaluationFailed,`Evaluating invariant ${i.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Ey(n,wy(t,e,void 0,r));d.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)=>(!(!(d.every(e=>Ey(e.predicate,wy(n,t,void 0,e.scope)))&&f.every(r=>Ey(r.expression,wy(n,e,t,r.scope))))||r())||l.every(e=>Ey(e.predicate,wy(n,t,void 0,e.scope))))&&ee.every(r=>Ey(r.box,wy(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>vy(r,e,t)||Oy(r,wy(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!Ey(t.expression,wy(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>ee.find(r=>{try{return!Ey(r.action,wy(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Lc(r.box)}`)&&!Ty(r.unchanged,wy(n,e,t,r.scope),`a subscript`)}catch(e){throw Xi(Py(e),Mi.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>Ey(i.expression,wy(n,t,r),t=>`${e.N}${Dy(t,n)}`)),trackStatePossible:g.length===0?ky:e=>Ay(g,_,wy(n,e,void 0)),trackActionPossible:ne.length===0?ky:(e,t)=>Ay(ne,_,wy(n,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=rl(e,n);return t!==void 0&&n.definitionValues.has(t)});if(i!==void 0){if(r)return;throw e.G(new e.g(`${e.N}The post condition ${i} cannot be a constant.`),e.U.error)}let a=oe();if(a)return a;for(let e of t.postconditions){let t=jy($v(e),n,`a postcondition`);if(!t)continue;let r=py(e,n),i=r?` at ${Ic(r)}`:``;return t.message===void 0?{name:e,code:Mi.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Mi.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},Py=t=>t instanceof e.S?e.G(t,t.exitCode):t,Fy=(e,t)=>e*((t-e)/2**64),Iy=e=>e.includes(`.`)?e:`${e}.0`,Ly=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Iy(String(e));let[n,r]=e.toExponential().split(`e`);return`${Iy(n)}E${r.replace(`+`,``)}`},Ry=e=>e!==void 0&&e>=`0`&&e<=`9`,zy=e=>{if(e===0)return`0.0`;let t=Ly(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Ry(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(;Ry(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Ry(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Ry(t[n.next])&&Number(t[n.next])>=5&&(n.result=By(n.result));Ry(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},By=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${By(r)}.`:n===`9`?`${By(r)}0`:`${r}${Number(n)+1}`},Vy=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}`)},Hy=(e,t,n)=>{if(Fy(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},Uy=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}).`},Wy=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Gy=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^xr(e[t]),16777619),r=Math.imul(r^Or(e[t]),1540483477);t[0]=Wy(n)||1,t[1]=Wy(r)},Ky=()=>{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)}}},qy=(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}},Jy=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Yy=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return qy(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Xy=e=>Atomics.load(e.used,0)*2>=e.slots.length,Zy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&qy(t,n);return{slots:t,used:e.used}},Qy=[void 0,`lambda`,`tuple`,`record`],$y=()=>{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=sr(e.domain);return t?(r(7),r(Qy.indexOf(ft(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Qy.indexOf(ft(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})}},eb=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 st(t.strings[n[r.index++]]);if(e===5)return ct(i(n[r.index++]));let a=Qy[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=_n({kind:`Interval`,low:e,high:e+t-1});return dt(lt(o,i(t)),a)}let o=n[r.index++],s=i(o);return dt(lt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return Ic}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return X_}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return yn}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Up}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return Je}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Nv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return Zi}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return G_}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Mv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return Et}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return gh}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Qe}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return tp}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return xe}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return kp}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return _h}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return xr}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return tu}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return d}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return Dd}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return Se}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return vm}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return k}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return R_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return w_}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return yr}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return bn}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return C_}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return br}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return vl}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return _m}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Ct}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return xv}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return Hi}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Dv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return fr}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return jp}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return E}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Dp}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return Xe}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return Ap}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return D}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Lc}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return te}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return Au}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return ry}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Ji}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Zy}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return zl}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return oy}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return aa}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Gy}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Oc}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Hy}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Is}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return rl}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Fy}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Mi}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return My}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return Ny}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Wi}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Jy}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Xc}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return _v}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return zr}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return bv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return nn}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return zy}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Ac}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return $v}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Fi}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return $y}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return sl}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Yy}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Dc}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Uy}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Ni}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return ru}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return he}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Ky}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return mu}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Xy}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return kc}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return eb}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return hu}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Vy}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Fs}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return wy}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return qi}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Pv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return na}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return Py}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return ta}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return ay}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return Vi}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return ym}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return bt}});
|