tla-ts 0.0.9 → 0.0.10-dev.63a6693bd

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.
Files changed (400) hide show
  1. package/README.md +29 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +29 -29
  5. package/dist/deciders.js +42 -42
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +106 -10
  8. package/dist/index.d.ts +106 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +117 -37
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +129 -104
  21. package/dist/transfer.js +129 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +48 -62
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +599 -754
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +14 -25
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +361 -0
  40. package/src/cli/tlc.ts +309 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +14 -53
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +169 -335
  51. package/src/errors.ts +71 -55
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +37 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +80 -100
  63. package/src/liveness-checker.ts +103 -153
  64. package/src/liveness.ts +150 -109
  65. package/src/obligations/action.ts +8 -39
  66. package/src/obligations/anonymize.ts +88 -82
  67. package/src/obligations/equality.ts +1 -1
  68. package/src/obligations/expression.ts +20 -21
  69. package/src/obligations/format.ts +1 -9
  70. package/src/obligations/generate.ts +46 -49
  71. package/src/obligations/index.ts +2 -13
  72. package/src/obligations/levels.ts +4 -8
  73. package/src/obligations/module.ts +28 -53
  74. package/src/obligations/normalize.ts +7 -25
  75. package/src/obligations/operators.ts +1 -2
  76. package/src/obligations/pragma.ts +1 -10
  77. package/src/obligations/printer.ts +47 -46
  78. package/src/obligations/proof.ts +1 -5
  79. package/src/obligations/regroup.ts +1 -4
  80. package/src/obligations/simplify.ts +42 -58
  81. package/src/obligations/source.ts +48 -78
  82. package/src/obligations/subexpression.ts +5 -11
  83. package/src/obligations/substitution.ts +1 -3
  84. package/src/obligations/temporal.ts +13 -19
  85. package/src/obligations/tuples.ts +3 -9
  86. package/src/parallel-worker.ts +30 -60
  87. package/src/parallel.ts +57 -71
  88. package/src/parser.ts +584 -316
  89. package/src/pcal/ast.ts +53 -86
  90. package/src/pcal/parse.ts +144 -219
  91. package/src/pcal/tokenize.ts +91 -131
  92. package/src/pcal/translate.ts +83 -130
  93. package/src/pcal/validate.ts +48 -68
  94. package/src/pretty-print.ts +7 -8
  95. package/src/prover/decide-pool.ts +8 -13
  96. package/src/prover/deciders.ts +3 -7
  97. package/src/prover/first-order.ts +0 -11
  98. package/src/prover/isabelle/decide.ts +0 -6
  99. package/src/prover/isabelle/encode.ts +11 -23
  100. package/src/prover/isabelle/isar/inner-syntax.ts +114 -115
  101. package/src/prover/isabelle/isar/method.ts +29 -53
  102. package/src/prover/isabelle/isar/proof.ts +1 -10
  103. package/src/prover/isabelle/isar/statement.ts +1 -6
  104. package/src/prover/isabelle/isar/theory.ts +26 -36
  105. package/src/prover/isabelle/isar/type-check.ts +17 -31
  106. package/src/prover/isabelle/provers/blast/blast.ts +17 -104
  107. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  108. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  109. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  110. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  111. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  112. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  113. package/src/prover/isabelle/provers/classical.ts +14 -42
  114. package/src/prover/isabelle/provers/hypsubst.ts +28 -51
  115. package/src/prover/isabelle/pure/bicompose.ts +25 -38
  116. package/src/prover/isabelle/pure/consts.ts +1 -7
  117. package/src/prover/isabelle/pure/conv.ts +3 -17
  118. package/src/prover/isabelle/pure/drule.ts +33 -42
  119. package/src/prover/isabelle/pure/envir.ts +3 -52
  120. package/src/prover/isabelle/pure/goal.ts +1 -7
  121. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  122. package/src/prover/isabelle/pure/list.ts +0 -3
  123. package/src/prover/isabelle/pure/logic.ts +2 -15
  124. package/src/prover/isabelle/pure/name.ts +2 -9
  125. package/src/prover/isabelle/pure/net.ts +3 -59
  126. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  127. package/src/prover/isabelle/pure/pattern.ts +2 -19
  128. package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
  129. package/src/prover/isabelle/pure/rewriter.ts +31 -67
  130. package/src/prover/isabelle/pure/search.ts +3 -10
  131. package/src/prover/isabelle/pure/seq.ts +1 -10
  132. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  133. package/src/prover/isabelle/pure/table.ts +3 -32
  134. package/src/prover/isabelle/pure/tactic.ts +12 -22
  135. package/src/prover/isabelle/pure/tactical.ts +48 -47
  136. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  137. package/src/prover/isabelle/pure/term.ts +2 -43
  138. package/src/prover/isabelle/pure/thm.ts +27 -47
  139. package/src/prover/isabelle/pure/type.ts +2 -15
  140. package/src/prover/isabelle/pure/unify.ts +20 -30
  141. package/src/prover/isabelle/pure/variable.ts +3 -7
  142. package/src/prover/isabelle/tla/classical-setup.ts +17 -24
  143. package/src/prover/isabelle/tla/context.ts +15 -18
  144. package/src/prover/isabelle/tla/logic.ts +14 -32
  145. package/src/prover/isabelle/tla/simpdata.ts +46 -43
  146. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  147. package/src/prover/ocaml.ts +0 -6
  148. package/src/prover/prep/action.ts +14 -54
  149. package/src/prover/prep/enabled-axioms.ts +12 -19
  150. package/src/prover/prep/fingerprint.ts +2 -21
  151. package/src/prover/prep/level-comparison.ts +8 -12
  152. package/src/prover/prep/md5.ts +0 -2
  153. package/src/prover/prep/methods.ts +33 -39
  154. package/src/prover/prep/normalize.ts +4 -28
  155. package/src/prover/prove-worker.ts +0 -2
  156. package/src/prover/prove.ts +87 -100
  157. package/src/prover/ptl/decide.ts +7 -12
  158. package/src/prover/ptl/encode.ts +14 -36
  159. package/src/prover/ptl/sat.ts +24 -32
  160. package/src/prover/ptl/tableau.ts +12 -26
  161. package/src/prover/smt/axioms.ts +0 -7
  162. package/src/prover/smt/context.ts +20 -28
  163. package/src/prover/smt/data.ts +433 -424
  164. package/src/prover/smt/encode.ts +43 -52
  165. package/src/prover/smt/extensionality.ts +0 -10
  166. package/src/prover/smt/flatten.ts +3 -22
  167. package/src/prover/smt/format.ts +5 -10
  168. package/src/prover/smt/instances.ts +0 -10
  169. package/src/prover/smt/rewrite.ts +663 -667
  170. package/src/prover/smt/solver/act-cache.ts +0 -15
  171. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  172. package/src/prover/smt/solver/array.ts +1 -3
  173. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  174. package/src/prover/smt/solver/ast-lt.ts +1 -11
  175. package/src/prover/smt/solver/ast-util.ts +1 -6
  176. package/src/prover/smt/solver/ast.ts +1 -165
  177. package/src/prover/smt/solver/auf-solver.ts +8 -44
  178. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  179. package/src/prover/smt/solver/cg-table.ts +1 -18
  180. package/src/prover/smt/solver/clause.ts +1 -27
  181. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  182. package/src/prover/smt/solver/context.ts +7 -64
  183. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  184. package/src/prover/smt/solver/der.ts +2 -21
  185. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  186. package/src/prover/smt/solver/e-matching.ts +4 -35
  187. package/src/prover/smt/solver/enode.ts +1 -21
  188. package/src/prover/smt/solver/expr-ref.ts +1 -5
  189. package/src/prover/smt/solver/expr-safe-replace.ts +1 -6
  190. package/src/prover/smt/solver/fingerprints.ts +1 -12
  191. package/src/prover/smt/solver/flat-literals.ts +1 -9
  192. package/src/prover/smt/solver/goal.ts +2 -14
  193. package/src/prover/smt/solver/hash.ts +0 -8
  194. package/src/prover/smt/solver/hashtable.ts +1 -12
  195. package/src/prover/smt/solver/internalizer.ts +7 -100
  196. package/src/prover/smt/solver/lbool.ts +1 -2
  197. package/src/prover/smt/solver/literal.ts +0 -3
  198. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  199. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  200. package/src/prover/smt/solver/lp/containers.ts +12 -30
  201. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  202. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  203. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  204. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  205. package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
  206. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  207. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  208. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  209. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  210. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  211. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  212. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  213. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  214. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  215. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  216. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  217. package/src/prover/smt/solver/lp/nex.ts +1 -6
  218. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  220. package/src/prover/smt/solver/lp/nla-core.ts +36 -135
  221. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  222. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  223. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  224. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  225. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  226. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  227. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  228. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  229. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  230. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  231. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  232. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  233. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  234. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  235. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  236. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  237. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  238. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  239. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  240. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  241. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  242. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  243. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  244. package/src/prover/smt/solver/mam-compiler.ts +18 -58
  245. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  246. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  247. package/src/prover/smt/solver/model-checker.ts +3 -37
  248. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  249. package/src/prover/smt/solver/model-finder.ts +15 -32
  250. package/src/prover/smt/solver/model-generator.ts +1 -12
  251. package/src/prover/smt/solver/model-macro-solver.ts +23 -88
  252. package/src/prover/smt/solver/nlsat/algebraic.ts +63 -159
  253. package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
  254. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  255. package/src/prover/smt/solver/nlsat/explain.ts +10 -69
  256. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  257. package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
  258. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  259. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -159
  260. package/src/prover/smt/solver/nlsat/solver.ts +18 -90
  261. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  262. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
  263. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  264. package/src/prover/smt/solver/nnf.ts +3 -38
  265. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  266. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  267. package/src/prover/smt/solver/propagate-values.ts +1 -10
  268. package/src/prover/smt/solver/proto-model.ts +3 -52
  269. package/src/prover/smt/solver/pull-quant.ts +1 -12
  270. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  271. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  272. package/src/prover/smt/solver/qe-lite.ts +3 -33
  273. package/src/prover/smt/solver/qi-queue.ts +1 -16
  274. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  275. package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
  276. package/src/prover/smt/solver/quantifier-manager.ts +2 -13
  277. package/src/prover/smt/solver/random-gen.ts +1 -2
  278. package/src/prover/smt/solver/rational.ts +1 -8
  279. package/src/prover/smt/solver/ref-vector.ts +1 -6
  280. package/src/prover/smt/solver/relevancy.ts +2 -15
  281. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  282. package/src/prover/smt/solver/rewriter.ts +3 -85
  283. package/src/prover/smt/solver/rlimit.ts +2 -20
  284. package/src/prover/smt/solver/smtlib-parser.ts +80 -131
  285. package/src/prover/smt/solver/solver.ts +23 -34
  286. package/src/prover/smt/solver/sort.ts +1 -5
  287. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  288. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  289. package/src/prover/smt/solver/theory-lra-bounds.ts +1 -7
  290. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  291. package/src/prover/smt/solver/theory-lra-internalize.ts +6 -43
  292. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  293. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  294. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  295. package/src/prover/smt/solver/theory-lra.ts +1 -8
  296. package/src/prover/smt/solver/var-subst.ts +2 -26
  297. package/src/prover/smt/table.ts +0 -8
  298. package/src/prover/tlapm/cache.ts +45 -40
  299. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  300. package/src/prover/tlapm/tlapm.ts +21 -20
  301. package/src/prover/verdict.ts +7 -2
  302. package/src/prover/zenon/check/check.ts +1 -11
  303. package/src/prover/zenon/check/definitions.ts +5 -15
  304. package/src/prover/zenon/check/equality.ts +0 -8
  305. package/src/prover/zenon/check/functions.ts +0 -4
  306. package/src/prover/zenon/check/keys.ts +0 -7
  307. package/src/prover/zenon/check/propositional.ts +0 -3
  308. package/src/prover/zenon/check/records.ts +1 -6
  309. package/src/prover/zenon/check/relations.ts +2 -14
  310. package/src/prover/zenon/check/rewrites.ts +2 -21
  311. package/src/prover/zenon/check/sets.ts +40 -61
  312. package/src/prover/zenon/check/terms.ts +1 -19
  313. package/src/prover/zenon/check/tla.ts +0 -6
  314. package/src/prover/zenon/decide.ts +0 -12
  315. package/src/prover/zenon/encode.ts +1 -8
  316. package/src/prover/zenon/eqrel.ts +2 -13
  317. package/src/prover/zenon/equality-rules.ts +0 -4
  318. package/src/prover/zenon/expr.ts +8 -26
  319. package/src/prover/zenon/index-table.ts +26 -57
  320. package/src/prover/zenon/isar-case.ts +9 -19
  321. package/src/prover/zenon/isar.ts +36 -64
  322. package/src/prover/zenon/limits.ts +0 -4
  323. package/src/prover/zenon/llproof.ts +2 -20
  324. package/src/prover/zenon/mltoll.ts +66 -104
  325. package/src/prover/zenon/node.ts +1 -11
  326. package/src/prover/zenon/ocaml.ts +1 -17
  327. package/src/prover/zenon/parse.ts +4 -12
  328. package/src/prover/zenon/phrase.ts +1 -11
  329. package/src/prover/zenon/proof.ts +0 -9
  330. package/src/prover/zenon/propositional-rules.ts +0 -5
  331. package/src/prover/zenon/rules.ts +2 -6
  332. package/src/prover/zenon/search.ts +5 -31
  333. package/src/prover/zenon/tla/functions.ts +59 -31
  334. package/src/prover/zenon/tla/llproof.ts +67 -76
  335. package/src/prover/zenon/tla/records.ts +57 -33
  336. package/src/prover/zenon/tla/rewrites.ts +12 -19
  337. package/src/prover/zenon/tla/sets.ts +83 -53
  338. package/src/prover/zenon/tla/terms.ts +0 -6
  339. package/src/prover/zenon/tla/tla.ts +66 -64
  340. package/src/randomization.ts +81 -35
  341. package/src/resolve.ts +67 -184
  342. package/src/runtime.ts +22 -22
  343. package/src/sany/builtins.ts +2 -5
  344. package/src/sany/generation.ts +394 -0
  345. package/src/sany/generator-def-entries.ts +210 -0
  346. package/src/sany/generator-definitions.ts +686 -0
  347. package/src/sany/generator-expressions.ts +1100 -0
  348. package/src/sany/generator-proofs.ts +662 -0
  349. package/src/sany/generator.ts +191 -2764
  350. package/src/sany/levels.ts +6 -34
  351. package/src/sany/lexer.ts +58 -77
  352. package/src/sany/linter.ts +1 -9
  353. package/src/sany/modules.ts +1 -5
  354. package/src/sany/nodes.ts +5 -43
  355. package/src/sany/parse-error.ts +39 -117
  356. package/src/sany/report.ts +32 -69
  357. package/src/sany/selectors.ts +49 -76
  358. package/src/sany/source.ts +1 -17
  359. package/src/sany/xml.ts +35 -117
  360. package/src/search.ts +541 -163
  361. package/src/simulate.ts +709 -0
  362. package/src/spec-description.ts +192 -100
  363. package/src/standard-definitions.ts +0 -4
  364. package/src/standard-modules.ts +264 -95
  365. package/src/state-graph.ts +52 -31
  366. package/src/subexpressions.ts +69 -52
  367. package/src/substitution-levels.ts +7 -7
  368. package/src/successors.ts +266 -99
  369. package/src/symmetry.ts +33 -25
  370. package/src/tableau.ts +27 -24
  371. package/src/tlc/fingerprint.ts +183 -67
  372. package/src/tlc/jar-data.ts +112 -6
  373. package/src/tlc/messages.ts +125 -54
  374. package/src/tlc/order.ts +39 -69
  375. package/src/tlc/random.ts +37 -49
  376. package/src/tlc/replay.ts +553 -228
  377. package/src/tlc/summary.ts +36 -47
  378. package/src/tlc/tlc-operators.ts +78 -44
  379. package/src/tlc/tlcext-operators.ts +139 -122
  380. package/src/tlc/trace-spec.ts +249 -0
  381. package/src/tlc/value-stream.ts +139 -0
  382. package/src/tlc/version.ts +1 -4
  383. package/src/transfer.ts +22 -25
  384. package/src/typescript/actions.ts +479 -0
  385. package/src/typescript/collections.ts +614 -0
  386. package/src/typescript/compile.ts +63 -0
  387. package/src/typescript/context.ts +94 -0
  388. package/src/typescript/emit.ts +121 -0
  389. package/src/typescript/expressions.ts +496 -0
  390. package/src/typescript/formula.ts +154 -0
  391. package/src/typescript/functions.ts +284 -0
  392. package/src/typescript/model.ts +162 -0
  393. package/src/typescript/names.ts +114 -0
  394. package/src/typescript/program.ts +48 -0
  395. package/src/typescript/properties.ts +139 -0
  396. package/src/typescript/scope.ts +112 -0
  397. package/src/typescript/steps.ts +167 -0
  398. package/src/typescript/types.ts +171 -0
  399. package/src/values.ts +832 -484
  400. package/src/worker.ts +7 -8
package/dist/transfer.cjs CHANGED
@@ -6,89 +6,23 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- 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=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),s=e=>e.startsWith(`\\`)?parseInt(e.slice(2),o.get(e[1].toLowerCase())):Number(e),c=/-{4,}[ \t]*MODULE\b/,l=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)l[n.charCodeAt(0)]|=e});const u=(e,t)=>e<128&&(l[e]&t)!==0,d=(e,t,n)=>{let r=t;for(;u(e.charCodeAt(r),n);)r++;return r},f=/* @__PURE__ */ new Map;i.forEach(e=>{let t=e.charCodeAt(0),n=f.get(t)??[];n.push(e),f.set(t,n)});const p=(e,t)=>{let n=f.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},m=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(a.has(n))return n;let r=e[t];return a.has(r)?r:void 0},ee=(e,t)=>{let i=e.charCodeAt(t);if(i===92&&u(e.charCodeAt(t+1),2)){let r=e.slice(t+1,d(e,t+1,2)),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 o=m(e,t);if(o!==void 0)return{text:a.get(o)??``,length:o.length};let s=p(e,t);return s?{text:r.get(s)??s,length:s.length}:i===92?{text:`\\`,length:1}:void 0},te=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),ne=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>a.has(e)||te.has(e));return n===void 0?void 0:{text:n,length:n.length}},h=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},g=(e,t)=>{let n=e[t+1]===`+`||e[t+1]===`*`?t+2:d(e,t+1,1);if(n===t+1||e[n]!==`>`)return 0;let r=d(e,n+1,7),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return h(e,i?r+1:r,e=>e===`.`)-t},re=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,ie={n:`
10
- `,t:` `,r:`\r`,f:`\f`},_=(e,t)=>t===9?e+8-e%8:e+1,ae=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),oe=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=ae.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=d(e,t+2,n);return r===t+2?0:r-t},se=n=>{let r=c.exec(n);if(!r)throw new e.O(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,o=n.slice(0,r.index).split(`
11
- `),s={index:r.index,line:o.length,lineStart:r.index-o[o.length-1].length,moduleDepth:0},l={lineStart:-1,position:0,width:0},f=()=>{for((l.lineStart!==s.lineStart||l.position>s.index)&&(l.lineStart=s.lineStart,l.position=s.lineStart,l.width=0);l.position<s.index;l.position++)l.width=_(l.width,n.charCodeAt(l.position));return _(l.width,n.charCodeAt(s.index))},p=(e,t,n,r)=>{let a=f();i.push({kind:e,text:t,spelling:r,line:s.line,column:a,endColumn:a+n-1}),s.index+=n},m=e=>{for(let t=0;t<e;t++)n.charCodeAt(s.index)===10&&(s.line++,s.lineStart=s.index+1),s.index++},ne=t=>new e.O(`${t} at line ${s.line}, column ${f()}`,void 0,{reason:t,line:s.line,column:f(),isEnd:s.index>=n.length});for(;s.index<n.length;){let e=n.charCodeAt(s.index);if(e===10||e===32||e===9||e===13){m(1);continue}if(e===92&&n.charCodeAt(s.index+1)===42){let e=n.indexOf(`
12
- `,s.index);m((e===-1?n.length:e)-s.index);continue}if(e===40&&n.charCodeAt(s.index+1)===42){let e={value:0};do{if(s.index>=n.length)throw ne(`Unterminated comment`);n.startsWith(`(*`,s.index)?(e.value++,m(2)):n.startsWith(`*)`,s.index)?(e.value--,m(2)):m(1)}while(e.value>0);continue}if(e===45&&n.startsWith(`----`,s.index)){let e=h(n,s.index,e=>e===`-`)-s.index;n.slice(s.index+e).trimStart().startsWith(`MODULE`)&&s.moduleDepth++,p(`Separator`,`----`,e);continue}if(e===61&&n.startsWith(`====`,s.index)){if(p(`ModuleEnd`,`====`,h(n,s.index,e=>e===`=`)-s.index),s.moduleDepth--,s.moduleDepth<=0)break;continue}if(e===34){let e=s.line,t=f(),r=[];for(m(1);n.charCodeAt(s.index)!==34;){let e=n.charCodeAt(s.index);if(s.index>=n.length||e===10||e===13)throw ne(`Unterminated string`);if(e===92){let e=n[s.index+1];if(e===void 0||!`ntrf\\"`.includes(e))throw ne(`Invalid escape in string`);r.push(ie[e]??e),m(2)}else r.push(n[s.index]),m(1)}m(1),i.push({kind:`String`,text:r.join(``),line:e,column:t,endColumn:f()-1});continue}let r=oe(n,s.index);if(r>0){p(`Number`,n.slice(s.index,s.index+r),r);continue}if(u(e,7)){let r=d(n,s.index,7),i=n.slice(s.index,r),o=d(n,s.index,1);if(o===r){let e=n.charCodeAt(r)===46?d(n,r+1,1):r,t=e>r+1,a=t?n.slice(s.index,e):i;p(t?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let t=e===95?`_`:n.slice(s.index,o);p(t===`_`?`Operator`:`Number`,t,t.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){p(`Keyword`,i.slice(0,3),3);continue}let c=a.get(i)??i;a.set(c,c),p(t.has(i)?`Keyword`:`Identifier`,c,i.length);continue}let o=n[s.index];if(e>=128&&te.has(o)){p(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(e===60){let e=g(n,s.index);if(e>0){p(`Step`,n.slice(s.index,s.index+e),e);continue}}let c=ee(n,s.index);if(c){let e=n.slice(s.index,s.index+c.length);p(`Operator`,c.text,c.length,e===c.text?void 0:e)}else throw ne(`Unexpected character ${JSON.stringify(o)}`)}let re=f();return i.push({kind:`End`,text:``,line:s.line,column:re,endColumn:re}),i},ce=[[`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`]],le=ce.map(e=>e[0]),ue=new Map(le.map((e,t)=>[e,t]).reverse()),v=t=>{let n=ue.get(t);if(n===void 0)throw new e.g(`Unknown SANY token kind ${t}`);return n},y=new Map(ce.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),de=Math.max(...[...y.keys()].map(e=>e.length)),fe=Array.from({length:de},(e,t)=>de-t),pe=/----+ *MODULE/y,b=[/_\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],x=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`)),S=x(String.raw`\.\/\\`),C=x(String.raw`\.\\\/`),me=String.raw`<(?:[0-9]+|\+|\*)>`,he=[[`_BM0`,[pe]],[`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`,S],[`BOR`,C],[`IDENTIFIER`,b],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${me}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(me,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${me}(?:\*\.*|-\.*|\.+)`,`y`)]]],ge=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[pe]]],_e=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[pe]],[`BAND`,S],[`BOR`,C],[`IDENTIFIER`,b]],ve=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),ye=(e,t,n)=>e.map(([e,r])=>({kind:v(e),length:Math.max(...r.map(e=>ve(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),w=(e,t)=>{let n=fe.find(n=>y.has(e.slice(t,t+n))),r=ye(he,e,t);if(n===void 0)return r;let i={kind:y.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},T=e=>e+8-e%8,be=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===`
13
- `?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
14
- `?r.isAfterLf=!0:i===` `&&(r.column=T(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},xe=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Se=new Set([...y.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Ce=(e,t)=>{let n=0;for(;Se.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,ve(xe,e,t)))},we=e=>{let t=be(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(v(`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?De(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
- `||e[a]===`\r`?De(o+1,0,void 0,i):De(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=ye(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,le[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),le[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(ge);if(n.mode===`PRAGMA`)return s(_e);for(;n.offset<e.length;){let t=n.offset;if(`
16
- \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=w(e,t);if(i.length===0){let n=Ce(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()}},Te=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ee=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Te.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),De=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ee(n)}" (${n.charCodeAt(0)}), `}after : "${Ee(r)}"`,Oe=e=>{let t=we(e);for(let e=t();typeof e!=`string`&&e.kind!==v(`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===` `?T(e):e+1,e.beginColumn);return De(e.beginLine,n,e.image[t],e.image.slice(0,t))}},ke=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:[])}},E=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ae=`-------------------------------- MODULE Reals -------------------------------
18
- (***************************************************************************)
19
- (* This module provides dummy definitions of the operators that are *)
20
- (* defined by the real Reals module. It is expected that any tool that *)
21
- (* handles specifications that use real numbers will provide its own *)
22
- (* implementations of these operators. TLC currently does not handle real *)
23
- (* numbers and produces an error if a specification requires TLC to *)
24
- (* evaluate the operators defined here or to evaluate any operator defined *)
25
- (* in the Integers module that is applied to non-integer real numbers. *)
26
- (* *)
27
- (* See the book "Specifying Systems" for the real Reals module. *)
28
- (***************************************************************************)
29
- EXTENDS Integers
30
-
31
- Real == "Reals"
32
- a / b == CHOOSE m \\in Real : m * b = a
33
- Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
34
- =============================================================================`,je=`----------------------------- MODULE RealTime -------------------------------
35
- (***************************************************************************)
36
- (* This standard module is described in Chapter 9 of the book "Specifying *)
37
- (* Systems". The type of specification described there cannot be handled *)
38
- (* by the TLC model checker. *)
39
- (***************************************************************************)
40
- EXTENDS Reals
41
- VARIABLE now
42
-
43
- RTBound(A, v, D, E) ==
44
- LET TNext(t) == t' = IF <<A>>_v \\/ ~(ENABLED <<A>>_v)'
45
- THEN 0
46
- ELSE t + (now'-now)
47
-
48
- Timer(t) == (t=0) /\\ [][TNext(t)]_<<t, v, now>>
49
-
50
- MaxTime(t) == [](t \\leq E)
51
-
52
- MinTime(t) == [][A => t \\geq D]_v
53
- IN \\EE t : Timer(t) /\\ MaxTime(t) /\\ MinTime(t)
54
- -----------------------------------------------------------------------------
55
- RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
56
- /\\ UNCHANGED v
57
- IN /\\ now \\in Real
58
- /\\ [][NowNext]_now
59
- /\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
60
- =============================================================================`,Me=`----------------------------- MODULE Toolbox --------------------------------
61
- (***************************************************************************)
62
- (* *)
63
- (***************************************************************************)
64
- LOCAL INSTANCE Naturals \\* a + b
65
- LOCAL INSTANCE FiniteSets \\* Cardinality
66
- LOCAL INSTANCE TLC \\* TLCGet
67
-
68
- -----------------------------------------------------------------------------
69
-
70
- (* Trace Exploration *)
71
-
72
- _TETrace ==
73
- CHOOSE f \\in [ (Nat \\ {0}) -> STRING ] : TRUE
74
-
75
- LOCAL _TETraceLength == Cardinality(DOMAIN _TETrace)
76
-
77
- \\* When evaluated as part of a TLC ALIAS expression, \`_TEPosition\` should be
78
- \\* redefined as \`TLCGet("level"), or replace with \`TLCGet(level)\` right away.
79
- \\* The definition below accounts for several "peculiarities" of the
80
- \\* Toolbox's trace exploration.
81
- _TEPosition ==
82
- IF TLCGet("level") >= _TETraceLength
83
- THEN _TETraceLength
84
- ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
85
-
86
- =============================================================================`,Ne=/* @__PURE__ */ new Map([[`Reals`,Ae],[`RealTime`,je],[`Toolbox`,Me]]),Pe={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:` `}},Fe=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},Ie=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Le=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Re=e=>{let t=t=>{let n=h(e,t,Fe);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,Ie);if(e.startsWith(`..`,n)&&Ie(e[n+2]))return{kind:`Constant`,first:t,last:h(e,n+2,Ie)-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=Ie(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,Ie)-1,children:[]};if(Le(n))return{kind:`Constant`,first:t,last:h(e,t,Le)-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)},D=e=>{let t=e.length===0?void 0:Re(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=Pe[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 ee=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),te=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return ee===void 0||te===void 0?void 0:`${ee}${s.divider}\n${o}${s.dividerPad}${te}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},ze=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,O=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Be=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`,Ve=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),He=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:O(e)?`set`:`function`,Ue=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,We={isUsed:!1},Ge=(e,t)=>(We.isUsed=!0,e.writtenKeys=t,e),Ke=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[$n(e.domain,t)]]),qe=(e,t,n)=>Ge(kn(e,t),n),Je=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(Je);e.writtenKeys=void 0,e.range.forEach(Je)}},Ye=e=>e.every(e=>typeof e==`string`),Xe=(e,t)=>e.length>0&&t.length>0&&Ye(e)!==Ye(t),Ze=(e,t)=>{We.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Xe(n,r)?Zt(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=ht(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:ht(t,n);if(r!==0)return r}return 0},Qe=(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=ht(n[e],r[e]);if(t!==0)return t}return 0},$e=e=>A(e)?e.type:void 0,et=(t,n,r)=>{let i=$e(t),a=$e(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._(`Attempted to ${o} the differently-typed model values ${I(t)} and ${I(n)}`)}throw i===void 0?new e._(`Attempted to ${o} the typed model value ${I(n)} and the non-model value\n${I(t)}`):new e._(`Attempted to ${o}${r?``:` the`} typed model value ${I(t)} and non-model value\n${I(n)}`)},tt={ranks:Object.create(null),size:0},nt=e=>{tt.ranks=Object.create(null),tt.size=0,gt.clear();for(let t of e)at(t)},rt={is174:!1},it=e=>{rt.is174=e===`1.7.4`},at=e=>(tt.ranks[e]===void 0&&(tt.ranks[e]=tt.size++),e),ot=()=>tt.size,st=e=>Object.keys(tt.ranks).find(t=>tt.ranks[t]===e),ct=e=>tt.ranks[at(e)],lt=(e,t)=>{if(e===t)return 0;let n=tt.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},ut=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),dt=(e,t)=>(ut(e)||ut(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),ft=(t,n,r)=>{if(!ut(t))throw new e._(`Attempted to ${r} the set ${I(M(t)?N(t):t,!0)} with the value:\n${I(n,!0)}`);if(!ut(n))throw new e._(`Attempted to compare overridden value ${I(t,!0)} with non-overridden value:\n${I(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._(`Attempted to compare ${I(t,!0)} with the value\n${I(n,!0)}`)},pt={kind:`InfiniteSet`,name:`Any`},mt=t=>{throw new e._(`Attempted to compare ANY with the value\n${I(t)}`)},ht=(t,n)=>{if(t===n)return We.isUsed&&Je(t),t===pt?mt(t):0;if(typeof t==`object`&&typeof n==`object`){let r=t.kind,i=n.kind;if(r===`Function`&&i===`Function`)return Ze(t,n);if(r===`Set`&&i===`Set`)return Qe(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&&et(t,n,!1),t.rank-n.rank;if(r===`ModelValue`||i===`ModelValue`)return et(t,n,!1),r===`ModelValue`?-1:1;if(t===pt||n===pt)return mt(t===pt?n:t);if(O(t)&&O(n)&&dt(t,n))return ft(t,n,`compare`);let a=O(t);if(a!==O(n))throw new e._(`Attempted to compare ${He(t)} ${I(t)} with ${He(n)} ${I(n)}`);return a?Qe(N(t),N(n)):Ze(F(t),F(n))}if(typeof t==`number`&&typeof n==`number`)return t-n;if(typeof t==`string`&&typeof n==`string`)return lt(t,n);if(typeof t==`boolean`&&typeof n==`boolean`)return t<n?-1:1;if(et(t,n,!1),A(t))return-1;if(A(n))return 1;throw new e._(`Attempted to compare ${He(t)} ${I(t)} with ${He(n)} ${I(n)}`)},gt=/* @__PURE__ */ new Map,_t=e=>{let t=gt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:ct(e),hash:yr(br(xr(e),109)),fingerprint:Ar(jr(e)^60)};return gt.set(e,n),n},vt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),yt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),bt={isPresent:!1},xt=(e,t)=>(t===`lambda`&&(bt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),St=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ct=e=>xt(e,`lambda`),wt=e=>ze(e)&&e.isCached===!0,Tt={isPresent:!1},Et=e=>(Tt.isPresent=!0,e),Dt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Ot=e=>{Tt.isPresent&&typeof e==`object`&&ze(e)&&Dt.has(e.kind)&&(e.isCached=!0)},kt=e=>{(bt.isPresent||Tt.isPresent)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(kt),e.range.forEach(kt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(kt):O(e)&&M(e)&&(Ot(e),N(e).elements.forEach(kt))))},At=(e,t)=>{if(Ot(e),e===t)return We.isUsed&&Je(e),e!==pt||mt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&et(e,t,!0),ht(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 Ze(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Qe(e,t)===0;if(A(e)||A(t))return et(e,t,!0),A(e)&&A(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return At(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=P(e.domain),r=P(t.domain);if(n||r)return n===r;let i=P(e.range),a=P(t.range);return i||a?i===a:At(e.domain,t.domain)&&At(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(P(e))return P(t);if(P(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&At(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return P(e)?P(t):!P(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>At(e,t.factors[n]));let n=O(e)&&O(t)&&!(M(e)&&M(t));if(n&&dt(e,t))return ft(e,t,`check equality of`)===0;if(n){if(!ut(e)){let n=N(e);if(!ut(t))return Qe(n,N(t))===0}return Ir(e)===Ir(t)}return ht(e,t)===0},jt=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):Ir(n)===Ir(r);return n},Mt=jt(!1),Nt=jt(!0),Pt=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Ft=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=kr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Nt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Nt(i[e],n))return i[e]}return n.kind===`Set`?Pt(n.elements,t):(Pt(n.domain,t),Pt(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}},It=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Lt=e=>{if(!k(e))return;let t=F(e);return{domain:t.domain,range:t.range,low:It(t.domain)}},Rt=e=>{if(!k(e))return;let t=F(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},zt=(e,t)=>(et(t,e,!1),1),Bt=(e,t)=>(et(t,e,!0),!1),Vt=(e,t)=>(e.type!==void 0&&et(e,t,!1),A(t)?e.rank-t.rank:-1),Ht=(e,t)=>(e.type!==void 0&&et(e,t,!0),A(t)&&e.name===t.name),Ut={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`}},Wt=(e,t,n)=>{let r=Ut[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${I(e)} with ${r.other}:\n${I(t)}`},Gt=(t,n,r)=>{let i=Lt(r);if(!i){if(A(r))return zt(r,n);throw new e._(`Attempted to compare the function ${I(n)} with the value:\n${I(r)}`)}if(t.range.length!==i.range.length)return t.range.length-i.range.length;let a=()=>Kt(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 Kt(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._(`Attempted to compare integer with non-integer${t.low===void 0?``:`:`}\n${I(r)}.`);let i=t.low===void 0?r-(o+n):o+n-r;if(i!==0)return i}return a()},Kt=(e,t)=>{for(let n=0;n<e.length;n++){let r=Zt(e[n],t[n]);if(r!==0)return r}return 0},qt=(t,n)=>{let r=F(t);if(t.kind===`Function`&&er(r)!==void 0){let e=k(n)?er(n):void 0;return e?r.range.length-e.length||Kt(r.range,e):Gt({...r,low:1},t,n)}if(St(t)===`record`){let i=Rt(n);if(!i){if(A(n))return zt(n,t);throw new e._(`Attempted to compare record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length-i.domain.length||Kt(r.domain,i.domain)||Kt(r.range,i.range)}return Gt({...r,low:It(r.domain)},t,n)},Jt=(e,t)=>ut(e)||ut(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Yt=(e,t)=>{let n=Ve(t)?t:N(t);return{elements:N(e).elements,otherElements:N(n).elements}},Xt=(t,n)=>{if(Jt(t,n))return ht(t,n);if(!Ve(t))return Xt(N(t),n);if(!O(n)){if(A(n))return zt(n,t);throw new e._(`Attempted to compare the set ${I(t)} with the value:\n${I(n)}`)}let r=Yt(t,n);return r.elements.length-r.otherElements.length||Kt(r.elements,r.otherElements)},Zt=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return ht(t,n);if(A(n))return zt(n,t);throw new e._(Wt(t,n,!1))}return t.kind===`ModelValue`?Vt(t,n):k(t)?qt(t,n):Xt(t,n)},Qt=(e,t)=>e.every((e,n)=>nn(e,t[n])),$t=(t,n,r)=>{let i=Lt(r);if(!i){if(A(r))return Bt(r,n);throw new e._(`Attempted to check equality of the function ${I(n)} with the value:\n${I(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)&&Qt(t.range,i.range);let a=t.low??i.low;return a===void 0?Qt(t.domain,i.domain)&&Qt(t.range,i.range):(t.low===void 0?t.domain:i.domain).every((t,n)=>{if(typeof t!=`number`)throw new e._(`Attempted to compare an integer with non-integer:\n${I(t)}.`);return t===a+n})&&Qt(t.range,i.range)},en=(t,n)=>{let r=F(t);if(t.kind===`Function`&&er(r)!==void 0){let e=k(n)?er(n):void 0;return e?r.range.length===e.length&&Qt(r.range,e):$t({...r,low:1},t,n)}if(St(t)===`record`){let i=Rt(n);if(!i){if(A(n))return Bt(n,t);throw new e._(`Attempted to check equality of record:\n${I(t)}\nwith non-record\n${I(n)}`)}return r.domain.length===i.domain.length&&Qt(r.domain,i.domain)&&Qt(r.range,i.range)}return $t({...r,low:It(r.domain)},t,n)},tn=(t,n)=>{if(Jt(t,n))return At(t,n);if(!Ve(t))return tn(N(t),n);if(!O(n)){if(A(n))return Bt(n,t);throw new e._(`Attempted to check equality of the set ${I(t)} with the value:\n${I(n)}`)}let r=Yt(t,n);return r.elements.length===r.otherElements.length&&Qt(r.elements,r.otherElements)},nn=(t,n)=>{if(typeof t!=`object`){if(typeof n==typeof t)return t===n;if(A(n))return Bt(n,t);throw new e._(Wt(t,n,!0))}return t.kind===`ModelValue`?Ht(t,n):k(t)?en(t,n):tn(t,n)},rn=e=>{let t=[];for(let n of e){let e=on(n,t);e.isFound||t.splice(e.index,0,n)}return t},an=(e,t)=>{let n=nr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},on=(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,()=>Zt(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}},sn=(e,t)=>t.some(t=>an(t,()=>nn(t,e))),cn=/* @__PURE__ */ new WeakSet,ln=e=>{typeof e==`object`&&(e.kind===`Set`&&(cn.add(e),e.elements.forEach(ln)),e.kind===`Function`&&(e.domain.forEach(ln),e.range.forEach(ln)))},un=(e,t)=>rr(At,nn,e,t),dn=e=>{for(let t=1;t<e.length;t++)if(ht(e[t-1],e[t])>=0)return!1;return!0},fn=e=>{for(let t=1;t<e.length;t++)Ot(e[t]);if(e.length<2||dn(e))return vt(e);let t=[...e].sort(ht),n=[t[0]];for(let e=1;e<t.length;e++)ht(n[n.length-1],t[e])!==0&&n.push(t[e]);return vt(n)},pn=e=>rr(fn,e=>({kind:`MixedSet`,elements:e}),e,void 0),mn=vt([]),hn=(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&&ht(r[a],t)<0;)a++;a<r.length&&ht(r[a],t)===0||i.push(t)}return i.length===n.length?e:vt(i)},gn=(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&&ht(r[a],t)<0;)a++;a<r.length&&ht(r[a],t)===0&&i.push(t)}return i.length===n.length?e:vt(i)},_n=(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=ht(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=vt(i);if(e.hash!==0&&e.hash!==wr){let t=e.hash,n=0;for(;n<a.length;n++){let e=kr(a[n]);if(e===wr)break;t=t+Sr(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+Mr(a[e])|0;c.fingerprint=t}return c},vn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>ht(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&ht(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return yt(n,r)},yn=e=>{let t=vn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:Ge(t,e.map(e=>e[0]))},bn=[],xn=[],Sn=/* @__PURE__ */ new WeakMap,Cn=e=>{let t=bn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return bn[e]=n,n},wn=e=>{if(Xn(e),e.low===1&&e.high>=1)return Cn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Tn=e=>e.length>0&&(e===bn[e.length]||Sn.has(e)),En=e=>{let t=N(e).elements;return Tn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Dn=e=>{let t=xn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return xn[e]=n,n},j=e=>xt(yt(Cn(e.length),e),`tuple`),On=e=>xt(vn(e),`record`),kn=(e,t)=>xt(yt(e,t),`record`),An=e=>O(e)&&!ut(e),jn=(e,t=!1)=>`UNION(${I(e.base,t)})`,Mn=(t,n=e=>N(e).elements)=>{if(!An(t.base))throw new e._(`Attempted to enumerate the nonenumerable set:\n${jn(t)}`);return n(t.base)},Nn=(t,n,r)=>{if(An(t))return t;throw new e._(n===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${I(t)}\nwhen enumerating:\n${jn(r)}`)},M=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return M(e.base);case`FunctionSet`:return M(e.domain)&&M(e.range)||Pn(e.domain)===!0||Pn(e)===!0;case`RecordSet`:return e.sets.every(M)||Pn(e)===!0;case`ProductSet`:return e.factors.every(M)||Pn(e)===!0;case`Union`:return M(e.base)&&Un(e.base).every(M);case`SetOperation`:return e.operator===`\\cup`?M(e.left)&&M(e.right):e.operator===`\\cap`?M(e.left)||M(e.right):M(e.left);default:return!1}},Pn=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=Pn(e.domain);return t===void 0?void 0:!t&&Pn(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Pn(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return M(e)?N(e).elements.length===0:void 0;default:return}},Fn=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},In=(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},Ln=e=>{if(typeof e!=`object`||e.kind!==`Subset`||ut(e.base))return;let t=N(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:In(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return vt(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)})},Rn=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(vt(r.map(t=>e[t])));while(In(r,e.length))}return t},zn=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(ut(o))throw new e._(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},Bn=(t,n=e=>N(e).elements)=>{if(typeof t!=`object`)throw new e._(`Expected a set but found ${I(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return rn(t.elements);case`Interval`:{let e=wn(t);return e!==bn[e.length]&&Sn.set(e,t),e}case`Subset`:{if(Xn(t.base)===0)return Rn([]);if(!O(t.base))throw new e._(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${D(I(t.base))}`);let n=N(t.base).elements;if(n.length>30)throw new e._(Yn(t));return Rn(n)}case`FunctionSet`:{if(!rt.is174&&P(t))return[];if(ut(t.domain))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${I(t.domain)}\ncannot be enumerated.`);let r=En(t.domain);if((r.length>0||rt.is174)&&ut(t.range))throw new e._(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${I(t.range)}\ncannot be enumerated.`);let i=r.length===0?[]:n(t.range);return Fn(r.map(()=>i)).map(e=>yt(r,e))}case`RecordSet`:{if(!rt.is174&&P(t))return[];let e=zn(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${I(e)}`);return Fn(e).map(e=>On(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!rt.is174&&P(t))return[];let e=zn(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${I(e)}`);return Fn(e).map(j)}case`FilteredSet`:if(!O(t.base)||ut(t.base))throw new e._(`Attempted to enumerate { x \\in S : p(x) } when S:\n${I(t.base)}\nis not enumerable`);return N(t.base).elements.filter(t.test);case`Union`:{let e=Mn(t).flatMap((e,n)=>N(Nn(e,n,t)).elements);return N(pn(e)).elements}case`SetOperation`:{if(t.operator===`\\cup`&&(!An(t.left)||!An(t.right)))throw new e._(`Attempted to enumerate S \\cup T when S:\n${I(t.left)}\nand T:\n${I(t.right)}\nare not both enumerable`);if(t.operator===`\\cap`&&!An(t.left)&&!An(t.right))throw new e._(`Attempted to enumerate S \\cap T when neither S:\n${I(t.left)}\nnor T:\n${I(t.right)}\nis enumerable`);if(t.operator===`\\`&&!An(t.left))throw new e._(`Attempted to enumerate S \\ T when S:\n${I(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return rr(e=>_n(N(e.left),N(e.right)).elements,e=>rn(Vn(e)),t,t);let n=t.operator===`\\`||An(t.left),r=n?t.left:t.right,i=n?t.right:t.left;return N(r).elements.filter(e=>ir(e,i)===(t.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to enumerate the non-enumerable set ${I(t)}`);default:throw new e._(`Expected a set but found ${I(t)}`)}},N=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return vt(Bn(e));let t=typeof e==`object`&&ze(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=nr.sets;n?.push(e);let r=Bn(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`)?vt(r):fn(r);return t&&(t.enumerated=i),i},Vn=e=>[...N(e.left).elements,...N(e.right).elements],Hn=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?rr(e=>N(e).elements,e=>rn(an(e,()=>Vn(e))),e,e):N(e).elements,Un=e=>{if(typeof e!=`object`||wt(e))return N(e).elements;let t=nr.sets;t?.push(e);let n=qn(e);return t?.pop(),n},Wn=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Gn=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Gn);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Gn)&&e.range.every(Gn);case`SetOperation`:return e.operator!==`\\cup`&&Gn(e.left)&&Gn(e.right);case`FilteredSet`:return Gn(e.base);case`ProductSet`:return e.factors.every(Gn);default:return!1}},Kn=e=>typeof e!=`object`||wt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Kn(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Kn(e.left)||Kn(e.right):Wn(e)?.some(Kn)??!1,qn=e=>{if(e.kind===`Union`)return Mn(e,Un).flatMap((t,n)=>Un(Nn(t,n,e)));if(e.kind===`FilteredSet`&&!ut(e.base))return Un(e.base).filter(e.test);if(Wn(e)?.some(Kn))return Bn(e,Un);if(e.kind!==`SetOperation`)return N(e).elements;if(e.operator===`\\cup`)return!An(e.left)||!An(e.right)?N(e).elements:[...Un(e.left),...Un(e.right)];let t=e.operator===`\\`||An(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return An(n)?Un(n).filter(t=>ir(t,r)===(e.operator===`\\cap`)):N(e).elements},P=t=>{if(typeof t!=`object`||!O(t))throw new e._(`Shouldn't call isEmpty() on value ${I(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._(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(P);case`RecordSet`:return t.sets.some(P);case`FunctionSet`:return!P(t.domain)&&P(t.range);case`Union`:return Mn(t).every((e,n)=>P(Nn(e,n,t)));default:return N(t).elements.length===0}},Jn=(t,n,r)=>t.reduce((t,i)=>{let a=t*Xn(i,n);if(a>2147483647)throw new e._(r());return a},1),Yn=e=>`Overflow when computing the number of elements in:\n${I(e)}`,Xn=(t,n)=>{if(typeof t!=`object`)throw new e._(`Attempted to compute the number of elements in the ${He(t)} ${I(t)}.`);switch(t.kind){case`ModelValue`:throw new e._(`Attempted to compute the number of elements in the model value ${I(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return Xn(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e._(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e._(`Attempted to compute the number of elements in the overridden value ${I(t)}.`);case`Subset`:{let r=Xn(t.base,n);if(r>=31)throw new e._(Yn(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(P(t.domain))return 1;if(P(t.range))return 0;if(Xn(t.range,n)===1)return 1}let r=Xn(t.domain,n),i=Xn(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._(Yn(t));return a.value}case`RecordSet`:return n!==`1.7.4`&&P(t)?0:Jn(t.sets,n,()=>Yn(t));case`ProductSet`:return n!==`1.7.4`&&P(t)?0:Jn(t.factors,n,()=>`Overflow when computing the number of elements in ${I(t)}`);default:return Ot(t),N(t).elements.length}},Zn=e=>`Attempted to check if the set ${I(e)}is finite.`,Qn=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e._(`Attempted to check if the ${He(t)} ${I(t)} is a finite set.`);switch(t.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new e._(`Attempted to check if the function:\n${I(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Qn(t.base)&&P(t.base);case`Subset`:return Qn(t.base);case`FunctionSet`:{let e=Qn(t.domain);if(e&&P(t.domain))return!0;let n=Qn(t.range);return n&&P(t.range)?!0:n&&(e||Xn(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(!Qn(t))n.isAllFinite=!1;else if(P(t))return!0;return n.isAllFinite}case`Union`:if(!An(t.base))throw new e._(`Attempted to check if the nonenumerable set:\n${jn(t)}\nis a finite set.`);return N(t.base).elements.every(Qn);case`SetOperation`:if(t.operator===`\\cup`)return Qn(t.left)&&Qn(t.right);if(t.operator===`\\cap`){if(!Qn(t.left)&&!Qn(t.right))throw new e._(Zn(t));return!0}if(Qn(t.left))return!0;if(!Qn(t.right))throw new e._(Zn(t));return!1;case`FilteredSet`:if(!Qn(t.base))throw new e._(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${I(t.base)}\nis finite.`);return!0}},$n=(e,t,n=ht)=>{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},er=e=>{if(typeof e!=`object`||!k(e))return;let t=F(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},tr=(e,t)=>{let n=`Attempted to check if the value:\n${I(e)}\nis an element of the`;if(!k(t))return`${n} ${He(t)} ${I(t)}`;let r=St(t);return r===`record`?`Attempted to check if element:\n${I(e)}\nis in the record:\n${I(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${I(t)}`},nr={sets:void 0},rr=(t,n,r,i)=>{let a=nr.sets,o=nr.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e._))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)}},ir=(e,t)=>{let n=nr.sets;if(n===void 0)return sr(e,t);n.push(t);let r=sr(e,t);return n.pop(),r},ar=(e,t)=>$n(t.elements,e)!==-1,or=(e,t)=>cn.has(t)?on(e,t.elements).isFound:sn(e,t.elements),sr=(t,n)=>{if(!O(n))throw new e._(tr(t,n));switch(n.kind){case`Set`:return Ot(t),rr(ar,or,t,n);case`MixedSet`:return sn(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._(`Attempted to check if the value:\n${I(t)}\nis in the integer interval ${I(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._(`Attempted to check if the value:\n${I(t)}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof t==`number`&&t>=0;case`Subset`:if(!O(t)||ut(t))throw new e._(`Attempted to check if the non-enumerable value\n${D(I(t))}\nis element of\n${D(I(n))}`);return N(t).elements.every(e=>ir(e,n.base));case`FunctionSet`:{if(!k(t)){if(A(t))return!1;throw new e._(`Attempted to check if \n${I(t)}\nwhich is not a TLC function value, is in the set of functions:\n${D(I(n))}`)}let r=F(t),i=It(r.domain);return(i===void 0?un(n.domain,vt(r.domain)):un({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>ir(e,n.range))}case`RecordSet`:{let r=k(t)?F(t):void 0;if(!r||!Ye(r.domain)){if(A(t))return!1;throw new e._(`Attempted to check if non-record\n${I(t)}\nis in the set of records:\n${I(n)}`)}return r.domain.length===n.names.length&&n.names.every((e,t)=>{let i=$n(r.domain,e);return i!==-1&&ir(r.range[i],n.sets[t])})}case`ProductSet`:{let r=k(t)?er(t):void 0;if(r===void 0){if(k(t)&&F(t).domain.every(e=>typeof e==`number`)||A(t))return!1;throw new e._(`Attempted to check if non-tuple\n${I(t)}\nis in the set of tuples:\n${I(n)}`)}return r.length===n.factors.length&&r.every((e,t)=>ir(e,n.factors[t]))}case`FilteredSet`:return ir(t,n.base)&&n.test(t);case`Union`:if(!An(n.base))throw new e._(`Attempted to check if:\n ${I(t)}\nis an element of the non-enumerable set:\n ${jn(n)}`);return N(n.base).elements.some(e=>ir(t,e));case`SetOperation`:return n.operator===`\\cup`?ir(t,n.left)||ir(t,n.right):ir(t,n.left)&&ir(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=er(t);if(r===void 0){if(A(t))return!1;throw new e._(`Attempted to check if the value:\n${D(I(t))}\nis an element of ${D(I(n))}.`)}return r.every(e=>ir(e,n.base))}default:throw new e._(tr(t,n))}},cr=(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?ir(e,n):e.range.every((e,r)=>cr(e,t.range[r],n.range)),F=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;M(t.domain)||Xn(t.domain);let e=En(t.domain);return t.enumerated=xt(yt(e,e.map(e=>t.apply(e))),St(t)),t.enumerated}throw new e._(`Expected a function but found ${I(t)}`)},lr=(e,t,n)=>{let r=D(I(e)),i=D(I(t)),a=n===`1.7.4`;switch(St(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.`}},ur=(e,t)=>{if(!rt.is174)return lr(e,t);let n=D(I(t));return St(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},dr=(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},fr=t=>new e._(`Attempted to apply function with integer domain to the non-integer argument ${D(I(t))}`),pr=(e,t,n)=>{throw rt.is174||e.length<32?e.forEach(e=>nn(e,t)):$n(e,t,Zt),n},mr=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=St(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e._(r(t,n));if(o===void 0&&!rt.is174&&Tn(i))throw fr(n)}let a=dr(i,n);return a===-1?rr($n,pr,i,n):a},hr=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(!ir(n,t.domain))throw new e._(St(t)===`lambda`?lr(t,n):`Attempted to apply a function to ${I(n)}, which is not in its domain`);return t.apply(n)}if(typeof t!=`object`||t.kind!==`Function`)throw new e._(`Attempted to apply ${I(t)}, which is not a function`);let i=r??lr,a=mr(t,n,i);if(a===-1)throw new e._(i(t,n));return t.range[a]},gr=e=>Tn(e)?Sn.get(e)??Dn(e.length):void 0,_r=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=F(e).domain;return gr(t)??vt(t)},vr=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||!M(t.domain))){if(!ir(n,t.domain))return t;let e=r(t.apply(n));return xt({kind:`LazyFunction`,domain:t.domain,apply:r=>un(n,r)?e:t.apply(r),source:t.source},St(t))}if(!k(t))throw new e._(`Attempted to apply EXCEPT construct to the value ${D(I(t))}.`);let a=F(t),o=mr(a,n,ur);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=xt(yt(a.domain,s),St(a));if(u.writtenKeys=a.writtenKeys,a.hash!==0&&a.hash!==wr){let e=kr(l);if(e!==wr){let t=kr(a.domain[o]);u.hash=c===l?a.hash:a.hash-Cr(t,kr(c))+Cr(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Nr(e,c)+Nr(e,l)|0}return u},yr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},br=(e,t)=>Math.imul(e^t,16777619),xr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return yr(t)},Sr=e=>yr(e+2654435769|0),Cr=(e,t)=>yr(Math.imul(e,668265261)+t|0),wr=795548749,Tr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=kr(t[e]);if(r===wr)return wr;n=n+Sr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=kr(e.domain[n]),i=kr(e.range[n]);if(r===wr||i===wr)return wr;t=t+Cr(r,i)|0}return t},Er=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e._(`TLC has found a state in which the value of a variable contains ${I(t)}`);if(O(t)){N(t).elements.forEach(Er);return}let n=F(t);n.domain.forEach(Er),n.range.forEach(Er)},Dr=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{kr(t)===wr&&Er(t);return}catch(t){if(!(t instanceof e._))throw t;return t}},Or=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[]}},kr=e=>typeof e==`number`?yr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?xr(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Tr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?M(e.domain)?kr(F(e)):wr:M(e)?kr(N(e)):wr,Ar=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},jr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ar(t)},Mr=e=>Ar(Fr(e)+2135587861|0),Nr=(e,t)=>Ar(Math.imul(Fr(e),374761393)+Fr(t)|0),Pr=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Mr(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Nr(e.domain[n],e.range[n])|0;return t},Fr=e=>typeof e==`number`?Ar(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?jr(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Pr(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Fr(F(e)):M(e)?Fr(N(e)):jr(Ir(e)),Ir=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Lr(e),Lr=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${Ir(t.base)}>`;if(t.kind===`FilteredSet`&&!M(t))throw new e._(`Attempted to compare the non-enumerable set ${I(t)} with another value`);if(O(t))return M(t)?`{${N(t).elements.map(Ir).join(`,`)}}`:`<${t.kind} ${I(t)}>`;let n=F(t);return`(${n.domain.map((e,t)=>`${Ir(e)}:${Ir(n.range[t])}`).join(`,`)})`},Rr=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,zr=e=>e.reduce((e,t)=>e===0?0:e*Xn(t),1),Br=e=>{if(e.kind===`Subset`)return Xn(e.base)<=6?N(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return N(e);if(e.kind===`FunctionSet`&&M(e.domain)&&Xn(e.domain)===0)return vt([yt([],[])]);let t=e.kind===`FunctionSet`?Xn(e.range)**Xn(e.domain):zr(e.kind===`RecordSet`?e.sets:e.factors);return t===0?mn:t<=1999?N(e):void 0},Vr=(t,n)=>{if(n)return Br(t);if(M(t))try{return Br(t)}catch(t){if(t instanceof e._)return;throw t}},Hr=(e,t)=>{let n=e=>I(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return jn(e,t)}},Ur=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Wr=t=>{if(M(t.domain))try{return F(t)}catch(t){if(t instanceof e._)return;throw t}},I=(e,t=!1,n=!1)=>{let r=e=>I(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Rr(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(N(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Vr(e,t);return n?r(n):Hr(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Wr(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${I(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&rt.is174&&St(e)!==`tuple`)return`<< >>`;let a=r=>I(r,t,n&&St(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:St(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ur(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):Ke(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},Gr=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${D(I(n))}\n`).join(``)},Kr=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),qr=(t,n)=>Kr.has(t)?new e._(n):new e.C(n),Jr=(t,n,r,i)=>new e.C(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${I(i)}`),Yr=e=>typeof e==`object`&&e.kind===`Operator`,L=(e,t,n)=>{let r=e[t];if(r===void 0||Yr(r))throw qr(n,`${n} expects a value as argument ${t+1}`);return r},Xr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`number`)throw qr(n,`${n} expects an integer but received ${I(r)}`);return r},Zr=(e,t,n)=>{let r=L(e,t,n);if(typeof r!=`boolean`)throw qr(n,`${n} expects a boolean but received ${I(r)}`);return r},Qr=(e,t,n)=>{let r=L(e,t,n);if(!O(r))throw qr(n,`${n} expects a set but received ${I(r)}`);return r},$r=(e,t,n)=>{let r=Qr(e,t,n);if(!M(r))throw qr(n,`${n} cannot enumerate the non-enumerable set ${I(r)}`);return r},ei=(e,t,n)=>N($r(e,t,n)).elements,ti=(e,t,n)=>{let r=L(e,t,n),i=er(r);if(!i)throw qr(n,`${n} expects a sequence but received ${I(r)}`);return i},ni=(e,t,n)=>{let r=L(e,t,n);if(!k(r))throw qr(n,`${n} expects a function but received ${I(r)}`);return F(r)},ri=(e,t,n)=>{let r=e[t];if(r===void 0||!Yr(r))throw qr(n,`${n} expects an operator as argument ${t+1}`);return r},ii=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),R=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ai=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),si=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(L(n,0,e),L(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ci=e=>e>2147483647||e<-2147483648,li=t=>new e.C(`Overflow when computing ${t}`),ui={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`},di={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},fi={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`},pi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},mi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return di[e.operator];if(e.kind!==`Function`)return ui[e.kind];let t=St(e);return t===void 0?`FcnRcdValue`:pi[t]},hi=e=>fi[mi(e)],gi=(t,n)=>new e._(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),_i=(t,n)=>{let r=r=>(...i)=>{let a=nr.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof e._&&(t.isLazy===!0||!(r instanceof e.C))?(nr.sets&&(nr.sets.length=a),gi(n,r.message)):r}};return{...t,evaluate:r(t.evaluate),evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},vi=(e,t)=>{if(typeof e!=`number`)throw gi(t,`Cannot cast tlc2.value.impl.${mi(e)} to tlc2.value.impl.IntValue`);return e},yi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,bi=(e,t,n,r)=>{let i=yi(e,n,`IntValue`,2);return si(t,(e,n)=>{let a=vi(e,i),o=vi(n,i),s=r(a,o);if(ci(s))throw li(`${a}${t}${o}`);return s})},xi=(t,n,r)=>{if(typeof t!=`number`)throw new e.C(`The ${n} argument of ${r} should be an integer, but instead it is:\n${I(t)}`);return t},Si=(e,t,n=e)=>si(e,(e,r)=>t(xi(e,`first`,n),xi(r,`second`,n))),Ci=(e,t,n)=>({...oi(e,t,n),isLazy:!0}),wi=(e,t,n)=>{let r=ri(e,t,n);return()=>r.call([])},Ti=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ei=()=>({bool:fu,condition:(e,t)=>{if(typeof e!=`boolean`)throw Yl(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Xl(t,n,e);return e},apply:hr,expectFunction:lu,tuple:j,set:pn,record:kn,writtenRecord:qe,equal:At,enumerate:yu,unassigned:(e,t)=>{throw ru(e,t)},primeOutsideAction:e=>{throw au(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:uu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>su(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Di={value:void 0},Oi={isAllowed:void 0},ki=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Ai=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ji=e=>`local${e.counter++}`,Mi=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),ke(e).forEach(e=>Mi(e,t)),t),Ni=(e,t,n)=>{let r=Ai(e,V(t,e.environment)),i=Mi(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Ai(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},Pi=(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(()=>ji(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${Ri(e,t.set,s)}, ${Ai(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=ji(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${Ri(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=ji(e),a=ji(e),o=ji(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})`},Fi=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${Ri(e,r[0],n)}, "the left side of =>") ? bool(${Ri(e,r[1],n)}, "the right side of =>") : true)`;if(E(t))return Ni(e,t,n);let i=Uu(t.operator,e.environment);if(i?.kind!==`Builtin`)return Ni(e,t,n);if(i.name===`DOMAIN`)return`${Ai(e,$l(t))}(${Ri(e,r[0],n)})`;if(i.name===`TLCEval`)return Ni(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Ai(e,eu(t,i))}(${Ri(e,r[0],n)}, ${Ri(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&gd(r[0],a))return`${Ai(e,i.evaluateUnary)}(${Ri(e,r[0],n)})`;let o=r.length===2&&gd(r[0],a)&&gd(r[1],a);return i.evaluateBinary&&o?`${Ai(e,i.evaluateBinary)}(${Ri(e,r[0],n)}, ${Ri(e,r[1],n)})`:Ni(e,t,n)},Ii=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(E(e))return!1;let r=ed(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Ii(e.expression,t,n);case`FieldAccess`:return Ii(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Ii(e,t,n));default:return!1}},Li=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Li(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Li);default:return!1}},Ri=(e,t,n)=>{let r=(t,r=n)=>Ri(e,t,r);switch(t.kind){case`Number`:return Ue(t.value)?String(t.value):Ni(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(E(t))return Ni(e,t,n);let i=ed(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Ai(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Ai(e,i.value):Ni(e,t,n)}case`Apply`:return Fi(e,t,n);case`And`:case`Or`:{let n=Ai(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)}, ${Ai(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Td(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Ii(t.function,n,e.environment)?r(t.function):Li(t.function)?r(t.function,i):Ni(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Ai(e,t)}))`,o=Ql(e.environment.runtime.version),s=o?`, ${Ai(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`${Ai(e,Zl(t))}(${r(t.record)})`;case`Record`:{let i=kd(t.fields);if(Ad(i))return Ni(e,t,n);let a=Ai(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}, ${Ai(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=Ai(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`)?Pi(e,t,n):Ni(e,t,n);default:return Ni(e,t,n)}},zi=(e,t)=>{if(!Ti.has(e.kind)||(Oi.isAllowed??=ki(),!Oi.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ri(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
87
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Di.value??=Ei();let o=Di.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},Bi={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},Vi={none:0,error:1,warning:3,state:4},Hi={0:``,1:`Error: `,3:`Warning: `,4:`State `},Ui=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===Vi.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
88
- (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${Hi[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},Wi=`The configuration file did not specify the initial state predicate.
9
+ const e=require("./worker.cjs");let t=require("node:zlib");const n=/* @__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(`.`)),r=/* @__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`]]),i=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),a=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),o=/* @__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`]]),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,} *MODULE\b/,u=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)u[n.charCodeAt(0)]|=e});const d=(e,t)=>e<128&&(u[e]&t)!==0,f=(e,t,n)=>{let r=t;for(;d(e.charCodeAt(r),n);)r++;return r},p=/* @__PURE__ */ new Map;a.forEach(e=>{let t=e.charCodeAt(0),n=p.get(t)??[];n.push(e),p.set(t,n)});const m=(e,t)=>{let n=p.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},h=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(o.has(n))return n;let r=e[t];return o.has(r)?r:void 0},g=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&d(e.charCodeAt(t+1),2)){let n=e.slice(t+1,f(e,t+1,2)),i=n.length;for(;i>0&&!r.has(n.slice(0,i));)i--;let a=r.get(n.slice(0,i));return{text:a??`\\`,length:a===void 0?1:i+1}}let a=h(e,t);if(a!==void 0)return{text:o.get(a)??``,length:a.length};let s=m(e,t);return s?{text:i.get(s)??s,length:s.length}:n===92?{text:`\\`,length:1}:void 0},_=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),v=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>o.has(e)||_.has(e));return n===void 0?void 0:{text:n,length:n.length}},y=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},b=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:f(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?f(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return y(e,s?o+1:o,e=>e===`.`)-t},ee=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,x={n:`
10
+ `,t:` `,r:`\r`,f:`\f`},te=(e,t)=>t===9?e+8-e%8:e+1,S=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),ne=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=S.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=f(e,t+2,n);return r===t+2?0:r-t},re=(t,r=!1)=>{let i=l.exec(t);if(!i)throw new e.P(`Expected a module header such as ---- MODULE Name ----`);let a=[],o=/* @__PURE__ */ new Map,s=t.slice(0,i.index).split(`
11
+ `),c=i.index,u=s.length,p=i.index-s[s.length-1].length,m=0,h=-1,v=0,ee=0,S=()=>{for((h!==p||v>c)&&(h=p,v=p,ee=0);v<c;v++)ee=te(ee,t.charCodeAt(v));return te(ee,t.charCodeAt(c))},re=(e,t,n,r)=>{let i=S();a.push({kind:e,text:t,spelling:r,line:u,column:i,endColumn:i+n-1}),c+=n},ie=e=>{for(let n=0;n<e;n++)t.charCodeAt(c)===10&&(u++,p=c+1),c++},ae=n=>new e.P(`${n} at line ${u}, column ${S()}`,void 0,{reason:n,line:u,column:S(),isEnd:c>=t.length});for(;c<t.length;){let e=t.charCodeAt(c);if(e===10||e===32||e===9||e===13){ie(1);continue}if(e===92&&t.charCodeAt(c+1)===42){ie(y(t,c,e=>e!==`
12
+ `&&e!==`\r`)-c);continue}if(e===40&&t.charCodeAt(c+1)===42){let e=0;do{if(c>=t.length)throw ae(`Unterminated comment`);t.startsWith(`(*`,c)?(e++,ie(2)):t.startsWith(`*)`,c)?(e--,ie(2)):ie(1)}while(e>0);continue}if(e===45&&t.startsWith(`----`,c)){let e=y(t,c,e=>e===`-`)-c,n=y(t,c+e,e=>e===` `);t.startsWith(`MODULE`,n)&&m++,re(`Separator`,`----`,e);continue}if(e===61&&t.startsWith(`====`,c)){if(re(`ModuleEnd`,`====`,y(t,c,e=>e===`=`)-c),m--,m<=0)break;continue}if(e===34){let e=u,n=S(),r=[];for(ie(1);t.charCodeAt(c)!==34;){let e=t.charCodeAt(c);if(c>=t.length||e===10||e===13)throw ae(`Unterminated string`);if(e===92){let e=t[c+1];if(e===void 0||!`ntrf\\"`.includes(e))throw ae(`Invalid escape in string`);r.push(x[e]??e),ie(2)}else r.push(t[c]),ie(1)}ie(1),a.push({kind:`String`,text:r.join(``),line:e,column:n,endColumn:S()-1});continue}let i=ne(t,c);if(i>0){re(`Number`,t.slice(c,c+i),i);continue}if(d(e,7)){let r=f(t,c,7),i=t.slice(c,r),a=f(t,c,1);if(a===r){let e=t.charCodeAt(r)===46?f(t,r+1,1):r,n=e>r+1,a=n?t.slice(c,e):i;re(n?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(i)){let n=e===95?`_`:t.slice(c,a);re(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){re(`Keyword`,i.slice(0,3),3);continue}let s=o.get(i)??i;o.set(s,s),re(n.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let s=t[c];if(e>=128&&_.has(s)){re(`Identifier`,o.get(s)??s,1),o.set(s,s);continue}if(e===60){let e=b(t,c,r);if(e>0){re(`Step`,t.slice(c,c+e),e);continue}}let l=g(t,c);if(l){let e=t.slice(c,c+l.length);re(`Operator`,l.text,l.length,e===l.text?void 0:e)}else throw ae(`Unexpected character ${JSON.stringify(s)}`)}let oe=S();return a.push({kind:`End`,text:``,line:u,column:oe,endColumn:oe}),a},ie=[[`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`]],ae=ie.map(e=>e[0]),oe=new Map(ae.map((e,t)=>[e,t]).reverse()),C=t=>{let n=oe.get(t);if(n===void 0)throw new e.y(`Unknown SANY token kind ${t}`);return n},se=new Map(ie.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),w=Math.max(...[...se.keys()].map(e=>e.length)),ce=Array.from({length:w},(e,t)=>w-t),le=/----+ *MODULE/y,ue=[/_\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],T=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`)),E=T(String.raw`\.\/\\`),D=T(String.raw`\.\\\/`),O=String.raw`<(?:[0-9]+|\+|\*)>`,de=[[`_BM0`,[le]],[`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`,E],[`BOR`,D],[`IDENTIFIER`,ue],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${O}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(O,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${O}(?:\*\.*|-\.*|\.+)`,`y`)]]],fe=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[le]]],pe=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[le]],[`BAND`,E],[`BOR`,D],[`IDENTIFIER`,ue]],me=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),he=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,ge=(e,t,n)=>e.map(([e,r])=>({kind:C(e),length:Math.max(...r.map(e=>me(e,t,n)))})).reduce(he,{kind:-1,length:0}),_e=(e,t)=>{let n=ce.find(n=>se.has(e.slice(t,t+n))),r=ge(de,e,t);return n===void 0?r:he(r,{kind:se.get(e.slice(t,t+n))??-1,length:n})},k=e=>e+8-e%8,ve=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
13
+ `?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
14
+ `?o=!0:s===` `&&(i=k(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},ye=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,be=new Set([...se.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),xe=(e,t)=>{let n=0;for(;be.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,me(ye,e,t)))},Se=e=>{let t=ve(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(C(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?Te(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
+ `||e[a]===`\r`?Te(o+1,0,void 0,i):Te(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=ge(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,ae[a.kind].startsWith(`_BM`)&&(r=`SPEC`),ae[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(fe);if(r===`PRAGMA`)return c(pe);for(;n<e.length;){let t=n;if(`
16
+ \r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=_e(e,t);if(r.length===0){let n=xe(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},Ce=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),we=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ce.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Te=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${we(n)}" (${n.charCodeAt(0)}), `}after : "${we(r)}"`,Ee=e=>{let t=Se(e);for(let e=t();typeof e!=`string`&&e.kind!==C(`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===` `?k(e):e+1,e.beginColumn);return Te(e.beginLine,n,e.image[t],e.image.slice(0,t))}},De=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Oe=/* @__PURE__ */ new Set([...De,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),ke=[`TYPE`,`TYPE_CONSTRAINT`],Ae=/* @__PURE__ */ new Set([...De,...ke]),je=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Me=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},Ne=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:Te(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:Te(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
18
+ `);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
19
+ `);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=Me(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=ne(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=v(e,n)??g(e,n),m=je.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},Pe=(t,n)=>new e._(`TLC found an error in the configuration file at line ${t}\n${n}`),Fe=(e,t)=>Pe(e,`The keyword ${t} appeared twice.`),Ie=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Le=/* @__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`]]),Re=(t,n=`master`)=>{let r=n===`1.7.4`?Ae:Oe,i=Ne(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let t=i[Math.min(a++,i.length-1)];if(t.kind===`Error`)throw new e._(`TLC found an error in the configuration file:\n${t.text}`);return t},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw e.it(new e._(`${e.Q(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),e.tt.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new e._(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw Pe(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw Pe(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw Pe(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw Pe(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw Pe(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw Pe(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw Pe(t,``);r=l()}if(r.text!==`=`)throw Pe(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?Ie.get(e):void 0,i=r.has(e)?Le.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw Pe(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw Fe(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Pe(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw Fe(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!ke.includes(e))throw Pe(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw Fe(t,e);c.add(e),h=l()}}return o},ze=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],A=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(ze),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:[])}},Be=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},j=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ve=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},He={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:` `}},Ue=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},We=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ge=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Ke=e=>{let t=t=>{let n=y(e,t,Ue);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=y(e,t,We);if(e.startsWith(`..`,n)&&We(e[n+2]))return{kind:`Constant`,first:t,last:y(e,n+2,We)-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=We(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:y(e,t+1,We)-1,children:[]};if(Ge(n))return{kind:`Constant`,first:t,last:y(e,t,Ge)-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)},M=e=>{let t=e.length===0?void 0:Ke(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=He[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},qe={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Je={none:0,error:1,warning:3,state:4},Ye={0:``,1:`Error: `,3:`Warning: `,4:`State `},Xe=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Ye[n]}${r}`,Ze=t=>{let n=/* @__PURE__ */ new Set;return{isTool:t.isTool,isDiffTrace:t.isDiffTrace??!1,version:t.version??`master`,print:(r,i,a)=>{let o=i===Je.warning;if(o&&t.errorCodes?.includes(r))throw new e.B(r,a);if(o&&t.isWarningEnabled===!1||i!==Je.error&&t.suppressedCodes?.includes(r))return;let s=o&&!t.isTool&&n.size===0?`
20
+ (Use the -nowarning option to disable this warning.)`:``,c=Xe(t.isTool,r,i,`${a}${s}`);o&&n.has(c)||(o&&n.add(c),console.log(c))}}},Qe=`The configuration file did not specify the initial state predicate.
89
21
  Can also be caused by trying to run TLC on a specification from
90
- a module imported with a parameterized INSTANCE statement.`,Gi=[[1005,e.u,!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:
91
- %1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
22
+ a module imported with a parameterized INSTANCE statement.`,$e=[[1005,e.u,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
23
+ %1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
24
+ %2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
25
+ %1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
92
26
  %1%,
93
27
  but it produced the following error:
94
28
  %2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
@@ -97,8 +31,8 @@ but it produced the following error:
97
31
  %1%
98
32
  is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
99
33
  the following value:
100
- %1%`,!0],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
101
- %4%`,!0],[2176,`Applying %1% to the following value,
34
+ %1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
35
+ %4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,e.h,!1],[2176,`Applying %1% to the following value,
102
36
  which is not %2%:
103
37
  %3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
104
38
  element is not a bag:
@@ -110,9 +44,11 @@ element is not a bag:
110
44
  %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
111
45
  on the right-hand side of a <- after already appearing on the
112
46
  left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
113
- is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Wi,!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:
114
- %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.
115
- %1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
47
+ is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Qe,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
48
+ cannot be used as a %3%`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
49
+ %1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
50
+ but TLC can handle only specifications with one next-state relation.`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
51
+ %1%`,!1],[2245,`In the configuration file, the module name %1% is not a module in the specification.`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
116
52
  but instead found %3%.
117
53
  %4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
118
54
  but didn't find one.
@@ -120,7 +56,7 @@ but didn't find one.
120
56
  %2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
121
57
  %2%`,!1],[2265,`TLC can't handle a number this big.
122
58
  %1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
123
- %4%`,!0],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
59
+ %4%`,!0],[2272,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property: Let A be the formula at %2%; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2273,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at %2% (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2274,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that infinitely many %1% steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at %2% (compare page 91 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
124
60
  %2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
125
61
  %3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
126
62
  The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
@@ -128,15 +64,27 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
128
64
  Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
129
65
  It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
130
66
  %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
131
- `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],Ki={value:void 0},qi=()=>Ki.value??=Gi.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),Ji=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,Yi=e=>Ji.test(e)?void 0:qi().find(t=>t.pattern.test(e))?.message,Xi=t=>t instanceof e.C||Yi(t.message)?.isEvalException===!0,Zi=/* @__PURE__ */ new Map([[1e3,`
67
+ `,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let et;const tt=()=>et??=$e.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),nt=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,rt=e=>nt.test(e)?void 0:tt().find(t=>t.pattern.test(e))?.message,it=t=>t instanceof e.O||rt(t.message)?.isEvalException===!0,at=/* @__PURE__ */ new Map([[1e3,`
132
68
  : `],[2105,`failed.
133
69
  `],[2154,`but it produced the following error:
134
- `],[2213,`:
135
- `],[2281,` - specifically: `]]),Qi=(e,t,n)=>{let r=n?Zi.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)}${$i(t.slice(a),n)}`},$i=(e,t)=>{let n=t?Yi(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Vi.none} @!@!@\n${Qi(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ea=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 ${ea(r%24)}h`:e>36e5?`${ea(r%24)}h ${ea(n)}min`:e>6e4?`${ea(n)}min ${ea(t)}s`:`${ea(t)}s`},na=e=>`${e.getFullYear()}-${ea(e.getMonth()+1)}-${ea(e.getDate())} ${ea(e.getHours())}:${ea(e.getMinutes())}:${ea(e.getSeconds())}`,ra=/* @__PURE__ */ new WeakMap,ia=(t,n,r)=>{if(!(t instanceof e._))return t;let i=e.K(new e._(`${r}\n${t.message}`,t),e.V(t));return ra.set(i,{code:n,headline:r,inner:t}),i},aa=e=>ra.has(e),oa=e.P.slice(0,e.P.indexOf(`
136
- `)),sa=`${e.P}tlc2.tool.EvalException: `,ca=`${e.P}util.Assert$TLCRuntimeException: `,la=e=>Xi(e)?sa:ca,ua=t=>{try{return t()}catch(t){throw t instanceof e._?Xi(t)?new e._(`${e.N}${t.message}`):Yi(t.message)?t:new e._(`${e.P}${t.message}`):t}},da=[sa,ca,e.P,e.N],fa=(e,t)=>{let n=ra.get(e);if(n)return`${n.headline}\n${fa(n.inner,t)}`;let r=e.message,i=da.find(e=>r.startsWith(e))??``;return`${i}${$i(r.slice(i.length),t)}`},pa=(t,n)=>{let r=ra.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:fa(t,!0)};if(n&&Xi(t))return{code:Yi(i)?.code??Bi.general,message:i,toolMessage:i};let a=n&&!i.startsWith(oa)?e.P:``;return{code:Bi.general,message:`${a}${i}`,toolMessage:`${a}${fa(t,!0)}`}},ma={kind:`Local`},ha=/* @__PURE__ */ new WeakSet,ga=/* @__PURE__ */ new WeakMap,_a=/* @__PURE__ */ new WeakMap,va=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ya=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ba=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,xa=e=>e.kind===`Operator`?e.params.length:0,Sa=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ca=e=>e.name.includes(`!`),wa=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ta=(e,t,n)=>{let r=t.bindings.get(e);return r&&ba(r.position,t.location)&&(!n||ba(r.position,n.start))?r:void 0},Ea=(t,n)=>t!==void 0&&n!==void 0&&e.z(t)===e.z(n),Da=(t,n,r,i)=>{if(n===void 0)return!0;if(Ea(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.z(a),s=n.range&&e.z(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},Oa=(e,t,n,r)=>Da(t,wa(e,t)??Ta(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,ka=(e,t,n)=>{Da(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Aa=(e,t,n,r)=>t.reduce((e,t,i)=>Oa(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),ja=(e,t,n)=>t.reduce((e,t)=>Oa(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ma=e=>e.kind===`Name`?[e.name]:e.names,Na=e=>e.flatMap(e=>Ma(e.pattern)),Pa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ba(n.location,t.location))?n:void 0},Fa=(e,t)=>{let n=Pa(e,t);return n?{key:t.getKey(n),arity:xa(n),params:Sa(n),kind:`Definition`}:t.imported.get(e)},Ia=(e,t,n)=>wa(t,e)??Fa(e,n),La=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Ra=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:La(e.location,e.spelling??t)},za=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ba(e.location,e.args[0].location)?`prefix`:`postfix`}},Ba=e=>!/^[\p{L}\d_]/u.test(e),Va=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Ha=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Ua=(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])}})},Wa=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Ua(e.name,[],void 0):Ua(e.operator,e.args,e.argumentCounts),Ga=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ka=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Na(e.bounds),body:e.body,sets:Ga(e.bounds)};case`SetMap`:return{names:Na(e.bounds),body:e.expression,sets:Ga(e.bounds)};case`SetFilter`:return{names:Ma(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ma(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}},qa=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}},Ja=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Ya=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Xa=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Xa(e.body,t):ke(e).reduce((e,n)=>e??Xa(n,t),void 0)},Za=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Za(i,t,n||Ya(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Xa(e.set,t):Xa(e,t)},Qa=e=>e.kind===`Label`?Qa(e.body):e,$a=e=>typeof e==`number`?`argument selector ${e}`:e,eo=`within the scope of a declaration
137
- from outside that declaration's scope.`,to=(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.z(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:Za(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?Xa(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Ya(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${eo}`);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=$a(t.operand);if(u.isSufficesOpen){if(Ha(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`?Ia(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=Ka(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:qa(e);if(!l)return;let f=Ha(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=Ha(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Ya(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${eo}`);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.`))},no=(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.z(t.location.range),message:r}),!0)},ro=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.z(i),o=t.params.filter((i,a)=>{let o=wa(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.z(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)},io=(e,t,n,r)=>{if(!Ja(e))return!1;let i=Wa(e),a=i[0],o=i.length>1&&a.kind===`Name`?wa(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&to(e,i,o,t,n,r),o!==void 0},ao=(t,n,r,i)=>{let a=t.location;if(go(t,r,i))return;let o=_a.get(t);if(o!==void 0)return o;if(va(n))return t.kind===`Apply`?t.args.length:0;let s=wa(r,n);if(s?.isNonFact){i.errors.push({location:e.z(Ra(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(io(t,r,i,!1)||Va(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=ma),s)return s.arity;let c=Fa(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,_a.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(wa(r,l)!==void 0||Fa(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.z(t.kind===`Apply`&&u===`-.`?La(a,`-`):Ra(t,n));if(!Ba(n)||Va(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=za(t);f&&a.range&&i.errors.push({location:e.z(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},oo=(e,t,n)=>(e.forEach(e=>z(e.set,t,n)),e.reduce((e,t)=>Aa(e,Ma(t.pattern),t.pattern.ranges,n),t)),so=(e,t)=>e.kind===`Identifier`&&e.name===t&&E(e)||ke(e).some(e=>so(e,t)),co=(e,t)=>{e.kind===`FunctionConstruction`&&so(e.body,t)&&(e.isRecursive=!0),ke(e).forEach(e=>co(e,t))},lo=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Na(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.z(s),message:t})},l=t.kind===`Function`?oo(t.bounds,n,a):ja(n,t.params,a),u=wa(l,o)??Ta(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`?(z(t.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),co(t.body,o),t.isSelfReferential=so(t.body,o)):z(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:Da(o,wa(n,o)??Ta(o,a,s),{kind:`Definition`,arity:xa(t),range:s},a)},uo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(wa(e,t.name)?.isPending)return e;let n={name:t.name,arity:xa(t),params:Sa(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)=>So(t,e,n),e)};return s(e.reduce((e,t)=>{let a=va(t.name)?e:s(e,e=>!ba(t.location,e.location)),o={name:t.name,arity:xa(t),kind:`Definition`,range:t.location.range,parent:a};if(Ca(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||va(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return lo(t,a,u,i)?{...o,params:Sa(t)}:a},a),()=>!0)},fo=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:wa(t,r)??Ta(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},po=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=fo(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.z(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},mo=(t,n,r)=>{if(po(t,n,r))return;let i=t.operator,a=Ia(i,n,r),o=ao(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.z(t.argumentsRange??Ra(t,i)),message:`The operator ${i} requires ${o-(fo(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>ho(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.z(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=ao(e,e.operator,n,r);t!==void 0&&c(l,`The operator ${e.operator} requires ${t} arguments.`)}else z(e,n,r);return!0}if(e.kind===`Lambda`){z(e,n,r);let s=e.params.length===o;return!s&&ha.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)??Ra(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 z(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=Ia(u,n,r)?.params??[],f=ao(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Ra(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.`)})},ho=(e,t,n)=>{e.kind===`Identifier`?ao(e,e.name,t,n):z(e,t,n)},go=(e,t,n)=>{let r=ga.get(e);return r?(r.args.forEach(e=>ho(e,t,n)),n.errors.push(r.error),!0):!1},z=(t,n,r)=>{if(ha.has(t)&&!r.isGenerated){z(t,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>z(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(po(t,n,r))return;let i=t.name,a=ao(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.z(Ra(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:ao(t,t.operator,n,r);return;case`Apply`:mo(t,n,r);return;case`Lambda`:z(t.body,Aa(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`:z(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&&z(t.other,n,r);return;case`Let`:z(t.body,uo(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:z(t.body,oo(t.bounds,n,r),a(Na(t.bounds)));return;case`UnboundedQuantifier`:z(t.body,Aa(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&z(t.set,n,r),z(t.body,Aa(n,Ma(t.pattern),t.pattern.ranges,r),a(Ma(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:z(t.predicate,oo([t.bound],n,r),a(Ma(t.bound.pattern)));return;case`SetMap`:z(t.expression,oo(t.bounds,n,r),a(Na(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.z(i.location.range??La(i.location,i.name)),message:`Non-unique fields in constructor.`}),z(i.value,n,r)});return;case`Except`:z(t.function,n,r),t.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),z(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([t.function,...t.args]);return;case`FieldAccess`:z(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(no(t,r))return;z(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),ro(t,n,r);return;case`Subexpression`:if(go(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>ho(e,n,r)),io(t,n,r,!1)}},_o=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||po(t,n,r)||io(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&wa(n,i)?.isNonFact?r.errors.push({location:e.z(Ra(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||z(t,n,r)}),vo=(e,t,n)=>(e.set&&z(e.set,t,n),Oa(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),yo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:vo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?yo(t,e.scope,e.unit,!0):z(t,e.scope,e.unit),e),{scope:t,unit:n});return z(e.conclusion,i.scope,i.unit),i.scope},bo=(e,t,n)=>e.kind===`AssumeProve`?yo(e,t,n):(z(e,t,n),t),xo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&_o(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Co(t,e,r),t)},So=(e,t,n)=>{let r=ko(e,t,n);return e.name===void 0?r:Oa(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Co=(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=bo(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return xo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return xo(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 _o(r.facts,t,n),o(t);case`Instance`:return o(So(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?So(t,e,i):uo([t],e,n),t));case`Have`:case`Case`:return z(r.expression,t,i),xo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>z(e,t,i)),a(t);case`Take`:return a(Aa(oo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Aa(oo(r.bounds,t,i),r.names,r.nameRanges,i);return z(r.body,o,{...i,labelParams:[...i.labelParams,...Na(r.bounds),...r.names]}),xo(e.proof,a(t),n),a(o)}default:return xo(e.proof,a(t),n),a(t)}},wo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:bo(e.statement,void 0,t);e.name!==void 0&&ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),xo(e.proof,n,t),r&&(r.isInProof=!1)},To={line:0,column:0},Eo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Do=(e,t)=>{let n=new Map([...ya,...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},Oo=(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`){z(r,o,a);return}let i=ao(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.O(`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.z(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.z(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!wa(o,e.name)&&!Fa(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.z(i),message:`Substitution missing for symbol ${n.name} declared at ${e.z(o)} \nand instantiated in module ${r}.`})}),c},ko=(e,t,n)=>{let r=n.getInstance(e);return Oo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Oa(e,t,r,n),t)},Ao=(e,t,n,r)=>{let i=Do(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Oo(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:To}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},jo=(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)=>ba(e.location,t.location)?-1:+!!ba(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.O)||!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},Mo=(t,n)=>{let r=Do(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([...ya,...n.bound].map(([e,t])=>[e,{...t,position:To}])),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)=>ka(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return jo([...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=Da(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);Eo(t,e)?z(e.body,void 0,i):lo(e,void 0,i,s)&&o.set(e.name,{kind:`Definition`,arity:xa(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);ja(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>ka(t,e,i)),e.name!==void 0&&ka(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);z(e.expression,void 0,r),e.name!==void 0&&ka(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...t.theorems.map(e=>({location:e.location,check:(t,n)=>wo(e,l(e.location,void 0,t,n,e.name!==void 0))})),...t.uses.map(e=>({location:e.location,check:(t,n)=>_o(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.z(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},No=/* @__PURE__ */ new WeakSet,Po=/* @__PURE__ */ new WeakSet,Fo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Vo(e,(e,r)=>Fo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&E(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&E(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Io=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Lo=/* @__PURE__ */ new WeakMap,Ro=e=>Lo.get(e)??e.name,zo=(e,t)=>(Ro(t)!==e.name&&Lo.set(e,Ro(t)),e),Bo=(e,t)=>zo(e.kind===`Function`?{...e,bounds:Io(e.bounds,e=>t(e,[])),body:t(e.body,Na(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Vo=(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=>Bo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Io(e.bounds,n),body:t(e.body,Na(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,Ma(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,Ma(e.bound.pattern))};case`SetMap`:return{...e,bounds:Io(e.bounds,n),expression:t(e.expression,Na(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)}}},Ho=`LAMBDA`,Uo=(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 Vo(e,(e,n)=>(r.push(...Uo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Wo=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}},Go=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Ko=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},qo=(e,t)=>e.map(e=>({pattern:Ko(e.pattern,t),set:e.set})),Jo=(e,t)=>e.kind===`Function`?{...e,bounds:qo(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Yo=(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=>zo({...Jo(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:qo(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Ko(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Ko(e.bound.pattern,n),set:e.bound.set}};default:return e}},Xo=e=>`${e}@ENABLED`,Zo=(e,t)=>e.modes.get(t)??e,Qo=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!E(e)&&t.instantiation.variables.has(e.name),$o=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>$o(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=E(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?$o(r.body,t,/* @__PURE__ */ new Map):void 0},es=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Qo(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Xo(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:as(e.expression,Zo(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[as(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:as(e.subscript,Zo(t,`Primed`),n),location:r},as(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=$o(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:Xo(r),location:e.location},location:e.location},as({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ts=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:ma}),ns=(e,t)=>e.map(e=>ts(e.name,t)),rs=(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:[...ns(t,r),...i.map(e=>ts(e,r))],location:r},location:r}},is=(e,t)=>e.instantiation.isParameterized(t)?ss(e,t):void 0,as=(t,n,r)=>{let i=e=>as(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!E(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:as(t.expression,Zo(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:as(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},Zo(n,`Enabled`),r)};let c=es(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name);if(e)return No.add(e),e;let r=is(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&&xa(i)>0?rs(r,o,xa(i),t.location):{kind:`Apply`,operator:r,args:ns(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||Po.has(t),l=e=>(c&&Po.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:Ho,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Ho,args:r,resolution:ma},location:t.location};if(s)throw new e.O(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=is(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...ns(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=is(n,t.operator);if(e===void 0)return t;let r=a.getDefinition(t.operator);return o.length>0&&r?rs(e,o,xa(r),t.location):{...t,operator:e}}let l=Wo(n),u=Vo(t,(e,t)=>t.length===0?i(e):as(e,n,Go(r,t,l)));return Yo(u,r,l)},os=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:ts(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ss=(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=Wo(e),o=Jo(Bo(i,(t,n)=>as(t,e,Go(/* @__PURE__ */ new Map,n,a))),a);return os(o,r.params,i.location)}):t},cs=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Uo(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=>is(i,e)??e,getQualifiedKey:t=>{let n=is(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>os(r,e.params,r.location)):t}}},ls=e=>e.kind===`Let`&&e.instances!==void 0||ke(e).some(ls),us=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Vo(e,e=>us(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ba(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}},ds=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,fs=(e,t)=>e.definitions.some(e=>ls(e.body))||e.assumptions.some(e=>ls(e.expression))||e.theorems.some(e=>{let t=ds(e);return t!==void 0&&ls(t)})?{...e,definitions:e.definitions.map(e=>Bo(e,e=>us(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:us(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ds(e);return n===void 0?e:{...e,statement:us(n,t,[])}})}:e,ps=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}])),ms={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]}},hs=(e,t)=>{let n=ms[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},gs=(e,t)=>`${e}${t}`,_s=(e,t,n)=>`${e}${t}${n}`,vs=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},ys=(e,t,n)=>`${e},${t},${n}`,bs=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),xs=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ss=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Cs=(e,t,n,r)=>({...bs(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),ws=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ts=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Es=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,{...Cs(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Ds=Cs(`$Set`,0,[2],[1]),Os=Cs(`$Junction`,0,[3],[1]),ks=Cs(`$Choose`,0,[2],[1]),As=Cs(`$Function`,0,[3],[1]),js=Cs(`$FcnApply`,0,[2,2],[1,1]),Ms=Cs(`$RcdSelect`,0,[2,0],[1,1]),Ns=Cs(`'`,2,[1],[0]),Ps=Cs(`ENABLED`,1,[2],[0]),Fs=Cs(`[]`,3,[3],[0]),Is=Cs(`$SquareAct`,2,[2,1],[0,0]),Ls=Cs(`$WF`,3,[1,2],[0,0]),Rs=Cs(`$TemporalExists`,3,[3],[0]),zs=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Bs=e=>e.map(e=>({name:e,arity:0})),Vs=(t,n)=>n.location.range?e.L(`${t}.`,n.location.range):new e.O(`${t} at line ${n.location.line}, column ${n.location.column}`),Hs=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Us=e=>e.kind!==`Let`&&e.kind!==`Label`,Ws=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:h(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=h(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Es.get(e)??ps.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=bs(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(_s(e,n,t))}),t.data.constraints.forEach((e,t)=>xs(r.constraints,t,e)),Ss(r.argConstraints,gs(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ss(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>ws(t,r))throw new e.O(`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.O(`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(ys(e,n,r)),c=bs(Math.max(t.level,...n.filter((e,n)=>Ts(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)=>{Ts(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)=>xs(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||xs(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>xs(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||xs(c.constraints,e,ws(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=>xs(c.constraints,e,ws(r,a)))}))}),t.argParams.forEach(e=>{let t=vs(e),n=o(t.operator)?.operator;n&&xs(c.constraints,t.param,ws(n,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ss(c.argConstraints,t,e))),n.forEach((e,r)=>{let i=e.declared;i&&(Array.from({length:i.arity},(e,n)=>Ss(c.argConstraints,gs(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&Ss(c.argConstraints,gs(i.name,a),e.data.level)})))}),t.argParams.forEach(e=>{let t=vs(e),n=o(t.operator);n&&Ss(c.argConstraints,gs(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(vs(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=vs(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(_s(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(_s(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(_s(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=ne(`LAMBDA`,Bs(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=bs();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=zs(n,Bs(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 Vs(`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 Vs(`Action used where only temporal formula or state predicate allowed`,e);Hs.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Us(n)&&n.kind!==r)throw Vs(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=h(e,n);t.constraints.forEach((e,t)=>xs(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ss(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(t,n)=>{try{return ee(t,n)}catch(n){throw!(n instanceof e.O)||n.sany?n:Vs(n.message,t)}},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return bs();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(Os,n)}case`Prime`:case`Unchanged`:return c(Ns,[e.expression],t);case`Enabled`:return c(Ps,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Fs,[n])}case`If`:return c(Os,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Os,[...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(Os,[e.body],t,e.bounds.map(e=>e.set),Na(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Vs(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Rs:Os,[e.body],t,[],e.names);case`Choose`:return c(ks,[e.body],t,e.set?[e.set]:[],Ma(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Ds,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Ds,[e.predicate],t,[e.bound.set],Ma(e.bound.pattern));case`SetMap`:return c(Ds,[e.expression],t,e.bounds.map(e=>e.set),Na(e.bounds));case`FunctionConstruction`:return c(As,[e.body],t,e.bounds.map(e=>e.set),Na(e.bounds));case`Record`:return c(As,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Ds,e.fields.map(e=>e.value),t);case`Except`:return c(Ds,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(js,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(Ds,e.args,t)}]);case`Bracket`:return bs();case`FieldAccess`:return a(Ms,[o(e.record,t),{data:bs()}]);case`BoxAction`:case`AngleAction`:return c(Is,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Ls,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return bs()}},te=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>te(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 ke(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,zs(t,Bs(e.names))),i;default:return Vo(e,(e,r)=>(a(e,n,zs(t,Bs(r))),e)),i}},ne=(e,t,n,r)=>{let i=zs(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=te(n,i),c={...bs(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(gs(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(_s(e.name,n,t.name))).map(e=>ys(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(vs(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=vs(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},h=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...bs(),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=ne(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:h,toOperand:o}},Gs=(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`?Gs(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=bs(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>xs(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ss(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},Ks=(t,n,r,i)=>{let a=Ws(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`?Gs(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.z(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.z(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=jo([...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`?Gs(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.I(r)}})),...r],i);if(u.length>0)throw e.I(u,!1,void 0,i)},qs=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Js=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Ys=/* @__PURE__ */ new Set([...qs,...Js,`Enabled`]),Xs=/* @__PURE__ */ new Set([`~>`,`-+->`]),Zs=/* @__PURE__ */ new Set([...Xs,`\\cdot`]),Qs=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),$s=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),ec=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},tc=(e,t)=>Qs.has(e)||t.builtins.get(e)?.isStateLevel===!0,nc=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(qs.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Js.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Xs.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Ys.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Zs.has(e.operator))&&(r[0]|=1),Ys.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=ec(e);if(u!==void 0&&!E(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel)&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{tc(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),$s.has(u)&&(r[0]|=8),!a&&tc(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=32)}}ke(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},rc=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],ic=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},ac=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),oc=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=nc(rc(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=ic(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=ic(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!ac(t[e],l[e*r])))),p=ic(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},sc=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?cc(rc(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},cc=(e,t)=>{let n=t.facts.words,r=nc(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=sc(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}ac(e.callee,r[0])||(i[0]|=r[0]&14)}),i},lc=(e,t)=>!(sc(e,t)[0]&1),uc={any:2,repeated:4,streamed:8},dc=(e,t,n=`any`)=>(sc(e,t)[0]&uc[n])!==0,fc=(e,t)=>{let n=sc(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},pc=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},mc=(e,t)=>{let n=cc([e],t);return n[0]&16?void 0:pc(n)},hc=(e,t)=>!!(cc([e],t)[0]&1),gc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=nr.sets,a=i??[],o=a.length;nr.sets=a;try{return n()}catch(e){throw dd(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,nr.sets=i}},_c=(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},vc=e=>!e.includes(void 0),yc=e=>e.variables.map(()=>void 0),bc=(e,t,n)=>{let r=[...e];return r[t]=n,r},xc=(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}},Sc=e=>e.kind===`Identifier`?e.name:void 0,Cc=(e,t,n)=>{if(t.kind===`Label`)return Cc(e,t.body,n);let r=Sc(t);if(r===void 0)return;let i=ou(n,r);if(i?.kind===`Thunk`)return Cc(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Uu(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Cc(e,o.body,o.scope):void 0},wc=(e,t,n)=>{if(t.kind===`Prime`)return Cc(e,t.expression,n);if(t.kind===`Label`)return wc(e,t.body,n);let r=Sc(t);if(r===void 0)return;let i=ou(n,r);if(i?.kind===`Thunk`)return wc(e,i.expression,i.scope);if(i)return;let a=Uu(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?wc(e,a.body,a.scope):void 0},Tc=t=>{if(typeof t!=`boolean`)throw new e._(`TLC expected a boolean expression.`);return t},Ec=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Dc=(e,t,n)=>{t===void 0?vc(n)&&e.onState(n):vc(n)&&Ec(e)?kc(e,t,n):t.kind===`Predicate`?Ac(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?zc(e,t.expression,t.rest,t.scope,n):Oc(e,t,n)&&Dc(e,t.rest,n)},Oc=(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?iu(t,r.runtime.version):t}})();return!At(i,a)},kc=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){zc(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Oc(e,r,n):!Tc(H(r.expression,_c(e,r.scope,n))))return}e.onState(n)},Ac=(t,n,r,i,a)=>gc(t,n,()=>{switch(n.kind){case`Let`:Ac(t,n.body,r,id(n.definitions,_c(t,i,a)),a);return;case`Label`:Ac(t,n.body,r,i,a);return;default:if(Lc.has(n.kind))throw new e._(`The state relation is not a boolean expression.`);gc(t,n,()=>Rc(t,n,r,i,a))}}),jc=(e,t,n,r)=>{Tc(t)&&Dc(e,n,r)},Mc=(e,t,n,r,i)=>{let a=_c(e,r,i);if(t.kind===`Identifier`){let o=ou(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Ac(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Ac(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:Uu(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&lc(s,e.environment))){Ac(e,c.body,n,c.scope,i);return}jc(e,H(t,a),n,i);return}let o=Wu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Ac(e,o.body,n,nd(o,t.args,a),i):jc(e,H(t,a),n,i)},Nc=(e,t,n,r,i)=>{let a=n[r];a===void 0?Dc(e,t,bc(n,r,i)):At(a,i)&&Dc(e,t,n)},Pc=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Fc=(t,n,r,i,a)=>{let[o,s]=n.args,c=t.isInit?Cc(t,o,i):wc(t,o,i),l=_c(t,i,a);if(c===void 0){H(n,l)===!0&&Dc(t,r,a);return}let u=H(s,l),d=a[c];if(n.operator===`=`){Nc(t,r,a,c,u);return}let f=n.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(d!==void 0)H(n,l)===!0&&Dc(t,r,a);else{if(!An(f))throw new e._(`The right side of \\IN is not enumerable.`);for(let e of Un(f))Dc(t,r,bc(a,c,e))}},Ic=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Lc=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Rc=(t,n,r,i,a)=>{let o=_c(t,i,a);switch(n.kind){case`Identifier`:Mc(t,n,r,i,a);return;case`Apply`:if(Ic.has(n.operator)&&n.args.length===2){Fc(t,n,r,i,a);return}if(n.operator===`=>`&&n.args.length===2){if(Tc(H(n.args[0],o))){Ac(t,n.args[1],r,i,a);return}Dc(t,r,a);return}Mc(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)=>Pc(`Predicate`,t,i,e),r);Ac(t,e[0],n,i,a);return}let o=e[e.length-1];Ac(t,xc(n,e.length-1),Pc(`Predicate`,o,i,r),i,a);return}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2){e.forEach(e=>Ac(t,e,r,i,a));return}Ac(t,xc(n,e.length-1),r,i,a),Ac(t,e[e.length-1],r,i,a);return}case`Exists`:wu(n.bounds,o,e=>(Ac(t,n.body,r,e,a),!1));return;case`Forall`:{let e=[];if(wu(n.bounds,o,t=>(e.push(t),!1)),e.length===0){Dc(t,r,a);return}let i=e.slice(1).reduce((e,t)=>Pc(`Predicate`,n.body,t,e),r);Ac(t,n.body,i,e[0],a);return}case`If`:Ac(t,Tc(H(n.condition,o))?n.consequent:n.alternative,r,i,a);return;case`Case`:{let s=n.arms.find(e=>Tc(H(e.condition,o)))?.body??n.other;if(s===void 0)throw new e._(`TLC encountered a CASE with no conditions true.`);Ac(t,s,r,i,a);return}case`FunctionApplication`:{let e=ku(H(n.function,t.isInit?o:uu(o)));if(e){Ac(t,e.body,r,Au(e,n,o),a);return}break}case`Unchanged`:if(!t.isInit){zc(t,n.expression,r,i,a);return}break;case`BoxAction`:if(!t.isInit){Ac(t,n.action,r,i,a),zc(t,n.subscript,r,i,a);return}break;case`AngleAction`:if(!t.isInit){Ac(t,n.action,Pc(`Changed`,n.subscript,i,r),i,a);return}}jc(t,H(n,o),r,a)},zc=(e,t,n,r,i)=>gc(e,t,()=>{let a=Cc(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Nc(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Dc(e,n,i);return}let s=o.reduceRight((e,t)=>Pc(`Unchanged`,t,r,e),n);zc(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ou(r,t.name);if(a?.kind===`Thunk`){zc(e,a.expression,n,a.scope,i);return}let o=a?void 0:Uu(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){zc(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});At(s,c)&&Dc(e,n,i)}),Bc=(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}},Vc=/* @__PURE__ */ Error(`The replay found a successor`),Hc=(e,t,n,r)=>{let i=Bc(r,!1,n,()=>{throw Vc},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Pc(`Changed`,e.subscript,t,void 0);Ac(i,e.action,n,t,yc(r))}else Ac(i,e,void 0,t,yc(r));return!1}catch(e){if(e!==Vc)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Uc=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Bc(t,!0,void 0,n),o=i.reduceRight((e,t)=>Pc(`Predicate`,t.expression,t.scope,e),void 0);Ac(a,r.expression,o,r.scope,yc(t))},Wc=(e,t,n,r)=>{e.some(e=>Lc.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Bc(n,!1,t,e=>i.push(e));Ac(a,e.expression,void 0,e.scope,yc(n)),i.forEach(t=>r(t,e))})},Gc=/* @__PURE__ */ new WeakMap,Kc=/* @__PURE__ */ new WeakMap,qc=(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},Jc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Yc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Xc=(t,n)=>{let r=new e._(n);return t.isInit?r:e.K(r,e.W.error)},Zc=(e,t,n,r)=>{let i=Jl(n);return r&&Lc.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 ${Yc(e)}, TLC expected a boolean expression,\nbut instead found ${I(t)}.\n${i}`},Qc=(e,t,n)=>{let r=hi(t),i=B(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Yc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
138
- `:``}${i}`},$c=(e,t,n)=>el(e,t,H(t,n)),el=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw Xc(e,Zc(e,n,t,r))},tl=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=md(n,r.environment))(r),nl=e=>e===`=`||e===`\\in`||e===`\\subseteq`,rl=(e,t,n)=>{let r=n?Gc:Kc,i=r.get(e);if(i)return i;let a=Pl(e,t,n);return r.set(e,a),a},il=(e,t)=>{if(t.constants.has(e))return;let n=pu(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},al=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return al(e.expression,t,!1,r);if(e.kind!==`Identifier`||E(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=il(e.name,t);if(a&&!r.has(a))return r.add(a),al(a.body,t,n,r)},ol=(e,t,n)=>al(e,t,!n),sl=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return sl(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=id(e.definitions,qc(r,t,n));return sl(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ou(t,e.name);if(a?.kind===`Thunk`)return sl(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=il(e.name,r.environment);if(s)return sl(s.body,void 0,n,r,i)},cl=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||E(e))||!t&&e.kind===`Prime`,ll=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ll(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=il(e.name,t);if(i)return n.add(e.name),ll(i.body,t,n)},ul=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),dl=(e,t,n)=>ul.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||nl(e.operator)&&(cl(e.args[0],n)||ol(e.args[0],t,n)!==void 0)||E(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,fl=/* @__PURE__ */ new Set,pl=(e,t)=>{if(E(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Vo(e,(e,i)=>{let a=r.isReadOnly?pl(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},ml=(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||E(e)?void 0:pu(r,t);return i&&!n.has(i)&&(n.add(i),ml(i.body,t,n))?!0:ke(e).some(e=>ml(e,t,n))},hl=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=ol(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=ll(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return dl(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:rl(e,t,n)}},gl=(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(mc(e,t)===void 0||ml(e,t,/* @__PURE__ */ new Set))return!0;let n=pl(e,fl);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)}},_l=(e,t,n)=>{let r=e.map(e=>hl(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Ec(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Il(u)){d??=qc(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=tl(a,e,n,d);if(!el(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=qc(t,n,u);let r=tl(i,s,e.expression,d);if(!el(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=qc(t,n,u);let r=tl(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Jc(u,e.index,r),d=void 0;else if(!At(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let t of e.indices){let e=(r??u)[t];if(e===void 0)r??=u.slice(),r[t]=n[t];else if(!At(e,n[t]))return}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},vl=e=>(t,n,r,i,a,o)=>{$c(t,e,qc(t,n,r))&&o(r,i)},yl=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=qc(r,i,a);if(a[l]!==void 0){$c(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!An(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Yc(r)}, the right side of \\IN is not enumerable.`;throw Xc(r,`${t}\n${B(e)}`)}let p=Un(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(Jc(a,l,p[e]),o)}},bl=/* @__PURE__ */ new WeakMap,xl=e=>{let t=bl.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(xl),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return bl.set(e,n),n},Sl=(e,t)=>{let n=e.args[0],r=vl(e),i=(e,r,i)=>sl(n,r,i,e,!t)??-1,a=yl(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],qc(t,n,o));l(Jc(o,u,d),s)}},Cl=(e,t,n)=>{let r=B(e);return(i,a,o,s,c,l)=>{let u=qc(i,a,o),d=H(e.function,n?u:uu(u)),f=ku(d);if(f!==void 0){rl(f.body,t,n)(i,Au(f,e,u),o,s,c,l);return}if(!k(d))throw Xc(i,`In computing ${Yc(i)}, a non-function (${hi(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw Xc(i,`In computing ${Yc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},wl=(e,t)=>{if(ll(e,t))return _l([xl(e)],t,!1);if(e.kind===`Tuple`)return rl(xl(e),t,!1);let n=xl(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ou(i,e.name):void 0;l?.kind===`Thunk`?rl(xl(l.expression),t,!1)(r,l.scope,a,o,s,c):$c(r,n,qc(r,i,a))&&c(a,o)}},Tl=(e,t,n)=>{let r=e.operator,i=vl(e),a=E(e)?void 0:Uu(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=yd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=rl(a.body,t,n),o.body(e,i(qc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=qc(a,o,s),f=Wu(e,d);f?.kind===`Closure`?rl(f.body,t,n)(a,nd(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},El=(e,t,n)=>{let r=vl(e),i=E(e)?void 0:il(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ou(s,e.name);f?.kind===`Thunk`?rl(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=rl(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Dl=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||E(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!E(i))return;let a=al(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Ol=e=>e.kind===`And`?e.operands.flatMap(Ol):[e],kl=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&dl(e,t,!1),Al=e=>{let t=[];return(n,r,i)=>{let a=qc(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!el(n,i,tl(t,r,i,a)))return}}},jl=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Ol(e),r=n.findIndex(e=>!kl(e,t)||Dl(e,t)),i=r===-1?void 0:Dl(n[r],t);return i?{...i,before:r===0?void 0:Al(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>jl(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||E(e))return;let r=Uu(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=jl(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`||!E(o))return;let s=i.before,c=s&&yd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(qc(e,t,n)),n))}},Ml=(e,t,n)=>{let r=ou(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Nl=(e,t,n)=>{let r=e.map(e=>rl(e,t,n)),i=n?[]:e.map(e=>jl(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Ml(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Pl=(t,n,r)=>{let i=e=>rl(e,n,r);switch(t.kind){case`And`:return _l(t.operands,n,r);case`Or`:return Nl(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=_u(H(a.set,qc(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,su(i,t,u[n]),o,s,c,l)}}let o=r?void 0:gl(t,n);if(o){let e=_l(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=qc(r,i,a),d=t.bounds.map(e=>_u(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=su(n,o.names[t],e);if(t===d.length-1){let e=qc(r,i,a);if(!o.guards.every(t=>$c(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{wu(t.bounds,qc(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&mc(t,n)!==void 0&&!ml(t.body,n,/* @__PURE__ */ new Set)?pl(t,fl):void 0;return(n,r,i,o,s,c)=>{let l=[];wu(t.bounds,qc(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ou(r,e)?.kind===`Value`)){u.every(e=>$c(n,t.body,qc(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Il(i)?u.slice(r).every(e=>$c(n,t.body,qc(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,qc(r,i,a));if(typeof l!=`boolean`)throw Xc(r,Qc(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=qc(r,i,a),u=e.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw Xc(r,`In computing ${Yc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${hi(t)}) was used as a guard condition of a CASE.\n${Jl(e.source)}`)})?.body??n;if(!u)throw Xc(r,`In computing ${Yc(r)}, TLC encountered a CASE with no conditions true.\n${B(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=od(t.definitions,n);return(n,i,a,o,s,c)=>e(n,id(t.definitions,qc(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e._(`UNCHANGED appears in an initial predicate at ${Kl(t)}`)}:wl(t.expression,n);case`AngleAction`:{let e=i(t.action),r=xl(t.subscript),a=(e,t,i)=>{try{return $c(e,r,qc(e,t,i))}catch(t){throw e.isEnabled?iu(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,xl(t.subscript)],location:t.location});case`Label`:return i(t.body);case`Identifier`:return El(t,n,r);case`FunctionApplication`:return Cl(t,n,r);case`Apply`:{let e=t.args;if(nl(t.operator)){let i=ol(e[0],n,r);if(i!==void 0)return t.operator===`=`?_l([t],n,r):yl(t,()=>i);if(cl(e[0],r))return Sl(t,r)}if(t.operator===`=>`){let t=i(e[1]);return(n,r,i,a,o,s)=>{let c=H(e[0],qc(n,r,i));(typeof c==`boolean`?c:fu(c,`the left side of => at ${Kl(e[0])}`))?t(n,r,i,a,o,s):s(i,a)}}return Tl(t,n,r)}default:return vl(t)}},Fl=e=>e.variables.map(()=>void 0),Il=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ll=(t,n)=>{let r=n.state;if(!r||!Il(r))throw new e._(`ENABLED needs a complete state at ${Kl(t)}`);let i=n.environment;if(i.callStack)return Hc(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1};return rl(t,i,!1)(a,n.scope,Fl(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},Rl=(t,n,r,i)=>{let a={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};rl(t,n,!0)(a,i,Fl(n),void 0,!1,t=>{if(!a.isStopped){if(!Il(t))throw e.K(new e.v([...t]),e.W.error);a.isStopped=r(t)}})},zl=(e,t,n)=>{let r=[];return Rl(e,t,e=>(r.push(e),!1),n),r},Bl=(t,n,r,i,a)=>{let o={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1},s={successors:0};return rl(t,r,!1)(o,a,Fl(r),void 0,!1,(t,n)=>{if(!o.isStopped){if(!Il(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.y(`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},Vl=(e,t,n,r)=>{let i=[];return Bl(e,t,n,e=>(i.push(e),!1),r),i},Hl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Ul=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Wl=e=>Ul.has(e.kind)||e.kind===`Apply`&&Hl.has(e.operator),Gl=(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&&Be(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Kl=e=>`line ${e.location.line}, column ${e.location.column}`,ql=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,B=e=>{let t=e.location.range;return t?ql(t):Kl(e)},Jl=e=>e.kind===`Number`?e.text??String(e.value):B(e),Yl=(t,n)=>new e._(`A non-boolean expression (${hi(n)}) was used as the condition of an IF.\n${B(t)}`),Xl=(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._(`A non-boolean expression (${hi(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${Jl(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e._(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${hi(r)}.\n${B({...t,location:{...t.location,range:{...i,end:a}}})}`)},Zl=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${I(e)}\n${B(t)}`,i=e=>`Attempted to apply function:\n${D(I(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!k(a))throw new e._(`Attempted to select field "${n}" from a non-record value ${D(I(a))}\n${B(t)}`);let o=St(a);if(o===`tuple`)throw fr(n);return hr(a,n,o===`record`?r:i)}},Ql=e=>e===`1.7.4`?(t,n)=>lr(t,n,e):void 0,$l=t=>n=>{if(!k(n))throw new e._(`Attempted to apply the operator DOMAIN to a non-function\n(${hi(n)})\n${B(t)}`);return _r(n)},eu=(t,n)=>(r,i)=>{if(!O(r)||ut(r))throw new e._(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${B(t)}`);return n.evaluate([r,i])},tu=t=>e.K(new e._(`TLC can't handle real numbers: ${t.text} at ${Kl(t)}`),e.W.configParseError),nu=t=>e.K(new e._(`TLC can't handle a number this big: ${t.text??t.value} at ${Kl(t)}`),e.W.error),ru=(t,n)=>new e.k(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${B(n)}`,t),iu=(t,n)=>t instanceof e.k&&n!==`1.7.4`?new e._(`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,au=t=>new e._(`A primed expression appears outside an action at ${Kl(t)}`),ou=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},su=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),cu=(t,n,r)=>{if(n.kind===`Name`)return su(t,n.name,r);let i=er(r);if(!i||i.length!==n.names.length)throw new e._(`Cannot bind <<${n.names.join(`, `)}>> to ${I(r)}, which is not a tuple of that length`);return n.names.reduce((e,t,n)=>su(e,t,i[n]),t)},lu=(t,n)=>{if(k(t))return t;throw new e._(`A non-function (${hi(t)}) was applied as a function.\n${B(n)}`)},uu=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},du=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),fu=(t,n)=>{if(typeof t!=`boolean`)throw new e._(`Expected ${n} to be a boolean but found ${I(t)}`);return t},pu=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),mu=(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.`},hu=(t,n,r)=>{if(!O(t)||ut(t)){let i=I(t),a=r===`1.7.4`?void 0:mu(t,i);throw new e._(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${Jl(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${Jl(n)}\n${a}`)}},gu=(e,t,n)=>(hu(e,t,n),typeof e==`object`&&e.kind===`Interval`?wn(e):Ln(e)??Hn(e)),_u=(e,t,n)=>n===`1.7.4`?(hu(e,t,n),Ln(e)??Un(e)):gu(e,t,n),vu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Xn(e),e},yu=(e,t,n)=>vu(e)??_u(e,t,n),bu=(e,t,n)=>vu(e)??gu(e,t,n),xu=(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},Su=(e,t)=>e.map(e=>yu(H(e.set,t),e.set,t.environment.runtime.version)),Cu=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):xu(t[n],t=>i(n-1,cu(a,e[n].pattern,t)));return i(e.length-1,n)},wu=(e,t,n)=>Cu(e,Su(e,t),t.scope,n),Tu=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Eu=(e,t,n)=>{if(e.length===1)return cu(t,e[0].pattern,n);let r=er(n)??[];return e.reduce((e,t,n)=>cu(e,t.pattern,r[n]),t)},Du=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Ou=e=>Object.assign(e.value,{lambda:e}),ku=e=>Du(e)?e.lambda:void 0,Au=(t,n,r)=>{let i=t.value,a=n.args.map(e=>H(e,r)),o=a.length===1?a[0]:j(a),s=(e,t,r)=>`In applying the function\n${D(I(i))},\nthe ${e} is:\n${D(I(t))}${r}.\n${B(n.function)}`,c=t.bounds;if(c.length===1){if(!ir(o,i.domain))throw new e._(s(`first argument`,o,`which is not in its domain`));return Eu(c,t.scope,o)}let l=er(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[];if(l===void 0||l.length<c.length)throw new e._(`Attempted to apply a function to an argument not in its domain.\n${B(n.function)}`);return c.forEach((t,n)=>{let r=l[n],i=`argument number ${n+1}`;if(!ir(r,u[n]))throw new e._(s(i,r,`${t.pattern.kind===`Name`?``:`
139
- `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&er(r)?.length!==t.pattern.names.length)throw new e._(s(i,r,`which does not match its formal parameter`))}),Eu(c,t.scope,j(l.slice(0,c.length)))},ju=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:ql(n)}},Mu=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Nu=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},Pu=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Fu=(e,t)=>{let n=Tu(e.bounds,t),r=Nu(n,(n,r)=>H(e.body,du(t,Eu(e.bounds,su(void 0,e.name,r),n))),Mu(ju(e.bounds,e.body),e.bounds,n));return Ou({value:r,bounds:e.bounds,body:e.body,scope:su(void 0,e.name,r)}),e.bounds.length===1?Ct(r):r},Iu=(t,n)=>{if(typeof n!=`object`||St(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Be(n.domain))return n;try{let e=F(n);return yt(e.domain,e.range)}catch(t){if(t instanceof e._)return n;throw t}},Lu=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e._(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>Fu(t,e):md(Pu(t),n):md(t.body,n),Ru=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Lu(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(du(e,void 0)):e=>a[i]??r(du(e,void 0));return t.definitionEvaluators.set(e,o),o},zu=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Bu=(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)||!lc(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>Iu(t,Lu(t,n)(a)));ln(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e._)&&!e.U(t))throw t}}),Vu=(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,du(t,e.scope));return n&&(!e.isStreamed||Gn(r))&&(e.cache=r),r},Hu=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Uu=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Uu(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Hu(r):t.builtins.get(e)},Wu=(e,t)=>E(e)?Gu(e.operator,t):Uu(e.operator,t.environment)??Gu(e.operator,t),Gu=(e,t)=>{let n=ou(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Uu(e,t.environment)},Ku=e=>e.kind===`Closure`?e.params.length:e.arity,qu=(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:Gu(r,n);if(!i)throw new e._(`Expected an operator argument at ${Kl(t)}`);return i},Ju=(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)=>su(e,n.name,t[r]),e.scope);return H(e.body,du(n,r))},Yu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Ku(e),call:n=>Ju(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},Xu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Gu(e.name,t);return n!==void 0&&Ku(n)>0},Zu=(e,t)=>e.map(e=>Xu(e,t)?Yu(qu(e,t),t):H(e,t)),Qu=(t,n)=>new e._(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),$u=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),ed=(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 ed(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([])}},td=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Ue(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=E(e)?void 0:ed(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ou(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:$u(e,t)}}return t=>$u(e,t)},nd=(e,t,n,r)=>{if(t.length!==e.params.length)throw Qu(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:qu(t[a],n)}:(r?.[a]??td(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},rd=(e,t,n,r)=>e.kind===`Closure`?H(e.body,du(n,nd(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(_d(t,n),n):e.evaluate(Zu(t,n),n),id=(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),ad=(t,n,r)=>{let i=ou(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return Vu(i,r);if(i?.kind===`Operator`){if(Ku(i.operator)===0)return Ju(i.operator,[],r);throw new e._(`Operator ${t} is used without arguments`)}let a=ed(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw ru(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return Ru(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e._(`Unknown identifier ${t} at ${Kl(n)}`)},od=(e,t)=>({impure:new Set(e.filter(e=>dc(e,t))),streamed:new Set(e.filter(e=>dc(e,t,`streamed`)))}),sd=e=>[...e.facts.ids.keys()].some(t=>dc(t,e)),cd=e=>[...e.facts.ids.keys()].some(t=>dc(t,e,`repeated`)),ld=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,ud=(e,t,n,r)=>i=>{r.expressions.push(e);let a=nr.sets,o=nr.callStack,s=a??[],c=s.length;nr.sets=s,nr.callStack=r;try{let a=t(i),o=ld(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Wl(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=Gl(e,r.values),a=i&&!ke(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!k(a)?void 0:a;throw dd(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,nr.sets=a,nr.callStack=o}},dd=(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._){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},fd=(t,n,r)=>{if(!(r instanceof e._))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}},pd=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),V=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Md(e,t),i=t.callStack,a=i?ud(e,r,t,i):r;return t.evaluators.set(e,a),a},md=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=zi(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>md(e,t.environment)(t),hd=(e,t)=>{let n=e.name,r=E(e)?void 0:ed(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw ru(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n={reference:void 0};return r=>(n.reference??=Ru(e,t))(r)}return t=>ad(n,e,t)},gd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||E(e))return!0;let n=Uu(e.name,t);return n===void 0||Ku(n)===0},_d=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),vd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(_d(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&gd(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&gd(t[0],n)&&gd(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(Zu(t,n),n)},yd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Qu(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:td(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:qu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},bd=(e,t,n)=>{let r=yd(e,t,n),i={body:void 0};return t=>(i.body??=md(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},xd=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=V(r[0],n),t=V(r[1],n);return n=>!fu(e(n),`the left side of =>`)||fu(t(n),`the right side of =>`)}if(t.operator===`~>`)return()=>{throw new e._(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let i=E(t)?void 0:Uu(t.operator,n);if(i?.kind===`Closure`)return bd(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=V(r[0],n),i=$l(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=V(r[0],n);return Po.has(t)||hc(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=eu(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return vd(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e._(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=r.map(e=>td(e,n));return i=>{let o=Gu(t.operator,i);if(o)return rd(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e._(`${t.operator} is a function; apply it with brackets`):new e._(`Unknown operator ${t.operator} at ${Kl(t)}`)}},Sd=(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=>xu(yu(o(s),a.set,t.runtime.version),t=>fu(i(du(s,su(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)=>yu(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?fu(i(du(s,a)),r)!==n:xu(c[t],n=>l(t-1,su(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>wu(o,e,t=>fu(i(du(e,t)),r)!==n)?!n:n},Cd=(e,t)=>{if(e.kind===`Tuple`)return j(e.names.map(e=>{let n=ou(t,e);return n?.kind===`Value`&&n.value}));let n=ou(t,e.name);return n?.kind===`Value`?n.value:void 0},wd=/* @__PURE__ */ new WeakSet,Td=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&wd.add(e)},Ed=(t,n)=>{let r=wd.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=En(e),a=yt(r,r.map(e=>i(du(t,su(t.scope,n,e)))));return Be(e)?a:Ct(a)}let n=[],r=a.map(e=>bu(H(e.set,t),e.set,t.environment.runtime.version));return Cu(a,r,t.scope,e=>{let r=a.length===1?Cd(o.pattern,e)??!1:j(a.map(t=>Cd(t.pattern,e)??!1));return n.push([r,i(du(t,e))]),!1}),vn(n)},u=ju(a,t.body),d=(e,n)=>{let r=n.scope,o=Ou({value:Nu(e,e=>i(du(n,Eu(a,r,e))),Mu(u,a,e)),bounds:a,body:t.body,scope:r});return a.length===1?Ct(o):o},f=n.callStack;return n=>{let i=s?c(n):Tu(a,n);if(t.isRecursive||r||n.isKeepLazy||!M(i))return d(i,n);if(!Be(i)){if(f)return d(i,n);try{return l(i,n)}catch(t){if(!(t instanceof e._))throw t;return d(i,n)}}if(!f)return l(i,n);try{return l(i,n)}catch(e){throw fd(f,t,e),e}}},Dd=(e,t)=>{let n=wd.has(e);n&&Td(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):j(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(du(i,su(i.scope,`@`,e))):vr(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(Bi.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${B(e.function)}`)}return n}},Od=(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:ql(a)},s=(e,t)=>n=>fu(e(du(t,cu(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 Be(n)?vt(N(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 wu(t.bounds,n,t=>(r.push(e(du(n,t))),!1)),pn(r)}}let r=t.set;if(!r)return()=>{throw new e._(`TLC cannot evaluate an unbounded CHOOSE at ${Kl(t)}`)};let i=V(t.body,n),a=V(r,n);return n=>{let o=a(n);if(!O(o)||ut(o))throw new e._(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${B(t)}`);let s={value:void 0},c=bu(o,r,n.environment.runtime.version);if(xu(c,e=>{let r=cu(n.scope,t.pattern,e);return fu(i(du(n,r)),`the body of CHOOSE`)?(s.value=Cd(t.pattern,r),!0):!1}),s.value===void 0)throw new e._(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${B(t)}`);return s.value}},kd=e=>[...e].sort((e,t)=>ht(e.name,t.name)),Ad=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),jd=(e,t)=>{let n=kd(e),r=Ad(n),i=n.map(e=>V(e.value,t));if(r)return e=>On(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=>qe(a,i.map(t=>t(e)),o):e=>kn(a,i.map(t=>t(e)))},Md=(t,n)=>{let r=e=>V(e,n);switch(t.kind){case`Number`:{let e=t.value;return Ue(e)?()=>e:()=>{throw nu(t)}}case`Decimal`:return()=>{throw tu(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return hd(t,n);case`Apply`:return xd(t,n);case`Bracket`:return()=>{throw new e._(`A bracket without a function or subscript is not an expression at ${Kl(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e._(`An operator cannot be used as a value at ${Kl(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 Xl(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 Xl(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return n=>{if(!n.next)throw au(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=>At(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 Yl(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._(`A non-boolean expression (${hi(n)}) was used as a condition of a CASE. ${Jl(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e._(`Attempted to evaluate a CASE with no conditions true.\n${B(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(du(n,id(t.definitions,n)))}case`Forall`:case`Exists`:return Sd(t,n);case`UnboundedQuantifier`:return()=>{throw new e._(`TLC cannot evaluate an unbounded quantifier at ${Kl(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Od(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>pn(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>j(e.map(e=>e(t)))}case`FunctionConstruction`:return Ed(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 jd(t.fields,n);case`RecordSet`:{let e=kd(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 Dd(t,n);case`ExceptAt`:return n=>{let r=ou(n.scope,`@`);if(r?.kind!==`Value`)throw new e._(`@ appears outside an EXCEPT at ${Kl(t)}`);return r.value};case`FunctionApplication`:{Td(t.function);let e=r(t.function),i=n=>lu(e(uu(n)),t),a=t.args.map(r),o=Ql(n.runtime.version);if(a.length===1){let e=a[0];return t=>hr(i(t),e(t),o)}return e=>hr(i(e),j(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=Zl(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?fu(e(t),`an action`)||n(t):fu(e(t),`an action`)&&!n(t)}case`Enabled`:{let e=t.expression;return t=>Ll(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e._(`The subexpression reference at ${Kl(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new e._(`TLC cannot evaluate a temporal formula in a state at ${Kl(t)}`)}}},Nd=`tlc2/value/impl/`,Pd={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},Fd={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},Id=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)}},Ld=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Rd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],zd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Ld.get(e[3])}${`[]`.repeat(e[1].length)}`),Bd=(e,t)=>e[e[t].first].text,Vd=(e,t)=>Bd(e,t).replaceAll(`/`,`.`),Hd=t=>{let n=Id(t);if(n.readUint32()!==3405691582)throw new e.O(`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===Pd.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===Pd.integer?i.value=n.readInt32():t===Pd.float?n.readUint32():t===Pd.long||t===Pd.double?(n.readBytes(8),e++):t===Pd.class||t===Pd.string||t===Pd.methodType||t===Pd.module||t===Pd.package?i.first=n.readUint16():t===Pd.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Vd(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=zd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:Id(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()},()=>Vd(r,d.readUint16())):[],p=Rd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=zd(i.slice(a+1))[0],ee=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(`,`)})${ee}`})}return{pool:r,methods:s}},Ud=(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.A(`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===Pd.integer)return t.value;if(t.tag===Pd.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>=Fd.iconstM1&&t<=Fd.iconst5)s.push(t-Fd.iconst0),e+=1;else if(t===Fd.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===Fd.sipush)s.push(r()<<16>>16),e+=3;else if(t===Fd.ldc)s.push(l(o[e+1])),e+=2;else if(t===Fd.ldcW)s.push(l(r())),e+=3;else if(t===Fd.dup){let t=c();s.push(t,t),e+=1}else if(t===Fd.getstatic){let t=Ud(n,r());if(t.className!==`${Nd}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===Fd.invokestatic){let t=Ud(n,r()),o=c();if(t.className!==`${Nd}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===Fd.new)s.push({className:Bd(n,r()),value:void 0}),e+=3;else if(t===Fd.invokespecial){let t=Ud(n,r()),o=c(),s=c();if(!(t.className===`${Nd}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===Fd.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()},Gd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Hd(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)}))}},Kd=/* @__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(`,`),qd=[[`\\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`,`≀`],[`^+`,`⁺`]],Jd=/* @__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(`,`),Yd=/* @__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(`.`),Xd=/* @__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(`.`),Zd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),Qd=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
70
+ `],[2171,`Parsing or semantic analysis failed.`],[2213,`:
71
+ `],[2281,` - specifically: `],[2405,`failed.
72
+ `]]),ot=(e,t,n)=>{let r=n?at.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)}${st(t.slice(a),n)}`},st=(e,t)=>{let n=t?rt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Je.none} @!@!@\n${ot(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ct=(e,t=2)=>String(e).padStart(t,`0`),lt=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 ${ct(r%24)}h`:e>36e5?`${ct(r%24)}h ${ct(n)}min`:e>6e4?`${ct(n)}min ${ct(t)}s`:`${ct(t)}s`},ut=e=>`${e.getFullYear()}-${ct(e.getMonth()+1)}-${ct(e.getDate())} ${ct(e.getHours())}:${ct(e.getMinutes())}:${ct(e.getSeconds())}`,dt=/* @__PURE__ */ new WeakMap,ft=(t,n,r)=>{if(!(t instanceof e.b))return t;let i=e.it(new e.b(`${r}\n${t.message}`,t),e.Z(t));return dt.set(i,{code:n,headline:r,inner:t}),i},pt=e=>dt.has(e),mt=e.Q(`util.WrongInvocationException`),ht=e.W.slice(0,e.W.indexOf(`
73
+ `)),gt=`${e.W}tlc2.tool.EvalException: `,_t=`${e.W}util.Assert$TLCRuntimeException: `,vt=e=>it(e)?gt:_t,yt=t=>{try{return t()}catch(t){throw t instanceof e.b?it(t)?new e.b(`${e.U}${t.message}`):rt(t.message)?t:new e.b(`${e.W}${t.message}`):t}},bt=[gt,_t,e.W,e.U],xt=(t,n)=>{let r=dt.get(t);if(r)return`${r.headline}\n${xt(r.inner,n)}`;let i=t.message;if(t instanceof e.R)return i;let a=bt.find(e=>i.startsWith(e))??``;return`${a}${st(i.slice(a.length),n)}`},St=(t,n)=>{let r=dt.get(t),i=t.message;if(r)return{code:r.code,message:i,toolMessage:xt(t,!0)};if(t instanceof e.N)return{code:n?qe.stackOverflow:qe.general,message:i,toolMessage:i};if(n&&it(t))return{code:rt(i)?.code??qe.general,message:i,toolMessage:i};let a=n&&!i.startsWith(ht)&&!(t instanceof e.R),o=t instanceof e.M?mt:e.W,s=a?o:``;return{code:qe.general,message:`${s}${i}`,toolMessage:`${s}${xt(t,!0)}`}},Ct=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,wt=2147483647,Tt=1e6;let Et=Tt;const Dt=()=>Et,Ot=()=>Math.max(Et,10),kt=()=>`Attempted to construct a set with too many elements (>${Et}).`,At=(t,n)=>{if(t.length===Ot())throw new e.M(kt());t.push(n)},jt=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=Ot(),Mt=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},N=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Nt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),Pt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Ft=e=>typeof e==`object`&&e.kind===`ModelValue`,It=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Lt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:N(e)?`set`:`function`,Rt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let zt=!1;const Bt=(e,t)=>(zt=!0,e.writtenKeys=t,e),Vt=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Ht=e=>Vt(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Ut=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Ht(e),Wt=(e,t,n)=>Bt(Ir(e,t),n),Gt=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(Gt);e.writtenKeys=void 0,e.range.forEach(Gt)}},Kt=e=>e.every(e=>typeof e==`string`),qt=(e,t)=>e.length>0&&t.length>0&&Kt(e)!==Kt(t),Jt=(e,t)=>{zt&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return qt(n,r)?ar(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=xn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:xn(t,n);if(r!==0)return r}return 0},Yt=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=xn(n[e],r[e]);if(t!==0)return t}return 0},Xt=e=>Ft(e)?e.type:void 0,Zt=(t,n,r)=>{let i=Xt(t),a=Xt(n);if(i===void 0&&a===void 0)return;let o=r?`check equality of`:`compare`;if(Ft(t)&&Ft(n)){if(i===void 0||a===void 0||i===a)return;throw new e.b(`Attempted to ${o} the differently-typed model values ${L(t)} and ${L(n)}`)}throw i===void 0?new e.b(`Attempted to ${o} the typed model value ${L(n)} and the non-model value\n${L(t)}`):new e.b(`Attempted to ${o}${r?``:` the`} typed model value ${L(t)} and non-model value\n${L(n)}`)},Qt=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),$t=Qt(),en=e=>{Object.assign($t,Qt()),Sn.clear();for(let t of e)dn(t)},tn=()=>{$t.searchRank=$t.size},nn=()=>$t.unorderedString;let rn=!1;const an={isExpanded:!0,isViewPrinted:!1},on=e=>{rn=e.version===`1.7.4`,Et=e.maxSetSize??Tt,an.isExpanded=e.isLazyValueExpanded??!0,an.isViewPrinted=e.isViewPrinted??!1},sn=/* @__PURE__ */ new WeakMap,cn=(e,t)=>(an.isViewPrinted&&sn.set(e,t),e),ln=/* @__PURE__ */ new WeakMap,un=(e,t)=>(ln.set(e,t),e),dn=e=>($t.ranks[e]===void 0&&($t.ranks[e]=$t.size++),e),fn=e=>$t.ranks[dn(e)],pn=(e,t)=>{if(e===t)return 0;let n=$t.ranks,r=n[e],i=n[t],a=$t.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&($t.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},mn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),hn=(e,t)=>(mn(e)||mn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),gn=(t,n)=>new e.b(mn(t)?`Attempted to compare overridden value ${L(t,!0)} with non-overridden value:\n${L(n)}`:`Attempted to compare ${Lt(t)} ${L(t)} with ${Lt(n)} ${L(n)}`),_n=(t,n,r)=>{if(!mn(t))throw new e.b(`Attempted to ${r} the set ${L(P(t)?F(t):t,!0)} with the value:\n${L(n,!0)}`);if(!mn(n))throw gn(t,n);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.O(`Attempted to compare ${L(t,!0)} with the value\n${L(n,!0)}`)},vn={kind:`InfiniteSet`,name:`Any`},yn=t=>{throw new e.O(`Attempted to compare ANY with the value\n${L(t)}`)},bn=e=>{zt&&Gt(e),e===vn&&yn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},xn=(e,t)=>{if(e===t)return bn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Jt(e,t);if(n===`Set`&&r===`Set`)return Yt(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&Zt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Zt(e,t,!1),n===`ModelValue`?-1:1;if(e===vn||t===vn)return yn(e===vn?t:e);if(N(e)&&N(t)&&hn(e,t))return _n(e,t,`compare`);let i=N(e);if(i!==N(t))throw gn(e,t);if(n===`Interval`&&r===`Set`){let n=oi(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-oi(t);if(n!==0)return n}return i?Yt(F(e),F(t)):Jt(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return pn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Zt(e,t,!1),Ft(e))return-1;if(Ft(t))return 1;throw gn(e,t)},Sn=/* @__PURE__ */ new Map,Cn=32768,wn=t=>{let n=Sn.get(t);if(n)return n;if(Sn.size===Cn)throw new e.x(`TLC supports at most ${Cn} model values, but model value ${t} exceeds this limit.`);let r={kind:`ModelValue`,name:t,type:t.length>2&&t[1]===`_`?t[0]:void 0,rank:fn(t),hash:Li(Ri(zi(t),109)),fingerprint:Ji(Yi(t)^60)};return Sn.set(t,r),r},Tn=()=>[...Sn.values()],En=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),Dn=e=>{let t=En(e);return t.isNormalized=!0,t},On=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let kn=!1;const An=(e,t)=>(t===`lambda`&&(kn=!0),t!==void 0&&(e.functionClass=t),e),jn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Mn=e=>An(e,`lambda`),Nn=e=>Ct(e)&&e.isCached===!0;let Pn=!1;const Fn=e=>(Pn=!0,e),In=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Ln=e=>{Pn&&typeof e==`object`&&Ct(e)&&In.has(e.kind)&&(e.isCached=!0)},Rn=e=>{(kn||Pn)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Rn),e.range.forEach(Rn)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Rn):N(e)&&P(e)&&(Ln(e),F(e).elements.forEach(Rn))))},zn=(e,t)=>{if(Ln(e),e===t)return bn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Zt(e,t,!0),xn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Jt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Yt(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&oi(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==oi(t))return!1;if(Ft(e)||Ft(t))return e.kind===`LazyFunction`&&I(e),Zt(e,t,!0),Ft(e)&&Ft(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return zn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=ri(e.domain),r=ri(t.domain);if(n||r)return n===r;let i=ri(e.range),a=ri(t.range);return i||a?i===a:zn(e.domain,t.domain)&&zn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(ri(e))return ri(t);if(ri(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]&&zn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return ri(e)?ri(t):!ri(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>zn(e,t.factors[n]));let n=N(e)&&N(t)&&!(P(e)&&P(t));if(n&&hn(e,t))return _n(e,t,`check equality of`)===0;if(n){if(!mn(e)){let n=F(e);if(!mn(t))return Yt(n,F(t))===0}return ea(e)===ea(t)}return xn(e,t)===0},Bn=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):ea(n)===ea(r);return n},Vn=Bn(!1),Hn=Bn(!0),Un=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Wn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=qi(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Hn(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Hn(i[e],n))return i[e]}return n.kind===`Set`?Un(n.elements,t):(Un(n.domain,t),Un(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}},Gn=(e,t)=>t.length===0||jn(e)===`tuple`?1:Pi(t)?.low,Kn=e=>{if(!Pt(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Gn(e,t.domain)}},qn=e=>{if(!Pt(e))return;let t=I(e);return Kt(t.domain)?t:void 0},Jn=(e,t,n)=>(Zt(t,e,n),1),Yn={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`}},Xn=(e,t,n)=>{let r=Yn[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)}`},Zn=e=>e?`check equality of`:`compare`,Qn=(t,n,r,i)=>{let a=Kn(r);if(!a){if(Ft(r))return Jn(r,n,i);throw new e.b(`Attempted to ${Zn(i)} the function ${L(n)} with the value:\n${L(r)}`)}if(t.range.length!==a.range.length)return t.range.length-a.range.length;let o=()=>$n(t.range,a.range,i);if(t.low!==void 0&&t.range.length===0)return 0;if(t.low!==void 0&&a.low!==void 0)return t.low===a.low?o():t.low-a.low;let s=t.low??a.low;if(s===void 0)return $n(t.domain,a.domain,i)||o();let c=t.low===void 0?t.domain:a.domain;for(let n=0;n<c.length;n++){let r=c[n];if(typeof r!=`number`)throw new e.b(`Attempted to compare ${i?`an `:``}integer with non-integer${i||t.low!==void 0?`:`:``}\n${L(r)}.`);let a=t.low===void 0?r-(s+n):s+n-r;if(a!==0)return a}return o()},$n=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=ir(e[r],t[r],n);if(i!==0)return i}return 0},er=(t,n,r)=>{let i=I(t);if(jn(t)===`tuple`){let e=Pt(n)?di(n):void 0;return e?i.range.length-e.length||$n(i.range,e,r):Qn({...i,low:1},t,n,r)}if(jn(t)===`record`){let a=qn(n);if(!a){if(Ft(n))return Jn(n,t,r);throw new e.b(`Attempted to ${Zn(r)} record:\n${L(t)}\nwith non-record\n${L(n)}`)}return i.domain.length-a.domain.length||$n(i.domain,a.domain,r)||$n(i.range,a.range,r)}return Qn({...i,low:Gn(t,i.domain)},t,n,r)},tr=(e,t)=>mn(e)||mn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),nr=(e,t)=>{let n=It(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},rr=(t,n,r)=>{if(tr(t,n))return r?+!zn(t,n):xn(t,n);if(!It(t))return rr(F(t),n,r);if(!N(n)){if(Ft(n))return Jn(n,t,r);throw new e.b(`Attempted to ${Zn(r)} the set ${L(t)} with the value:\n${L(n)}`)}let i=nr(t,n);return i.elements.length-i.otherElements.length||$n(i.elements,i.otherElements,r)},ir=(t,n,r)=>{if(typeof t!=`object`){if(typeof n==typeof t)return r?t===n?0:1:xn(t,n);if(Ft(n))return Jn(n,t,r);throw new e.b(Xn(t,n,r))}return t.kind===`ModelValue`?(t.type!==void 0&&Zt(t,n,r),Ft(n)?r?t.name===n.name?0:1:t.rank-n.rank:-1):Pt(t)?er(t,n,r):rr(t,n,r)},ar=(e,t)=>ir(e,t,!1),or=(e,t)=>ir(e,t,!0)===0,sr=e=>{let t=[];for(let n of e){let e=lr(n,t);e.isFound||t.splice(e.index,0,n)}return t},cr=(e,t)=>{let n=pi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},lr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=cr(e,()=>ar(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},ur=(e,t)=>t.some(t=>cr(t,()=>or(t,e))),dr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,fr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(fr)),e.kind===`Function`&&(e.domain.forEach(fr),e.range.forEach(fr)))},pr=e=>{if(!(typeof e!=`object`||Nn(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return pr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(pr(e.left),pr(e.right));case`FunctionSet`:return pr(e.domain),pr(e.range);case`RecordSet`:return e.sets.forEach(pr);case`ProductSet`:return e.factors.forEach(pr)}},mr=(e,t)=>mi(zn,or,e,t),hr=e=>{for(let t=1;t<e.length;t++)if(xn(e[t-1],e[t])>=0)return!1;return!0},gr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},_r=e=>{for(let t=1;t<e.length;t++)Ln(e[t]);if(e.length<2||hr(e))return En(e);let t=[...e].sort(xn),n=[t[0]];for(let e=1;e<t.length;e++)xn(n[n.length-1],t[e])!==0&&n.push(t[e]);return En(n)},vr=e=>{if(gr(e))return En(e);let t=mi(_r,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},yr=En([]),br=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&xn(r[a],t)<0;)a++;a<r.length&&xn(r[a],t)===0||i.push(t)}return i.length===n.length?e:En(i)},xr=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&xn(r[a],t)<0;)a++;a<r.length&&xn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:En(i)},Sr=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=xn(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=En(i);if(e.hash!==0&&e.hash!==Hi){let t=e.hash,n=0;for(;n<a.length;n++){let e=qi(a[n]);if(e===Hi)break;t=t+Bi(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+Xi(a[e])|0;c.fingerprint=t}return c},Cr=e=>{let t=e.length<2?e:[...e].sort((e,t)=>xn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&xn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return On(n,r)},wr=e=>{let t=Cr(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:Bt(t,e.map(e=>e[0]))},Tr=[],Er=/* @__PURE__ */ new Map,Dr=[],Or=/* @__PURE__ */ new WeakMap,kr=e=>{let t=Tr[e]??Er.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Er.set(e,new WeakRef(n)):Tr[e]=n,n},Ar=e=>{if(oi(e),e.low===1&&e.high>=1)return kr(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},jr=e=>e.length>0&&(e===Tr[e.length]||e===Er.get(e.length)?.deref())||Or.has(e),Mr=e=>{let t=F(e).elements;return jr(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Nr=e=>{let t=Dr[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Dr[e]=n,n},Pr=e=>An(On(kr(e.length),e),`tuple`),Fr=e=>An(Cr(e),`record`),Ir=(e,t)=>An(On(e,t),`record`),Lr=e=>N(e)&&!mn(e),Rr=(e,t=!1)=>`UNION(${L(e.base,t)})`,zr=(t,n=e=>F(e).elements)=>{if(!Lr(t.base))throw new e.b(`Attempted to enumerate the nonenumerable set:\n${Rr(t)}`);return n(t.base)},Br=(t,n,r)=>{if(Lr(t))return t;throw new e.b(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${Rr(r)}`)},P=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 P(e.base);case`FunctionSet`:return P(e.domain)&&P(e.range)||Vr(e.domain)===!0||Vr(e)===!0;case`RecordSet`:return e.sets.every(P)||Vr(e)===!0;case`ProductSet`:return e.factors.every(P)||Vr(e)===!0;case`Union`:return P(e.base)&&(It(e.base)?dr(e.base):Qr(e.base)).every(P);case`SetOperation`:return e.operator===`\\cup`?P(e.left)&&P(e.right):e.operator===`\\cap`?P(e.left)||P(e.right):P(e.left);default:return!1}},Vr=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=Vr(e.domain);return t===void 0?void 0:!t&&Vr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Vr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return P(e)?F(e).elements.length===0:void 0;default:return}},Hr=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},Ur=(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},Wr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||mn(e.base))return;let t=F(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:Ur(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return En(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},Gr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(En(r.map(t=>e[t])));while(Ur(r,e.length))}return t},Kr=(t,n,r)=>{let i=[];for(let a=0;a<t.length;a++){let o=t[a];if(mn(o))throw new e.b(r(o,a));let s=n(o);if(s.length===0)return[[]];i.push(s)}return i},qr=(t,n=e=>F(e).elements)=>{if(typeof t!=`object`)throw new e.b(`Expected a set but found ${L(t)}`);switch(t.kind){case`Set`:return t.elements;case`MixedSet`:return sr(t.elements);case`Interval`:{let e=Ar(t);return e!==Tr[e.length]&&Or.set(e,t),e}case`Subset`:{if(oi(t.base)===0)return Gr([]);if(!N(t.base))throw new e.b(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${M(L(t.base))}`);let n=F(t.base).elements;if(n.length>30)throw new e.b(ai(t));return Gr(n)}case`FunctionSet`:{if(!rn&&ri(t))return[];if(mn(t.domain))throw new e.b(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(t.domain)}\ncannot be enumerated.`);let r=Mr(t.domain);if((r.length>0||rn)&&mn(t.range))throw new e.b(`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 Hr(r.map(()=>i)).map(e=>On(r,e))}case`RecordSet`:{if(!rn&&ri(t))return[];let e=Kr(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 Hr(e).map(e=>Fr(t.names.map((t,n)=>[t,e[n]])))}case`ProductSet`:{if(!rn&&ri(t))return[];let e=Kr(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 Hr(e).map(Pr)}case`FilteredSet`:if(!N(t.base)||mn(t.base))throw new e.b(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(t.base)}\nis not enumerable`);return F(vr(Qr(t.base).filter(e=>t.test(e,!1)))).elements;case`Union`:{let n=[];return zr(t).forEach((r,i)=>{let a=Br(r,i,t);if(jt(a))throw new e.M(kt());Qr(a).forEach(e=>At(n,e))}),F(vr(n)).elements}case`SetOperation`:{if(t.operator===`\\cap`&&!Lr(t.left)&&!Lr(t.right))throw new e.b(`Attempted to enumerate S \\cap T when neither S:\n${L(t.left)}\nnor T:\n${L(t.right)}\nis enumerable`);if(t.operator===`\\`&&!Lr(t.left))throw new e.b(`Attempted to enumerate S \\ T when S:\n${L(t.left)}\nis not enumerable.`);if(t.operator===`\\cup`)return F(vr(Yr(t))).elements;let n=t.operator===`\\`||Lr(t.left),r=n?t.left:t.right,i=n?t.right:t.left,a=[];return Mt(typeof r==`object`&&r.kind===`Interval`?r:Qr(r),e=>{gi(e,i)===(t.operator===`\\cap`)&&At(a,e)}),F(vr(a)).elements}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to enumerate the non-enumerable set ${L(t)}`);default:throw new e.b(`Expected a set but found ${L(t)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return En(qr(e));let t=typeof e==`object`&&Ct(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=pi.sets;n?.push(e);let r=qr(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`)?En(r):_r(r);return t&&(t.enumerated=i),i},Jr=e=>{if(!(typeof e!=`object`||Nn(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return Lr(e.base)||F(e),Jr(e.base);case`Union`:if(!It(e.base)&&Lr(e.base))return Jr(e.base);zr(e).slice(0,1).forEach(t=>Jr(Br(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!Lr(e.left)&&F(e),e.operator!==`\\cup`||Lr(e.left)&&Lr(e.right)||F(e),e.operator!==`\\cap`||Lr(e.left)?Jr(e.left):Jr(e.right),e.operator===`\\cup`&&Jr(e.right)}},Yr=t=>{if(!Lr(t.left)||!Lr(t.right))throw new e.b(`Attempted to enumerate S \\cup T when S:\n${L(t.left)}\nand T:\n${L(t.right)}\nare not both enumerable`);if(Jr(t.left),Jr(t.right),jt(t.left))throw new e.M(kt());let n=Qr(t.left),r=jt(t.right)?void 0:Qr(t.right);if(!r||n.length+r.length>Ot())throw new e.M(kt());return[...n,...r]},Xr=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=cr(e,()=>Yr(e)),n=F(vr(t)).elements;return e.enumerated=En(n),n},Zr=(e,t)=>{if(typeof e!=`object`||Nn(e))return F(e).elements.some(t);let n=pi.sets;n?.push(e),Jr(e);let r=ni(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Qr=e=>{let t=[];return Zr(e,e=>(t.push(e),!1)),t},$r=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,ei=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(ei);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(ei)&&e.range.every(ei);case`SetOperation`:return e.operator!==`\\cup`&&ei(e.left)&&ei(e.right);case`FilteredSet`:return ei(e.base);case`ProductSet`:return e.factors.every(ei);default:return!1}},ti=e=>typeof e!=`object`||Nn(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ti(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ti(e.left)||ti(e.right):$r(e)?.some(ti)??!1,ni=(e,t)=>{if(e.kind===`Union`)return zr(e,Qr).some((n,r)=>Zr(Br(n,r,e),t));if(e.kind===`FilteredSet`&&Lr(e.base))return Zr(e.base,n=>e.test(n,!1)&&t(n));if($r(e)?.some(ti))return qr(e,Qr).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!Lr(e.left)||!Lr(e.right)?F(e).elements.some(t):Zr(e.left,t)||Zr(e.right,t);let n=e.operator===`\\`||Lr(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return Lr(r)?Zr(r,n=>gi(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},ri=t=>{if(typeof t!=`object`||!N(t))throw new e.b(`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.b(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return t.factors.some(ri);case`RecordSet`:return t.sets.some(ri);case`FunctionSet`:return!ri(t.domain)&&ri(t.range);case`Union`:return zr(t).every((e,n)=>ri(Br(e,n,t)));default:return F(t).elements.length===0}},ii=(t,n,r)=>t.reduce((t,i)=>{let a=t*oi(i,n);if(a>2147483647)throw new e.b(r());return a},1),ai=e=>`Overflow when computing the number of elements in:\n${L(e)}`,oi=(t,n)=>{if(typeof t!=`object`)throw new e.b(`Attempted to compute the number of elements in the ${Lt(t)} ${L(t)}.`);switch(t.kind){case`ModelValue`:throw new e.b(`Attempted to compute the number of elements in the model value ${L(t)}.`);case`Function`:return t.domain.length;case`LazyFunction`:return oi(t.domain,n);case`Interval`:{let n=Math.max(0,t.high-t.low+1);if(n>2147483647)throw new e.b(`Size of interval value exceeds the maximum representable size (32bits): ${t.low}..${t.high}.`);return n}case`InfiniteSet`:case`SequenceSet`:throw new e.b(`Attempted to compute the number of elements in the overridden value ${L(t)}.`);case`Subset`:{let r=oi(t.base,n);if(r>=31)throw new e.b(ai(t));return 2**r}case`FunctionSet`:{if(n!==`1.7.4`){if(ri(t.domain))return 1;if(ri(t.range))return 0;if(oi(t.range,n)===1)return 1}let r=oi(t.domain,n),i=oi(t.range,n);if(i<=1)return r===0?1:i;let a=1;for(let n=0;n<r;n++)if(a*=i,a>2147483647)throw new e.b(ai(t));return a}case`RecordSet`:return n!==`1.7.4`&&ri(t)?0:ii(t.sets,n,()=>ai(t));case`ProductSet`:return n!==`1.7.4`&&ri(t)?0:ii(t.factors,n,()=>`Overflow when computing the number of elements in ${L(t)}`);default:return Ln(t),F(t).elements.length}},si=e=>`Attempted to check if the set ${L(e)}is finite.`,ci=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)throw new e.b(`Attempted to check if the ${Lt(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.b(`Attempted to check if the function:\n${L(t)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return ci(t.base)&&ri(t.base);case`Subset`:return ci(t.base);case`FunctionSet`:{let e=ci(t.domain);if(e&&ri(t.domain))return!0;let n=ci(t.range);return n&&ri(t.range)?!0:n&&(e||oi(t.range)===1)}case`RecordSet`:case`ProductSet`:{let e=t.kind===`RecordSet`?t.sets:t.factors,n=!0;for(let t of e)if(!ci(t))n=!1;else if(ri(t))return!0;return n}case`Union`:if(!Lr(t.base))throw new e.b(`Attempted to check if the nonenumerable set:\n${Rr(t)}\nis a finite set.`);return F(t.base).elements.every(ci);case`SetOperation`:if(t.operator===`\\cup`)return ci(t.left)&&ci(t.right);if(t.operator===`\\cap`){if(!ci(t.left)&&!ci(t.right))throw new e.b(si(t));return!0}if(ci(t.left))return!0;if(!ci(t.right))throw new e.b(si(t));return!1;case`FilteredSet`:if(!ci(t.base))throw new e.b(`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}},li=(e,t,n=xn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},ui=(t,n)=>{let r=t.elements;if(r.length>Ot())throw new e.M(kt());let i=Array.from({length:r.length},()=>!1),a=n.filter(e=>{let t=li(r,e);return!i[t]&&(i[t]=!0,!0)}),o=En(r);return a.some((e,t)=>e!==r[t])&&(o.writtenElements=a),o},di=t=>{if(typeof t!=`object`||!Pt(t))return;if(t.kind===`LazyFunction`&&(!N(t.domain)||mn(t.domain)))throw new e.b(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let n=I(t);return n.domain.every((e,t)=>e===t+1)?n.range:void 0},fi=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!Pt(t))return`${n} ${Lt(t)} ${L(t)}`;let r=jn(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)}`},pi={sets:void 0},mi=(t,n,r,i)=>{let a=pi.sets,o=pi.callStack,s=a?.length??0,c=o&&{...o,length:o.expressions.length};try{return t(r,i)}catch(t){if(!(t instanceof e.b))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)}},hi=e=>(pi.sets??[]).slice(e).some(e=>typeof e==`object`&&pi.callStack?.sources.has(e)===!0),gi=(e,t)=>{let n=pi.sets;if(n===void 0)return xi(e,t);n.push(t);let r=xi(e,t);return n.pop(),r},_i=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},vi=(e,t)=>li(t.elements,e)!==-1,yi=(e,t)=>t.isNormalized?lr(e,t.elements).isFound:ur(e,dr(t)),bi=(t,n)=>{if(t.type!==void 0)throw new e.b(`Attempted to check if the typed model value ${M(L(t))} is an element of\n${M(L(n))}`);return!1},xi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return _i(e,t)??Si(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Si(e,t)},Si=(t,n)=>{if(!N(n))throw new e.b(fi(t,n));switch(n.kind){case`Set`:return Ln(t),mi(vi,yi,t,n);case`MixedSet`:return ur(t,n.elements);case`Interval`:if(typeof t==`number`)return t>=n.low&&t<=n.high;if(n.low<=n.high&&(!Ft(t)||t.type!==void 0))throw new e.b(`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(Ft(t))return bi(t,n);if(!(n.name===`STRING`?typeof t==`string`:typeof t==`number`))throw new e.O(`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(!N(t)||mn(t))throw new e.b(`Attempted to check if the non-enumerable value\n${M(L(t))}\nis element of\n${M(L(n))}`);return F(t).elements.every(e=>gi(e,n.base));case`FunctionSet`:{if(!Pt(t)){if(Ft(t))return bi(t,n);throw new e.b(`Attempted to check if \n${L(t)}\nwhich is not a TLC function value, is in the set of functions:\n${M(L(n))}`)}let r=I(t),i=Gn(t,r.domain);return(i===void 0?mr(n.domain,En(r.domain)):mr({kind:`Interval`,low:i,high:i+r.domain.length-1},n.domain))&&r.range.every(e=>gi(e,n.range))}case`RecordSet`:{let r=Pt(t)?I(t):void 0;if(!r||!Kt(r.domain)){if(Ft(t))return bi(t,n);throw new e.b(`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=li(r.domain,e);return i!==-1&&gi(r.range[i],n.sets[t])})}case`ProductSet`:{let r=Pt(t)?di(t):void 0;if(r===void 0){let r=Pt(t)&&I(t).domain.every(e=>typeof e==`number`);if(Ft(t))return bi(t,n);if(r)return!1;throw new e.b(`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)=>gi(e,n.factors[t]))}case`FilteredSet`:try{return gi(t,n.base)&&n.test(t,!0)}catch(r){throw!(r instanceof e.b)||!it(r)?r:new e.b(`Cannot decide if element:\n${M(L(t))}\n is element of:\n${M(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!Lr(n.base))throw new e.b(`Attempted to check if:\n ${L(t)}\nis an element of the non-enumerable set:\n ${Rr(n)}`);let r=F(n.base).elements;return r.length>1&&r.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),r.some(e=>gi(t,e))}case`SetOperation`:return n.operator===`\\cup`?gi(t,n.left)||gi(t,n.right):gi(t,n.left)&&gi(t,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=di(t);if(r===void 0){if(Ft(t))return bi(t,n);throw new e.O(`Attempted to check if the value:\n${M(L(t))}\nis an element of ${M(L(n))}.`)}return r.every(e=>gi(e,n.base))}default:throw new e.b(fi(t,n))}},Ci=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?gi(e,n):e.range.every((e,r)=>Ci(e,t.range[r],n.range)),I=t=>{if(typeof t==`object`&&t.kind===`Function`)return t;if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return t.enumerated;if(P(t.domain)||oi(t.domain),!N(t.domain))throw new e.b(`The domains of formal parameters must be enumerable.`);let n=Mr(t.domain);return t.enumerated=An(On(n,n.map(e=>t.apply(e))),jn(t)),t.enumerated}throw new e.b(`Expected a function but found ${L(t)}`)},wi=(e,t,n)=>{let r=M(L(e)),i=M(L(t)),a=n===`1.7.4`;switch(jn(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.`}},Ti=(e,t)=>{if(!rn)return wi(e,t);let n=M(L(t));return jn(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ei=(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},Di=t=>new e.b(`Attempted to apply function with integer domain to the non-integer argument ${M(L(t))}`),Oi=(e,t)=>li(e.domain,t),ki=(e,t,n)=>{let r=Vt(e);throw rn||r!==e.domain||r.length<32?r.forEach(e=>or(e,t)):li(r,t,ar),n},Ai=(t,n,r)=>{let i=t.domain;if(typeof n!=typeof i[0]){let a=jn(t),o=a===`tuple`?`number`:a===`record`?`string`:void 0;if(o!==void 0&&typeof n!==o)throw new e.b(r(t,n));if(o===void 0&&!rn&&typeof n!=`number`&&jr(i))throw Di(n)}let a=Ei(i,n);return a===-1?mi(Oi,ki,t,n):a},ji=(t,n,r)=>{let i=t.domain,a=di(r),o=(e,n,r)=>`In applying the function\n${M(L(t))},\nthe ${e} is:\n${M(L(n))}\nwhich ${r}.\n`,s=()=>new e.b(o(`argument list`,r,`does not match its formal parameter`));if(a===void 0)throw s();if(typeof i!=`object`||i.kind!==`ProductSet`)throw new e.b(`Attempted to apply a function to ${L(r)}, which is not in its domain`);if(n.forEach((t,n)=>{if(n>=a.length)throw s();let r=a[n],c=`argument number ${n+1}`;if(!gi(r,i.factors[n]))throw new e.b(o(c,r,t===void 0?`is not in the function's domain ${L(i)}`:`is not in its domain`));if(t!==void 0&&di(r)?.length!==t)throw new e.b(o(c,r,`does not match its formal parameter`))}),a.length>n.length)throw s()},Mi=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!gi(t,e.lambdaDomain),Ni=(t,n,r)=>{if(typeof t==`object`&&t.kind===`LazyFunction`){if(t.enumerated)return Ni(t.enumerated,n,r);let i=t.boundTupleLengths;if(i!==void 0)return ji(t,i,n),t.apply(n);if(!gi(n,t.domain))throw new e.b(jn(t)===`lambda`?wi(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.b(`Attempted to apply ${L(t)}, which is not a function`);let i=r??wi;if(Mi(t,n))throw new e.b(i(t,n));let a=Ai(t,n,i);if(a===-1)throw new e.b(i(t,n));return t.range[a]},Pi=e=>jr(e)?Or.get(e)??Nr(e.length):void 0,Fi=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Pi(t.domain);if(n)return n;let r=En(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Ii=(t,n,r,i=!1)=>{if(typeof t==`object`&&t.kind===`LazyFunction`&&(i||t.enumerated===void 0)){if(!gi(n,t.domain))return t;let e=r(t.apply(n));return An({kind:`LazyFunction`,domain:t.domain,apply:r=>mr(n,r)?e:t.apply(r),source:t.source,boundTupleLengths:t.boundTupleLengths},jn(t))}if(!Pt(t))throw new e.b(`Attempted to apply EXCEPT construct to the value ${M(L(t))}.`);let a=I(t);if(Mi(a,n))return a;let o=Ai(a,n,Ti);if(o===-1)return a;let s=[...a.range],c=a.range[o],l=r(c);s[o]=l;let u=An(On(a.domain,s),jn(a));if(u.writtenKeys=a.writtenKeys,u.lambdaDomain=a.lambdaDomain,a.hash!==0&&a.hash!==Hi){let e=qi(l);if(e!==Hi){let t=qi(a.domain[o]);u.hash=c===l?a.hash:a.hash-Vi(t,qi(c))+Vi(t,e)|0}}if(a.fingerprint!==0){let e=a.domain[o];u.fingerprint=c===l?a.fingerprint:a.fingerprint-Zi(e,c)+Zi(e,l)|0}return u},Li=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Ri=(e,t)=>Math.imul(e^t,16777619),zi=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Li(t)},Bi=e=>Li(e+2654435769|0),Vi=(e,t)=>Li(Math.imul(e,668265261)+t|0),Hi=795548749,Ui=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=qi(t[e]);if(r===Hi)return Hi;n=n+Bi(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=qi(e.domain[n]),i=qi(e.range[n]);if(r===Hi||i===Hi)return Hi;t=t+Vi(r,i)|0}return t},Wi=t=>{if(typeof t!=`object`||t.kind===`ModelValue`)return;if(t.kind===`InfiniteSet`||t.kind===`SequenceSet`)throw new e.b(`TLC has found a state in which the value of a variable contains ${L(t)}`);if(N(t)){F(t).elements.forEach(Wi);return}let n=I(t);n.domain.forEach(Wi),n.range.forEach(Wi)},Gi=t=>{if(typeof t==`object`&&t.kind!==`ModelValue`)try{qi(t)===Hi&&Wi(t);return}catch(t){if(!(t instanceof e.b))throw t;return t}},Ki=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[]}},qi=e=>typeof e==`number`?Li(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?zi(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Ui(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?qi(I(e)):Hi:P(e)?qi(F(e)):Hi,Ji=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Yi=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ji(t)},Xi=e=>Ji($i(e)+2135587861|0),Zi=(e,t)=>Ji(Math.imul($i(e),374761393)+$i(t)|0),Qi=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Xi(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Zi(e.domain[n],e.range[n])|0;return t},$i=e=>typeof e==`number`?Ji(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Yi(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Qi(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?$i(I(e)):P(e)?$i(F(e)):Yi(ea(e)),ea=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ta(e),ta=t=>{if(t.kind===`ModelValue`)return`@${t.name}`;if(t.kind===`InfiniteSet`)return`<${t.name}>`;if(t.kind===`SequenceSet`)return`<Seq ${ea(t.base)}>`;if(t.kind===`FilteredSet`&&!P(t))throw new e.b(`Attempted to compare the non-enumerable set ${L(t)} with another value`);if(N(t))return P(t)?`{${F(t).elements.map(ea).join(`,`)}}`:`<${t.kind} ${L(t)}>`;let n=I(t);return`(${n.domain.map((e,t)=>`${ea(e)}:${ea(n.range[t])}`).join(`,`)})`},na={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},ra=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>na[e])}"`,ia=1999,aa=e=>e.reduce((e,t)=>e===0?0:e*oi(t),1),oa=e=>{if(e.kind===`Subset`)return oi(e.base)<=6?F(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return F(e);if(e.kind===`FunctionSet`){let t=ri(e.domain)?0:oi(e.domain);return(t===0?1:oi(e.range)**t)<=ia?F(e):void 0}return aa(e.kind===`RecordSet`?e.sets:e.factors)<=ia?F(e):void 0},sa=(t,n)=>{if(n||t.kind===`Union`||t.kind===`Subset`&&Pt(t.base)&&(t.base.kind===`Function`||P(t.base.domain)))return oa(t);if(P(t))try{return oa(t)}catch(t){if(t instanceof e.b)return;throw t}},ca=(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 Rr(e,t)}},la=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),ua=t=>{if(P(t.domain))try{return I(t)}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},da=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),F(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},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 ra(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(F(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=an.isExpanded?sa(e,t):void 0;return n?r(n):ca(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?an.isExpanded||!e.source?ua(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&rn&&jn(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&jn(e)!==`lambda`);if(i.domain.length===0&&jn(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):Ut(i);return jn(e)===`record`||i.domain.every(e=>typeof e==`string`&&la(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},fa=(t,n)=>{if(t===void 0)return!1;try{return zn(t,n)}catch(t){if(t instanceof e.b)return!1;throw t}},pa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,ma=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(pa,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
74
+ `;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(Ve(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},ha=(t,n)=>{let r=n?void 0:sn.get(t);if(r)return r();let i=Object.entries(t),a=ln.get(t),o=a!==void 0&&`_format`in t,s=o?t._format:i.length===1?`%s = %s
75
+ `:`/\\ %s = %s
76
+ `;if(typeof s!=`string`)throw new e.g(`The _format field of the ALIAS ${a} is ${L(s)}, but it must be a string.`);return i.filter(([e])=>!(o&&e===`_format`)).filter(([e,t])=>!n||!fa(n[e],t)).map(([t,n])=>{let r=ma(s,[t,M(L(n))]);if(r===void 0)throw new e.g(`The _format field of the ALIAS ${a} is ${L(s)}, but it must format two strings, the name and the value of a field.`);return r}).join(``)},ga=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let _a=ga[0];const va=()=>_a,ya=/* @__PURE__ */ new Int32Array(256),ba=/* @__PURE__ */ new Int32Array(256),xa=/* @__PURE__ */ new Int32Array(256),Sa=/* @__PURE__ */ new Int32Array(256),Ca=/* @__PURE__ */ new Int32Array(256),wa=/* @__PURE__ */ new Int32Array(256),Ta=/* @__PURE__ */ new Int32Array(256),Ea=/* @__PURE__ */ new Int32Array(256);let Da=0,Oa=0,ka=0,Aa=0;const ja=e=>{let t=(e^Aa)&255;Aa=(Aa>>>8|ka<<24)^Ca[t],ka=ka>>>8^ya[t]},Ma=e=>{let t=ga[e];_a=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);ya[e]=Number(BigInt.asIntN(32,t>>32n)),Ca[e]=Number(BigInt.asIntN(32,t))}let i=[ya,ba,xa,Sa],a=[Ca,wa,Ta,Ea];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Ca[o],i[e][r]=t[r]>>>8^ya[o]}}Da=Number(BigInt.asIntN(32,t>>32n)),Oa=Number(BigInt.asIntN(32,t))};Ma(0);const Na=e=>{let t=Aa^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Aa=ka^Ea[n]^Ta[r]^wa[i]^Ca[a],ka=Sa[n]^xa[r]^ba[i]^ya[a]},Pa=e=>{if(typeof e==`boolean`)return ja(0),ja(e?116:102),2;if(typeof e==`number`)return ja(1),Na(e),5;if(typeof e==`string`){ja(3),Na(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Na(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)ja(e.charCodeAt(n));return 5+e.length}return ja(21),Na(fn(e.name)+1),5},Fa=e=>{if(typeof e!=`object`||Ft(e))Pa(e);else if(Pt(e)){let t=I(e);ja(9),Na(t.domain.length);for(let e=0;e<t.domain.length;e++)Fa(t.domain[e]),Fa(t.range[e])}else{let t=F(e).elements;ja(5),Na(t.length);for(let e of t)Fa(e)}},Ia=e=>{let t=ka,n=Aa;ka=Da,Aa=Oa;for(let t of e)Fa(t);let r=BigInt(ka>>>0)<<32n|BigInt(Aa>>>0);return ka=t,Aa=n,r},La=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=ka,a=Aa;return e.forEach((e,n)=>{ka=Da,Aa=Oa;for(let n of t)Fa(e[n]);r[2*n]=Aa,r[2*n+1]=ka}),ka=i,Aa=a,n},Ra=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),za=1024,Ba=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*za),relations:[]}),Va=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Ha=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Ua=(e,t,n,r,i)=>{let a=t===`next`?Ha(e,t,r):void 0;if(a!==void 0)return a;let o=Va(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Wa=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Ga=(t,n,r)=>{let i=t===void 0?void 0:r.definitions.get(t),a=i?.kind===`Operator`?i.head:void 0,o=n.location.range;return!i||!a?`Action ${o?e.Y(o):`Unknown location`}`:Wa(i.body.location.range,o)||!o?`${i.name} ${e.Y(a)}`:`${i.name} ${e.Y(a)} (${o.start.line} ${o.start.column} ${o.end.line} ${o.end.column})`},Ka=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,qa=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Ja=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Ya=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(Ve(t.name)&2147483647)%e.length].unshift(t));t=e}t[(Ve(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Xa=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Za=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Qa=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),$a=(e,t,n)=>{let r=new Set(n.map(Ka)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(j(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Ra.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=Va(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Ka(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Qa(t.bounds):t.params.map(e=>e.name);m(t.body,Za(n,e.scope)),t.kind===`Function`&&Xa(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Za(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Za(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Ya(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,qa(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Ja(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,qa(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Za(Qa(e.bounds),t)),r(Xa(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Za(Qa(e.bounds),t)),r(Xa(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Za(Qa([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Za(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Za(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},eo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=eo(e,r,n);if(t!==-1)return t}}return-1},to=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=eo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:eo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},no=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},ro=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},io=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},ao=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},oo=(e,t)=>t.forEach((t,n)=>{let r=Ia([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*za+i;e.registers[o]=Math.max(e.registers[o],ao(a)+1)}),so=(e,t)=>{let n=e.registers.subarray(t*za,(t+1)*za),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*za*za/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*za?a===0?i:za*Math.log(za/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},co=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},lo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>co(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},uo=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},fo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],po=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},mo=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},ho=(t,n)=>{let r=[],i=/* @__PURE__ */ new Map,a=e=>{let n=[],r={primary:t.primary[e],secondary:t.secondary[e]};return(r.primary>0||r.secondary>0||fo(t,e))&&uo(n,r),po(t,e).forEach(e=>a(e).forEach(e=>uo(n,e))),i.set(e,n),n},o=(n,i,a,o)=>{let s=t.ranges[n];r.push({location:s?e.Y(s):`Unknown location`,depth:i,count:a,cost:o})},s=(e,n)=>o(e,n,t.primary[e],t.secondary[e]),c=(e,n)=>{let r=po(t,e),l=[];r.forEach(e=>(i.get(e)??a(e)).forEach(e=>uo(l,e)));let u={primary:t.primary[e],secondary:t.secondary[e]},d=fo(t,e),f=e=>r.forEach(t=>c(t,e));if(t.isUnchanged[e]){let t=l.filter(e=>e.primary!==0||e.secondary!==0);t.length===0?s(e,n):o(e,n,Math.max(u.primary,lo(t).primary),0);return}if(l.length===0){(u.primary!==0||d)&&s(e,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let t=l[0],r=t.primary===0&&t.secondary===0;if(t.primary<u.primary){s(e,n),f(n+1);return}if(!d&&p&&!r){o(e,n,t.primary,t.secondary);return}if(p&&r){d&&s(e,n),f(d?n+1:n);return}if(u.primary===t.primary&&u.secondary===t.secondary){s(e,n);return}}let m=!p||d;m&&s(e,n),f(m?n+1:n)};return po(t,n).forEach(e=>{a(e),c(e,0)}),r},go=[`init`,`next`,`invariant`,`constraint`,`implied`],_o=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,vo=e=>go.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>_o(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||_o(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),yo=(t,n,r,i)=>({variables:i.map(i=>{let a=r[i]?.range;return{label:`${n.variables[i]} ${a?e.Y(a):`Unknown location`}`,distinct:so(t,i)}}),relations:vo(t).map(e=>({kind:e.kind,label:e.label,...mo(t,e),expressions:ho(t,e.node)}))}),bo=(e,t,n)=>{let r=Ha(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},xo=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),So=(t,n)=>xo.has(t)?new e.b(n):new e.O(n),Co=(t,n,r,i)=>new e.O(`The ${t} argument of ${n} should be a ${r}, but instead it is:\n${L(i)}`),wo=(t,n,r=t)=>{if(!N(t)||mn(t))throw new e.O(`Applying ${n} to the following value,\nwhich is not a finite set:\n${L(r)}`);return F(t)},To=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||To(r))throw So(n,`${n} expects a value as argument ${t+1}`);return r},Eo=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw So(n,`${n} expects a boolean but received ${L(r)}`);return r},Do=(e,t,n)=>{let r=e[t];if(r===void 0||!To(r))throw So(n,`${n} expects an operator as argument ${t+1}`);return r},Oo=(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}),ko=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Ao=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),jo=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Mo=e=>e>2147483647||e<-2147483648,No=t=>new e.O(`Overflow when computing ${t}`),Po={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`},Fo={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Io={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`},Lo={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ro=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Fo[e.operator];if(e.kind!==`Function`)return Po[e.kind];let t=jn(e);return t===void 0?`FcnRcdValue`:Lo[t]},zo=e=>Io[Ro(e)],Bo=(t,n)=>new e.b(`Attempted to apply the operator overridden by the Java method\n${t},\nbut it produced the following error:\n${n}`),Vo=(t,n)=>{let r=r=>(...i)=>{let a=pi.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof e.b)||r instanceof e.v)throw r;let i=hi(a);throw pi.sets&&(pi.sets.length=a),t.isLazy!==!0&&r instanceof e.O&&!i?r:Bo(n,r.message)}},i=r(t.evaluate);return{...t,evaluate:(e,r)=>{if(e.length!==t.arity)throw Bo(n,`array is not of length ${t.arity}`);return i(e,r)},evaluateUnary:t.evaluateUnary&&r(t.evaluateUnary),evaluateBinary:t.evaluateBinary&&r(t.evaluateBinary)}},Ho=(e,t)=>{if(typeof e!=`number`)throw Bo(t,`Cannot cast tlc2.value.impl.${Ro(e)} to tlc2.value.impl.IntValue`);return e},Uo=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Wo=(e,t,n,r)=>{let i=Uo(e,n,`IntValue`,2);return jo(t,(e,n)=>{let a=Ho(n,i),o=Ho(e,i),s=r(o,a);if(Mo(s))throw No(`${o}${t}${a}`);return s})},Go=(t,n,r)=>{if(typeof t!=`number`)throw new e.O(`The ${n} argument of ${r} should be an integer, but instead it is:\n${L(t)}`);return t},Ko=(e,t,n=e)=>jo(e,(e,r)=>t(Go(e,`first`,n),Go(r,`second`,n))),qo=(e,t,n)=>({...Ao(e,t,n),isLazy:!0}),Jo=(e,t,n)=>{let r=Do(e,t,n);return()=>r.call([])},Yo=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Xo=()=>({implication:Ch,negate:wh,equivalent:Th,body:Eh,condition:(e,t)=>{if(typeof e!=`boolean`)throw oh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw sh(t,n,e);return e},apply:Ni,expectFunction:yh,tuple:Pr,set:vr,record:Ir,writtenRecord:Wt,equal:zn,enumerate:Nh,choiceElements:i_,noChoice:e=>{throw a_(e)},filterPredicate:r_,isReducible:Nt,finiteElements:e=>F(e).elements,addBounded:At,normalizedSet:Dn,isBeyondBound:jt,cardinality:oi,functionDomain:Mr,sortedFunction:On,unassigned:(e,t)=>{throw mh(e,t)},prime:kg,keepLazyContext:bh,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>_h(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Zo,Qo;const $o=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},es=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ts=e=>`local${e.counter++}`,ns=(e,t=/* @__PURE__ */ new Set)=>{let n=Be(e);return n!==void 0&&t.add(n),A(e).forEach(e=>ns(e,t)),t},rs=(e,t,n)=>{let r=ns(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=es(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},is=(e,t,n)=>`${es(e,U(t,e.environment))}(${rs(e,t,n)})`,as=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},os=(e,t,n,r)=>{let i=ts(e),a=ts(e),o=ts(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},ss=(e,t,n)=>{let r=t.kind===`Forall`;return as(e,n,n=>{let i=t.bounds.map(()=>ts(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${ms(e,r.set,n)}, ${es(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=ts(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${ms(e,t.body,n)}, ${es(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>os(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},cs=(e,t,n,r,i)=>as(e,i,i=>{let a=ts(e),o=ts(e),s=es(e,t),c=`choiceElements(${ms(e,n,i)}, ${s}, ${es(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${ms(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${os(e,a,o,l)} return noChoice(${s});`}),ls=(e,t,n,r)=>as(e,r,r=>{let i=ts(e),a=ts(e),o=ts(e),s=ts(e),c=es(e,t),l=`if (!isReducible(${i})) return ${es(e,n_(t,e.environment))}(${i}, ${rs(e,t,r)});`,u=ms(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${ms(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${os(e,a,s,d)} return normalizedSet(${o});`}),us=(e,t,n,r)=>as(e,r,r=>{let i=ts(e),a=ts(e),o=ts(e),s=ts(e),c=ts(e),l=ts(e),u=es(e,$g(t,e.environment)),d=rs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=ms(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${ms(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${os(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ds=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=ms(e,r[0],n),a=ms(e,r[1],n),o=es(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${ms(e,r[0],n)}, ${es(e,t)})`;if(t.operator===`<=>`)return`equivalent(${ms(e,r[0],n)}, ${ms(e,r[1],n)}, ${es(e,t)})`;if(j(t))return is(e,t,n);let i=og(t.operator,e.environment);if(i?.kind!==`Builtin`)return is(e,t,n);if(i.name===`DOMAIN`)return`${es(e,uh(t))}(${ms(e,r[0],n)})`;if(i.name===`TLCEval`)return is(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${es(e,dh(t,i))}(${ms(e,r[0],n)}, ${ms(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&zg(r[0],a))return`${es(e,i.evaluateUnary)}(${ms(e,r[0],n)})`;let o=r.length===2&&zg(r[0],a)&&zg(r[1],a);return i.evaluateBinary&&o?`${es(e,i.evaluateBinary)}(${ms(e,r[0],n)}, ${ms(e,r[1],n)})`:is(e,t,n)},fs=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(j(e))return!1;let r=_g(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return fs(e.expression,t,n);case`FieldAccess`:return fs(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>fs(e,t,n));default:return!1}},ps=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return ps(e.record);case`FunctionApplication`:return[e.function,...e.args].every(ps);default:return!1}},ms=(e,t,n)=>{let r=(t,r=n)=>ms(e,t,r);switch(t.kind){case`Number`:return Rt(t.value)?String(t.value):is(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(j(t))return is(e,t,n);let i=_g(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=es(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?es(e,i.value):is(e,t,n)}case`Apply`:return ds(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=es(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)}, ${es(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Jg(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${fs(t.function,n,e.environment)?r(t.function):ps(t.function)?r(t.function,i):is(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${es(e,t)}))`,o=lh(e.environment.runtime.version),s=o?`, ${es(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`${es(e,ch(t))}(${r(t.record)})`;case`Record`:{let i=s_(t.fields);if(c_(i))return is(e,t,n);let a=es(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}, ${es(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?is(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?ss(e,t,n):is(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?cs(e,t,t.set,t.pattern.name,n):is(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!Qg(t)?us(e,t,r.pattern.name,n):is(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?ls(e,t,t.bound.pattern.name,n):is(e,t,n);default:return is(e,t,n)}},hs=(e,t)=>{if(!Yo.has(e.kind)||(Qo??=$o(),!Qo))return;let n={environment:t,references:[],helpers:[],counter:0},r=ms(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
77
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Zo??=Xo(),Function(...Object.keys(Zo),...i,a)(...Object.values(Zo),...n.references)},gs={kind:`Local`},_s=/* @__PURE__ */ new WeakSet,vs=/* @__PURE__ */ new WeakMap,ys=/* @__PURE__ */ new WeakMap,bs=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},xs=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Ss=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Cs=e=>e.kind===`Operator`?e.params.length:0,ws=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ts=e=>e.name.includes(`!`),Es=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ds=(e,t,n)=>{let r=t.bindings.get(e);return r&&Ss(r.position,t.location)&&(!n||Ss(r.position,n.start))?r:void 0},Os=(t,n)=>t!==void 0&&n!==void 0&&e.Y(t)===e.Y(n),ks=(t,n,r,i)=>{if(n===void 0)return!0;if(Os(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.Y(a),s=n.range&&e.Y(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},As=(e,t,n,r)=>ks(t,Es(e,t)??Ds(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,js=(e,t,n)=>{ks(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ms=(e,t,n,r)=>t.reduce((e,t,i)=>As(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ns=(e,t,n)=>t.reduce((e,t)=>As(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Ps=e=>e.kind===`Name`?[e.name]:e.names,Fs=e=>e.flatMap(e=>Ps(e.pattern)),Is=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Ss(n.location,t.location))?n:void 0},Ls=(e,t)=>{let n=Is(e,t);return n?{key:t.getKey(n),arity:Cs(n),params:ws(n),kind:`Definition`}:t.imported.get(e)},Rs=(e,t,n)=>Es(t,e)??Ls(e,n),zs=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Bs=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:zs(e.location,e.spelling??t)},Vs=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Ss(e.location,e.args[0].location)?`prefix`:`postfix`}},Hs=e=>!/^[\p{L}\d_]/u.test(e),Us=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Ws=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Gs=(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])}})},Ks=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Gs(e.name,[],void 0):Gs(e.operator,e.args,e.argumentCounts),qs=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Js=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Fs(e.bounds),body:e.body,sets:qs(e.bounds)};case`SetMap`:return{names:Fs(e.bounds),body:e.expression,sets:qs(e.bounds)};case`SetFilter`:return{names:Ps(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ps(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}},Ys=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}},Xs=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Zs=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Qs=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Qs(e.body,t):A(e).reduce((e,n)=>e??Qs(n,t),void 0)},$s=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??$s(i,t,n||Zs(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Qs(e.set,t):Qs(e,t)},ec=e=>e.kind===`Label`?ec(e.body):e,tc=e=>typeof e==`number`?`argument selector ${e}`:e,nc=`within the scope of a declaration
78
+ from outside that declaration's scope.`,rc=(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.Y(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`&&ec(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:$s(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?Qs(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&Zs(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${nc}`);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=tc(t.operand);if(u.isSufficesOpen){if(Ws(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=ec(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?Rs(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=Js(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:Ys(e);if(!l)return;let f=Ws(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=Ws(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(Zs(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${nc}`);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.`))},ic=(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.Y(t.location.range),message:r}),!0)},ac=(t,n,r)=>{let i=t.location.range;if(!i||r.isGenerated)return;let a=e.Y(i),o=t.params.filter((i,a)=>{let o=Es(n,i)?.kind===`Parameter`,s=t.paramRanges?.[a];return!o&&s&&r.errors.push({location:e.Y(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)},oc=(e,t,n,r)=>{if(!Xs(e))return!1;let i=Ks(e),a=i[0],o=i.length>1&&a.kind===`Name`?Es(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&rc(e,i,o,t,n,r),o!==void 0},sc=(t,n,r,i)=>{let a=t.location;if(_c(t,r,i))return;let o=ys.get(t);if(o!==void 0)return o;if(bs(n))return t.kind===`Apply`?t.args.length:0;let s=Es(r,n);if(s?.isNonFact){i.errors.push({location:e.Y(Bs(t,n)),message:`Step number of non-expression step used as an expression.`});return}if(oc(t,r,i,!1)||Us(n)&&s)return t.kind===`Apply`?t.args.length:0;if(s&&t.kind!==`OperatorReference`&&(t.resolution=gs),s)return s.arity;let c=Ls(n,i);if(c)return t.kind===`Identifier`?t.name=c.key:t.operator=c.key,ys.set(t,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Es(r,l)!==void 0||Ls(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.Y(t.kind===`Apply`&&u===`-.`?zs(a,`-`):Bs(t,n));if(!Hs(n)||Us(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=Vs(t);f&&a.range&&i.errors.push({location:e.Y(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},cc=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Ms(e,Ps(t.pattern),t.pattern.ranges,n),t)),lc=(e,t)=>e.kind===`Identifier`&&e.name===t&&j(e)||A(e).some(e=>lc(e,t)),uc=(e,t)=>{e.kind===`FunctionConstruction`&&lc(e.body,t)&&(e.isRecursive=!0),A(e).forEach(e=>uc(e,t))},dc=(t,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:t.kind===`Function`?Fs(t.bounds):[],labels:/* @__PURE__ */ new Set},o=t.name,s=t.location.range,c=t=>{s&&!a.isGenerated&&a.errors.push({location:e.Y(s),message:t})},l=t.kind===`Function`?cc(t.bounds,n,a):Ns(n,t.params,a),u=Es(l,o)??Ds(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),uc(t.body,o),t.isSelfReferential=lc(t.body,o)):B(t.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):t.kind===`Function`?u===void 0:ks(o,Es(n,o)??Ds(o,a,s),{kind:`Definition`,arity:Cs(t),range:s},a)},fc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Es(e,t.name)?.isPending)return e;let n={name:t.name,arity:Cs(t),params:ws(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)=>Cc(t,e,n),e)};return s(e.reduce((e,t)=>{let a=bs(t.name)?e:s(e,e=>!Ss(t.location,e.location)),o={name:t.name,arity:Cs(t),kind:`Definition`,range:t.location.range,parent:a};if(Ts(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||bs(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return dc(t,a,u,i)?{...o,params:ws(t)}:a},a),()=>!0)},pc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Es(t,r)??Ds(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},mc=(t,n,r)=>{if(t.kind!==`Identifier`&&t.kind!==`Apply`)return!1;let i=pc(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.Y(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},hc=(t,n,r)=>{if(mc(t,n,r))return;let i=t.operator,a=Rs(i,n,r),o=sc(t,i,n,r);if(o===void 0)return;if(o!==t.args.length){r.errors.push({location:e.Y(t.argumentsRange??Bs(t,i)),message:`The operator ${i} requires ${o-(pc(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){t.args.forEach(e=>gc(e,n,r));return}let c=(t,n)=>{t&&r.errors.push({location:e.Y(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=sc(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&&_s.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)??Bs(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=Rs(u,n,r)?.params??[],f=sc(e,u,n,r);return e.kind===`Identifier`&&f!==void 0&&f!==o&&c(Bs(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.`)})},gc=(e,t,n)=>{e.kind===`Identifier`?sc(e,e.name,t,n):B(e,t,n)},_c=(e,t,n)=>{let r=vs.get(e);return r?(r.args.forEach(e=>gc(e,t,n)),n.errors.push(r.error),!0):!1},B=(t,n,r)=>{if(_s.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(mc(t,n,r))return;let i=t.name,a=sc(t,i,n,r);a!==void 0&&a>0&&r.errors.push({location:e.Y(Bs(t,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:sc(t,t.operator,n,r);return;case`Apply`:hc(t,n,r);return;case`Lambda`:B(t.body,Ms(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,fc(t.definitions,n,r,t.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(t.body,cc(t.bounds,n,r),a(Fs(t.bounds)));return;case`UnboundedQuantifier`:B(t.body,Ms(n,t.names,t.nameRanges,r),a(t.names));return;case`Choose`:t.set&&B(t.set,n,r),B(t.body,Ms(n,Ps(t.pattern),t.pattern.ranges,r),a(Ps(t.pattern)));return;case`SetEnumeration`:case`Tuple`:i(t.elements);return;case`SetFilter`:B(t.predicate,cc([t.bound],n,r),a(Ps(t.bound.pattern)));return;case`SetMap`:B(t.expression,cc(t.bounds,n,r),a(Fs(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.Y(i.location.range??zs(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(ic(t,r))return;B(t.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),ac(t,n,r);return;case`Subexpression`:if(_c(t,n,r))return;t.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>gc(e,n,r)),oc(t,n,r,!1)}},vc=(t,n,r)=>t.forEach(t=>{if(t.kind===`ModuleFact`||mc(t,n,r)||oc(t,n,r,!0))return;let i=t.kind===`Identifier`?t.name:t.kind===`Apply`?t.operator:``;t.kind===`Identifier`&&Es(n,i)?.isNonFact?r.errors.push({location:e.Y(Bs(t,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||B(t,n,r)}),yc=(e,t,n)=>(e.set&&B(e.set,t,n),As(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),bc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:yc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?bc(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},xc=(e,t,n)=>e.kind===`AssumeProve`?bc(e,t,n):(B(e,t,n),t),Sc=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&vc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>wc(t,e,r),t)},Cc=(e,t,n)=>{let r=Ac(e,t,n);return e.name===void 0?r:As(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},wc=(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=xc(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Sc(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Sc(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 vc(r.facts,t,n),o(t);case`Instance`:return o(Cc(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Cc(t,e,i):fc([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Sc(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Ms(cc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ms(cc(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...Fs(r.bounds),...r.names]}),Sc(e.proof,a(t),n),a(o)}default:return Sc(e.proof,a(t),n),a(t)}},Tc=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:xc(e.statement,void 0,t);e.name!==void 0&&js(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Sc(e.proof,n,t),r&&(r.isInProof=!1)},Ec={line:0,column:0},Dc=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Oc=(e,t)=>{let n=new Map([...xs,...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},kc=(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=sc(r,r.name,o,a);if(i!==void 0&&i!==n.arity)throw new e.P(`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.Y(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.Y(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let l=n.filter(e=>!c.has(e.name)),u=e=>!Es(o,e.name)&&!Ls(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.Y(i),message:`Substitution missing for symbol ${n.name} declared at ${e.Y(o)} \nand instantiated in module ${r}.`})}),c},Ac=(e,t,n)=>{let r=n.getInstance(e);return kc(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>As(e,t,r,n),t)},jc=(e,t,n,r)=>{let i=Oc(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),kc(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:Ec}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Mc=(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)=>Ss(e.location,t.location)?-1:+!!Ss(t.location,e.location)).forEach(t=>{let a=[],o=[];try{t.check(a,o)}catch(t){if(!(t instanceof e.P)||!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},Nc=(t,n)=>{let r=Oc(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([...xs,...n.bound].map(([e,t])=>[e,{...t,position:Ec}])),s=/* @__PURE__ */ new Set,c=[],l=(e,t,s,c)=>({location:e,check:(l,u)=>c({imported:r,getInstance:n.getInstance,definitions:n.definitions,getKey:n.getKey,location:e,self:t,facts:i,goals:a,bindings:o,errors:l,warnings:u,hasLabelScope:s,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),u=(e,t)=>e.map(e=>l(e.location,void 0,!1,n=>js(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Mc([...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=>l(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},r=ks(e.name,o.get(e.name),n,t);r&&(o.set(e.name,n),s.add(n)),c.push({declaration:e,binding:r?n:void 0})})),...t.definitions.map(e=>l(e.location,e,!0,n=>{Dc(t,e)?B(e.body,void 0,n):dc(e,void 0,n,s)&&o.set(e.name,{kind:`Definition`,arity:Cs(e),range:e.location.range,position:e.location})})),...t.instances.map(e=>l(e.location,void 0,!1,t=>{Ns(void 0,e.params,t),n.instanced.get(e)?.forEach((e,n)=>js(n,e,t)),e.name!==void 0&&js(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},t)})),...t.assumptions.map(e=>l(e.location,void 0,e.name!==void 0,t=>{B(e.expression,void 0,t),e.name!==void 0&&js(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...t.theorems.map(e=>l(e.location,void 0,e.name!==void 0,t=>Tc(e,t))),...t.uses.map(e=>l(e.location,void 0,!1,t=>vc(e.facts,void 0,t))),{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.Y(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},Pc=/* @__PURE__ */ new WeakSet,Fc=/* @__PURE__ */ new WeakMap,Ic=(e,t)=>{if(t.length===0)return e;let n={...e};return Pc.has(e)&&Pc.add(n),Fc.set(n,[...t,...Fc.get(e)??[]]),n},Lc=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Uc(e,(e,r)=>Lc(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&j(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&j(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Rc=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),zc=/* @__PURE__ */ new WeakMap,Bc=e=>zc.get(e)??e.name,Vc=(e,t)=>(Bc(t)!==e.name&&zc.set(e,Bc(t)),e),Hc=(e,t)=>Vc(e.kind===`Function`?{...e,bounds:Rc(e.bounds,e=>t(e,[])),body:t(e.body,Fs(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Uc=(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=>Hc(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Rc(e.bounds,n),body:t(e.body,Fs(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,Ps(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,Ps(e.bound.pattern))};case`SetMap`:return{...e,bounds:Rc(e.bounds,n),expression:t(e.expression,Fs(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)}}},Wc=(e,t)=>{Uc(e,(e,n)=>(t(e,n),e))},Gc=`LAMBDA`,Kc=e=>`${e}@SUBSTITUTION`,qc=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(qc),Jc=(e,t)=>{if(e.kind!==`Identifier`)return!qc(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=j(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!qc(n.body)},Yc=(e,t=/* @__PURE__ */ new Set)=>{let n=Be(e),r=n===void 0||t.has(n)?[]:[n];return Wc(e,(e,n)=>r.push(...Yc(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Xc=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}},Zc=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Qc=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},$c=(e,t)=>e.map(e=>({pattern:Qc(e.pattern,t),set:e.set})),el=(e,t)=>e.kind===`Function`?{...e,bounds:$c(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},tl=(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=>Vc({...el(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:$c(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Qc(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Qc(e.bound.pattern,n),set:e.bound.set}};default:return e}},nl=e=>`${e}@ENABLED`,rl=(e,t)=>e.modes.get(t)??e,il=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!j(e)&&t.instantiation.variables.has(e.name),al=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>al(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(il(e,t,n))return[e.name];let r=j(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?al(r.body,t,/* @__PURE__ */ new Map):void 0},ol=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return il(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:nl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:fl(e.expression,rl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[fl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:fl(e.subscript,rl(t,`Primed`),n),location:r},fl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=al(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:nl(r),location:e.location},location:e.location},fl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},sl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:gs}),cl=(e,t)=>e.map(e=>sl(e.name,t)),ll=(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:cl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ul=(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:[...cl(t,r),...i.map(e=>sl(e,r))],location:r},location:r}},dl=(e,t)=>e.instantiation.isParameterized(t)?ml(e,t):void 0,fl=(t,n,r)=>{let i=e=>fl(e,n,r),a=n.instantiation,o=a.params,s=e=>!r.has(e)&&!j(t);if(t.kind===`Enabled`&&n.mode===`Normal`)return{...t,expression:fl(t.expression,rl(n,`Enabled`),r)};if((t.kind===`WeakFairness`||t.kind===`StrongFairness`)&&n.mode===`Normal`)return{...t,subscript:i(t.subscript),action:i(t.action),enabled:fl(t.enabled??{kind:`AngleAction`,action:t.action,subscript:t.subscript,location:t.location},rl(n,`Enabled`),r)};let c=ol(t,n,r);if(c)return c;if(t.kind===`Identifier`&&s(t.name)){let e=a.substitutions.get(t.name),r=n.bindings;if(e&&(r===void 0||!Jc(e,a)))return Ic(e,[t]);if(e&&r){let n=Kc(t.name);return r.set(n,e),sl(n,t.location)}let i=dl(n,t.name);if(i===void 0)return t;if(o.length===0)return{...t,name:i};let s=a.getDefinition(t.name);return s&&Cs(s)>0?ul(i,o,Cs(s),t.location):{kind:`Apply`,operator:i,args:cl(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||Pc.has(t),l=e=>(c&&Pc.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:Gc,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...t,operator:Gc,args:r,resolution:gs},location:t.location};if(s)throw new e.P(`The operator ${t.operator} can only be substituted by an operator at line ${t.location.line}, column ${t.location.column}`);let u=dl(n,t.operator);return u===void 0?l({...t,args:r}):{...t,operator:u,args:[...cl(o,t.location),...r]}}if(t.kind===`OperatorReference`&&s(t.operator)){let e=a.substitutions.get(t.operator);if(e?.kind===`Identifier`||e?.kind===`OperatorReference`||e?.kind===`Lambda`)return Ic(e,[t]);let r=dl(n,t.operator);if(r===void 0)return t;let i=a.getDefinition(t.operator);return o.length>0&&i?ul(r,o,Cs(i),t.location):{...t,operator:r}}let l=Xc(n),u=Uc(t,(e,t)=>t.length===0?i(e):fl(e,n,Zc(r,t,l)));return tl(u,r,l)},pl=(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:sl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},ml=(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=Xc(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=el(Hc(i,(e,t)=>fl(e,s,Zc(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Fc.set(l,[u,...Fc.get(i.body)??[]]),pl({...c,body:l},r.params,i.location)}):t},hl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Yc(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=>dl(i,e)??e,getQualifiedKey:t=>{let n=dl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>pl(r,e.params,r.location)):t}}},gl=e=>e.kind===`Let`&&e.instances!==void 0||A(e).some(gl),_l=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Uc(e,e=>_l(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ss(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}},vl=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,yl=(e,t)=>e.definitions.some(e=>gl(e.body))||e.assumptions.some(e=>gl(e.expression))||e.theorems.some(e=>{let t=vl(e);return t!==void 0&&gl(t)})?{...e,definitions:e.definitions.map(e=>Hc(e,e=>_l(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:_l(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=vl(e);return n===void 0?e:{...e,statement:_l(n,t,[])}})}:e,bl=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}])),xl={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]}},Sl=(e,t)=>{let n=xl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Cl=(e,t)=>`${e}${t}`,wl=(e,t,n)=>`${e}${t}${n}`,Tl=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},El=(e,t,n)=>`${e},${t},${n}`,Dl=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Ol=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),kl=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Al=(e,t)=>{t.constraints.forEach((t,n)=>Ol(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>kl(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},jl=(e,t,n,r)=>({...Dl(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Ml=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Nl=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Pl=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,{...jl(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Fl=jl(`$Set`,0,[2],[1]),Il=jl(`$Junction`,0,[3],[1]),Ll=jl(`$Choose`,0,[2],[1]),Rl=jl(`$Function`,0,[3],[1]),zl=jl(`$FcnApply`,0,[2,2],[1,1]),Bl=jl(`$RcdSelect`,0,[2,0],[1,1]),Vl=jl(`'`,2,[1],[0]),Hl=jl(`ENABLED`,1,[2],[0]),Ul=jl(`[]`,3,[3],[0]),Wl=jl(`$SquareAct`,2,[2,1],[0,0]),Gl=jl(`$WF`,3,[1,2],[0,0]),Kl=jl(`$TemporalExists`,3,[3],[0]),ql=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Jl=e=>e.map(e=>({name:e,arity:0})),Yl=(t,n)=>n.location.range?e.q(`${t}.`,n.location.range):new e.P(`${t} at line ${n.location.line}, column ${n.location.column}`),Xl=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Zl=e=>e.kind!==`Let`&&e.kind!==`Label`,Ql=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:v(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=v(i,/* @__PURE__ */ new Map),r=t.getQualifiedName?.(e);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Pl.get(e)??bl.get(e);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:e,level:0,arity:0}},i=(e,t,n)=>{let r=Dl(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(wl(e,n,t))}),kl(r.argConstraints,Cl(e,n),t.data.level),Al(r,t.data)}),r},a=(t,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(n.kind===`Value`&&n.data.level>Ml(t,r))throw new e.P(`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.P(`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(El(e,n,r)),c=Dl(Math.max(t.level,...n.filter((e,n)=>Nl(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)=>{Nl(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)=>Ol(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Ol(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>Ol(c.constraints,t,e))),n.forEach((e,n)=>e.data.params.forEach(e=>{a(e)||Ol(c.constraints,e,Ml(t,n))})),n.forEach((e,t)=>{if(e.kind!==`Operator`)return;let r=e.data;n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>Ol(c.constraints,e,Ml(r,a)))}))}),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator);n?.kind===`Operator`&&Ol(c.constraints,t.param,Ml(n.data,t.index))}),[t.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>kl(c.argConstraints,t,e))),n.forEach((e,r)=>{if(e.kind!==`Declared`)return;let i=e.declared;Array.from({length:i.arity},(e,n)=>kl(c.argConstraints,Cl(i.name,n),t.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&kl(c.argConstraints,Cl(i.name,a),e.data.level)}))}),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator);n&&kl(c.argConstraints,Cl(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a(Tl(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),t.argParams.forEach(e=>{let t=Tl(e),n=o(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(wl(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(wl(t.operator,t.index,e)))}}),n.forEach((e,t)=>{if(e.kind!==`Declared`)return;let r=e.declared;n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(wl(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:_(`LAMBDA`,Jl(e.params),e.body,t)};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{kind:`Operator`,data:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Dl();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Dl()}}return{kind:`Value`,data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=ql(n,Jl(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 Yl(`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 Yl(`Action used where only temporal formula or state predicate allowed`,e);Xl.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Zl(n)&&n.kind!==r)throw Yl(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=>Al(i,v(e,n))),i},m=(t,n)=>{try{return h(t,n)}catch(n){throw!(n instanceof e.P)||n.sany?n:Yl(n.message,t)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Dl();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(Il,n)}case`Prime`:case`Unchanged`:return c(Vl,[e.expression],t);case`Enabled`:return c(Hl,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(Ul,[n])}case`If`:return c(Il,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(Il,[...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(Il,[e.body],t,e.bounds.map(e=>e.set),Fs(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw Yl(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?Kl:Il,[e.body],t,[],e.names);case`Choose`:return c(Ll,[e.body],t,e.set?[e.set]:[],Ps(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(Fl,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(Fl,[e.predicate],t,[e.bound.set],Ps(e.bound.pattern));case`SetMap`:return c(Fl,[e.expression],t,e.bounds.map(e=>e.set),Fs(e.bounds));case`FunctionConstruction`:return c(Rl,[e.body],t,e.bounds.map(e=>e.set),Fs(e.bounds));case`Record`:return c(Rl,e.fields.map(e=>e.value),t);case`RecordSet`:return c(Fl,e.fields.map(e=>e.value),t);case`Except`:return c(Fl,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(zl,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:c(Fl,e.args,t)}]);case`Bracket`:return Dl();case`FieldAccess`:return a(Bl,[o(e.record,t),{kind:`Value`,data:Dl()}]);case`BoxAction`:case`AngleAction`:return c(Wl,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(Gl,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Dl()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(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 A(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,ql(t,Jl(e.names))),i;default:return Wc(e,(e,r)=>a(e,n,ql(t,Jl(r)))),i}},_=(e,t,n,r)=>{let i=ql(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Dl(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(Cl(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(wl(e.name,n,t.name))).map(e=>El(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(Tl(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Tl(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...Dl(),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,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},$l=(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`?$l(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Dl(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),Al(a,e)}),a},eu=(t,n,r,i)=>{let a=Ql(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`?$l(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},c=t=>t?.kind===`Steps`?t.steps.flatMap(t=>{let n=e.Y(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.Y(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=Mc([...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`?$l(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.K(r)}})),...r],i);if(u.length>0)throw e.K(u,!1,void 0,i)},tu=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),nu=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),ru=/* @__PURE__ */ new Set([...tu,...nu,`Enabled`]),iu=/* @__PURE__ */ new Set([`~>`,`-+->`]),au=/* @__PURE__ */ new Set([...iu,`\\cdot`]),ou=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),su=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),cu=(e,t)=>ou.has(e)||t.builtins.get(e)?.isStateLevel===!0,lu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(tu.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(nu.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&iu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(ru.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&au.has(e.operator))&&(r[0]|=1),ru.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Be(e);if(u!==void 0&&!j(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{cu(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),su.has(u)&&(r[0]|=8),!a&&cu(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}A(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},uu=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},du=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),fu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=lu(ze(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=uu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=uu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!du(t[e],l[e*r])))),p=uu(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},pu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?mu(ze(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},mu=(e,t)=>{let n=t.facts.words,r=lu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=pu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}du(e.callee,r[0])||(i[0]|=r[0]&14)}),i},hu=(e,t)=>!(pu(e,t)[0]&1),gu={any:2,repeated:4,streamed:8},_u=(e,t,n=`any`)=>(pu(e,t)[0]&gu[n])!==0,vu=(e,t)=>{let n=pu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},yu=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},bu=(e,t)=>{let n=mu([e],t);return n[0]&16?void 0:yu(n)},xu=(e,t)=>!!(mu([e],t)[0]&1),Su=(t,n,r)=>new e.O(`Applying ${t} to the following value,\nwhich is not ${n}:\n${L(r)}`),Cu=e=>Pt(e)?I(e):void 0,wu=`a function with a finite domain`,Tu=(e,t,n)=>{let r=R(e,t,n),i=Cu(r);if(!i)throw Su(n,wu,r);return i},Eu=(e,t)=>{let n=R(e,1,t),r=Cu(n),i=r&&Au(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Co(`second`,t,`bag`,n);return i},Du=(e,t,n)=>{let r=t[n];if(!r||!ku(r))throw Co(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},Ou=(e,t)=>{if(!N(e)||!P(e))throw t();return F(e).elements},ku=e=>e.range.every(e=>typeof e==`number`&&e>0),Au=(e,t)=>{let n=e.domain.findIndex(e=>mr(t,e));return n===-1?void 0:e.range[n]},ju=t=>{if(typeof t==`number`)return t;let n=`tlc2.value.impl.${Ro(t)}`;throw new e.b(`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},Mu=(e,t)=>{let n=ju(e)+ju(t);if(Mo(n))throw No(`${e}+${t}`);return n},Nu=(e,t,n)=>{let r=ju(e.range[t]),i=Au(n,e.domain[t]);if(i===void 0)return r;let a=r-ju(i);if(Mo(a))throw No(`${r}-${i}`);return a},Pu=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>mr(t,e[0]));i?i[1]=Mu(i[1],n):e.push([t,n])},Fu=e=>e.domain.map((t,n)=>[t,e.range[n]]),Iu=On([],[]),Lu=t=>[Oo(`EmptyBag`,Iu),z(`IsABag`,1,e=>{let t=Cu(R(e,0,`IsABag`));return t!==void 0&&ku(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Tu(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Su(`BagCardinality`,`a bag`,t);return Mu(e,n)},0)}),z(`BagIn`,2,e=>{let t=Eu(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>Eu(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>Cu(R(e,t,`(+)`))),n=Du(e,t,0),r=Du(e,t,1),i=Fu(n);return r.domain.forEach((e,t)=>Pu(i,e,r.range[t],n.domain.length)),Cr(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=Cu(t),i=Cu(n);if(!r)throw Co(`first`,`(-)`,`bag`,t);if(!i)throw Co(`second`,`(-)`,`bag`,n);return Cr(r.domain.flatMap((e,t)=>{let n=Nu(r,t,i);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,t=>{let n=R(t,0,`BagUnion`),r=Ou(n,()=>Su(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Iu;let i=t=>{let r=Cu(t);if(!r)throw new e.O(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(n)}`);return r},a=Fu(i(r[0]));return r.slice(1).forEach(e=>{let t=i(e);t.domain.forEach((e,n)=>Pu(a,e,t.range[n]))}),Cr(a)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=Cu(t),i=Cu(n);if(!r)throw Su(`\\sqsubseteq`,wu,t);if(!i)throw Su(`\\sqsubseteq`,wu,n);return r.domain.every((e,t)=>{let n=Au(i,e);return ju(r.range[t])<=(n===void 0?0:ju(n))})}),ko(`BagOfAll`,2,e=>{let t=Do(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=Cu(n);if(!r)throw Co(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>Pu(i,t.call([e]),r.range[n])),Cr(i)}),z(`SubBag`,1,n=>{let r=R(n,0,`SubBag`);if(!Pt(r))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${zo(r)})\nline 106, col 58 to line 106, col 65 of module Bags`);let i=I(r),a=F(vr(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.b(`Attempted to apply a function to ${L(i)}, which is not in its domain`);return _r(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>On(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>Fi(Tu(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Ou(t,()=>Su(`BagToSet`,wu,t));return On([...n],n.map(()=>1))})],Ru={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},V={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},zu={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Bu=[{lower:`true`,upper:`TRUE`,token:V.true},{lower:`false`,upper:`FALSE`,token:V.false},{lower:`null`,upper:`NULL`,token:V.null}],Vu=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
79
+ `],[`r`,`\r`],[`f`,`\f`]]),Hu=1024,Uu=t=>{let n=+!!t.startsWith(``),r=n,i=0,a=n,o=!0,s=V.none,c=0,l=[Ru.emptyDocument],u=[void 0],d=[0],f=()=>`$${l.map((e,t)=>e===Ru.emptyArray||e===Ru.nonemptyArray?`[${d[t]}]`:e===Ru.emptyDocument||e===Ru.nonemptyDocument?``:`.${u[t]??``}`).join(``)}`,p=()=>` at line ${i+1} column ${r-a+1} path ${f()}`,m=t=>new e.b(`com.google.gson.stream.MalformedJsonException: ${t}${p()}
80
+ See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),h=()=>new e.b(`java.io.EOFException: End of input${p()}`),g=()=>{if(!o)throw m(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},_=e=>`/\\;#=`.includes(e)?(g(),!1):!`{}[]:, \f\r
81
+ `.includes(e),v=()=>{for(;r<t.length;){let e=t[r++];if(e===`
82
+ `){i++,a=r;return}if(e===`\r`)return}},y=e=>{for(;r+e.length<=t.length;r++)if(t[r]===`
83
+ `)i++,a=r+1;else if(t.startsWith(e,r))return!0;return!1},b=()=>{for(;r<t.length;){let e=t[r++];if(e===`
84
+ `)i++,a=r;else if(e===`/`){if(r===t.length)return e;g();let n=t[r];if(n!==`*`&&n!==`/`)return e;if(r++,n===`/`)v();else if(y(`*/`))r+=2;else throw m(`Unterminated comment`)}else if(e===`#`)g(),v();else if(e!==` `&&e!==`\r`&&e!==` `)return e}},ee=()=>{let e=b();if(e===void 0)throw h();return e},x=()=>{let e=Bu.find(e=>t[r]===e.lower[0]||t[r]===e.upper[0]);if(!e)return V.none;let n=e.lower.length;for(let i=0;i<n;i++){let n=t[r+i];if(n!==e.lower[i]&&n!==e.upper[i])return V.none}return r+n<t.length&&_(t[r+n])?V.none:(r+=n,e.token)},te=()=>{let e=zu.none,n=!1,i=0;for(;r+i<t.length;i++){if(i===Hu)return V.none;let a=t[r+i];if(a===`-`){if(e===zu.none)e=zu.sign;else if(e===zu.exponentE)e=zu.exponentSign;else return V.none}else if(a===`+`){if(e!==zu.exponentE)return V.none;e=zu.exponentSign}else if(a===`e`||a===`E`){if(e!==zu.digit&&e!==zu.fractionDigit)return V.none;e=zu.exponentE}else if(a===`.`){if(e!==zu.digit)return V.none;e=zu.decimal}else if(a<`0`||a>`9`){if(_(a))return V.none;break}else if(e===zu.sign||e===zu.none)n=a===`0`,e=zu.digit;else if(e===zu.digit){if(n)return V.none}else e===zu.decimal?e=zu.fractionDigit:(e===zu.exponentE||e===zu.exponentSign)&&(e=zu.exponentDigit)}return i===Hu||e!==zu.digit&&e!==zu.fractionDigit&&e!==zu.exponentDigit?V.none:(c=i,V.number)},S=()=>{let e=l.length-1,n=l[e];if(n===Ru.emptyArray)l[e]=Ru.nonemptyArray;else if(n===Ru.nonemptyArray){let e=ee();if(e===`]`)return V.endArray;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated array`)}else if(n===Ru.emptyObject||n===Ru.nonemptyObject){if(l[e]=Ru.danglingName,n===Ru.nonemptyObject){let e=ee();if(e===`}`)return V.endObject;if(e===`;`)g();else if(e!==`,`)throw m(`Unterminated object`)}let t=ee();if(t===`"`)return V.doubleQuotedName;if(t===`'`)return g(),V.singleQuotedName;if(t===`}`){if(n!==Ru.nonemptyObject)return V.endObject;throw m(`Expected name`)}if(g(),r--,_(t))return V.unquotedName;throw m(`Expected name`)}else if(n===Ru.danglingName){l[e]=Ru.nonemptyObject;let n=ee();if(n===`=`)g(),t[r]===`>`&&r++;else if(n!==`:`)throw m(`Expected ':'`)}else if(n===Ru.emptyDocument){if(b()===void 0)return V.eof;r--,t.startsWith(`)]}'
85
+ `,r)&&(r+=5),l[e]=Ru.nonemptyDocument}else if(n===Ru.nonemptyDocument){if(b()===void 0)return V.eof;g(),r--}let i=b();if(i===void 0){if(n===Ru.emptyDocument)return V.eof;throw h()}if(i===`]`&&n===Ru.emptyArray)return V.endArray;if(i===`]`||i===`;`||i===`,`){if(n!==Ru.emptyArray&&n!==Ru.nonemptyArray)throw m(`Unexpected value`);return g(),r--,V.null}if(i===`'`)return g(),V.singleQuoted;if(i===`"`)return V.doubleQuoted;if(i===`[`)return V.beginArray;if(i===`{`)return V.beginObject;r--;let a=x();if(a!==V.none)return a;let o=te();if(o!==V.none)return o;if(!_(t[r]))throw m(`Expected value`);return g(),V.unquoted},ne=()=>(s===V.none&&(s=S()),s),re=()=>{if(r===t.length)throw m(`Unterminated escape sequence`);let e=t[r++];if(e===`u`){if(r+4>t.length)throw m(`Unterminated escape sequence`);let e=t.slice(r,r+4);if(!/^[\da-fA-F]{4}$/.test(e))throw m(`Malformed Unicode escape \\u${e}`);return r+=4,String.fromCharCode(Number.parseInt(e,16))}let n=Vu.get(e);if(n!==void 0)return n;if(e===`
86
+ `)return i++,a=r,e;if(`'"\\/`.includes(e))return e;throw m(`Invalid escape sequence`)},ie=e=>{let n=``,o=r;for(;r<t.length;){let s=t[r++];if(s===e)return n+t.slice(o,r-1);s===`\\`?(n+=t.slice(o,r-1)+re(),o=r):s===`
87
+ `&&(i++,a=r)}throw m(`Unterminated string`)},ae=()=>{let e=r;for(;r<t.length&&_(t[r]);)r++;return t.slice(e,r)},oe=t=>{if(l.length-1>=255)throw new e.b(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${p()}`);l.push(t),u.push(void 0),d.push(0),s=V.none},C=()=>{l.pop(),u.pop(),d.pop(),d[l.length-1]++,s=V.none},se=()=>{let e=ne();return e!==V.endObject&&e!==V.endArray&&e!==V.eof},w=()=>{let e=ne(),t=e===V.unquotedName?ae():ie(e===V.singleQuotedName?`'`:`"`);return s=V.none,u[l.length-1]=t,t},ce=e=>e===V.true||e===V.false?e===V.true:e===V.null?null:e===V.number?(r+=c,{literal:t.slice(r-c,r)}):e===V.unquoted?ae():ie(e===V.singleQuoted?`'`:`"`),le=()=>{let e=ne();if(e===V.beginArray){oe(Ru.emptyArray);let e=[];for(;se();)e.push(le());return C(),e}if(e===V.beginObject){oe(Ru.emptyObject);let e=/* @__PURE__ */ new Map;for(;se();)e.set(w(),le());return C(),e}let t=ce(e);return s=V.none,d[l.length-1]++,t};if(ne()===V.eof)return null;let ue=le();return o=!1,ue!==null&&ne(),ue},Wu=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Gu=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Ku=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),qu=e=>{if(!Pt(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Fr(n):void 0},Ju=(t,n)=>{let r=`tlc2.value.impl.${Ro(t)}`,i=`tlc2.value.impl.${n}`;return new e.b(`class ${r} cannot be cast to class ${i} (${r} and ${i} are in unnamed module of loader 'app')`)},Yu=t=>new e.b(`Cannot convert value: unsupported value type tlc2.value.impl.${Ro(t)}`),Xu=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Zu=e=>`[${e.map(td).join(`,`)}]`,Qu=e=>`{${Ut(e).map(e=>`${Xu(typeof e[0]==`string`?e[0]:L(e[0]))}:${td(e[1])}`).join(`,`)}}`,$u=e=>{let t=I(e),n=di(t);return n?Zu(n):Qu(t)},ed=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,td=e=>typeof e==`string`?Xu(e):typeof e==`object`?e.kind===`ModelValue`?Xu(e.name):Ro(e)===`RecordValue`?Qu(I(e)):nd(e):String(e),nd=e=>{let t=Ro(e);if(t===`TupleValue`)return Zu(I(e).range);if(ed(t))return $u(e);if(Lr(e))return Zu(F(e).elements);throw Yu(e)},rd=e=>e.map(e=>`${td(e)}\n`).join(``),id=e=>{let t=Ro(e);if(t===`RecordValue`)return Qu(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${td(e)}`).join(`,`)}}`;if(ed(t))return $u(e);throw Yu(e)},ad=t=>{if(t===null)throw new e.b(`Cannot convert value: unsupported JSON value null`);if(typeof t==`boolean`)return t;if(typeof t==`string`)return dn(t);if(Array.isArray(t))return Pr(t.map(ad));if(t instanceof Map)return Fr([...t].map(e=>[dn(e[0]),ad(e[1])]));let n=Number(t.literal);if(!/^-?\d+$/.test(t.literal)||Mo(n))throw new e.b(`Cannot convert value: expected a 32-bit integer JSON number, but found ${t.literal}`);return n||0},od=t=>{if(typeof t!=`string`)throw new e.b(`Cannot cast tlc2.value.impl.${Ro(t)} to tlc2.value.impl.StringValue`);return t},sd=(e,t)=>{let n=Ni(e,t);if(typeof n!=`string`)throw Ju(n,`StringValue`);return n},cd=t=>{if(!Gu.has(t.toLowerCase()))throw Ku.has(t.toLowerCase())?new e.z(`IOUtils!Serialize does not support the charset ${t}`):new e.b(/^[a-zA-Z\d][\w.:+-]*$/.test(t)?`java.nio.charset.UnsupportedCharsetException: ${t}`:`java.nio.charset.IllegalCharsetNameException: ${t}`)},ld=(t,n,r,i)=>{let a=r.find(e=>!Wu.has(e));if(a!==void 0)throw new e.b(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new e.b(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new e.b(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new e.z(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=t.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new e.b(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?t.writeFile?.(n,i):t.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},ud=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},dd=(t,n)=>{let r=t.readFile?.(n);if(r===void 0)throw new e.b(`${n} (No such file or directory)`);return r},fd=e=>[Vo(Ao(`ToJson`,1,e=>dn(td(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Vo(Ao(`ToJsonArray`,1,e=>dn(nd(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Vo(Ao(`ToJsonObject`,1,e=>dn(id(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Vo(Ao(`JsonSerialize`,2,t=>{let n=od(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!di(r)&&!qu(r))throw Co(`second`,`JsonSerialize`,`sequence or record`,r);return ud(e,n),e.writeFile?.(n,td(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Vo(Ao(`ndJsonSerialize`,2,t=>{let n=od(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=di(r);if(!i)throw Co(`second`,`ndJsonSerialize`,`sequence`,r);return ud(e,n),e.writeFile?.(n,rd(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Vo(Ao(`JsonDeserialize`,1,t=>ad(Uu(dd(e,od(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Vo(Ao(`ndJsonDeserialize`,1,t=>Pr(dd(e,od(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>ad(Uu(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],pd=(e,t)=>[Vo(qo(`Serialize`,3,(n,r)=>{let i=Jo(n,2,`Serialize`)(),a=qu(i);if(!a)throw Co(`third`,`ndJsonSerialize`,`sequence`,i);if(sd(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Jo(n,0,`Serialize`)(),s=di(o);if(!s)throw Co(`first`,`Serialize`,`sequence`,o);let c=Jo(n,1,`Serialize`)();if(typeof c!=`string`)throw Co(`second`,`ndJsonSerialize`,`sequence`,c);let l=Ni(a,`openOptions`);if(Ro(l)!==`TupleValue`)throw Ju(l,`TupleValue`);let u=sd(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Ju(e,`StringValue`);return e});return cd(u),ld(e,c,d,rd(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],md={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},hd=e=>{let n=[],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=0,o=Tn(),s=e=>n.push(e&255),c=e=>{s(e>>8),s(e)},l=e=>{c(e>>16),c(e)},u=e=>e>32767?l(-e):c(e),d=e=>{s(md.string),l(0),l(-1),l(e.length),e.split(``).forEach(e=>s(e.charCodeAt(0)))},f=e=>{s(md.handle),u(e)},p=e=>{if(typeof e==`boolean`){s(md.boolean),s(+!!e);return}if(typeof e==`number`){s(md.integer),l(e);return}if(typeof e==`string`){a++,d(e);return}if(e.kind===`ModelValue`){s(md.modelValue),c(o.indexOf(e));return}if(e.kind===`Interval`){s(md.interval),l(e.low),l(e.high);return}let t=r.get(e);if(t!==void 0){f(t);return}if(r.set(e,a++),N(e)){let t=F(e).elements;s(md.set),l(t.length),t.forEach(p);return}let n=I(e),m=jn(e);m===`tuple`?(s(md.tuple),u(n.range.length),n.range.forEach(p)):m===`record`?(s(md.record),l(n.domain.length),n.domain.forEach((e,t)=>{let r=String(e),o=i.get(r);o===void 0?(i.set(r,a++),d(r)):f(o),p(n.range[t])})):(s(md.function),u(n.domain.length),s(1),n.domain.forEach((e,t)=>{p(e),p(n.range[t])}))};return p(e),(0,t.gzipSync)(Uint8Array.from(n))},gd=e=>[Vo(Ao(`_TLCTraceSerialize`,2,t=>{let n=od(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,hd(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],_d=25214903917n,vd=(1n<<48n)-1n,yd=e=>{let t=(BigInt.asUintN(64,e)^_d)&vd,n=e=>(t=t*_d+11n&vd,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^_d)&vd},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},bd=[],xd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Sd=()=>{for(let e=1277011;bd.length<1341;e++)xd(e)&&bd.push(e);return bd},Cd=e=>{let t=Sd(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},wd=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},Td=e=>{for(let t=Math.max(e,9);;t++){let e=wd(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)}}},Ed=(e,t,n)=>{if(t<=0)return[];let r=Td(t),i=BigInt(n.nextInt(t)),a=BigInt(Cd(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},Dd=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:wt),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Od=(1n<<63n)-1n-24n,kd=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Od*BigInt(n)+i)%t;return r<0n?r+t:r})},Ad=(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,jd=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Mr(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>On(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>Fr(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:Pr}}},Md=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Nd=(e,t,n,r)=>{if(ri(t))return[];let i=r===`1.7.4`?Dd:Ed;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=Md(t,r)?void 0:jd(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?kd(e,t,n):i(e,Number(t),n)).map(e=>a.create(Ad(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Pd=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...wo(t.domain,`RandomElement`,t).elements];return On(e,e.map(()=>Pd(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return Fr(t.names.map((e,r)=>[e,Pd(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return Pr(t.factors.map(e=>Pd(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.b(`Attempted to retrieve out-of-bounds element from the interval value ${L(t)}.`);return t.low+i}let r=wo(t,`RandomElement`).elements,i=Math.floor(n.nextDouble()*r.length);if(i>=r.length)throw new e.b(`Index ${i} out of bounds for length ${r.length}`);return r[i]},Fd=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Co(t,n,`nonnegative integer`,e);return e},Id=(e,t,n,r)=>_r(Array.from({length:t},()=>_r(e.filter(()=>r.nextDouble()<n)))),Ld=(e,t)=>{let n=`RandomSetOfSubsets`,r=Fd(R(e,0,n),`first`,n),i=Fd(R(e,1,n),`second`,n),a=R(e,2,n);if(!N(a)||!P(a))throw Co(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw Co(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Co(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Id(o,r,o.length===0?0:i/o.length,t.getRandom())},Rd=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,zd=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,Bd=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(Rd.test(t))return Number(t.replace(/[fFdD]$/,``));let n=zd.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},Vd=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=Fd(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw Co(`second`,n,`string literal representing a probability`,i);let a=Bd(i);if(a===void 0||a<0||a>1)throw Co(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!N(o)||mn(o)||!ci(o))throw Co(`third`,n,`finite set`,o);let s=oi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw Co(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return Id(F(o).elements,r,a,e.getRandom())}),Hd=t=>[Vo(z(`RandomSubset`,2,n=>{let r=Fd(R(n,0,`RandomSubset`),`first`,`RandomSubset`),i=R(n,1,`RandomSubset`);if(!Lr(i)||!ci(i))throw Co(`second`,`RandomSubset`,`a finite set`,i);let a=Md(i,t.version);if(a&&a.reduce((e,t)=>e*F(t).elements.length,1)>Ot())throw new e.b(kt());return _r(Nd(r,i,t.getRandom(),t.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,e=>Ld(e,t)),z(`TestRandomSetOfSubsets`,3,e=>Pr(Array.from({length:5},()=>F(Ld(e,t)).elements.length)))],Ud=(e,t=0n)=>{let n=yd(t),r=yd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Fr([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Ia,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Wd=e=>Cr([...e.possibleCounts].map(([e,t])=>[e,t])),Gd=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Wd(e)]]),Kd=e=>Fr([[`name`,e??`UnnamedAction`],[`location`,Fr([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),qd=/* @__PURE__ */ new WeakSet,Jd=(e,t)=>{let n=Fr([[`action`,_r(e)],[`state`,_r(t)]]);return qd.add(n),n},Yd=(e,t,n)=>{let r=e.map((e,t)=>Pr([t+1,Fr(Object.entries(e))])),i=r.slice(1).map((e,n)=>Pr([r[n],t[n],e])),a=n?[Pr([r[r.length-1],n.action,r[n.start]])]:[];return Jd([...i,...a],r)},Xd=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Gd(e).get(t)},Zd=(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||!t.pause)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.O(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},Qd=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:H(e),$d=e=>e.every(e=>e!==void 0),ef=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!j(e);if(i&&t.variableIndex.has(r))return 1;let a=A(e).map(e=>ef(e,t,n)),o=i?Dh(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(ef(o.body,t,n))),Math.max(0,...a)},tf=(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[qo(`AssertError`,2,t=>{let r=Do(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw new e.b(`In computing AssertError, a non-string expression (${Qd(r)}) was used as the err of an AssertError(err, exp).`);let i=Jo(t,0,`AssertError`)();try{Jo(t,1,`AssertError`)()}catch(t){if(t instanceof e.b)return st(t.message,n.isTool)===i;throw t}return!1}),Ao(`TLCGetOrDefault`,2,e=>Xd(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),Ao(`Trace`,0,(t,r)=>{let i=r?.environment.variables??[],a=r?.state??i.map(()=>void 0);if(!r||!$d(a)){let t=i.filter((e,t)=>a[t]===void 0);throw new e.b(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${t.length>1?`s`:``} ${t.join(`, `)} undefined).`)}return r.state?Pr(n.getBehavior(a).map(e=>{let t=r.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Fr(i===void 0?t:[[`_action`,i],...t])})):Pr([Fr([])])}),Ao(`CounterExample`,0,()=>n.counterExample??Jd([],[])),z(`ToTrace`,1,t=>{let n=R(t,0,`ToTrace`);if(typeof n!=`object`||!qd.has(n))throw new e.O(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(n)}`);let r=F(Ni(n,`state`)).elements.map(e=>di(e)??[]);return Pr(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.O(`The argument of ModelValue should be a string, but instead it is:\n${L(n)}`);return wn(n)}),qo(`TLCDefer`,1,(e,t)=>{let r=Do(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{W(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...qo(`PickSuccessor`,1,(r,i)=>{let a=i?.next??(i?.environment.variables??[]).map(()=>void 0);if(!$d(a)||i?.next&&n.isSeen(a))return!0;let o=Do(r,0,`PickSuccessor`),s=o.call([]);if(typeof s!=`boolean`)throw new e.b(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${zo(s)}) was used as the condition of an IF.\n${o.expression?Qd(o.expression):``}`);if(s||!i?.next||!i.state||!$d(i.state))return!0;let c=n.getSuccessorAction(i.state,a);throw t(Xe(n.isTool,qe.moduleOverrideStdout,Je.none,`Extend behavior of length ${n.getLevel(i.state)} with a "${c?.name}" step [<Action ${c?.location.range&&e.Y(c.location.range)}>]? (Yes/no/explored/states/diff):`)),new e.v}),isActionLevel:!0},qo(`TLCCache`,2,(e,t)=>{let i=Do(e,0,`TLCCache`),o=ea(Jo(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=ef(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Gi(t);if(n)throw n;return Number(BigInt.asIntN(32,Ia([t])))}),qo(`TLCEvalDefinition`,1,(t,n)=>{let r=Jo(t,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new e.O(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${L(r)}`);let i=n?Dh(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new e.O(`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){let t=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new e.O(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${t.join(`, `)})`)}return i.kind===`Operator`?W(i.body,n):W({kind:`Identifier`,name:r,location:i.location},n)})]},nf=(e,t)=>[Ao(`_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}),Ao(`_Counts`,0,()=>Wd(t)),Ao(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Wd(t),!0)),!1)}),Ao(`_PrintCounts`,0,()=>(e(L(Wd(t),!0)),!0))],rf=e=>`${e.getUTCFullYear()}.${ct(e.getUTCMonth()+1)}.${ct(e.getUTCDate())}.${ct(e.getUTCHours())}${ct(e.getUTCMinutes())}${ct(e.getUTCSeconds())}`,af=e=>Cr([...e].map(([e,t])=>[e,Pr([t])])),of=e=>An(wr(e),`record`),sf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),cf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),lf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),uf=(t,n,r)=>{if(t.version===`1.7.4`?!cf.has(n)||!t.isStarted&&lf.has(n):!t.isStarted&&sf.has(n))throw new e.O(`TLCGet(${n}) was undefined.`);let i=t.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=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 a;case`stats`:return of([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,a],[`worker`,0]]);case`config`:return of([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,String(BigInt.asIntN(64,va()))],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return of([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,dn(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,dn(rf(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return Kd(void 0);case`all`:return af(t.registers);case`all:named`:return af(Gd(t))}if(n.startsWith(`s:`)){let r=Gd(t).get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return dn(t.properties.get(n.slice(2))??n);throw new e.O(`TLCGet(${n}) was undefined.`)},df=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.O(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.O(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(n)}`);return uf(t,n,r?.state)},ff=e=>e.length===0?[[]]:e.flatMap((t,n)=>ff([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),pf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(pf),e.kind===`Function`&&e.range.forEach(pf))},mf=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},hf=(t,n)=>[z(`Print`,2,e=>(t(da([R(e,0,`Print`),R(e,1,`Print`)]).map(M).join(` `)),R(e,1,`Print`))),z(`PrintT`,1,e=>(t(M(da([R(e,0,`PrintT`)])[0])),!0)),z(`Assert`,2,t=>{if(R(t,0,`Assert`)!==!0)throw new e.O(`The first argument of Assert evaluated to FALSE; the second argument was:\n${M(L(R(t,1,`Assert`)))}`,e.tt.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Cr([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=Pt(t)?I(t):void 0,i=Pt(n)?I(n):void 0;if(!r)throw Co(`first`,`@@`,`function`,t);if(!i)throw Co(`second`,`@@`,`function`,n);let a=Ht(r),o=Ht(i).filter(e=>!a.some(t=>mr(e[0],t[0])));return wr([...a,...o])}),z(`ToString`,1,e=>dn(L(R(e,0,`ToString`),!0))),{...qo(`TLCEval`,1,(e,t)=>{let n=mf(Jo(e,0,`TLCEval`)());return t===void 0&&pf(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=wo(R(e,0,`Permutations`),`Permutations`).elements;return _r(ff(t).map(e=>Cr(t.map((t,n)=>[t,e[n]]))))}),ko(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=di(t);if(!n)throw Co(`first`,`SortSeq`,`natural number`,t);let r=Do(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw Co(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),Pr(a)}),n.version===`1.7.4`?Vo({...Ao(`TLCGet`,1,(e,t)=>df(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Vo(qo(`TLCGet`,1,(e,t)=>df(n,Jo(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)`),Ao(`TLCSet`,2,e=>(Zd(n,t,R(e,0,`TLCSet`),R(e,1,`TLCSet`)),!0)),Oo(`Any`,vn),z(`RandomElement`,1,e=>Pd(R(e,0,`RandomElement`),n.getRandom()))],gf=/* @__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(`,`),_f=[[`\\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`,`≀`],[`^+`,`⁺`]],vf=/* @__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(`,`),yf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),bf=/* @__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(`.`),xf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
140
88
  Nat == { }
141
89
  a+b == {a, b}
142
90
  a-b == CHOOSE n : b + n = a
@@ -452,9 +400,7 @@ _CheckName(name) ==
452
400
  => (PrintT(counts) /\\ FALSE)
453
401
  _PrintCounts == PrintT(_Counts)
454
402
  =============================================================================
455
- `]]),$d=/* @__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)`]])]]),ef=v(`EOF`),tf=v(`IDENTIFIER`),nf=v(`DEFBREAK`),rf=(e,t)=>Array.from({length:v(t)-v(e)+1},(t,n)=>v(e)+n),af=new Set(rf(`op_57`,`op_119`)),of=new Set(rf(`op_1`,`op_119`)),sf=new Set(rf(`op_57`,`op_70`)),cf=/* @__PURE__ */ new Set([...rf(`ACTION`,`EXCEPT`),v(`EXTENDS`),...rf(`IF`,`SF`),v(`STATE`),...rf(`THEN`,`WITH`),v(`US`),...rf(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),lf=new Map([...U(`postfix`,160,160,!0,`[`),...U(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...U(`prefix`,120,120,!1,`-.`),...U(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...U(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...U(`prefix`,40,40,!0,`\\lnot`),...U(`nfix`,100,130,!0,`\\times`),...U(`infix`,140,140,!1,`^`,`^^`),...U(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...U(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...U(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...U(`infix`,100,110,!0,`|`,`||`,`%%`),...U(`infix`,100,110,!1,`%`),...U(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...U(`infix`,90,140,!1,`\\wr`),...U(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...U(`infix`,90,130,!1,`!!`),...U(`infix`,90,90,!1,`...`,`..`),...U(`infix`,80,80,!0,`\\intersect`,`\\union`),...U(`infix`,80,80,!1,`\\`),...U(`infix`,70,70,!1,`<:`,`:>`),...U(`infix`,60,60,!0,`@@`),...U(`infix`,50,140,!0,`\\cdot`),...U(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...U(`infix`,30,30,!0,`\\land`,`\\lor`),...U(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...U(`infix`,10,10,!1,`=>`)]),uf=new Map([...lf,...qd.flatMap(e=>e.slice(1).map(t=>[t,lf.get(e[0])]))]),df=uf.get(`[`),ff={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},pf=e=>({type:`tokens`,kinds:new Set(e)}),mf=e=>typeof e==`string`?e.startsWith(`<`)?pf([v(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(mf)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),hf=e=>(...t)=>({type:e,body:W(...t)}),K=hf(`zeroOrMore`),gf=hf(`oneOrMore`),q=hf(`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}),_f=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),vf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=_f(e,n);return n},yf=(...e)=>{let t=e.map(v);return e=>t.includes(vf(e,1).kind)},bf=(e,t=vf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},xf=e=>{let t=vf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Sf=e=>yf(`CASESEP`)(e)&&bf(e),Cf=e=>{let t=vf(e,1);cf.has(t.kind)&&(t.kind=tf)},wf=(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}`,Tf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Ef=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Df=e=>e.operatorStacks[e.operatorStacks.length-1],Of=(e,t)=>e.low>t.high,kf=(e,t)=>e.high<t.low,Af=e=>e.fix===`prefix`?e:uf.get(`${e.name}.`),jf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===df?Tf(`FcnAppl`,[n,...r.node.heirs]):Tf(`PostfixExpr`,[n,r.node]),operator:void 0})},Mf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Tf(`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:Tf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Nf=e=>{let t=Df(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 jf(t,n),Nf(e);if(i.operator!==void 0){let t=Af(r.operator);return t!==void 0&&Of(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${wf(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 ${wf(e,a.node.first,a.node.last)} and expression at location ${wf(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return kf(a.operator,r.operator)?void 0:Of(a.operator,r.operator)?(Mf(t,a.operator),Nf(e)):`Precedence conflict between ops ${a.operator.name} in block ${wf(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Af(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(kf(s,r.operator))return;if(!Of(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${wf(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Mf(t,s),Nf(e);let c=wf(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===ff?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Pf=e=>J(t=>{let n=Df(t),r=Ef(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:Nf(t)}),Ff=Pf(()=>!1),If=Pf(()=>!0),Lf=J(e=>{e.lastOperator=uf.get(e.token.image)}),Rf=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},zf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Rf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Bf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!bf(e,n.first.beginColumn))return n;let t=Bf(e,n);if(t!==void 0)return t}},Vf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(v),n=(e,...t)=>t.some(t=>e.kind===v(t)),r=e=>e!==void 0&&af.has(e.kind),i=e.token,a=_f(e,i);i.next=void 0;let o=_f(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===tf&&(e=e.next)}else if(e.kind===tf){let t=e.next;!r(t)||sf.has(t.kind)||of.has(t.kind)&&t.next?.kind!==tf||(e=t.next?.kind===v(`SUBSTITUTE`)?i:of.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==nf&&(e.next={kind:nf,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=_f(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Hf=e=>{let t=vf(e,1);if(t.kind===v(`LAB`)){let n=1;for(;n!==0;)if(t=_f(e,t),t.kind===v(`LAB`)&&n++,t.kind===v(`RAB`)&&n--,t.kind===ef)return!1;return _f(e,t).kind===v(`IN`)}if(t.kind!==tf)return!1;for(t=_f(e,t);t.kind===v(`COMMA`);){if(t=_f(e,t),t.kind!==tf)return!1;t=_f(e,t)}return t.kind===v(`IN`)},Uf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Wf=e=>e.proofLevels.at(-1)??-1,Gf=e=>{let t=vf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:yf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Wf(e)>=0&&Uf(t)>Wf(e):yf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Kf=(e,t)=>{let n=Uf(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=>J(t=>Kf(t,t.token)?void 0:`${wf(t,t.token)}: ${e}`),Jf=pf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(v)),Yf=pf([...Jf.kinds,v(`op_76`)]),Xf=pf(of),Zf=pf(sf),Qf=pf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(v)),$f=()=>K(X({expansion:[G(Jf,`<op_77>`)],semantic:bf}),G(`PrefixOp`,`InfixOp`),If),ep=()=>G(W(X({expansion:[`OpenStart`],semantic:bf}),`OpenExpression`,Ff),W(X({semantic:bf}),`ExtendableExpr`)),tp=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),np=()=>G(W(X({semantic:e=>yf(`ASSUME`,`BOXASSUME`)(e)||vf(e,2).kind===v(`COLONCOLON`)&&[v(`ASSUME`),v(`BOXASSUME`)].includes(vf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),rp=()=>[`JuncItem`,K(X({semantic:xf}),`JuncItem`)],ip=e=>J(t=>{t.expecting=e,Cf(t)}),ap=e=>J(t=>{t.isTerminalProof=e}),op=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{Vf(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),sp={CompilationUnit:Z(void 0,[J(Vf),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>`),ip(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,ip(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,ip(`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(Vf)),W(X({semantic:e=>yf(`USE`)(e)&&vf(e,2).kind!==v(`ONLY`)||yf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Z(`variable declaration`,[`<VARIABLE>`,Y(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Y(`Identifier`),`Identifier`)]),ParamDeclaration:Z(`Parameter declaration`,[Y(`CONSTANT`),`ParamSubDecl`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Z(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Z(`Recursive`,[Y(`RECURSIVE`),`<RECURSIVE>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y(`,`),K(`<COMMA>`,Y(`Identifier, operator or _`),`ConstantDeclarationItems`,Y("`,' or `)'"))]),ConstantDeclarationItems:Z(`Constant declaration items`,[Y(`Identifier, _ or prefix op`),G(W(`Identifier`,Y(`(, comma, or Module Body`),q(X({amount:2}),`<LBR>`,Y(`_`),`<US>`,Y(`comma or )`),K(`<COMMA>`,Y(`_`),`<US>`,Y(`comma or )`)),`<RBR>`)),W(`NonExpPrefixOp`,Y(`_`),`<US>`),W(`<US>`,Y(`prefix or postfix operator`),G(W(`InfixOp`,Y(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Z(`Definition`,[Y(`LOCAL, Identifier or Operator Symbol`),q(`<LOCAL>`),`<DEFBREAK>`,Y(`LOCAL, Identifier or Operator Symbol`),G(op(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),op(`Expression`,X({expansion:[`<IDENTIFIER>`,Zf]}),`PostfixLHS`,`Expression`),op(`Expression`,X({expansion:[`<IDENTIFIER>`,Xf]}),`InfixLHS`,`Expression`),op(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),op(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Z(`Identifier tuple`,[`<LAB>`,Y(`Identifier or >>`),q(`Identifier`,Y(`COMMA or >>`),K(`<COMMA>`,Y(`COMMA or >>`),`Identifier`,Y(`COMMA or >>`))),`<RAB>`]),IdentLHS:Z(`Identifier LHS`,[`Identifier`,Y(`( or ==`),q(`<LBR>`,Y(`Identifier Declaration, prefix op, _ or )`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`),K(`<COMMA>`,Y(`Identifier Declaration, prefix op or _`),G(`IdentDecl`,`SomeFixDecl`),Y(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Z(`Prefix LHS`,[Yf,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,Xf,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,Zf]),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>`,ip(`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,[Jf,Lf]),NonExpPrefixOp:Z(void 0,[Yf,Lf]),InfixOp:Z(`Infix Op`,[Xf,Lf]),PostfixOp:Z(void 0,[Zf,Lf]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{Vf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),np(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),np(),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=Ef(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${wf(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(Vf),G(W(X({amount:3}),X({semantic:yf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:Gf}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>yf(`BY`)(e)||vf(e,2).kind===v(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>vf(e,2).kind!==v(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,ap(!0),q(`<ONLY>`)),W(`<USE>`,ap(!1),q(`<ONLY>`)),W(`<HIDE>`,ap(!1))),Y("an expression, `MODULE' or `DEF'"),q(tp(),K(`<COMMA>`,Y(`MODULE or expression`),tp(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),tp(),K(`<COMMA>`,Y(`MODULE or expression`),tp(),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`),Qf,qf(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:Gf}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),Qf,qf(`step's number has bad level.`),Y(`proof step`),G(W(X({semantic:yf(`USE`,`HIDE`)}),`UseOrHideOrBy`),W(X({semantic:yf(`INSTANCE`)}),`Instantiation`),W(X({semantic:yf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),q(X({semantic:Gf}),J(e=>{let t=Ef(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${wf(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),gf(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:yf(`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(Yf,Xf,Zf),pf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(v))],semantic:bf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${wf(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:bf}),`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:Hf}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),gf(`<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=Ef(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`)),gf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:Hf}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>vf(e,2).kind===v(`MAPTO`)&&cf.has(vf(e,1).kind)}),J(e=>{vf(e,1).kind=tf}),`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=Tf(`FcnAppl`,t.heirs),e.lastOperator=df})),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>`,gf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J(Cf),`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===v(`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=>Sf(e)&&vf(e,2).kind!==v(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Sf}),`<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`,[gf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=vf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...rp()),W(X({expansion:[`<AND>`]}),...rp())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Bf(t,e.heirs[1]);return n&&`Item at ${wf(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${wf(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([])}),$f(),ep()],(e,t)=>{let n=Df(t);n.push({node:e.heirs[0],operator:ff});let r=Nf(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`),Ff,K(G(W(X({expansion:[`PostfixOp`],semantic:bf}),`PostfixOp`,If),W(X({expansion:[`<DOT>`],semantic:bf}),`<DOT>`,J(Cf),X({semantic:bf}),`Identifier`,J(e=>{let t=Df(e);t[t.length-1].operator!==void 0&&jf(t,t.length),t[t.length-1]={node:Tf(`RecordComponent`,[t[t.length-1].node,Ef(e,2),Ef(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:bf}),Y(`function argument`),`SBracketCases`,Pf(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:bf}),`InfixOp`,If,$f(),ep()),W(X({expansion:[`<COLONCOLON>`],semantic:bf}),`<COLONCOLON>`,J(e=>{let t=Df(e);if(!zf(t[t.length-1].node))return`\`::' at ${wf(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=Df(e),n=Ef(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!kf(r,e.lastOperator)){let t=Ef(e,3);return`Removing label at ${wf(e,t.first,t.last)} would change expression parsing.`}t.push({node:Tf(`Label`,[Ef(e,3),Ef(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:bf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:bf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>Wf(e)<0&&e.proofLevels.length<=1?`${wf(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${wf(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:Rf(e.heirs)===void 0?e.heirs.length===1?Tf(`GeneralId`,e.heirs):void 0:Tf(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>vf(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=>vf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${wf(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},cp=/* @__PURE__ */ new Map,lp=e=>{let t=cp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=lp(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,lp(sp[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 cp.set(e,n),n},up=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},dp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=_f(e,e.scanPosition)),e.scanPosition=_f(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`},fp=(e,t)=>{if(t.type===`tokens`)return dp(e,t.kinds);if(t.type===`call`)return fp(e,sp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||up(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=fp(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||up(e,t.semantic)?fp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=fp(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=fp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},pp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=fp(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},mp=(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||lp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!lp(a).hasSemanticStart?lp(a).first.has(vf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):pp(e,i,a)&&(o===void 0||o(e))}),hp=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,fp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=_f(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===ef){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=_f(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ee(e.token.image)}" `},gp=(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??hp(e)}\n\nResidual stack trace follows:\n${r}`,!1},_p=(e,t)=>{let n=_f(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,gp(e))},vp=(e,t)=>{let n=sp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:vf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!yp(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 gp(e,i);let a=r.node??(r.heirs.length===0?void 0:Tf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},yp=(e,t)=>{if(t.type===`tokens`)return _p(e,t.kinds);if(t.type===`call`)return vp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||gp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||gp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||yp(e,t));if(t.type===`choice`){let n=mp(e,t.alternatives);return n===-1?gp(e):yp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!yp(e,t.body))return!1;if(t.type===`optional`)return mp(e,[t.body])===-1||yp(e,t.body);for(;mp(e,[t.body])===0;)if(!yp(e,t.body))return!1;return!0},bp=e=>{let t=we(e),n={kind:ef,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=yp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},xp={low:15,high:15},Sp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),Cp=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)]]),wp=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Tp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Ep=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Dp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Op=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),kp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...wp]),Ap=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),jp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Mp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Np=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Pp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Fp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Ip=/* @__PURE__ */ new Set([``,`*`,`-`]),Lp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Rp=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),zp=/* @__PURE__ */ new Set([`NEW`,...Rp.keys()]),Bp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Vp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Hp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Up=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Cp.has(e.operator):wp.has(e.operator)),Wp=e=>Cp.has(e)||wp.has(e)||e===`-.`,Gp=(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}}},Kp=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
456
- `)}\n`},qp=(t,n,r=se(t))=>{let i=n===`tlapm`,a=i?r:r.map(re),o={index:0,offsideColumns:[]},c={},l=[],u=/* @__PURE__ */ new Set,d=[],f=[],p=e=>l[l.length-1].has(e),m=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],te=[],ne=[],h=(e,t=o.index-1)=>{let n=e===t?ne[e]:void 0;if(n)return n;let r=a[t];ee[e]??=m(a[e]),te[t]??={line:r.line,column:r.endColumn};let i={module:f[0].name,start:ee[e],end:te[t]};return e===t&&(ne[e]=i),i},g=(e,t)=>(e.location.range=h(t),e),ie=(e=0)=>a[Math.min(o.index+e,a.length-1)],_=(e=0)=>{let t=ie(e),n=o.offsideColumns[o.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ae=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),oe={index:0},ce=e=>{let t=a.slice(oe.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},le=e=>i&&(e.kind===`Keyword`||Hp.has(e.text)),ue=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},v=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Fp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):le(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,y=(t,n=ie(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.O(`${t} at line ${n.line}, column ${n.column}`,void 0,de(t,n,o,r))},de=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ce(ue(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${v(r)}`,...ue(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},fe=(e,t=ie())=>y(e,t,t),pe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!le(e),b=(e,t=0)=>{let n=_(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},x=()=>{let e=_();if(e.kind===`End`)throw y(`Unexpected end of expression`);return o.index++,e},S=e=>b(e)?(o.index++,!0):!1,C=e=>{if(!b(e))throw fe(`Expected ${JSON.stringify(e)} but found ${ae(_())}`);return x()},me=()=>{let e=_();if(e.kind!==`Identifier`)throw fe(`Expected an identifier but found ${ae(e)}`);if(le(e))throw fe(`Unexpected keyword ${e.text}`);return o.index++,e.text},he=()=>{let e=o.index;return{name:me(),range:h(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=_();return e.kind!==`String`&&(Ep.has(e.text)||Cp.has(e.text)||wp.has(e.text)||e.text===`'`)?(o.index++,e.text):me()},ve={isUsed:!1},ye=()=>_().kind===`Identifier`||!pe(_())?me():(ve.isUsed=!0,x().text),w=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},T=(e,t=`,`)=>{let n=[e()];for(;S(t);)n.push(e());return n},be=()=>{if(b(`<<`)){let e={value:1};for(;_(e.value).kind===`Identifier`||b(`,`,e.value);)e.value++;return b(`>>`,e.value)&&b(`\\in`,e.value+1)}let e={value:0};for(;_(e.value).kind===`Identifier`;){if(b(`\\in`,e.value+1))return!0;if(!b(`,`,e.value+1))return!1;e.value+=2}return!1},xe=()=>{if(b(`::`))return!0;if(!b(`(`))return!1;let e={value:1};for(;_(e.value).kind===`Identifier`&&b(`,`,e.value+1);)e.value+=2;return _(e.value).kind===`Identifier`&&b(`)`,e.value+1)&&b(`::`,e.value+2)},Se=()=>{if(!S(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(T(he));return C(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>T(()=>{let e=T(Se);C(`\\in`);let t=O();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=_();if(e.kind===`Identifier`){let t=o.index,n=[x().text];for(;b(`!`)&&_(1).kind===`Identifier`;)x(),n.push(me());return g({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(b(`<<`)||b(`(`))return Re();throw fe(`Expected a subscript but found ${ae(e)}`)},Te=e=>{let t=_(1),n=_(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(`==`,wp.has(n.text)?3:4))},Ee=e=>{let t=_(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||b(`,`,1)||b(`)`,1)||t.kind===`Keyword`&&jp.has(t.text)||Te(e)},De=()=>{let e=_(),t=e.kind===`Operator`&&(Cp.has(e.text)||Tp.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(Tp.has(e.text)||kp.has(e.text)&&e.text!==`'`&&!wp.has(e.text)||Op.has(e.text)&&_(-1).text===`(`&&_(-1).line===e.line&&_(-1).endColumn+1===e.column&&_(1).text===`)`&&_(1).line===e.line&&_(1).column===e.endColumn+1)&&Ee(e))throw y(`incomplete expression`,e);if(t)return o.index++,g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&kp.has(e.text)&&Ee(e)){o.index++;let t=m(e);if(wp.has(e.text))return g({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return g({kind:`Lambda`,params:[n.name],body:Gp(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(b(`LAMBDA`)){let t=o.index;x();let n=ge(T(he));C(`:`);let r=O();return g({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return O()},Oe={range:void 0},ke=()=>w(()=>{let e=o.index;C(`(`);let t=T(De);return C(`)`),Oe.range=h(e),t}),E=()=>{let e=x();o.offsideColumns.push(e.column);let t=[O()];for(;ie().text===e.text&&ie().column===e.column;)o.index++,t.push(O());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},Ae=e=>w(()=>{let t=m(e),n=_().kind===`Identifier`,r=b(`|->`,1)&&(n||pe(_()));if(r||n&&b(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=m(_()),i=e();return n.range=h(t),C(r?`|->`:`:`),{name:i,value:O(),location:n}},a=[i(()=>n?me():x().text),...S(`,`)?T(()=>i(me)):[]];return C(`]`),{kind:e,fields:a,location:t}}if(be()){let e=Ce();C(`|->`);let n=O();return C(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=O();if(S(`->`)){let e=O();return C(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(S(`EXCEPT`)){let e=T(()=>{C(`!`);let e=[];for(;b(`.`)||b(`[`);)if(S(`.`)){if(!pe(_()))throw fe(`Expected a field name but found ${ae(_())}`);e.push({kind:`Field`,name:x().text})}else C(`[`),e.push({kind:`Index`,args:T(()=>O())}),C(`]`);return C(`=`),{path:e,value:O()}});return C(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!b(`]_`)){let e=[a];for(;S(`,`);)e.push(O());return C(`]`),{kind:`Bracket`,args:e,location:t}}return C(`]_`),{kind:`BoxAction`,action:a,subscript:we(),location:t}}),je=()=>{let e=o.index,t=g(ze(),e),n=m(x());return g({kind:`Apply`,operator:`\\in`,args:[t,O()],location:n},e)},Me=e=>w(()=>{let t=m(e);if(S(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(be()&&(_(1).text===`\\in`||b(`<<`))){let e=o.index,n=Se();C(`\\in`);let r=O();if(S(`:`)){let e=O();return C(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=_().kind===`Identifier`&&b(`\\in`,1)?je():O();if(S(`:`)){let e=Ce();return C(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;S(`,`);)r.push(O());return C(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ne=e=>{let t=m(e),n=w(()=>b(`>>`)||b(`>>_`)?[]:T(()=>O()));if(S(`>>_`)){if(n.length!==1)throw y(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we(),location:t}}return C(`>>`),{kind:`Tuple`,elements:n,location:t}},Pe=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&be()){let e=Ce();return C(`:`),{kind:n,bounds:e,body:O(),location:t}}let i=ge(T(he));return C(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:O(),isTemporal:r,location:t}},Fe=e=>{let t=[];do{if(S(`OTHER`))return C(`->`),{kind:`Case`,arms:t,other:O(),location:m(e)};let n=O();C(`->`),t.push({condition:n,body:O()})}while(S(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Ie=()=>{let e=_(1);return b(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Ap.has(e.text)||e.kind===`Operator`&&(Cp.has(e.text)||wp.has(e.text)||Tp.has(e.text)))},Le=()=>{let e=x();if(e.kind===`Number`)return{kind:`Operand`,operand:s(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o.index--,{kind:`Bound`,args:ke()}}return{kind:`Name`,name:e.text,args:b(`(`)?ke():[]}},Re=e=>{let t=o.index,n=x(),r=m(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=T(me);return C(`:`),{kind:`Lambda`,params:e,body:O(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw y(`incomplete expression`,n);return{kind:`Number`,value:s(n.text),text:n.text,location:r}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:r};if(n.kind===`String`)return{kind:`String`,value:n.text,location:r};let a=n.kind===`Step`&&et(n);if(a&&Ze()<0&&Xe.length<=1)throw y(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw y(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let s=a?tt(n)??n.text:n.text;if(xe()){let t=ge(S(`(`)?T(he):[]);t.names.length>0&&C(`)`),C(`::`);let a=O();if(!i&&e!==void 0&&c.last!==void 0&&Up(a)&&e.high>=c.last.low)throw y(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:s,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=b(`(`);if(s===`@`&&!l&&!Ie())return{kind:`ExceptAt`,location:r};let u=l?ke():[],d=[l?Oe.range:void 0];if(!Ie())return l?{kind:`Apply`,operator:s,args:u,argumentsRange:Oe.range,location:r}:{kind:`Identifier`,name:s,location:r};let f=[{kind:`Name`,name:s,args:u}],p=[h(t,t)];for(;Ie();)x(),p.push(h(o.index,o.index)),Oe.range=void 0,f.push(Le()),d.push(Oe.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),ee=m.join(`!`),te=f.flatMap(e=>`args`in e?e.args:[]),ne=f.map(e=>`args`in e?e.args.length:0),g=d.at(-1)??h(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:te.length===0?{kind:`Identifier`,name:ee,selectorRanges:p,location:r}:{kind:`Apply`,operator:ee,args:te,...ne.slice(0,-1).some(e=>e>0)&&{argumentCounts:ne},argumentsRange:g,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&Wp(n.text)&&b(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:ke(),location:r};if(n.kind===`Operator`&&Wp(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=w(()=>O());return C(`)`),e}case`[`:return Ae(n);case`{`:return Me(n);case`<<`:return Ne(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Pe(n);case`IF`:{let e=O();C(`THEN`);let t=O();return C(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:O(),location:r}}case`CASE`:return Fe(n);case`LET`:{let e=[],t=[];for(l.push(/* @__PURE__ */ new Set);!S(`IN`);){if(i&&b(`RECURSIVE`))throw y(`Unexpected keyword RECURSIVE`,ce(ie()));if(S(`RECURSIVE`)){qe();continue}let n=A(!1);n.kind===`Instance`?t.push(n):e.push(n)}l.pop();let n=O();return t.length===0?{kind:`Let`,definitions:e,body:n,location:r}:{kind:`Let`,definitions:e,instances:t,body:n,location:r}}case`CHOOSE`:{let e=Se(),t=S(`\\in`)?O():void 0;return C(`:`),{kind:`Choose`,pattern:e,set:t,body:O(),location:r}}case`WF_`:case`SF_`:{let e=we(),t=w(()=>{C(`(`);let e=O();return C(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw fe(`Unexpected ${ae(n)}`,n)},D=(e,t,n)=>{c.last=c.preceding={low:t,high:n};let r=O(n+1),a=_(),o=a.text===`'`||wp.has(a.text)?xp.high:Cp.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw y(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},ze=()=>{let e=c.preceding;c.preceding=void 0;let t=_(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return E();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return x(),{kind:`Apply`,operator:`~`,args:[D(t,4,4)],location:n};case`-`:return x(),{kind:`Apply`,operator:`-.`,args:[D(t,12,12)],location:n};case`[]`:return x(),{kind:`Always`,expression:D(t,4,15),location:n};case`<>`:return x(),{kind:`Eventually`,expression:D(t,4,15),location:n};case`ENABLED`:return x(),{kind:`Enabled`,expression:D(t,4,15),location:n};case`UNCHANGED`:return x(),{kind:`Unchanged`,expression:D(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return x(),{kind:`Apply`,operator:t.text,args:[i?O(9):D(t,10,13)],location:n}}return Re(e)},O=(e=0)=>{let t=o.index,n=ze(),r={left:n.location.range?n:g(n,t),previous:void 0};for(;;){let n=_();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){x(),c.last=xp,r.left=g({kind:`Prime`,expression:r.left,location:i},t);continue}if(wp.has(n.text)&&e<=15){x(),c.last=xp,r.left=g({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){x();let e=w(()=>T(()=>O()));w(()=>C(`]`)),c.last=Sp,r.left=g({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&pe(_(1))){x();let e=x().text;r.left=g({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=Cp.get(n.text);if(!a||a.low<e)break;let o=r.previous;if(o){let e=!(o.low>a.high||o.high<a.low),t=o.text===n.text&&a.isAssociative;if(e&&!t&&(o.text!==`\\X`||n.text!==`\\X`))throw y(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(x(),a.low>12&&b(`-`))throw y(`Precedence conflict between ${n.text} and -`,_());c.last=c.preceding=a;let s=O(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[h(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,s],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,s],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,s]}:{kind:`Product`,factors:[l,s],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,s],location:i};r.left=g(r.left,t),r.previous={...a,text:n.text}}return r.left},Be=()=>{if(!S(`(`))return[];let e=Ke();return C(`)`),e},k=()=>{let e=m(_()),t=O(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},A=e=>{let t=o.index;return g(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=_(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...k(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&_(1).kind===`Operator`&&Cp.has(_(1).text)&&_(2).kind===`Identifier`&&b(`==`,3)){let e=he(),t=x().text,n=he();return C(`==`),r(t,[Ve(e),Ve(n)])}let i=t.kind!==`String`&&Ep.has(t.text),a=t.kind===`Identifier`&&wp.has(_(1).text)&&b(`==`,2);if(i||a){let e=i?t.text:_(1).text;i&&x();let n=he();return a&&x(),C(`==`),r(e,[Ve(n)])}let s=me();if(S(`[`)){let t=w(()=>Ce());return C(`]`),C(`==`),{kind:`Function`,name:s,bounds:t,body:O(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=Be();return C(`==`),b(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:h(c)}:r(s,l)},Ue=(e,t,n,r)=>{let i=o.index;return C(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:S(`WITH`)?T(()=>{let e=o.index,t=_e(),n=h(e);return C(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:h(i)}},We=()=>{let e=o.index;return g(Ge(),e)},Ge=()=>{let e=m(_());if(b(`_`)&&_(1).kind===`Operator`)return x(),{name:x().text,arity:S(`_`)?2:1,location:e};if(_().kind===`Operator`&&b(`_`,1)){let t=x().text;return x(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!S(`(`))return{name:t,arity:0,location:e};let n=T(()=>C(`_`));return C(`)`),{name:t,arity:n.length,location:e}},Ke=()=>T(We),qe=()=>{let e=Ke();return e.forEach(e=>l[l.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=_(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Bp.has(e.text)&&t.value++,e.kind===`Operator`&&Vp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=_(),t=_(1);return e.kind===`Identifier`?b(`(`,1)||b(`[`,1)?b(`==`,Je(1)):t.kind===`Operator`&&wp.has(t.text)?b(`==`,2):t.kind===`Operator`&&Cp.has(t.text)?_(2).kind===`Identifier`&&b(`==`,3):b(`==`,1):e.kind!==`String`&&Ep.has(e.text)&&t.kind===`Identifier`&&b(`==`,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(`.`)&&!Ip.has($e(e)),tt=e=>{let t=$e(e);if(Ip.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 Np.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},it=e=>!u.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),at=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Hp.has(e.name)&&!it(e.name):!1,ot=()=>{let e=_();return e.kind===`Step`?et(e):e.kind===`Keyword`?Lp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},st=()=>{let e=o.index,t=_();return t.kind===`Operator`&&!Dp.has(t.text)&&Wp(t.text)?(o.index++,g({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):S(`MODULE`)?g({kind:`ModuleFact`,name:me(),location:m(t)},e):O()},ct=e=>d[d.length-1]?.add(e),lt=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},ut=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),dt=()=>{let e=o.index,t=_(),n=T(()=>{let e=_();if((e.kind!==`Identifier`||le(e))&&e.kind!==`Operator`)throw fe(`Expected a definition name but found ${ae(e)}`,e);return o.index++,e.text},`!`),r=m(t);return g(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},ft=()=>{if(i)return T(dt);let e=T(st),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ut(e.name)):void 0;if(t)throw y(`DEF clause entry should describe a defined operator`,t.location);return e},pt=()=>({facts:ot()?T(st):[],defs:S(`DEF`)||S(`DEFS`)?ft():[]}),mt=()=>{let t=o.index,r=x(),i=r.text===`USE`&&S(`ONLY`),a=h(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...pt(),keyword:a,location:m(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!at(e)):[];if(c.length>0)throw e.I(c.map(n=>({location:e.z(n.location.range??h(t)),message:`The only expression allowed as a fact in a HIDE is
457
- the name of a theorem, assumption, or step.`})));return g(s,t)},ht=()=>{let e=o.index,t=m(_()),n=S(`NEW`),r=_().kind===`Keyword`?Rp.get(_().text):void 0;if(!n&&r===void 0)throw fe(`Expected a declaration but found ${ae(_())}`);if(r!==void 0&&x(),r===`Variable`){let n=he();return ct(n.name),g({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=We();ct(i.name);let a=(r??`Constant`)===`Constant`&&b(`\\in`);if(a&&i.arity>0)throw y(`declared symbol with arguments before \\in`);return a&&x(),g({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?O():void 0,nameRange:i.location.range,location:t},e)},gt=()=>{let e=o.index,t=m(C(`ASSUME`)),n=T(()=>b(`ASSUME`)?lt(gt):_().kind===`Keyword`&&zp.has(_().text)?ht():O());return C(`PROVE`),g({kind:`AssumeProve`,assumptions:n,conclusion:O(),location:t},e)},_t=e=>{let t={value:0};for(;_(t.value).kind===`Identifier`&&b(`,`,t.value+1);)t.value+=2;return _(t.value).kind===`Identifier`&&b(e,t.value+1)},vt=(e,t)=>{e.forEach(ct),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ct))},yt=()=>{let e=_();if(b(`USE`)||b(`HIDE`))return mt();if(b(`INSTANCE`)){let t=o.index;return g(Ue(void 0,[],!1,m(e)),t)}if(b(`DEFINE`)||Ye()){let t=o.index;S(`DEFINE`);let n=[A(!1)];for(;Ye();)n.push(A(!1));let r={kind:`Define`,definitions:n,location:m(e)};return g(r,t)}if(S(`HAVE`))return{kind:`Have`,expression:O()};if(S(`TAKE`)){let e=be(),t=ge(e?[]:T(he)),n=e?Ce():[];return vt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(S(`WITNESS`))return{kind:`Witness`,expressions:T(()=>O())};if(S(`PICK`)){let e=_t(`:`),t=ge(e?T(he):[]),n=e?[]:Ce();return vt(t.names,n),C(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:O()}}return S(`CASE`)?{kind:`Case`,expression:O()}:{kind:`Assert`,isSuffices:S(`SUFFICES`),statement:b(`ASSUME`)?gt():O()}},bt=e=>{let t=_();if(t.kind!==`Step`)throw fe(`Expected a step number but found ${ae(t)}`,t);if(!rt(t))throw y(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw y(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:tt(t),token:t.text,location:m(t)}},xt=()=>{let e=o.index,t=bt(b(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=S(`QED`)?{kind:`Qed`}:yt(),a=h(e),s=h(n),c=nt(_());if(c&&!Pp.has(i.kind))throw y(`Proof of a step that does not take a proof`);let l=c?Ct():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ct),g({...t,body:i,head:a,statement:s,proof:l},e)},St=()=>{let e=m(_());if(b(`BY`)||b(`PROOF`)&&b(`BY`,1)){S(`PROOF`),x();let t=h(o.index-1);return{kind:`By`,isOnly:S(`ONLY`),...pt(),keyword:t,location:e}}let t=_(+!!b(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){S(`PROOF`),x();let n=h(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}S(`PROOF`);let n=[xt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(xt());return{kind:`Steps`,level:Ze(),steps:n,location:e}},Ct=()=>{let e=o.index;Xe.push(-1);let t=lt(St);return Xe.pop(),g(t,e)},wt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Tt=e=>{let t=o.index,n=x(),r=_().kind===`Identifier`&&b(`==`,1)?me():void 0;r!==void 0&&(u.add(r),x());let i=lt(()=>({statement:b(`ASSUME`)?gt():O(),proof:nt(_())?Ct():void 0})),a=i.statement,s=g({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&wt(e,g({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Et=()=>{let e=o.index,t=x(),n=_().kind===`Identifier`&&b(`==`,1)?me():void 0;return n!==void 0&&(u.add(n),x()),g({name:n,expression:O(),isAxiom:t.text===`AXIOM`,location:m(t)},e)},Dt=()=>{let e=m(C(`----`));C(`MODULE`);let t=ye();C(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),l.push(/* @__PURE__ */ new Set),S(`EXTENDS`)&&T(()=>{let e=o.index;n.extends.push(ye()),n.extendsRanges.push(h(e))});;){let t=o.index;oe.index=t;let r=_();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),l.pop(),n;if(r.kind===`Separator`){if(b(`MODULE`,1)){let e=Dt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),C(`====`);continue}x()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(x()),r=Ke();n.constants.push(...r),e.range=h(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(x()),r=T(()=>{let e=o.index,t=m(_());return g({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=h(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Et();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&wt(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 fe(`Expected a module unit but found ${ae(r)}`);let e=mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:x(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Ot(n,g(Ue(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(x(),b(`INSTANCE`)){Ot(n,g(Ue(void 0,[],!0,m(r)),t));continue}Ot(n,g(He(!0),t));continue}r.kind===`Keyword`&&Mp.has(r.text)?Tt(n):Ot(n,A(!1))}}},Ot=(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}))},kt=Dt(),At=ve.isUsed?bp(t):void 0;if(At!==void 0)throw new e.O(At);return kt},Jp=e=>qp(e,`tlc`),Yp=(e,t)=>qp(e,`tlc`,t),Xp=e=>qp(e,`tlapm`),Zp=e=>qp(e,`sany`),Qp=10454148508367108822n,$p=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Qp);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),em=Int32Array.from($p,e=>Number(BigInt.asIntN(32,e>>32n))),tm=Int32Array.from($p,e=>Number(BigInt.asIntN(32,e))),nm=Number(BigInt.asIntN(32,Qp>>32n)),rm=Number(BigInt.asIntN(32,Qp));let im=nm,am=rm;const om=e=>{let t=(e^am)&255;am=(am>>>8|im<<24)^tm[t],im=im>>>8^em[t]},sm=(()=>{let e=[em],t=[tm];for(let n=1;n<4;n++){let r=e[n-1],i=t[n-1],a=/* @__PURE__ */ new Int32Array(256),o=/* @__PURE__ */ new Int32Array(256);for(let e=0;e<256;e++){let t=i[e]&255;o[e]=(i[e]>>>8|r[e]<<24)^tm[t],a[e]=r[e]>>>8^em[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),cm=sm.highs[0],lm=sm.highs[1],um=sm.highs[2],dm=sm.highs[3],fm=sm.lows[0],pm=sm.lows[1],mm=sm.lows[2],hm=sm.lows[3],gm=e=>{let t=am^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;am=im^hm[n]^mm[r]^pm[i]^fm[a],im=dm[n]^um[r]^lm[i]^cm[a]},_m=e=>{if(typeof e==`boolean`)return om(0),om(e?116:102),2;if(typeof e==`number`)return om(1),gm(e),5;if(typeof e==`string`){om(3),gm(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)gm(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)om(e.charCodeAt(n));return 5+e.length}return om(21),gm(ct(e.name)+1),5},vm=e=>{if(typeof e!=`object`||A(e))_m(e);else if(k(e)){let t=F(e);om(9),gm(t.domain.length);for(let e=0;e<t.domain.length;e++)vm(t.domain[e]),vm(t.range[e])}else{let t=N(e).elements;om(5),gm(t.length);for(let e of t)vm(e)}},ym=e=>{let t={high:im,low:am};im=nm,am=rm;for(let t of e)vm(t);let n=BigInt(im>>>0)<<32n|BigInt(am>>>0);return im=t.high,am=t.low,n},bm=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=im,a=am;return e.forEach((e,n)=>{im=nm,am=rm;for(let n of t)vm(e[n]);r[2*n]=am,r[2*n+1]=im}),im=i,am=a,n},xm=25214903917n,Sm=(1n<<48n)-1n,Cm=2147483647,wm=e=>{let t={value:(BigInt.asUintN(64,e)^xm)&Sm},n=e=>(t.value=t.value*xm+11n&Sm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^xm)&Sm},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<=Cm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Tm=[],Em=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Dm=()=>{for(let e=1277011;Tm.length<1341;e++)Em(e)&&Tm.push(e);return Tm},Om=e=>{let t=Dm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},km=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},Am=e=>{for(let t=Math.max(e,9);;t++){let e=km(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)}}},jm=(e,t,n)=>{if(t<=0)return[];let r=Am(t),i={index:BigInt(n.nextInt(t))},a=BigInt(Om(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Mm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Cm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Nm=(1n<<63n)-1n-24n,Pm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Nm*BigInt(n)+i)%t;return r<0n?r+t:r})},Fm=(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,Im=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=En(e.domain),n=N(e.range).elements;return{lists:t.map(()=>n),create:e=>yt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>N(e).elements),create:t=>On(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>N(e).elements),create:j}}},Lm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Rm=(e,t,n,r)=>{if(P(t))return[];let i=r===`1.7.4`?Mm:jm;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:Im(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Cm)?Pm(e,t,n):i(e,Number(t),n)).map(e=>a.create(Fm(a.lists,e)))}let o=N(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},zm=(t,n)=>{let r=t[Math.floor(n.nextDouble()*t.length)];if(r===void 0)throw new e._(`RandomElement of the empty set`);return r},Bm=(t,n)=>{if(typeof t==`object`&&t.kind===`FunctionSet`){let e=[...En(t.domain)];return yt(e,e.map(()=>Bm(t.range,n)))}if(typeof t==`object`&&t.kind===`RecordSet`)return On(t.names.map((e,r)=>[e,Bm(t.sets[r],n)]));if(typeof t==`object`&&t.kind===`ProductSet`)return j(t.factors.map(e=>Bm(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._(`RandomElement of the empty set`);return t.low+i}return zm(N(t).elements,n)},Vm=(e,t=0n)=>{let n=wm(t),r={random:wm(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>On([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:ym,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},Hm=e=>vn([...e.possibleCounts].map(([e,t])=>[e,t])),Um=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Hm(e)]]),Wm=`----------------------------- MODULE Bags --------------------------------
403
+ `]]),Sf=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),Cf=`----------------------------- MODULE Bags --------------------------------
458
404
  (**************************************************************************)
459
405
  (* A bag, also called a multiset, is a set that can contain multiple *)
460
406
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -607,7 +553,7 @@ CopiesIn(e, B) ==
607
553
  7 Dec 98 : Corrected error found by Stephan Merz.
608
554
  6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
609
555
  5 Dec 98 : Initial version.
610
- `,Gm=/* @__PURE__ */ new Map([[`Bags`,Wm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
556
+ `,wf=/* @__PURE__ */ new Map([[`Bags`,Cf],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
611
557
  (***************************************************************************)
612
558
  (* The two definitions in this standard module are overridden by TLC in *)
613
559
  (* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
@@ -863,7 +809,52 @@ TestRandomSetOfSubsets(k, n, S) ==
863
809
  [i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
864
810
 
865
811
  =============================================================================
866
- `],[`RealTime`,`${je}\n`],[`Reals`,`${Ae}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
812
+ `],[`RealTime`,`----------------------------- MODULE RealTime -------------------------------
813
+ (***************************************************************************)
814
+ (* This standard module is described in Chapter 9 of the book "Specifying *)
815
+ (* Systems". The type of specification described there cannot be handled *)
816
+ (* by the TLC model checker. *)
817
+ (***************************************************************************)
818
+ EXTENDS Reals
819
+ VARIABLE now
820
+
821
+ RTBound(A, v, D, E) ==
822
+ LET TNext(t) == t' = IF <<A>>_v \\/ ~(ENABLED <<A>>_v)'
823
+ THEN 0
824
+ ELSE t + (now'-now)
825
+
826
+ Timer(t) == (t=0) /\\ [][TNext(t)]_<<t, v, now>>
827
+
828
+ MaxTime(t) == [](t \\leq E)
829
+
830
+ MinTime(t) == [][A => t \\geq D]_v
831
+ IN \\EE t : Timer(t) /\\ MaxTime(t) /\\ MinTime(t)
832
+ -----------------------------------------------------------------------------
833
+ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
834
+ /\\ UNCHANGED v
835
+ IN /\\ now \\in Real
836
+ /\\ [][NowNext]_now
837
+ /\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
838
+ =============================================================================
839
+ `],[`Reals`,`-------------------------------- MODULE Reals -------------------------------
840
+ (***************************************************************************)
841
+ (* This module provides dummy definitions of the operators that are *)
842
+ (* defined by the real Reals module. It is expected that any tool that *)
843
+ (* handles specifications that use real numbers will provide its own *)
844
+ (* implementations of these operators. TLC currently does not handle real *)
845
+ (* numbers and produces an error if a specification requires TLC to *)
846
+ (* evaluate the operators defined here or to evaluate any operator defined *)
847
+ (* in the Integers module that is applied to non-integer real numbers. *)
848
+ (* *)
849
+ (* See the book "Specifying Systems" for the real Reals module. *)
850
+ (***************************************************************************)
851
+ EXTENDS Integers
852
+
853
+ Real == "Reals"
854
+ a / b == CHOOSE m \\in Real : m * b = a
855
+ Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
856
+ =============================================================================
857
+ `],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
867
858
  (***************************************************************************)
868
859
  (* Defines operators on finite sequences, where a sequence of length n is *)
869
860
  (* represented as a function whose domain is the set 1..n (the set *)
@@ -1267,7 +1258,34 @@ TLCEvalDefinition(definitionName) ==
1267
1258
  TRUE \\* TODO
1268
1259
 
1269
1260
  ============================================================================
1270
- `],[`Toolbox`,`${Me}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1261
+ `],[`Toolbox`,`----------------------------- MODULE Toolbox --------------------------------
1262
+ (***************************************************************************)
1263
+ (* *)
1264
+ (***************************************************************************)
1265
+ LOCAL INSTANCE Naturals \\* a + b
1266
+ LOCAL INSTANCE FiniteSets \\* Cardinality
1267
+ LOCAL INSTANCE TLC \\* TLCGet
1268
+
1269
+ -----------------------------------------------------------------------------
1270
+
1271
+ (* Trace Exploration *)
1272
+
1273
+ _TETrace ==
1274
+ CHOOSE f \\in [ (Nat \\ {0}) -> STRING ] : TRUE
1275
+
1276
+ LOCAL _TETraceLength == Cardinality(DOMAIN _TETrace)
1277
+
1278
+ \\* When evaluated as part of a TLC ALIAS expression, \`_TEPosition\` should be
1279
+ \\* redefined as \`TLCGet("level"), or replace with \`TLCGet(level)\` right away.
1280
+ \\* The definition below accounts for several "peculiarities" of the
1281
+ \\* Toolbox's trace exploration.
1282
+ _TEPosition ==
1283
+ IF TLCGet("level") >= _TETraceLength
1284
+ THEN _TETraceLength
1285
+ ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
1286
+
1287
+ =============================================================================
1288
+ `],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1271
1289
  LOCAL INSTANCE TLC
1272
1290
  LOCAL INSTANCE TLCExt
1273
1291
  LOCAL INSTANCE GraphViz
@@ -1667,7 +1685,7 @@ _TLCTrace ==
1667
1685
  /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1668
1686
 
1669
1687
  =============================================================================
1670
- `]]),Km=new Map([...[...Gm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Wm.replace(`
1688
+ `]]),Tf=new Map([...[...wf].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Cf.replace(`
1671
1689
  LOCAL INSTANCE Naturals
1672
1690
  `,`
1673
1691
  EXTENDS TLC
@@ -1759,7 +1777,14 @@ _TEPosition ==
1759
1777
  ELSE TLCGet("level") + 1
1760
1778
 
1761
1779
  =============================================================================
1762
- `]]),qm=(e=`master`)=>e===`1.7.4`?Km:Gm,Jm=(t,n,r)=>new e.C(`Applying ${t} to the following value,\nwhich is not ${n}:\n${I(r)}`),Ym=e=>k(e)?F(e):void 0,Xm=(e,t,n)=>{let r=L(e,t,n),i=Ym(r);if(!i)throw Jm(n,`a function with a finite domain`,r);return i},Zm=(e,t,n)=>{let r=L(e,t,n),i=Ym(r);if(!i)throw Jr(t===0?`first`:`second`,n,`bag`,r);return i},Qm=(e,t)=>{if(!O(e)||!M(e))throw t();return N(e).elements},$m=e=>e.range.every(e=>typeof e==`number`&&e>0),eh=(e,t)=>{let n=e.domain.findIndex(e=>At(e,t));return n===-1?void 0:e.range[n]},th=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,nh=th(`BagDiff`,`tlc2.value.impl.Value`,2),rh=th(`SqSubseteq`,`tlc2.value.IBoolValue`,2),ih=th(`BagUnion`,`tlc2.value.impl.Value`,1),ah=th(`BagOfAll`,`tlc2.value.impl.Value`,2),oh=th(`BagCup`,`tlc2.value.impl.Value`,2),sh=th(`BagCardinality`,`tlc2.value.impl.IntValue`,1),ch=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${mi(e)}`;throw gi(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')`)},lh=(e,t,n)=>{let r=ch(e,n)+ch(t,n);if(ci(r))throw li(`${e}+${t}`);return r},uh=(e,t,n,r)=>{let i=eh(n,e.domain[t]),a=ch(e.range[t],r);return i===void 0?a:a-ch(i,r)|0},dh=(e,t)=>vn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>At(e[0],r));a?a[1]=lh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),fh=yt([],[]),ph=t=>[ii(`EmptyBag`,fh),R(`IsABag`,1,e=>{let t=Ym(L(e,0,`IsABag`));return t!==void 0&&$m(t)}),R(`BagCardinality`,1,e=>{let t=L(e,0,`BagCardinality`);return Xm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Jm(`BagCardinality`,`a bag`,t);return lh(e,n,sh)},0)}),R(`BagIn`,2,e=>{let t=L(e,1,`BagIn`),n=eh(Xm(e,1,`BagIn`),L(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Jr(`second`,`BagIn`,`bag`,t);return n>0}),R(`CopiesIn`,2,e=>{let t=L(e,1,`CopiesIn`),n=eh(Xm(e,1,`CopiesIn`),L(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Jr(`second`,`CopiesIn`,`bag`,t);return n}),R(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Zm(e,t,`(+)`);if(!$m(n))throw Jr(t===0?`first`:`second`,`(+)`,`bag`,L(e,t,`(+)`));return n});return dh(t,oh)}),R(`\\ominus`,2,e=>{let t=Zm(e,0,`(-)`),n=Zm(e,1,`(-)`);return vn(t.domain.flatMap((e,r)=>{let i=uh(t,r,n,nh);return i>0?[[e,i]]:[]}))}),R(`BagUnion`,1,t=>{let n=L(t,0,`BagUnion`),r=Qm(n,()=>Jm(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??fh;let i=r.map(t=>{let r=Ym(t);if(!r)throw new e.C(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${I(n)}`);return r});return dh(i,ih)}),R(`\\sqsubseteq`,2,e=>{let t=Xm(e,0,`\\sqsubseteq`),n=Xm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>uh(t,r,n,rh)<=0)}),ai(`BagOfAll`,2,t=>{let n=ri(t,0,`BagOfAll`);if(n.literalBody!==void 0)throw new e.C(`The first argument of BagOfAll should be an operator, but instead it is:\n${I(n.literalBody)}`);let r=L(t,1,`BagOfAll`),i=Ym(r);if(!i)throw Jr(`second`,`BagOfAll`,`function with a finite domain`,r);return dh(i.domain.map((e,t)=>yt([n.call([e])],[i.range[t]])),ah)}),R(`SubBag`,1,n=>{let r=L(n,0,`SubBag`);if(!k(r))throw new e._(`DOMAIN expects a function but received ${I(r)}`);let i=F(r),a=fn(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._(`Attempted to apply a function to ${I(i)}, which is not in its domain`);return fn(i.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:s[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>yt(e.map(e=>e[0]),e.map(e=>e[1]))))}),R(`BagToSet`,1,e=>_r(Xm(e,0,`BagToSet`))),R(`SetToBag`,1,e=>{let t=L(e,0,`SetToBag`),n=Qm(t,()=>Jm(`BagToSet`,`a function with a finite domain`,t));return yt([...n],n.map(()=>1))})],mh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,hh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,gh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,_h=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,vh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,yh=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,bh=e=>{if(!k(e))return!1;let t=F(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},xh=(e,t)=>gi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${mi(t)}`),Sh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Ch=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw xh(t,e);return`[${N(e).elements.map(e=>Th(e,t)).join(`,`)}]`},wh=(e,t)=>{let n=F(e),r=er(n);return r?`[${r.map(e=>Th(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Sh(typeof e==`string`?e:I(e))}:${Th(n.range[r],t)}`).join(`,`)}}`},Th=(e,t)=>typeof e==`string`?Sh(e):typeof e==`object`?e.kind===`ModelValue`?Sh(e.name):O(e)?Ch(e,t):wh(e,t):String(e),Eh=e=>{if(O(e))return Ch(e,mh);if(!k(e)||bh(e))throw xh(mh,e);return wh(e,mh)},Dh=e=>{if(!k(e))throw xh(hh,e);return wh(e,hh)},Oh=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))},kh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return at(e);if(Array.isArray(e))return j(e.map(e=>kh(e,t)));if(typeof e==`object`&&e)return On(Object.entries(e).map(([e,n])=>[at(e),kh(n,t)]));throw gi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Ah=(e,t)=>{if(e.trim()===``)return kh(null,t);try{return kh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Oh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?gi(t,e.message):e}},jh=(e,t)=>{if(typeof e!=`string`)throw gi(t,`Cannot cast tlc2.value.impl.${mi(e)} to tlc2.value.impl.StringValue`);return e},Mh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw gi(n,`${t} (No such file or directory)`);return r},Nh=e=>[oi(`ToJson`,1,e=>at(Th(L(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),oi(`ToJsonArray`,1,e=>at(Eh(L(e,0,`ToJsonArray`)))),oi(`ToJsonObject`,1,e=>at(Dh(L(e,0,`ToJsonObject`)))),oi(`JsonSerialize`,2,t=>{let n=jh(L(t,0,`JsonSerialize`),gh),r=L(t,1,`JsonSerialize`);if(!er(r)&&!bh(r))throw Jr(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,Th(r,gh)),!0}),oi(`ndJsonSerialize`,2,t=>{let n=jh(L(t,0,`ndJsonSerialize`),_h),r=L(t,1,`ndJsonSerialize`),i=er(r);if(!i)throw Jr(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${Th(e,_h)}\n`).join(``)),!0}),oi(`JsonDeserialize`,1,t=>{let n=jh(L(t,0,`JsonDeserialize`),vh);return Ah(Mh(e,n,vh),vh)}),oi(`ndJsonDeserialize`,1,t=>{let n=jh(L(t,0,`ndJsonDeserialize`),yh);return j(Mh(e,n,yh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Ah(e,yh)))})],Ph=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Fh=1e6,Ih=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Jr(t,n,`nonnegative integer`,e);return e},Lh=(e,t,n,r)=>fn(Array.from({length:t},()=>fn(e.filter(()=>r.nextDouble()<n)))),Rh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Ih(L(e,0,n),`first`,n),i=Ih(L(e,1,n),`second`,n),a=L(e,2,n);if(!O(a)||!M(a))throw Jr(`third`,n,`finite set`,a);let o=N(a).elements;if(o.length<31&&r>2**o.length)throw Jr(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Jr(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return Lh(o,r,o.length===0?0:i/o.length,t.getRandom())},zh=e=>[oi(`RandomSubset`,2,t=>{let n=L(t,0,`RandomSubset`);if(typeof n!=`number`)throw Jr(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw gi(Ph,String(n));let r=L(t,1,`RandomSubset`);if(!O(r)||!P(r)&&!M(r))throw Jr(`second`,`RandomSubset`,`a finite set`,r);let i=Lm(r,e.version);if(i&&i.reduce((e,t)=>e*N(t).elements.length,1)>Fh)throw gi(Ph,`Attempted to construct a set with too many elements (>${Fh}).`);return fn(Rm(n,r,e.getRandom(),e.version))}),oi(`RandomSetOfSubsets`,3,t=>Rh(t,e)),oi(`TestRandomSetOfSubsets`,3,t=>j(Array.from({length:5},()=>N(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=e=>On([[`name`,e??`UnnamedAction`],[`location`,On([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Gh=(e,t,n)=>{let r=e.map((e,t)=>j([t+1,On(Object.entries(e))])),i=r.slice(1).map((e,n)=>j([r[n],t[n],e])),a=n?[j([r[r.length-1],n.action,r[n.start]])]:[];return On([[`action`,fn([...i,...a])],[`state`,fn(r)]])},Kh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Um(e).get(t)},qh=(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),I(i));else throw new e.C(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${I(r)}`)},Jh=e=>e.every(e=>e!==void 0),Yh=(e,t)=>On(t.variables.map((t,n)=>[t,e[n]])),Xh=(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&&!E(e)){if(t.variableIndex.has(r))return!0;let e=pu(r,t);if(e&&!n.has(e)&&(n.add(e),Xh(e.body,t,n)))return!0}return ke(e).some(e=>Xh(e,t,n))},Zh=(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[R(`AssertEq`,2,e=>{let n=L(e,0,`AssertEq`),r=L(e,1,`AssertEq`),i=At(n,r);return i||(t(I(`Assertion failed`,!0)),t(I(n,!0)),t(I(r,!0))),i}),Ci(`AssertError`,2,t=>{let r=ri(t,0,`AssertError`).expression;if(r&&r.kind!==`String`)throw gi(Vh,`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=wi(t,0,`AssertError`)();try{wi(t,1,`AssertError`)()}catch(t){if(t instanceof e._)return $i(t.message,n.isTool)===i;throw t}return!1}),oi(`TLCGetOrDefault`,2,e=>{let t=L(e,0,`TLCGetOrDefault`);return Kh(n,t)??L(e,1,`TLCGetOrDefault`)}),{...ai(`TLCGetAndSet`,4,e=>{let r=L(e,0,`TLCGetAndSet`),i=Kh(n,r)??L(e,3,`TLCGetAndSet`),a=ri(e,1,`TLCGetAndSet`);return qh(n,t,r,a.call([i,L(e,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},oi(`Trace`,0,(e,t)=>{let r=t?.state;if(!t||!r||!Jh(r)){let e=(t?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw gi(Hh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return j(n.getBehavior(r).map(e=>Yh(e,t.environment)))}),oi(`CounterExample`,0,()=>n.counterExample??On([[`action`,fn([])],[`state`,fn([])]])),R(`ToTrace`,1,t=>{let n=L(t,0,`ToTrace`);if(!k(n)||!At(_r(n),fn([`action`,`state`])))throw new e._(`The argument of ToTrace should be a CounterExample, but instead it is:\n${I(n)}`);let r=N(hr(n,`state`)).elements.map(e=>er(e)??[]);return j(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),R(`TLCModelValue`,1,t=>{let n=L(t,0,`TLCModelValue`);if(typeof n!=`string`)throw new e.C(`The argument of ModelValue should be a string, but instead it is:\n${I(n)}`);return _t(n)}),Ci(`TLCDefer`,1,()=>!0),R(`TLCNoOp`,1,e=>L(e,0,`TLCNoOp`)),Ci(`PickSuccessor`,1,(t,r)=>{let i=r?.next;if(!i||!Jh(i))throw gi(Uh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(n.isSeen(i)||fu(wi(t,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new e.A(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Ci(`TLCCache`,2,(e,t)=>{let n=ri(e,0,`TLCCache`),i=Ir(wi(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Xh(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}),R(`TLCFP`,1,e=>Number(BigInt.asIntN(32,ym([L(e,0,`TLCFP`)])))),oi(`TLCEvalDefinition`,1,(t,n)=>{let r=L(t,0,`TLCEvalDefinition`),i=typeof r==`string`&&n?pu(r,n.environment):void 0;if(!i||typeof r!=`string`||!n)throw new e.C(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${I(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new e.C(`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)})]},Qh=(e,t)=>[oi(`_Track`,2,e=>{let n=String(L(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,L(e,0,`_Track`)===!0?r+1:r),!0}),oi(`_Counts`,0,()=>Hm(t)),oi(`_CheckName`,1,n=>{let r=String(L(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(I(Hm(t),!0)),!1)}),oi(`_PrintCounts`,0,()=>(e(I(Hm(t),!0)),!0))],$h=e=>String(e).padStart(2,`0`),eg=e=>`${e.getUTCFullYear()}.${$h(e.getUTCMonth()+1)}.${$h(e.getUTCDate())}.${$h(e.getUTCHours())}${$h(e.getUTCMinutes())}${$h(e.getUTCSeconds())}`,tg=e=>vn([...e].map(([e,t])=>[e,j([t])])),ng=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),rg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),ig=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),ag=(t,n,r)=>{if(t.version===`1.7.4`?!rg.has(n)||!t.isStarted&&ig.has(n):!t.isStarted&&ng.has(n))throw new e.C(`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 On([[`queue`,t.queueSize],[`distinct`,t.distinctStates],[`initial`,t.initialStates],[`generated`,t.generatedStates],[`diameter`,t.diameter],[`duration`,i],[`worker`,0]]);case`config`:return On([[`mode`,`bfs`],[`deadlock`,t.checkDeadlock],[`worker`,1],[`seed`,String(t.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let e=/* @__PURE__ */ new Date;return On([[`count`,0],[`timestamp`,Math.floor(e.getTime()/1e3)],[`date`,at(`${e.toISOString().slice(0,19)}.${e.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,at(eg(new Date(t.startedAt)))]])}case`spec`:return t.getSpecification();case`action`:return Wh(void 0);case`all`:return tg(t.registers);case`all:named`:return tg(Um(t))}if(n.startsWith(`s:`)){let r=Um(t).get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return at(t.properties.get(n.slice(2))??n);throw new e.C(`TLCGet(${n}) was undefined.`)},og=(t,n,r)=>{if(typeof n==`number`&&n>=0){let r=t.registers.get(n);if(r===void 0)throw new e.C(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new e.C(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${I(n)}`);return ag(t,n,r?.state)},sg=e=>e.length===0?[[]]:e.flatMap((t,n)=>sg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),cg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&N(e).elements.forEach(cg),e.kind===`Function`&&e.range.forEach(cg))},lg=(t,n)=>[R(`Print`,2,e=>(t(`${D(I(L(e,0,`Print`),!0,!0))} ${D(I(L(e,1,`Print`),!0,!0))}`),L(e,1,`Print`))),R(`PrintT`,1,e=>(t(D(I(L(e,0,`PrintT`),!0,!0))),!0)),R(`Assert`,2,t=>{if(L(t,0,`Assert`)!==!0)throw new e.C(`The first argument of Assert evaluated to FALSE; the second argument was:\n${D(I(L(t,1,`Assert`)))}`,e.W.assertViolation);return!0}),R(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),R(`:>`,2,e=>vn([[L(e,0,`:>`),L(e,1,`:>`)]])),R(`@@`,2,e=>{let t=ni(e,0,`@@`),n=ni(e,1,`@@`);return yn([...Ke(t),...Ke(n)])}),R(`ToString`,1,e=>at(I(L(e,0,`ToString`),!0))),R(`TLCEval`,1,e=>{let t=L(e,0,`TLCEval`);return cg(t),t}),R(`Permutations`,1,e=>{let t=ei(e,0,`Permutations`);return fn(sg(t).map(e=>vn(t.map((t,n)=>[t,e[n]]))))}),ai(`SortSeq`,2,e=>{let t=ri(e,1,`SortSeq`);return j(ti(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`?_i({...oi(`TLCGet`,1,(e,t)=>og(n,L(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):_i(Ci(`TLCGet`,1,(e,t)=>og(n,wi(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)`),oi(`TLCSet`,2,e=>{let r=L(e,0,`TLCSet`);return qh(n,t,r,L(e,1,`TLCSet`)),!0}),ii(`Any`,pt),R(`RandomElement`,1,e=>Bm($r(e,0,`RandomElement`),n.getRandom()))],ug=(e,t)=>e.every(e=>ir(e,t)),dg=fn([!1,!0]),fg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return _n(fg(e,t,r),fg(e,r,n))},pg=[`\\cup`,`\\cap`,`\\`],mg=e=>typeof e==`object`&&e.kind===`MixedSet`,hg=(e,t,n)=>{let r=t.kind===`Interval`?N(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return pn(r.filter(e=>ir(e,n)===t))}if(r.length===0)return n;if(!Be(n))return Et({kind:`SetOperation`,operator:e,left:t,right:n});let i=N(n).elements.filter(e=>!ir(e,t));return pn([...r,...i])},gg=[ii(`TRUE`,!0),ii(`FALSE`,!1),ii(`BOOLEAN`,dg),ii(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),si(`=`,un),si(`#`,(e,t)=>!un(e,t)),R(`~`,1,e=>!Zr(e,0,`~`)),R(`<=>`,2,e=>Zr(e,0,`<=>`)===Zr(e,1,`<=>`)),R(`/\\`,2,e=>Zr(e,0,`/\\`)&&Zr(e,1,`/\\`)),R(`\\/`,2,e=>Zr(e,0,`\\/`)||Zr(e,1,`\\/`)),R(`=>`,2,e=>!Zr(e,0,`=>`)||Zr(e,1,`=>`)),R(`\\in`,2,e=>ir(L(e,0,`\\in`),L(e,1,`\\in`))),R(`\\notin`,2,e=>!ir(L(e,0,`\\notin`),L(e,1,`\\notin`))),R(`\\subseteq`,2,e=>{let t=Qr(e,0,`\\subseteq`),n=L(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&M(t.base)?ug(N(t.base).elements,n.base):ug(N(t).elements,n)}),...pg.map(e=>R(e,2,t=>{let n=L(t,0,e),r=L(t,1,e);if(Be(n)&&Be(r)&&!mg(n)&&!mg(r)){if(e===`\\cup`&&P(n))return r;let t=e===`\\cup`?_n:e===`\\cap`?gn:hn;return rr((e,n)=>t(N(e),N(n)),(t,n)=>hg(e,t,n),n,r)}return Be(n)?hg(e,n,r):e!==`\\`&&Be(r)?hg(e,r,n):Et({kind:`SetOperation`,operator:e,left:n,right:r})})),R(`SUBSET`,1,e=>({kind:`Subset`,base:L(e,0,`SUBSET`)})),R(`UNION`,1,e=>{let t=Qr(e,0,`UNION`),n=Ve(t)?t.elements.filter(Ve):[];if(!Ve(t)||n.length!==t.elements.length)return Et({kind:`Union`,base:t});if(mg(t)||n.some(mg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{ir(t,e)||e.elements.push(t)})),pn(e.elements)}return n.length===0?mn:fg(n.map(N),0,n.length)}),R(`DOMAIN`,1,t=>{let n=L(t,0,`DOMAIN`);if(!k(n))throw new e._(`DOMAIN expects a function but received ${I(n)}`);return _r(n)})],_g=yi(`Integers`,`Neg`,`IntValue`,1),vg=t=>{let n=yi(t,`DotDot`,`IntervalValue`,2);return[bi(t,`+`,`Plus`,(e,t)=>e+t),bi(t,`-`,`Minus`,(e,t)=>e-t),bi(t,`*`,`Times`,(e,t)=>e*t),bi(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.C(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.C(`0^0 is undefined.`);return t**n}),bi(t,`\\div`,`Divide`,(n,r)=>{if(r===0)throw new e.C(`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(ci(i))throw li(`${n} \\div ${r}`);return i}),bi(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.C(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),R(`..`,2,e=>({kind:`Interval`,low:vi(L(e,0,`..`),n),high:vi(L(e,1,`..`),n)}))]},yg=vg(`Naturals`),bg=vg(`Integers`),xg=e=>{let t=yg.indexOf(e);return t===-1?void 0:bg[t]},Sg=[ii(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...yg,Si(`<`,(e,t)=>e<t),Si(`>`,(e,t)=>e>t),Si(`<=`,(e,t)=>e<=t),Si(`>=`,(e,t)=>e>=t,`>`)],Cg=[ii(`Int`,{kind:`InfiniteSet`,name:`Int`}),...bg,Si(`>=`,(e,t)=>e>=t),R(`-.`,1,e=>{let t=vi(L(e,0,`-`),_g);if(ci(-t))throw li(`-${t}`);return-t})],wg=(t,n,r)=>{let i=L(t,n,r),a=er(i);if(!a)throw new e.C(`${r}\n${I(i)}`);return a},Tg=(e,t,n)=>{let r=L(e,t,n);return typeof r==`string`?r:wg(e,t,n)},Eg=(e,t,n)=>typeof e==`string`?at(e.slice(t,n)):j(e.slice(t,n)),Dg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Og=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,kg=(e,t)=>{let n=$d.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?_i(e,t):e}):t},Ag=t=>kg(`Sequences`,[R(`Seq`,1,e=>({kind:`SequenceSet`,base:L(e,0,`Seq`)})),R(`Len`,1,e=>Tg(e,0,Dg(``,`Len`)).length),R(`\\o`,2,t=>{let n=Tg(t,0,Og(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=wg(t,1,Og(`t \\o s`,`sequence`));return j([...n,...e])}let r=L(t,1,`\\o`);if(typeof r!=`string`)throw new e.C(`${Og(`t \\o s`,`string`)}\n${I(r)}`);return at(n+r)}),R(`Append`,2,e=>j([...wg(e,0,Og(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),L(e,1,`Append`)])),R(`Head`,1,t=>{let n=wg(t,0,Dg(``,`Head`));if(n.length===0)throw new e.C(`Attempted to apply Head to the empty sequence.`);return n[0]}),R(`Tail`,1,t=>{let n=Tg(t,0,Dg(``,`Tail`));if(n.length===0)throw new e.C(`Attempted to apply Tail to the empty sequence.`);return Eg(n,1)}),R(`SubSeq`,3,t=>{let n=Tg(t,0,Dg(`first `,`SubSeq`)),r=Xr(t,1,`SubSeq`),i=Xr(t,2,`SubSeq`);if(r>i)return Eg(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.C(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${I(L(t,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return Eg(n,r-1,i)}),ai(`SelectSeq`,2,e=>{let t=ri(e,1,`SelectSeq`);return j(wg(e,0,Dg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw Jr(`second`,`SelectSeq`,`operator`,n);return n}))})]),jg=t=>kg(`FiniteSets`,[R(`IsFiniteSet`,1,t=>{let n=L(t,0,`IsFiniteSet`);if(O(n))return Qn(n);if(typeof n==`object`&&n.kind===`Function`)return!0;throw new e._(typeof n==`object`&&n.kind===`LazyFunction`?`Attempted to check if the function:\n${I(n)}\nis a finite set.`:`Attempted to check if the ${He(n)} ${I(n)} is a finite set.`)}),R(`Cardinality`,1,n=>{let r=L(n,0,`Cardinality`);if(!O(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.C(`Attempted to compute cardinality of the value\n${I(r)}`);return Xn(r,t)})]),Mg=/* @__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`]]]),Ng=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Sg};case`Integers`:return{extends:[`Naturals`],operators:Cg};case`Sequences`:return{extends:[],operators:Ag(n.version)};case`FiniteSets`:return{extends:[],operators:jg(n.version)};case`TLC`:return{extends:[],operators:kg(`TLC`,lg(t,n))};case`Randomization`:return{extends:[],operators:zh(n)};case`_Possible`:return{extends:[],operators:Qh(t,n)};case`Json`:return{extends:[],operators:Nh(r)};case`Bags`:return{extends:[],operators:ph(i)};case`TLCExt`:return{extends:[],operators:Zh(t,n)};default:return}},Pg=`$subexpression`,Fg=(t,n)=>new e.O(`${t} at line ${n.line}, column ${n.column}`),Ig=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Ig(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ke(e)){let e=Ig(r,t,n);if(e)return e}},Lg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Rg=(e,t)=>{let n=e.location,r=Lg(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 Fg(`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 Fg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Pg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Pg,args:e.args,location:n,resolution:ma},location:n}},zg=(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:ma})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:ma}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:ma};return Rg({...t,params:[...t.params,...r]},a)},Bg=(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 Fg(i,a);ga.set(r,{args:t.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:e.z(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 Fg(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Ro(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw Fg(`Unknown operator ${r.join(`!`)}`,a)},u=e=>{let n=l(e),u=n.definition,d=xa(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 Fg(`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&&Ig(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 Fg(`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`||Ha(e.operand,1)!==0)throw Fg(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=Ka(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[Ha(e.operand,r.length)],o=t[s.index+1];if(!i||o?.kind!==`Operand`)throw Fg(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=Ha(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Fg(`Nonexistent CASE operand`,a);s.current=l;return}if(e.kind!==`Operand`)throw Fg(`Unexpected subexpression selector`,a);let i=r?r.sets:qa(n),c=i?.[Ha(e.operand,i.length)];if(!c)throw Fg(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return zg(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 Fg(`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 zg(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(e),s.index++}if(s.isFailed)return r;if(!s.current)throw Fg(`Subexpression selection failed`,a);return Rg(o,s.current)},Vg=(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 Ua(e,t,n)},Hg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ke(e).some(Hg),Ug=(e,t,n,r=!1)=>{if(!Hg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Vo(e,e=>Ug(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Wg(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)=>Ug(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Vo(e,e=>Ug(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Vg(a.name,[],void 0,t):a.kind===`Apply`?Vg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Bg(o,t,a,r);return c!==a&&ha.add(c),c},Wg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Ug(e.expression,t,n,!0)}))}),Gg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Kg=(e,t)=>Wg(e,Gg(t.definitions),()=>!1),qg=(e,t)=>{let n=Gg([...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=>Ug(e,n,i),o=e=>i(e)||!n(e),s=e=>Ug(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 Wg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Wg(e,n,o):Bo(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=>Hg(e.body))||e.assumptions.some(e=>Hg(e.expression))?{...p,definitions:e.definitions.map(e=>Bo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Jg=(e,t)=>e.maxLevels[t]??3,Yg=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Ws({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=>xs(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>xs(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ss(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=vs(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)&&xs(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(Gs(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.z(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(gs(e.name,i));a!==void 0&&Jg(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=vs(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=Jg(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.I([...i.values()])}},Xg=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Zg=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Qg=new Map(qd.flatMap(e=>e.map(t=>[t,e[0]]))),$g=e=>Qg.get(e)??e,e_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},t_=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},n_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:e_(e)&2147483647,kind:t,isLocal:n}),r_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:$g(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:$g(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},i_=(e,t)=>{let n=[];for(let r=t;;){let t=r_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},a_=e=>({line:e.line,column:e.column}),o_=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text===`.`)continue;else if(a.text===`EXTENDS`){let n=i_(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},s_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,c_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},l_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&s_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&s_(e[n+1],e[n+2])?n+=s_(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=>c_[e])}"`:r.text)}return t},u_=e=>e[2]?.text,d_=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},f_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>f_(e.modules,t)).find(Boolean),p_=e=>{let t=e===void 0?[]:se(e),n={module:void 0};return{tokens:t,ranges:d_(t),getModule:()=>n.module??=e===void 0?Jp(``):Yp(e,t)}},m_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=p_(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:(Zd.has(i)?t?.(i):void 0)??Qd.get(i)??t?.(i)??Kp(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(u_(c)??``)??{start:0,end:0},f={tokens:c,...d,getModule:u};return n.set(i??``,f),l.forEach((e,t)=>{e.start===d.start||r.has(t)||r.set(t,{tokens:c,...e,getModule:()=>f_(f.getModule().modules,t)??f.getModule()})}),f};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},h_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=i_(t,e+1);i.push({location:a_(t[e]),apply:e=>r.forEach(t=>e.put(n_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,r)=>{let l=e.start+r,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;i.push({location:a_(u),apply:t=>t.put(n_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&i_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),Zg.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(a_(u)),i.push({location:a_(u),apply:e=>e.put(n_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(n_(t,`theorem`,!1))})});let l=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=$g(e.name);i.push({location:e.location,apply:n=>n.put(n_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(n_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(n_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>ba(e.location,t.location)?-1:+!!ba(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=t_();n.set(i??``,o),Kd.toReversed().forEach(e=>o.put(n_(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},g_=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),Jd.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=o_(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},ee=m(e=>e.extends),te=m(e=>e.instances),ne=/* @__PURE__ */ new Set([void 0]),h=/* @__PURE__ */ new Map;l_(o(void 0)).forEach((e,t)=>{t===3&&Xd.forEach(i),i(e)});let g=l(void 0);for(;;){let n=ee(g,/* @__PURE__ */ new Set)??te(g,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),h.set(r.unit,[...h.get(r.unit)??[],a]),!ne.has(a)){if(ne.add(a),t(a).tokens.length===0){let n=r.unit??u_(t(void 0).tokens);throw e.F(a,n)}l_(o(a)).forEach(i)}}Xg.forEach(i);let re=/* @__PURE__ */ new Set,ie=e=>{if(re.has(e))return;re.add(e);let t=h.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ie),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ie(void 0),Yd.forEach(i),[...r]},__=(e,t)=>{let n=m_(e,t),r=n.getParsed,i,a=()=>i??=h_(r);return{getStringOrder:e=>g_(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let{getContext:e,getOwnEntries:t}=a();return e(void 0),e=>t(e).filter(e=>e.kind===`definition`).map(e=>e.name)}}},v_=t=>{switch(t.kind){case`Number`:if(!Ue(t.value))throw e.K(new e.C(`Integer overflow: ${t.value} is outside TLC's 32-bit range`),e.W.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return _t(t.name);case`Set`:return fn(t.elements.map(v_))}},y_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],b_=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.O))throw r;let i=bp(t);throw i===void 0?r:e.I([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},x_=t=>new e.O(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),S_=(t,n)=>t.location.range&&n.location.range&&{location:e.z(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.z(n.location.range)}.`},C_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,w_=e=>e===`Theorem`?`ThmOrAssumpDefNode`:C_(e),T_=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:ts(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),E_=(t,n,r)=>{let i=`{ ${r.map(e=>`<${[...e[0],e[1]].map(e=>I(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._(`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`)&&At(e,r)})});if(n)return n[1];throw new e._(`Attempted to apply operator:\n${i}\nto arguments (${t.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:I(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},D_=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||ke(e).some(e=>D_(e,t)),O_=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Xo(e),n.get(e)??n.size)),n},k_=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),A_=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw tu(e);if(e.kind===`Number`&&!Ue(e.value))throw nu(e);A_(e.kind===`Let`?[...ke(e),...k_(e.instances??[])]:ke(e))}),j_=(t,n)=>{let r=n.order??__(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=new Map(gg.map(e=>[e.name,e])),u=/* @__PURE__ */ new Map,d=Vm(t.checkDeadlock,n.seed);d.isWarningEnabled=n.isWarningEnabled??!0,d.isTool=n.isTool??!1,d.version=n.version??`master`;let f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,ee=[],te=/* @__PURE__ */ new Map,ne=[],h=[],g=(e,t)=>ne.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),re={value:0},ie=e=>`${e}#${re.value++}`,_=[],ae=[],oe=Yg(e=>{let t=m.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,le=/* @__PURE__ */ new Map,ue=e=>{let t=u.get(e);if(t)return t;let r=Ng(e,n.print,d,n.files,l);if(!r)return;Mg.get(e)?.forEach(ue);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>ue(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{l.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:ps.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:hs(e,t.name)??i.get(t.name)?.range})}),u.set(e,i),i},v=e=>{if(Zd.has(e)&&n.loadModule?.(e)!==void 0)return;let t=ue(e),r=Mg.get(e)??[];return t&&g(e,r),t&&r.includes(`Integers`)&&ue(`Integers`),t},y=e=>(A_([...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]),...k_(e.instances)]),e.modules.forEach(y),e);y(i);let de=(t,i)=>{let a=n.loadModule?.(t)??Ne.get(t)??Kp(n.source,t);if(a===void 0)throw e.F(t,i);let o=b_(a,t,r);if(o.name!==t)throw e.I([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return y(o)},fe=t=>{let n=h.indexOf(t.name);if(n!==-1){let r=[...h.slice(n),t.name].map(e=>`${e}.tla`);throw new e.O(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];h.push(t.name),ne.push(r);let s=ye(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:ae,levelChecks:o});if(ne.pop(),h.pop(),a.length>0)throw e.I(a,!1,void 0,ae);let c=i.find(e=>r.has(e.name)),l=c&&f.get(c.name),u=l&&S_(c,l.module);if(u)throw e.I([u],!1,void 0,ae);if(c)throw x_(c);return o.forEach(e=>e()),{linked:s,closure:r}},pe=(e,t)=>{let r=f.get(e);if(r)return g(e,te.get(e)??[]),r;let i=fe(de(e,t));return(qm(d.version).has(e)?Ng(e,n.print,d,n.files,l):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(l.set(t.key,e),a.delete(t.key))}),f.set(e,i.linked),te.set(e,i.closure),g(e,i.closure),i.linked},b=(e,t,n,r,i)=>{let l=i?void 0:v(e.module);if(l)return x(e,l);let u=i??pe(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=y_(u),f=`#${re.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Ao(Kg(e,t),d,t,n);_.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let ee=cs({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Fo(t,p)])),variables:new Set(u.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ie(`${i}@${t.name}`),f=l(u);return a.set(u,f),d.length>0&&c.add(f),e.name!==void 0&&ce.set(u,`${e.name}!${ce.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ie});return S(e,u.exported,d,(t,n)=>{let r=e.name===void 0?ee.getKey(t):ee.getQualifiedKey(t);return d.length>0&&se.set(r,{name:n,location:e.location}),e.name!==void 0&&le.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:o.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:ns(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),me=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),he=(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=me(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:ns(r,n),location:n}}},ge=(e,t,n,r)=>{let i=e.location,s=r?void 0:v(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=me(n.arity);return C(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${re.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=y_(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};_.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>D_(f(e),p),ee=d.map(t=>{let n=he(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),te=[],ne=cs({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:ns(e.params,i),location:i,resolution:ma}:ts(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),isParameterized:e=>o.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${te.length}`,a=r(i);return te.push(a.kind===`Operator`?{...a,name:i}:T_(a,i)),i},createName:ie}),h=new Set(d.map(e=>e.name)),g=[...c.exported].filter(([e])=>!h.has(e)).map(([t,n])=>{let r=ne.getKey(n.key),a=me(n.arity),o=[...e.params,...a];return C(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...ee,...te,...g]},_e=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),ve=/* @__PURE__ */ new Map,ye=(t,r)=>{let s=Gd(t,n.loadClass?.(t.name),t===i);ve.set(t.name,s.overrides);let c=s.module,l=_.length,u=new Map([...gg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:To,errors:[],warnings:[]},te=[f],ne=t=>t.forEach((t,n)=>{let r=h.get(n);if(!r){u.set(n,t),h.set(n,t);return}if(!r.range||!t.range||e.z(r.range)===e.z(t.range))return;let i=e.z(t.range),a=e.z(r.range);w_(r.kind)===w_(t.kind)?f.warnings.push({location:i,message:`Warning: the ${C_(r.kind)} of '${n}' conflicts with \nits ${C_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${C_(t.kind)} of '${n}' conflicts with \nits ${C_(r.kind)} at ${a}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,re=/* @__PURE__ */ new Map,ie=[],se=[...c.constants],ce=c.variables.map(e=>e.name),ue=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:v(e);if(n){ne(n);return}let i=t??pe(e,c.name);se.push(...i.constants.filter(e=>se.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{ce.includes(e)||(ce.push(e),ue.push(i.variableLocations[t]))}),ne(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>re.set(t,e)),ie.push(i)});let y=new Map(u),de=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],fe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});de.forEach(e=>h.set(e.name,fe(e)));let C=e=>({key:he(e),arity:xa(e),params:Sa(e),kind:Eo(c,e)?`Theorem`:`Definition`,range:e.location.range}),me=se.length===0&&ce.length===0,he=e=>c===i?e.name:`${e.name}@${r.id}`,w=/* @__PURE__ */ new Map,T=()=>new Map([...r.modules,...re]),be=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&ba(e.location,t.location)},xe=e=>{let t=c.modules.find(t=>t.name===e.module);return t?be(t)?re.get(t.name):void 0:T().get(e.module)},Se=e=>({imported:u,getInstance:e=>{let t=xe(e),n=t?void 0:v(e.module);if(n)return{declarations:[],symbols:x(e,n),instancer:c.name};let r=t??pe(e.module,c.name),i=y_(r);return{declarations:i,symbols:S(e,r.exported,i,e=>e),instancer:c.name}},bound:y,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:he,instanced:w,facts:g,reports:te,warnings:r.warnings}),Ce=e=>[...de.filter(t=>ba(t.location,e)).map(e=>[e.name,fe(e)]),...c.definitions.filter(t=>ba(t.location,e)).map(e=>[e.name,C(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),we=e=>{let t=T(),n=t.get(e.name),i=n&&S_(e,n.module);if(n&&!i)throw x_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};te.push(a);let o=ye(e,{id:`${r.id}/${e.name}`,symbols:Ce(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||re.set(e.name,o),p.has(e.name)||p.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=b(e,c,Se(c),me,T().get(e.module));w.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||h.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>we(e)}))].sort((e,t)=>ba(e.location,t.location)?-1:1).forEach(e=>e.link());let Te=qg(fs(c,(e,t)=>ge(e,t,c.name,xe(e))),_e(u));r.errors.push(...Mo(Te,Se(Te))),Te.definitions.forEach(e=>{let t=he(e);a.set(t,e),o.set(t,!me);let n=C(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ba(r,e.location))&&(u.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ee={module:Te,constants:se,variables:ce,variableLocations:ue,visible:u,exported:h,modules:re,extended:ie,facts:/* @__PURE__ */ new Set([...g,...[...Te.theorems,...Te.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,Ee);let De=_.splice(l).map(e=>({location:e.location,check:()=>oe(e)}));return r.levelChecks.push(()=>Ks(Te,{constants:new Set(se.map(e=>e.name)),variables:new Set(ce),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>le.get(u.get(e)?.key??e)},De,ae)),ee.push(Ee),Ee},w=fe(i).linked;ae.length>0&&!n.isSanyReported&&n.print(e.B(ae));let T=e=>w.visible.get(e)?.key??e;w.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let be=[],xe=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>xe(e,t)),be.push(...e.module.assumptions))};xe(w,/* @__PURE__ */ new Set);let Se=w.constants.map(e=>e.name),Ce=w.variables,we=e=>e.module===void 0?[e.name,T(e.name)]:e.module===i.name||Se.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],Te=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:w.constants.find(t=>t.name===e)?.arity??0},Ee=/* @__PURE__ */ new Map,De=/* @__PURE__ */ new Set,Oe=(e,t)=>{l.set(e,t),a.delete(e),Ee.delete(e),De.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=v_(e.value);ln(t),we(e).forEach(e=>{let n=Te(e);n===0?Ee.set(e,t):Oe(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let ke=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=ke.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.h(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(v_),v_(t.value)]),ke.set(n,r)}),ke.forEach(e=>we(e).forEach(t=>Oe(t,E_(e.name,Te(t)||e.rows[0][0].length,e.rows))));let E=new Map(t.substitutions.flatMap(e=>we(e).map(t=>[t,T(e.target)])));t.substitutions.filter(e=>e.module===void 0).forEach(n=>{let r=n.name,i=n.target;if(!Se.includes(r)&&!w.visible.has(r))throw new e.h(`In the configuration file, the identifier ${r} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===i))throw new e.h(`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 o=T(i),s=a.get(o);if(!(s!==void 0||l.has(o)||Ee.has(o)||Se.includes(i)||Ce.includes(i)))throw new e.h(`The configuration file substitutes for ${r} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(w.constants.find(e=>e.name===r)?.arity??w.visible.get(r)?.arity))throw new e.h(`The configuration file substitutes for ${r} with ${i} of different number of arguments.`)});let Ae=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(we)),je=(e,t)=>{if(Ae.has(e))return{key:e,prefix:t};let n=s.get(e);return n&&je(n.source,t+n.prefix)};s.forEach((e,t)=>{let n=je(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=C(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),w.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Me=Se.filter(e=>!Ee.has(e)&&!E.has(e)&&!De.has(e));if(Me.length>0&&!n.isUnconfigured){let t=r.getDeclarationOrder(`constant`).find(e=>Me.includes(e))??Me[0];throw new e.h(`The constant parameter ${t} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&l.forEach((e,t)=>{let n=xg(e);n&&l.set(t,n)});let Pe=O_(Ce,ee.flatMap(e=>e.module.variables.map(e=>e.name))),Fe=oc({definitions:a,substitutions:E,constants:Ee,variableIndex:Pe,builtins:l,variables:Ce}),Ie={runtime:d,definitions:a,builtins:l,constants:Ee,substitutions:E,instanceNames:ce,variables:Ce,variableIndex:Pe,facts:Fe,startupValues:Array.from({length:Fe.ids.size},()=>void 0),substitutedDefinitions:c,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Le=Ws({constants:new Set(Ee.keys()),variables:/* @__PURE__ */ new Set([...Ce,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>l.has(e))]),getDefinition:e=>pu(e,Ie)}),Re=t=>{try{H(t,{environment:Ie,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e._)return t;throw t}};E.forEach((t,n)=>{let r=a.get(t),i=Se.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&Le.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Re(r.body):void 0;if(i){let r=Xi(i)?``:` - specifically: ${i.message}`;throw new e.h(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),d.version!==`1.7.4`&&(d.isStarted=!0);let D=new Set(ee.flatMap(e=>e.module.instances.map(e=>e.module))),ze=r.createDefinitionOrder();return{environment:Ie,assumptions:be,variableLocations:w.variableLocations,instanceActions:se,startupDefinitions:ee.filter(e=>!D.has(e.module.name)||y_(e).length===0).flatMap(e=>ze(e===w?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:w.constants,rootSymbols:w.visible,javaOverrides:ee.flatMap(e=>ve.get(e.module.name)??[])}},M_={kind:`Boolean`,value:!0},N_={kind:`Boolean`,value:!1},P_=e=>e?M_:N_,F_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,I_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),L_=(e,t,n)=>({kind:e,operands:[t,n]}),R_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?R_(e,t.operands).operands:[t])}),z_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return z_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,z_(t)),0)}},B_=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 B_(e.body);case`And`:case`Or`:return e.operands.some(B_)}},V_=/* @__PURE__ */ new WeakMap,H_={count:0},U_=e=>{let t=V_.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`#${H_.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(U_).join(`,`)})`;default:return`${e.kind}(${U_(e.body)})`}})();return V_.set(e,n),n},W_=(e,t)=>e===t||U_(e)===U_(t),G_=(e,t)=>{let n=U_(t);return e.some(e=>e===t||U_(e)===n)},K_=e=>e===`And`?`Or`:`And`,q_=(e,t)=>{switch(e.kind){case`Boolean`:return t?P_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return q_(e.body,!t);case`And`:case`Or`:return R_(t?K_(e.kind):e.kind,e.operands.map(e=>q_(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,q_(e.body,t))}}},J_=e=>{switch(e.kind){case`Boolean`:return P_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return R_(K_(e.kind),e.operands.map(J_));case`Always`:return $(`Eventually`,J_(e.body));case`Eventually`:return $(`Always`,J_(e.body));default:return $(`Not`,e)}},Y_=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Y_(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return P_(t)}return n.length===0?P_(!t):n.length===1?n[0]:R_(e.kind,n)}case`Not`:{let t=Y_(e.body);return t.kind===`Boolean`?P_(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Y_(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},X_=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Z_=t=>{switch(t.kind){case`And`:{let n=[],r={value:1};for(let i of t.operands){let t=Z_(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._(`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=>R_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=Z_(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=X_(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:R_(`Or`,e);n.push($(`Always`,$(`Eventually`,t)))}return R_(`Or`,n)}case`Not`:return F_(t.body)?t:Z_(J_(t.body));default:return t}},Q_=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Q_(e.operands[0]):R_(e.kind,e.operands.map(Q_));case`Not`:return e.body.kind===`Not`?Q_(e.body.body):$(`Not`,Q_(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Q_(e.body));default:return e}},$_=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return $_(e.operands[0]);let t=Math.floor(e.operands.length/2);return L_(e.kind,$_(R_(e.kind,e.operands.slice(0,t))),$_(R_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,$_(e.body));default:return e}},ev=(e,t)=>{e.kind===`Eventually`&&!G_(t,e)&&t.push(e),`body`in e&&ev(e.body,t),`operands`in e&&e.operands.forEach(e=>ev(e,t))},tv=e=>{let t=e.filter(I_),n=e.flatMap(e=>e.kind===`Not`&&I_(e.body)?[e.body]:[]);return!t.some(e=>G_(n,e))},nv=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._(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},rv=(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]}},iv=(e,t,n)=>e.flatMap(e=>{let r=rv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),av=e=>[...new Set(e.map(U_))].sort().join(`|`),ov=(e,t)=>{let n=new Set(t.map(av));return[...e.filter(e=>!n.has(av(e))),...t]},sv=e=>{let t=nv(e),n=iv(t,`Always`,`And`),r=iv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=rv(t,`Eventually`,`Or`);if(n&&!(G_(e,n.first)||G_(e,n.second)))return ov(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(G_(e,t.first)||G_(e,t.second))&&!G_(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!tv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=rv(t[e],`Always`,`And`);n&&(G_(t,n.first)||t.push(n.first),G_(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)G_(t,e.first)&&G_(t,e.second)&&!G_(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!tv(t)?[]:i(t)};return a(e)},cv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>z_(e)<=1)}),lv=e=>{let t=sv([e]).map(cv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=av(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 sv(n)){let n=av(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(cv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},uv=(e,t)=>!G_(e,t)||G_(e,t.body),dv=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&z_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=X_(t);if(r){let e=z_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(B_(t))throw new e._(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},fv=(e,t)=>{let n=e.findIndex(e=>W_(e,t));return n===-1?(e.push(t),e.length-1):n},pv=e=>{let t=Z_(Y_(q_(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Q_(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])dv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:R_(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:W_(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&$_(e.formula),n=[];t&&ev(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>fv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>fv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>fv(i,e))}));return{tableau:t&&lv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},mv=()=>e.K(new e._(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.W.livenessEvaluationFailure),hv=/* @__PURE__ */ new Set([`~>`,`-+->`]),gv=/* @__PURE__ */ new WeakSet,_v=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),vv=(t,n)=>new e._(`TLC cannot handle the temporal formula ${B(t)}${n===void 0?``:`:\n${n}`}`),yv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ou(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return yv(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?yv(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=pu(e,n);if(t)return fc(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:E(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Vo(e,(e,a)=>(i.value=Math.max(i.value,yv(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 hv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},bv=(t,n)=>{try{return Su(t,n)}catch(t){if(!(t instanceof e._))throw t;if(!Xi(t))return;throw e.K(new e._(`${e.N}${t.message}`),e.W.error)}},xv=(t,n,r,i,a=/* @__PURE__ */ new Set,o=!1,s)=>{let c=(e,t,n=s,c=a,l)=>xv(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,B(e)));if(t.kind===`Label`)return c(t.body,n);if(t.kind===`Let`)return c(t.body,Sv(t,n,r));if(t.kind===`Identifier`){let i=E(t)?ou(n,t.name):void 0;if(i?.kind===`Thunk`)return c(i.expression,i.scope);let o=r.constants.has(t.name)?void 0:pu(t.name,r);if(!i&&o?.kind===`Operator`&&o.params.length===0&&fc(o,r)>0){if(a.has(o))throw e.R();return c(o.body,void 0,o.name,/* @__PURE__ */ new Set([...a,o]),o)}}let l=_v(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||yv(t,n,r)===3)){let e=Wu(t,l),n=E(t)?void 0:pu(t.operator,r);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&!o)return c(e.body,nd(e,t.args,l),t.operator,a,n)}let u=i&&t.kind===`Forall`&&t.bounds.every(e=>yv(e.set,n,r)===0),d=u?bv(t.bounds,l):void 0;if(u&&d){let e=[];if(Cu(t.bounds,d,n,n=>(e.push(...c(t.body,n,B(t.body))),!1)),e.length===0)throw mv();return e}return[{expression:t,scope:n,name:s}]},Sv=(e,t,n)=>{let r=id(e.definitions,_v(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&gv.add(e.binding);return r},Cv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?yv(t,n,r):a;if(o===0){let i=H(t,_v(r,n));if(typeof i!=`boolean`)throw new e._(`TLC expected a boolean value, but did not find one. ${Jl(t)}`);return P_(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.R();o.depth++;let s=p(t,n);o.depth--;let c=z_(s);return c>2?s:a(r,i,c)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=_v(r,t),o=E(e)||pu(n,r)===void 0?ou(t,n):void 0;if(o?.kind===`Thunk`&&gv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:E(e)?Gu(n,a):Uu(n,r);if(c?.kind!==`Closure`)throw vv(e);let u=e.kind===`Apply`?e.args:[],d=!E(e)&&pu(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,nd(c,u,a),e,t)),d)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.D||r&&!i;throw!(n instanceof e._)||a?n:vv(t)}},u=(t,n)=>{let i=yv(t,n,r);if(!t.bounds.every(e=>yv(e.set,n,r)===0)){if(i<=2)return a(t,n,i);throw vv(t)}let o=[],s=t.kind===`Forall`;try{wu(t.bounds,_v(r,n),e=>(o.push(p(t.body,e)),!1))}catch(r){if(!(r instanceof e._)||r instanceof e.D)throw r;if(i<=2)return a(t,n,i);throw vv(t,s&&!Xi(r)?r.message:void 0)}return o.length===0?P_(s):d(t,n,R_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=z_(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===`~`&&!E(e)||e.operator===`=>`),p=(e,t)=>{let n=yv(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,Sv(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,L_(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!E(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,L_(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,R_(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&yv(e.condition,t,r)===0){let n=H(e.condition,_v(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,L_(`Or`,L_(`And`,n,p(e.consequent,t)),L_(`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`,L_(`Or`,i,a))):L_(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw vv(e)}};return p(t,n)},wv=(t,n,r,i,a)=>{let o=e=>wv(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`?fu(H(t.expression,r),`a temporal property predicate`):Ll(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&&fu(H(t.unchanged,e),`a subscript`)?!1:fu(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 wv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e._(`TLC cannot evaluate a temporal formula in a single step`)}},Tv=(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)=>Tv(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 wv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Ev=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Dv=(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},Ov=t=>e.K(new e._(`${e.P}${t}`),e.W.error),kv=e=>{let t=F(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!A(e)||!A(i))throw Ov(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Av=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Av);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},jv=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Mv=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e.h(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw Ov(`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)||!M(o))throw Ov(`The symmetry operator must specify a set of functions.`);let s=N(o).elements;if(!s.every(k))throw Ov(`The symmetry values must be function records.`);let c=s.map(kv),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=Av(jv(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(Bi.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(Ev(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=Dv(n,e),r=Ev(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m.start=t}let ee=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),te=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!jv(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||te.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>A(e)&&ee.has(e.name))})),f.size!==0)return[...f.values()]},Nv=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Fv(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(Fv(e[r],t));return a}},Pv=(e,t)=>{let n=[],r=[];for(let i of e){let e=Fv(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(ht);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(ht(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},Fv=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=Pv(e.elements,t);return n?vt(n):e}if(n===`Function`||n===`LazyFunction`&&M(e.domain)){let n=F(e),r=Nv(n.domain,t),i=Nv(n.range,t)??n.range;if(r){let e=vn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?yt(n.domain,e.range):e}return i===n.range?n:yt(n.domain,i)}if(n===`Interval`||!O(e)||!M(e))return e;let r=N(e),i=Nv(r.elements,t);return i?fn(i):r},Iv=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=Fv(e[o],i),a===0&&(a=ht(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},Lv={line:0,column:0},Rv=e=>({kind:`Identifier`,name:e,location:Lv}),zv=/* @__PURE__ */ new Set([`name`,`property`]),Bv=(t,n,r)=>{let i=pu(n,r);if(!i)throw new e.h(`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.h(zv.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},Vv=(t,n,r)=>{if(lc(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return H(Rv(t),ly(r,void 0,void 0))}catch(t){if(t instanceof e._||e.U(t))return;throw t}},Hv=(t,n,r)=>{let i=Bv(t,n,r);if(Vv(n,i,r)!==void 0)throw new e.h(`The ${t} ${n} cannot be a constant.`);return i},Uv=(t,n,r)=>{let i=r.constants.has(n)?void 0:Bv(t,n,r),a=i?Vv(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e.h(`The ${t} of ${n} is equal to ${I(a)}`);return a===void 0?i:void 0},Wv=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Gv=(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})),Bu(e.startupDefinitions,r),t.invariants.forEach(e=>{Uv(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Kv=(t,n)=>{let r=Ws({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>pu(e,n)});return t.flatMap(t=>{let i=Uv(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1780
+ `]]),Ef=(e=`master`)=>e===`1.7.4`?Tf:wf,Df=(e,t)=>e.every(e=>gi(e,t)),Of=_r([!1,!0]);fr(Of);const kf=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Sr(kf(e,t,r),kf(e,r,n))},Af=[`\\cup`,`\\cap`,`\\`],jf=e=>typeof e==`object`&&e.kind===`MixedSet`,Mf=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Nf=(e,t,n)=>{t.kind===`Interval`&&oi(t);let r=t.kind===`Interval`?t:dr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return Mt(r,e=>{gi(e,n)===i&&At(a,e)}),Mf(t)?Dn(a):vr(a)}if(ri(t))return n;if(!Nt(n))return Fn({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return Mt(r,e=>At(i,e)),Mt(n.kind===`Interval`?n:F(n).elements,e=>{gi(e,t)||At(i,e)}),vr(i)},Pf=(e,t)=>{let n=(t,n)=>Eo([Jo(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Ff=[Oo(`TRUE`,!0),Oo(`FALSE`,!1),Oo(`BOOLEAN`,Of),Oo(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),jo(`=`,mr),jo(`#`,(e,t)=>!mr(e,t)),z(`~`,1,e=>!Eo(e,0,`~`)),z(`<=>`,2,e=>Eo(e,0,`<=>`)===Eo(e,1,`<=>`)),Pf(`/\\`,(e,t)=>e&&t()),Pf(`\\/`,(e,t)=>e||t()),Pf(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>gi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!gi(R(e,0,`\\notin`),R(e,1,`\\notin`))),jo(`\\subseteq`,(t,n)=>{if(!N(t))throw new e.b(`\\subseteq expects a set but received ${L(t)}`);if(typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&P(t.base))return Df(F(t.base).elements,n.base);if(typeof t==`object`&&t.kind===`Interval`){if(typeof n==`object`&&n.kind===`Interval`&&n.low<=t.low&&n.high>=t.high)return!0;for(let e=t.low;e<=t.high;e++)if(!gi(e,n))return!1;return!0}return!Zr(t,e=>!gi(e,n))}),...Af.map(t=>z(t,2,n=>{let r=R(n,0,t),i=R(n,1,t),a=t!==`\\cup`&&typeof i==`object`&&i.kind===`Interval`&&typeof r==`object`&&r.kind!==`Interval`;if(Nt(r)&&Nt(i)&&!jf(r)&&!jf(i)&&!a&&!jt(r)&&!jt(i)){if(t===`\\cup`&&ri(r))return i;let n=t===`\\cup`?Sr:t===`\\cap`?xr:br;return mi((r,i)=>{let a=F(r),o=F(i),s=n(a,o);if(t===`\\cup`){let t=dr(a),n=br(o,a).elements,r=t===a.elements&&(n.length===0||xn(t[t.length-1],n[0])<0);if(t.length+n.length>Ot())throw new e.M(kt());if(r&&!a.isNormalized)return s;let i=s===a?En(s.elements):s;return r||(i.writtenElements=[...t,...n]),i}return s===r||(s.isNormalized=Mf(r),a.writtenElements&&!a.isNormalized&&(s.writtenElements=a.writtenElements.filter(e=>gi(e,s)))),s},(e,n)=>Nf(t,e,n),r,i)}return Nt(r)?Nf(t,r,i):t!==`\\`&&Nt(i)?Nf(t,i,r):Fn({kind:`SetOperation`,operator:t,left:r,right:i})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=It(t)?dr(t):[],r=n.filter(It);if(!It(t)||r.length!==n.length)return Fn({kind:`Union`,base:t});let i=r.flatMap(dr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{gi(t,e)||At(e.elements,t)}),vr(e.elements)};return jf(t)||r.some(jf)?a():r.length===0?yr:mi(e=>ui(kf(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,t=>{let n=R(t,0,`DOMAIN`);if(!Pt(n))throw new e.b(`DOMAIN expects a function but received ${L(n)}`);return Fi(n)})],If=Uo(`Integers`,`Neg`,`IntValue`,1),Lf=t=>{let n=Uo(t,`DotDot`,`IntervalValue`,2);return[Wo(t,`+`,`Plus`,(e,t)=>e+t),Wo(t,`-`,`Minus`,(e,t)=>e-t),Wo(t,`*`,`Times`,(e,t)=>e*t),Wo(t,`^`,`Expt`,(t,n)=>{if(n<0)throw new e.O(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(t===0&&n===0)throw new e.O(`0^0 is undefined.`);return t**n}),Wo(t,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new e.O(`The second argument of \\div is 0.`);let r=Math.floor(t/n);if(Mo(r))throw No(`${t} \\div ${n}`);return r}),Wo(t,`%`,`Mod`,(t,n)=>{if(n<=0)throw new e.O(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(t%n+n)%n}),z(`..`,2,e=>{let t=R(e,0,`..`),r=Ho(R(e,1,`..`),n);return{kind:`Interval`,low:Ho(t,n),high:r}})]},Rf=Lf(`Naturals`),zf=Lf(`Integers`),Bf=e=>{let t=Rf.indexOf(e);return t===-1?void 0:zf[t]},Vf=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Vo(Ko(`<`,(e,t)=>e<t),t(`LT`)),Vo(Ko(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Vo(Ko(`<=`,(e,t)=>e<=t),t(`LE`)),Vo(Ko(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Hf=[Oo(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Rf,...Vf(`Naturals`)],Uf=[Oo(`Int`,{kind:`InfiniteSet`,name:`Int`}),...zf,...Vf(`Integers`),z(`-.`,1,e=>{let t=Ho(R(e,0,`-`),If);if(Mo(-t))throw No(`-${t}`);return-t})],Wf=(t,n,r)=>{let i=R(t,n,r),a=di(i);if(!a)throw new e.O(`${r}\n${L(i)}`);return a},Gf=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Wf(e,t,n)},Kf=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw Co(n,`SubSeq`,`natural number`,r);return r},qf=(e,t,n)=>typeof e==`string`?dn(e.slice(t,n)):Pr(e.slice(t,n)),Jf=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Yf=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Xf=(e,t)=>{let n=Sf.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Vo(e,t):e}):t},Zf=t=>Xf(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Gf(e,0,Jf(``,`Len`)).length),z(`\\o`,2,t=>{let n=Gf(t,0,Yf(`s \\o t`,`sequence`));if(typeof n!=`string`){let e=Wf(t,1,Yf(`t \\o s`,`sequence`));return Pr([...n,...e])}let r=R(t,1,`\\o`);if(typeof r!=`string`)throw new e.O(`${Yf(`t \\o s`,`string`)}\n${L(r)}`);return dn(n+r)}),z(`Append`,2,e=>Pr([...Wf(e,0,Yf(t===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(e,1,`Append`)])),z(`Head`,1,t=>{let n=Wf(t,0,Jf(``,`Head`));if(n.length===0)throw new e.O(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,t=>{let n=Gf(t,0,Jf(``,`Tail`));if(n.length===0)throw new e.O(`Attempted to apply Tail to the empty sequence.`);return qf(n,1)}),z(`SubSeq`,3,t=>{let n=Gf(t,0,Jf(`first `,`SubSeq`)),r=Kf(t,1,`second`),i=Kf(t,2,`third`);if(r>i)return qf(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.O(`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 qf(n,r-1,i)}),ko(`SelectSeq`,2,t=>{let n=Do(t,1,`SelectSeq`);return Pr(Wf(t,0,Jf(`first `,`SelectSeq`)).filter(t=>{let r=n.call([t]);if(typeof r!=`boolean`)throw new e.O(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),Qf=t=>Xf(`FiniteSets`,[z(`IsFiniteSet`,1,e=>ci(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!N(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new e.O(`Attempted to compute cardinality of the value\n${L(r)}`);return oi(r,t)})]),$f=[Vo(z(`Warshall`,1,t=>{let n=R(t,0,`Warshall`);if(!N(n)||mn(n))throw new e.O(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${L(n)}`);oi(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=ea(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(t=>{let n=di(t);if(n?.length!==2)throw new e.O(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${L(t)}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return vr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Pr([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],ep=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return $f;if(e===`AnySet`)return[Oo(`ANY`,vn)];if(e===`IOUtils`)return pd(r,a);if(e===`_TLCTrace`)return gd(r);if(!Ef(n.version).has(e))return;let o=rp(e,t,n,r,i);return e===`Randomization`&&o?[...o,Vd(n)]:o},tp=/* @__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`]]]),np=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),rp=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Hf;case`Integers`:return Uf;case`Sequences`:return Zf(n.version);case`FiniteSets`:return Qf(n.version);case`TLC`:return Xf(`TLC`,hf(t,n));case`Randomization`:return Hd(n);case`_Possible`:return nf(t,n);case`Json`:return fd(r);case`Bags`:return Xf(`Bags`,Lu(i));case`TLCExt`:return Xf(`TLCExt`,tf(t,n));default:return}},ip=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Fc.get(t)||[];r.expressions.push(...i,t);let a=pi.sets,o=a??[],s=o.length;pi.sets=o;try{return n()}catch(e){throw Mg(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,pi.sets=a}},ap=(e,t,n)=>e.coverage?to(e.coverage,t,n):-1,op=(e,t,n)=>e.coverage?ro(e.coverage,t,n):n(),sp=(e,t,n,r)=>op(e,t,()=>W(n,r)),cp=(e,t,n,r)=>{let i=sp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},lp=(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},up=e=>!e.includes(void 0),dp=e=>e.variables.map(()=>void 0),fp=(e,t,n)=>{let r=[...e];return r[t]=n,r},pp=(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}},mp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,hp=e=>e.kind===`Identifier`?e.name:void 0,gp=(e,t,n)=>{if(t.kind===`Label`)return gp(e,t.body,n);let r=hp(t);if(r===void 0)return;let i=gh(n,r);if(i?.kind===`Thunk`)return gp(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=og(r,e);return o?.kind===`Closure`&&o.params.length===0?gp(e,o.body,o.scope):void 0},_p=(e,t,n)=>{if(t.kind===`Prime`)return gp(e,t.expression,n);if(t.kind===`Label`)return _p(e,t.body,n);let r=hp(t);if(r===void 0)return;let i=gh(n,r);if(i?.kind===`Thunk`)return _p(e,i.expression,i.scope);if(i)return;let a=og(r,e);return a?.kind===`Closure`&&a.params.length===0?_p(e,a.body,a.scope):void 0},vp=t=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean expression.`);return t},yp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),bp=(e,t,n,r)=>{let i=Sp(e,t,n,r);return i&&e.coverage&&!e.isInit&&no(e.coverage,r),i},xp=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(no(r,n),no(r,r.roots[n])),e.onState(t),!0},Sp=(e,t,n,r)=>t===void 0?up(n)?xp(e,n,r):(e.onIncomplete?.(n),!1):up(n)&&yp(e)?wp(e,t,n,r):t.kind===`Predicate`?Tp(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?Vp(e,t.expression,t.rest,t.scope,n,t.node):Cp(e,t,n)&&bp(e,t.rest,n,t.node),Cp=(e,t,n)=>{let r=e.environment,i=sp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return sp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?hh(t,r.runtime.version):t}})();try{return!mr(i,a)}catch(t){throw e.callStack&&Mg(e.callStack,[i],t),t}},wp=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return Vp(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?Cp(e,i,n):vp(sp(e,i.node,i.expression,lp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return xp(e,n,r)},Tp=(e,t,n,r,i,a)=>Ep(e,t,n,r,i,ap(e,a,t)),Ep=(t,n,r,i,a,o)=>ip(t,n,()=>{switch(n.kind){case`Let`:{let e=lp(t,i,a),s=n.definitions,c=t.coverage?Cg(s,e,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):Cg(s,e);return Tp(t,n.body,r,c,a,o)}case`Label`:return Tp(t,n.body,r,i,a,o);default:if(Fp.has(n.kind))throw new e.b(`The state relation is not a boolean expression.`);return ip(t,n,()=>zp(t,n,r,i,a,o))}}),Dp=(e,t,n,r,i)=>vp(t)&&bp(e,n,r,i),Op=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),kp=(e,t,n,r,i,a)=>{let o=lp(e,r,i);if(t.kind===`Identifier`){let s=gh(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return Tp(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return Tp(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:og(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&hu(c,e.environment))?Tp(e,l.body,n,l.scope,i,a):Dp(e,cp(e,a,t,o),n,i,a)}let s=sg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=op(e,a,()=>yg(s,t.args,o));return Tp(e,s.body,n,r,i,a)}let c=Op.has(t.operator)?sp(e,a,t,o):cp(e,a,t,o);return Dp(e,c,n,i,a)},Ap=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?bp(e,t,fp(n,r,i),a):mr(o,i)&&bp(e,t,n,a)},jp=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Mp=(e,t,n)=>(e.coverage&&io(e.coverage,t,n.length+1),n),Np=(t,n,r,i,a,o)=>{let[s,c]=n.args,l=t.isInit?gp(t.environment,s,i):_p(t.environment,s,i),u=lp(t,i,a);if(l===void 0)return sp(t,o,n,u)===!0&&bp(t,r,a,o);let d=sp(t,o,c,u),f=a[l];if(n.operator===`=`)return Ap(t,r,a,l,d,o);let p=n.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(typeof p==`object`&&p!==d&&t.callStack?.sources.set(p,c),f!==void 0)return sp(t,o,n,u)===!0&&bp(t,r,a,o);if(!Lr(p))throw new e.b(`The right side of \\IN is not enumerable.`);return Mp(t,p,Qr(p)).reduce((e,n)=>bp(t,r,fp(a,l,n),o)||e,!1)},Pp=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Fp=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Ip={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Lp=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Ip[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${H(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${H(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${H(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(e)}`},Rp=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=op(e,r,()=>Ih(t.bounds,t=>{let r=W(t,n),i=Nh(r,t,a);return Array.isArray(i)&&Mp(e,r,i),i}));return Rh(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},zp=(t,n,r,i,a,o)=>{let s=lp(t,i,a);switch(n.kind){case`Identifier`:return kp(t,n,r,i,a,o);case`Apply`:return Pp.has(n.operator)&&n.args.length===2?Np(t,n,r,i,a,o):n.operator===`=>`&&n.args.length===2?vp(sp(t,o,n.args[0],s))?Tp(t,n.args[1],r,i,a,o):bp(t,r,a,o):kp(t,n,r,i,a,o);case`And`:{let e=n.operands;if(n.isBulleted||e.length===2){let n=e.slice(1).reduceRight((e,t)=>jp(`Predicate`,t,i,o,e),r);return Tp(t,e[0],n,i,a,o)}let s=e[e.length-1];return Ep(t,pp(n,e.length-1),jp(`Predicate`,s,i,o,r),i,a,mp(t,o))}case`Or`:{let e=n.operands;if(n.isBulleted||e.length===2)return e.reduce((e,n)=>Tp(t,n,r,i,a,o)||e,!1);let s=Ep(t,pp(n,e.length-1),r,i,a,mp(t,o)),c=Tp(t,e[e.length-1],r,i,a,o);return s||c}case`Exists`:return Rp(t,n,s,o).reduce((e,i)=>Tp(t,n.body,r,i,a,o)||e,!1);case`Forall`:{let e=Rp(t,n,s,o);if(e.length===0)return bp(t,r,a,o);let i=e.slice(1).reduce((e,t)=>jp(`Predicate`,n.body,t,o,e),r);return Tp(t,n.body,i,e[0],a,o)}case`If`:return Tp(t,vp(sp(t,o,n.condition,s))?n.consequent:n.alternative,r,i,a,o);case`Case`:{let c=n.arms.find(e=>vp(sp(t,o,e.condition,s)))?.body??n.other;if(c===void 0)throw new e.b(`TLC encountered a CASE with no conditions true.`);return Tp(t,c,r,i,a,o)}case`FunctionApplication`:{let e=Wh(sp(t,o,n.function,t.isInit?s:bh(s)));if(e){let i=op(t,o,()=>Gh(e,n,s));return Tp(t,e.body,r,i,a,o)}break}case`Unchanged`:if(!t.isInit)return Vp(t,n.expression,r,i,a,o);break;case`BoxAction`:if(!t.isInit){let e=Tp(t,n.action,r,i,a,o);return Vp(t,n.subscript,r,i,a,o)||e}break;case`AngleAction`:if(!t.isInit)return Tp(t,n.action,jp(`Changed`,n.subscript,i,o,r),i,a,o)}let c=t.isEnabled?Lp(n):void 0;if(c!==void 0)throw new e.b(c);return Dp(t,sp(t,o,n,s),r,a,o)},Bp=(e,t,n)=>e.runtime.warn(qe.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${H(n)}`),Vp=(e,t,n,r,i,a)=>ip(e,t,()=>{let o=ap(e,a,t),s=gp(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!mr(a,r)?(Bp(e.environment,s,t),!1):Ap(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return bp(e,n,i,o);let c=s.reduceRight((e,t)=>jp(`Unchanged`,t,r,o,e),n);return Vp(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=gh(r,t.name);if(a?.kind===`Thunk`)return Vp(e,a.expression,n,a.scope,i,o);let s=a?void 0:og(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return Vp(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=lp(e,r,i),s=sg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return Vp(e,s.body,n,yg(s,t.args,a),i,o)}let c=e.environment,l=sp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=sp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return mr(l,u)&&bp(e,n,i,o)}),Hp=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),Up=/* @__PURE__ */ Error(`The replay found a successor`),Wp=(e,t,n,r)=>{let i=Hp(r,`enabled`,n,()=>{throw Up}),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=jp(`Changed`,e.subscript,t,-1,void 0);Tp(i,e.action,n,t,dp(r),-1)}else Tp(i,e,void 0,t,dp(r),-1);return!1}catch(e){if(e!==Up)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Gp=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Hp(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>jp(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);Tp(o,i.expression,s,i.scope,dp(t),i.node??-1)},Kp=(e,t,n,r)=>{e.some(e=>Fp.has(e.expression.kind))||e.forEach(e=>{let i=[];qp(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},qp=(e,t,n,r,i,a)=>{let o=Hp(r,`next`,n,i,a);Tp(o,e.expression,void 0,e.scope,dp(r),t)},Jp=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(gp(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=gh(r,e.name)?void 0:og(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,Cg(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){_p(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=gh(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?sg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:og(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,yg(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Yp=/* @__PURE__ */ new WeakMap,Xp=/* @__PURE__ */ new WeakMap,Zp=(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},Qp=(e,t,n)=>{let r=e.slice();return r[t]=n,r},$p=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,em=(t,n)=>{let r=new e.b(n);return t.isInit?r:e.it(r,e.tt.error)},tm=(e,t,n,r)=>{let i=ah(n);return r&&Fp.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 ${$p(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},nm=(e,t,n)=>{let r=zo(t),i=H(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 ${$p(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1781
+ `:``}${i}`},rm=(e,t,n)=>om(e,t,W(t,n)),im=new Set(Ff.map(e=>e.name)),am=e=>e.kind===`Apply`?im.has(e.operator):e.kind!==`Identifier`&&!Fp.has(e.kind),om=(t,n,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=tm(t,r,n,i);throw t.isInit&&i&&am(n)?new e.R(a):em(t,a)},sm=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=Lg(n,r.environment))(r),cm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,lm=(e,t,n)=>{let r=n?Yp:Xp,i=r.get(e);if(i)return i;let a=Um(e,t,n),o=n?void 0:Hm(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},um=(e,t)=>{if(t.constants.has(e))return;let n=Dh(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},dm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return dm(e.expression,t,!1,r);if(e.kind!==`Identifier`||j(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=um(e.name,t);if(a&&!r.has(a))return r.add(a),dm(a.body,t,n,r)},fm=(e,t,n)=>dm(e,t,!n),pm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return pm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Cg(e.definitions,Zp(r,t,n));return pm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=gh(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return pm(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=um(e.name,r.environment);if(s)return pm(s.body,void 0,n,r,i)},mm=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||j(e))||!t&&e.kind===`Prime`,hm=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>hm(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=um(e.name,t);if(i)return n.add(e.name),hm(i.body,t,n)},gm=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),_m=(e,t,n)=>gm.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||cm(e.operator)&&(mm(e.args[0],n)||fm(e.args[0],t,n)!==void 0)||j(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,vm=/* @__PURE__ */ new Set,ym=(e,t)=>{if(j(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Wc(e,(e,i)=>{let a=r?ym(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},bm=(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||j(e)?void 0:Dh(r,t);return i&&!n.has(i)&&(n.add(i),bm(i.body,t,n))?!0:A(e).some(e=>bm(e,t,n))},xm=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=fm(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=hm(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return _m(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:lm(e,t,n)}},Sm=(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(bu(e,t)===void 0||bm(e,t,/* @__PURE__ */ new Set))return!0;let n=ym(e,vm);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)}},Cm=(e,t,n)=>{let r=e.map(e=>xm(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=yp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Gm(u)){d??=Zp(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!mr(t,i[e.index])}):void 0;if(o){Bp(t.environment,o.index,o.expression);return}let s=n.expression,c=sm(a,e,s,d);if(!om(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Zp(t,n,u);let r=sm(i,s,e.expression,d);if(!om(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Zp(t,n,u);let r=sm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Qp(u,e.index,r),d=void 0;else if(!mr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!mr(e,n[i.index])){Bp(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},wm=e=>{let t=Lp(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw em(n,t);rm(n,e,Zp(n,r,i))&&s(i,a)}},Tm=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Zp(r,i,a);if(a[l]!==void 0){rm(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Lr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${$p(r)}, the right side of \\IN is not enumerable.`;throw em(r,`${t}\n${H(e)}`)}let p=Qr(f);if(r.generator){for(let e of Nd(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Qp(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Qp(a,l,p[e]),o)}},Em=/* @__PURE__ */ new WeakMap,Dm=e=>{let t=Em.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Dm),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Em.set(e,n),n},Om=(e,t)=>{let n=e.args[0],r=wm(e),i=(e,r,i)=>pm(n,r,i,e,!t)??-1,a=Tm(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],Zp(t,n,o));l(Qp(o,u,d),s)}},km=(e,t,n)=>{let r=H(e);return(i,a,o,s,c,l)=>{let u=Zp(i,a,o),d=W(e.function,n?u:bh(u)),f=Wh(d);if(f!==void 0){lm(f.body,t,n)(i,Gh(f,e,u),o,s,c,l);return}if(!Pt(d))throw em(i,`In computing ${$p(i)}, a non-function (${zo(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw em(i,`In computing ${$p(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Am=(e,t)=>{let n=Dm(e);return hm(e,t)?Cm([n],t,!1):e.kind===`Tuple`?lm(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?gh(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){lm(Dm(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Zp(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=sg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){lm(Dm(n.body),t,!1)(r,yg(n,e.args,u),a,o,s,c);return}}rm(r,n,u)&&c(a,o)}},jm=(e,t,n)=>{let r=e.operator,i=wm(e),a=j(e)?void 0:og(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Hg(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=lm(a.body,t,n),o(e,i(Zp(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Zp(a,o,s),f=sg(e,d);f?.kind===`Closure`?lm(f.body,t,n)(a,yg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Mm=(e,t,n)=>{let r=wm(e),i=j(e)?void 0:um(e.name,t),a;return(o,s,c,l,u,d)=>{let f=gh(s,e.name);f?.kind===`Thunk`&&!f.isReleased?lm(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&tg(i,t)!==void 0?r(o,s,c,l,u,d):(a??=lm(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},Nm=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||j(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!j(i))return;let a=dm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Pm=e=>e.kind===`And`?e.operands.flatMap(Pm):[e],Fm=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&_m(e,t,!1),Im=e=>{let t=[];return(n,r,i)=>{let a=Zp(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!om(n,i,sm(t,r,i,a)))return}}},Lm=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Pm(e),r=n.findIndex(e=>!Fm(e,t)||Nm(e,t)),i=r===-1?void 0:Nm(n[r],t);return i?{...i,before:r===0?void 0:Im(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Lm(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||j(e))return;let r=og(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Lm(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`||!j(o))return;let s=i.before,c=s&&Hg(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Zp(e,t,n)),n))}},Rm=(e,t,n)=>{let r=gh(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},zm=(e,t,n)=>{let r=e.map(e=>lm(e,t,n)),i=n?[]:e.map(e=>Lm(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Rm(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Bm=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=Cd(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},Vm=(e,t)=>{let n=lm(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Zp(r,i,a),u=t.runtime.version,d=Ih(e.bounds,e=>W(e,l)).map((n,r)=>Nd(jh(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,vh(i,l,e)))};f(d.length-1,i)}},Hm=(e,t)=>{if(e.kind===`Exists`)return Vm(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>lm(e,t,!1));return e.isBulleted?Bm(n):n.reduce((e,t)=>Bm([e,t]))},Um=(t,n,r)=>{let i=e=>lm(e,n,r);switch(t.kind){case`And`:return Cm(t.operands,n,r);case`Or`:return zm(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=jh(W(a.set,Zp(r,i,o)),a.set,n.runtime.version);for(let n=0;n<u.length&&!r.isStopped;n++)e(r,_h(i,t,u[n]),o,s,c,l)}}let o=r?void 0:Sm(t,n);if(o){let e=Cm(o.rest,n,r);return(r,i,a,s,c,l)=>{let u=Zp(r,i,a),d=Ih(t.bounds,e=>jh(W(e,u),e,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=_h(n,o.names[t],e);if(t===d.length-1){let e=Zp(r,i,a);if(!o.guards.every(t=>rm(r,t,e)))continue}f(t-1,i)}};f(d.length-1,i)}}return(n,r,i,a,o,s)=>{zh(t.bounds,Zp(n,r,i),t=>(e(n,t,i,a,o,s),n.isStopped))}}case`Forall`:{let e=i(t.body),a=!r&&bu(t,n)!==void 0&&!bm(t.body,n,/* @__PURE__ */ new Set)?ym(t,vm):void 0;return(n,r,i,o,s,c)=>{let l=[];zh(t.bounds,Zp(n,r,i),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>gh(r,e)?.kind===`Value`)){u.every(e=>rm(n,t.body,Zp(n,e,i)))&&c(i,o);return}let d=(r,i,a)=>{r===u.length?c(i,a):r>0&&n.isInit&&Gm(i)?u.slice(r).every(e=>rm(n,t.body,Zp(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=W(t.condition,Zp(r,i,a));if(typeof l!=`boolean`)throw em(r,nm(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=Zp(r,i,a),u=e.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw em(r,`In computing ${$p(r)}, a non-boolean expression${r.isEnabled?``:` `}(${zo(t)}) was used as a guard condition of a CASE.\n${ah(e.source)}`)})?.body??n;if(!u)throw em(r,`In computing ${$p(r)}, TLC encountered a CASE with no conditions true.\n${H(t)}`);u(r,i,a,o,s,c)}}case`Let`:{let e=i(t.body),r=Tg(t.definitions,n);return(n,i,a,o,s,c)=>e(n,Cg(t.definitions,Zp(n,i,a),r),a,o,s,c)}case`Unchanged`:return r?()=>{throw new e.b(`UNCHANGED appears in an initial predicate at ${nh(t)}`)}:Am(t.expression,n);case`AngleAction`:{let e=i(t.action),r={kind:`Unchanged`,expression:t.subscript,location:t.subscript.location},a=(e,t,i)=>{try{return rm(e,r,Zp(e,t,i))}catch(t){throw e.isEnabled?hh(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 zm([t.action,Dm(t.subscript)],n,r);case`Label`:return i(t.body);case`Identifier`:return Mm(t,n,r);case`FunctionApplication`:return km(t,n,r);case`Apply`:{let e=t.args;if(cm(t.operator)){let i=fm(e[0],n,r);if(i!==void 0)return t.operator===`=`?Cm([t],n,r):Tm(t,()=>i);if(mm(e[0],r))return Om(t,r)}if(t.operator===`=>`){let n=i(e[1]);return(r,i,a,o,s,c)=>{let l=W(e[0],Zp(r,i,a));if(typeof l!=`boolean`){let e=zo(l),n=H(t);throw em(r,r.isInit?`In computing initial states of a predicate of form P => Q, P was ${e}\n.${n}`:r.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${e}.\n${n}`:`In computing next states of a predicate of the form P => Q, P was\n${e}.\n${n}`)}l?n(r,i,a,o,s,c):c(a,o)}}return jm(t,n,r)}default:return wm(t)}},Wm=e=>e.variables.map(()=>void 0),Gm=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Km=(t,n)=>{let r=n.state;if(!r||!Gm(r))throw new e.b(`ENABLED needs a complete state at ${nh(t)}`);let i=n.environment;if(i.callStack)return Wp(t,n.scope,r,i);let a={environment:i,isInit:!1,isEnabled:!0,current:r,isStopped:!1,generator:void 0,successors:0};return lm(t,i,!1)(a,n.scope,Wm(i),void 0,!1,()=>{a.isStopped=!0}),a.isStopped},qm=(t,n,r,i,a)=>{let o={environment:n,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};lm(t,n,!0)(o,i,Wm(n),void 0,!1,t=>{if(!o.isStopped){if(!Gm(t)){if(a){o.isStopped=a([...t]);return}throw e.it(new e.S([...t]),e.tt.error)}o.isStopped=r(t)}})},Jm=(e,t,n)=>{let r=[];return qm(e,t,e=>(r.push(e),!1),n),r},Ym=(t,n,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:n,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return lm(t,r,!1)(c,a,Wm(r),void 0,!1,(t,n)=>{if(!c.isStopped){if(!Gm(t)){let i=r.variables.filter((e,n)=>t[n]===void 0);throw new e.C(`Successor state is not completely specified by action ${n??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,t,n,i)}c.successors++,c.isStopped=i({state:t,action:n})}}),c.successors},Xm=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return lm(e,n,!1)(i,r,Wm(n),void 0,!1,e=>{Gm(e)||(i.isStopped=!0)}),i.isStopped},Zm=(e,t,n,r)=>{let i=[];return Ym(e,t,n,e=>(i.push(e),!1),r),i},Qm=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),$m=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),eh=e=>$m.has(e.kind)||e.kind===`Apply`&&Qm.has(e.operator),th=(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&&Nt(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},nh=e=>`line ${e.location.line}, column ${e.location.column}`,H=t=>{let n=t.location.range;return n?e.Y(n):nh(t)},rh={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},ih=(t,n)=>new e.b(`TLC encountered a temporal formula (${t}) when evaluating a predicate or action.\n${H(n)}`),ah=e=>e.kind===`Number`?e.text??String(e.value):H(e),oh=(t,n)=>new e.b(`A non-boolean expression (${zo(n)}) was used as the condition of an IF.\n${H(t)}`),sh=(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.b(`A non-boolean expression (${zo(r)}) was used as a formula in a ${t.kind===`And`?`conjunction`:`disjunction`}.\n${ah(t.operands[n])}`);let a=t.prefixEnds?.[Math.max(n,1)-1]??i.end;return new e.b(`Attempted to evaluate an expression of form P ${t.kind===`And`?`/\\`:`\\/`} Q when ${n===0?`P`:`Q`} was\n${zo(r)}.\n${H({...t,location:{...t.location,range:{...i,end:a}}})}`)},ch=t=>{let n=t.field,r=e=>`Attempted to select nonexistent field "${n}" from the record\n${M(L(e))}\n${H(t)}`,i=e=>`Attempted to apply function:\n${M(L(e))}\nto argument "${n}", which is not in the domain of the function.`;return a=>{if(!Pt(a))throw new e.b(`Attempted to select field "${n}" from a non-record value ${M(L(a))}\n${H(t)}`);let o=jn(a);if(o===`tuple`)throw Di(n);return Ni(a.kind===`LazyFunction`?I(a):a,n,o===`record`?r:i)}},lh=e=>e===`1.7.4`?(t,n)=>wi(t,n,e):void 0,uh=t=>n=>{if(!Pt(n))throw new e.b(`Attempted to apply the operator DOMAIN to a non-function\n(${zo(n)})\n${H(t)}`);return Fi(n)},dh=(t,n)=>(r,i)=>{if(!N(r)||mn(r))throw new e.b(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${H(t)}`);return n.evaluateBinary?n.evaluateBinary(r,i):n.evaluate([r,i])},fh=t=>e.it(new e.b(`TLC can't handle real numbers.\n${t.text}`),e.tt.configParseError),ph=t=>e.it(new e.b(`TLC can't handle a number this big.\n${t.text??t.value}`),e.tt.error),mh=(t,n)=>new e.L(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${H(n)}`,t),hh=(t,n)=>t instanceof e.L&&n!==`1.7.4`?new e.b(`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,gh=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},_h=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),vh=(t,n,r)=>{if(n.kind===`Name`)return _h(t,n.name,r);let i=di(r);if(!i||i.length!==n.names.length){let t=n.ranges?.[0];throw new e.b(`Argument mismatch in operator application.${t?e.Y(t):``}`)}return n.names.reduce((e,t,n)=>_h(e,t,i[n]),t)},yh=(t,n)=>{if(Pt(t))return t;throw new e.b(`A non-function (${zo(t)}) was applied as a function.\n${H(n)}`)},bh=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},xh=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Sh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Expected ${n} to be a boolean but found ${L(t)}`);return t},Ch=(t,n,r)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P => Q when ${r} was\n${zo(t)}.\n${H(n)}`);return t},wh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to apply the operator ~ to a non-boolean\n(${zo(t)})\n${H(n)}`);return!t},Th=(t,n,r)=>{if(typeof t!=`boolean`||typeof n!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${H(r)}`);return t===n},Eh=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${ah(n)}`);return t},Dh=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Oh=(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.`},kh=(t,n,r)=>{if(!N(t)||mn(t)){let i=L(t),a=r===`1.7.4`?void 0:Oh(t,i);throw new e.b(a===void 0?`TLC encountered a non-enumerable quantifier bound\n${i}.\n${ah(n)}`:`TLC encountered the non-enumerable quantifier bound\n${i}\n${ah(n)}\n${a}`)}},Ah=(e,t,n)=>(kh(e,t,n),typeof e==`object`&&e.kind===`Interval`?Ar(e):Wr(e)??Xr(e)),jh=(e,t,n)=>n===`1.7.4`?(kh(e,t,n),Wr(e)??Qr(e)):Ah(e,t,n),Mh=e=>{if(typeof e==`object`&&e.kind===`Interval`)return oi(e),e},Nh=(e,t,n)=>Mh(e)??jh(e,t,n),Ph=(e,t,n)=>Mh(e)??Ah(e,t,n),Fh=(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},Ih=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),Lh=(e,t)=>Ih(e,e=>Nh(W(e,t),e,t.environment.runtime.version)),Rh=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Fh(t[n],t=>i(n-1,vh(a,e[n].pattern,t)));return i(e.length-1,n)},zh=(e,t,n)=>Rh(e,Lh(e,t),t.scope,n),Bh=(e,t)=>{let n=Ih(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Vh=(e,t,n)=>{if(e.length===1)return vh(t,e[0].pattern,n);let r=di(n)??[];return e.reduce((e,t,n)=>vh(e,t.pattern,r[n]),t)},Hh=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Uh=e=>Object.assign(e.value,{lambda:e}),Wh=e=>Hh(e)?e.lambda:void 0,Gh=(t,n,r)=>{let i=t.value,a=n.args.map(e=>W(e,r)),o=a.length===1?a[0]:Pr(a),s=(e,t,r)=>`In applying the function\n${M(L(i))},\nthe ${e} is:\n${M(L(t))}${r}.\n${H(n.function)}`,c=t.bounds;if(c.length===1){if(!gi(o,i.domain))throw new e.b(s(`first argument`,o,`which is not in its domain`));return Vh(c,t.scope,o)}let l=di(o),u=typeof i.domain==`object`&&i.domain.kind===`ProductSet`?i.domain.factors:[],d=()=>new e.b(`In applying the function\n${M(L(i))},\nthe argument list is:\n${M(L(o))}\nwhich does not match its formal parameter.\n`);if(l===void 0||(c.forEach((t,n)=>{if(n>=l.length)throw d();let r=l[n],i=`argument number ${n+1}`;if(!gi(r,u[n]))throw new e.b(s(i,r,`${t.pattern.kind===`Name`?``:`
1782
+ `}which is not in its domain`));if(t.pattern.kind===`Tuple`&&di(r)?.length!==t.pattern.names.length)throw new e.b(s(i,r,`which does not match its formal parameter`))}),l.length>c.length))throw d();return Vh(c,t.scope,o)},Kh=(t,n)=>{let r=n.location.range;if(r)return{parameters:t.flatMap((e,n)=>n>0&&t[n-1].set===e.set?[]:[{index:n,name:e.pattern.kind===`Name`?e.pattern.name:`<<${e.pattern.names.join(`, `)}>>`}]),body:e.Y(r)}},qh=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Jh=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Yh=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Xh=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Zh=(e,t)=>{let n=Bh(e.bounds,t),r=Jh(n,(n,r)=>W(e.body,xh(t,Vh(e.bounds,_h(void 0,e.name,r),n))),qh(Kh(e.bounds,e.body),e.bounds,n),Yh(e.bounds));Uh({value:r,bounds:e.bounds,body:e.body,scope:_h(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Zh(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?Mn(i):i},Qh=(t,n)=>{if(typeof n!=`object`||jn(n)!==`lambda`||t.kind===`Operator`||t.isSelfReferential||n.kind!==`LazyFunction`||!Nt(n.domain))return n;try{let e=I(n);return On(e.domain,e.range)}catch(t){if(t instanceof e.b)return n;throw t}},$h=(t,n)=>t.kind===`Operator`&&t.params.length>0?()=>{throw new e.b(`Operator ${t.name} requires ${t.params.length} arguments`)}:t.kind===`Function`?t.isSelfReferential?e=>Zh(t,e):Lg(Xh(t),n):Lg(t.body,n),eg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=$h(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(xh(e,void 0)):e=>a[i]??r(xh(e,void 0));return t.definitionEvaluators.set(e,o),o},tg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},ng=(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)||!hu(t,n))return;let i=n.facts.ids.get(t);if(i===void 0||n.startupValues[i]!==void 0)return;let a={environment:n,scope:void 0,state:void 0,next:void 0};try{let e=n.runtime.evaluateAtStartup(()=>Qh(t,$h(t,n)(a)));fr(e),n.startupValues[i]=e}catch(t){if(!(t instanceof e.b)&&!e.et(t))throw t}}),rg=(t,n)=>{if(n===void 0||t===n)return!0;try{return n.every((e,n)=>e===void 0||t?.[n]!==void 0&&zn(t[n],e))}catch(t){if(t instanceof e.b)return!1;throw t}},ig=(e,t)=>{let n=e.cache;if(n!==void 0&&rg(t.state,e.state)&&rg(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?ro(r,i,()=>W(e.expression,xh(t,e.scope))):W(e.expression,xh(t,e.scope));return(!e.isStreamed||ei(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},ag=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),og=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return og(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?ag(r):t.builtins.get(e)},sg=(e,t)=>j(e)?cg(e.operator,t):og(e.operator,t.environment)??cg(e.operator,t),cg=(e,t)=>{let n=gh(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return og(e,t.environment)},lg=e=>e.kind===`Closure`?e.params.length:e.arity,ug=(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:cg(r,n);if(!i)throw new e.b(`Expected an operator argument at ${nh(t)}`);return i},dg=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>_h(e,n.name,t[r]),e.scope);return W(e.body,xh(n,r))},fg=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:lg(e),call:n=>dg(e,n,t)},pg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=cg(e.name,t);return n!==void 0&&lg(n)>0},mg=(e,t)=>e.map(e=>pg(e,t)?fg(ug(e,t),t):W(e,t)),hg=(t,n)=>new e.b(`Operator ${t.name} expects ${t.params.length} arguments but received ${n}`),gg=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),_g=(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 _g(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([])}},vg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Rt(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=gg(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=j(e)?void 0:_g(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=gh(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:gg(e,t)}}return t=>gg(e,t)},yg=(e,t,n,r)=>{if(t.length!==e.params.length)throw hg(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:ug(t[a],n)}:(r?.[a]??vg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},bg=(e,t,n,r)=>e.kind===`Closure`?W(e.body,xh(n,yg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(Bg(t,n),n):e.evaluate(mg(t,n),n),xg=/* @__PURE__ */ new WeakMap,Sg=e=>{let t=xg.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return xg.set(e,n),n},Cg=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:Sg(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},wg=(t,n,r)=>{let i=gh(r.scope,t);if(i?.kind===`Value`)return i.value;if(i?.kind===`Thunk`)return ig(i,r);if(i?.kind===`Operator`){if(lg(i.operator)===0)return dg(i.operator,[],r);throw new e.b(`Operator ${t} is used without arguments`)}let a=_g(t,r.environment);if(a?.kind===`Variable`){let e=r.state?.[a.index];if(e===void 0)throw mh(t,n);return e}if(a?.kind===`Value`)return a.value;if(a?.kind===`Definition`)return eg(a.definition,r.environment)(r);let o=r.environment.builtins.get(t);if(o?.arity===0)return o.evaluate([],r);throw new e.b(`Unknown identifier ${t} at ${nh(n)}`)},Tg=(e,t)=>({impure:new Set(e.filter(e=>_u(e,t))),streamed:new Set(e.filter(e=>_u(e,t,`streamed`)))}),Eg=e=>[...e.facts.ids.keys()].some(t=>_u(t,e)),Dg=e=>[...e.facts.ids.keys()].some(t=>_u(t,e,`repeated`)),Og=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,kg=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),Ag=e=>t=>{let n=e(t);return zn(n,e(kg(t)))},jg=(t,n,r,i)=>a=>{i.expressions.push(t);let o=pi.sets,s=pi.callStack,c=o??[],l=c.length;pi.sets=c,pi.callStack=i;try{let e=n(a),o=Og(e)?e.rebind(r):e;return i.values.set(t,o),typeof o==`object`&&o.kind!==`FilteredSet`&&eh(t)&&i.sources.set(o,t),o}catch(n){n instanceof e.M&&!i.isFrozen&&(i.expressions.length=0,i.isFrozen=!0);let r=n instanceof Error?i.failures.get(n):void 0;n instanceof Error&&i.failures.set(n,t);let a=th(t,i.values),o=a&&!A(t).some(e=>e===r)?i.values.get(a):void 0,s=t.kind===`FunctionApplication`&&o!==void 0&&!Pt(o)?void 0:o;throw Mg(i,[s,...c.slice(l).filter(e=>e!==s)],n),n}finally{i.isFrozen||i.expressions.pop(),c.length=l,pi.sets=o,pi.callStack=s}},Mg=(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.b){t.isFrozen||t.expressions.push(...i);let e=t.fingerprint;t.fingerprint={sources:[...i,...e?.sources??[]],reason:e?.reason??r.message}}t.isFrozen=!0},Ng=(t,n,r)=>{if(!(r instanceof e.b))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}},Pg=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Fg=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},Ig=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=to(n,i,e);no(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},U=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=u_(e,t),i=t.callStack,a=i&&Fc.get(e),o=i?jg(e,r,t,i):r,s=i&&a?Fg(e,a,o,i):o,c=t.coverage,l=c?Ig(e,s,c):s;return t.evaluators.set(e,l),l},Lg=(e,t)=>{if(t.callStack||t.coverage)return U(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=hs(e,t)??U(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>Lg(e,t.environment)(t),Rg=(e,t)=>{let n=e.name,r=j(e)?void 0:_g(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw mh(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=eg(e,t))(r)}return t=>wg(n,e,t)},zg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||j(e))return!0;let n=og(e.name,t);return n===void 0||lg(n)===0},Bg=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),Vg=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Bg(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&zg(t[0],n)){let e=U(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&zg(t[0],n)&&zg(t[1],n);if(i&&a){let e=U(t[0],n),r=U(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(mg(t,n),n)},Hg=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw hg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:vg(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:ug(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},Ug=(e,t,n)=>{let r=Hg(e,t,n),i;return t=>(i??=Lg(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Wg=(t,n)=>{let r=t.args;if(t.operator===`=>`){let e=U(r[0],n),i=U(r[1],n);return n=>!Ch(e(n),t,`P`)||Ch(i(n),t,`Q`)}if(t.operator===`~`&&r.length===1){let e=U(r[0],n);return n=>wh(e(n),t)}if(t.operator===`<=>`){let e=U(r[0],n),i=U(r[1],n);return n=>Th(e(n),i(n),t)}if(t.operator===`~>`||t.operator===`-+->`)return()=>{throw ih(t.operator===`~>`?`a ~> b`:`a -+-> formula`,t)};let i=j(t)?void 0:og(t.operator,n);if(i?.kind===`Closure`)return Ug(i,r,n);if(i?.kind===`Builtin`&&i.name===`DOMAIN`){let e=U(r[0],n),i=uh(t);return t=>i(e(t))}if(i?.kind===`Builtin`&&i.name===`TLCEval`&&r.length===1){let e=!Pc.has(t)&&!xu(r[0],n);return t=>i.evaluate(Bg(r,t),e&&t.scope===void 0?void 0:t)}if(i?.kind===`Builtin`&&i.name===`\\subseteq`&&r.length===2){let e=U(r[0],n),a=U(r[1],n),o=dh(t,i);return t=>o(e(t),a(t))}if(i?.kind===`Builtin`)return Vg(i,r,n);if(t.operator===`\\cdot`&&r.length===2)return()=>{throw new e.b(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=r.map(e=>vg(e,n));return i=>{let o=cg(t.operator,i);if(o)return bg(o,r,i,a);throw n.definitions.get(t.operator)?.kind===`Function`?new e.b(`${t.operator} is a function; apply it with brackets`):new e.b(`Unknown operator ${t.operator} at ${nh(t)}`)}},Gg=(e,t)=>{let n=e.kind===`Forall`,r=U(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=U(i.set,t);return s=>Fh(Nh(o(s),i.set,t.runtime.version),t=>Eh(r(xh(s,_h(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=Ih(a,e=>Nh(U(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?Eh(r(xh(o,a)),e)!==n:Fh(s[t],e=>c(t-1,_h(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>zh(a,t,i=>Eh(r(xh(t,i)),e)!==n)?!n:n},Kg=(e,t)=>{if(e.kind===`Tuple`)return Pr(e.names.map(e=>{let n=gh(t,e);return n?.kind===`Value`&&n.value}));let n=gh(t,e.name);return n?.kind===`Value`?n.value:void 0},qg=/* @__PURE__ */ new WeakSet,Jg=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&qg.add(e)},Yg=/* @__PURE__ */ new WeakMap,Xg=e=>{if(Yg.has(e))return Yg.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=Be(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),A(e).every(n)},r=n(e)?[...t]:void 0;return Yg.set(e,r),r},Zg=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=gh(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Qg=e=>qg.has(e),$g=(t,n)=>{let r=Qg(t),i=U(t.body,n),a=t.bounds,o=a[0],s=a.length===1&&o.pattern.kind===`Name`,c=(e,t)=>{if(s&&o.pattern.kind===`Name`){let n=o.pattern.name,r=e=>i(xh(t,_h(t.scope,n,e)));if(jt(e))return oi(e),Mt(e,r),f(e,t);let a=Mr(e),s=On(a,a.map(r));return Nt(e)?s:(s.lambdaDomain=e,Mn(s))}let n=[],r=Ih(a,e=>Ph(W(e,t),e,t.environment.runtime.version));return Rh(a,r,t.scope,e=>{let r=a.length===1?Kg(o.pattern,e)??!1:Pr(a.map(t=>Kg(t.pattern,e)??!1));return n.push([r,i(xh(t,e))]),!1}),Cr(n)},l=Kh(a,t.body),u=Yh(a),d=Xg(t.body),f=(e,n)=>{let r=Zg(n.scope,d),o=xh(n,r),s=Uh({value:Jh(e,e=>i(xh(o,Vh(a,r,e))),qh(l,a,e),u),bounds:a,body:t.body,scope:r});return a.length===1?Mn(s):s},p=n.callStack;return{build:(n,i)=>{if(t.isRecursive||r||i.isKeepLazy||!P(n))return f(n,i);if(!(a.length===1?Nt(n):typeof n==`object`&&n.kind===`ProductSet`&&n.factors.every(Nt))){if(p)return f(n,i);try{return c(n,i)}catch(t){if(!(t instanceof e.b))throw t;return f(n,i)}}if(!p)return c(n,i);try{return c(n,i)}catch(e){throw Ng(p,t,e),e}},createLazy:f}},e_=(e,t)=>{let n=$g(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=U(r[0].set,t);return t=>n(e(t),t)}return e=>n(Bh(r,e),e)},t_=(e,t)=>{let n=qg.has(e);n&&Jg(e.function);let r=U(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=>U(e,t))}),value:U(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Pr(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(xh(i,_h(i.scope,`@`,e))):Ii(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(qe.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${H(e.function)}`)}return n}},n_=(t,n)=>{let r=U(t.predicate,n),i=t.bound.pattern,a=t.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:e.Y(a)},s=ah(t.predicate),c=n.coverage,l=(e,t,n)=>{if(!c||e===-1)return n();t||c.secondary[e]++;let r=ro(c,t?-1:e,n);return!t&&r===!0&&c.secondary[e]++,r},u=(n,r,a,c)=>({kind:`FilteredSet`,base:n,test:(t,n)=>{if(i.kind===`Tuple`&&di(t)?.length!==i.names.length)throw new e.b(`Attempted to check if the value:\n${M(L(t))}\nis an element of a set of ${i.names.length}-tuples.`);let o=l(c,n,()=>a(xh(r,vh(r.scope,i,t))));if(typeof o!=`boolean`)throw new e.b(`${n?`The evaluation of predicate`:`Evaluating predicate`} ${s} yielded non-Boolean value.`);return o},source:o,rebind:e=>u(n,{...r,environment:e},U(t.predicate,e),-1)});return(e,t,n=-1)=>u(e,t,r,n)},r_=(t,n)=>{if(typeof t!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${zo(t)}.\n${ah(n.predicate)}`);return t},i_=(t,n,r,i)=>{if(!N(t)||mn(t))throw new e.b(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${H(n)}`);return pr(t),Ph(t,r,i)},a_=t=>new e.b(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${H(t)}`),o_=(t,n)=>{if(t.kind===`SetFilter`){let e=U(t.predicate,n),r=U(t.bound.set,n),i=n_(t,n),a=t.bound.pattern,o=n.coverage;return n=>{let s=r(n);if(!Nt(s))return i(s,n,o?.current);let c=[],l=r=>{let i=e(xh(n,vh(n.scope,a,r)));r_(i,t)&&At(c,r)},u=s.kind===`Interval`?s:F(s).elements;return Mt(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),Dn(c)}}if(t.kind===`SetMap`){let e=U(t.expression,n);return n=>{let r=[];return zh(t.bounds,n,t=>(At(r,e(xh(n,t))),!1)),vr(r)}}let r=t.set;if(!r)return()=>{throw new e.b(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(t)}`)};let i=U(t.body,n),a=U(r,n);return n=>{let o=i_(a(n),t,r,n.environment.runtime.version),s,c=t.pattern;if(Fh(o,r=>{if(c.kind===`Tuple`&&di(r)?.length!==c.names.length)throw new e.b(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${H(t)}`);let a=vh(n.scope,c,r);return Eh(i(xh(n,a)),t)?(s=Kg(c,a),!0):!1}),s===void 0)throw a_(t);return s}},s_=e=>[...e].sort((e,t)=>xn(e.name,t.name)),c_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),l_=(e,t)=>{let n=s_(e),r=c_(n),i=n.map(e=>U(e.value,t));if(r)return e=>Fr(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=>Wt(a,i.map(t=>t(e)),o):e=>Ir(a,i.map(t=>t(e)))},u_=(t,n)=>{let r=e=>U(e,n);switch(t.kind){case`Number`:{let e=t.value;return Rt(e)?()=>e:()=>{throw ph(t)}}case`Decimal`:return()=>{throw fh(t)};case`String`:{let e=t.value;return()=>e}case`Identifier`:return Rg(t,n);case`Apply`:return Wg(t,n);case`Bracket`:return()=>{throw new e.b(`A bracket without a function or subscript is not an expression at ${nh(t)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new e.b(`An operator cannot be used as a value at ${nh(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 sh(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 sh(t,r,i);if(i)return!0}return!1}}case`Prime`:{let e=r(t.expression);return t=>e(kg(t))}case`Unchanged`:return Ag(r(t.expression));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 oh(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.b(`A non-boolean expression (${zo(n)}) was used as a condition of a CASE. ${ah(t.source)}`);if(n)return t.body(r)}if(i)return i(r);throw new e.b(`Attempted to evaluate a CASE with no conditions true.\n${H(t)}`)}}case`Let`:{let e=r(t.body);return n=>e(xh(n,Cg(t.definitions,n)))}case`Forall`:case`Exists`:return Gg(t,n);case`UnboundedQuantifier`:return()=>{let n=t.quantifier===`Forall`?`\\A`:`\\E`;throw t.isTemporal?ih(t.quantifier===`Forall`?`\\AA`:`\\EE`,t):new e.b(`TLC attempted to evaluate an unbounded ${n}.\nMake sure that the expression is of form ${n} x \\in S: P(x).\n${H(t)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return o_(t,n);case`SetEnumeration`:{let e=t.elements.map(r);return t=>vr(e.map(e=>e(t)))}case`Tuple`:{let e=t.elements.map(r);return t=>Pr(e.map(e=>e(t)))}case`FunctionConstruction`:return e_(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 l_(t.fields,n);case`RecordSet`:{let e=s_(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 t_(t,n);case`ExceptAt`:return n=>{let r=gh(n.scope,`@`);if(r?.kind!==`Value`)throw new e.b(`@ appears outside an EXCEPT at ${nh(t)}`);return r.value};case`FunctionApplication`:{Jg(t.function);let e=r(t.function),i=n=>yh(e(bh(n)),t),a=t.args.map(r),o=lh(n.runtime.version);if(a.length===1){let e=a[0];return t=>Ni(i(t),e(t),o)}return e=>Ni(i(e),Pr(a.map(t=>t(e))),o)}case`FieldAccess`:{let e=r(t.record),n=ch(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 n=r(t.action),i=Ag(r(t.subscript)),a=t.kind===`BoxAction`,o=a?`[A]_e`:`<A>_e`;return r=>{let s=n(r);if(typeof s!=`boolean`)throw new e.b(`Attempted to evaluate an expression of form ${o}, but A was not a boolean.\n${H(t)}`);return a?s||i(r):s&&!i(r)}}case`Enabled`:{let e=t.expression;return t=>Km(e,t)}case`Label`:return r(t.body);case`Subexpression`:return()=>{throw new e.b(`The subexpression reference at ${nh(t)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw ih(rh[t.kind],t)}}},d_=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},f_=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^qi(e[t]),16777619),r=Math.imul(r^$i(e[t]),1540483477);t[0]=d_(n)||1,t[1]=d_(r)},p_=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},m_=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),h_=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Ri(t,qi(e[n]));return t&1073741823},g_=(e,t)=>{for(let n=0;n<t.length;n++)if(!Vn(e[n],t[n]))return!1;return!0},__=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,v_=(e,t,n)=>{let r=e.slots.length-1;for(let i=__(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&g_(e.states[r-1],n))return r-1}},y_=(e,t,n)=>{let r=e.slots.length-1,i=__(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},b_=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&y_(e,t[n],t[n+1])}y_(e,t,n+1)},x_=(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}},S_=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),C_=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return x_(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},w_=e=>Atomics.load(e.used,0)*2>=e.slots.length,T_=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&x_(t,n);return{slots:t,used:e.used}},E_={kind:`Boolean`,value:!0},D_={kind:`Boolean`,value:!1},O_=e=>e?E_:D_,k_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,A_=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,j_=(e,t)=>({kind:e,body:t}),M_=(e,t,n)=>({kind:e,operands:[t,n]}),N_=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?N_(e,t.operands).operands:[t])}),P_=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return P_(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,P_(t)),0)}},F_=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 F_(e.body);case`And`:case`Or`:return e.operands.some(F_)}},I_=/* @__PURE__ */ new WeakMap;let L_=0;const R_=e=>{let t=I_.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`#${L_++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(R_).join(`,`)})`;default:return`${e.kind}(${R_(e.body)})`}})();return I_.set(e,n),n},z_=(e,t)=>e===t||R_(e)===R_(t),B_=(e,t)=>{let n=R_(t);return e.some(e=>e===t||R_(e)===n)},V_=e=>e===`And`?`Or`:`And`,H_=(e,t)=>{switch(e.kind){case`Boolean`:return t?O_(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?j_(`Not`,e):e;case`Not`:return H_(e.body,!t);case`And`:case`Or`:return N_(t?V_(e.kind):e.kind,e.operands.map(e=>H_(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return j_(n,H_(e.body,t))}}},U_=e=>{switch(e.kind){case`Boolean`:return O_(!e.value);case`Not`:return e.body;case`And`:case`Or`:return N_(V_(e.kind),e.operands.map(U_));case`Always`:return j_(`Eventually`,U_(e.body));case`Eventually`:return j_(`Always`,U_(e.body));default:return j_(`Not`,e)}},W_=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=W_(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return O_(t)}return n.length===0?O_(!t):n.length===1?n[0]:N_(e.kind,n)}case`Not`:{let t=W_(e.body);return t.kind===`Boolean`?O_(!t.value):j_(`Not`,t)}case`Always`:case`Eventually`:{let t=W_(e.body);return j_(e.kind,t.kind===e.kind?t.body:t)}default:return e}},G_=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,K_=t=>{switch(t.kind){case`And`:{let n=[],r=1;for(let i of t.operands){let t=K_(i);if(t.kind===`And`)n.push(...t.operands);else{if(t.kind===`Or`&&(r*=t.operands.length,r>2147483647))throw new e.b(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);n.push(t)}}if(r===1)return{kind:`And`,operands:n};let i=Array.from({length:r},()=>[]),a=1,o=r;for(let e of n){if(e.kind!==`Or`){i.forEach(t=>t.push(e));continue}o/=e.operands.length;let t=0;for(let n=0;n<a;n++)for(let n of e.operands)for(let e=0;e<o;e++)i[t++].push(n);a*=e.operands.length}return{kind:`Or`,operands:i.map(e=>N_(`And`,e))}}case`Or`:{let e=[],n=[];for(let r of t.operands){let t=K_(r);for(let r of t.kind===`Or`?t.operands:[t]){let t=G_(r);t?e.push(t):n.push(r)}}if(e.length>0){let t=e.length===1?e[0]:N_(`Or`,e);n.push(j_(`Always`,j_(`Eventually`,t)))}return N_(`Or`,n)}case`Not`:return k_(t.body)?t:K_(U_(t.body));default:return t}},q_=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?q_(e.operands[0]):N_(e.kind,e.operands.map(q_));case`Not`:return e.body.kind===`Not`?q_(e.body.body):j_(`Not`,q_(e.body));case`Always`:case`Eventually`:case`Next`:return j_(e.kind,q_(e.body));default:return e}},J_=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return J_(e.operands[0]);let t=Math.floor(e.operands.length/2);return M_(e.kind,J_(N_(e.kind,e.operands.slice(0,t))),J_(N_(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return j_(e.kind,J_(e.body));default:return e}},Y_=(e,t)=>{e.kind===`Eventually`&&!B_(t,e)&&t.push(e),`body`in e&&Y_(e.body,t),`operands`in e&&e.operands.forEach(e=>Y_(e,t))},X_=e=>{let t=e.filter(A_),n=e.flatMap(e=>e.kind===`Not`&&A_(e.body)?[e.body]:[]);return!t.some(e=>B_(n,e))},Z_=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,j_(`Next`,t)),n.push(t.body);break;case`And`:case`Or`:n.push(...t.operands),r.push(t);break;case`Action`:throw new e.b(`TLC encountered actions while constructing the tableau`);default:r.push(t)}}return r},Q_=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:j_(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},$_=(e,t,n)=>e.flatMap(e=>{let r=Q_(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),ev=e=>[...new Set(e.map(R_))].sort().join(`|`),tv=(e,t)=>{let n=new Set(t.map(ev));return[...e.filter(e=>!n.has(ev(e))),...t]},nv=e=>{let t=Z_(e),n=$_(t,`Always`,`And`),r=$_(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Q_(t,`Eventually`,`Or`);if(n&&!(B_(e,n.first)||B_(e,n.second)))return tv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(B_(e,t.first)||B_(e,t.second))&&!B_(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!X_(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Q_(t[e],`Always`,`And`);n&&(B_(t,n.first)||t.push(n.first),B_(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)B_(t,e.first)&&B_(t,e.second)&&!B_(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!X_(t)?[]:i(t)};return a(e)},rv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>P_(e)<=1)}),iv=e=>{let t=nv([e]).map(rv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=ev(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 nv(n)){let n=ev(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(rv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},av=(e,t)=>!B_(e,t)||B_(e,t.body),ov=(t,n)=>{if(t.kind===`Eventually`&&t.body.kind===`Always`&&P_(t.body.body)<3){n.eventuallyAlways.push(t.body.body);return}let r=G_(t);if(r){let e=P_(r);if(e<=1){n.infinitelyOftenStates.push(r);return}if(e===2){n.infinitelyOftenActions.push(r);return}}if(F_(t))throw new e.b(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);n.formulas.push(t)},sv=(e,t)=>{let n=e.findIndex(e=>z_(e,t));return n===-1?(e.push(t),e.length-1):n},cv=e=>{let t=K_(W_(H_(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=q_(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])ov(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:N_(`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&&J_(e.formula),n=[];t&&Y_(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>sv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>sv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>sv(i,e))}));return{tableau:t&&iv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},lv=()=>e.it(new e.b(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.tt.livenessEvaluationFailure),uv=/* @__PURE__ */ new Set([`~>`,`-+->`]),dv=/* @__PURE__ */ new WeakSet,fv=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),pv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),mv=(t,n)=>new e.b(`TLC cannot handle the temporal formula ${H(t)}${n===void 0?``:`:\n${n}`}`),hv=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=hv(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=gh(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=Dh(e,n);if(t)return vu(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:j(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Uc(e,(e,o)=>(a=Math.max(a,hv(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(uv.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=j(e)?void 0:og(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,yg(o,e.args,pv(n,t)))}default:return l(e)}},gv=(t,n)=>{try{return Lh(t,n)}catch(t){if(!(t instanceof e.b))throw t;if(!it(t))return;throw e.it(new e.b(`${e.U}${t.message}`),e.tt.error)}},_v=(t,n,r,i,a={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let o=(e,t,n=a.name,o=a.expanding,s)=>_v(e,t,r,i,{name:n,path:s?.kind===`Operator`&&s.params.length===0?[...a.path,s.name]:a.path,expanding:o,isSubstituted:a.isSubstituted||s!==void 0&&r.substitutedDefinitions.has(s)});if(t.kind===`And`)return t.operands.flatMap(e=>o(e,n,H(e)));if(t.kind===`Label`)return o(t.body,n);if(t.kind===`Let`)return o(t.body,vv(t,n,r));if(t.kind===`Identifier`){let i=j(t)?gh(n,t.name):void 0;if(i?.kind===`Thunk`&&!i.isReleased)return o(i.expression,i.scope,dv.has(i)?t.name:a.name);let s=r.constants.has(t.name)?void 0:Dh(t.name,r);if(!i&&s?.kind===`Operator`&&s.params.length===0&&(vu(s,r)>0||tg(s,r)===void 0)){if(a.expanding.has(s))throw e.J();return o(s.body,void 0,!a.isSubstituted&&r.instanceNames.get(t.name)||s.name,/* @__PURE__ */ new Set([...a.expanding,s]),s)}}let s=pv(r,n);if(t.kind===`Apply`&&r.runtime.version!==`1.7.4`&&(i||hv(t,n,r)===3)){let e=sg(t,s),n=j(t)?void 0:Dh(t.operator,r),i=e?.kind===`Closure`&&e.params.every(e=>r.instanceParams.has(e));if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive&&(!a.isSubstituted||i))return o(e.body,yg(e,t.args,s),a.isSubstituted&&n?n.name:t.operator,a.expanding,n)}let c=i&&t.kind===`Forall`&&t.bounds.every(e=>hv(e.set,n,r)===0),l=c?gv(t.bounds,s):void 0;if(c&&l){let e=[];if(Rh(t.bounds,l,n,n=>(e.push(...o(t.body,n,H(t.body))),!1)),e.length===0)throw lv();return e}return[{expression:t,scope:n,name:a.name,path:a.path}]},vv=(e,t,n)=>{let r=Cg(e.definitions,pv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&dv.add(e.binding);return r},yv=(t,n,r)=>{let i=r.runtime.version===`1.7.4`,a=(t,n,a)=>{let o=a===0&&!i?hv(t,n,r):a;if(o===0){let i=W(t,pv(r,n));if(typeof i!=`boolean`)throw new e.b(`TLC expected a boolean value, but did not find one. ${ah(t)}`);return O_(i)}return o===1?{kind:`State`,expression:t,scope:n}:t.kind===`AngleAction`?{kind:`Action`,expression:t.action,subscript:t.subscript,scope:n}:{kind:`Action`,expression:t,subscript:void 0,scope:n}},o=0,s=(t,n,i,s)=>{if(o>=100)throw e.J();o++;let c=f(t,n);o--;let l=P_(c),u=l===0&&hv(i,s,r)>2;return l>2||u?c:a(i,s,l)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=pv(r,t),o=j(e)||Dh(n,r)===void 0?gh(t,n):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&dv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:j(e)?cg(n,a):og(n,r),u=e.kind===`Apply`?e.args:[],p=c?.kind===`Builtin`&&u.length===2?fv.get(c.name):void 0;if(p){let n=u.map(e=>f(e,t));return d(e,t,N_(p,n))}if(c?.kind!==`Closure`)throw mv(e);let m=!j(e)&&Dh(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),s(c.body,yg(c,u,a),e,t)),m)},l=(t,n,r=!1)=>{try{return n()}catch(n){let a=n instanceof e.N||r&&!i;throw!(n instanceof e.b)||a?n:mv(t)}},u=(t,n)=>{let i=hv(t,n,r),o=[],s=t.kind===`Forall`;try{zh(t.bounds,pv(r,n),e=>(o.push(f(t.body,e)),!1))}catch(r){if(!(r instanceof e.b)||r instanceof e.N)throw r;if(i<=2)return a(t,n,i);throw mv(t,s&&!it(r)?r.message:void 0)}return o.length===0?O_(s):d(t,n,N_(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=P_(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=hv(e,t,r);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,vv(e,t,r));case`Apply`:{let n=e.args;if(e.operator===`~`&&!j(e))return d(e,t,j_(`Not`,f(n[0],t)));if(e.operator===`=>`)return d(e,t,M_(`Or`,j_(`Not`,f(n[0],t)),f(n[1],t)));break}case`And`:case`Or`:return d(e,t,N_(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&hv(e.condition,t,r)===0){let n=W(e.condition,pv(r,t));if(typeof n==`boolean`)return f(n?e.consequent:e.alternative,t)}let n=f(e.condition,t);return d(e,t,M_(`Or`,M_(`And`,n,f(e.consequent,t)),M_(`And`,j_(`Not`,n),f(e.alternative,t))))}}if(n<=2)return a(e,t,n);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?j_(`Always`,M_(`Or`,j_(`Not`,f(e.args[0],t)),j_(`Eventually`,f(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return j_(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=j_(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?j_(`Always`,j_(`Eventually`,M_(`Or`,i,a))):M_(`Or`,j_(`Eventually`,j_(`Always`,i)),j_(`Always`,j_(`Eventually`,a)))}default:throw mv(e)}};return f(t,n)},bv=(t,n,r,i,a)=>{let o=e=>bv(e,n,r,i,a);switch(t.kind){case`Boolean`:return t.value;case`State`:case`Enabled`:{let r=a.get(t);if(r!==void 0)return r;let o={environment:i,scope:t.scope,state:n,next:void 0},s=t.kind===`State`?W(t.expression,o):Km(t.step,o);if(typeof s!=`boolean`)throw new e.b(`A state predicate was evaluated to a non-boolean value.`);return a.set(t,s),s}case`Action`:{if(t.enabled&&a.get(t.enabled)===!1)return!1;let o=t.scope,s=t.subscript;if(s&&mr(W(s,{environment:i,scope:o,state:n,next:void 0}),W(s,{environment:i,scope:o,state:r,next:void 0})))return!1;let c=W(t.expression,{environment:i,scope:o,state:n,next:r});if(typeof c!=`boolean`)throw new e.b(`Encountered an action predicate that's not a boolean.`);return c}case`Not`:return!o(t.body);case`And`:return t.operands.every(o);case`Or`:return t.operands.some(o);case`Next`:return bv(t.body,r??n,void 0,i,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new e.b(`TLC cannot evaluate a temporal formula in a single step`)}},xv=(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)=>xv(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 bv(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Sv=`UnnamedAction`,Cv={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},wv=e=>{let t=e.range??Cv;return Fr([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Tv=(e,t)=>{let n=[[`name`,e.name],[`location`,wv(e.location)]];return e.parameters.length>0&&n.push([`context`,Fr(e.parameters)],[`parameters`,Pr(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Fr(n)},Ev=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),Dv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ov=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,kv=e=>e.kind===`Apply`?e.args:[],Av=(e,t,n)=>{let r=Ov(e);if(r===void 0)return;if(j(e)){let e=gh(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=og(r,n);return i?.kind===`Closure`?i:void 0},jv=(t,n)=>{try{return W(t,Dv(n,void 0)),!0}catch(t){if(t instanceof e.y)return!1;throw t}},Mv=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&hu(e,t)&&jv(e.body,t),Nv=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Mv(e,t),Pv=(e,t)=>{let n=Dh(e.name,t);return n?.body===e.body&&Nv(n,t)},Fv=(e,t)=>{if(e.kind!==`Identifier`||!j(e))return;let n=gh(t,e.name);return n?.kind===`Thunk`?n:void 0},Iv=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:Cg(e.definitions,Dv(n,t))};let r=Fv(e,t);return r&&{expression:r.expression,scope:r.scope}},Lv=(e,t,n,r)=>t.kind===`Apply`?yg(e,t.args,Dv(r,n)):e.scope,Rv=(e,t)=>(e?.params??[]).flatMap(e=>{let n=gh(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),zv=(t,n)=>{try{return t()}catch(t){if(t instanceof e.y)return n();throw t}},Bv=(e,t,n,r,i)=>{let a=kv(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>hv(e,n,i)!==0)?o():zv(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,Dv(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Vv=(t,n,r,i,a)=>{let o=()=>({name:r?.name??Sv,location:t.location,parameters:Rv(r,n),expression:t,scope:n});if(Fp.has(t.kind))throw e.it(new e.b(`${e.W}The next state relation is not a boolean expression.\n${ah(t)}`),e.tt.error);switch(t.kind){case`Let`:return Vv(t.body,Cg(t.definitions,Dv(i,n)),r,i,a);case`Label`:return Vv(t.body,n,r,i,a);case`Or`:return t.operands.flatMap(e=>Vv(e,n,r,i,a));case`Exists`:return zv(()=>{let e=[];return zh(t.bounds,Dv(i,n),n=>(e.push(...Vv(t.body,n,r,i,a)),!1)),e.length===0?[o()]:e},()=>[o()])}let s=j(t)?void 0:a.get(Ov(t)??``),c=Av(t,n,i);if(s)return Bv(s,t,n,c,i);if(!c)return[o()];let l=kv(t),u=j(t)?c.name:i.instanceNames.get(Ov(t)??``)??c.name,d=()=>[{name:u,location:t.location,parameters:[],expression:t,scope:n}];return Pv(c,i)||l.some(e=>hv(e,n,i)!==0)?d():zv(()=>{let e=l.reduce((e,t,r)=>({name:c.params[r].name,binding:{kind:`Value`,value:W(t,Dv(i,n))},parent:e}),c.scope);return Vv(c.body,e,{...c,name:u},i,a)},d)},Hv=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Hv(e,t,n,r,i,o),s=(e,t,n)=>Ev(e,Ic(t,a),n),c=Iv(e,t,n);if(c){o(c.expression,c.scope);return}let l=Av(e,t,n);if(l&&Pv(l,n))return;let u=l?[...a,...Fc.get(l.body)??[]]:a;if(l&&l.params.length===0){if(hv(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,yg(l,e.args,Dv(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(Sv,e,t));return}let d=hv(e,t,n);d<=1?r.inits.push(s(Sv,e,t)):d===3&&r.temporals.push(s(Sv,e,t))},Uv=(e,t,n,r,i)=>{let a=(t,n)=>Uv(e,t,n,r,i),o=Iv(t,n,r);if(o){a(o.expression,o.scope);return}let s=Av(t,n,r);if(s&&Pv(s,r))return;if(s&&s.params.length===kv(t).length){a(s.body,Lv(s,t,n,r));return}if(t.kind===`Forall`&&zv(()=>(zh(t.bounds,Dv(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(Ev(e,a)):hv(a,n,r)<2?i.invariants.push(Ev(e,a)):i.impliedTemporals.push(Ev(e,t));return}let c=hv(t,n,r);c<=1?i.impliedInits.push(Ev(e,t)):c===3&&i.impliedTemporals.push(Ev(e,t))},Wv=(e,t)=>{let n=Dh(e,t);return n?.kind===`Operator`&&!Nv(n,t)?n:void 0},Gv=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:Wv(e.specification,t);a&&(Hv(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Sv,location:e.frames[0].location,parameters:[],expression:Ic(e.expression,e.frames),scope:e.scope}]:Vv(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:og(e.init,t);o?.kind===`Closure`&&r.inits.push(Ev(e.init??``,o.body));let s=e.next===void 0?void 0:og(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Vv(s.body,s.scope,s,t,n)),r},Kv=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=Iv(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&j(e)?gh(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!j(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Av(e,t,n);if(!s||s.params.length!==kv(e).length)return!0;let c=Dh(s.name,n);return c?.body===s.body&&Mv(c,n)?!0:i(s.body,Lv(s,e,t,n))};return i(e,t)?r:void 0},qv=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,Jv=(t,n,r=!1)=>`${t.name===Sv?r?`Initial predicate`:`Action`:t.name}${n===`1.7.4`?``:qv(t)} ${e.Y(t.location.range??Cv)}`,Yv=e=>`${e.name}${qv(e)}`,Xv=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=Wv(e,n);t&&i.invariants.push(Ev(e,t.body))}),t.properties.forEach(e=>{let t=Wv(e,n);t&&Uv(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>_r(e.map(e=>{let n=a&&t&&bo(a,t,e.expression);return Tv(e,n&&Fr(n))})),s=e=>_r(e.flatMap(e=>{let t=Wv(e,n);return t?[Fr([[`name`,t.name],[`location`,wv(t.location)]])]:[]}));return Fr([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,_r(n.variables.map((e,t)=>Fr([[`name`,e],[`location`,wv(r[t])],...a?[[`coverage`,Fr([[`distinct`,so(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Zv=t=>{switch(t.kind){case`Number`:if(!Rt(t.value))throw e.it(new e.O(`TLC can't handle a number this big.\n${t.value}`),e.tt.error);return t.value;case`String`:case`Boolean`:return t.value;case`ModelValue`:return wn(t.name);case`Set`:return F({kind:`MixedSet`,elements:t.elements.map(Zv)})}},Qv=t=>{try{return Zv(t)}catch(t){throw!(t instanceof e.b)||t instanceof e.O||t instanceof e.x?t:e.it(new e.b(`${e.W}${t.message}`),e.tt.error)}},$v=(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.b(`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`)&&zn(e,r)})});if(n)return n[1];throw new e.b(`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}},ey=t=>new e._(`In the configuration file, the identifier ${t} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),ty=(t,n)=>{let r=e=>n.root.visible.get(e)?.key??e,i=n.root.constants.map(e=>e.name),a=n.root.variables,o=e=>{let t=n.moduleSymbols.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},s=e=>{if(e.module===void 0)return[e.name,r(e.name)];let t=o(e);return t?[t.key]:[]},c=e=>e.module===n.root.module.name?[]:s(e),l=e=>{let t=n.definitions.get(e);return t?.kind===`Operator`?t.params.length:n.root.constants.find(t=>t.name===e)?.arity??n.builtins.get(e)?.arity??0},u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,f=(e,t)=>{n.builtins.set(e,t),n.definitions.delete(e),u.delete(e),d.add(e)};t.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Qv(e.value);fr(t),c(e).forEach(e=>{let n=l(e);n===0?u.set(e,t):f(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let p=/* @__PURE__ */ new Map;t.constants.forEach(t=>{if(t.args===void 0)return;let n=`${t.module??``}!${t.name}`,r=p.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._(`The arity of the operator ${t.name} is inconsistent in the configuration file.`);r.rows.push([t.args.map(Zv),Zv(t.value)]),p.set(n,r)}),p.forEach(e=>c(e).forEach(t=>f(t,$v(e.name,l(t),e.rows))));let m=new Map(t.substitutions.flatMap(e=>s(e).map(t=>[t,r(e.target)])));[...m.keys()].forEach(e=>u.delete(e));let h=(t,o,s)=>{let c=r(o),l=n.definitions.get(c);if(!(l!==void 0||n.builtins.has(c)||u.has(c)||i.includes(o)||a.includes(o)))throw new e._(`The configuration file substitutes for ${t} with the undefined identifier ${o}.`);if(l?.kind===`Operator`&&l.params.length!==s)throw new e._(`The configuration file substitutes for ${t} with ${o} of different number of arguments.`)};t.substitutions.filter(e=>e.module===void 0).forEach(r=>{let a=r.name,o=r.target;if(!i.includes(a)&&!n.root.visible.has(a))throw new e._(`In the configuration file, the identifier ${a} does not appear in the specification.`);if(t.substitutions.some(e=>e.name===o))throw ey(o);h(a,o,n.root.constants.find(e=>e.name===a)?.arity??n.root.visible.get(a)?.arity)});let g=t.substitutions.filter(e=>e.module!==void 0);[...n.moduleSymbols.keys()].forEach(t=>{let n=g.filter(e=>e.module===t);n.forEach(e=>{let t=o(e);if(t){if(n.some(t=>t.name===e.target))throw ey(e.target);h(e.name,e.target,t.arity)}});let r=n.find(e=>!o(e));if(r)throw new e._(`In the configuration file, the identifier ${r.name} does not appear in the specification.`)});let _=g.find(e=>!n.moduleSymbols.has(e.module??``));if(_)throw new e._(`In the configuration file, the module name ${_.module} is not a module in the specification.`);let v=new Set([...t.constants,...t.substitutions].filter(e=>e.module!==void 0).flatMap(c)),y=(e,t)=>{if(v.has(e))return{key:e,prefix:t};let r=n.copySources.get(e);return r&&y(r.source,t+r.prefix)};n.copySources.forEach((e,t)=>{let r=y(e.source,e.prefix),i=n.definitions.get(t);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=ll(t,r.key,a,a.slice(r.prefix),i.location);n.definitions.set(t,o),n.root.visible.forEach((e,r)=>{e.key===t&&r!==t&&n.definitions.set(r,o)})}),n.operatorConstants.forEach((e,t)=>u.set(t,e));let b=i.filter(e=>!u.has(e)&&!m.has(e)&&!d.has(e));if(b.length>0){let t=n.order.getDeclarationOrder(`constant`).find(e=>b.includes(e))??b[0];throw new e._(`The constant parameter ${t} is not assigned a value by the configuration file.`)}return{constants:u,substitutions:m}},ny=`tlc2/value/impl/`,ry={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},iy={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},ay=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},oy=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),sy=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],cy=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??oy.get(e[3])}${`[]`.repeat(e[1].length)}`),ly=(e,t)=>e[e[t].first].text,uy=(e,t)=>ly(e,t).replaceAll(`/`,`.`),dy=t=>{let n=ay(t);if(n.readUint32()!==3405691582)throw new e.P(`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===ry.utf8?i.text=a.decode(n.readBytes(n.readUint16())):t===ry.integer?i.value=n.readInt32():t===ry.float?n.readUint32():t===ry.long||t===ry.double?(n.readBytes(8),e++):t===ry.class||t===ry.string||t===ry.methodType||t===ry.module||t===ry.package?i.first=n.readUint16():t===ry.methodHandle?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=uy(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=cy(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:ay(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()},()=>uy(r,d.readUint16())):[],p=sy.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=cy(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}},fy=(e,t)=>{let n=e[t],r=e[n.second];return{className:ly(e,n.first),name:e[r.first].text}},py=(t,n,r,i)=>{let a=()=>new e.z(`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===ry.integer)return t.value;if(t.tag===ry.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>=iy.iconstM1&&t<=iy.iconst5)s.push(t-iy.iconst0),e+=1;else if(t===iy.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===iy.sipush)s.push(r()<<16>>16),e+=3;else if(t===iy.ldc)s.push(l(o[e+1])),e+=2;else if(t===iy.ldcW)s.push(l(r())),e+=3;else if(t===iy.dup){let t=c();s.push(t,t),e+=1}else if(t===iy.getstatic){let t=fy(n,r());if(t.className!==`${ny}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===iy.invokestatic){let t=fy(n,r()),o=c();if(t.className!==`${ny}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===iy.new)s.push({className:ly(n,r()),value:void 0}),e+=3;else if(t===iy.invokespecial){let t=fy(n,r()),o=c(),s=c();if(!(t.className===`${ny}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===iy.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()},my=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=dy(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:py(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)}))}},hy=C(`EOF`),gy=C(`IDENTIFIER`),_y=C(`DEFBREAK`),vy=(e,t)=>Array.from({length:C(t)-C(e)+1},(t,n)=>C(e)+n),yy=new Set(vy(`op_57`,`op_119`)),by=new Set(vy(`op_1`,`op_119`)),xy=new Set(vy(`op_57`,`op_70`)),Sy=/* @__PURE__ */ new Set([...vy(`ACTION`,`EXCEPT`),C(`EXTENDS`),...vy(`IF`,`SF`),C(`STATE`),...vy(`THEN`,`WITH`),C(`US`),...vy(`op_112`,`op_116`)]),Cy=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),wy=new Map([...Cy(`postfix`,160,160,!0,`[`),...Cy(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Cy(`prefix`,120,120,!1,`-.`),...Cy(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Cy(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Cy(`prefix`,40,40,!0,`\\lnot`),...Cy(`nfix`,100,130,!0,`\\times`),...Cy(`infix`,140,140,!1,`^`,`^^`),...Cy(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Cy(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Cy(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Cy(`infix`,100,110,!0,`|`,`||`,`%%`),...Cy(`infix`,100,110,!1,`%`),...Cy(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Cy(`infix`,90,140,!1,`\\wr`),...Cy(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Cy(`infix`,90,130,!1,`!!`),...Cy(`infix`,90,90,!1,`...`,`..`),...Cy(`infix`,80,80,!0,`\\intersect`,`\\union`),...Cy(`infix`,80,80,!1,`\\`),...Cy(`infix`,70,70,!1,`<:`,`:>`),...Cy(`infix`,60,60,!0,`@@`),...Cy(`infix`,50,140,!0,`\\cdot`),...Cy(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Cy(`infix`,30,30,!0,`\\land`,`\\lor`),...Cy(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Cy(`infix`,10,10,!1,`=>`)]),Ty=new Map([...wy,..._f.flatMap(e=>e.slice(1).map(t=>[t,wy.get(e[0])]))]),Ey=Ty.get(`[`),Dy={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Oy=e=>({type:`tokens`,kinds:new Set(e)}),ky=e=>typeof e==`string`?e.startsWith(`<`)?Oy([C(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(ky)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Ay=e=>(...t)=>({type:e,body:G(...t)}),q=Ay(`zeroOrMore`),jy=Ay(`oneOrMore`),J=Ay(`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}),My=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Ny=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=My(e,n);return n},Py=(...e)=>{let t=e.map(C);return e=>t.includes(Ny(e,1).kind)},Fy=(e,t=Ny(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Iy=e=>{let t=Ny(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Ly=e=>Py(`CASESEP`)(e)&&Fy(e),Ry=e=>{let t=Ny(e,1);Sy.has(t.kind)&&(t.kind=gy)},zy=(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}`,By=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Vy=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Hy=e=>e.operatorStacks[e.operatorStacks.length-1],Uy=(e,t)=>e.low>t.high,Wy=(e,t)=>e.high<t.low,Gy=e=>e.fix===`prefix`?e:Ty.get(`${e.name}.`),Ky=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Ey?By(`FcnAppl`,[n,...r.node.heirs]):By(`PostfixExpr`,[n,r.node]),operator:void 0})},qy=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:By(`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:By(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Jy=e=>{let t=Hy(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 Ky(t,n),Jy(e);if(i.operator!==void 0){let t=Gy(r.operator);return t!==void 0&&Uy(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${zy(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 ${zy(e,a.node.first,a.node.last)} and expression at location ${zy(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Wy(a.operator,r.operator)?void 0:Uy(a.operator,r.operator)?(qy(t,a.operator),Jy(e)):`Precedence conflict between ops ${a.operator.name} in block ${zy(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Gy(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Wy(s,r.operator))return;if(!Uy(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${zy(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return qy(t,s),Jy(e);let c=zy(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===Dy?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Yy=e=>Y(t=>{let n=Hy(t),r=Vy(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:Jy(t)}),Xy=Yy(()=>!1),Zy=Yy(()=>!0),Qy=Y(e=>{e.lastOperator=Ty.get(e.token.image)}),$y=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},eb=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?$y(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},tb=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Fy(e,n.first.beginColumn))return n;let t=tb(e,n);if(t!==void 0)return t}},nb=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(C),n=(e,...t)=>t.some(t=>e.kind===C(t)),r=e=>e!==void 0&&yy.has(e.kind),i=e.token,a=My(e,i);i.next=void 0;let o=My(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===gy&&(e=e.next)}else if(e.kind===gy){let t=e.next;!r(t)||xy.has(t.kind)||by.has(t.kind)&&t.next?.kind!==gy||(e=t.next?.kind===C(`SUBSTITUTE`)?i:by.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==_y&&(e.next={kind:_y,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=My(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},rb=e=>{let t=Ny(e,1);if(t.kind===C(`LAB`)){let n=1;for(;n!==0;)if(t=My(e,t),t.kind===C(`LAB`)&&n++,t.kind===C(`RAB`)&&n--,t.kind===hy)return!1;return My(e,t).kind===C(`IN`)}if(t.kind!==gy)return!1;for(t=My(e,t);t.kind===C(`COMMA`);){if(t=My(e,t),t.kind!==gy)return!1;t=My(e,t)}return t.kind===C(`IN`)},ib=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),ab=e=>e.proofLevels.at(-1)??-1,ob=e=>{let t=Ny(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Py(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||ab(e)>=0&&ib(t)>ab(e):Py(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},sb=(e,t)=>{let n=ib(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},cb=e=>Y(t=>sb(t,t.token)?void 0:`${zy(t,t.token)}: ${e}`),lb=Oy([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(C)),ub=Oy([...lb.kinds,C(`op_76`)]),db=Oy(by),fb=Oy(xy),pb=Oy([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(C)),mb=()=>q(Z({expansion:[K(lb,`<op_77>`)],semantic:Fy}),K(`PrefixOp`,`InfixOp`),Zy),hb=()=>K(G(Z({expansion:[`OpenStart`],semantic:Fy}),`OpenExpression`,Xy),G(Z({semantic:Fy}),`ExtendableExpr`)),gb=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),_b=()=>K(G(Z({semantic:e=>Py(`ASSUME`,`BOXASSUME`)(e)||Ny(e,2).kind===C(`COLONCOLON`)&&[C(`ASSUME`),C(`BOXASSUME`)].includes(Ny(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),vb=()=>[`JuncItem`,q(Z({semantic:Iy}),`JuncItem`)],yb=e=>Y(t=>{t.expecting=e,Ry(t)}),bb=e=>Y(t=>{t.isTerminalProof=e}),xb=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{nb(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),Sb={CompilationUnit:Q(void 0,[Y(nb),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>`),yb(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,yb(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,yb(`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(nb)),G(Z({semantic:e=>Py(`USE`)(e)&&Ny(e,2).kind!==C(`ONLY`)||Py(`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(xb(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),xb(`Expression`,Z({expansion:[`<IDENTIFIER>`,fb]}),`PostfixLHS`,`Expression`),xb(`Expression`,Z({expansion:[`<IDENTIFIER>`,db]}),`InfixLHS`,`Expression`),xb(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),xb(`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`,[ub,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,db,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,fb]),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>`,yb(`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,[lb,Qy]),NonExpPrefixOp:Q(void 0,[ub,Qy]),InfixOp:Q(`Infix Op`,[db,Qy]),PostfixOp:Q(void 0,[fb,Qy]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{nb(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),_b(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),_b(),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=Vy(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${zy(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(nb),K(G(Z({amount:3}),Z({semantic:Py(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:ob}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>Py(`BY`)(e)||Ny(e,2).kind===C(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Ny(e,2).kind!==C(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,bb(!0),J(`<ONLY>`)),G(`<USE>`,bb(!1),J(`<ONLY>`)),G(`<HIDE>`,bb(!1))),X("an expression, `MODULE' or `DEF'"),J(gb(),q(`<COMMA>`,X(`MODULE or expression`),gb(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),gb(),q(`<COMMA>`,X(`MODULE or expression`),gb(),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`),pb,cb(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:ob}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),pb,cb(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:Py(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:Py(`INSTANCE`)}),`Instantiation`),G(Z({semantic:Py(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:ob}),Y(e=>{let t=Vy(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${zy(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),jy(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:Py(`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(ub,db,fb),Oy([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(C))],semantic:Fy}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${zy(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Fy}),`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:rb}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),jy(`<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=Vy(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`)),jy(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:rb}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Ny(e,2).kind===C(`MAPTO`)&&Sy.has(Ny(e,1).kind)}),Y(e=>{Ny(e,1).kind=gy}),`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=By(`FcnAppl`,t.heirs),e.lastOperator=Ey})),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>`,jy(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Ry),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===C(`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=>Ly(e)&&Ny(e,2).kind!==C(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Ly}),`<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`,[jy(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Ny(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...vb()),G(Z({expansion:[`<AND>`]}),...vb())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=tb(t,e.heirs[1]);return n&&`Item at ${zy(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${zy(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([])}),mb(),hb()],(e,t)=>{let n=Hy(t);n.push({node:e.heirs[0],operator:Dy});let r=Jy(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`),Xy,q(K(G(Z({expansion:[`PostfixOp`],semantic:Fy}),`PostfixOp`,Zy),G(Z({expansion:[`<DOT>`],semantic:Fy}),`<DOT>`,Y(Ry),Z({semantic:Fy}),`Identifier`,Y(e=>{let t=Hy(e);t[t.length-1].operator!==void 0&&Ky(t,t.length),t[t.length-1]={node:By(`RecordComponent`,[t[t.length-1].node,Vy(e,2),Vy(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Fy}),X(`function argument`),`SBracketCases`,Yy(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Fy}),`InfixOp`,Zy,mb(),hb()),G(Z({expansion:[`<COLONCOLON>`],semantic:Fy}),`<COLONCOLON>`,Y(e=>{let t=Hy(e);if(!eb(t[t.length-1].node))return`\`::' at ${zy(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Hy(e),n=Vy(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Wy(r,e.lastOperator)){let t=Vy(e,3);return`Removing label at ${zy(e,t.first,t.last)} would change expression parsing.`}t.push({node:By(`Label`,[Vy(e,3),Vy(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Fy}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Fy}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>ab(e)<0&&e.proofLevels.length<=1?`${zy(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${zy(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:$y(e.heirs)===void 0?e.heirs.length===1?By(`GeneralId`,e.heirs):void 0:By(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Ny(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=>Ny(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${zy(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Cb=/* @__PURE__ */ new Map,wb=e=>{let t=Cb.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=wb(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,wb(Sb[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 Cb.set(e,n),n},Tb=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Eb=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=My(e,e.scanPosition)),e.scanPosition=My(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`},Db=(e,t)=>{if(t.type===`tokens`)return Eb(e,t.kinds);if(t.type===`call`)return Db(e,Sb[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Tb(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=Db(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||Tb(e,t.semantic)?Db(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Db(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=Db(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Ob=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Db(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},kb=(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||wb(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!wb(a).hasSemanticStart?wb(a).first.has(Ny(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Ob(e,i,a)&&(o===void 0||o(e))}),Ab=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,Db(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=My(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===hy){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=My(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${we(e.token.image)}" `},jb=(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??Ab(e)}\n\nResidual stack trace follows:\n${r}`,!1},Mb=(e,t)=>{let n=My(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,jb(e))},Nb=(e,t)=>{let n=Sb[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Ny(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!Pb(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 jb(e,i);let a=r.node??(r.heirs.length===0?void 0:By(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Pb=(e,t)=>{if(t.type===`tokens`)return Mb(e,t.kinds);if(t.type===`call`)return Nb(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||jb(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||jb(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||Pb(e,t));if(t.type===`choice`){let n=kb(e,t.alternatives);return n===-1?jb(e):Pb(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Pb(e,t.body))return!1;if(t.type===`optional`)return kb(e,[t.body])===-1||Pb(e,t.body);for(;kb(e,[t.body])===0;)if(!Pb(e,t.body))return!1;return!0},Fb=e=>{let t=Se(e),n={kind:hy,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=Pb(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
1783
+ `)},Ib={low:15,high:15},Lb={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Rb=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)]]),zb=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Bb=/* @__PURE__ */ new Set([...zb,`'`]),Vb=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Hb=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Ub=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Wb=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Gb=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Bb]),Kb=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),qb=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Jb=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Yb=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Xb=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Zb=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Qb=/* @__PURE__ */ new Set([``,`*`,`-`]),$b={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},ex=(e,t)=>e.line-t.line||e.column-t.column,tx=(e,t)=>({start:ex(e.start,t.start)<=0?e.start:t.start,stop:ex(e.stop,t.stop)>=0?e.stop:t.stop}),nx=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),rx=(t,n,r=`Proof.Parser`)=>new e.P(t,void 0,{reason:t,line:n.start.line,column:n.start.column,isEnd:!1,proof:{stop:n.stop,exception:r}}),ix=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),ax=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),ox=/* @__PURE__ */ new Set([`NEW`,...ax.keys()]),sx=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),cx=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),lx=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),ux=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Rb.has(e.operator):zb.has(e.operator)),dx=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,fx=e=>Rb.has(e)||zb.has(e)||e===`-.`,px=(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}}},mx=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
1784
+ `)}\n`},hx=(t,n,r=re(t,n===`tlapm`))=>{let i=n===`tlapm`,a=i?r:r.map(ee),o=0,s=[],l,u,d=[],f=/* @__PURE__ */ new Set,p=[],m=[],h=e=>d[d.length-1].has(e),g=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),_=[],v=[],y=[],b=(e,t=o-1)=>{let n=e===t?y[e]:void 0;if(n)return n;let r=a[t];_[e]??=g(a[e]),v[t]??={line:r.line,column:r.endColumn};let i={module:m[0].name,start:_[e],end:v[t]};return e===t&&(y[e]=i),i},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>a[Math.min(o+e,a.length-1)],S=(e=0)=>{let t=te(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie=0,ae=e=>{let t=a.slice(ie,o).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>i&&(e.kind===`Keyword`||lx.has(e.text)),C=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},se=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Zb.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:oe(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,w=(t,n=te(),r)=>{let i=a[a.length-1],o=n.line===i.line&&n.column===i.column;return new e.P(`${t} at line ${n.line}, column ${n.column}`,void 0,ce(t,n,o,r))},ce=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ae(C(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${se(r)}`,...C(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},le=(e,t=te())=>w(e,t,t),ue=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!oe(e),T=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},E=()=>{let e=S();if(e.kind===`End`)throw w(`Unexpected end of expression`);return o++,e},D=e=>T(e)?(o++,!0):!1,O=e=>{if(!T(e))throw le(`Expected ${JSON.stringify(e)} but found ${ne(S())}`);return E()},de=()=>{let e=S();if(e.kind!==`Identifier`)throw le(`Expected an identifier but found ${ne(e)}`);if(oe(e))throw le(`Unexpected keyword ${e.text}`);return o++,e.text},fe=()=>{let e=o;return{name:de(),range:b(e)}},pe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),me=()=>{let e=S();return e.kind!==`String`&&(Hb.has(e.text)||Rb.has(e.text)||Bb.has(e.text))?(o++,e.text):de()},he=!1,ge=()=>S().kind===`Identifier`||!ue(S())?de():(he=!0,E().text),_e=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},k=(e,t=`,`)=>{let n=[e()];for(;D(t);)n.push(e());return n},ve=()=>{if(T(`<<`)){let e=1;for(;S(e).kind===`Identifier`||T(`,`,e);)e++;return T(`>>`,e)&&T(`\\in`,e+1)}let e=0;for(;S(e).kind===`Identifier`;){if(T(`\\in`,e+1))return!0;if(!T(`,`,e+1))return!1;e+=2}return!1},ye=()=>{if(T(`::`))return!0;if(!T(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&T(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&T(`)`,e+1)&&T(`::`,e+2)},be=()=>{if(!D(`<<`)){let e=fe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=pe(T(`>>`)?[]:k(fe));return O(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},xe=()=>k(()=>{let e=k(be);O(`\\in`);let t=A();return e.map(e=>({pattern:e,set:t}))}).flat(),Se=()=>{let e=S();if(i&&lx.has(e.text)){let t=o;E();let n={kind:`Identifier`,name:e.text,location:g(e)};return{subscript:x(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||T(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(b(o,o)),n.push(de()),e&&T(`(`)?De():[]),s=[a(!i)];for(;T(`!`)&&S(1).kind===`Identifier`;)E(),s.push(a(!0));let c=s.slice(0,-1),l=g(e);l.range={...b(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(T(`<<`)||T(`(`)||T(`{`)||T(`[`)||t){let e=o,t=Le();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw le(`Expected a subscript but found ${ne(e)}`)},Ce=e=>{let t=S(1),n=S(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`&&T(`==`,Bb.has(n.text)?3:4))},we=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||T(`,`,1)||T(`)`,1)||t.kind===`Keyword`&&qb.has(t.text)||Ce(e)},Te=()=>{let e=S(),t=e.kind===`Operator`&&(Rb.has(e.text)||Vb.has(e.text))&&we(e);if(i&&e.kind!==`String`&&(Vb.has(e.text)||Gb.has(e.text)&&e.text!==`'`&&!zb.has(e.text)||Wb.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&we(e))throw w(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw w(`\\X may not be used as an infix operator`,e);if(t)return o++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:g(e)},o-1);if(e.kind!==`String`&&Gb.has(e.text)&&we(e)){o++;let t=g(e);if(zb.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:px(e.text,n,t),operator:e.text,location:g(e)},o-1)}if(T(`LAMBDA`)){let t=o;E();let n=pe(k(fe));O(`:`);let r=A();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:g(e)},t)}return A()},Ee,De=()=>_e(()=>{let e=o;O(`(`);let t=k(Te);return O(`)`),Ee=b(e),t}),Oe=()=>{let e=E();s.push(e.column);let t=[A()];for(;dx(te())&&te().text===e.text&&te().column===e.column;)o++,t.push(A());return s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:g(e)}},ke=e=>_e(()=>{let t=g(e),n=S().kind===`Identifier`,r=T(`|->`,1)&&(n||ue(S()));if(r||n&&T(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=g(S()),i=e();return n.range=b(t),O(r?`|->`:`:`),{name:i,value:A(),location:n}},a=[i(()=>n?de():E().text),...D(`,`)?k(()=>i(de)):[]];return O(`]`),{kind:e,fields:a,location:t}}if(ve()){let e=o,n=xe();if(!i||T(`|->`)){O(`|->`);let e=A();return O(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=A();if(D(`->`)){let e=A();return O(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(D(`EXCEPT`)){let e=k(()=>{O(`!`);let e=[];for(;T(`.`)||T(`[`);)if(D(`.`)){if(!ue(S()))throw le(`Expected a field name but found ${ne(S())}`);if(!i&&T(`@`))throw le(`@ used in !.@`);e.push({kind:`Field`,name:E().text})}else O(`[`),e.push({kind:`Index`,args:k(()=>A())}),O(`]`);return O(`=`),{path:e,value:A()}});return O(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!T(`]_`)){let e=[a];for(;D(`,`);)e.push(A());return O(`]`),{kind:`Bracket`,args:e,location:t}}return O(`]_`),{kind:`BoxAction`,action:a,subscript:Se().subscript,location:t}}),Ae=()=>{let e=o,t=x(ze(),e),n=g(E());return x({kind:`Apply`,operator:`\\in`,args:[t,A()],location:n},e)},je=e=>_e(()=>{let t=g(e);if(D(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ve()&&(S(1).text===`\\in`||T(`<<`))){let e=o,n=be();O(`\\in`);let r=A();if(D(`:`)){let e=A();return O(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=S().kind===`Identifier`&&T(`\\in`,1)?Ae():A();if(D(`:`)){let e=xe();return O(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;D(`,`);)r.push(A());return O(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Me=e=>{let t=g(e),n=_e(()=>T(`>>`)||T(`>>_`)?[]:k(()=>A()));if(D(`>>_`)){if(n.length!==1)throw w(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Se().subscript,location:t}}return O(`>>`),{kind:`Tuple`,elements:n,location:t}},Ne=e=>{let t=g(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ve()){let e=xe();return O(`:`),{kind:n,bounds:e,body:A(),location:t}}let i=pe(k(fe));return O(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:A(),isTemporal:r,location:t}},Pe=e=>{let t=[];do{let n=o;if(D(`OTHER`))return O(`->`),{kind:`Case`,arms:t,other:A(),otherRange:b(n),location:g(e)};let r=A();O(`->`),t.push({condition:r,body:A()})}while(D(`[]`));return{kind:`Case`,arms:t,other:void 0,location:g(e)}},Fe=()=>{let e=S(1);return T(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Kb.has(e.text)||e.kind===`Operator`&&(Rb.has(e.text)||Bb.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Hb.has(e.text))},Ie=()=>{let e=E();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 o--,{kind:`Bound`,args:De()}}return{kind:`Name`,name:e.text,args:T(`(`)?De():[]}},Le=e=>{let t=o,r=E(),a=g(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=k(de);return O(`:`),{kind:`Lambda`,params:e,body:A(),location:a}}if(r.kind===`Number`){if(i&&/^\\[BOH]/.test(r.text))throw w(`incomplete expression`,r);return{kind:`Number`,value:c(r.text),text:r.text,location:a}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&et(r);if(!i&&s&&Ze()<0&&Xe.length<=1)throw w(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw w(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let n=s?tt(r)??r.text:r.text;if(ye()){let o=pe(D(`(`)?k(fe):[]);o.names.length>0&&O(`)`),O(`::`);let s=b(t),c=A();if(!i&&e!==void 0&&l!==void 0&&ux(c)&&e.high>=l.low)throw w(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:n,params:o.names,paramRanges:o.ranges,head:s,body:c,location:a}}let c=T(`(`);if(n===`@`&&!c&&!Fe())return{kind:`ExceptAt`,location:a};let u=c?De():[],d=[c?Ee:void 0];if(!Fe())return c?{kind:`Apply`,operator:n,args:u,argumentsRange:Ee,location:a}:{kind:`Identifier`,name:n,location:a};let f=[{kind:`Name`,name:n,args:u}],p=[b(t,t)];for(;Fe();)E(),p.push(b(o,o)),Ee=void 0,f.push(Ie()),d.push(Ee);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??b(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&fx(r.text)&&T(`(`)){let e=De();return n===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&fx(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=_e(()=>A());return O(`)`),e}case`[`:return ke(r);case`{`:return je(r);case`<<`:return Me(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ne(r);case`IF`:{let e=A();O(`THEN`);let t=A();return O(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:A(),location:a}}case`CASE`:return Pe(r);case`LET`:{let e=[],t=[];for(d.push(/* @__PURE__ */ new Set);!D(`IN`);){if(i&&T(`RECURSIVE`))throw w(`Unexpected keyword RECURSIVE`,ae(te()));if(D(`RECURSIVE`)){qe();continue}let n=Ve(!i&&D(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}d.pop();let n=A();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=be(),t=D(`\\in`)?A():void 0;return O(`:`),{kind:`Choose`,pattern:e,set:t,body:A(),location:a}}case`WF_`:case`SF_`:{let e=Se(),t=!T(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:_e(()=>{O(`(`);let e=A();return O(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw le(`Unexpected ${ne(r)}`,r)},Re=(e,t,n)=>{l=u={low:t,high:n};let r=A(i?Math.min(n+1,Ib.low):n+1),a=S(),o=Bb.has(a.text)?Ib.high:Rb.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw w(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},ze=()=>{let e=u;u=void 0;let t=S(),n=g(t);if(t.kind===`Operator`&&dx(t))return Oe();if(i&&Rb.has(t.text)&&T(`(`,1)){let e=o,r=_e(()=>{E(),E();let r=A();if(!D(`,`))return;let i=A();O(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return x(a,e)});if(r!==void 0)return r;o=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return E(),{kind:`Apply`,operator:`~`,args:[Re(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!i)break;return E(),{kind:`Apply`,operator:`-.`,args:[Re(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return E(),px(t.text,Re(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return E(),{kind:`Apply`,operator:t.text,args:[i?A(9):Re(t,10,13)],location:n}}return Le(e)},A=(e=0)=>{let t=o,n=ze(),r=n.location.range?n:x(n,t),a;for(;;){let n=S();if(n.kind!==`Operator`)break;let o=g(n);if(n.text===`'`&&e<=15){E(),l=Ib,r=x({kind:`Prime`,expression:r,location:o},t);continue}if(zb.has(n.text)&&e<=15){E(),l=Ib,r=x({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r],location:o},t);continue}if(n.text===`[`){E();let e=_e(()=>k(()=>A()));_e(()=>O(`]`)),l=Lb,r=x({kind:`FunctionApplication`,function:r,args:e,location:o},t);continue}if(n.text===`.`&&ue(S(1))){E();let e=E().text;r=x({kind:`FieldAccess`,record:r,field:e,location:o},t);continue}let s=Rb.get(n.text);if(!s||s.low<e)break;if(a){let e=!(a.low>s.high||a.high<s.low),t=a.text===n.text&&s.isAssociative;if(e&&!t&&(a.text!==`\\X`||n.text!==`\\X`))throw w(`Precedence conflict between ${a.text} and ${n.text}`,n)}if(E(),!i&&s.low>12&&T(`-`))throw w(`Precedence conflict between ${n.text} and -`,S());l=u=s;let c=A(s.high+1);if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,i=[b(t).end];r=r.kind===e&&a?.text===n.text?{...r,operands:[...r.operands,c],prefixEnds:[...r.prefixEnds??[],...i]}:{kind:e,operands:[r,c],prefixEnds:i,location:o}}else r=n.text===`\\X`?r.kind===`Product`&&a?.text===`\\X`?{...r,factors:[...r.factors,c]}:{kind:`Product`,factors:[r,c],location:o}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r,c],location:o};r=x(r,t),a={...s,text:n.text}}return r},Be=()=>{if(!D(`(`))return[];let e=M();return O(`)`),e},j=()=>{let e=g(S()),t=A(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:m[0].name,start:e,end:r}}},Ve=e=>{let t=o;return x(Ue(e),t)},He=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Ue=e=>{let t=S(),n=o,r=g(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,o-2),...j(),isLocal:e,isRecursive:h(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&Rb.has(S(1).text)&&S(2).kind===`Identifier`&&T(`==`,3)){let e=fe(),t=E().text,n=fe();return O(`==`),i(t,[He(e),He(n)])}let a=t.kind!==`String`&&Hb.has(t.text),s=t.kind===`Identifier`&&Bb.has(S(1).text)&&T(`==`,2);if(a||s){let e=a?t.text:S(1).text;a&&E();let n=fe();return s&&E(),O(`==`),i(e,[He(n)])}let c=de();if(D(`[`)){let t=_e(()=>xe());return O(`]`),O(`==`),{kind:`Function`,name:c,bounds:t,body:A(),isLocal:e,isRecursive:h(c),location:r}}let l=o,u=Be();return O(`==`),T(`INSTANCE`)?{...We(c,u,e,r),definitionRange:b(l)}:i(c,u)},We=(e,t,n,r)=>{let i=o;return O(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ge(),substitutions:D(`WITH`)?k(()=>{let e=o,t=me(),n=b(e);return O(`<-`),{name:t,nameRange:n,expression:Te()}}):[],isLocal:n,location:r,instanceRange:b(i)}},Ge=()=>{let e=o;return x(Ke(),e)},Ke=()=>{let e=g(S());if(T(`_`)&&S(1).kind===`Operator`)return E(),{name:E().text,arity:D(`_`)?2:1,location:e};if(S().kind!==`String`&&(Hb.has(S().text)||i&&S().kind===`Operator`)&&T(`_`,1)){let t=E().text;return E(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=de();if(!D(`(`))return{name:t,arity:0,location:e};let n=k(()=>O(`_`));return O(`)`),{name:t,arity:n.length,location:e}},M=()=>k(Ge),qe=()=>{let e=M();return e.forEach(e=>d[d.length-1].add(e.name)),e},Je=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&sx.has(e.text)&&t++,e.kind===`Operator`&&cx.has(e.text)&&t--,n++}while(t>0);return n},Ye=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?T(`(`,1)||T(`[`,1)?T(`==`,Je(1)):t.kind===`Operator`&&Bb.has(t.text)?T(`==`,2):t.kind===`Operator`&&Rb.has(t.text)?S(2).kind===`Identifier`&&T(`==`,3):T(`==`,1):e.kind!==`String`&&Hb.has(e.text)&&t.kind===`Identifier`&&T(`==`,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=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},et=e=>!e.text.endsWith(`.`)&&!Qb.has($e(e)),tt=e=>{let t=$e(e);if(Qb.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 Yb.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},it=e=>!f.has(e)&&m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),at=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!lx.has(e.name)&&!it(e.name):!1,ot=()=>{let e=S();return e.kind===`Step`?et(e):e.kind===`Keyword`?ix.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},st=()=>{let e=o,t=S();return t.kind===`Operator`&&!Ub.has(t.text)&&fx(t.text)?(o++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:g(t)},e)):D(`MODULE`)?x({kind:`ModuleFact`,name:de(),location:g(t)},e):A()},ct=e=>p[p.length-1]?.add(e),lt=e=>{p.push(/* @__PURE__ */ new Set);let t=e();return p.pop(),t},ut=e=>p.some(t=>t.has(e))||m.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),dt=()=>{let e=o,t=S(),n=k(()=>{let e=S();if((e.kind!==`Identifier`||oe(e))&&e.kind!==`Operator`)throw le(`Expected a definition name but found ${ne(e)}`,e);return o++,e.text},`!`),r=g(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},ft=()=>{if(i)return k(dt);let e=k(st),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ut(e.name)):void 0;if(t)throw w(`DEF clause entry should describe a defined operator`,t.location);return e},pt=()=>{let e=ot()?k(st):[],t=D(`DEF`)||D(`DEFS`);if(i&&e.length===0&&!t)throw le(`Expected a fact`);return{facts:e,defs:t?ft():[]}},mt=()=>{let t=o,r=E(),i=r.text===`USE`&&D(`ONLY`),a=b(t),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...pt(),keyword:a,location:g(r)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!at(e)):[];if(c.length>0)throw e.K(c.map(n=>({location:e.Y(n.location.range??b(t)),message:`The only expression allowed as a fact in a HIDE is
1785
+ the name of a theorem, assumption, or step.`})));return x(s,t)},ht=()=>{let e=o,t=g(S()),n=D(`NEW`),r=i?o:e,a=i?g(S()):t,s=S().kind===`Keyword`?ax.get(S().text):void 0;if(!n&&s===void 0)throw le(`Expected a declaration but found ${ne(S())}`);if(s!==void 0&&E(),s===`Variable`){let e=fe();return ct(e.name),x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=Ge();ct(c.name);let l=(s??`Constant`)===`Constant`&&T(`\\in`);if(l&&c.arity>0)throw w(`declared symbol with arguments before \\in`);return l&&E(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?A():void 0,nameRange:c.location.range,location:a},r)},gt=()=>{let e=o,t=g(O(`ASSUME`)),n=k(()=>(S().kind===`Identifier`&&T(`::`,1)&&T(`ASSUME`,2)&&(E(),E()),T(`ASSUME`)?lt(gt):S().kind===`Keyword`&&ox.has(S().text)?ht():A()));return O(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:A(),location:t},e)},_t=e=>{let t=0;for(;S(t).kind===`Identifier`&&T(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&T(e,t+1)},vt=(e,t)=>{e.forEach(ct),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(ct))},yt=()=>{let e=S();if(T(`USE`)||T(`HIDE`))return mt();if(T(`INSTANCE`)){let t=o;return x(We(void 0,[],!1,g(e)),t)}if(T(`DEFINE`)||Ye()){let t=o;D(`DEFINE`);let n=[Ve(!1)];for(;Ye();)n.push(Ve(!1));let r={kind:`Define`,definitions:n,location:g(e)};return x(r,t)}if(D(`HAVE`))return{kind:`Have`,expression:A()};if(D(`TAKE`)){let e=ve(),t=pe(e?[]:k(fe)),n=e?xe():[];return vt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(D(`WITNESS`))return{kind:`Witness`,expressions:k(()=>A())};if(D(`PICK`)){let e=_t(`:`),t=pe(e?k(fe):[]),n=e?[]:xe();return vt(t.names,n),O(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:A()}}return D(`CASE`)?{kind:`Case`,expression:A()}:{kind:`Assert`,isSuffices:D(`SUFFICES`),statement:T(`ASSUME`)?gt():A()}},bt=e=>{let t=S();if(t.kind!==`Step`)throw le(`Expected a step number but found ${ne(t)}`,t);if(!rt(t))throw w(`${e?`QED step`:`step`}'s number has bad level`,t);if(n!==`sany`&&Qe(t)<0&&tt(t)!==void 0)throw w(`<*> and <+> cannot be used for a named step`,t);return o++,{name:tt(t),token:t.text,location:g(t)}},xt=()=>{let e=o,t=bt(T(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;p.push(r);let i=D(`QED`)?{kind:`Qed`}:yt(),a=b(e),s=b(n),c=nt(S());if(c&&!Xb.has(i.kind))throw w(`Proof of a step that does not take a proof`);let l=c?wt():void 0;return p.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ct),x({...t,body:i,head:a,statement:s,proof:l},e)},St=e=>{if(D(`BY`)){let t=b(o-1);return{kind:`By`,isOnly:D(`ONLY`),...pt(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;E();let n=b(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Ct=()=>{let e=g(S());D(`PROOF`);let t=St(e);if(t)return t;let n=[xt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(xt());return{kind:`Steps`,level:Ze(),steps:n,location:e}},wt=()=>{let e=o;Xe.push(-1);let t=lt(Ct);return Xe.pop(),x(t,e)},Tt=()=>S().kind===`Step`||S().kind===`Keyword`&&Yb.has(S().text),Et=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return nx(e);let n=t.defs[t.defs.length-1]?.location.range;return tx(nx({...e,end:e.start}),nx(n??t.keyword))},Dt=()=>{let e=o,t=g(S()),n=D(`PROOF`),r=St(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:nx(t.keyword),first:e,end:o-1}}let i=S();if(i.kind!==`Step`)throw le(`Expected a step number but found ${ne(i)}`);let a=o;E();let s=o,c=D(`QED`)?{kind:`Qed`}:yt(),l=b(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:Et(l,c),first:e,start:a,end:o-1}},Ot=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=kt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...g(a[i.first]),range:b(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},kt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw rx(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw rx(`Expecting a proof step but found a${$b[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw rx(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw rx(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:Qe(a.token);if(s<n||!i&&s>n)return;let c=Xb.has(a.body.kind)?Ot(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:tt(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...g(a.token),range:b(a.start,l)}},d=tx(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=kt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:tx(d,f.span)}},At=()=>{if(!Tt())return;let e=[];for(;Tt();)e.push(Dt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Ot(e,0,0,t.span),r=e[n.next];if(r)throw rx(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},jt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Mt=()=>{if(S().kind!==`Identifier`||!T(`==`,1))return;let e=de();return f.add(e),E(),e},N=e=>{let t=o,n=E(),r=Mt(),a=lt(()=>{let e=T(`ASSUME`)?gt():A();return i?{statement:e,proof:At()}:{statement:e,proof:nt(S())?wt():void 0}}),s=a.statement,c=x({name:r,statement:s,proof:a.proof,location:g(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&jt(e,r,s,c.location)},Nt=()=>{let e=o,t=E(),n=Mt();return x({name:n,expression:A(),isAxiom:t.text===`AXIOM`,location:g(t)},e)},Pt=()=>{let e=g(O(`----`));O(`MODULE`);let t=ge();O(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(m.push(n),d.push(/* @__PURE__ */ new Set),D(`EXTENDS`)&&k(()=>{let e=o;n.extends.push(ge()),n.extendsRanges.push(b(e))});;){let t=o;ie=t;let r=S();if(r.kind===`ModuleEnd`)return e.range={module:m[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},m.pop(),d.pop(),n;if(r.kind===`Separator`){if(T(`MODULE`,1)){let e=Pt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),O(`====`);continue}E()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=g(E()),r=M();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=g(E()),r=k(()=>{let e=o,t=g(S());return x({name:de(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Nt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&jt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(T(`USE`)&&T(`ONLY`,1))throw le(`Expected a module unit but found ${ne(r)}`);let e=mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=g(E()),r=qe();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Ft(n,x(We(void 0,[],!1,g(r)),t));continue;case`LOCAL`:if(E(),T(`INSTANCE`)){Ft(n,x(We(void 0,[],!0,g(r)),t));continue}Ft(n,x(Ue(!0),t));continue}r.kind===`Keyword`&&Jb.has(r.text)?N(n):Ft(n,Ve(!1))}}},Ft=(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}))},It=Pt(),Lt=he?Fb(t):void 0;if(Lt!==void 0)throw new e.P(Lt);return It},gx=e=>hx(e,`tlc`),_x=(e,t)=>hx(e,`tlc`,t),vx=e=>hx(e,`tlapm`),yx=e=>hx(e,`sany`),bx=`$subexpression`,xx=(t,n)=>new e.P(`${t} at line ${n.line}, column ${n.column}`),Sx=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Sx(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of A(e)){let e=Sx(r,t,n);if(e)return e}},Cx=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),wx=(e,t)=>{let n=e.location,r=Cx(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 xx(`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 xx(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:bx,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:bx,args:e.args,location:n,resolution:gs},location:n}},Tx=(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:gs})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:gs}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:gs};return wx({...t,params:[...t.params,...r]},a)},Ex=(t,n,r,i)=>{let a=r.location,o={params:[],args:[],lets:[],location:a},s=0,c,l=!1,u=(n,i)=>{if(!n)throw xx(i,a);vs.set(r,{args:t.slice(0,s).flatMap(e=>`args`in e?e.args:[]),error:{location:e.Y(n),message:i}}),l=!0},d=e=>{let r=[],i=[];for(;s<t.length;){let o=t[s];if(o.kind!==`Name`)throw xx(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=e?e.find(e=>Bc(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s++}throw xx(`Unknown operator ${r.join(`!`)}`,a)},f=e=>{let n=d(e),l=n.definition,f=Cs(l),p=s===t.length-1;if(n.args.length!==f&&(!i||n.args.length!==0))return u(r.argumentRanges?.[s]??a.range,`The operator ${n.name} requires ${f-n.earlier} arguments.`);if(p)return{definition:l,args:n.args};if(l.kind!==`Operator`)throw xx(`Cannot select a subexpression of ${l.name}`,a);o.params.push(...l.params),o.args.push(...n.args),c=l.body,s++},p=()=>{for(;s<t.length&&!l;){let e=t[s];if(e.kind!==`Name`)return;let n=r.selectorRanges?.[s],a=c&&Sx(c,e.name,[]);if(!a)return u(n,`Cannot find label \`${e.name}'.`);let l=a.label.params;if(!i&&e.args.length!==l.length)return u(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),c=a.label.body,s++}},m=e=>{if(!c)throw xx(`Subexpression selection failed`,a);if(e.kind===`Colon`)return;if(c.kind===`Label`){c=c.body,m(e);return}if(c.kind===`Let`){if(e.kind!==`Operand`||Ws(e.operand,1)!==0)throw xx(`A LET/IN expression has only one operand`,a);o.lets.push(c.definitions),c=c.body;return}let n=Js(c);if(n&&(e.kind===`Bound`||e.kind===`At`)){o.params.push(...n.names.map(e=>({name:e,arity:0}))),e.kind===`Bound`&&o.args.push(...e.args),c=n.body;return}if(c.kind===`Case`&&e.kind===`Operand`){let n=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]],r=n[Ws(e.operand,n.length)],i=t[s+1];if(!r||i?.kind!==`Operand`)throw xx(`A subexpression of CASE must have the form !i!j`,a);s++;let o=Ws(i.operand,2),l=o===0?r.condition:o===1?r.body:void 0;if(!l)throw xx(`Nonexistent CASE operand`,a);c=l;return}if(e.kind!==`Operand`)throw xx(`Unexpected subexpression selector`,a);let r=n?n.sets:Ys(c),i=r?.[Ws(e.operand,r.length)];if(!i)throw xx(`Nonexistent operand specified by the selector`,a);c=i},h=f(void 0);if(l)return r;if(h)return Tx(h.definition,{...o,args:h.args});for(p();s<t.length&&!l;){let e=t[s];if(e.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)throw xx(`A name selector here must be from a LET clause`,a);o.lets.push(c.definitions);let e=f(c.definitions);if(l)return r;if(e)return Tx(e.definition,{...o,args:[...o.args,...e.args]});p()}else m(e),s++}if(l)return r;if(!c)throw xx(`Subexpression selection failed`,a);return wx(o,c)},Dx=(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 Gs(e,t,n)},Ox=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||A(e).some(Ox),kx=(e,t,n,r=!1)=>{if(!Ox(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Uc(e,e=>kx(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>Ax(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)=>kx(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Uc(e,e=>kx(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Dx(a.name,[],void 0,t):a.kind===`Apply`?Dx(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Ex(o,t,a,r);return c!==a&&_s.add(c),c},Ax=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:kx(e.expression,t,n,!0)}))}),jx=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Mx=(e,t)=>Ax(e,jx(t.definitions),()=>!1),Nx=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=jx([...t,...e.definitions]),a=e=>n.has(e),o=jx([...t,...e.definitions,...r]),s=e=>kx(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>kx(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return Ax(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?Ax(e,i,c):Hc(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>Ox(e.body))||e.assumptions.some(e=>Ox(e.expression))?{...h,definitions:e.definitions.map(e=>Hc(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},Px=(e,t)=>e.maxLevels[t]??3,Fx=t=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Ql({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=>Ol(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Ol(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>kl(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Tl(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)&&Ol(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($l(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.Y(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),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.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;if(r)for(let t=0;t<e.arity;t++){let i=l.argConstraints.get(Cl(e.name,t));i!==void 0&&Px(r,t)<i&&s(`Level error in instantiating module '${n.module}':\nThe level of the argument ${t+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let t=Tl(e),r=f.find(e=>e.name===t.operator)?.operator,i=f.find(e=>e.name===t.param);if(!r||!i)return;let a=Px(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.K([...i.values()])}},Ix=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Lx=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Rx=new Map(_f.flatMap(e=>e.map(t=>[t,e[0]]))),zx=e=>Rx.get(e)??e,Bx=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},Vx=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:Ve(e)&2147483647,kind:t,isLocal:n}),Hx=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:zx(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:zx(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},Ux=(e,t)=>{let n=[];for(let r=t;;){let t=Hx(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Wx=e=>({line:e.line,column:e.column}),Gx=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=Ux(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},Kx=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,qx={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Jx=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Kx(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Kx(e[n+1],e[n+2])?n+=Kx(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=>qx[e])}"`:r.text)}return t},Yx=e=>e[2]?.text,Xx=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},Zx=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Zx(e.modules,t)).find(Boolean),Qx=e=>{let t=e===void 0?[]:re(e),n;return{tokens:t,ranges:Xx(t),getModule:()=>n??=e===void 0?gx(``):_x(e,t)}},$x=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=Qx(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??xf.get(i)??wf.get(i)??mx(e,i),c=a(s),l=c.tokens,u=c.ranges.get(Yx(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>Zx(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},eS=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=Ux(t,e+1);i.push({location:Wx(t[e]),apply:e=>r.forEach(t=>e.put(Vx(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:Wx(n),apply:t=>t.put(Vx(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&Ux(t,u+1).every(e=>s.has(e))&&o(u,`definition`),Lx.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(Wx(n)),i.push({location:Wx(n),apply:e=>e.put(Vx(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(Vx(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=zx(e.name);i.push({location:e.location,apply:n=>n.put(Vx(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(Vx(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Vx(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ss(e.location,t.location)?-1:+!!Ss(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=Bx();n.set(i??``,o),gf.toReversed().forEach(e=>o.put(Vx(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},tS=(t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};n.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),vf.forEach(i);let o=e=>{let n=t(e);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=Gx(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;Jx(o(void 0)).forEach((e,t)=>{t===3&&bf.forEach(i),i(e)});let y=l(void 0);for(;;){let n=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!n)break;let[r,a]=n;if(d.add(`${r.key}>${a}`),v.set(r.unit,[...v.get(r.unit)??[],a]),!_.has(a)){if(_.add(a),t(a).tokens.length===0){let n=r.unit??Yx(t(void 0).tokens);throw e.G(a,n)}Jx(o(a)).forEach(i)}}Ix.forEach(i);let b=/* @__PURE__ */ new Set,ee=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return ee(void 0),yf.forEach(i),[...r]},nS=(e,t)=>{let n=$x(e,t),r=n.getParsed,i,a=()=>i??=eS(r);return{getStringOrder:e=>tS(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},rS=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),iS=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],aS=(t,n,r)=>{try{return r.parseModule(t)}catch(r){if(!(r instanceof e.P))throw r;let i=Fb(t);throw i===void 0?r:e.K([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},oS=t=>new e.P(`Multiply-defined module '${t.name}' at line ${t.location.line}, column ${t.location.column}`),sS=(t,n)=>t.location.range&&n.location.range&&{location:e.Y(t.location.range),message:`Multiply-defined module '${t.name}': this definition or declaration conflicts \nwith the one at ${e.Y(n.location.range)}.`},cS=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,lS=e=>e===`Theorem`?`ThmOrAssumpDefNode`:cS(e),uS=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:sl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),dS=(e,t)=>{let n=Be(e);return n!==void 0&&t.has(n)||A(e).some(e=>dS(e,t))},fS=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(nl(e),n.get(e)??n.size)),n},pS=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),mS=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw fh(e);if(e.kind===`Number`&&!Rt(e.value))throw ph(e);mS(e.kind===`Let`?[...A(e),...pS(e.instances??[])]:A(e))}),hS=(t,n)=>{let r=n.order??nS(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Set,u=new Map(Ff.map(e=>[e.name,e])),d=/* @__PURE__ */ new Map,f=Ud(t.checkDeadlock,n.seed);f.isWarningEnabled=n.isWarningEnabled??!0,f.isTool=n.isTool??!1,f.version=n.version??`master`;let p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=[],g=/* @__PURE__ */ new Map,_=[],v=[],y=(e,t)=>_.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),b=0,ee=e=>`${e}#${b++}`,x=[],te=[],S=Fx(e=>{let t=m.get(e)??ce(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),ne=/* @__PURE__ */ new Map,re=/* @__PURE__ */ new Map,ie=/* @__PURE__ */ new Map,ae=e=>{let t=d.get(e);if(t)return t;let r=rp(e,n.print,f,n.files,u);if(!r)return;tp.get(e)?.forEach(ae);let i=/* @__PURE__ */ new Map;return np.get(e)?.forEach(e=>ae(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{u.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:bl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Sl(e,t.name)??i.get(t.name)?.range})}),d.set(e,i),i},oe=e=>{let t=tp.get(e)??[];if(e===`TLCExt`||[e,...t].some(e=>n.loadModule?.(e)!==void 0))return;let r=ae(e);return r&&y(e,t),r&&t.includes(`Integers`)&&ae(`Integers`),r},C=e=>(mS([...e.definitions.flatMap(ze),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...pS(e.instances)]),e.modules.forEach(C),e);C(i);let se=(t,i)=>{let a=n.loadModule?.(t)??Ef(f.version).get(t)??mx(n.source,t);if(a===void 0)throw e.G(t,i);let o=aS(a,t,r);if(o.name!==t)throw e.K([{location:`Unknown location`,message:`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`}],!0);return C(o)},w=t=>{let n=v.indexOf(t.name);if(n!==-1){let r=[...v.slice(n),t.name].map(e=>`${e}.tla`);throw new e.P(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];v.push(t.name),_.push(r);let s=pe(t,{id:t.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:te,levelChecks:o});if(_.pop(),v.pop(),a.length>0)throw e.K(a,!1,void 0,te);let c=i.find(e=>r.has(e.name)),l=c&&p.get(c.name),u=l&&sS(c,l.module);if(u)throw e.K([u],!1,void 0,te);if(c)throw oS(c);return o.forEach(e=>e()),{linked:s,closure:r}},ce=(t,r)=>{let i=p.get(t);if(i)return y(t,g.get(t)??[]),i;let o=w(se(t,r)),s=/* @__PURE__ */ new Map;return ep(t,n.print,f,n.files,u,(t,n,r)=>{let i=s.get(t),a=n.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(i?.kind!==`Operator`||!r||a.length!==n.length)throw new e.b(`No definition of ${t} to fall back to`);return W(i.body,{environment:r.environment,scope:yg(ag(i),a,r),state:r.state,next:r.next,isKeepLazy:r.isKeepLazy})})?.forEach(e=>{let n=o.linked.visible.get(e.name);if(n?.kind!==`Definition`||n.arity!==e.arity&&rS.has(t))return;let r=a.get(n.key);r&&s.set(e.name,r),u.set(n.key,e),a.delete(n.key)}),p.set(t,o.linked),g.set(t,o.closure),y(t,o.closure),o.linked},le=(e,t,n,r,i)=>{let u=i?void 0:oe(e.module);if(u)return ue(e,u);let d=i??ce(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=iS(d),p=`#${b++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=jc(Mx(e,t),f,t,n);x.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>l.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=hl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,Lc(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,l)=>{let u=ee(`${i}@${t.name}`),d=l(u);return a.set(u,d),f.length>0&&c.add(d),e.name!==void 0&&re.set(u,`${e.name}!${re.get(n)??i}`),o.set(u,!r),s.set(u,{source:n,prefix:e.params.length}),u},createName:ee,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return T(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ne.set(r,{name:n,location:e.location}),e.name!==void 0&&ie.set(r,n),r})},ue=(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}])),T=(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:o.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}]}))},E=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),D=(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=E(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:cl(r,n),location:n}}},O=(e,t,n,r)=>{let i=e.location,s=r?void 0:oe(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=E(n.arity);return ll(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??ce(e.module,n),l=`#${b++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=iS(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};x.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>dS(f(e),p),h=d.map(t=>{let n=D(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],_=hl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:cl(e.params,i),location:i,resolution:gs}:sl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>o.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}:uS(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),a=E(n.arity),o=[...e.params,...a];return ll(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},de=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),fe=/* @__PURE__ */ new Map,pe=(t,r)=>{let s=my(t,n.loadClass?.(t.name),t===i);fe.set(t.name,s.overrides);let c=s.module,l=x.length,u=new Map([...Ff.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:Ec,errors:[],warnings:[]},p=[f],g=t=>t.forEach((t,n)=>{let r=_.get(n);if(!r){u.set(n,t),_.set(n,t);return}if(!r.range||!t.range||e.Y(r.range)===e.Y(t.range))return;let i=e.Y(t.range),a=e.Y(r.range);lS(r.kind)===lS(t.kind)?f.warnings.push({location:i,message:`Warning: the ${cS(r.kind)} of '${n}' conflicts with \nits ${cS(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${cS(t.kind)} of '${n}' conflicts with \nits ${cS(r.kind)} at ${a}.`})}),_=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,b=[],ee=[...c.constants],ne=c.variables.filter((e,t)=>c.variables.findIndex(t=>t.name===e.name)===t),re=ne.map(e=>e.name),ae=ne.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:oe(e);if(n){g(n);return}let i=t??ce(e,c.name);ee.push(...i.constants.filter(e=>ee.every(t=>t.name!==e.name)&&!re.includes(e.name))),i.variables.forEach((e,t)=>{re.includes(e)||ee.some(t=>t.name===e)||(re.push(e),ae.push(i.variableLocations[t]))}),g(i.exported),i.facts.forEach(e=>v.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),b.push(i)});let C=new Map(u),se=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],w=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});se.forEach(e=>_.set(e.name,w(e)));let E=e=>({key:me(e),arity:Cs(e),params:ws(e),kind:Dc(c,e)?`Theorem`:`Definition`,range:e.location.range}),D=ee.length===0&&re.length===0,me=e=>c===i?e.name:`${e.name}@${r.id}`,he=/* @__PURE__ */ new Map,ge=()=>new Map([...r.modules,...y]),_e=e=>{let t=c.modules.find(t=>t.name===e.module);return t?Ss(t.location,e.location)?y.get(t.name):void 0:ge().get(e.module)},k=e=>({imported:u,getInstance:e=>{let t=_e(e),n=t?void 0:oe(e.module);if(n)return{declarations:[],symbols:ue(e,n),instancer:c.name};let r=t??ce(e.module,c.name),i=iS(r);return{declarations:i,symbols:T(e,r.exported,i,e=>e),instancer:c.name}},bound:C,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:me,instanced:he,facts:v,reports:p,warnings:r.warnings}),ve=e=>[...se.filter(t=>Ss(t.location,e)).map(e=>[e.name,w(e)]),...c.definitions.filter(t=>Ss(t.location,e)).map(e=>[e.name,E(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),ye=e=>{let t=ge(),n=t.get(e.name),i=n&&sS(e,n.module);if(n&&!i)throw oS(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=pe(e,{id:`${r.id}/${e.name}`,symbols:ve(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=le(e,c,k(c),D,ge().get(e.module));he.set(e,t),t.forEach((t,n)=>{u.has(n)||(d.set(n,e.location),u.set(n,t),e.isLocal||_.set(n,t))})}})),...c.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>Ss(e.location,t.location)?-1:1).forEach(e=>e.link());let be=Nx(yl(c,(e,t)=>O(e,t,c.name,_e(e))),de(u));r.errors.push(...Nc(be,k(be))),be.definitions.forEach(e=>{let t=me(e);a.set(t,e),o.set(t,!D);let n=E(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ss(r,e.location))&&(u.set(e.name,n),e.isLocal||_.set(e.name,n))});let xe={module:be,constants:ee,variables:re,variableLocations:ae,visible:u,exported:_,modules:y,extended:b,facts:/* @__PURE__ */ new Set([...v,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};m.has(c.name)||m.set(c.name,xe);let Se=x.splice(l).map(e=>({location:e.location,check:()=>S(e)}));return r.levelChecks.push(()=>eu(be,{constants:new Set(ee.map(e=>e.name)),variables:new Set(re),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>ie.get(u.get(e)?.key??e)},Se,te)),h.push(xe),xe},me=w(i).linked,he=n.traceFile,ge=he===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:he}}],_e=[...n.moduleOperators??[],...ge].map(e=>{let t=ce(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});h.push(...h.splice(h.indexOf(me),1)),te.length>0&&!n.isSanyReported&&n.print(e.X(te)),me.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),_e.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let k=[],ve=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ve(e,t)),k.push(...e.module.assumptions))};ve(me,/* @__PURE__ */ new Set);let ye=me.constants.map(e=>e.name),be=me.variables,xe=ty(t,{root:me,moduleSymbols:new Map([...d,...[...p].map(([e,t])=>[e,t.visible]),[i.name,me.visible]]),definitions:a,builtins:u,copySources:s,operatorConstants:new Map(_e.flatMap(e=>ce(e.module,i.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:r}),Se=xe.constants,Ce=xe.substitutions;he!==void 0&&u.forEach((e,t)=>{let n=Bf(e);n&&u.set(t,n)});let we=fS(be,h.flatMap(e=>e.module.variables.map(e=>e.name))),Te=fu({definitions:a,substitutions:Ce,constants:Se,variableIndex:we,builtins:u,variables:be}),Ee={runtime:f,definitions:a,builtins:u,constants:Se,substitutions:Ce,instanceNames:re,variables:be,variableIndex:we,facts:Te,startupValues:Array.from({length:Te.ids.size},()=>void 0),substitutedDefinitions:c,instanceParams:l,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},De=Ql({constants:new Set(Se.keys()),variables:/* @__PURE__ */ new Set([...be,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>u.has(e))]),getDefinition:e=>Dh(e,Ee)}),Oe=t=>{try{W(t,{environment:Ee,scope:void 0,state:void 0,next:void 0});return}catch(t){if(t instanceof e.b)return t;throw t}};Ce.forEach((t,n)=>{let r=a.get(t),i=ye.includes(n)&&r?.kind===`Operator`&&r.params.length===0&&De.analyzeDefinition(r,/* @__PURE__ */ new Map).level>0?Oe(r.body):void 0;if(i){let r=it(i)?``:` - specifically: ${i.message}`;throw new e._(`The configuration file substitutes constant ${n} with non-constant ${t}${r}`)}}),f.version!==`1.7.4`&&(f.isStarted=!0);let ke=new Set(h.flatMap(e=>e.module.instances.map(e=>e.module))),Ae=r.createDefinitionOrder();return{environment:Ee,assumptions:k,variableLocations:me.variableLocations,instanceActions:ne,startupDefinitions:h.filter(e=>!ke.has(e.module.name)||iS(e).length===0).flatMap(e=>Ae(e===me?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:h.flatMap(e=>fe.get(e.module.name)??[]),moduleOperators:_e,rootName:i.name}},gS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),_S=(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},vS=t=>e.it(new e.b(`${e.W}${t}`),e.tt.error),yS=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Ft(e)||!Ft(i))throw vS(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},bS=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${xS(t)}`:n},xS=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(xS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${bS(e.pattern,e.set)}:${xS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(xS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${xS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>bS(e.pattern,e.set)).join(`,`)}|->${xS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(xS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},SS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,CS=(t,n,r)=>{let i=n.definitions.get(t);if(i===void 0&&!n.constants.has(t))throw new e._(`The symmetry function ${t} specified in the configuration file\nis not defined in the specification.`);if(i?.kind!==`Operator`||i.params.length>0)throw vS(`The symmetry function ${t} must specify a set of permutations.`);let a=e=>W(e,{environment:n,scope:void 0,state:void 0,next:void 0}),o=a(i.body);if(!N(o)||!P(o))throw vS(`The symmetry operator must specify a set of functions.`);let s=F(o).elements;if(!s.every(Pt))throw vS(`The symmetry values must be function records.`);let c=i.body,l=c.kind===`Apply`?c.args:c.kind===`SetEnumeration`?c.elements:[],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=xS(SS(e)?e.args[0]:e);return u.get(t)??t}),r=e.length>1;n.runtime.warn(qe.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;s.map(yS).forEach(e=>{e.size>0&&f.set(gS(e),e)});let p=[...f.values()],m=0;for(;m<f.size;){let e=[...f.values()],t=e.length;p.forEach(n=>e.slice(m,t).forEach(e=>{let t=_S(n,e),r=gS(t);t.size>0&&!f.has(r)&&f.set(r,t)})),m=t}let h=new Set([...f.values()].flatMap(e=>[...e.values()].map(e=>e.name))),g=new Set(r.map(e=>e.name));if(d(l.filter(e=>{if(!SS(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||g.has(t.name))return!1;let n=a(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>Ft(e)&&h.has(e.name))})),f.size!==0)return[...f.values()]},wS=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=ES(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(ES(e[r],t));return a}},TS=(e,t)=>{let n=[],r=[];for(let i of e){let e=ES(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(xn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(xn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},ES=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=TS(e.elements,t);return n?En(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=wS(n.domain,t),i=wS(n.range,t)??n.range;if(r){let e=Cr(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?On(n.domain,e.range):e}return i===n.range?n:On(n.domain,i)}if(n===`Interval`||!N(e)||!P(e))return e;let r=F(e),i=wS(r.elements,t);return i?_r(i):r},DS=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=ES(e[o],i),a===0&&(a=xn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},OS={line:0,column:0},kS=e=>({kind:`Identifier`,name:e,location:OS}),AS=e=>({name:e,expression:kS(e),scope:void 0}),jS=/* @__PURE__ */ new Set([`name`,`property`]),MS=(t,n,r)=>{let i=Dh(n,r);if(!i)throw new e._(`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._(jS.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},NS=e=>e.body.kind===`Number`||e.body.kind===`String`,PS=(t,n,r)=>{if(r.constants.has(t))return r.constants.get(t);if(hu(n,r)&&!NS(n))try{return W(kS(t),iC(r,void 0,void 0))}catch(t){if(t instanceof e.b||e.et(t))return;throw t}},FS=(t,n,r)=>{if(r.constants.has(n))throw new e._(`The ${t} ${n} cannot be a constant.`);let i=MS(t,n,r);if(PS(n,i,r)!==void 0)throw new e._(`The ${t} ${n} cannot be a constant.`);return i},IS=(t,n,r)=>{let i=r.constants.has(n)?void 0:MS(t,n,r),a=i?PS(n,i,r):r.constants.get(n);if(a!==void 0&&a!==!0)throw new e._(`The ${t} of ${n} is equal to ${L(a)}`);return a===void 0?i:void 0},LS=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},RS=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),ng(e.startupDefinitions,r),t.invariants.forEach(e=>{IS(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},zS=(t,n)=>{let r=Ql({constants:new Set(n.constants.keys()),variables:new Set(n.variables),getDefinition:e=>n.definitions.get(e)});return t.flatMap(t=>{let i=IS(`invariant`,t,n);if(!i)return[];let a=r.analyzeDefinition(i,/* @__PURE__ */ new Map);if(a.level>=2){let n=a.params.size===0?``:`
1763
1786
  Note that a bug can cause TLC to incorrectly report this error.
1764
1787
  If you believe your TLA+ or PlusCal specification to be correct,
1765
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.K(new e.h(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.W.safetyEvaluationFailure)}return[{name:t,expression:Rv(t),scope:void 0}]})},qv=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>qv(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=pu(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return qv(n.body,t)}return[e]},Jv=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||yv(i,t.scope,n)>0)return!1;let a=H(i,ly(n,void 0,void 0,t.scope));if(a===!1)throw new e.h(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e.h(`The operator ${i.name}, which equals ${I(a)},\ncannot be used as a ${r}`);return!0},Yv=(t,n)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return Hv(t,e,n),Rv(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.h(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let r=[],i=[],a=[],o=Bv(`name`,t.specification,n),s=Vv(t.specification,o,n);if(s!==void 0)throw new e.h(`The value of ${t.specification} is equal to ${I(s)}`);if(xv(o.body,void 0,n,!1).forEach(o=>{let s=o.expression;if(Jv(o,n,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw e.K(new e.h(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.W.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){i.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&yv(s.expression,o.scope,n)<2)throw e.K(new e._(`TLC cannot handle the temporal formula ${B(s.expression)}`),e.W.error);let c=yv(s,o.scope,n);if(c===3)a.push(o);else{if(c===2)throw new e.h(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);r.push(o)}}),i.length>1)throw new e.h(`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:Lv},next:i.length===0?void 0:d(i[0],r.length),scope:u,temporals:a}},Xv=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=Uv(`property`,t,n);if(!a)return;yv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;xv(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(Jv(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`&&yv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!E(e)?pu(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=yv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2)throw new e.h(`The property ${t} is an action-level formula`);i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},Zv=(e,t,n)=>t.flatMap(t=>Uv(e,t,n)?[{name:t,expression:Rv(t),scope:void 0}]:[]),Qv=(e,t)=>{let n=pu(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},$v=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e.h(`_POSSIBLE lists ${r} more than once`);Hv(`possible`,r,n);let a=Rv(r);if(yv(a,void 0,n)===3)throw new e.h(`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}}),ey=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||E(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},ty=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=pu(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},ny=(e,t)=>e.flatMap(e=>qv(e.expression,t).map(n=>{let r=e.scope===void 0?mc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:ey(n,r,t),predicate:ty(e.expression,t)}})),ry=(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},iy=/[\u0100-\uffff]/,ay=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),oy=e=>e.kind===`String`?iy.test(e.value):e.kind===`Set`&&e.elements.some(oy),sy=e=>e.kind===`String`&&iy.test(e.value)||e.kind===`Apply`&&ay.has(e.operator)||ke(e).some(sy),cy=(e,t)=>e.constants.some(e=>oy(e.value)||(e.args??[]).some(oy))||[...t.definitions.values()].some(e=>sy(e.body)||e.kind===`Function`&&e.bounds.some(e=>sy(e.set))),ly=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),uy=(e,t,n)=>fu(H(e,t),n),dy=(t,n,r=fy)=>{let i=H(t,n);if(typeof i!=`boolean`)throw new e._(r(t,n.environment));return i},fy=(e,t)=>{let n=e.kind===`Identifier`?pu(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`?ql(i):Jl(r)}`},py=(e,t)=>dy(e.expression,t,(n,r)=>(dy(e.predicate,t),fy(n,r))),my=()=>{},hy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=uy(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),gy=(t,n,r)=>{try{return uy(t,ly(n,void 0,void 0),r)?void 0:{message:void 0}}catch(t){if(t instanceof e._)return{message:t.message};throw t}},_y=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=gy(n.expression,t,`an assumption`);if(e)return{name:B(n.expression),trace:[],message:e.message}}},vy=(t,n,r,i)=>{let a=Kv(t.invariants,n),o=Yv(t,n),s=Xv(t,n,i),c=ny([...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.h(n.runtime.version===`1.7.4`?Wi:`The configuration file did not specify the initial state predicate.`);if(o.next===void 0&&u)throw new e.h(`The configuration file did not specify the next state predicate.`);let d=ny(Zv(`constraint`,t.constraints,n),n),f=Zv(`action constraint`,t.actionConstraints,n);t.rlReward!==void 0&&Bv(`rlreward`,t.rlReward,n),t.periodic!==void 0&&Bv(`periodic`,t.periodic,n);let p=$v(t.possible,n);if(n.variables.length===0)return;let m=t.symmetry===void 0?void 0:Mv(t.symmetry,n,t.substitutions);t.view!==void 0&&Bv(`view function`,t.view,n);let ee=t.view===void 0?void 0:{name:t.view,expression:Rv(t.view),scope:void 0},te=s.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Lv};return{...e,unchanged:t}}),ne=e=>yv(e.expression,void 0,n)>=2,h=p.filter(e=>!ne(e)),g=p.filter(ne),re=n.runtime,ie={indices:void 0},_=()=>{if(ie.indices)return ie.indices;let e=r(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return ie.indices=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ie.indices},ae=(e,t)=>H(e,ly(n,t,void 0)),oe=e=>{let t=_(),n=m===void 0?e:Iv(e,m,t);return ym(ee===void 0?t.map(e=>n[e]):[ae(ee.expression,n)])},se=/* @__PURE__ */ new WeakSet,ce=(t,r,i)=>{let a=i&&!se.has(i)?i:void 0;if(ry(t,r,a))return!1;try{let e=ly(n,r,void 0,t.scope),i=t.membership;return a&&i?!cr(r[i.variable],a[i.variable],H(i.set,e)):!py(t,e)}catch(n){throw i?ia(e.K(n,e.W.safetyEvaluationFailure),Bi.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},le=cy(t,n);re.getFingerprint=oe;let ue=()=>{let e=p.find(e=>!re.possibleCounts.get(e.name));if(!e)return;let t=Qv(e.name,n),r=t?` at ${ql(t)}`:``;return{name:e.name,code:Bi.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:D(I(Hm(re),!0))}};return{properties:s,spec:o,isSymmetric:m!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:_,getStoredFingerprints:(e,t)=>ee!==void 0||le?BigInt64Array.from(e,oe):bm(t,_()),getFingerprintState:e=>{if(le)return[String(oe(e))];let t=m===void 0?e:Iv(e,m,_());return ee===void 0?t:[ae(ee.expression,t)]},findViolatedInvariant:(e,t)=>{let n=c.find(n=>ce(n,e,t));return n&&se.add(e),n},getViolatedInvariants:e=>{let t=l.filter(t=>c.some(n=>n.predicate===t.predicate&&ce(n,e,void 0)));return t.length>0&&se.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>dy(n,ly(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=>dy(e.predicate,ly(n,t,void 0,e.scope)))&&f.every(r=>dy(r.expression,ly(n,e,t,r.scope))))||r())||l.every(e=>dy(e.predicate,ly(n,t,void 0,e.scope))))&&te.every(r=>dy(r.box,ly(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>d.every(r=>ry(r,e,t)||py(r,ly(n,e,void 0))),findFailedInitialPredicate:e=>s.initialPredicates.find(t=>!dy(t.expression,ly(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>te.find(r=>{try{return!dy(r.action,ly(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${B(r.box)}`)&&!uy(r.unchanged,ly(n,e,t,r.scope),`a subscript`)}catch(e){throw ia(yy(e),Bi.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(t,r)=>f.every(i=>dy(i.expression,ly(n,t,r),t=>`${e.P}${fy(t,n)}`)),trackStatePossible:h.length===0?my:e=>hy(h,re,ly(n,e,void 0)),trackActionPossible:g.length===0?my:(e,t)=>hy(g,re,ly(n,e,t)),findUnwitnessedPossible:ue,findPostconditionViolation:(r=!1)=>{let i=t.postconditions.find(e=>{let t=pu(e,n);return t!==void 0&&zu(t,n)!==void 0});if(i!==void 0){if(r)return;throw e.K(new e._(`${e.P}The post condition ${i} cannot be a constant.`),e.W.error)}let a=ue();if(a)return a;for(let e of t.postconditions){let t=gy(Rv(e),n,`a postcondition`);if(!t)continue;let r=Qv(e,n),i=r?` at ${ql(r)}`:``;return t.message===void 0?{name:e,code:Bi.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:Bi.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},yy=t=>t instanceof e.C?e.K(t,t.exitCode):t,by=(e,t)=>e*((t-e)/2**64),xy=e=>e.includes(`.`)?e:`${e}.0`,Sy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return xy(String(e));let[n,r]=e.toExponential().split(`e`);return`${xy(n)}E${r.replace(`+`,``)}`},Cy=e=>e!==void 0&&e>=`0`&&e<=`9`,wy=e=>{if(e===0)return`0.0`;let t=Sy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Cy(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(;Cy(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Cy(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Cy(t[n.next])&&Number(t[n.next])>=5&&(n.result=Ty(n.result));Cy(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Ty=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ty(r)}.`:n===`9`?`${Ty(r)}0`:`${r}${Number(n)+1}`},Ey=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}`)},Dy=(e,t,n)=>{if(by(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},Oy=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}).`},ky=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Ay=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^kr(e[t]),16777619),r=Math.imul(r^Fr(e[t]),1540483477);t[0]=ky(n)||1,t[1]=ky(r)},jy=()=>{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)}}},My=(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}},Ny=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Py=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return My(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Fy=e=>Atomics.load(e.used,0)*2>=e.slots.length,Iy=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&My(t,n);return{slots:t,used:e.used}},Ly=[void 0,`lambda`,`tuple`,`record`],Ry=()=>{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=gr(e.domain);return t?(r(7),r(Ly.indexOf(St(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Ly.indexOf(St(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})}},zy=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 _t(t.strings[n[r.index++]]);if(e===5)return vt(i(n[r.index++]));let a=Ly[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=En({kind:`Interval`,low:e,high:e+t-1});return xt(yt(o,i(t)),a)}let o=n[r.index++],s=i(o);return xt(yt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return pu}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return U_}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Gr}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return Kp}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return nt}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return wv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return ua}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return R_}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return On}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Cv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return _t}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return Gh}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return qd}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return Zp}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return F}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return Km}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return kr}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return pd}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return ee}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return id}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return Oe}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return Gm}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return k}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return j_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Dr}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return __}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Or}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return $}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return fn}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return Wh}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return ql}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return qm}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Mt}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return mv}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return aa}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return yv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Ft}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return Xp}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return ke}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return bp}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return E}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return B}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return ne}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return wu}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return se}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return Hv}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return ta}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return Iy}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Bl}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return Gv}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return la}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return Ay}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Uc}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Dy}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return Bi}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return cd}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return by}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Vi}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return _y}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return na}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return vy}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return $i}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Ny}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Rl}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return uv}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return I}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return pv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return j}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return wy}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return Wc}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Rv}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return Qi}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Ry}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return ou}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Py}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return zl}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Oy}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Ui}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return nd}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return T}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return jy}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Uu}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return Fy}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return Vl}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return zy}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return sd}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return Ey}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return lc}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return ly}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return Yi}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Tv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return br}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return yy}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Xi}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Wv}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return pa}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return ym}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return kt}});
1788
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw e.it(new e._(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${n}`),e.tt.safetyEvaluationFailure)}return[AS(t)]})},BS=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>BS(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Dh(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&tg(n,t)===void 0)return BS(n.body,t)}return[e]},VS=(t,n,r)=>{let i=t.expression;if(i.kind!==`Identifier`||hv(i,t.scope,n)>0)return!1;let a=W(i,iC(n,void 0,void 0,t.scope));if(a===!1)throw new e._(`The spec is trivially false because ${i.name} is false.`);if(a!==!0)throw new e._(`The operator ${i.name}, which equals ${L(a)},\ncannot be used as a ${r}`);return!0},HS=(t,n,r,i,a)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return FS(t,e,n),kS(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(t.init!==void 0||t.next!==void 0)throw new e._(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let o=[],s=[],c=[],l=n.constants.has(t.specification)?n.constants.get(t.specification):PS(t.specification,MS(`name`,t.specification,n),n);if(l!==void 0)throw new e._(`The value of ${t.specification} is equal to ${L(l)}`);let u=MS(`name`,t.specification,n),d=t.properties.length===1?t.properties[0]:void 0,f=!1;_v(u.body,void 0,n,!1).forEach(t=>{let l=t.expression;if(VS(t,n,`spec`))return;let u=l.kind===`Identifier`&&!j(l)?n.variableIndex.get(l.name):void 0;if(l.kind===`Identifier`&&u!==void 0){let t=r[u].range;throw new e._(`The operator ${l.name}, which equals ${t?e.Y(t):l.name},\ncannot be used as a spec`)}if(l.kind===`UnboundedQuantifier`&&l.isTemporal)throw e.it(new e._(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.tt.error);if(l.kind===`Always`&&l.expression.kind===`BoxAction`){let r=Kv(l.expression.subscript,t.scope,n);if(r===void 0&&a?.({kind:`warning`,code:qe.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1789
+ all state variables. Proceed with fingers crossed.`}),i().filter(e=>r!==void 0&&!r.includes(e)).forEach(e=>a?.({kind:`warning`,code:qe.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),s.length>0)throw new e._(`The specification contains more than one conjunct of the form [][Next]_v,
1790
+ but TLC can handle only specifications with one next-state relation.`);s.push({expression:l.expression.action,scope:t.scope});return}if(l.kind===`Always`&&l.expression.kind!==`Let`&&l.expression.kind!==`Label`&&hv(l.expression,t.scope,n)<2)throw e.it(new e.b(`TLC cannot handle the temporal formula ${H(l.expression)}`),e.tt.error);let p=hv(l,t.scope,n);if(p===3)d!==void 0&&t.path.includes(d)||(f=!0),c.push(t);else{if(p===2)throw new e._(`TLC cannot handle this conjunct of the spec:\n${H(l)}`);o.push(t)}});let p=[...o,...s],m=e=>`$specification${e}`,h=p.reduce((e,t,n)=>t.scope===void 0?e:{name:m(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:m(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:o.length===0?void 0:{kind:`And`,operands:o.map(g),location:OS},next:s.length===0?void 0:g(s[0],o.length),scope:h,temporals:c,isPropertyFairness:c.length>0&&!f}},US=(t,n,r)=>{let i={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return t.properties.forEach(t=>{let a=IS(`property`,t,n);if(!a)return;hv(a.body,void 0,n)===1&&r?.({kind:`state-level-property`,name:t});let o=n.runtime.version!==`1.7.4`;_v(a.body,void 0,n,o).forEach(r=>{let a=r.expression;if(VS(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`&&hv(a.expression,r.scope,n)<=1){let e=a.expression,t=e.kind===`Identifier`&&!j(e)?Dh(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=hv(a,r.scope,n);if(s<2)i.initialPredicates.push({name:o,expression:a,scope:r.scope});else{if(s===2){let t=H(a),n=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,r=a.kind===`BoxAction`?`To check that action ${o} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${t} (compare page 90 of ${n}).`:a.kind===`AngleAction`?`To check that infinitely many ${o} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${t} (compare page 91 of ${n}).`:`To check that action ${o} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${t}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${n}).`;throw new e._(`The formula ${o} at ${t} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${r}`)}i.liveness.push({name:t,expression:a,scope:r.scope})}})}),i},WS=(e,t,n)=>t.flatMap(t=>IS(e,t,n)?[AS(t)]:[]),GS=(e,t)=>{let n=Dh(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},KS=(t,n)=>t.map((r,i)=>{if(t.indexOf(r)!==i)throw new e._(`_POSSIBLE lists ${r} more than once`);FS(`possible`,r,n);let a=AS(r);if(hv(a.expression,void 0,n)===3)throw new e._(`The possible of ${r} is equal to a temporal formula; only state- and action-level predicates are supported`);return a}),qS=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||j(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},JS=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Dh(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},YS=(e,t)=>e.flatMap(e=>BS(e.expression,t).map(n=>{let r=e.scope===void 0?bu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:qS(n,r,t),predicate:JS(e.expression,t)}})),XS=(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},ZS=/[\u0100-\uffff]/,QS=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),$S=e=>e.kind===`String`?ZS.test(e.value):e.kind===`Set`&&e.elements.some($S),eC=e=>e.kind===`String`&&ZS.test(e.value)||e.kind===`Apply`&&QS.has(e.operator)||A(e).some(eC),tC=(e,t)=>e.constants.some(e=>$S(e.value)||(e.args??[]).some($S))||[...t.definitions.values()].some(e=>eC(e.body)||e.kind===`Function`&&e.bounds.some(e=>eC(e.set))),nC=e=>{if(!Pt(e))return;let t=Ht(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},rC=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},iC=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),aC=(e,t,n)=>Sh(W(e,t),n),oC=(t,n,r=cC)=>{let i=W(t,n);if(typeof i!=`boolean`)throw new e.b(r(t,n.environment));return i},sC=(t,n,r)=>{let i=n.kind===`Identifier`?Dh(n.name,r):void 0,a=i?.kind===`Operator`?i.body:n,o=i?.kind===`Operator`?i.bodyRange:void 0;return`TLC expected a ${t} value, but did not find one. ${o&&a.kind!==`Number`?e.Y(o):ah(a)}`},cC=(e,t)=>sC(`boolean`,e,t),lC=(e,t)=>oC(e.expression,t,(n,r)=>(oC(e.predicate,t),cC(n,r))),uC=()=>{},dC=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=aC(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),fC=(t,n)=>{try{return t(iC(n,void 0,void 0))?void 0:{message:void 0}}catch(t){if(t instanceof e.b)return{message:t.message};throw t}},pC=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=fC(e=>Eh(W(n.expression,e),n.expression),t);if(e)return{name:ah(n.expression),trace:[],message:e.message}}},mC=(e,t,n,r=!1)=>{let i=nS(t.source,t.loadModule);return en(i.getStringOrder(e)),on(t),Ma(t.fingerprintPolynomial??0),r&&tn(),{order:i,specification:hS(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators})}},hC=e=>{let t=typeof e.config==`string`?Re(e.config,e.version):e.config,n=mC(t,e,e.onPrint??console.log),r=n.specification;RS(r,t,e.onProgress);let i=r.environment,a,o=()=>a??=Gv(t,i,r.instanceActions);return i.runtime.getSpecification=()=>Xv(o(),t,i,r.variableLocations),{config:t,specification:r,environment:i,search:vC(t,i,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators),getDescription:o}},gC=(t,n,r)=>{let i=pC(t,n);if(!i)return;if(i.message===void 0){let t=`Assumption ${i.name} is false.`;return r(qe.assumptionFalse,t,t),e.tt.assumptionViolation}let a=`Evaluating assumption ${i.name} failed.\n${i.message}`;return r(qe.assumptionEvaluationError,a,ot(qe.assumptionEvaluationError,a,!0)),e.tt.assumptionViolation},_C=t=>e.it(new e.b(`${e.W}Could not find operator: ${t.operator} in module: ${t.module}`),e.tt.error),vC=(t,n,r,i,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw _C(e);return{name:e.operator,key:e.key}}),c=zS(t.invariants,n),l=HS(t,n,r,i,a),u=US(t,n,a),d=t.properties[0],f=d&&Dh(d,n)?.location.range,p=t.specification,m=p&&Dh(p,n)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:qe.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${e.Y(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${e.Y(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let h=YS([...c,...u.invariants],n),g=[...new Map(h.map(e=>[e.predicate,e])).values()],_=h.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(_||u.initialPredicates.length>0||n.variables.length>0))throw new e._(n.runtime.version===`1.7.4`?Qe:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&_)throw new e._(`The configuration file did not specify the next state predicate.`);let v=WS(`constraint`,[...t.constraints,...s(`constraint`).map(e=>e.name)],n),y=YS(v,n),b=WS(`action constraint`,t.actionConstraints,n),ee=n.coverage,x=(e,t,r=!0)=>t.flatMap(t=>{if(!ee)return[];let i=r?JS(t.expression,n):t.expression,a=Ga(r?t.name:void 0,i,n),o=Ua(ee,e,a,i,t.scope);return[{expression:i,scope:t.scope,node:o}]}),te=[...x(`invariant`,c),...x(`invariant`,u.invariants,!1)],S=x(`constraint`,b),ne=x(`constraint`,v),re=x(`implied`,u.initialPredicates,!1),ie=x(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),ae=(e,t,r,i)=>{try{return ro(e,t.node,()=>W(t.expression,iC(n,r,i,t.scope)))}catch{return}},oe=(e,t,n)=>ee!==void 0&&e.every(e=>ae(ee,e,t,n)===!0),C=(e,t,n)=>{if(ee){for(let r of e){let e=ae(ee,r,t,n);if(typeof e!=`boolean`)return;if(!e)return ee.primary[r.node]++,!1;ee.secondary[r.node]++}return!0}};t.rlReward!==void 0&&MS(`rlreward`,t.rlReward,n),t.periodic!==void 0&&MS(`periodic`,t.periodic,n);let se=KS(t.possible,n);if(n.variables.length===0)return;let w=t.symmetry===void 0?void 0:CS(t.symmetry,n,t.substitutions),ce=t.view===void 0?void 0:FS(`view function`,t.view,n),le=t.view??s(`view`)[0]?.name,ue=le===void 0?void 0:AS(le),T=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:OS};return{...e,unchanged:t}}),E=e=>hv(e.expression,void 0,n)>=2,D=se.filter(e=>!E(e)),O=se.filter(E),de=n.runtime,fe,pe=()=>{if(fe)return fe;let e=i(),t=t=>{let r=e.indexOf(n.variables[t]);return r===-1?n.variables.length:r};return fe=n.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),fe},me=(e,t)=>W(e,iC(n,t,void 0)),he=e=>{let t=pe(),n=w===void 0?e:DS(e,w,t);return Ia(ue===void 0?t.map(e=>n[e]):[me(ue.expression,n)])},ge=/* @__PURE__ */ new WeakSet,_e=(t,r,i)=>{let a=i&&!ge.has(i)?i:void 0;if(XS(t,r,a))return!1;try{let e=iC(n,r,void 0,t.scope),i=t.membership;return a&&i?!Ci(r[i.variable],a[i.variable],W(i.set,e)):!lC(t,e)}catch(n){throw i?ft(e.it(n,e.tt.safetyEvaluationFailure),qe.invariantEvaluationFailed,`Evaluating invariant ${t.name} failed.`):n}},k=tC(t,n);de.getFingerprint=he;let ve=()=>{let t=se.find(e=>!de.possibleCounts.get(e.name));if(!t)return;let r=GS(t.name,n),i=r?` at ${e.Y(r)}`:``;return{name:t.name,code:qe.possibleUnwitnessed,message:`The _POSSIBLE predicate ${t.name}${i} 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:M(L(Wd(de),!0))}},ye=ce?.body.kind===`Tuple`?ce.body.elements:[],be=ye.flatMap(e=>e.kind===`Identifier`&&n.variables.includes(e.name)?[e.name]:[]),xe=ce?.body.kind===`Tuple`&&be.length===ye.length&&new Set(be).size===be.length,Se=(e,t)=>xe?pe().filter(e=>be.includes(n.variables[e])).map(e=>`/\\ ${n.variables[e]} = ${M(L(t[e]))}\n`).join(``):M(L(me(e,t))),Ce=(t,r,i)=>oC(t.expression,iC(n,r,i),t=>`${e.W}${cC(t,n)}`),we=e=>{let t=Object.fromEntries(pe().map(t=>[n.variables[t],e[t]]));return ue===void 0?t:cn(t,()=>Se(ue.expression,e))};return{properties:u,spec:l,toRecord:we,evaluateAlias:(t,r,i,a)=>{try{FS(`alias`,t,n);let e=W(kS(t),iC(n,r,i)),a=nC(e);return a===void 0?we(r):un(a,t)}catch(t){if(!(t instanceof e._||t instanceof e.b))throw t;return{...we(r),_ALIASEvalError:st(t.message,a)}}},isSymmetric:w!==void 0,isConstrained:y.length>0||b.length>0,getTlcOrder:pe,getStoredFingerprints:(e,t)=>ue!==void 0||k?BigInt64Array.from(e,he):La(t,pe()),getFingerprintState:e=>{if(k)return[String(he(e))];let t=w===void 0?e:DS(e,w,pe());return ue===void 0?t:[me(ue.expression,t)]},findViolatedInvariant:(e,t)=>{if(oe(te,e))return;let n=h.find(n=>_e(n,e,t));return n&&ge.add(e),n},getViolatedInvariants:e=>{let t=g.filter(t=>h.some(n=>n.predicate===t.predicate&&_e(n,e,void 0)));return t.length>0&&ge.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>oC(n,iC(t,e,void 0,r));y.every(e=>r(e.predicate,e.scope))&&n();let i=g.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(y.every(e=>oC(e.predicate,iC(n,t,void 0,e.scope)))&&b.every(r=>oC(r.expression,iC(n,e,t,r.scope))))||r())||g.every(e=>oC(e.predicate,iC(n,t,void 0,e.scope))))&&T.every(r=>oC(r.box,iC(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>C(ne,e)??y.every(r=>XS(r,e,t)||lC(r,iC(n,e,void 0))),findFailedInitialPredicate:e=>oe(re,e)?void 0:u.initialPredicates.find(t=>!oC(t.expression,iC(n,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>oe(ie,e,t)?void 0:T.find(r=>{try{return!oC(r.action,iC(n,e,t,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${H(r.box)}`)&&!aC(r.unchanged,iC(n,e,t,r.scope),`a subscript`)}catch(e){throw ft(yC(e),qe.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>C(S,e,t)??b.every(n=>Ce(n,e,t)),getExcludingConstraints:(t,r)=>[...y.filter(e=>!lC(e,iC(n,r,void 0))),...b.filter(e=>!Ce(e,t,r))].map(t=>{let r=GS(t.name,n);return r?e.Y(r):t.name}),trackStatePossible:D.length===0?uC:e=>dC(D,de,iC(n,e,void 0)),trackActionPossible:O.length===0?uC:(e,t)=>dC(O,de,iC(n,e,t)),findUnwitnessedPossible:ve,getReward:(r,i,a)=>{if(t.rlReward===void 0)return a;let o=kS(t.rlReward),s=W(o,iC(n,r,i));if(typeof s!=`number`)throw new e.b(sC(`integer`,o,n));return s},findPostconditionViolation:(r=!1)=>{let i=s(`postcondition`),a=t.postconditions.map(e=>{let t=Dh(e,n);return t?t.kind===`Operator`&&t.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!NS(t)&&tg(t,n)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(a!==void 0){if(r)return;throw e.it(new e.b(a),e.tt.configParseError)}let o=(t,r)=>{let i=fC(e=>oC(kS(r),e),n);if(!i)return;let a=Dh(r,n)?.body,o=GS(r,n),s=o?` at ${a?.kind===`Number`?ah(a):e.Y(o)}`:``;return i.message===void 0?{name:t,code:qe.postconditionFalse,message:`Postcondition ${t}${s} is false.`}:{name:t,code:qe.postconditionFailed,message:`Evaluating postcondition ${t}${s} failed.\n${i.message}`}};for(let e of i){let t=o(e.name,e.key);if(t)return t}let c=ve();if(c)return c;for(let e of t.postconditions){let t=o(e,e);if(t)return t}}}},yC=t=>t instanceof e.O?e.it(t,t.exitCode):t,bC=(e,t)=>e*((t-e)/2**64),xC=e=>e.includes(`.`)?e:`${e}.0`,SC=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return xC(String(e));let[n,r]=e.toExponential().split(`e`);return`${xC(n)}E${r.replace(`+`,``)}`},CC=e=>e!==void 0&&e>=`0`&&e<=`9`,wC=e=>{if(e===0)return`0.0`;let t=SC(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;CC(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;CC(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;CC(t[n])&&r<2;)i+=t[n++],r++;for(CC(t[n])&&Number(t[n])>=5&&(i=TC(i));CC(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},TC=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${TC(r)}.`:n===`9`?`${TC(r)}0`:`${r}${Number(n)+1}`},EC=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},DC=(e,t,n)=>{if(bC(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a=1/0,o=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 s=t-n;if(s<=1048576){let t=s*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a=Math.min(a,t)}else{let t=r[e]-r[e-1];t<o&&(o=t)}}if(a===1/0)return o;let s=BigInt(a);return s<o?s:o},OC=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},kC=[void 0,`lambda`,`tuple`,`record`],AC=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=Pi(e.domain);return t?(a(7),a(kC.indexOf(jn(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(kC.indexOf(jn(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},jC=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return wn(t.strings[n[r++]]);if(e===5)return En(i(n[r++]));let a=kC[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Mr({kind:`Interval`,low:e,high:e+t-1});return An(On(o,i(t)),a)}let o=n[r++],s=i(o);return An(On(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"$",{enumerable:!0,get:function(){return qm}}),Object.defineProperty(exports,"$t",{enumerable:!0,get:function(){return Re}}),Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return xv}}),Object.defineProperty(exports,"At",{enumerable:!0,get:function(){return Gi}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return v_}}),Object.defineProperty(exports,"Bt",{enumerable:!0,get:function(){return ot}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Jv}}),Object.defineProperty(exports,"Ct",{enumerable:!0,get:function(){return Ia}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return Tv}}),Object.defineProperty(exports,"Dt",{enumerable:!0,get:function(){return Fr}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Xv}}),Object.defineProperty(exports,"Et",{enumerable:!0,get:function(){return wn}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return R_}}),Object.defineProperty(exports,"Ft",{enumerable:!0,get:function(){return Vn}}),Object.defineProperty(exports,"G",{enumerable:!0,get:function(){return w_}}),Object.defineProperty(exports,"Gt",{enumerable:!0,get:function(){return St}}),Object.defineProperty(exports,"H",{enumerable:!0,get:function(){return T_}}),Object.defineProperty(exports,"Ht",{enumerable:!0,get:function(){return ut}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return av}}),Object.defineProperty(exports,"It",{enumerable:!0,get:function(){return Rn}}),Object.defineProperty(exports,"J",{enumerable:!0,get:function(){return Pg}}),Object.defineProperty(exports,"Jt",{enumerable:!0,get:function(){return pt}}),Object.defineProperty(exports,"K",{enumerable:!0,get:function(){return b_}}),Object.defineProperty(exports,"Kt",{enumerable:!0,get:function(){return vt}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return p_}}),Object.defineProperty(exports,"Lt",{enumerable:!0,get:function(){return qe}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return N_}}),Object.defineProperty(exports,"Mt",{enumerable:!0,get:function(){return Tn}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return j_}}),Object.defineProperty(exports,"Nt",{enumerable:!0,get:function(){return Dt}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return lv}}),Object.defineProperty(exports,"Ot",{enumerable:!0,get:function(){return ha}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return cv}}),Object.defineProperty(exports,"Pt",{enumerable:!0,get:function(){return nn}}),Object.defineProperty(exports,"Q",{enumerable:!0,get:function(){return Eg}}),Object.defineProperty(exports,"Qt",{enumerable:!0,get:function(){return A}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return S_}}),Object.defineProperty(exports,"Rt",{enumerable:!0,get:function(){return Je}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Fb}}),Object.defineProperty(exports,"St",{enumerable:!0,get:function(){return yo}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Gv}}),Object.defineProperty(exports,"Tt",{enumerable:!0,get:function(){return Wn}}),Object.defineProperty(exports,"U",{enumerable:!0,get:function(){return C_}}),Object.defineProperty(exports,"Ut",{enumerable:!0,get:function(){return lt}}),Object.defineProperty(exports,"V",{enumerable:!0,get:function(){return h_}}),Object.defineProperty(exports,"Vt",{enumerable:!0,get:function(){return st}}),Object.defineProperty(exports,"W",{enumerable:!0,get:function(){return g_}}),Object.defineProperty(exports,"Wt",{enumerable:!0,get:function(){return rt}}),Object.defineProperty(exports,"X",{enumerable:!0,get:function(){return Dh}}),Object.defineProperty(exports,"Xt",{enumerable:!0,get:function(){return ct}}),Object.defineProperty(exports,"Y",{enumerable:!0,get:function(){return H}}),Object.defineProperty(exports,"Yt",{enumerable:!0,get:function(){return yt}}),Object.defineProperty(exports,"Z",{enumerable:!0,get:function(){return Dg}}),Object.defineProperty(exports,"Zt",{enumerable:!0,get:function(){return Ve}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return yC}}),Object.defineProperty(exports,"_t",{enumerable:!0,get:function(){return Ua}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return DC}}),Object.defineProperty(exports,"at",{enumerable:!0,get:function(){return Gp}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return yx}}),Object.defineProperty(exports,"bt",{enumerable:!0,get:function(){return Ba}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return mC}}),Object.defineProperty(exports,"ct",{enumerable:!0,get:function(){return Tf}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return pC}}),Object.defineProperty(exports,"dt",{enumerable:!0,get:function(){return _f}}),Object.defineProperty(exports,"en",{enumerable:!0,get:function(){return Ee}}),Object.defineProperty(exports,"et",{enumerable:!0,get:function(){return Ym}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return rC}}),Object.defineProperty(exports,"ft",{enumerable:!0,get:function(){return Kd}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return RS}}),Object.defineProperty(exports,"gt",{enumerable:!0,get:function(){return Ss}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return LS}}),Object.defineProperty(exports,"ht",{enumerable:!0,get:function(){return Cd}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return EC}}),Object.defineProperty(exports,"it",{enumerable:!0,get:function(){return Jp}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return yv}}),Object.defineProperty(exports,"jt",{enumerable:!0,get:function(){return Ki}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return bv}}),Object.defineProperty(exports,"kt",{enumerable:!0,get:function(){return L}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return _C}}),Object.defineProperty(exports,"lt",{enumerable:!0,get:function(){return wf}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return gC}}),Object.defineProperty(exports,"mt",{enumerable:!0,get:function(){return yd}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return AC}}),Object.defineProperty(exports,"nn",{enumerable:!0,get:function(){return ee}}),Object.defineProperty(exports,"nt",{enumerable:!0,get:function(){return Zm}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return bC}}),Object.defineProperty(exports,"ot",{enumerable:!0,get:function(){return Kp}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return hC}}),Object.defineProperty(exports,"pt",{enumerable:!0,get:function(){return Yd}}),Object.defineProperty(exports,"q",{enumerable:!0,get:function(){return f_}}),Object.defineProperty(exports,"qt",{enumerable:!0,get:function(){return it}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return wC}}),Object.defineProperty(exports,"rn",{enumerable:!0,get:function(){return re}}),Object.defineProperty(exports,"rt",{enumerable:!0,get:function(){return Xm}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return OC}}),Object.defineProperty(exports,"st",{enumerable:!0,get:function(){return qp}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return jC}}),Object.defineProperty(exports,"tn",{enumerable:!0,get:function(){return k}}),Object.defineProperty(exports,"tt",{enumerable:!0,get:function(){return Jm}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return vC}}),Object.defineProperty(exports,"ut",{enumerable:!0,get:function(){return Ef}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return mx}}),Object.defineProperty(exports,"vt",{enumerable:!0,get:function(){return $a}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return Yv}}),Object.defineProperty(exports,"wt",{enumerable:!0,get:function(){return wt}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return vx}}),Object.defineProperty(exports,"xt",{enumerable:!0,get:function(){return Ga}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return gx}}),Object.defineProperty(exports,"yt",{enumerable:!0,get:function(){return oo}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return m_}}),Object.defineProperty(exports,"zt",{enumerable:!0,get:function(){return Ze}});