tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

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 (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  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 +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
package/dist/transfer.js CHANGED
@@ -6,89 +6,23 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- import{A as e,B as t,C as n,D as r,F as i,G as a,H as o,I as s,L as c,O as l,P as u,R as d,V as f,W as p,_ as m,g as h,h as g,j as _,q as v,u as y,v as b,y as ee,z as x}from"./worker.js";const te=/* @__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(`.`)),ne=/* @__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`]]),re=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),ie=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ae=/* @__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`]]),oe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),se=e=>e.startsWith(`\\`)?parseInt(e.slice(2),oe.get(e[1].toLowerCase())):Number(e),ce=/-{4,}[ \t]*MODULE\b/,le=/* @__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)le[n.charCodeAt(0)]|=e});const ue=(e,t)=>e<128&&(le[e]&t)!==0,de=(e,t,n)=>{let r=t;for(;ue(e.charCodeAt(r),n);)r++;return r},S=/* @__PURE__ */ new Map;ie.forEach(e=>{let t=e.charCodeAt(0),n=S.get(t)??[];n.push(e),S.set(t,n)});const C=(e,t)=>{let n=S.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]}},w=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(ae.has(n))return n;let r=e[t];return ae.has(r)?r:void 0},T=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&ue(e.charCodeAt(t+1),2)){let n=e.slice(t+1,de(e,t+1,2)),r={value:n.length};for(;r.value>0&&!ne.has(n.slice(0,r.value));)r.value--;let i=ne.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=w(e,t);if(r!==void 0)return{text:ae.get(r)??``,length:r.length};let i=C(e,t);return i?{text:re.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},fe=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),pe=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>ae.has(e)||fe.has(e));return n===void 0?void 0:{text:n,length:n.length}},me=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},he=(e,t)=>{let n=e[t+1]===`+`||e[t+1]===`*`?t+2:de(e,t+1,1);if(n===t+1||e[n]!==`>`)return 0;let r=de(e,n+1,7),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return me(e,i?r+1:r,e=>e===`.`)-t},ge=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,_e={n:`
10
- `,t:` `,r:`\r`,f:`\f`},ve=(e,t)=>t===9?e+8-e%8:e+1,ye=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),E=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=ye.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=de(e,t+2,n);return r===t+2?0:r-t},be=e=>{let t=ce.exec(e);if(!t)throw new l(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
11
- `),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=ve(o.width,e.charCodeAt(o.position));return ve(o.width,e.charCodeAt(a.index))},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},u=t=>{for(let n=0;n<t;n++)e.charCodeAt(a.index)===10&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new l(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e.charCodeAt(a.index);if(t===10||t===32||t===9||t===13){u(1);continue}if(t===92&&e.charCodeAt(a.index+1)===42){let t=e.indexOf(`
12
- `,a.index);u((t===-1?e.length:t)-a.index);continue}if(t===40&&e.charCodeAt(a.index+1)===42){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,u(2)):e.startsWith(`*)`,a.index)?(t.value--,u(2)):u(1)}while(t.value>0);continue}if(t===45&&e.startsWith(`----`,a.index)){let t=me(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(t===61&&e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,me(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===34){let t=a.line,r=s(),i=[];for(u(1);e.charCodeAt(a.index)!==34;){let t=e.charCodeAt(a.index);if(a.index>=e.length||t===10||t===13)throw d(`Unterminated string`);if(t===92){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push(_e[t]??t),u(2)}else i.push(e[a.index]),u(1)}u(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=E(e,a.index);if(i>0){c(`Number`,e.slice(a.index,a.index+i),i);continue}if(ue(t,7)){let n=de(e,a.index,7),i=e.slice(a.index,n),o=de(e,a.index,1);if(o===n){let t=e.charCodeAt(n)===46?de(e,n+1,1):n,r=t>n+1,o=r?e.slice(a.index,t):i;c(r?`Decimal`:`Number`,o,o.length);continue}if(!/[A-Za-z]/.test(i)){let n=t===95?`_`:e.slice(a.index,o);c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(i.startsWith(`WF_`)||i.startsWith(`SF_`)){c(`Keyword`,i.slice(0,3),3);continue}let s=r.get(i)??i;r.set(s,s),c(te.has(i)?`Keyword`:`Identifier`,s,i.length);continue}let o=e[a.index];if(t>=128&&fe.has(o)){c(`Identifier`,r.get(o)??o,1),r.set(o,o);continue}if(t===60){let t=he(e,a.index);if(t>0){c(`Step`,e.slice(a.index,a.index+t),t);continue}}let l=T(e,a.index);if(l){let t=e.slice(a.index,a.index+l.length);c(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(o)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},xe=[[`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`]],Se=xe.map(e=>e[0]),Ce=new Map(Se.map((e,t)=>[e,t]).reverse()),D=e=>{let t=Ce.get(e);if(t===void 0)throw new h(`Unknown SANY token kind ${e}`);return t},we=new Map(xe.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),Te=Math.max(...[...we.keys()].map(e=>e.length)),Ee=Array.from({length:Te},(e,t)=>Te-t),De=/----+ *MODULE/y,Oe=[/_\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],ke=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`)),Ae=ke(String.raw`\.\/\\`),je=ke(String.raw`\.\\\/`),Me=String.raw`<(?:[0-9]+|\+|\*)>`,Ne=[[`_BM0`,[De]],[`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`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe],[`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`)]]],Pe=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[De]]],Fe=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[De]],[`BAND`,Ae],[`BOR`,je],[`IDENTIFIER`,Oe]],Ie=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Le=(e,t,n)=>e.map(([e,r])=>({kind:D(e),length:Math.max(...r.map(e=>Ie(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),Re=(e,t)=>{let n=Ee.find(n=>we.has(e.slice(t,t+n))),r=Le(Ne,e,t);if(n===void 0)return r;let i={kind:we.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},ze=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=ze(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Ve=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,O=new Set([...we.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),He=(e,t)=>{let n=0;for(;O.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ie(Ve,e,t)))},Ue=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(D(`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?Ke(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
- `||e[a]===`\r`?Ke(o+1,0,void 0,i):Ke(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=Le(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,Se[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),Se[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Pe);if(n.mode===`PRAGMA`)return s(Fe);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=Re(e,t);if(i.length===0){let n=He(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()}},We=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Ge=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>We.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Ke=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Ge(n)}" (${n.charCodeAt(0)}), `}after : "${Ge(r)}"`,qe=e=>{let t=Ue(e);for(let e=t();typeof e!=`string`&&e.kind!==D(`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===` `?ze(e):e+1,e.beginColumn);return Ke(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Je=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:[])}},k=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ye=`-------------------------------- 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
- =============================================================================`,Xe=`----------------------------- 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
- =============================================================================`,Ze=`----------------------------- 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
- =============================================================================`,Qe=/* @__PURE__ */ new Map([[`Reals`,Ye],[`RealTime`,Xe],[`Toolbox`,Ze]]),$e={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:` `}},et=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},tt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),nt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),rt=e=>{let t=t=>{let n=me(e,t,et);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=me(e,t,tt);if(e.startsWith(`..`,n)&&tt(e[n+2]))return{kind:`Constant`,first:t,last:me(e,n+2,tt)-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=tt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:me(e,t+1,tt)-1,children:[]};if(nt(n))return{kind:`Constant`,first:t,last:me(e,t,nt)-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)},it=e=>{let t=e.length===0?void 0:rt(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=$e[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},at=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,A=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ot=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),j=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),M=e=>typeof e==`object`&&e.kind===`ModelValue`,st=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),ct=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:A(e)?`set`:`function`,lt=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,ut={isUsed:!1},dt=(e,t)=>(ut.isUsed=!0,e.writtenKeys=t,e),ft=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[xr(e.domain,t)]]),pt=(e,t,n)=>dt(Zn(e,t),n),mt=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(mt);e.writtenKeys=void 0,e.range.forEach(mt)}},ht=e=>e.every(e=>typeof e==`string`),gt=(e,t)=>e.length>0&&t.length>0&&ht(e)!==ht(t),_t=(e,t)=>{ut.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return gt(n,r)?vn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Ft(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:Ft(t,n);if(r!==0)return r}return 0},vt=(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=Ft(n[e],r[e]);if(t!==0)return t}return 0},yt=e=>M(e)?e.type:void 0,bt=(e,t,n)=>{let r=yt(e),i=yt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(M(e)&&M(t)){if(r===void 0||i===void 0||r===i)return;throw new m(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new m(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new m(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},xt={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},St=e=>{xt.ranks=Object.create(null),xt.size=0,xt.searchRank=void 0,xt.unorderedString=void 0,It.clear();for(let t of e)Dt(t)},Ct=()=>{xt.searchRank=xt.size},wt=()=>xt.unorderedString,Tt={is174:!1},Et=e=>{Tt.is174=e===`1.7.4`},Dt=e=>(xt.ranks[e]===void 0&&(xt.ranks[e]=xt.size++),e),Ot=e=>xt.ranks[Dt(e)],kt=(e,t)=>{if(e===t)return 0;let n=xt.ranks,r=n[e],i=n[t],a=xt.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(xt.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},At=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),jt=(e,t)=>(At(e)||At(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Mt=(e,t,n)=>{if(!At(e))throw new m(`Attempted to ${n} the set ${L(N(e)?P(e):e,!0)} with the value:\n${L(t,!0)}`);if(!At(t))throw new m(`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new m(`Attempted to compare ${L(e,!0)} with the value\n${L(t,!0)}`)},Nt={kind:`InfiniteSet`,name:`Any`},Pt=e=>{throw new m(`Attempted to compare ANY with the value\n${L(e)}`)},Ft=(e,t)=>{if(e===t)return ut.isUsed&&mt(e),e===Nt?Pt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return _t(e,t);if(n===`Set`&&r===`Set`)return vt(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&&bt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return bt(e,t,!1),n===`ModelValue`?-1:1;if(e===Nt||t===Nt)return Pt(e===Nt?t:e);if(A(e)&&A(t)&&jt(e,t))return Mt(e,t,`compare`);let i=A(e);if(i!==A(t))throw new m(`Attempted to compare ${ct(e)} ${L(e)} with ${ct(t)} ${L(t)}`);return i?vt(P(e),P(t)):_t(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return kt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(bt(e,t,!1),M(e))return-1;if(M(t))return 1;throw new m(`Attempted to compare ${ct(e)} ${L(e)} with ${ct(t)} ${L(t)}`)},It=/* @__PURE__ */ new Map,Lt=e=>{let t=It.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Ot(e),hash:Vr(Hr(Ur(e),109)),fingerprint:Qr($r(e)^60)};return It.set(e,n),n},Rt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),zt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Bt={isPresent:!1},Vt=(e,t)=>(t===`lambda`&&(Bt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Ht=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Ut=e=>Vt(e,`lambda`),Wt=e=>at(e)&&e.isCached===!0,Gt={isPresent:!1},Kt=e=>(Gt.isPresent=!0,e),qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Jt=e=>{Gt.isPresent&&typeof e==`object`&&at(e)&&qt.has(e.kind)&&(e.isCached=!0)},Yt=e=>{(Bt.isPresent||Gt.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(Yt),e.range.forEach(Yt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Yt):A(e)&&N(e)&&(Jt(e),P(e).elements.forEach(Yt))))},Xt=(e,t)=>{if(Jt(e),e===t)return ut.isUsed&&mt(e),e!==Nt||Pt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&bt(e,t,!0),Ft(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return _t(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return vt(e,t)===0;if(M(e)||M(t))return bt(e,t,!0),M(e)&&M(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Xt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:Xt(e.domain,t.domain)&&Xt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Xt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Xt(e,t.factors[n]));let n=A(e)&&A(t)&&!(N(e)&&N(t));if(n&&jt(e,t))return Mt(e,t,`check equality of`)===0;if(n){if(!At(e)){let n=P(e);if(!At(t))return vt(n,P(t))===0}return ii(e)===ii(t)}return Ft(e,t)===0},Zt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ii(n)===ii(r);return n},Qt=Zt(!1),$t=Zt(!0),en=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},tn=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||$t(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||$t(i[e],n))return i[e]}return n.kind===`Set`?en(n.elements,t):(en(n.domain,t),en(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}},nn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},rn=e=>{if(!j(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:nn(t.domain)}},an=e=>{if(!j(e))return;let t=I(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},on=(e,t)=>(bt(t,e,!1),1),sn=(e,t)=>(bt(t,e,!0),!1),cn=(e,t)=>(e.type!==void 0&&bt(e,t,!1),M(t)?e.rank-t.rank:-1),ln=(e,t)=>(e.type!==void 0&&bt(e,t,!0),M(t)&&e.name===t.name),un={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`}},dn=(e,t,n)=>{let r=un[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)}`},fn=(e,t,n)=>{let r=rn(n);if(!r){if(M(n))return on(n,t);throw new m(`Attempted to compare the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>pn(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return pn(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new m(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${L(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},pn=(e,t)=>{for(let n=0;n<e.length;n++){let r=vn(e[n],t[n]);if(r!==0)return r}return 0},mn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=j(t)?Sr(t):void 0;return r?n.range.length-r.length||pn(n.range,r):fn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(M(t))return on(t,e);throw new m(`Attempted to compare record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length-r.domain.length||pn(n.domain,r.domain)||pn(n.range,r.range)}return fn({...n,low:nn(n.domain)},e,t)},hn=(e,t)=>At(e)||At(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),gn=(e,t)=>{let n=st(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},_n=(e,t)=>{if(hn(e,t))return Ft(e,t);if(!st(e))return _n(P(e),t);if(!A(t)){if(M(t))return on(t,e);throw new m(`Attempted to compare the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length-n.otherElements.length||pn(n.elements,n.otherElements)},vn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Ft(e,t);if(M(t))return on(t,e);throw new m(dn(e,t,!1))}return e.kind===`ModelValue`?cn(e,t):j(e)?mn(e,t):_n(e,t)},yn=(e,t)=>e.every((e,n)=>Cn(e,t[n])),bn=(e,t,n)=>{let r=rn(n);if(!r){if(M(n))return sn(n,t);throw new m(`Attempted to check equality of the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&yn(e.range,r.range);let i=e.low??r.low;return i===void 0?yn(e.domain,r.domain)&&yn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new m(`Attempted to compare an integer with non-integer:\n${L(e)}.`);return e===i+t})&&yn(e.range,r.range)},xn=(e,t)=>{let n=I(e);if(e.kind===`Function`&&Sr(n)!==void 0){let r=j(t)?Sr(t):void 0;return r?n.range.length===r.length&&yn(n.range,r):bn({...n,low:1},e,t)}if(Ht(e)===`record`){let r=an(t);if(!r){if(M(t))return sn(t,e);throw new m(`Attempted to check equality of record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length===r.domain.length&&yn(n.domain,r.domain)&&yn(n.range,r.range)}return bn({...n,low:nn(n.domain)},e,t)},Sn=(e,t)=>{if(hn(e,t))return Xt(e,t);if(!st(e))return Sn(P(e),t);if(!A(t)){if(M(t))return sn(t,e);throw new m(`Attempted to check equality of the set ${L(e)} with the value:\n${L(t)}`)}let n=gn(e,t);return n.elements.length===n.otherElements.length&&yn(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(M(t))return sn(t,e);throw new m(dn(e,t,!0))}return e.kind===`ModelValue`?ln(e,t):j(e)?xn(e,t):Sn(e,t)},wn=e=>{let t=[];for(let n of e){let e=En(n,t);e.isFound||t.splice(e.index,0,n)}return t},Tn=(e,t)=>{let n=wr.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},En=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=Tn(e,()=>vn(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}},Dn=(e,t)=>t.some(t=>Tn(t,()=>Cn(t,e))),On=/* @__PURE__ */ new WeakSet,kn=e=>{typeof e==`object`&&(e.kind===`Set`&&(On.add(e),e.elements.forEach(kn)),e.kind===`Function`&&(e.domain.forEach(kn),e.range.forEach(kn)))},An=(e,t)=>Tr(Xt,Cn,e,t),jn=e=>{for(let t=1;t<e.length;t++)if(Ft(e[t-1],e[t])>=0)return!1;return!0},Mn=e=>{for(let t=1;t<e.length;t++)Jt(e[t]);if(e.length<2||jn(e))return Rt(e);let t=[...e].sort(Ft),n=[t[0]];for(let e=1;e<t.length;e++)Ft(n[n.length-1],t[e])!==0&&n.push(t[e]);return Rt(n)},Nn=e=>Tr(Mn,e=>({kind:`MixedSet`,elements:e}),e,void 0),Pn=Rt([]),Fn=(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&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0||i.push(t)}return i.length===n.length?e:Rt(i)},In=(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&&Ft(r[a],t)<0;)a++;a<r.length&&Ft(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Rt(i)},Ln=(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=Ft(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=Rt(i);if(e.hash!==0&&e.hash!==Kr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zr(a[n]);if(e===Kr)break;t=t+Wr(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+ei(a[e])|0;c.fingerprint=t}return c},Rn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Ft(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Ft(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return zt(n,r)},zn=e=>{let t=Rn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:dt(t,e.map(e=>e[0]))},Bn=[],Vn=/* @__PURE__ */ new Map,Hn=[],Un=/* @__PURE__ */ new WeakMap,Wn=e=>{let t=Bn[e]??Vn.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Vn.set(e,new WeakRef(n)):Bn[e]=n,n},Gn=e=>{if(vr(e),e.low===1&&e.high>=1)return Wn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Kn=e=>e.length>0&&(e===Bn[e.length]||e===Vn.get(e.length)?.deref()||Un.has(e)),qn=e=>{let t=P(e).elements;return Kn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Jn=e=>{let t=Hn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Hn[e]=n,n},Yn=e=>Vt(zt(Wn(e.length),e),`tuple`),Xn=e=>Vt(Rn(e),`record`),Zn=(e,t)=>Vt(zt(e,t),`record`),Qn=e=>A(e)&&!At(e),$n=(e,t=!1)=>`UNION(${L(e.base,t)})`,er=(e,t=e=>P(e).elements)=>{if(!Qn(e.base))throw new m(`Attempted to enumerate the nonenumerable set:\n${$n(e)}`);return t(e.base)},tr=(e,t,n)=>{if(Qn(e))return e;throw new m(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${$n(n)}`)},N=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||nr(e.domain)===!0||nr(e)===!0;case`RecordSet`:return e.sets.every(N)||nr(e)===!0;case`ProductSet`:return e.factors.every(N)||nr(e)===!0;case`Union`:return N(e.base)&&dr(e.base).every(N);case`SetOperation`:return e.operator===`\\cup`?N(e.left)&&N(e.right):e.operator===`\\cap`?N(e.left)||N(e.right):N(e.left);default:return!1}},nr=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=nr(e.domain);return t===void 0?void 0:!t&&nr(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=nr(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return N(e)?P(e).elements.length===0:void 0;default:return}},rr=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},ir=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},ar=e=>{if(typeof e!=`object`||e.kind!==`Subset`||At(e.base))return;let t=P(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:ir(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Rt(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},or=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Rt(r.map(t=>e[t])));while(ir(r,e.length))}return t},sr=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(At(a))throw new m(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},cr=(e,t=e=>P(e).elements)=>{if(typeof e!=`object`)throw new m(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return wn(e.elements);case`Interval`:{let t=Gn(e);return t!==Bn[t.length]&&Un.set(t,e),t}case`Subset`:{if(vr(e.base)===0)return or([]);if(!A(e.base))throw new m(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${it(L(e.base))}`);let t=P(e.base).elements;if(t.length>30)throw new m(_r(e));return or(t)}case`FunctionSet`:{if(!Tt.is174&&F(e))return[];if(At(e.domain))throw new m(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=qn(e.domain);if((n.length>0||Tt.is174)&&At(e.range))throw new m(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return rr(n.map(()=>r)).map(e=>zt(n,e))}case`RecordSet`:{if(!Tt.is174&&F(e))return[];let n=sr(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${L(t)}`);return rr(n).map(t=>Xn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Tt.is174&&F(e))return[];let n=sr(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${L(e)}`);return rr(n).map(Yn)}case`FilteredSet`:if(!A(e.base)||At(e.base))throw new m(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return P(e.base).elements.filter(e.test);case`Union`:{let t=er(e).flatMap((t,n)=>P(tr(t,n,e)).elements);return P(Nn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Qn(e.left)||!Qn(e.right)))throw new m(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Qn(e.left)&&!Qn(e.right))throw new m(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Qn(e.left))throw new m(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Tr(e=>Ln(P(e.left),P(e.right)).elements,e=>wn(lr(e)),e,e);let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return P(n).elements.filter(t=>Er(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new m(`Expected a set but found ${L(e)}`)}},P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Rt(cr(e));let t=typeof e==`object`&&at(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=wr.sets;n?.push(e);let r=cr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Rt(r):Mn(r);return t&&(t.enumerated=i),i},lr=e=>[...P(e.left).elements,...P(e.right).elements],ur=e=>typeof e==`object`&&e.kind===`SetOperation`&&e.operator===`\\cup`?Tr(e=>P(e).elements,e=>wn(Tn(e,()=>lr(e))),e,e):P(e).elements,dr=e=>{if(typeof e!=`object`||Wt(e))return P(e).elements;let t=wr.sets;t?.push(e);let n=hr(e);return t?.pop(),n},fr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,pr=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(pr);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(pr)&&e.range.every(pr);case`SetOperation`:return e.operator!==`\\cup`&&pr(e.left)&&pr(e.right);case`FilteredSet`:return pr(e.base);case`ProductSet`:return e.factors.every(pr);default:return!1}},mr=e=>typeof e!=`object`||Wt(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?mr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||mr(e.left)||mr(e.right):fr(e)?.some(mr)??!1,hr=e=>{if(e.kind===`Union`)return er(e,dr).flatMap((t,n)=>dr(tr(t,n,e)));if(e.kind===`FilteredSet`&&!At(e.base))return dr(e.base).filter(e.test);if(fr(e)?.some(mr))return cr(e,dr);if(e.kind!==`SetOperation`)return P(e).elements;if(e.operator===`\\cup`)return!Qn(e.left)||!Qn(e.right)?P(e).elements:[...dr(e.left),...dr(e.right)];let t=e.operator===`\\`||Qn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Qn(n)?dr(n).filter(t=>Er(t,r)===(e.operator===`\\cap`)):P(e).elements},F=e=>{if(typeof e!=`object`||!A(e))throw new m(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new m(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(F);case`RecordSet`:return e.sets.some(F);case`FunctionSet`:return!F(e.domain)&&F(e.range);case`Union`:return er(e).every((t,n)=>F(tr(t,n,e)));default:return P(e).elements.length===0}},gr=(e,t,n)=>e.reduce((e,r)=>{let i=e*vr(r,t);if(i>2147483647)throw new m(n());return i},1),_r=e=>`Overflow when computing the number of elements in:\n${L(e)}`,vr=(e,t)=>{if(typeof e!=`object`)throw new m(`Attempted to compute the number of elements in the ${ct(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new m(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return vr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new m(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new m(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=vr(e.base,t);if(n>=31)throw new m(_r(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(F(e.domain))return 1;if(F(e.range))return 0;if(vr(e.range,t)===1)return 1}let n=vr(e.domain,t),r=vr(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new m(_r(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&F(e)?0:gr(e.sets,t,()=>_r(e));case`ProductSet`:return t!==`1.7.4`&&F(e)?0:gr(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return Jt(e),P(e).elements.length}},yr=e=>`Attempted to check if the set ${L(e)}is finite.`,br=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new m(`Attempted to check if the ${ct(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new m(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return br(e.base)&&F(e.base);case`Subset`:return br(e.base);case`FunctionSet`:{let t=br(e.domain);if(t&&F(e.domain))return!0;let n=br(e.range);return n&&F(e.range)?!0:n&&(t||vr(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n={isAllFinite:!0};for(let e of t)if(!br(e))n.isAllFinite=!1;else if(F(e))return!0;return n.isAllFinite}case`Union`:if(!Qn(e.base))throw new m(`Attempted to check if the nonenumerable set:\n${$n(e)}\nis a finite set.`);return P(e.base).elements.every(br);case`SetOperation`:if(e.operator===`\\cup`)return br(e.left)&&br(e.right);if(e.operator===`\\cap`){if(!br(e.left)&&!br(e.right))throw new m(yr(e));return!0}if(br(e.left))return!0;if(!br(e.right))throw new m(yr(e));return!1;case`FilteredSet`:if(!br(e.base))throw new m(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},xr=(e,t,n=Ft)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},Sr=e=>{if(typeof e!=`object`||!j(e))return;let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Cr=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!j(t))return`${n} ${ct(t)} ${L(t)}`;let r=Ht(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)}`},wr={sets:void 0},Tr=(e,t,n,r)=>{let i=wr.sets,a=wr.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof m))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Er=(e,t)=>{let n=wr.sets;if(n===void 0)return kr(e,t);n.push(t);let r=kr(e,t);return n.pop(),r},Dr=(e,t)=>xr(t.elements,e)!==-1,Or=(e,t)=>On.has(t)?En(e,t.elements).isFound:Dn(e,t.elements),kr=(e,t)=>{if(!A(t))throw new m(Cr(e,t));switch(t.kind){case`Set`:return Jt(e),Tr(Dr,Or,e,t);case`MixedSet`:return Dn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!M(e))throw new m(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(M(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new m(`Attempted to check if the value:\n${L(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!A(e)||At(e))throw new m(`Attempted to check if the non-enumerable value\n${it(L(e))}\nis element of\n${it(L(t))}`);return P(e).elements.every(e=>Er(e,t.base));case`FunctionSet`:{if(!j(e)){if(M(e))return!1;throw new m(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${it(L(t))}`)}let n=I(e),r=nn(n.domain);return(r===void 0?An(t.domain,Rt(n.domain)):An({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Er(e,t.range))}case`RecordSet`:{let n=j(e)?I(e):void 0;if(!n||!ht(n.domain)){if(M(e))return!1;throw new m(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=xr(n.domain,e);return i!==-1&&Er(n.range[i],t.sets[r])})}case`ProductSet`:{let n=j(e)?Sr(e):void 0;if(n===void 0){if(j(e)&&I(e).domain.every(e=>typeof e==`number`)||M(e))return!1;throw new m(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Er(e,t.factors[n]))}case`FilteredSet`:return Er(e,t.base)&&t.test(e);case`Union`:if(!Qn(t.base))throw new m(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${$n(t)}`);return P(t.base).elements.some(t=>Er(e,t));case`SetOperation`:return t.operator===`\\cup`?Er(e,t.left)||Er(e,t.right):Er(e,t.left)&&Er(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Sr(e);if(n===void 0){if(M(e))return!1;throw new m(`Attempted to check if the value:\n${it(L(e))}\nis an element of ${it(L(t))}.`)}return n.every(e=>Er(e,t.base))}default:throw new m(Cr(e,t))}},Ar=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Er(e,n):e.range.every((e,r)=>Ar(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;N(e.domain)||vr(e.domain);let t=qn(e.domain);return e.enumerated=Vt(zt(t,t.map(t=>e.apply(t))),Ht(e)),e.enumerated}throw new m(`Expected a function but found ${L(e)}`)},jr=(e,t,n)=>{let r=it(L(e)),i=it(L(t)),a=n===`1.7.4`;switch(Ht(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Mr=(e,t)=>{if(!Tt.is174)return jr(e,t);let n=it(L(t));return Ht(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Nr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Pr=e=>new m(`Attempted to apply function with integer domain to the non-integer argument ${it(L(e))}`),Fr=(e,t,n)=>{throw Tt.is174||e.length<32?e.forEach(e=>Cn(e,t)):xr(e,t,vn),n},Ir=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Ht(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new m(n(e,t));if(a===void 0&&!Tt.is174&&Kn(r))throw Pr(t)}let i=Nr(r,t);return i===-1?Tr(xr,Fr,r,t):i},Lr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Er(t,e.domain))throw new m(Ht(e)===`lambda`?jr(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new m(`Attempted to apply ${L(e)}, which is not a function`);let r=n??jr,i=Ir(e,t,r);if(i===-1)throw new m(r(e,t));return e.range[i]},Rr=e=>Kn(e)?Un.get(e)??Jn(e.length):void 0,zr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e).domain;return Rr(t)??Rt(t)},Br=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!N(e.domain))){if(!Er(t,e.domain))return e;let r=n(e.apply(t));return Vt({kind:`LazyFunction`,domain:e.domain,apply:n=>An(t,n)?r:e.apply(n),source:e.source},Ht(e))}if(!j(e))throw new m(`Attempted to apply EXCEPT construct to the value ${it(L(e))}.`);let i=I(e),a=Ir(i,t,Mr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Vt(zt(i.domain,o),Ht(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Kr){let e=Zr(c);if(e!==Kr){let t=Zr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Gr(t,Zr(s))+Gr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-ti(e,s)+ti(e,c)|0}return l},Vr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hr=(e,t)=>Math.imul(e^t,16777619),Ur=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vr(t)},Wr=e=>Vr(e+2654435769|0),Gr=(e,t)=>Vr(Math.imul(e,668265261)+t|0),Kr=795548749,qr=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zr(t[e]);if(r===Kr)return Kr;n=n+Wr(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Zr(e.domain[n]),i=Zr(e.range[n]);if(r===Kr||i===Kr)return Kr;t=t+Gr(r,i)|0}return t},Jr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new m(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(A(e)){P(e).elements.forEach(Jr);return}let t=I(e);t.domain.forEach(Jr),t.range.forEach(Jr)},Yr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Zr(e)===Kr&&Jr(e);return}catch(e){if(!(e instanceof m))throw e;return e}},Xr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Zr=e=>typeof e==`number`?Vr(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Ur(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=qr(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?N(e.domain)?Zr(I(e)):Kr:N(e)?Zr(P(e)):Kr,Qr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$r=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qr(t)},ei=e=>Qr(ri(e)+2135587861|0),ti=(e,t)=>Qr(Math.imul(ri(e),374761393)+ri(t)|0),ni=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ei(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+ti(e.domain[n],e.range[n])|0;return t},ri=e=>typeof e==`number`?Qr(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?$r(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ni(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?ri(I(e)):N(e)?ri(P(e)):$r(ii(e)),ii=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ai(e),ai=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ii(e.base)}>`;if(e.kind===`FilteredSet`&&!N(e))throw new m(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(A(e))return N(e)?`{${P(e).elements.map(ii).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${ii(e)}:${ii(t.range[n])}`).join(`,`)})`},oi=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,si=e=>e.reduce((e,t)=>e===0?0:e*vr(t),1),ci=e=>{if(e.kind===`Subset`)return vr(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`&&N(e.domain)&&vr(e.domain)===0)return Rt([zt([],[])]);let t=e.kind===`FunctionSet`?vr(e.range)**vr(e.domain):si(e.kind===`RecordSet`?e.sets:e.factors);return t===0?Pn:t<=1999?P(e):void 0},li=(e,t)=>{if(t)return ci(e);if(N(e))try{return ci(e)}catch(e){if(e instanceof m)return;throw e}},ui=(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 $n(e,t)}},di=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),fi=e=>{if(N(e.domain))try{return I(e)}catch(e){if(e instanceof m)return;throw e}},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 oi(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(P(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=li(e,t);return n?r(n):ui(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?fi(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Tt.is174&&Ht(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&Ht(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Ht(e)===`record`||i.domain.every(e=>typeof e==`string`&&di(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ft(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},pi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${it(L(n))}\n`).join(``)},mi=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),hi=(e,t)=>mi.has(e)?new m(t):new n(t),gi=(e,t,r,i)=>new n(`The ${e} argument of ${t} should be a ${r}, but instead it is:\n${L(i)}`),_i=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||_i(r))throw hi(n,`${n} expects a value as argument ${t+1}`);return r},vi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`number`)throw hi(n,`${n} expects an integer but received ${L(r)}`);return r},yi=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw hi(n,`${n} expects a boolean but received ${L(r)}`);return r},bi=(e,t,n)=>{let r=R(e,t,n);if(!A(r))throw hi(n,`${n} expects a set but received ${L(r)}`);return r},xi=(e,t,n)=>{let r=bi(e,t,n);if(!N(r))throw hi(n,`${n} cannot enumerate the non-enumerable set ${L(r)}`);return r},Si=(e,t,n)=>P(xi(e,t,n)).elements,Ci=(e,t,n)=>{let r=R(e,t,n),i=Sr(r);if(!i)throw hi(n,`${n} expects a sequence but received ${L(r)}`);return i},wi=(e,t,n)=>{let r=R(e,t,n);if(!j(r))throw hi(n,`${n} expects a function but received ${L(r)}`);return I(r)},Ti=(e,t,n)=>{let r=e[t];if(r===void 0||!_i(r))throw hi(n,`${n} expects an operator as argument ${t+1}`);return r},Ei=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),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}),Di=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Oi=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ki=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ai=e=>e>2147483647||e<-2147483648,ji=e=>new n(`Overflow when computing ${e}`),Mi={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Ni={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Pi={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Fi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Ii=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Ni[e.operator];if(e.kind!==`Function`)return Mi[e.kind];let t=Ht(e);return t===void 0?`FcnRcdValue`:Fi[t]},Li=e=>Pi[Ii(e)],Ri=(e,t)=>new m(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),zi=(e,t)=>{let r=r=>(...i)=>{let a=wr.sets?.length??0;try{return r(...i)}catch(r){throw r instanceof m&&(e.isLazy===!0||!(r instanceof n))?(wr.sets&&(wr.sets.length=a),Ri(t,r.message)):r}};return{...e,evaluate:r(e.evaluate),evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Bi=(e,t)=>{if(typeof e!=`number`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.IntValue`);return e},Vi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Hi=(e,t,n,r)=>{let i=Vi(e,n,`IntValue`,2);return ki(t,(e,n)=>{let a=Bi(e,i),o=Bi(n,i),s=r(a,o);if(Ai(s))throw ji(`${a}${t}${o}`);return s})},Ui=(e,t,r)=>{if(typeof e!=`number`)throw new n(`The ${t} argument of ${r} should be an integer, but instead it is:\n${L(e)}`);return e},Wi=(e,t,n=e)=>ki(e,(e,r)=>t(Ui(e,`first`,n),Ui(r,`second`,n))),Gi=(e,t,n)=>({...Oi(e,t,n),isLazy:!0}),Ki=(e,t,n)=>{let r=Ti(e,t,n);return()=>r.call([])},qi=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),Ji=()=>({bool:Lu,condition:(e,t)=>{if(typeof e!=`boolean`)throw bu(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw xu(t,n,e);return e},apply:Lr,expectFunction:Pu,tuple:Yn,set:Nn,record:Zn,writtenRecord:pt,equal:Xt,enumerate:Wu,unassigned:(e,t)=>{throw Ou(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:Fu,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Mu(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Yi={value:void 0},Xi={isAllowed:void 0},Zi=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Qi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),$i=e=>`local${e.counter++}`,ea=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Je(e).forEach(e=>ea(e,t)),t),ta=(e,t,n)=>{let r=Qi(e,V(t,e.environment)),i=ea(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Qi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},na=(e,t,n)=>{let r=t.kind===`Forall`,i=JSON.stringify(r?`the body of \\A`:`the body of \\E`),a=`quantifier${e.counter++}`,o=[...n.locals.values()],s={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(n.locals)},c=t.bounds.map(()=>$i(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${oa(e,t.set,s)}, ${Qi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=$i(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${oa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=$i(e),a=$i(e),o=$i(e),s=c[r];return`for (let ${i} = 0, ${a} = ${s}.low, ${o} = ${a} === undefined ? ${s}.length : ${s}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${s}[${i}] : ${a} + ${i}; ${t} }`},d),p=o.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${a}(context, state, next${p}) { let primed; let applied; ${l.join(` `)} ${f} return ${r}; }`),`${a}(${n.context}, ${n.state}, ${n.isPrimed?`undefined`:n.next}${p})`},ra=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${oa(e,r[0],n)}, "the left side of =>") ? bool(${oa(e,r[1],n)}, "the right side of =>") : true)`;if(k(t))return ta(e,t,n);let i=md(t.operator,e.environment);if(i?.kind!==`Builtin`)return ta(e,t,n);if(i.name===`DOMAIN`)return`${Qi(e,wu(t))}(${oa(e,r[0],n)})`;if(i.name===`TLCEval`)return ta(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Qi(e,Tu(t,i))}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Ud(r[0],a))return`${Qi(e,i.evaluateUnary)}(${oa(e,r[0],n)})`;let o=r.length===2&&Ud(r[0],a)&&Ud(r[1],a);return i.evaluateBinary&&o?`${Qi(e,i.evaluateBinary)}(${oa(e,r[0],n)}, ${oa(e,r[1],n)})`:ta(e,t,n)},ia=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(k(e))return!1;let r=Td(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ia(e.expression,t,n);case`FieldAccess`:return ia(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ia(e,t,n));default:return!1}},aa=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return aa(e.record);case`FunctionApplication`:return[e.function,...e.args].every(aa);default:return!1}},oa=(e,t,n)=>{let r=(t,r=n)=>oa(e,t,r);switch(t.kind){case`Number`:return lt(t.value)?String(t.value):ta(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(k(t))return ta(e,t,n);let i=Td(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Qi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Qi(e,i.value):ta(e,t,n)}case`Apply`:return ra(e,t,n);case`And`:case`Or`:{let n=Qi(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Qi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Qd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ia(t.function,n,e.environment)?r(t.function):aa(t.function)?r(t.function,i):ta(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Qi(e,t)}))`,o=Cu(e.environment.runtime.version),s=o?`, ${Qi(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Qi(e,Su(t))}(${r(t.record)})`;case`Record`:{let i=of(t.fields);if(sf(i))return ta(e,t,n);let a=Qi(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Qi(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:{let i=Qi(e,t);if(n.isPrimed)return`primeOutsideAction(${i})`;let a={context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals};return`(${n.next} === undefined ? primeOutsideAction(${i}) : ${r(t.expression,a)})`}case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?na(e,t,n):ta(e,t,n);default:return ta(e,t,n)}},sa=(e,t)=>{if(!qi.has(e.kind)||(Xi.isAllowed??=Zi(),!Xi.isAllowed))return;let n={environment:t,references:[],helpers:[],counter:0},r=oa(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
87
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;Yi.value??=Ji();let o=Yi.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ca={general:1e3,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,behaviorUpToThisPoint:2121,backToState:2122,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,finished:2186,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,temporalBranches:2212,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,version:2262,noSpecificationButProperty:2257,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001},la={none:0,error:1,warning:3,state:4},ua={0:``,1:`Error: `,3:`Warning: `,4:`State `},da=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===la.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
88
- (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${ua[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},fa=`The configuration file did not specify the initial state predicate.
9
+ import{$ as e,A as t,B as n,C as r,F as i,G as a,H as o,I as s,J as c,K as l,P as u,Q as d,S as f,V as p,X as m,Y as h,Z as g,_,b as v,et as y,g as b,nt as x,ot as S,q as ee,rt as C,u as te,v as w,w as ne,x as T,y as E,z as re}from"./worker.js";import{gzipSync as ie}from"node:zlib";const ae=/* @__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(`.`)),oe=/* @__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`]]),se=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),ce=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),D=/* @__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]]),le=e=>e.startsWith(`\\`)?parseInt(e.slice(2),O.get(e[1].toLowerCase())):Number(e),k=/-{4,} *MODULE\b/,A=/* @__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)A[n.charCodeAt(0)]|=e});const ue=(e,t)=>e<128&&(A[e]&t)!==0,de=(e,t,n)=>{let r=t;for(;ue(e.charCodeAt(r),n);)r++;return r},fe=/* @__PURE__ */ new Map;ce.forEach(e=>{let t=e.charCodeAt(0),n=fe.get(t)??[];n.push(e),fe.set(t,n)});const pe=(e,t)=>{let n=fe.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]}},me=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(D.has(n))return n;let r=e[t];return D.has(r)?r:void 0},he=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&ue(e.charCodeAt(t+1),2)){let n=e.slice(t+1,de(e,t+1,2)),r=n.length;for(;r>0&&!oe.has(n.slice(0,r));)r--;let i=oe.get(n.slice(0,r));return{text:i??`\\`,length:i===void 0?1:r+1}}let r=me(e,t);if(r!==void 0)return{text:D.get(r)??``,length:r.length};let i=pe(e,t);return i?{text:se.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},ge=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),_e=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>D.has(e)||ge.has(e));return n===void 0?void 0:{text:n,length:n.length}},ve=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},ye=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:de(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?de(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return ve(e,s?o+1:o,e=>e===`.`)-t},be=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,xe={n:`
10
+ `,t:` `,r:`\r`,f:`\f`},Se=(e,t)=>t===9?e+8-e%8:e+1,Ce=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),we=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=Ce.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=de(e,t+2,i);return a===t+2?0:a-t},Te=(e,t=!1)=>{let n=k.exec(e);if(!n)throw new s(`Expected a module header such as ---- MODULE Name ----`);let r=[],i=/* @__PURE__ */ new Map,a=e.slice(0,n.index).split(`
11
+ `),o=n.index,c=a.length,l=n.index-a[a.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==l||f>o)&&(d=l,f=l,p=0);f<o;f++)p=Se(p,e.charCodeAt(f));return Se(p,e.charCodeAt(o))},h=(e,t,n,i)=>{let a=m();r.push({kind:e,text:t,spelling:i,line:c,column:a,endColumn:a+n-1}),o+=n},g=t=>{for(let n=0;n<t;n++)e.charCodeAt(o)===10&&(c++,l=o+1),o++},_=t=>new s(`${t} at line ${c}, column ${m()}`,void 0,{reason:t,line:c,column:m(),isEnd:o>=e.length});for(;o<e.length;){let n=e.charCodeAt(o);if(n===10||n===32||n===9||n===13){g(1);continue}if(n===92&&e.charCodeAt(o+1)===42){g(ve(e,o,e=>e!==`
12
+ `&&e!==`\r`)-o);continue}if(n===40&&e.charCodeAt(o+1)===42){let t=0;do{if(o>=e.length)throw _(`Unterminated comment`);e.startsWith(`(*`,o)?(t++,g(2)):e.startsWith(`*)`,o)?(t--,g(2)):g(1)}while(t>0);continue}if(n===45&&e.startsWith(`----`,o)){let t=ve(e,o,e=>e===`-`)-o,n=ve(e,o+t,e=>e===` `);e.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,o)){if(h(`ModuleEnd`,`====`,ve(e,o,e=>e===`=`)-o),u--,u<=0)break;continue}if(n===34){let t=c,n=m(),i=[];for(g(1);e.charCodeAt(o)!==34;){let t=e.charCodeAt(o);if(o>=e.length||t===10||t===13)throw _(`Unterminated string`);if(t===92){let t=e[o+1];if(t===void 0||!`ntrf\\"`.includes(t))throw _(`Invalid escape in string`);i.push(xe[t]??t),g(2)}else i.push(e[o]),g(1)}g(1),r.push({kind:`String`,text:i.join(``),line:t,column:n,endColumn:m()-1});continue}let a=we(e,o,t);if(a>0){h(`Number`,e.slice(o,o+a),a);continue}if(ue(n,7)){let t=de(e,o,7),r=e.slice(o,t),a=de(e,o,1);if(a===t){let n=e.charCodeAt(t)===46?de(e,t+1,1):t,i=n>t+1,a=i?e.slice(o,n):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(o,a);h(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let s=i.get(r)??r;i.set(s,s),h(ae.has(r)?`Keyword`:`Identifier`,s,r.length);continue}let s=e[o];if(n>=128&&ge.has(s)){h(`Identifier`,i.get(s)??s,1),i.set(s,s);continue}if(n===60){let n=ye(e,o,t);if(n>0){h(`Step`,e.slice(o,o+n),n);continue}}let l=he(e,o);if(l){let t=e.slice(o,o+l.length);h(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw _(`Unexpected character ${JSON.stringify(s)}`)}let v=m();return r.push({kind:`End`,text:``,line:c,column:v,endColumn:v}),r},Ee=[[`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`]],De=Ee.map(e=>e[0]),Oe=new Map(De.map((e,t)=>[e,t]).reverse()),j=e=>{let t=Oe.get(e);if(t===void 0)throw new v(`Unknown SANY token kind ${e}`);return t},ke=new Map(Ee.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),Ae=Math.max(...[...ke.keys()].map(e=>e.length)),je=Array.from({length:Ae},(e,t)=>Ae-t),Me=/----+ *MODULE/y,Ne=[/_\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],Pe=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`)),Fe=Pe(String.raw`\.\/\\`),Ie=Pe(String.raw`\.\\\/`),Le=String.raw`<(?:[0-9]+|\+|\*)>`,Re=[[`_BM0`,[Me]],[`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`,Fe],[`BOR`,Ie],[`IDENTIFIER`,Ne],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Le}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Le,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Le}(?:\*\.*|-\.*|\.+)`,`y`)]]],ze=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Me]]],Be=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Me]],[`BAND`,Fe],[`BOR`,Ie],[`IDENTIFIER`,Ne]],Ve=(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,Ue=(e,t,n)=>e.map(e=>({kind:j(e[0]),length:Math.max(...e[1].map(e=>Ve(e,t,n)))})).reduce(He,{kind:-1,length:0}),We=(e,t)=>{let n=je.find(n=>ke.has(e.slice(t,t+n))),r=Ue(Re,e,t);return n===void 0?r:He(r,{kind:ke.get(e.slice(t,t+n))??-1,length:n})},Ge=e=>e+8-e%8,Ke=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=Ge(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},qe=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Je=new Set([...ke.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Ye=(e,t)=>{let n=0;for(;Je.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Ve(qe,e,t)))},Xe=e=>{let t=Ke(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(j(`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?$e(o,s,e[a],i):t.lines[n]===o?e[a]===`
15
+ `||e[a]===`\r`?$e(o+1,0,void 0,i):$e(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=Ue(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,De[a.kind].startsWith(`_BM`)&&(r=`SPEC`),De[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(ze);if(r===`PRAGMA`)return c(Be);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=We(e,t);if(r.length===0){let n=Ye(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()}},Ze=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
17
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Qe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ze.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),$e=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Qe(n)}" (${n.charCodeAt(0)}), `}after : "${Qe(r)}"`,et=e=>{let t=Xe(e);for(let e=t();typeof e!=`string`&&e.kind!==j(`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===` `?Ge(e):e+1,e.beginColumn);return $e(e.beginLine,n,e.image[t],e.image.slice(0,t))}},tt=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],nt=/* @__PURE__ */ new Set([...tt,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),rt=[`TYPE`,`TYPE_CONSTRAINT`],it=/* @__PURE__ */ new Set([...tt,...rt]),at=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],M=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},ot=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:$e(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:$e(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=M(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=we(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=_e(e,n)??he(e,n),m=at.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},st=(e,t)=>new w(`TLC found an error in the configuration file at line ${e}\n${t}`),ct=(e,t)=>st(e,`The keyword ${t} appeared twice.`),lt=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),ut=/* @__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`]]),dt=(e,t=`master`)=>{let n=t===`1.7.4`?it:nt,r=ot(e),i=0,a={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},o=!1,s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i++,r.length-1)];if(e.kind===`Error`)throw new w(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`&&e.text.startsWith(`\\`))throw S(new w(`${y(`java.lang.NumberFormatException`)}For input string: "${e.text}"`),C.error);if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`&&e.text.includes(`\\`))throw new w(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${e.line}`);if(e.kind===`String`)return{kind:`String`,value:e.text.slice(1,-1)};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t=c();if(t.text!==`}`)for(;e.push(l(t)),t=c(),t.text===`,`;)t=c();if(t.text!==`}`)throw st(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw st(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw st(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw st(n.line,`It was expecting ], but did not find it.`);return t.text},d=(e,t)=>{let n=e.text,r=c();for(;r.text===`!`;)n=`${n}!${c().text}`,r=c();if(r.text===`<-`){if(r=c(),r.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw st(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw st(r.line,`Expected an identifier after <-.`);a.substitutions.push({name:n,target:r.text});return}let i=[],o=r.text===`(`;if(o){for(;i.push(l(c())),r=c(),r.text===`,`;);if(r.text!==`)`)throw st(t,``);r=c()}if(r.text!==`=`)throw st(r.line,`It was expecting = or <-, but did not find it.`);r=c();let s=r.text===`[`?u(`=`):void 0,d=l(s===void 0?r:c());a.constants.push({name:n,value:d,...o&&{args:i},...s!==void 0&&{module:s}})},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let o=i-1;d(t,e),a.rawConstants.push(r.slice(o,i).map(e=>e.text).join(` `))}},p=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},m=c();for(;m.kind!==`End`;){let e=m.text,t=m.line,r=n.has(e)?lt.get(e):void 0,i=n.has(e)?ut.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw st(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw ct(t,e);a[r]=n.text,m=c()}else if(i!==void 0)m=p(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)m=f(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw st(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o)throw ct(t,e);o=!0,a.checkDeadlock=n.text===`TRUE`,m=c()}else{if(!n.has(e)||!rt.includes(e))throw st(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw ct(t,e);s.add(e),m=c()}}return a},ft=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],pt=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(ft),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:[]);case`Selection`:return[e.expression]}},mt=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},N=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,ht=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},gt=e=>{let t=ht(e);return t^t>>>16},_t=e=>{let t=[...new Set(e)],n=2**Math.max(4,Math.ceil(Math.log2(t.length/.75)));return t.map((e,t)=>({name:e,index:t,bucket:gt(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},vt={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:` `}},yt=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},bt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),xt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),St=e=>{let t=t=>{let n=ve(e,t,yt);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=ve(e,t,bt);if(e.startsWith(`..`,n)&&bt(e[n+2]))return{kind:`Constant`,first:t,last:ve(e,n+2,bt)-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=bt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ve(e,t+1,bt)-1,children:[]};if(xt(n))return{kind:`Constant`,first:t,last:ve(e,t,xt)-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)},P=e=>{let t=e.length===0?void 0:St(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=vt[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},Ct={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},wt={none:0,error:1,warning:3,state:4},Tt={0:``,1:`Error: `,3:`Warning: `,4:`State `},Et=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Tt[n]}${r}`,Dt=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===wt.warning;if(a&&e.errorCodes?.includes(n))throw new o(n,i);if(a&&e.isWarningEnabled===!1||r!==wt.error&&e.suppressedCodes?.includes(n))return;let s=a&&!e.isTool&&t.size===0?`
20
+ (Use the -nowarning option to disable this warning.)`:``,c=Et(e.isTool,n,r,`${i}${s}`);a&&t.has(c)||(a&&t.add(c),console.log(c))}}},Ot=`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.`,pa=[[1005,y,!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.`,kt=[[1005,te,!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,b,!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,fa,!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,Ot,!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,16 @@ 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]],ma={value:void 0},ha=()=>ma.value??=pa.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),ga=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,_a=e=>ga.test(e)?void 0:ha().find(t=>t.pattern.test(e))?.message,va=e=>e instanceof n||_a(e.message)?.isEvalException===!0,ya=/* @__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 At;const jt=()=>At??=kt.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),Mt=/^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)\)\./,Nt=e=>Mt.test(e)?void 0:jt().find(t=>t.pattern.test(e))?.message,Pt=e=>e instanceof t||Nt(e.message)?.isEvalException===!0,Ft=/* @__PURE__ */ new Map([[1e3,`
132
68
  : `],[2105,`failed.
133
69
  `],[2154,`but it produced the following error:
134
- `],[2213,`:
135
- `],[2281,` - specifically: `]]),ba=(e,t,n)=>{let r=n?ya.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)}${xa(t.slice(a),n)}`},xa=(e,t)=>{let n=t?_a(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${la.none} @!@!@\n${ba(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Sa=e=>String(e).padStart(2,`0`),Ca=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 ${Sa(r%24)}h`:e>36e5?`${Sa(r%24)}h ${Sa(n)}min`:e>6e4?`${Sa(n)}min ${Sa(t)}s`:`${Sa(t)}s`},wa=e=>`${e.getFullYear()}-${Sa(e.getMonth()+1)}-${Sa(e.getDate())} ${Sa(e.getHours())}:${Sa(e.getMinutes())}:${Sa(e.getSeconds())}`,Ta=/* @__PURE__ */ new WeakMap,Ea=(e,t,n)=>{if(!(e instanceof m))return e;let r=v(new m(`${n}\n${e.message}`,e),o(e));return Ta.set(r,{code:t,headline:n,inner:e}),r},Da=e=>Ta.has(e),Oa=i.slice(0,i.indexOf(`
136
- `)),ka=`${i}tlc2.tool.EvalException: `,Aa=`${i}util.Assert$TLCRuntimeException: `,ja=e=>va(e)?ka:Aa,Ma=e=>{try{return e()}catch(e){throw e instanceof m?va(e)?new m(`${u}${e.message}`):_a(e.message)?e:new m(`${i}${e.message}`):e}},Na=[ka,Aa,i,u],Pa=(e,t)=>{let n=Ta.get(e);if(n)return`${n.headline}\n${Pa(n.inner,t)}`;let r=e.message,i=Na.find(e=>r.startsWith(e))??``;return`${i}${xa(r.slice(i.length),t)}`},Fa=(e,t)=>{let n=Ta.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Pa(e,!0)};if(t&&va(e))return{code:_a(r)?.code??ca.general,message:r,toolMessage:r};let a=t&&!r.startsWith(Oa)?i:``;return{code:ca.general,message:`${a}${r}`,toolMessage:`${a}${Pa(e,!0)}`}},Ia={kind:`Local`},La=/* @__PURE__ */ new WeakSet,Ra=/* @__PURE__ */ new WeakMap,za=/* @__PURE__ */ new WeakMap,Ba=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Va=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Ha=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Ua=e=>e.kind===`Operator`?e.params.length:0,Wa=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ga=e=>e.name.includes(`!`),Ka=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},qa=(e,t,n)=>{let r=t.bindings.get(e);return r&&Ha(r.position,t.location)&&(!n||Ha(r.position,n.start))?r:void 0},Ja=(e,n)=>e!==void 0&&n!==void 0&&t(e)===t(n),Ya=(e,n,r,i)=>{if(n===void 0)return!0;if(Ja(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=t(a),s=n.range&&t(n.range);return n.kind===`Builtin`?i.errors.push({location:o,message:`Symbol ${e} 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 '${e}': this definition or declaration conflicts \nwith the one at ${s}.`}):i.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${s}.`}),!1},Xa=(e,t,n,r)=>Ya(t,Ka(e,t)??qa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Za=(e,t,n)=>{Ya(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Qa=(e,t,n,r)=>t.reduce((e,t,i)=>Xa(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),$a=(e,t,n)=>t.reduce((e,t)=>Xa(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),eo=e=>e.kind===`Name`?[e.name]:e.names,to=e=>e.flatMap(e=>eo(e.pattern)),no=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Ha(n.location,t.location))?n:void 0},ro=(e,t)=>{let n=no(e,t);return n?{key:t.getKey(n),arity:Ua(n),params:Wa(n),kind:`Definition`}:t.imported.get(e)},io=(e,t,n)=>Ka(t,e)??ro(e,n),ao=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),oo=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:ao(e.location,e.spelling??t)},so=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Ha(e.location,e.args[0].location)?`prefix`:`postfix`}},co=e=>!/^[\p{L}\d_]/u.test(e),lo=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),uo=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,fo=(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])}})},po=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?fo(e.name,[],void 0):fo(e.operator,e.args,e.argumentCounts),mo=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),ho=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:to(e.bounds),body:e.body,sets:mo(e.bounds)};case`SetMap`:return{names:to(e.bounds),body:e.expression,sets:mo(e.bounds)};case`SetFilter`:return{names:eo(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:eo(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}},go=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}},_o=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,vo=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),yo=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?yo(e.body,t):Je(e).reduce((e,n)=>e??yo(n,t),void 0)},bo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??bo(i,t,n||vo(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&yo(e.set,t):yo(e,t)},xo=e=>e.kind===`Label`?xo(e.body):e,So=e=>typeof e==`number`?`argument selector ${e}`:e,Co=`within the scope of a declaration
137
- from outside that declaration's scope.`,wo=(e,n,r,i,a,o)=>{let s=(n,r)=>{let i=(n===void 0?void 0:e.selectorRanges?.[n])??e.location.range;i&&a.errors.push({location:t(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`&&xo(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:bo(e,t.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?yo(o.body,t.name):void 0};if(!i?.label)return s(r,`Cannot find label \`${t.name}'.`);if(r===1&&l.kind===`AssumeProve`&&vo(l,i.position)&&c)return s(1,`Accessing subexpression labeled \`${t.name}' of ASSUME/PROVE clause ${Co}`);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=So(t.operand);if(u.isSufficesOpen){if(uo(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=xo(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(r,`Selecting subexpression of expression that has none.`);let n=e.kind===`Identifier`?io(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=ho(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:go(e);if(!l)return;let f=uo(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=uo(t.operand,f.length);if(p===-1)return s(r,`Nonexistent operand specified by \`${d}'.`);if(vo(o,p)&&(!u.isGoal||c))return s(r,`Accessing ASSUME/PROVE clause ${Co}`);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.`))},To=(e,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||!e.location.range?!1:(n.errors.push({location:t(e.location.range),message:r}),!0)},Eo=(e,n,r)=>{let i=e.location.range;if(!i||r.isGenerated)return;let a=t(i),o=e.params.filter((i,a)=>{let o=Ka(n,i)?.kind===`Parameter`,s=e.paramRanges?.[a];return!o&&s&&r.errors.push({location:t(s),message:`Illegal parameter ${i} of label \`${e.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(t=>r.errors.push({location:a,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),r.labelParams.filter(e=>!o.includes(e)).forEach(t=>r.errors.push({location:a,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let s=[...new Set(o.filter(e=>!r.labelParams.includes(e))),...e.params.filter(e=>!o.includes(e))];s.length>0&&r.errors.push({location:a,message:`Label ${e.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),r.labels.has(e.name)&&r.errors.push({location:a,message:`Duplicate label \`${e.name}'.`}),r.labels.add(e.name)},Do=(e,t,n,r)=>{if(!_o(e))return!1;let i=po(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ka(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&wo(e,i,o,t,n,r),o!==void 0},Oo=(e,n,r,i)=>{let a=e.location;if(Ro(e,r,i))return;let o=za.get(e);if(o!==void 0)return o;if(Ba(n))return e.kind===`Apply`?e.args.length:0;let s=Ka(r,n);if(s?.isNonFact){i.errors.push({location:t(oo(e,n)),message:`Step number of non-expression step used as an expression.`});return}if(Do(e,r,i,!1)||lo(n)&&s)return e.kind===`Apply`?e.args.length:0;if(s&&e.kind!==`OperatorReference`&&(e.resolution=Ia),s)return s.arity;let c=ro(n,i);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,za.set(e,c.arity),c.arity;let l=n.includes(`!`)?n.slice(0,n.indexOf(`!`)):``;if(l!==``&&(Ka(r,l)!==void 0||ro(l,i)!==void 0||i.facts.has(l)))return e.kind===`Apply`?e.args.length:0;let u=(e.kind===`Identifier`?void 0:e.spelling)??n,d=t(e.kind===`Apply`&&u===`-.`?ao(a,`-`):oo(e,n));if(!co(n)||lo(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=so(e);f&&a.range&&i.errors.push({location:t(a.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},ko=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>Qa(e,eo(t.pattern),t.pattern.ranges,n),t)),Ao=(e,t)=>e.kind===`Identifier`&&e.name===t&&k(e)||Je(e).some(e=>Ao(e,t)),jo=(e,t)=>{e.kind===`FunctionConstruction`&&Ao(e.body,t)&&(e.isRecursive=!0),Je(e).forEach(e=>jo(e,t))},Mo=(e,n,r,i)=>{let a={...r,hasLabelScope:!0,labelParams:e.kind===`Function`?to(e.bounds):[],labels:/* @__PURE__ */ new Set},o=e.name,s=e.location.range,c=e=>{s&&!a.isGenerated&&a.errors.push({location:t(s),message:e})},l=e.kind===`Function`?ko(e.bounds,n,a):$a(n,e.params,a),u=Ka(l,o)??qa(o,a,s),d=u?.isPending===!0&&i.has(u);return u?.isPending&&!d?c(`Recursive ${e.kind===`Function`?`function`:`operator`} ${o} defined at wrong LET/IN level.`):u&&!d&&c(e.kind===`Function`?`Function name \`${o}' already defined or declared.`:`Operator ${o} already defined or declared.`),e.kind===`Function`?(B(e.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},a),jo(e.body,o),e.isSelfReferential=Ao(e.body,o)):B(e.body,l,a),u&&d?(u.isPending=!1,u.range=s,!1):e.kind===`Function`?u===void 0:Ya(o,Ka(n,o)??qa(o,a,s),{kind:`Definition`,arity:Ua(e),range:s},a)},No=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ka(e,t.name)?.isPending)return e;let n={name:t.name,arity:Ua(t),params:Wa(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>Wo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ba(t.name)?e:s(e,e=>!Ha(t.location,e.location)),o={name:t.name,arity:Ua(t),kind:`Definition`,range:t.location.range,parent:a};if(Ga(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ba(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Mo(t,a,u,i)?{...o,params:Wa(t)}:a},a),()=>!0)},Po=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ka(t,r)??qa(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Fo=(e,n,r)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let i=Po(e.kind===`Identifier`?e.name:e.operator,n,r),a=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!i||a===i.arity)return!1;let o=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return o&&r.errors.push({location:t(o),message:`The operator ${i.name} requires ${i.arity} arguments.`}),!0},Io=(e,n,r)=>{if(Fo(e,n,r))return;let i=e.operator,a=io(i,n,r),o=Oo(e,i,n,r);if(o===void 0)return;if(o!==e.args.length){r.errors.push({location:t(e.argumentsRange??oo(e,i)),message:`The operator ${i} requires ${o-(Po(i,n,r)?.arity??0)} arguments.`});return}let s=a&&(a.kind===`Definition`?a.params:[]);if(s===void 0){e.args.forEach(e=>Lo(e,n,r));return}let c=(e,n)=>{e&&r.errors.push({location:t(e),message:n})};e.args.map((t,a)=>{let o=s[a]??0,l=t.location.range;if(o===0){if(t.kind===`Lambda`&&t.operator!==void 0)c(l,`The operator ${t.operator} requires 1 arguments.`);else if(t.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(t.kind===`OperatorReference`){let e=Oo(t,t.operator,n,r);e!==void 0&&c(l,`The operator ${t.operator} requires ${e} arguments.`)}else B(t,n,r);return!0}if(t.kind===`Lambda`){B(t,n,r);let s=t.params.length===o;return!s&&La.has(t)?c(l,`Expected arity ${o} but found operator of arity ${t.params.length}.`):!s&&l&&t.operator===void 0&&c(e.selectorRanges?.at(-1)??oo(e,i),`Lambda expression with arity ${t.params.length} used as argument ${a+1} of operator \`${i}', \nbut an operator of arity ${o} is required.`),s}if(t.kind===`Subexpression`)return B(t,n,r),!0;if(t.kind===`Apply`&&t.argumentCounts?.at(-1)===0){let e=t.argumentCounts.findIndex(e=>e>0);return c(t.selectorRanges?.[e],`Selector \`${t.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(t.kind!==`Identifier`&&t.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=t.kind===`Identifier`?t.name:t.operator,d=io(u,n,r)?.params??[],f=Oo(t,u,n,r);return t.kind===`Identifier`&&f!==void 0&&f!==o&&c(oo(t,u),`Expected arity ${o} but found operator of arity ${f}.`),f===o&&d.every(e=>e===0)}).forEach((t,n)=>{t||c(e.location.range,`Argument number ${n+1} to operator '${i}' \nshould be a ${s[n]}-parameter operator.`)})},Lo=(e,t,n)=>{e.kind===`Identifier`?Oo(e,e.name,t,n):B(e,t,n)},Ro=(e,t,n)=>{let r=Ra.get(e);return r?(r.args.forEach(e=>Lo(e,t,n)),n.errors.push(r.error),!0):!1},B=(e,n,r)=>{if(La.has(e)&&!r.isGenerated){B(e,n,{...r,isGenerated:!0});return}let i=e=>e.forEach(e=>B(e,n,r)),a=e=>({...r,labelParams:[...r.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Fo(e,n,r))return;let i=e.name,a=Oo(e,i,n,r);a!==void 0&&a>0&&r.errors.push({location:t(oo(e,i)),message:`The operator ${i} requires ${a} arguments.`});return}case`OperatorReference`:Oo(e,e.operator,n,r);return;case`Apply`:Io(e,n,r);return;case`Lambda`:B(e.body,Qa(n,e.params,e.paramRanges,r),a(e.params));return;case`And`:case`Or`:i(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(e.expression,n,r);return;case`If`:i([e.condition,e.consequent,e.alternative]);return;case`Case`:i(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&B(e.other,n,r);return;case`Let`:B(e.body,No(e.definitions,n,r,e.instances),r);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,ko(e.bounds,n,r),a(to(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,Qa(n,e.names,e.nameRanges,r),a(e.names));return;case`Choose`:e.set&&B(e.set,n,r),B(e.body,Qa(n,eo(e.pattern),e.pattern.ranges,r),a(eo(e.pattern)));return;case`SetEnumeration`:case`Tuple`:i(e.elements);return;case`SetFilter`:B(e.predicate,ko([e.bound],n,r),a(eo(e.bound.pattern)));return;case`SetMap`:B(e.expression,ko(e.bounds,n,r),a(to(e.bounds)));return;case`FunctionSet`:i([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((i,a)=>{e.fields.slice(0,a).some(e=>e.name===i.name)&&r.errors.push({location:t(i.location.range??ao(i.location,i.name)),message:`Non-unique fields in constructor.`}),B(i.value,n,r)});return;case`Except`:B(e.function,n,r),e.updates.forEach(e=>{i(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,n,{...r,isInExcept:!0})});return;case`FunctionApplication`:i([e.function,...e.args]);return;case`FieldAccess`:B(e.record,n,r);return;case`Product`:i(e.factors);return;case`BoxAction`:case`AngleAction`:i([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:i([e.subscript,e.action]);return;case`Label`:if(To(e,r))return;B(e.body,n,{...r,labelParams:[],labels:/* @__PURE__ */ new Set}),Eo(e,n,r);return;case`Subexpression`:if(Ro(e,n,r))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Lo(e,n,r)),Do(e,n,r,!1)}},zo=(e,n,r)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Fo(e,n,r)||Do(e,n,r,!0))return;let i=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Ka(n,i)?.isNonFact?r.errors.push({location:t(oo(e,i)),message:`Step number of non-fact used as a fact`}):r.facts.has(i)||B(e,n,r)}),Bo=(e,t,n)=>(e.set&&B(e.set,t,n),Xa(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Vo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Bo(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Vo(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},Ho=(e,t,n)=>e.kind===`AssumeProve`?Vo(e,t,n):(B(e,t,n),t),Uo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&zo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Go(t,e,r),t)},Wo=(e,t,n)=>{let r=Zo(e,t,n);return e.name===void 0?r:Xa(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Go=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Ho(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Uo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Uo(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return zo(r.facts,t,n),o(t);case`Instance`:return o(Wo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Wo(t,e,i):No([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),Uo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(Qa(ko(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Qa(ko(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...to(r.bounds),...r.names]}),Uo(e.proof,a(t),n),a(o)}default:return Uo(e.proof,a(t),n),a(t)}},Ko=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ho(e.statement,void 0,t);e.name!==void 0&&Za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Uo(e.proof,n,t),r&&(r.isInProof=!1)},qo={line:0,column:0},Jo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Yo=(e,t)=>{let n=new Map([...Va,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Xo=(e,n,r,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){B(n,o,a);return}let r=Oo(n,n.name,o,a);if(r!==void 0&&r!==t.arity)throw new l(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let r=e.name,i=n.find(e=>e.name===r);if(!i){a.errors.push({location:t(e.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=e.expression;s(i,o);let l=o.location.range;c.has(r)?l&&a.errors.push({location:t(l),message:`Multiple substitutions for symbol '${r}' in substitution.`}):c.set(r,o)});let u=n.filter(e=>!c.has(e.name)),d=e=>!Ka(o,e.name)&&!ro(e.name,a);return u.filter(e=>!d(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),u.filter(d).forEach(n=>{let i=e.location.range,o=n.location.range;i&&o&&a.errors.push({location:t(i),message:`Substitution missing for symbol ${n.name} declared at ${t(o)} \nand instantiated in module ${r}.`})}),c},Zo=(e,t,n)=>{let r=n.getInstance(e);return Xo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Xa(e,t,r,n),t)},Qo=(e,t,n,r)=>{let i=Yo(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Xo(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:qo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},$o=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof l)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},es=(e,n)=>{let r=Yo(e,n.imported),i=/* @__PURE__ */ new Set([...n.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),a=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...Va,...n.bound].map(([e,t])=>[e,{...t,position:qo}])),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)=>Za(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return $o([...n.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...u(e.constants,`Constant`),...u(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Ya(e.name,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})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=l(t.location,t,n,r,!0);Jo(e,t)?B(t.body,void 0,i):Mo(t,void 0,i,s)&&o.set(t.name,{kind:`Definition`,arity:Ua(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(t,r)=>{let i=l(e.location,void 0,t,r,!1);$a(void 0,e.params,i),n.instanced.get(e)?.forEach((e,t)=>Za(t,e,i)),e.name!==void 0&&Za(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=l(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&Za(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Ko(e,l(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>zo(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>c.forEach(n=>{let r=n.declaration.location.range;r&&(!n.binding||n.binding.isPending)&&e.push({location:t(r),message:`Symbol ${n.declaration.name} declared in RECURSIVE statement but not defined.`})})}],n.warnings)},ts=/* @__PURE__ */ new WeakSet,ns=(e,t,n=/* @__PURE__ */ new Set)=>{let r=cs(e,(e,r)=>ns(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&k(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&k(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},rs=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),is=/* @__PURE__ */ new WeakMap,as=e=>is.get(e)??e.name,os=(e,t)=>(as(t)!==e.name&&is.set(e,as(t)),e),ss=(e,t)=>os(e.kind===`Function`?{...e,bounds:rs(e.bounds,e=>t(e,[])),body:t(e.body,to(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),cs=(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=>ss(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:rs(e.bounds,n),body:t(e.body,to(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,eo(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,eo(e.bound.pattern))};case`SetMap`:return{...e,bounds:rs(e.bounds,n),expression:t(e.expression,to(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},ls=`LAMBDA`,us=e=>`${e}@SUBSTITUTION`,ds=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(ds),fs=(e,t)=>{if(e.kind!==`Identifier`)return!ds(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=k(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!ds(n.body)},ps=(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 cs(e,(e,n)=>(r.push(...ps(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},ms=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}},hs=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),gs=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},_s=(e,t)=>e.map(e=>({pattern:gs(e.pattern,t),set:e.set})),vs=(e,t)=>e.kind===`Function`?{...e,bounds:_s(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ys=(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=>os({...vs(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:_s(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:gs(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:gs(e.bound.pattern,n),set:e.bound.set}};default:return e}},bs=e=>`${e}@ENABLED`,xs=(e,t)=>e.modes.get(t)??e,Ss=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!k(e)&&t.instantiation.variables.has(e.name),Cs=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Cs(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ss(e,t,n))return[e.name];let r=k(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Cs(r.body,t,/* @__PURE__ */ new Map):void 0},ws=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ss(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:bs(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ks(e.expression,xs(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ks(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ks(e.subscript,xs(t,`Primed`),n),location:r},ks(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Cs(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:bs(r),location:e.location},location:e.location},ks({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:Ia}),Es=(e,t)=>e.map(e=>Ts(e.name,t)),Ds=(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:[...Es(t,r),...i.map(e=>Ts(e,r))],location:r},location:r}},Os=(e,t)=>e.instantiation.isParameterized(t)?js(e,t):void 0,ks=(e,t,n)=>{let r=e=>ks(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!k(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:ks(e.expression,xs(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:ks(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},xs(t,`Enabled`),n)};let s=ws(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!fs(n,i)))return n;if(n&&r){let t=us(e.name);return r.set(t,n),Ts(t,e.location)}let o=Os(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&Ua(s)>0?Ds(o,a,Ua(s),e.location):{kind:`Apply`,operator:o,args:Es(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||ts.has(e),c=e=>(s&&ts.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:ls,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:ls,args:n,resolution:Ia},location:e.location};if(o)throw new l(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Os(t,e.operator);return u===void 0?c({...e,args:n}):{...e,operator:u,args:[...Es(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Os(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?Ds(n,a,Ua(r),e.location):{...e,operator:n}}let c=ms(t),u=cs(e,(e,i)=>i.length===0?r(e):ks(e,t,hs(n,i,c)));return ys(u,n,c)},As=(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},js=(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=ms(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=vs(ss(i,(e,t)=>ks(e,s,hs(/* @__PURE__ */ new Map,t,a))),a);if(c.kind!==`Operator`||o.size===0)return As(c,r.params,i.location);let l=[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location}));return As({...c,body:{kind:`Let`,definitions:l,body:c.body,location:c.body.location}},r.params,i.location)}):t},Ms=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ps(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=>Os(i,e)??e,getQualifiedKey:t=>{let n=Os(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>As(r,e.params,r.location)):t}}},Ns=e=>e.kind===`Let`&&e.instances!==void 0||Je(e).some(Ns),Ps=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=cs(e,e=>Ps(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ha(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Fs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Is=(e,t)=>e.definitions.some(e=>Ns(e.body))||e.assumptions.some(e=>Ns(e.expression))||e.theorems.some(e=>{let t=Fs(e);return t!==void 0&&Ns(t)})?{...e,definitions:e.definitions.map(e=>ss(e,e=>Ps(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Ps(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Fs(e);return n===void 0?e:{...e,statement:Ps(n,t,[])}})}:e,Ls=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}])),Rs={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]}},zs=(e,t)=>{let n=Rs[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Bs=(e,t)=>`${e}${t}`,Vs=(e,t,n)=>`${e}${t}${n}`,Hs=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},Us=(e,t,n)=>`${e},${t},${n}`,Ws=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Gs=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),Ks=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),qs=(e,t,n,r)=>({...Ws(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Js=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Ys=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Xs=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,{...qs(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),Zs=qs(`$Set`,0,[2],[1]),Qs=qs(`$Junction`,0,[3],[1]),$s=qs(`$Choose`,0,[2],[1]),ec=qs(`$Function`,0,[3],[1]),tc=qs(`$FcnApply`,0,[2,2],[1,1]),nc=qs(`$RcdSelect`,0,[2,0],[1,1]),rc=qs(`'`,2,[1],[0]),ic=qs(`ENABLED`,1,[2],[0]),ac=qs(`[]`,3,[3],[0]),oc=qs(`$SquareAct`,2,[2,1],[0,0]),sc=qs(`$WF`,3,[1,2],[0,0]),cc=qs(`$TemporalExists`,3,[3],[0]),lc=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),uc=e=>e.map(e=>({name:e,arity:0})),dc=(e,t)=>t.location.range?d(`${e}.`,t.location.range):new l(`${e} at line ${t.location.line}, column ${t.location.column}`),fc=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),pc=e=>e.kind!==`Let`&&e.kind!==`Label`,mc=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:v(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=v(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Xs.get(t)??Ls.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=Ws(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(Vs(e,n,t))}),t.data.constraints.forEach((e,t)=>Gs(r.constraints,t,e)),Ks(r.argConstraints,Bs(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>Ks(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>Js(e,n))throw new l(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new l(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(Us(t,n,r)),s=Ws(Math.max(e.level,...t.filter((t,n)=>Ys(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{Ys(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>Gs(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||Gs(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Gs(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||Gs(s.constraints,t,Js(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>Gs(s.constraints,e,Js(r,a)))}))}),e.argParams.forEach(e=>{let t=Hs(e),n=a(t.operator)?.operator;n&&Gs(s.constraints,t.param,Js(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>Ks(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>Ks(s.argConstraints,Bs(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&Ks(s.argConstraints,Bs(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=Hs(e),n=a(t.operator);n&&Ks(s.argConstraints,Bs(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(Hs(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=Hs(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(Vs(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(Vs(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(Vs(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,uc(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=Ws();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=lc(n,uc(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw dc(`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 dc(`Action used where only temporal formula or state predicate allowed`,e);fc.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&pc(n)&&n.kind!==r)throw dc(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=v(e,n);t.constraints.forEach((e,t)=>Gs(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>Ks(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof l)||t.sany?t:dc(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Ws();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return u(n,e),i(Qs,n)}case`Prime`:case`Unchanged`:return s(rc,[e.expression],t);case`Enabled`:return s(ic,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(ac,[n])}case`If`:return s(Qs,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Qs,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(Qs,[e.body],t,e.bounds.map(e=>e.set),to(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw dc(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?cc:Qs,[e.body],t,[],e.names);case`Choose`:return s($s,[e.body],t,e.set?[e.set]:[],eo(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(Zs,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(Zs,[e.predicate],t,[e.bound.set],eo(e.bound.pattern));case`SetMap`:return s(Zs,[e.expression],t,e.bounds.map(e=>e.set),to(e.bounds));case`FunctionConstruction`:return s(ec,[e.body],t,e.bounds.map(e=>e.set),to(e.bounds));case`Record`:return s(ec,e.fields.map(e=>e.value),t);case`RecordSet`:return s(Zs,e.fields.map(e=>e.value),t);case`Except`:return s(Zs,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(tc,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(Zs,e.args,t)}]);case`Bracket`:return Ws();case`FieldAccess`:return i(nc,[a(e.record,t),{data:Ws()}]);case`BoxAction`:case`AngleAction`:return s(oc,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(sc,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return Ws()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return Je(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,lc(t,uc(e.names))),i;default:return cs(e,(e,n)=>(a(e,r,lc(t,uc(n))),e)),i}},_=(e,t,n,r)=>{let i=lc(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...Ws(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(Bs(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(Vs(e.name,n,t.name))).map(e=>Us(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(Hs(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=Hs(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...Ws(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:a}},hc=(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`?hc(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Ws(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>Gs(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ks(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},gc=(e,n,r,i)=>{let a=mc(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`?hc(t.statement,/* @__PURE__ */ new Map,a).level:o([t.statement]):0},l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let n=t(e.statement),r=()=>s(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?r()?[]:[{location:n,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...r()?[]:[{location:n,message:`Non-constant CASE for temporal goal.`}],...l(e.proof)]:e.body.kind===`Qed`?l(e.proof):[]}):[],u=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let n=e.body,r=()=>s(e)===3,i=n.kind===`Pick`&&n.bounds.length>0&&r()?n.bounds.filter(e=>o([e.set])!==0).flatMap(e=>e.set.location.range?[{location:t(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...u(e.proof),...i,...e.proof?.kind===`Steps`&&r()?l(e.proof):[]]}):[],d=$o([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>a.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>a.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?hc(e.statement,/* @__PURE__ */ new Map,a):a.analyze(e.statement,/* @__PURE__ */ new Map),n=[...u(e.proof),...t.level===3?l(e.proof):[]];if(n.length>0)throw c(n)}})),...r],i);if(d.length>0)throw c(d,!1,void 0,i)},_c=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),vc=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),yc=/* @__PURE__ */ new Set([..._c,...vc,`Enabled`]),bc=/* @__PURE__ */ new Set([`~>`,`-+->`]),xc=/* @__PURE__ */ new Set([...bc,`\\cdot`]),Sc=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Cc=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),wc=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Tc=(e,t)=>Sc.has(e)||t.builtins.get(e)?.isStateLevel===!0,Ec=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(_c.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(vc.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&bc.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(yc.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&xc.has(e.operator))&&(r[0]|=1),yc.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=wc(e);if(u!==void 0&&!k(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)),Cc.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)}}Je(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Dc=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Oc=(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},kc=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Ac=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=Ec(Dc(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=Oc(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Oc(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!kc(t[e],l[e*r])))),p=Oc(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}},jc=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Mc(Dc(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Mc=(e,t)=>{let n=t.facts.words,r=Ec(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=jc(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]}kc(e.callee,r[0])||(i[0]|=r[0]&14)}),i},Nc=(e,t)=>!(jc(e,t)[0]&1),Pc={any:2,repeated:4,streamed:8},Fc=(e,t,n=`any`)=>(jc(e,t)[0]&Pc[n])!==0,Ic=(e,t)=>{let n=jc(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Lc=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},Rc=(e,t)=>{let n=Mc([e],t);return n[0]&16?void 0:Lc(n)},zc=(e,t)=>!!(Mc([e],t)[0]&1),Bc=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=wr.sets,a=i??[],o=a.length;wr.sets=a;try{return n()}catch(e){throw Rd(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,wr.sets=i}},Vc=(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},Hc=e=>!e.includes(void 0),Uc=e=>e.variables.map(()=>void 0),Wc=(e,t,n)=>{let r=[...e];return r[t]=n,r},Gc=(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}},Kc=e=>e.kind===`Identifier`?e.name:void 0,qc=(e,t,n)=>{if(t.kind===`Label`)return qc(e,t.body,n);let r=Kc(t);if(r===void 0)return;let i=ju(n,r);if(i?.kind===`Thunk`)return qc(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=md(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?qc(e,o.body,o.scope):void 0},Jc=(e,t,n)=>{if(t.kind===`Prime`)return qc(e,t.expression,n);if(t.kind===`Label`)return Jc(e,t.body,n);let r=Kc(t);if(r===void 0)return;let i=ju(n,r);if(i?.kind===`Thunk`)return Jc(e,i.expression,i.scope);if(i)return;let a=md(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?Jc(e,a.body,a.scope):void 0},Yc=e=>{if(typeof e!=`boolean`)throw new m(`TLC expected a boolean expression.`);return e},Xc=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Zc=(e,t,n)=>{t===void 0?Hc(n)&&e.onState(n):Hc(n)&&Xc(e)?$c(e,t,n):t.kind===`Predicate`?el(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?ll(e,t.expression,t.rest,t.scope,n):Qc(e,t,n)&&Zc(e,t.rest,n)},Qc=(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?ku(t,r.runtime.version):t}})();return!Xt(i,a)},$c=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){ll(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Qc(e,r,n):!Yc(H(r.expression,Vc(e,r.scope,n))))return}e.onState(n)},el=(e,t,n,r,i)=>Bc(e,t,()=>{switch(t.kind){case`Let`:el(e,t.body,n,jd(t.definitions,Vc(e,r,i)),i);return;case`Label`:el(e,t.body,n,r,i);return;default:if(sl.has(t.kind))throw new m(`The state relation is not a boolean expression.`);Bc(e,t,()=>cl(e,t,n,r,i))}}),tl=(e,t,n,r)=>{Yc(t)&&Zc(e,n,r)},nl=(e,t,n,r,i)=>{let a=Vc(e,r,i);if(t.kind===`Identifier`){let o=ju(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){el(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){el(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:md(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&Nc(s,e.environment))){el(e,c.body,n,c.scope,i);return}tl(e,H(t,a),n,i);return}let o=hd(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?el(e,o.body,n,Dd(o,t.args,a),i):tl(e,H(t,a),n,i)},rl=(e,t,n,r,i)=>{let a=n[r];a===void 0?Zc(e,t,Wc(n,r,i)):Xt(a,i)&&Zc(e,t,n)},il=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),al=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?qc(e,a,r):Jc(e,a,r),c=Vc(e,r,i);if(s===void 0){H(t,c)===!0&&Zc(e,n,i);return}let l=H(o,c),u=i[s];if(t.operator===`=`){rl(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)H(t,c)===!0&&Zc(e,n,i);else{if(!Qn(d))throw new m(`The right side of \\IN is not enumerable.`);for(let t of dr(d))Zc(e,n,Wc(i,s,t))}},ol=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),sl=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),cl=(e,t,n,r,i)=>{let a=Vc(e,r,i);switch(t.kind){case`Identifier`:nl(e,t,n,r,i);return;case`Apply`:if(ol.has(t.operator)&&t.args.length===2){al(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(Yc(H(t.args[0],a))){el(e,t.args[1],n,r,i);return}Zc(e,n,i);return}nl(e,t,n,r,i);return;case`And`:{let a=t.operands;if(t.isBulleted||a.length===2){let t=a.slice(1).reduceRight((e,t)=>il(`Predicate`,t,r,e),n);el(e,a[0],t,r,i);return}let o=a[a.length-1];el(e,Gc(t,a.length-1),il(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>el(e,t,n,r,i));return}el(e,Gc(t,a.length-1),n,r,i),el(e,a[a.length-1],n,r,i);return}case`Exists`:Yu(t.bounds,a,r=>(el(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Yu(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Zc(e,n,i);return}let o=r.slice(1).reduce((e,n)=>il(`Predicate`,t.body,n,e),n);el(e,t.body,o,r[0],i);return}case`If`:el(e,Yc(H(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>Yc(H(e.condition,a)))?.body??t.other;if(o===void 0)throw new m(`TLC encountered a CASE with no conditions true.`);el(e,o,n,r,i);return}case`FunctionApplication`:{let r=ed(H(t.function,e.isInit?a:Fu(a)));if(r){el(e,r.body,n,td(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){ll(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){el(e,t.action,n,r,i),ll(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){el(e,t.action,il(`Changed`,t.subscript,r,n),r,i);return}}tl(e,H(t,a),n,i)},ll=(e,t,n,r,i)=>Bc(e,t,()=>{let a=qc(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&rl(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Zc(e,n,i);return}let s=o.reduceRight((e,t)=>il(`Unchanged`,t,r,e),n);ll(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=ju(r,t.name);if(a?.kind===`Thunk`){ll(e,a.expression,n,a.scope,i);return}let o=a?void 0:md(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){ll(e,o.body,n,o.scope,i);return}}let o=e.environment,s=H(t,{environment:o,scope:r,state:e.current,next:void 0}),c=H(t,{environment:o,scope:r,state:i,next:void 0});Xt(s,c)&&Zc(e,n,i)}),ul=(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}},dl=/* @__PURE__ */ Error(`The replay found a successor`),fl=(e,t,n,r)=>{let i=ul(r,!1,n,()=>{throw dl},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=il(`Changed`,e.subscript,t,void 0);el(i,e.action,n,t,Uc(r))}else el(i,e,void 0,t,Uc(r));return!1}catch(e){if(e!==dl)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},pl=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=ul(t,!0,void 0,n),o=i.reduceRight((e,t)=>il(`Predicate`,t.expression,t.scope,e),void 0);el(a,r.expression,o,r.scope,Uc(t))},ml=(e,t,n,r)=>{e.some(e=>sl.has(e.expression.kind))||e.forEach(e=>{let i=[],a=ul(n,!1,t,e=>i.push(e));el(a,e.expression,void 0,e.scope,Uc(n)),i.forEach(t=>r(t,e))})},hl=/* @__PURE__ */ new WeakMap,gl=/* @__PURE__ */ new WeakMap,_l=(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},vl=(e,t,n)=>{let r=e.slice();return r[t]=n,r},yl=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,bl=(e,t)=>{let n=new m(t);return e.isInit?n:v(n,a.error)},xl=(e,t,n,r)=>{let i=yu(n);return r&&sl.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 ${yl(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Sl=(e,t,n)=>{let r=Li(t),i=vu(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 ${yl(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
138
- `:``}${i}`},Cl=(e,t,n)=>wl(e,t,H(t,n)),wl=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw bl(e,xl(e,n,t,r))},Tl=(e,t,n,r)=>r.environment.callStack?H(n,r):(e[t]??=Vd(n,r.environment))(r),El=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Dl=(e,t,n)=>{let r=n?hl:gl,i=r.get(e);if(i)return i;let a=iu(e,t,n);return r.set(e,a),a},Ol=(e,t)=>{if(t.constants.has(e))return;let n=Ru(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},kl=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return kl(e.expression,t,!1,r);if(e.kind!==`Identifier`||k(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Ol(e.name,t);if(a&&!r.has(a))return r.add(a),kl(a.body,t,n,r)},Al=(e,t,n)=>kl(e,t,!n),jl=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return jl(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=jd(e.definitions,_l(r,t,n));return jl(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ju(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return jl(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=Ol(e.name,r.environment);if(s)return jl(s.body,void 0,n,r,i)},Ml=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||k(e))||!t&&e.kind===`Prime`,Nl=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Nl(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=Ol(e.name,t);if(i)return n.add(e.name),Nl(i.body,t,n)},Pl=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Fl=(e,t,n)=>Pl.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||El(e.operator)&&(Ml(e.args[0],n)||Al(e.args[0],t,n)!==void 0)||k(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Il=/* @__PURE__ */ new Set,Ll=(e,t)=>{if(k(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return cs(e,(e,i)=>{let a=r.isReadOnly?Ll(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},Rl=(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||k(e)?void 0:Ru(r,t);return i&&!n.has(i)&&(n.add(i),Rl(i.body,t,n))?!0:Je(e).some(e=>Rl(e,t,n))},zl=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Al(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=Nl(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Fl(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Dl(e,t,n)}},Bl=(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(Rc(e,t)===void 0||Rl(e,t,/* @__PURE__ */ new Set))return!0;let n=Ll(e,Il);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)}},Vl=(e,t,n)=>{let r=e.map(e=>zl(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Xc(t);for(let s=e;s<r.length;s++){if(s>0&&f&&ou(u)){d??=_l(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=Tl(a,e,n,d);if(!wl(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=_l(t,n,u);let r=Tl(i,s,e.expression,d);if(!wl(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=_l(t,n,u);let r=Tl(i,s,e.value,d),a=u[e.index];if(a===void 0)u=vl(u,e.index,r),d=void 0;else if(!Xt(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;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(!Xt(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)},Hl=e=>(t,n,r,i,a,o)=>{Cl(t,e,_l(t,n,r))&&o(r,i)},Ul=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=_l(r,i,a);if(a[l]!==void 0){Cl(r,e,u)&&c(a,o);return}let d=H(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Qn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${yl(r)}, the right side of \\IN is not enumerable.`;throw bl(r,`${t}\n${vu(e)}`)}let p=dr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(vl(a,l,p[e]),o)}},Wl=/* @__PURE__ */ new WeakMap,Gl=e=>{let t=Wl.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Gl),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Wl.set(e,n),n},Kl=(e,t)=>{let n=e.args[0],r=Hl(e),i=(e,r,i)=>jl(n,r,i,e,!t)??-1,a=Ul(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],_l(t,n,o));l(vl(o,u,d),s)}},ql=(e,t,n)=>{let r=vu(e);return(i,a,o,s,c,l)=>{let u=_l(i,a,o),d=H(e.function,n?u:Fu(u)),f=ed(d);if(f!==void 0){Dl(f.body,t,n)(i,td(f,e,u),o,s,c,l);return}if(!j(d))throw bl(i,`In computing ${yl(i)}, a non-function (${Li(d)}) was applied as a function.\n${r}`);let p=H(e,u);if(typeof p!=`boolean`)throw bl(i,`In computing ${yl(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Jl=(e,t)=>{if(Nl(e,t))return Vl([Gl(e)],t,!1);if(e.kind===`Tuple`)return Dl(Gl(e),t,!1);let n=Gl(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ju(i,e.name):void 0;l?.kind===`Thunk`&&!l.isReleased?Dl(Gl(l.expression),t,!1)(r,l.scope,a,o,s,c):Cl(r,n,_l(r,i,a))&&c(a,o)}},Yl=(e,t,n)=>{let r=e.operator,i=Hl(e),a=k(e)?void 0:md(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Kd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=Dl(a.body,t,n),o.body(e,i(_l(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=_l(a,o,s),f=hd(e,d);f?.kind===`Closure`?Dl(f.body,t,n)(a,Dd(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Xl=(e,t,n)=>{let r=Hl(e),i=k(e)?void 0:Ol(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=ju(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Dl(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=Dl(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Zl=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||k(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`||!k(i))return;let a=kl(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Ql=e=>e.kind===`And`?e.operands.flatMap(Ql):[e],$l=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Fl(e,t,!1),eu=e=>{let t=[];return(n,r,i)=>{let a=_l(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!wl(n,i,Tl(t,r,i,a)))return}}},tu=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Ql(e),r=n.findIndex(e=>!$l(e,t)||Zl(e,t)),i=r===-1?void 0:Zl(n[r],t);return i?{...i,before:r===0?void 0:eu(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>tu(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`||k(e))return;let r=md(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=tu(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`||!k(o))return;let s=i.before,c=s&&Kd(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(_l(e,t,n)),n))}},nu=(e,t,n)=>{let r=ju(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},ru=(e,t,n)=>{let r=e.map(e=>Dl(e,t,n)),i=n?[]:e.map(e=>tu(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&&nu(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)}}},iu=(e,t,n)=>{let r=e=>Dl(e,t,n);switch(e.kind){case`And`:return Vl(e.operands,t,n);case`Or`:return ru(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=Hu(H(a.set,_l(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Mu(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Bl(e,t);if(o){let r=Vl(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=_l(n,i,a),d=e.bounds.map(e=>Hu(H(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Mu(t,o.names[e],r);if(e===d.length-1){let e=_l(n,i,a);if(!o.guards.every(t=>Cl(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Yu(e.bounds,_l(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Rc(e,t)!==void 0&&!Rl(e.body,t,/* @__PURE__ */ new Set)?Ll(e,Il):void 0;return(t,n,r,o,s,c)=>{let l=[];Yu(e.bounds,_l(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ju(n,e)?.kind===`Value`)){u.every(n=>Cl(t,e.body,_l(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&ou(r)?u.slice(n).every(n=>Cl(t,e.body,_l(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=H(e.condition,_l(r,i,a));if(typeof l!=`boolean`)throw bl(r,Sl(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=_l(r,i,a),u=t.find(e=>{let t=H(e.condition,l);if(typeof t==`boolean`)return t;throw bl(r,`In computing ${yl(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Li(t)}) was used as a guard condition of a CASE.\n${yu(e.source)}`)})?.body??n;if(!u)throw bl(r,`In computing ${yl(r)}, TLC encountered a CASE with no conditions true.\n${vu(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Nd(e.definitions,t);return(t,r,a,o,s,c)=>n(t,jd(e.definitions,_l(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new m(`UNCHANGED appears in an initial predicate at ${gu(e)}`)}:Jl(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Gl(e.subscript),a=(e,n,r)=>{try{return Cl(e,i,_l(e,n,r))}catch(n){throw e.isEnabled?ku(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return r({kind:`Or`,operands:[e.action,Gl(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Xl(e,t,n);case`FunctionApplication`:return ql(e,t,n);case`Apply`:{let i=e.args;if(El(e.operator)){let r=Al(i[0],t,n);if(r!==void 0)return e.operator===`=`?Vl([e],t,n):Ul(e,()=>r);if(Ml(i[0],n))return Kl(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=H(i[0],_l(t,n,r));(typeof c==`boolean`?c:Lu(c,`the left side of => at ${gu(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Yl(e,t,n)}default:return Hl(e)}},au=e=>e.variables.map(()=>void 0),ou=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},su=(e,t)=>{let n=t.state;if(!n||!ou(n))throw new m(`ENABLED needs a complete state at ${gu(e)}`);let r=t.environment;if(r.callStack)return fl(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return Dl(e,r,!1)(i,t.scope,au(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},cu=(e,t,n,r)=>{let i={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};Dl(e,t,!0)(i,r,au(t),void 0,!1,e=>{if(!i.isStopped){if(!ou(e))throw v(new b([...e]),a.error);i.isStopped=n(e)}})},lu=(e,t,n)=>{let r=[];return cu(e,t,e=>(r.push(e),!1),n),r},uu=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return Dl(e,n,!1)(a,i,au(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!ou(e)){let r=n.variables.filter((t,n)=>e[n]===void 0);throw new ee(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},du=(e,t,n,r)=>{let i=[];return uu(e,t,n,e=>(i.push(e),!1),r),i},fu=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),pu=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),mu=e=>pu.has(e.kind)||e.kind===`Apply`&&fu.has(e.operator),hu=(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&&ot(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},gu=e=>`line ${e.location.line}, column ${e.location.column}`,_u=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,vu=e=>{let t=e.location.range;return t?_u(t):gu(e)},yu=e=>e.kind===`Number`?e.text??String(e.value):vu(e),bu=(e,t)=>new m(`A non-boolean expression (${Li(t)}) was used as the condition of an IF.\n${vu(e)}`),xu=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new m(`A non-boolean expression (${Li(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${yu(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new m(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Li(n)}.\n${vu({...e,location:{...e.location,range:{...r,end:i}}})}`)},Su=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${L(n)}\n${vu(e)}`,r=e=>`Attempted to apply function:\n${it(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!j(i))throw new m(`Attempted to select field "${t}" from a non-record value ${it(L(i))}\n${vu(e)}`);let a=Ht(i);if(a===`tuple`)throw Pr(t);return Lr(i,t,a===`record`?n:r)}},Cu=e=>e===`1.7.4`?(t,n)=>jr(t,n,e):void 0,wu=e=>t=>{if(!j(t))throw new m(`Attempted to apply the operator DOMAIN to a non-function\n(${Li(t)})\n${vu(e)}`);return zr(t)},Tu=(e,t)=>(n,r)=>{if(!A(n)||At(n))throw new m(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${vu(e)}`);return t.evaluate([n,r])},Eu=e=>v(new m(`TLC can't handle real numbers: ${e.text} at ${gu(e)}`),a.configParseError),Du=e=>v(new m(`TLC can't handle a number this big: ${e.text??e.value} at ${gu(e)}`),a.error),Ou=(t,n)=>new e(`In evaluation, the identifier ${t} is either undefined or not an operator.\n${vu(n)}`,t),ku=(t,n)=>t instanceof e&&n!==`1.7.4`?new m(`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=e=>new m(`A primed expression appears outside an action at ${gu(e)}`),ju=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Mu=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Nu=(e,t,n)=>{if(t.kind===`Name`)return Mu(e,t.name,n);let r=Sr(n);if(!r||r.length!==t.names.length)throw new m(`Cannot bind <<${t.names.join(`, `)}>> to ${L(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>Mu(e,t,r[n]),e)},Pu=(e,t)=>{if(j(e))return e;throw new m(`A non-function (${Li(e)}) was applied as a function.\n${vu(t)}`)},Fu=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Iu=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Lu=(e,t)=>{if(typeof e!=`boolean`)throw new m(`Expected ${t} to be a boolean but found ${L(e)}`);return e},Ru=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),zu=(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.`},Bu=(e,t,n)=>{if(!A(e)||At(e)){let r=L(e),i=n===`1.7.4`?void 0:zu(e,r);throw new m(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${yu(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${yu(t)}\n${i}`)}},Vu=(e,t,n)=>(Bu(e,t,n),typeof e==`object`&&e.kind===`Interval`?Gn(e):ar(e)??ur(e)),Hu=(e,t,n)=>n===`1.7.4`?(Bu(e,t,n),ar(e)??dr(e)):Vu(e,t,n),Uu=e=>{if(typeof e==`object`&&e.kind===`Interval`)return vr(e),e},Wu=(e,t,n)=>Uu(e)??Hu(e,t,n),Gu=(e,t,n)=>Uu(e)??Vu(e,t,n),Ku=(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},qu=(e,t)=>e.map(e=>Wu(H(e.set,t),e.set,t.environment.runtime.version)),Ju=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Ku(t[n],t=>i(n-1,Nu(a,e[n].pattern,t)));return i(e.length-1,n)},Yu=(e,t,n)=>Ju(e,qu(e,t),t.scope,n),Xu=(e,t)=>{let n=e.map(e=>H(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Zu=(e,t,n)=>{if(e.length===1)return Nu(t,e[0].pattern,n);let r=Sr(n)??[];return e.reduce((e,t,n)=>Nu(e,t.pattern,r[n]),t)},Qu=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,$u=e=>Object.assign(e.value,{lambda:e}),ed=e=>Qu(e)?e.lambda:void 0,td=(e,t,n)=>{let r=e.value,i=t.args.map(e=>H(e,n)),a=i.length===1?i[0]:Yn(i),o=(e,n,i)=>`In applying the function\n${it(L(r))},\nthe ${e} is:\n${it(L(n))}${i}.\n${vu(t.function)}`,s=e.bounds;if(s.length===1){if(!Er(a,r.domain))throw new m(o(`first argument`,a,`which is not in its domain`));return Zu(s,e.scope,a)}let c=Sr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new m(`Attempted to apply a function to an argument not in its domain.\n${vu(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Er(n,l[t]))throw new m(o(r,n,`${e.pattern.kind===`Name`?``:`
139
- `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Sr(n)?.length!==e.pattern.names.length)throw new m(o(r,n,`which does not match its formal parameter`))}),Zu(s,e.scope,Yn(c.slice(0,s.length)))},nd=(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:_u(n)}},rd=(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}},id=(e,t,n)=>{let r={kind:`LazyFunction`,domain:e,source:n,apply:e=>t(e,r)};return r},ad=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),od=(e,t)=>{let n=Xu(e.bounds,t),r=id(n,(n,r)=>H(e.body,Iu(t,Zu(e.bounds,Mu(void 0,e.name,r),n))),rd(nd(e.bounds,e.body),e.bounds,n));return $u({value:r,bounds:e.bounds,body:e.body,scope:Mu(void 0,e.name,r)}),e.bounds.length===1?Ut(r):r},sd=(e,t)=>{if(typeof t!=`object`||Ht(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ot(t.domain))return t;try{let e=I(t);return zt(e.domain,e.range)}catch(e){if(e instanceof m)return t;throw e}},cd=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new m(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>od(e,t):Vd(ad(e),t):Vd(e.body,t),ld=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=cd(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Iu(e,void 0)):e=>a[i]??r(Iu(e,void 0));return t.definitionEvaluators.set(e,o),o},ud=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},dd=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!Nc(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>sd(e,cd(e,t)(i)));kn(n),t.startupValues[r]=n}catch(e){if(!(e instanceof m)&&!p(e))throw e}}),fd=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(e.cache!==void 0&&(n||e.isReleased))return e.cache;let r=H(e.expression,Iu(t,e.scope));return n&&(!e.isStreamed||pr(r))&&(e.cache=r),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),r},pd=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),md=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return md(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?pd(r):t.builtins.get(e)},hd=(e,t)=>k(e)?gd(e.operator,t):md(e.operator,t.environment)??gd(e.operator,t),gd=(e,t)=>{let n=ju(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return md(e,t.environment)},_d=e=>e.kind===`Closure`?e.params.length:e.arity,vd=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:gd(n,t);if(!r)throw new m(`Expected an operator argument at ${gu(e)}`);return r},yd=(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)=>Mu(e,n.name,t[r]),e.scope);return H(e.body,Iu(n,r))},bd=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:_d(e),call:n=>yd(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},xd=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=gd(e.name,t);return n!==void 0&&_d(n)>0},Sd=(e,t)=>e.map(e=>xd(e,t)?bd(vd(e,t),t):H(e,t)),Cd=(e,t)=>new m(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),wd=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Td=(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 Td(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([])}},Ed=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&lt(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=k(e)?void 0:Td(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=ju(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:wd(e,t)}}return t=>wd(e,t)},Dd=(e,t,n,r)=>{if(t.length!==e.params.length)throw Cd(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:vd(t[a],n)}:(r?.[a]??Ed(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Od=(e,t,n,r)=>e.kind===`Closure`?H(e.body,Iu(n,Dd(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>H(e,n))):e.isLazy?e.evaluate(Wd(t,n),n):e.evaluate(Sd(t,n),n),kd=/* @__PURE__ */ new WeakMap,Ad=e=>{let t=kd.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return kd.set(e,n),n},jd=(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:Ad(r),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),Md=(e,t,n)=>{let r=ju(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return fd(r,n);if(r?.kind===`Operator`){if(_d(r.operator)===0)return yd(r.operator,[],n);throw new m(`Operator ${e} is used without arguments`)}let i=Td(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Ou(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return ld(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new m(`Unknown identifier ${e} at ${gu(t)}`)},Nd=(e,t)=>({impure:new Set(e.filter(e=>Fc(e,t))),streamed:new Set(e.filter(e=>Fc(e,t,`streamed`)))}),Pd=e=>[...e.facts.ids.keys()].some(t=>Fc(t,e)),Fd=e=>[...e.facts.ids.keys()].some(t=>Fc(t,e,`repeated`)),Id=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Ld=(e,t,n,r)=>i=>{r.expressions.push(e);let a=wr.sets,o=wr.callStack,s=a??[],c=s.length;wr.sets=s,wr.callStack=r;try{let a=t(i),o=Id(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&mu(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=hu(e,r.values),a=i&&!Je(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!j(a)?void 0:a;throw Rd(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,wr.sets=a,wr.callStack=o}},Rd=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof m){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},zd=(e,t,n)=>{if(!(n instanceof m))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Bd=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=lf(e,t),i=t.callStack,a=i?Ld(e,r,t,i):r;return t.evaluators.set(e,a),a},Vd=(e,t)=>{if(t.callStack)return V(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=sa(e,t)??V(e,t);return t.entryEvaluators.set(e,r),r},H=(e,t)=>Vd(e,t.environment)(t),Hd=(e,t)=>{let n=e.name,r=k(e)?void 0:Td(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Ou(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??=ld(e,t))(r)}return t=>Md(n,e,t)},Ud=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||k(e))return!0;let n=md(e.name,t);return n===void 0||_d(n)===0},Wd=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>H(e,t),expression:e})),Gd=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Wd(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Ud(t[0],n)){let e=V(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Ud(t[0],n)&&Ud(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(Sd(t,n),n)},Kd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Cd(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Ed(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:vd(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},qd=(e,t,n)=>{let r=Kd(e,t,n),i={body:void 0};return t=>(i.body??=Vd(e.body,n),i.body({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},Jd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=V(n[0],t),r=V(n[1],t);return t=>!Lu(e(t),`the left side of =>`)||Lu(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new m(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=k(e)?void 0:md(e.operator,t);if(r?.kind===`Closure`)return qd(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=V(n[0],t),i=wu(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=V(n[0],t);return ts.has(e)||zc(n[0],t)?i:e=>e.scope===void 0?r.evaluate([i(e)]):i(e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=V(n[0],t),a=V(n[1],t),o=Tu(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return Gd(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new m(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>Ed(e,t));return r=>{let a=gd(e.operator,r);if(a)return Od(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new m(`${e.operator} is a function; apply it with brackets`):new m(`Unknown operator ${e.operator} at ${gu(e)}`)}},Yd=(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=>Ku(Wu(o(s),a.set,t.runtime.version),t=>Lu(i(Iu(s,Mu(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)=>Wu(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?Lu(i(Iu(s,a)),r)!==n:Ku(c[t],n=>l(t-1,Mu(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Yu(o,e,t=>Lu(i(Iu(e,t)),r)!==n)?!n:n},Xd=(e,t)=>{if(e.kind===`Tuple`)return Yn(e.names.map(e=>{let n=ju(t,e);return n?.kind===`Value`&&n.value}));let n=ju(t,e.name);return n?.kind===`Value`?n.value:void 0},Zd=/* @__PURE__ */ new WeakSet,Qd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Zd.add(e)},$d=/* @__PURE__ */ new WeakMap,ef=e=>{if($d.has(e))return $d.get(e);let t=/* @__PURE__ */ new Set,n=e=>e.kind!==`Subexpression`&&(e.kind===`Identifier`&&t.add(e.name),(e.kind===`Apply`||e.kind===`OperatorReference`)&&t.add(e.operator),e.kind===`ExceptAt`&&t.add(`@`),Je(e).every(n)),r=n(e)?[...t]:void 0;return $d.set(e,r),r},tf=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=ju(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),nf=(e,t)=>{let n=Zd.has(e),r=V(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=V(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=qn(e),o=zt(i,i.map(e=>r(Iu(t,Mu(t.scope,n,e)))));return ot(e)?o:Ut(o)}let n=[],s=i.map(e=>Gu(H(e.set,t),e.set,t.environment.runtime.version));return Ju(i,s,t.scope,e=>{let o=i.length===1?Xd(a.pattern,e)??!1:Yn(i.map(t=>Xd(t.pattern,e)??!1));return n.push([o,r(Iu(t,e))]),!1}),Rn(n)},l=nd(i,e.body),u=ef(e.body),d=(t,n)=>{let a=tf(n.scope,u),o=Iu(n,a),s=$u({value:id(t,e=>r(Iu(o,Zu(i,a,e))),rd(l,i,t)),bounds:i,body:e.body,scope:a});return i.length===1?Ut(s):s},f=t.callStack;return t=>{let r=o?s(t):Xu(i,t);if(e.isRecursive||n||t.isKeepLazy||!N(r))return d(r,t);if(!ot(r)){if(f)return d(r,t);try{return c(r,t)}catch(e){if(!(e instanceof m))throw e;return d(r,t)}}if(!f)return c(r,t);try{return c(r,t)}catch(t){throw zd(f,e,t),t}}},rf=(e,t)=>{let n=Zd.has(e);n&&Qd(e.function);let r=V(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>V(e,t))}),value:V(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Yn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Iu(i,Mu(i.scope,`@`,e))):Br(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i={value:!1};n=o(n,r.path,0,t,e=>(i.value=!0,r.value(e))),i.value||t.environment.runtime.warn(ca.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${vu(e.function)}`)}return n}},af=(e,t)=>{if(e.kind===`SetFilter`){let n=V(e.predicate,t),r=V(e.bound.set,t),i=e.bound.pattern,a=e.predicate.location.range,o=a&&{names:i.kind===`Name`?i.name:i.names.join(`, `),predicate:_u(a)},s=(e,t)=>n=>Lu(e(Iu(t,Nu(t.scope,i,n))),`a set filter predicate`),c=(t,n,r)=>({kind:`FilteredSet`,base:t,test:s(r,n),source:o,rebind:r=>c(t,{...n,environment:r},V(e.predicate,r))});return e=>{let t=r(e);return ot(t)?Rt(P(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=V(e.expression,t);return t=>{let r=[];return Yu(e.bounds,t,e=>(r.push(n(Iu(t,e))),!1)),Nn(r)}}let n=e.set;if(!n)return()=>{throw new m(`TLC cannot evaluate an unbounded CHOOSE at ${gu(e)}`)};let r=V(e.body,t),i=V(n,t);return t=>{let a=i(t);if(!A(a)||At(a))throw new m(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${vu(e)}`);let o={value:void 0},s=Gu(a,n,t.environment.runtime.version);if(Ku(s,n=>{let i=Nu(t.scope,e.pattern,n);return Lu(r(Iu(t,i)),`the body of CHOOSE`)?(o.value=Xd(e.pattern,i),!0):!1}),o.value===void 0)throw new m(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${vu(e)}`);return o.value}},of=e=>[...e].sort((e,t)=>Ft(e.name,t.name)),sf=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),cf=(e,t)=>{let n=of(e),r=sf(n),i=n.map(e=>V(e.value,t));if(r)return e=>Xn(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>pt(a,i.map(t=>t(e)),o):e=>Zn(a,i.map(t=>t(e)))},lf=(e,t)=>{let n=e=>V(e,t);switch(e.kind){case`Number`:{let t=e.value;return lt(t)?()=>t:()=>{throw Du(e)}}case`Decimal`:return()=>{throw Eu(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Hd(e,t);case`Apply`:return Jd(e,t);case`Bracket`:return()=>{throw new m(`A bracket without a function or subscript is not an expression at ${gu(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new m(`An operator cannot be used as a value at ${gu(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw xu(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw xu(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Au(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>Xt(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw bu(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new m(`A non-boolean expression (${Li(t)}) was used as a condition of a CASE. ${yu(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new m(`Attempted to evaluate a CASE with no conditions true.\n${vu(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Iu(n,jd(e.definitions,n)))}case`Forall`:case`Exists`:return Yd(e,t);case`UnboundedQuantifier`:return()=>{throw new m(`TLC cannot evaluate an unbounded quantifier at ${gu(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return af(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Nn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Yn(t.map(t=>t(e)))}case`FunctionConstruction`:return nf(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return cf(e.fields,t);case`RecordSet`:{let t=of(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return rf(e,t);case`ExceptAt`:return t=>{let n=ju(t.scope,`@`);if(n?.kind!==`Value`)throw new m(`@ appears outside an EXCEPT at ${gu(e)}`);return n.value};case`FunctionApplication`:{Qd(e.function);let r=n(e.function),i=t=>Pu(r(Fu(t)),e),a=e.args.map(n),o=Cu(t.runtime.version);if(a.length===1){let e=a[0];return t=>Lr(i(t),e(t),o)}return e=>Lr(i(e),Yn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Su(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=n({kind:`Unchanged`,expression:e.subscript,location:e.location}),i=e.kind===`BoxAction`;return e=>i?Lu(t(e),`an action`)||r(e):Lu(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>su(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new m(`The subexpression reference at ${gu(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new m(`TLC cannot evaluate a temporal formula in a state at ${gu(e)}`)}}},uf=`tlc2/value/impl/`,df={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},ff={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},pf=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)}},mf=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),hf=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],gf=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??mf.get(e[3])}${`[]`.repeat(e[1].length)}`),_f=(e,t)=>e[e[t].first].text,vf=(e,t)=>_f(e,t).replaceAll(`/`,`.`),yf=e=>{let t=pf(e);if(t.readUint32()!==3405691582)throw new l(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===df.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===df.integer?a.value=t.readInt32():r===df.float?t.readUint32():r===df.long||r===df.double?(t.readBytes(8),e++):r===df.class||r===df.string||r===df.methodType||r===df.module||r===df.package?a.first=t.readUint16():r===df.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=vf(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=gf(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:pf(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>vf(n,d.readUint16())):[],p=hf.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=gf(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},bf=(e,t)=>{let n=e[t],r=e[n.second];return{className:_f(e,n.first),name:e[r.first].text}},xf=(e,t,n,r)=>{let i=()=>new _(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===df.integer)return n.value;if(n.tag===df.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=ff.iconstM1&&n<=ff.iconst5)o.push(n-ff.iconst0),e+=1;else if(n===ff.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===ff.sipush)o.push(l()<<16>>16),e+=3;else if(n===ff.ldc)o.push(c(a[e+1])),e+=2;else if(n===ff.ldcW)o.push(c(l())),e+=3;else if(n===ff.dup){let t=s();o.push(t,t),e+=1}else if(n===ff.getstatic){let n=bf(t,l());if(n.className!==`${uf}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===ff.invokestatic){let n=bf(t,l()),a=s();if(n.className!==`${uf}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===ff.new)o.push({className:_f(t,l()),value:void 0}),e+=3;else if(n===ff.invokespecial){let n=bf(t,l()),a=s(),o=s();if(!(n.className===`${uf}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===ff.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Sf=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=yf(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:xf(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)}))}},Cf=/* @__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(`,`),wf=[[`\\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`,`≀`],[`^+`,`⁺`]],Tf=/* @__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(`,`),Ef=/* @__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(`.`),Df=/* @__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(`.`),Of=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),kf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
70
+ `],[2171,`Parsing or semantic analysis failed.`],[2213,`:
71
+ `],[2281,` - specifically: `],[2405,`failed.
72
+ `]]),It=(e,t,n)=>{let r=n?Ft.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)}${Lt(t.slice(a),n)}`},Lt=(e,t)=>{let n=t?Nt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${wt.none} @!@!@\n${It(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Rt=(e,t=2)=>String(e).padStart(t,`0`),zt=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 ${Rt(r%24)}h`:e>36e5?`${Rt(r%24)}h ${Rt(n)}min`:e>6e4?`${Rt(n)}min ${Rt(t)}s`:`${Rt(t)}s`},Bt=e=>`${e.getFullYear()}-${Rt(e.getMonth()+1)}-${Rt(e.getDate())} ${Rt(e.getHours())}:${Rt(e.getMinutes())}:${Rt(e.getSeconds())}`,Vt=/* @__PURE__ */ new WeakMap,Ht=(t,n,r)=>{if(!(t instanceof T))return t;let i=S(new T(`${r}\n${t.message}`,t),e(t));return Vt.set(i,{code:n,headline:r,inner:t}),i},Ut=e=>Vt.has(e),Wt=y(`util.WrongInvocationException`),Gt=l.slice(0,l.indexOf(`
73
+ `)),Kt=`${l}tlc2.tool.EvalException: `,qt=`${l}util.Assert$TLCRuntimeException: `,Jt=e=>Pt(e)?Kt:qt,Yt=e=>{try{return e()}catch(e){throw e instanceof T?Pt(e)?new T(`${a}${e.message}`):Nt(e.message)?e:new T(`${l}${e.message}`):e}},Xt=[Kt,qt,l,a],Zt=(e,t)=>{let r=Vt.get(e);if(r)return`${r.headline}\n${Zt(r.inner,t)}`;let i=e.message;if(e instanceof n)return i;let a=Xt.find(e=>i.startsWith(e))??``;return`${a}${Lt(i.slice(a.length),t)}`},Qt=(e,t)=>{let r=Vt.get(e),a=e.message;if(r)return{code:r.code,message:a,toolMessage:Zt(e,!0)};if(e instanceof i)return{code:t?Ct.stackOverflow:Ct.general,message:a,toolMessage:a};if(t&&Pt(e))return{code:Nt(a)?.code??Ct.general,message:a,toolMessage:a};let o=t&&!a.startsWith(Gt)&&!(e instanceof n),s=e instanceof u?Wt:l,c=o?s:``;return{code:Ct.general,message:`${c}${a}`,toolMessage:`${c}${Zt(e,!0)}`}},$t=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,en=2147483647,tn=1e6;let nn=tn;const rn=()=>nn,an=()=>Math.max(nn,10),on=()=>`Attempted to construct a set with too many elements (>${nn}).`,sn=(e,t)=>{if(e.length===an())throw new u(on());e.push(t)},cn=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=an(),ln=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},un=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,dn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),fn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),pn=e=>typeof e==`object`&&e.kind===`ModelValue`,mn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),hn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:un(e)?`set`:`function`,gn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let _n=!1;const vn=(e,t)=>(_n=!0,e.writtenKeys=t,e),yn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,bn=e=>yn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),xn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):bn(e),Sn=(e,t,n,r)=>vn(mi(e,t.map(e=>n[e])),r),Cn=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(Cn);e.writtenKeys=void 0,e.range.forEach(Cn)}},wn=e=>{_n&&typeof e==`object`&&e.kind===`Function`&&(e.writtenKeys=void 0)},Tn=e=>e.every(e=>typeof e==`string`),En=(e,t)=>e.length>0&&t.length>0&&Tn(e)!==Tn(t),Dn=(e,t)=>{_n&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return En(n,r)?Lr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=$n(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:$n(t,n);if(r!==0)return r}return 0},On=(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=$n(n[e],r[e]);if(t!==0)return t}return 0},kn=e=>pn(e)?e.type:void 0,An=(e,t,n)=>{let r=kn(e),i=kn(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(pn(e)&&pn(t)){if(r===void 0||i===void 0||r===i)return;throw new T(`Attempted to ${a} the differently-typed model values ${P(L(e))} and ${P(L(t))}`)}throw r===void 0?new T(`Attempted to ${a} the typed model value ${P(L(t))} and the non-model value\n${P(L(e))}`):new T(`Attempted to ${a}${n?``:` the`} typed model value ${P(L(e))} and non-model value\n${P(L(t))}`)},jn=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),Mn=jn(),Nn=e=>{Object.assign(Mn,jn()),er.clear();for(let t of e)Un(t)},Pn=()=>{Mn.searchRank=Mn.size},Fn=()=>Mn.unorderedString;let In=!1;const Ln={isExpanded:!0,isViewPrinted:!1},Rn=e=>{In=e.version===`1.7.4`,nn=e.maxSetSize??tn,Ln.isExpanded=e.isLazyValueExpanded??!0,Ln.isViewPrinted=e.isViewPrinted??!1},zn=/* @__PURE__ */ new WeakMap,Bn=(e,t)=>(Ln.isViewPrinted&&zn.set(e,t),e),Vn=/* @__PURE__ */ new WeakMap,Hn=(e,t)=>(Vn.set(e,t),e),Un=e=>(Mn.ranks[e]===void 0&&(Mn.ranks[e]=Mn.size++),e),Wn=e=>Mn.ranks[Un(e)],Gn=(e,t)=>{if(e===t)return 0;let n=Mn.ranks,r=n[e],i=n[t],a=Mn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Mn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Kn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),qn=(e,t)=>(Kn(e)||Kn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Jn=(e,t)=>new T(Kn(e)?`Attempted to compare overridden value ${P(L(e,!0))} with non-overridden value:\n${P(L(t))}`:`Attempted to compare ${hn(e)} ${L(e)} with ${hn(t)} ${L(t)}`),Yn=(e,n,r)=>{if(!Kn(e))throw new T(`Attempted to ${r} the set ${P(L(yi(e)?F(e):e,!0))} with the value:\n${P(L(n,!0))}`);if(!Kn(n))throw Jn(e,n);let i=e.kind===`InfiniteSet`?e.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 t(`Attempted to compare ${P(L(e,!0))} with the value\n${P(L(n,!0))}`)},Xn={kind:`InfiniteSet`,name:`Any`},Zn=e=>{throw new t(`Attempted to compare ANY with the value\n${P(L(e))}`)},Qn=e=>{_n&&Cn(e),e===Xn&&Zn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},$n=(e,t)=>{if(e===t)return Qn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Dn(e,t);if(n===`Set`&&r===`Set`)return On(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&&An(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return An(e,t,!1),n===`ModelValue`?-1:1;if(e===Xn||t===Xn)return Zn(e===Xn?t:e);if(un(e)&&un(t)&&qn(e,t))return Yn(e,t,`compare`);let i=un(e);if(i!==un(t))throw Jn(e,t);if(n===`Interval`&&r===`Set`){let n=zi(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-zi(t);if(n!==0)return n}return i?On(F(e),F(t)):Dn(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Gn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(An(e,t,!1),pn(e))return-1;if(pn(t))return 1;throw Jn(e,t)},er=/* @__PURE__ */ new Map,tr=32768,nr=e=>{let t=er.get(e);if(t)return t;if(er.size===tr)throw new f(`TLC supports at most ${tr} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Wn(e),hash:va(ya(ba(e),109)),fingerprint:ka(Aa(e)^60)};return er.set(e,n),n},rr=()=>[...er.values()],ir=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),ar=e=>{let t=ir(e);return t.isNormalized=!0,t},or=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let sr=!1;const cr=(e,t)=>(t===`lambda`&&(sr=!0),t!==void 0&&(e.functionClass=t),e),lr=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,ur=e=>cr(e,`lambda`),dr=e=>$t(e)&&e.isCached===!0;let fr=!1;const pr=e=>(fr=!0,e),mr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),hr=e=>{fr&&typeof e==`object`&&$t(e)&&mr.has(e.kind)&&(e.isCached=!0)},gr=e=>{(sr||fr)&&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(gr),e.range.forEach(gr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(gr):un(e)&&yi(e)&&(hr(e),F(e).elements.forEach(gr))))},_r=(e,t)=>{if(hr(e),e===t)return Qn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&An(e,t,!0),$n(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Dn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return On(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&zi(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==zi(t))return!1;if(pn(e)||pn(t))return e.kind===`LazyFunction`&&I(e),An(e,t,!0),pn(e)&&pn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return _r(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Ii(e.domain),r=Ii(t.domain);if(n||r)return n===r;let i=Ii(e.range),a=Ii(t.range);return i||a?i===a:_r(e.domain,t.domain)&&_r(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Ii(e))return Ii(t);if(Ii(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]&&_r(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Ii(e)?Ii(t):!Ii(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>_r(e,t.factors[n]));let n=un(e)&&un(t)&&!(yi(e)&&yi(t));if(n&&qn(e,t))return Yn(e,t,`check equality of`)===0;if(n){if(!Kn(e)){let n=F(e);if(!Kn(t))return On(n,F(t))===0}return Fa(e)===Fa(t)}return $n(e,t)===0},vr=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):Fa(n)===Fa(r);return n},yr=vr(!1),br=vr(!0),xr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Sr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Oa(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||br(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||br(i[e],n))return i[e]}return n.kind===`Set`?xr(n.elements,t):(xr(n.domain,t),xr(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}},Cr=(e,t)=>t.length===0||lr(e)===`tuple`?1:ha(t)?.low,wr=e=>{if(!fn(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:Cr(e,t.domain)}},Tr=e=>{if(!fn(e))return;let t=I(e);return Tn(t.domain)?t:void 0},Er=(e,t,n)=>(An(t,e,n),1),Dr={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`}},Or=(e,t,n)=>{let r=Dr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${P(L(e))} with ${r.other}:\n${P(L(t))}`},kr=e=>e?`check equality of`:`compare`,Ar=(e,t,n,r)=>{let i=wr(n);if(!i){if(pn(n))return Er(n,t,r);throw new T(`Attempted to ${kr(r)} the function ${P(L(t))} with the value:\n${P(L(n))}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>jr(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return jr(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new T(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${P(L(n))}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},jr=(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},Mr=(e,t,n)=>{let r=I(e);if(lr(e)===`tuple`){let i=fn(t)?Wi(t):void 0;return i?r.range.length-i.length||jr(r.range,i,n):Ar({...r,low:1},e,t,n)}if(lr(e)===`record`){let i=Tr(t);if(!i){if(pn(t))return Er(t,e,n);throw new T(`Attempted to ${kr(n)} record:\n${P(L(e))}\nwith non-record\n${P(L(t))}`)}return r.domain.length-i.domain.length||jr(r.domain,i.domain,n)||jr(r.range,i.range,n)}return Ar({...r,low:Cr(e,r.domain)},e,t,n)},Nr=(e,t)=>Kn(e)||Kn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Pr=(e,t)=>{let n=mn(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},Fr=(e,t,n)=>{if(Nr(e,t))return n?+!_r(e,t):$n(e,t);if(!mn(e))return Fr(F(e),t,n);if(!un(t)){if(pn(t))return Er(t,e,n);throw new T(`Attempted to ${kr(n)} the set ${P(L(e))} with the value:\n${P(L(t))}`)}let r=Pr(e,t);return r.elements.length-r.otherElements.length||jr(r.elements,r.otherElements,n)},Ir=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:$n(e,t);if(pn(t))return Er(t,e,n);throw new T(Or(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&An(e,t,n),pn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):fn(e)?Mr(e,t,n):Fr(e,t,n)},Lr=(e,t)=>Ir(e,t,!1),Rr=(e,t)=>Ir(e,t,!0)===0,zr=e=>{let t=[];for(let n of e){let e=Vr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Br=(e,t)=>{let n=Ki.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Vr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Br(e,()=>Lr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Hr=(e,t)=>t.some(t=>Br(t,()=>Rr(t,e))),Ur=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Wr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Wr)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(Wr),e.range.forEach(Wr)))},Gr=e=>{if(!(typeof e!=`object`||dr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return Gr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Gr(e.left),Gr(e.right));case`FunctionSet`:return Gr(e.domain),Gr(e.range);case`RecordSet`:return e.sets.forEach(Gr);case`ProductSet`:return e.factors.forEach(Gr)}},Kr=(e,t)=>qi(_r,Rr,e,t),qr=e=>{for(let t=1;t<e.length;t++)if($n(e[t-1],e[t])>=0)return!1;return!0},Jr=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},Yr=e=>{for(let t=1;t<e.length;t++)hr(e[t]);if(e.length<2||qr(e))return ir(e);let t=[...e].sort($n),n=[t[0]];for(let e=1;e<t.length;e++)$n(n[n.length-1],t[e])!==0&&n.push(t[e]);return ir(n)},Xr=e=>{if(Jr(e))return ir(e);let t=qi(Yr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Zr=ir([]),Qr=(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&&$n(r[a],t)<0;)a++;a<r.length&&$n(r[a],t)===0||i.push(t)}return i.length===n.length?e:ir(i)},$r=(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&&$n(r[a],t)<0;)a++;a<r.length&&$n(r[a],t)===0&&i.push(t)}return i.length===n.length?e:ir(i)},ei=(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=$n(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=ir(i);if(e.hash!==0&&e.hash!==Ca){let t=e.hash,n=0;for(;n<a.length;n++){let e=Oa(a[n]);if(e===Ca)break;t=t+xa(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+ja(a[e])|0;c.fingerprint=t}return c},ti=e=>{let t=e.length<2?e:[...e].sort((e,t)=>$n(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&$n(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return or(n,r)},ni=e=>{let t=ti(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:vn(t,e.map(e=>e[0]))},ri=[],ii=/* @__PURE__ */ new Map,ai=[],oi=/* @__PURE__ */ new WeakMap,si=e=>{let t=ri[e]??ii.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ii.set(e,new WeakRef(n)):ri[e]=n,n},ci=e=>{if(zi(e),e.low===1&&e.high>=1)return si(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},li=e=>e.length>0&&(e===ri[e.length]||e===ii.get(e.length)?.deref())||oi.has(e),ui=e=>{let t=F(e).elements;return li(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},di=e=>{let t=ai[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ai[e]=n,n},fi=e=>cr(or(si(e.length),e),`tuple`),pi=e=>cr(ti(e),`record`),mi=(e,t)=>cr(or(e,t),`record`),hi=e=>un(e)&&!Kn(e),gi=(e,t=!1)=>`UNION(${L(e.base,t)})`,_i=(e,t=e=>F(e).elements)=>{if(!hi(e.base))throw new T(`Attempted to enumerate the nonenumerable set:\n${gi(e)}`);return t(e.base)},vi=(e,t,n)=>{if(hi(e))return e;throw new T(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${P(L(e))}\nwhen enumerating:\n${P(gi(n))}`)},yi=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 yi(e.base);case`FunctionSet`:return yi(e.domain)&&yi(e.range)||bi(e.domain)===!0||bi(e)===!0;case`RecordSet`:return e.sets.every(yi)||bi(e)===!0;case`ProductSet`:return e.factors.every(yi)||bi(e)===!0;case`Union`:return yi(e.base)&&(mn(e.base)?Ur(e.base):ji(e.base)).every(yi);case`SetOperation`:return e.operator===`\\cup`?yi(e.left)&&yi(e.right):e.operator===`\\cap`?yi(e.left)||yi(e.right):yi(e.left);default:return!1}},bi=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=bi(e.domain);return t===void 0?void 0:!t&&bi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=bi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return yi(e)?F(e).elements.length===0:void 0;default:return}},xi=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},Si=(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},Ci=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Kn(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=[]:Si(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return ir(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)})},wi=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(ir(r.map(t=>e[t])));while(Si(r,e.length))}return t},Ti=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Kn(a))throw new T(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Ei=(e,t=e=>F(e).elements)=>{if(typeof e!=`object`)throw new T(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return zr(e.elements);case`Interval`:{let t=ci(e);return t!==ri[t.length]&&oi.set(t,e),t}case`Subset`:{if(zi(e.base)===0)return wi([]);if(!un(e.base))throw new T(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${P(L(e.base))}`);let t=F(e.base).elements;if(t.length>30)throw new T(Ri(e));return wi(t)}case`FunctionSet`:{if(!In&&Ii(e))return[];if(Kn(e.domain))throw new T(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${P(L(e.domain))}\ncannot be enumerated.`);let n=ui(e.domain);if((n.length>0||In)&&Kn(e.range))throw new T(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${P(L(e.range))}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return xi(n.map(()=>r)).map(e=>or(n,e))}case`RecordSet`:{if(!In&&Ii(e))return[];let n=Ti(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${P(L(t))}`);return xi(n).map(t=>pi(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!In&&Ii(e))return[];let n=Ti(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${P(L(e))}`);return xi(n).map(fi)}case`FilteredSet`:if(!un(e.base)||Kn(e.base))throw new T(`Attempted to enumerate { x \\in S : p(x) } when S:\n${P(L(e.base))}\nis not enumerable`);return F(Xr(ji(e.base).filter(e.startPass?.(!0)??(t=>e.test(t,!1))))).elements;case`Union`:{let t=[];return _i(e).forEach((n,r)=>{let i=vi(n,r,e);if(cn(i))throw new u(on());ji(i).forEach(e=>sn(t,e))}),F(Xr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!hi(e.left)&&!hi(e.right))throw new T(`Attempted to enumerate S \\cap T when neither S:\n${P(L(e.left))}\nnor T:\n${P(L(e.right))}\nis enumerable`);if(e.operator===`\\`&&!hi(e.left))throw new T(`Attempted to enumerate S \\ T when S:\n${P(L(e.left))}\nis not enumerable.`);if(e.operator===`\\cup`)return F(Xr(Oi(e))).elements;let t=e.operator===`\\`||hi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return ln(typeof n==`object`&&n.kind===`Interval`?n:ji(n),t=>{Yi(t,r)===(e.operator===`\\cap`)&&sn(i,t)}),F(Xr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new T(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new T(`Expected a set but found ${L(e)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return ir(Ei(e));let t=typeof e==`object`&&$t(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Ki.sets;n?.push(e);let r=Ei(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`)?ir(r):Yr(r);return t&&(t.enumerated=i),i},Di=e=>{if(!(typeof e!=`object`||dr(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return hi(e.base)||F(e),Di(e.base);case`Union`:if(!mn(e.base)&&hi(e.base))return Di(e.base);_i(e).slice(0,1).forEach(t=>Di(vi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!hi(e.left)&&F(e),e.operator!==`\\cup`||hi(e.left)&&hi(e.right)||F(e),e.operator!==`\\cap`||hi(e.left)?Di(e.left):Di(e.right),e.operator===`\\cup`&&Di(e.right)}},Oi=e=>{if(!hi(e.left)||!hi(e.right))throw new T(`Attempted to enumerate S \\cup T when S:\n${P(L(e.left))}\nand T:\n${P(L(e.right))}\nare not both enumerable`);if(Di(e.left),Di(e.right),cn(e.left))throw new u(on());let t=ji(e.left),n=cn(e.right)?void 0:ji(e.right);if(!n||t.length+n.length>an())throw new u(on());return[...t,...n]},ki=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=Br(e,()=>Oi(e)),n=F(Xr(t)).elements;return e.enumerated=ir(n),n},Ai=(e,t)=>{if(typeof e!=`object`||dr(e))return F(e).elements.some(t);let n=Ki.sets;n?.push(e),Di(e);let r=Fi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},ji=e=>{let t=[];return Ai(e,e=>(t.push(e),!1)),t},Mi=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Ni=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Ni);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Ni)&&e.range.every(Ni);case`SetOperation`:return e.operator!==`\\cup`&&Ni(e.left)&&Ni(e.right);case`FilteredSet`:return Ni(e.base);case`ProductSet`:return e.factors.every(Ni);default:return!1}},Pi=e=>typeof e!=`object`||dr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Pi(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Pi(e.left)||Pi(e.right):Mi(e)?.some(Pi)??!1,Fi=(e,t)=>{if(e.kind===`Union`)return _i(e,ji).some((n,r)=>Ai(vi(n,r,e),t));if(e.kind===`FilteredSet`&&hi(e.base)){let n=e.startPass?.(!1);return n?Ai(e.base,e=>n(e)&&t(e)):Ai(e.base,n=>e.test(n,!1)&&t(n))}if(Mi(e)?.some(Pi))return Ei(e,ji).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!hi(e.left)||!hi(e.right)?F(e).elements.some(t):Ai(e.left,t)||Ai(e.right,t);let n=e.operator===`\\`||hi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return hi(r)?Ai(r,n=>Yi(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},Ii=e=>{if(typeof e!=`object`||!un(e))throw Ki.sets?.push(e),new T(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new T(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(Ii);case`RecordSet`:return e.sets.some(Ii);case`FunctionSet`:return!Ii(e.domain)&&Ii(e.range);case`Union`:return _i(e).every((t,n)=>Ii(vi(t,n,e)));default:return F(e).elements.length===0}},Li=(e,t,n)=>e.reduce((e,r)=>{let i=e*zi(r,t);if(i>2147483647)throw new T(n());return i},1),Ri=e=>`Overflow when computing the number of elements in:\n${P(L(e))}`,zi=(e,t)=>{if(typeof e!=`object`)throw new T(`Attempted to compute the number of elements in the ${hn(e)} ${P(L(e))}.`);switch(e.kind){case`ModelValue`:throw new T(`Attempted to compute the number of elements in the model value ${P(L(e))}.`);case`Function`:return e.domain.length;case`LazyFunction`:return zi(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new T(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new T(`Attempted to compute the number of elements in the overridden value ${P(L(e))}.`);case`Subset`:{let n=zi(e.base,t);if(n>=31)throw new T(Ri(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Ii(e.domain))return 1;if(Ii(e.range))return 0;if(zi(e.range,t)===1)return 1}let n=zi(e.domain,t),r=zi(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new T(Ri(e));return i}case`RecordSet`:return t!==`1.7.4`&&Ii(e)?0:Li(e.sets,t,()=>Ri(e));case`ProductSet`:return t!==`1.7.4`&&Ii(e)?0:Li(e.factors,t,()=>`Overflow when computing the number of elements in ${P(L(e))}`);default:return hr(e),F(e).elements.length}},Bi=e=>`Attempted to check if the set ${P(L(e))}is finite.`,Vi=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new T(`Attempted to check if the ${hn(e)} ${P(L(e))} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new T(`Attempted to check if the function:\n${P(L(e))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Vi(e.base)&&Ii(e.base);case`Subset`:return Vi(e.base);case`FunctionSet`:{let t=Vi(e.domain);if(t&&Ii(e.domain))return!0;let n=Vi(e.range);return n&&Ii(e.range)?!0:n&&(t||zi(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Vi(e))n=!1;else if(Ii(e))return!0;return n}case`Union`:if(!hi(e.base))throw new T(`Attempted to check if the nonenumerable set:\n${gi(e)}\nis a finite set.`);return F(e.base).elements.every(Vi);case`SetOperation`:if(e.operator===`\\cup`)return Vi(e.left)&&Vi(e.right);if(e.operator===`\\cap`){if(!Vi(e.left)&&!Vi(e.right))throw new T(Bi(e));return!0}if(Vi(e.left))return!0;if(!Vi(e.right))throw new T(Bi(e));return!1;case`FilteredSet`:if(!Vi(e.base))throw new T(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${P(L(e.base))}\nis finite.`);return!0}},Hi=(e,t,n=$n)=>{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=(e,t)=>{let n=e.elements;if(n.length>an())throw new u(on());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Hi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=ir(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Wi=e=>{if(typeof e!=`object`||!fn(e))return;if(e.kind===`LazyFunction`&&(!un(e.domain)||Kn(e.domain)))throw new T(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Gi=(e,t)=>{let n=`Attempted to check if the value:\n${P(L(e))}\nis an element of the`;if(!fn(t))return`${n} ${hn(t)} ${P(L(t))}`;let r=lr(t);return r===`record`?`Attempted to check if element:\n${P(L(e))}\nis in the record:\n${P(L(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${P(L(t))}`},Ki={sets:void 0},qi=(e,t,n,r)=>{let i=Ki.sets,a=Ki.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof T))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Ji=e=>(Ki.sets??[]).slice(e).some(e=>typeof e==`object`&&Ki.callStack?.sources.has(e)===!0),Yi=(e,t)=>{let n=Ki.sets;if(n===void 0)return ea(e,t);n.push(t);let r=ea(e,t);return n.pop(),r},Xi=(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},Zi=(e,t)=>Hi(t.elements,e)!==-1,Qi=(e,t)=>t.isNormalized?Vr(e,t.elements).isFound:Hr(e,Ur(t)),$i=(e,t)=>{if(e.type!==void 0)throw new T(`Attempted to check if the typed model value ${P(L(e))} is an element of\n${P(L(t))}`);return!1},ea=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Xi(e,t)??ta(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return ta(e,t)},ta=(e,n)=>{if(!un(n))throw new T(Gi(e,n));switch(n.kind){case`Set`:return hr(e),qi(Zi,Qi,e,n);case`MixedSet`:return Hr(e,n.elements);case`Interval`:if(typeof e==`number`)return e>=n.low&&e<=n.high;if(n.low<=n.high&&(!pn(e)||e.type!==void 0))throw new T(`Attempted to check if the value:\n${P(L(e))}\nis in the integer interval ${P(L(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(pn(e))return $i(e,n);if(!(n.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new t(`Attempted to check if the value:\n${P(L(e))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!un(e)||Kn(e))throw new T(`Attempted to check if the non-enumerable value\n${P(L(e))}\nis element of\n${P(L(n))}`);return F(e).elements.every(e=>Yi(e,n.base));case`FunctionSet`:{if(!fn(e)){if(pn(e))return $i(e,n);throw new T(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${P(L(n))}`)}wn(e);let t=I(e),r=Cr(e,t.domain);return(r===void 0?Kr(n.domain,ir(t.domain)):Kr({kind:`Interval`,low:r,high:r+t.domain.length-1},n.domain))&&t.range.every(e=>Yi(e,n.range))}case`RecordSet`:{wn(e);let t=fn(e)?I(e):void 0;if(!t||!Tn(t.domain)){if(pn(e))return $i(e,n);throw new T(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${P(L(n))}`)}return t.domain.length===n.names.length&&n.names.every((e,r)=>{let i=Hi(t.domain,e);return i!==-1&&Yi(t.range[i],n.sets[r])})}case`ProductSet`:{let t=fn(e)?Wi(e):void 0;if(t===void 0){let t=fn(e)&&I(e).domain.every(e=>typeof e==`number`);if(pn(e))return $i(e,n);if(t)return!1;throw new T(`Attempted to check if non-tuple\n${P(L(e))}\nis in the set of tuples:\n${P(L(n))}`)}return t.length===n.factors.length&&t.every((e,t)=>Yi(e,n.factors[t]))}case`FilteredSet`:try{return Yi(e,n.base)&&n.test(e,!0)}catch(t){throw!(t instanceof T)||!Pt(t)?t:new T(`Cannot decide if element:\n${P(L(e))}\n is element of:\n${P(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!hi(n.base))throw new T(`Attempted to check if:\n ${P(L(e))}\nis an element of the non-enumerable set:\n ${P(gi(n))}`);let t=F(n.base).elements;return t.length>1&&t.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),t.some(t=>Yi(e,t))}case`SetOperation`:return n.operator===`\\cup`?Yi(e,n.left)||Yi(e,n.right):Yi(e,n.left)&&Yi(e,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Wi(e);if(r===void 0){if(pn(e))return $i(e,n);throw new t(`Attempted to check if the value:\n${P(L(e))}\nis an element of ${P(L(n))}.`)}return r.every(e=>Yi(e,n.base))}default:throw new T(Gi(e,n))}},na=(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?Yi(e,n):e.range.every((e,r)=>na(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(yi(e.domain)||zi(e.domain),!un(e.domain))throw new T(`The domains of formal parameters must be enumerable.`);let t=ui(e.domain);return e.enumerated=or(t,t.map(t=>e.apply(t))),e.enumerated}throw new T(`Expected a function but found ${L(e)}`)},ra=(e,t,n)=>{let r=P(L(e)),i=P(L(t)),a=n===`1.7.4`;switch(lr(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.`}},ia=(e,t)=>{if(!In)return ra(e,t);let n=P(L(t));return lr(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},aa=(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},oa=e=>new T(`Attempted to apply function with integer domain to the non-integer argument ${P(L(e))}`),sa=(e,t)=>Hi(e.domain,t),ca=(e,t,n)=>{let r=yn(e);throw In||r!==e.domain||r.length<32?r.forEach(e=>Rr(e,t)):Hi(r,t,Lr),n},la=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=lr(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new T(n(e,t));if(a===void 0&&!In&&typeof t!=`number`&&li(r))throw oa(t)}let i=aa(r,t);return i===-1?qi(sa,ca,e,t):i},ua=(e,t,n,r)=>`In applying the function\n${P(L(e))},\nthe ${t} is:\n${P(L(n))}\nwhich ${r}.\n`,da=(e,t)=>new T(ua(e,`argument list`,t,`does not match its formal parameter`)),fa=(e,t,n)=>{let r=e.domain,i=Wi(n);if(i===void 0)throw da(e,n);if(typeof r!=`object`||r.kind!==`ProductSet`)throw new T(`Attempted to apply a function to ${L(n)}, which is not in its domain`);if(t.forEach((t,a)=>{if(a>=i.length)throw da(e,n);let o=i[a],s=`argument number ${a+1}`;if(!Yi(o,r.factors[a]))throw new T(ua(e,s,o,t===void 0?`is not in the function's domain ${L(r)}`:`is not in its domain`));if(t!==void 0&&Wi(o)?.length!==t)throw new T(ua(e,s,o,`does not match its formal parameter`))}),i.length>t.length)throw da(e,n)},pa=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Yi(t,e.lambdaDomain),ma=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return ma(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return fa(e,r,t),e.apply(t);if(!Yi(t,e.domain))throw new T(lr(e)===`lambda`?ra(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new T(`Attempted to apply ${L(e)}, which is not a function`);let r=n??ra;if(pa(e,t))throw new T(r(e,t));let i=la(e,t,r);if(i===-1)throw new T(r(e,t));return e.range[i]},ha=e=>li(e)?oi.get(e)??di(e.length):void 0,ga=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=ha(t.domain);if(n)return n;let r=ir(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},_a=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(e.boundTupleLengths!==void 0&&Wi(t)===void 0)throw da(e,t);if(!Yi(t,e.domain))return e;let r=n(e.apply(t));return cr({kind:`LazyFunction`,domain:e.domain,apply:n=>Kr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},lr(e))}if(!fn(e))throw new T(`Attempted to apply EXCEPT construct to the value ${P(L(e))}.`);let i=I(e);if(pa(i,t))return i;let a=la(i,t,ia);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=cr(or(i.domain,o),lr(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==Ca){let e=Oa(c);if(e!==Ca){let t=Oa(i.domain[a]);l.hash=s===c?i.hash:i.hash-Sa(t,Oa(s))+Sa(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Ma(e,s)+Ma(e,c)|0}return l},va=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},ya=(e,t)=>Math.imul(e^t,16777619),ba=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return va(t)},xa=e=>va(e+2654435769|0),Sa=(e,t)=>va(Math.imul(e,668265261)+t|0),Ca=795548749,wa=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Oa(t[e]);if(r===Ca)return Ca;n=n+xa(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Oa(e.domain[n]),i=Oa(e.range[n]);if(r===Ca||i===Ca)return Ca;t=t+Sa(r,i)|0}return t},Ta=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new T(`TLC has found a state in which the value of a variable contains ${P(L(e))}`);if(un(e)){F(e).elements.forEach(Ta);return}let t=I(e);t.domain.forEach(Ta),t.range.forEach(Ta)},Ea=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Oa(e)===Ca&&Ta(e);return}catch(e){if(!(e instanceof T))throw e;return e}},Da=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[]}},Oa=e=>typeof e==`number`?va(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ba(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=wa(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?yi(e.domain)?Oa(I(e)):Ca:yi(e)?Oa(F(e)):Ca,ka=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Aa=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return ka(t)},ja=e=>ka(Pa(e)+2135587861|0),Ma=(e,t)=>ka(Math.imul(Pa(e),374761393)+Pa(t)|0),Na=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ja(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Ma(e.domain[n],e.range[n])|0;return t},Pa=e=>typeof e==`number`?ka(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Aa(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Na(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Pa(I(e)):yi(e)?Pa(F(e)):Aa(Fa(e)),Fa=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Ia(e),Ia=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Fa(e.base)}>`;if(e.kind===`FilteredSet`&&!yi(e))throw new T(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(un(e))return yi(e)?`{${F(e).elements.map(Fa).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${Fa(e)}:${Fa(t.range[n])}`).join(`,`)})`},La={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Ra=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>La[e])}"`,za=1999,Ba=e=>e.reduce((e,t)=>e===0?0:e*zi(t),1),Va=e=>{if(e.kind===`Subset`)return zi(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=Ii(e.domain)?0:zi(e.domain);return(t===0?1:zi(e.range)**t)<=za?F(e):void 0}return Ba(e.kind===`RecordSet`?e.sets:e.factors)<=za?F(e):void 0},Ha=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&fn(e.base)&&(e.base.kind===`Function`||yi(e.base.domain)))return Va(e);if(yi(e))try{return Va(e)}catch(e){if(e instanceof T)return;throw e}},Ua=(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 gi(e,t)}},Wa=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Ga=e=>{if(yi(e.domain))try{return I(e)}catch(e){if(e instanceof T||x(e))return;throw e}},Ka=e=>{let t=[],n=[],r=[],i=(e,a,o)=>{if(typeof e!=`object`)return;let s=e=>i(e,a,!1);switch(e.kind){case`Set`:if(e.elements.forEach(s),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(s),F(e);return;case`Function`:{let t=a||lr(e)===`lambda`;if(e.range.forEach(e=>i(e,t,o)),a||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:if(e.enumerated)return i(e.enumerated,!0,o);o&&r.push(e),s(e.domain);return;case`SetOperation`:s(e.left),s(e.right);return;case`FunctionSet`:s(e.domain),s(e.range);return;case`RecordSet`:e.sets.forEach(s);return;case`ProductSet`:e.factors.forEach(s);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:s(e.base);return;default:return}};try{return e.forEach(e=>i(e,!1,!0)),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),r.forEach(e=>{e.enumerated=void 0}),n.forEach(e=>{e[0].writtenKeys=e[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=Ln.isExpanded?Ha(e,t):void 0;return n?r(n):Ua(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Ln.isExpanded||!e.source?Ga(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&&In&&lr(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&lr(e)!==`lambda`);if(i.domain.length===0&&lr(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]]):xn(i);return lr(e)===`record`||i.domain.every(e=>typeof e==`string`&&Wa(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},qa=(e,t)=>{if(e===void 0)return!1;try{return _r(e,t)}catch(e){if(e instanceof T)return!1;throw e}},Ja=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ya=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Ja,(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`:(ht(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},Xa=(e,t)=>{let n=t?void 0:zn.get(e);if(n)return n();let r=Object.entries(e),i=Vn.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
75
+ `:`/\\ %s = %s
76
+ `;if(typeof o!=`string`)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must be a string.`);return r.filter(e=>!(a&&e[0]===`_format`)).filter(e=>!t||!qa(t[e[0]],e[1])).map(e=>{let t=Ya(o,[e[0],P(L(e[1]))]);if(t===void 0)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must format two strings, the name and the value of a field.`);return t}).join(``)},Za=[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 Qa=Za[0];const $a=()=>Qa,eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256),ro=/* @__PURE__ */ new Int32Array(256),io=/* @__PURE__ */ new Int32Array(256),ao=/* @__PURE__ */ new Int32Array(256),oo=/* @__PURE__ */ new Int32Array(256),so=/* @__PURE__ */ new Int32Array(256);let co=0,lo=0,uo=0,fo=0;const po=e=>{let t=(e^fo)&255;fo=(fo>>>8|uo<<24)^io[t],uo=uo>>>8^eo[t]},mo=e=>{let t=Za[e];Qa=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);eo[e]=Number(BigInt.asIntN(32,t>>32n)),io[e]=Number(BigInt.asIntN(32,t))}let i=[eo,to,no,ro],a=[io,ao,oo,so];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)^io[o],i[e][r]=t[r]>>>8^eo[o]}}co=Number(BigInt.asIntN(32,t>>32n)),lo=Number(BigInt.asIntN(32,t))};mo(0);const ho=e=>{let t=fo^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;fo=uo^so[n]^oo[r]^ao[i]^io[a],uo=ro[n]^no[r]^to[i]^eo[a]},go=e=>{if(typeof e==`boolean`)return po(0),po(e?116:102),2;if(typeof e==`number`)return po(1),ho(e),5;if(typeof e==`string`){po(3),ho(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)ho(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++)po(e.charCodeAt(n));return 5+e.length}return po(21),ho(Wn(e.name)+1),5},_o=e=>{let t=uo,n=fo;uo=0,fo=0;let r=[go(e),uo,fo];return uo=t,fo=n,r},vo=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,yo=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,bo={integer:e=>`${vo(`1`)} ${yo(e)}`,boolean:e=>`${vo(`0`)} ${vo(`(${e} ? 116 : 102)`)}`,set:e=>`${vo(`5`)} ${yo(e)}`,function:e=>`${vo(`9`)} ${yo(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${yo(`0`)} } for (; r > 0; r--) { ${vo(`0`)} } h ^= ${t}; l ^= ${n}; }`},xo=()=>({H0:eo,H1:to,H2:no,H3:ro,L0:io,L1:ao,L2:oo,L3:so,initialHigh:co,initialLow:lo}),So=(e,t)=>{let n=uo,r=fo;fo=e[0],uo=e[1],To(t),e[0]=fo,e[1]=uo,uo=n,fo=r},Co=e=>{po(5),ho(e)},wo=e=>{po(9),ho(e)},To=e=>{if(typeof e!=`object`||pn(e))go(e);else if(fn(e)){let t=I(e);wo(t.domain.length);for(let e=0;e<t.domain.length;e++)To(t.domain[e]),To(t.range[e])}else{let t=F(e).elements;Co(t.length);for(let e of t)To(e)}},Eo=e=>{let t=uo,n=fo;uo=co,fo=lo;for(let t of e)To(t);let r=BigInt(uo>>>0)<<32n|BigInt(fo>>>0);return uo=t,fo=n,r},Do=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=uo,a=fo;for(let n=0;n<e;n++)uo=co,fo=lo,t(n),r[2*n]=fo,r[2*n+1]=uo;return uo=i,fo=a,n},Oo=(e,t)=>Do(e.length,n=>{for(let r of t)To(e[n][r])}),ko=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Ao=1024,jo=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*Ao),relations:[]}),Mo=(e,t)=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,coverage:t}),No=(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},Po=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Fo=(e,t,n,r,i)=>{let a=t===`next`?Po(e,t,r):void 0;if(a!==void 0)return a;let o=No(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Io=(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,Lo=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?g(a):`Unknown location`}`:Io(r.body.location.range,a)||!a?`${r.name} ${g(i)}`:`${r.name} ${g(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},Ro=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,zo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Bo=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Vo=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[(ht(t.name)&2147483647)%e.length].unshift(t));t=e}t[(ht(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Ho=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Uo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Wo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Go=(e,t,n)=>{let r=new Set(n.map(Ro)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(N(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&&!ko.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=No(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Ro(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`?Wo(t.bounds):t.params.map(e=>e.name);m(t.body,Uo(n,e.scope)),t.kind===`Function`&&Ho(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,Uo(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,Uo(e.params,t));return;case`Selection`:m(e.expression,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)}),Vo(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,zo(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,Bo(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,zo(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,Uo(Wo(e.bounds),t)),r(Ho(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Uo(Wo(e.bounds),t)),r(Ho(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Uo(Wo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Uo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Uo(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()})},Ko=(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=Ko(e,r,n);if(t!==-1)return t}}return-1},qo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Ko(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Ko(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Jo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Yo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Xo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Zo=(e,t,n,r,i)=>{let a=dn(n)?n:t!==`\\`&&dn(r)?r:void 0;if(a===void 0||typeof i!=`object`)return i;let o=a===n?r:n;if(t===`\\cup`){if(Ii(a)||!dn(o))return i;let t=e.values.get(o);t!==void 0&&(e.secondary[t]+=zi(o)+1)}let s=t===`\\cup`?void 0:e.values.get(a);if(e.values.get(i)===s)return i;let c=i===n||i===r||e.values.has(i)?{...i}:i;return s!==void 0&&e.values.set(c,s),c},Qo=(e,t,n)=>{let r=0;return{next:()=>(t!==void 0&&e.secondary[t]++,r++<n),reset:()=>{r=0}}},$o=(e,t,n)=>{if(n.some(e=>Ii(e)))return{next:()=>!1,reset:()=>void 0};let r=n.map(t=>ts(e,t,zi(t),!1)),i=()=>{for(let e=r.length-1;e>0;e--){if(r[e].next())return!0;r[e].reset(),r[e].next()}return r.length>0&&r[0].next()},a=!r.every(e=>e.next());return{next:()=>!a&&(e.secondary[t]+=Math.max(r.length,1),a=!i(),!0),reset:()=>{r.forEach(e=>{e.reset(),e.next()}),a=!1}}},es=(e,t)=>{let n=typeof t==`object`?e.values.get(t):void 0;if(n!==void 0&&typeof t==`object`){if(t.kind===`RecordSet`)return $o(e,n,t.sets);if(t.kind===`FunctionSet`)return $o(e,n,Array.from({length:zi(t.domain)},()=>t.range))}},ts=(e,t,n,r)=>{let i=typeof t==`object`?e.values.get(t):void 0;if(typeof t==`object`&&(t.kind===`Subset`||!r&&t.kind===`FilteredSet`))return Qo(e,void 0,n);let a=es(e,t);if(!a||i===void 0)return Qo(e,i,n);if(!r)return a;let o=0;for(;a.next();)o++;return e.secondary[i]+=o,Qo(e,i,o)},ns=(e,t,n)=>{let r=typeof t==`object`&&t.kind===`Subset`?e.values.get(t):void 0;r!==void 0&&typeof n==`object`&&e.values.set(n,r)},rs=(e,t,n,r)=>{let i=Array.isArray(n)?n.length:n.high-n.low+1;return typeof t!=`object`||t.kind!==`Subset`||!Array.isArray(n)?ts(e,t,i,r):(n.forEach(n=>ns(e,t,n)),Qo(e,void 0,i))},is=e=>(e.every(e=>e.next()),()=>{for(let t=0;t<e.length;t++){if(e[t].next()||t===e.length-1)return;e[t].reset(),e[t].next()}}),as=(e,t,n)=>is(t.map((t,r)=>rs(e,t,n[r],!0))),os=(e,t,n)=>{let r=n.map(e=>zi(e)),i=is(n.map((t,n)=>ts(e,t,r[n],!1))),a=r.reduce((e,t)=>e*t,1);for(let e=0;e<a;e++)i();e.secondary[t]+=a},ss=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},cs=(e,t)=>t.forEach((t,n)=>{let r=Eo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*Ao+i;e.registers[o]=Math.max(e.registers[o],ss(a)+1)}),ls=(e,t)=>{let n=e.registers.subarray(t*Ao,(t+1)*Ao),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*Ao*Ao/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*Ao?a===0?i:Ao*Math.log(Ao/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},us=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},ds=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>us(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},fs=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},ps=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],ms=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},hs=(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}},gs=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||ps(e,t))&&fs(n,a),ms(e,t).forEach(e=>i(e).forEach(e=>fs(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?g(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=ms(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>fs(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=ps(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,ds(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return ms(e,t).forEach(e=>{i(e),s(e,0)}),n},_s=[`init`,`next`,`invariant`,`constraint`,`implied`],vs=(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,ys=e=>_s.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>vs(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||vs(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),bs=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?g(i):`Unknown location`}`,distinct:ls(e,r)}}),relations:ys(e).map(t=>({kind:t.kind,label:t.label,...hs(e,t),expressions:gs(e,t.node)}))}),xs=(e,t,n)=>{let r=Po(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]]]},Ss=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Cs=(e,n)=>Ss.has(e)?new T(n):new t(n),ws=(e,n,r,i)=>new t(`The ${e} argument of ${n} should be a ${r}, but instead it is:\n${P(L(i))}`),Ts=(e,n,r=e)=>{if(!un(e)||Kn(e))throw new t(`Applying ${n} to the following value,\nwhich is not a finite set:\n${P(L(r))}`);return F(e)},Es=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Es(r))throw Cs(n,`${n} expects a value as argument ${t+1}`);return r},Ds=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Cs(n,`${n} expects a boolean but received ${L(r)}`);return r},Os=(e,t,n)=>{let r=e[t];if(r===void 0||!Es(r))throw Cs(n,`${n} expects an operator as argument ${t+1}`);return r},ks=(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}),As=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),js=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Ms=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ns=e=>e>2147483647||e<-2147483648,Ps=e=>new t(`Overflow when computing ${e}`),Fs={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`},Is={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ls={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`},Rs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},zs=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Is[e.operator];if(e.kind!==`Function`)return Fs[e.kind];let t=lr(e);return t===void 0?`FcnRcdValue`:Rs[t]},Bs=e=>Ls[zs(e)],Vs=(e,t)=>new T(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Hs=(e,n)=>{let r=r=>(...i)=>{let a=Ki.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof T)||r instanceof E)throw r;let i=Ji(a);throw Ki.sets&&(Ki.sets.length=a),e.isLazy!==!0&&r instanceof t&&!i?r:Vs(n,r.message)}},i=r(e.evaluate);return{...e,evaluate:(t,r)=>{if(t.length!==e.arity)throw Vs(n,`array is not of length ${e.arity}`);return i(t,r)},evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Us=(e,t)=>{if(typeof e!=`number`)throw Vs(t,`Cannot cast tlc2.value.impl.${zs(e)} to tlc2.value.impl.IntValue`);return e},Ws=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Gs=(e,t,n,r)=>{let i=Ws(e,n,`IntValue`,2);return Ms(t,(e,n)=>{let a=Us(n,i),o=Us(e,i),s=r(o,a);if(Ns(s))throw Ps(`${o}${t}${a}`);return s})},Ks=(e,n,r)=>{if(typeof e!=`number`)throw new t(`The ${n} argument of ${r} should be an integer, but instead it is:\n${P(L(e))}`);return e},qs=(e,t,n=e)=>Ms(e,(e,r)=>t(Ks(e,`first`,n),Ks(r,`second`,n))),Js=(e,t,n)=>({...js(e,t,n),isLazy:!0}),Ys=(e,t,n)=>{let r=Os(e,t,n);return()=>r.call([])},Xs=/* @__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(`,`),Zs=[[`\\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`,`≀`],[`^+`,`⁺`]],Qs=new Map(Zs.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),$s=e=>e.split(`!`).map(e=>Qs.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),ec=/* @__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(`,`),tc=/* @__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(`.`),nc=/* @__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(`.`),rc=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
140
77
  Nat == { }
141
78
  a+b == {a, b}
142
79
  a-b == CHOOSE n : b + n = a
@@ -452,9 +389,25 @@ _CheckName(name) ==
452
389
  => (PrintT(counts) /\\ FALSE)
453
390
  _PrintCounts == PrintT(_Counts)
454
391
  =============================================================================
455
- `]]),Af=/* @__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)`]])]]),jf=D(`EOF`),Mf=D(`IDENTIFIER`),Nf=D(`DEFBREAK`),Pf=(e,t)=>Array.from({length:D(t)-D(e)+1},(t,n)=>D(e)+n),Ff=new Set(Pf(`op_57`,`op_119`)),If=new Set(Pf(`op_1`,`op_119`)),Lf=new Set(Pf(`op_57`,`op_70`)),Rf=/* @__PURE__ */ new Set([...Pf(`ACTION`,`EXCEPT`),D(`EXTENDS`),...Pf(`IF`,`SF`),D(`STATE`),...Pf(`THEN`,`WITH`),D(`US`),...Pf(`op_112`,`op_116`)]),U=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),zf=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,`=>`)]),Bf=new Map([...zf,...wf.flatMap(e=>e.slice(1).map(t=>[t,zf.get(e[0])]))]),Vf=Bf.get(`[`),Hf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Uf=e=>({type:`tokens`,kinds:new Set(e)}),Wf=e=>typeof e==`string`?e.startsWith(`<`)?Uf([D(e.slice(1,-1))]):{type:`call`,name:e}:e,W=(...e)=>({type:`sequence`,units:e.map(Wf)}),G=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:W(e))}),Gf=e=>(...t)=>({type:e,body:W(...t)}),K=Gf(`zeroOrMore`),Kf=Gf(`oneOrMore`),q=Gf(`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}),qf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Jf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=qf(e,n);return n},Yf=(...e)=>{let t=e.map(D);return e=>t.includes(Jf(e,1).kind)},Xf=(e,t=Jf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Zf=e=>{let t=Jf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Qf=e=>Yf(`CASESEP`)(e)&&Xf(e),$f=e=>{let t=Jf(e,1);Rf.has(t.kind)&&(t.kind=Mf)},ep=(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}`,tp=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),np=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},rp=e=>e.operatorStacks[e.operatorStacks.length-1],ip=(e,t)=>e.low>t.high,ap=(e,t)=>e.high<t.low,op=e=>e.fix===`prefix`?e:Bf.get(`${e.name}.`),sp=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Vf?tp(`FcnAppl`,[n,...r.node.heirs]):tp(`PostfixExpr`,[n,r.node]),operator:void 0})},cp=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:tp(`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:tp(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},lp=e=>{let t=rp(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 sp(t,n),lp(e);if(i.operator!==void 0){let t=op(r.operator);return t!==void 0&&ip(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${ep(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 ${ep(e,a.node.first,a.node.last)} and expression at location ${ep(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return ap(a.operator,r.operator)?void 0:ip(a.operator,r.operator)?(cp(t,a.operator),lp(e)):`Precedence conflict between ops ${a.operator.name} in block ${ep(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=op(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(ap(s,r.operator))return;if(!ip(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${ep(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return cp(t,s),lp(e);let c=ep(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===Hf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},up=e=>J(t=>{let n=rp(t),r=np(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:lp(t)}),dp=up(()=>!1),fp=up(()=>!0),pp=J(e=>{e.lastOperator=Bf.get(e.token.image)}),mp=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},hp=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?mp(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},gp=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Xf(e,n.first.beginColumn))return n;let t=gp(e,n);if(t!==void 0)return t}},_p=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(D),n=(e,...t)=>t.some(t=>e.kind===D(t)),r=e=>e!==void 0&&Ff.has(e.kind),i=e.token,a=qf(e,i);i.next=void 0;let o=qf(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===Mf&&(e=e.next)}else if(e.kind===Mf){let t=e.next;!r(t)||Lf.has(t.kind)||If.has(t.kind)&&t.next?.kind!==Mf||(e=t.next?.kind===D(`SUBSTITUTE`)?i:If.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=qf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},vp=e=>{let t=Jf(e,1);if(t.kind===D(`LAB`)){let n=1;for(;n!==0;)if(t=qf(e,t),t.kind===D(`LAB`)&&n++,t.kind===D(`RAB`)&&n--,t.kind===jf)return!1;return qf(e,t).kind===D(`IN`)}if(t.kind!==Mf)return!1;for(t=qf(e,t);t.kind===D(`COMMA`);){if(t=qf(e,t),t.kind!==Mf)return!1;t=qf(e,t)}return t.kind===D(`IN`)},yp=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),bp=e=>e.proofLevels.at(-1)??-1,xp=e=>{let t=Jf(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||bp(e)>=0&&yp(t)>bp(e):Yf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Sp=(e,t)=>{let n=yp(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},Cp=e=>J(t=>Sp(t,t.token)?void 0:`${ep(t,t.token)}: ${e}`),wp=Uf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(D)),Tp=Uf([...wp.kinds,D(`op_76`)]),Ep=Uf(If),Dp=Uf(Lf),Op=Uf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(D)),kp=()=>K(X({expansion:[G(wp,`<op_77>`)],semantic:Xf}),G(`PrefixOp`,`InfixOp`),fp),Ap=()=>G(W(X({expansion:[`OpenStart`],semantic:Xf}),`OpenExpression`,dp),W(X({semantic:Xf}),`ExtendableExpr`)),jp=()=>G(W(`<MODULE>`,Y(`identifier`),`Identifier`),`Expression`),Mp=()=>G(W(X({semantic:e=>Yf(`ASSUME`,`BOXASSUME`)(e)||Jf(e,2).kind===D(`COLONCOLON`)&&[D(`ASSUME`),D(`BOXASSUME`)].includes(Jf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),Np=()=>[`JuncItem`,K(X({semantic:Zf}),`JuncItem`)],Pp=e=>J(t=>{t.expecting=e,$f(t)}),Fp=e=>J(t=>{t.isTerminalProof=e}),Ip=(e,...t)=>W(...t.slice(0,-1),Y(`==`),`<DEF>`,J(t=>{_p(t),t.expecting=e}),t[t.length-1]),Z=(e,t,n)=>({message:e,body:W(...t),exit:n}),Lp={CompilationUnit:Z(void 0,[J(_p),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>`),Pp(`Identifier`),`Identifier`,J(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Z(void 0,[`<END_MODULE>`]),Extends:Z(`Extends`,[q(`<EXTENDS>`,Pp(`Identifier`),`Identifier`,Y(`comma or module body`),K(`<COMMA>`,Pp(`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(_p)),W(X({semantic:e=>Yf(`USE`)(e)&&Jf(e,2).kind!==D(`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(Ip(`Expression`,X({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,Y(`[`),`<LSB>`,Y(`Identifier`),`QuantBound`,Y(`COMMA or ]`),K(`<COMMA>`,Y(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Ip(`Expression`,X({expansion:[`<IDENTIFIER>`,Dp]}),`PostfixLHS`,`Expression`),Ip(`Expression`,X({expansion:[`<IDENTIFIER>`,Ep]}),`InfixLHS`,`Expression`),Ip(`Expression or Instance`,X({expansion:[`<IDENTIFIER>`,G(`<LBR>`,`<DEF>`)]}),`IdentLHS`,G(`Expression`,`Instantiation`)),Ip(`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`,[Tp,Y(`Identifier`),`Identifier`]),InfixLHS:Z(`Infix LHS`,[`Identifier`,Ep,`Identifier`]),PostfixLHS:Z(`Postfix LHS`,[`Identifier`,Dp]),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>`,Pp(`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,[wp,pp]),NonExpPrefixOp:Z(void 0,[Tp,pp]),InfixOp:Z(`Infix Op`,[Ep,pp]),PostfixOp:Z(void 0,[Dp,pp]),Identifier:Z(void 0,[`<IDENTIFIER>`]),Assumption:Z(`Assumption`,[Y(`ASSUM...`),G(`<ASSUMPTION>`,`<ASSUME>`),q(X({amount:2}),q(`<DEFBREAK>`),`Identifier`,Y(`==`),`<DEF>`),J(e=>{_p(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Z(`Assume-Prove`,[G(W(`Identifier`,`<COLONCOLON>`,`AssumeProve`),W(G(`<ASSUME>`,`<BOXASSUME>`),Y(`Expression, Declaration, or AssumeProve`),Mp(),Y("PROVE or `,'"),K(`<COMMA>`,Y(`Expression, Declaration, or AssumeProve`),Mp(),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=np(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${ep(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(_p),G(W(X({amount:3}),X({semantic:Yf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),q(X({semantic:xp}),`Proof`)]),Proof:Z(`Proof`,[J(e=>{e.proofLevels.push(-1)}),G(W(X({semantic:e=>Yf(`BY`)(e)||Jf(e,2).kind===D(`BY`)}),`UseOrHideOrBy`),W(X({amount:2}),q(`<PROOF>`),G(`<OBVIOUS>`,`<OMITTED>`)),W(q(X({amount:2}),`<PROOF>`),K(X({semantic:e=>Jf(e,2).kind!==D(`QED`)}),`Step`,Y(`a proof step`)),`QEDStep`)),J(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Z(`UseOrHideOrBy`,[G(W(q(`<PROOF>`),`<BY>`,Fp(!0),q(`<ONLY>`)),W(`<USE>`,Fp(!1),q(`<ONLY>`)),W(`<HIDE>`,Fp(!1))),Y("an expression, `MODULE' or `DEF'"),q(jp(),K(`<COMMA>`,Y(`MODULE or expression`),jp(),J(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),q(`<DF>`,Y(`MODULE or expression`),jp(),K(`<COMMA>`,Y(`MODULE or expression`),jp(),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`),Op,Cp(`QED step's number has bad level.`),Y(`QED`),`<QED>`,q(X({semantic:xp}),`Proof`)]),Step:Z(`Step`,[Y(`Step number`),Op,Cp(`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:xp}),J(e=>{let t=np(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${ep(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Z(`DefStep`,[q(`<DEFINE>`),Kf(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(Tp,Ep,Dp),Uf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(D))],semantic:Xf}),G(`NonExpPrefixOp`,W(`InfixOp`,J(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${ep(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),W(X({expansion:[`<LAMBDA>`],semantic:Xf}),`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:vp}),G(`IdentifierTuple`,`Identifier`),Y(`\\in`),`<IN>`,`Expression`,Y(`':', ',' or '}'`),q(G(W(`<COLON>`,`Expression`),Kf(`<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=np(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`)),Kf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Z(`Some [] Form`,[`<LSB>`,G(W(X({semantic:vp}),`QuantBound`,K(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),W(X({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,K(`<COMMA>`,`FieldVal`),`<RSB>`),W(X({semantic:e=>Jf(e,2).kind===D(`MAPTO`)&&Rf.has(Jf(e,1).kind)}),J(e=>{Jf(e,1).kind=Mf}),`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=tp(`FcnAppl`,t.heirs),e.lastOperator=Vf})),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>`,Kf(`ExceptComponent`,Y(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Z(`Except Component`,[G(W(`<DOT>`,J($f),`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===D(`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=>Qf(e)&&Jf(e,2).kind!==D(`OTHER`)}),`<CASESEP>`,`CaseArm`),q(X({semantic:Qf}),`<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`,[Kf(G(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Z(`AND-OR Junction`,[J(e=>{let t=Jf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),G(W(X({expansion:[`<OR>`]}),...Np()),W(X({expansion:[`<AND>`]}),...Np())),J(e=>{e.junctions.pop()})]),JuncItem:Z(`Junction Item`,[G(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=gp(t,e.heirs[1]);return n&&`Item at ${ep(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${ep(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([])}),kp(),Ap()],(e,t)=>{let n=rp(t);n.push({node:e.heirs[0],operator:Hf});let r=lp(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`),dp,K(G(W(X({expansion:[`PostfixOp`],semantic:Xf}),`PostfixOp`,fp),W(X({expansion:[`<DOT>`],semantic:Xf}),`<DOT>`,J($f),X({semantic:Xf}),`Identifier`,J(e=>{let t=rp(e);t[t.length-1].operator!==void 0&&sp(t,t.length),t[t.length-1]={node:tp(`RecordComponent`,[t[t.length-1].node,np(e,2),np(e,1)]),operator:void 0}})),W(X({expansion:[`<LSB>`],semantic:Xf}),Y(`function argument`),`SBracketCases`,up(e=>e.kind===`FcnAppl`)))),q(G(W(X({expansion:[`InfixOp`],semantic:Xf}),`InfixOp`,fp,kp(),Ap()),W(X({expansion:[`<COLONCOLON>`],semantic:Xf}),`<COLONCOLON>`,J(e=>{let t=rp(e);if(!hp(t[t.length-1].node))return`\`::' at ${ep(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,J(e=>{let t=rp(e),n=np(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!ap(r,e.lastOperator)){let t=np(e,3);return`Removing label at ${ep(e,t.first,t.last)} would change expression parsing.`}t.push({node:tp(`Label`,[np(e,3),np(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Z(`Primitive expression`,[G(W(X({expansion:[`String`],semantic:Xf}),`String`),W(X({expansion:[`<NUMBER_LITERAL>`],semantic:Xf}),`Number`),W(G(`Identifier`,W(G(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),J(e=>bp(e)<0&&e.proofLevels.length<=1?`${ep(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${ep(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:mp(e.heirs)===void 0?e.heirs.length===1?tp(`GeneralId`,e.heirs):void 0:tp(`OpApplication`,e.heirs)}),BangExt:Z(`Bang Extension`,[`<BANG>`,G(W(G(W(X({expansion:[`Identifier`],semantic:e=>Jf(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=>Jf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${ep(t,n.first,n.last)}`:void 0}),OpenStart:Z(void 0,[G(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},Rp=/* @__PURE__ */ new Map,zp=e=>{let t=Rp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=zp(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,zp(Lp[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 Rp.set(e,n),n},Bp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Vp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=qf(e,e.scanPosition)),e.scanPosition=qf(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`},Hp=(e,t)=>{if(t.type===`tokens`)return Vp(e,t.kinds);if(t.type===`call`)return Hp(e,Lp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Bp(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=Hp(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||Bp(e,t.semantic)?Hp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Hp(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=Hp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Up=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Hp(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},Wp=(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||zp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!zp(a).hasSemanticStart?zp(a).first.has(Jf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Up(e,i,a)&&(o===void 0||o(e))}),Gp=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,Hp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=qf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===jf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=qf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Ge(e.token.image)}" `},Kp=(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??Gp(e)}\n\nResidual stack trace follows:\n${r}`,!1},qp=(e,t)=>{let n=qf(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,Kp(e))},Jp=(e,t)=>{let n=Lp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Jf(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 Kp(e,i);let a=r.node??(r.heirs.length===0?void 0:tp(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},Yp=(e,t)=>{if(t.type===`tokens`)return qp(e,t.kinds);if(t.type===`call`)return Jp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Kp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Kp(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=Wp(e,t.alternatives);return n===-1?Kp(e):Yp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!Yp(e,t.body))return!1;if(t.type===`optional`)return Wp(e,[t.body])===-1||Yp(e,t.body);for(;Wp(e,[t.body])===0;)if(!Yp(e,t.body))return!1;return!0},Xp=e=>{let t=Ue(e),n={kind:jf,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},Zp={low:15,high:15},Qp={low:16,high:16},Q=(e,t,n)=>({low:e,high:t,isAssociative:n}),$p=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)]]),em=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),tm=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),nm=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),rm=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),im=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),am=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...em]),om=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),sm=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),cm=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),lm=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),um=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),dm=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),fm=/* @__PURE__ */ new Set([``,`*`,`-`]),pm=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),mm=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),hm=/* @__PURE__ */ new Set([`NEW`,...mm.keys()]),gm=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),_m=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),vm=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),ym=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?$p.has(e.operator):em.has(e.operator)),bm=e=>$p.has(e)||em.has(e)||e===`-.`,xm=(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}}},Sm=(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`},Cm=(e,n,r=be(e))=>{let i=n===`tlapm`,a=i?r:r.map(ge),o={index:0,offsideColumns:[]},s={},u=[],d=/* @__PURE__ */ new Set,f=[],p=[],m=e=>u[u.length-1].has(e),h=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),g=[],_=[],v=[],y=(e,t=o.index-1)=>{let n=e===t?v[e]:void 0;if(n)return n;let r=a[t];g[e]??=h(a[e]),_[t]??={line:r.line,column:r.endColumn};let i={module:p[0].name,start:g[e],end:_[t]};return e===t&&(v[e]=i),i},b=(e,t)=>(e.location.range=y(t),e),ee=(e=0)=>a[Math.min(o.index+e,a.length-1)],x=(e=0)=>{let t=ee(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},te=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ne={index:0},re=e=>{let t=a.slice(ne.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ie=e=>i&&(e.kind===`Keyword`||vm.has(e.text)),ae=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:dm.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ie(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,ce=(e,t=ee(),n)=>{let r=a[a.length-1],i=t.line===r.line&&t.column===r.column;return new l(`${e} at line ${t.line}, column ${t.column}`,void 0,le(e,t,i,n))},le=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...re(ae(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${oe(r)}`,...ae(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},ue=(e,t=ee())=>ce(e,t,t),de=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ie(e),S=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},C=()=>{let e=x();if(e.kind===`End`)throw ce(`Unexpected end of expression`);return o.index++,e},w=e=>S(e)?(o.index++,!0):!1,T=e=>{if(!S(e))throw ue(`Expected ${JSON.stringify(e)} but found ${te(x())}`);return C()},fe=()=>{let e=x();if(e.kind!==`Identifier`)throw ue(`Expected an identifier but found ${te(e)}`);if(ie(e))throw ue(`Unexpected keyword ${e.text}`);return o.index++,e.text},pe=()=>{let e=o.index;return{name:fe(),range:y(e)}},me=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),he=()=>{let e=x();return e.kind!==`String`&&(nm.has(e.text)||$p.has(e.text)||em.has(e.text)||e.text===`'`)?(o.index++,e.text):fe()},_e={isUsed:!1},ve=()=>x().kind===`Identifier`||!de(x())?fe():(_e.isUsed=!0,C().text),ye=e=>{if(!i)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},E=(e,t=`,`)=>{let n=[e()];for(;w(t);)n.push(e());return n},xe=()=>{if(S(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||S(`,`,e.value);)e.value++;return S(`>>`,e.value)&&S(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(S(`\\in`,e.value+1))return!0;if(!S(`,`,e.value+1))return!1;e.value+=2}return!1},Se=()=>{if(S(`::`))return!0;if(!S(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&S(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&S(`)`,e.value+1)&&S(`::`,e.value+2)},Ce=()=>{if(!w(`<<`)){let e=pe();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=me(E(pe));return T(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},D=()=>E(()=>{let e=E(Ce);T(`\\in`);let t=O();return e.map(e=>({pattern:e,set:t}))}).flat(),we=()=>{let e=x();if(e.kind===`Identifier`){let t=o.index,n=[C().text];for(;S(`!`)&&x(1).kind===`Identifier`;)C(),n.push(fe());return b({kind:`Identifier`,name:n.join(`!`),location:h(e)},t)}if(S(`<<`)||S(`(`))return ze();throw ue(`Expected a subscript but found ${te(e)}`)},Te=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&S(`==`,em.has(n.text)?3:4))},Ee=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||S(`,`,1)||S(`)`,1)||t.kind===`Keyword`&&sm.has(t.text)||Te(e)},De=()=>{let e=x(),t=e.kind===`Operator`&&($p.has(e.text)||tm.has(e.text))&&Ee(e);if(i&&e.kind!==`String`&&(tm.has(e.text)||am.has(e.text)&&e.text!==`'`&&!em.has(e.text)||im.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&Ee(e))throw ce(`incomplete expression`,e);if(t)return o.index++,b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:h(e)},o.index-1);if(e.kind!==`String`&&am.has(e.text)&&Ee(e)){o.index++;let t=h(e);if(em.has(e.text))return b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return b({kind:`Lambda`,params:[n.name],body:xm(e.text,n,t),operator:e.text,location:h(e)},o.index-1)}if(S(`LAMBDA`)){let t=o.index;C();let n=me(E(pe));T(`:`);let r=O();return b({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:h(e)},t)}return O()},Oe={range:void 0},ke=()=>ye(()=>{let e=o.index;T(`(`);let t=E(De);return T(`)`),Oe.range=y(e),t}),Ae=()=>{let e=C();o.offsideColumns.push(e.column);let t=[O()];for(;ee().text===e.text&&ee().column===e.column;)o.index++,t.push(O());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:h(e)}},je=e=>ye(()=>{let t=h(e),n=x().kind===`Identifier`,r=S(`|->`,1)&&(n||de(x()));if(r||n&&S(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o.index,n=h(x()),i=e();return n.range=y(t),T(r?`|->`:`:`),{name:i,value:O(),location:n}},a=[i(()=>n?fe():C().text),...w(`,`)?E(()=>i(fe)):[]];return T(`]`),{kind:e,fields:a,location:t}}if(xe()){let e=D();T(`|->`);let n=O();return T(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=O();if(w(`->`)){let e=O();return T(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(w(`EXCEPT`)){let e=E(()=>{T(`!`);let e=[];for(;S(`.`)||S(`[`);)if(w(`.`)){if(!de(x()))throw ue(`Expected a field name but found ${te(x())}`);e.push({kind:`Field`,name:C().text})}else T(`[`),e.push({kind:`Index`,args:E(()=>O())}),T(`]`);return T(`=`),{path:e,value:O()}});return T(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!S(`]_`)){let e=[a];for(;w(`,`);)e.push(O());return T(`]`),{kind:`Bracket`,args:e,location:t}}return T(`]_`),{kind:`BoxAction`,action:a,subscript:we(),location:t}}),Me=()=>{let e=o.index,t=b(Ve(),e),n=h(C());return b({kind:`Apply`,operator:`\\in`,args:[t,O()],location:n},e)},Ne=e=>ye(()=>{let t=h(e);if(w(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(xe()&&(x(1).text===`\\in`||S(`<<`))){let e=o.index,n=Ce();T(`\\in`);let r=O();if(w(`:`)){let e=O();return T(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=x().kind===`Identifier`&&S(`\\in`,1)?Me():O();if(w(`:`)){let e=D();return T(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;w(`,`);)r.push(O());return T(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Pe=e=>{let t=h(e),n=ye(()=>S(`>>`)||S(`>>_`)?[]:E(()=>O()));if(w(`>>_`)){if(n.length!==1)throw ce(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:we(),location:t}}return T(`>>`),{kind:`Tuple`,elements:n,location:t}},Fe=e=>{let t=h(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&xe()){let e=D();return T(`:`),{kind:n,bounds:e,body:O(),location:t}}let i=me(E(pe));return T(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:O(),isTemporal:r,location:t}},Ie=e=>{let t=[];do{if(w(`OTHER`))return T(`->`),{kind:`Case`,arms:t,other:O(),location:h(e)};let n=O();T(`->`),t.push({condition:n,body:O()})}while(w(`[]`));return{kind:`Case`,arms:t,other:void 0,location:h(e)}},Le=()=>{let e=x(1);return S(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||om.has(e.text)||e.kind===`Operator`&&($p.has(e.text)||em.has(e.text)||tm.has(e.text)))},Re=()=>{let e=C();if(e.kind===`Number`)return{kind:`Operand`,operand:se(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:S(`(`)?ke():[]}},ze=e=>{let t=o.index,n=C(),r=h(n);if(i&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=E(fe);return T(`:`),{kind:`Lambda`,params:e,body:O(),location:r}}if(n.kind===`Number`){if(i&&/^\\[BOH]/.test(n.text))throw ce(`incomplete expression`,n);return{kind:`Number`,value:se(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`&&rt(n);if(a&&et()<0&&$e.length<=1)throw ce(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw ce(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let c=a?it(n)??n.text:n.text;if(Se()){let t=me(w(`(`)?E(pe):[]);t.names.length>0&&T(`)`),T(`::`);let a=O();if(!i&&e!==void 0&&s.last!==void 0&&ym(a)&&e.high>=s.last.low)throw ce(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:c,params:t.names,paramRanges:t.ranges,body:a,location:r}}let l=S(`(`);if(c===`@`&&!l&&!Le())return{kind:`ExceptAt`,location:r};let u=l?ke():[],d=[l?Oe.range:void 0];if(!Le())return l?{kind:`Apply`,operator:c,args:u,argumentsRange:Oe.range,location:r}:{kind:`Identifier`,name:c,location:r};let f=[{kind:`Name`,name:c,args:u}],p=[y(t,t)];for(;Le();)C(),p.push(y(o.index,o.index)),Oe.range=void 0,f.push(Re()),d.push(Oe.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),v=d.at(-1)??y(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:r}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:r}:{kind:`Apply`,operator:h,args:g,..._.slice(0,-1).some(e=>e>0)&&{argumentCounts:_},argumentsRange:v,selectorRanges:p,argumentRanges:d,location:r}}if(n.kind===`Operator`&&bm(n.text)&&S(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:ke(),location:r};if(n.kind===`Operator`&&bm(n.text)&&!i)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:r};switch(n.text){case`(`:{let e=ye(()=>O());return T(`)`),e}case`[`:return je(n);case`{`:return Ne(n);case`<<`:return Pe(n);case`@`:return{kind:`ExceptAt`,location:r};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Fe(n);case`IF`:{let e=O();T(`THEN`);let t=O();return T(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:O(),location:r}}case`CASE`:return Ie(n);case`LET`:{let e=[],t=[];for(u.push(/* @__PURE__ */ new Set);!w(`IN`);){if(i&&S(`RECURSIVE`))throw ce(`Unexpected keyword RECURSIVE`,re(ee()));if(w(`RECURSIVE`)){Xe();continue}let n=We(!1);n.kind===`Instance`?t.push(n):e.push(n)}u.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=Ce(),t=w(`\\in`)?O():void 0;return T(`:`),{kind:`Choose`,pattern:e,set:t,body:O(),location:r}}case`WF_`:case`SF_`:{let e=we(),t=ye(()=>{T(`(`);let e=O();return T(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:r}}}throw ue(`Unexpected ${te(n)}`,n)},Be=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let r=O(n+1),a=x(),o=a.text===`'`||em.has(a.text)?Zp.high:$p.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw ce(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},Ve=()=>{let e=s.preceding;s.preceding=void 0;let t=x(),n=h(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ae();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return C(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:return C(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:return C(),{kind:`Always`,expression:Be(t,4,15),location:n};case`<>`:return C(),{kind:`Eventually`,expression:Be(t,4,15),location:n};case`ENABLED`:return C(),{kind:`Enabled`,expression:Be(t,4,15),location:n};case`UNCHANGED`:return C(),{kind:`Unchanged`,expression:Be(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return C(),{kind:`Apply`,operator:t.text,args:[i?O(9):Be(t,10,13)],location:n}}return ze(e)},O=(e=0)=>{let t=o.index,n=Ve(),r={left:n.location.range?n:b(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=h(n);if(n.text===`'`&&e<=15){C(),s.last=Zp,r.left=b({kind:`Prime`,expression:r.left,location:i},t);continue}if(em.has(n.text)&&e<=15){C(),s.last=Zp,r.left=b({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){C();let e=ye(()=>E(()=>O()));ye(()=>T(`]`)),s.last=Qp,r.left=b({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&de(x(1))){C();let e=C().text;r.left=b({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=$p.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 ce(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(C(),a.low>12&&S(`-`))throw ce(`Precedence conflict between ${n.text} and -`,x());s.last=s.preceding=a;let c=O(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[y(t).end];r.left=l.kind===e&&o?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&o?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=b(r.left,t),r.previous={...a,text:n.text}}return r.left},He=()=>{if(!w(`(`))return[];let e=Ye();return T(`)`),e},Ue=()=>{let e=h(x()),t=O(),n=a[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:p[0].name,start:e,end:r}}},We=e=>{let t=o.index;return b(Ke(e),t)},Ge=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),Ke=e=>{let t=x(),n=h(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...Ue(),isLocal:e,isRecursive:m(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&$p.has(x(1).text)&&x(2).kind===`Identifier`&&S(`==`,3)){let e=pe(),t=C().text,n=pe();return T(`==`),r(t,[Ge(e),Ge(n)])}let i=t.kind!==`String`&&nm.has(t.text),a=t.kind===`Identifier`&&em.has(x(1).text)&&S(`==`,2);if(i||a){let e=i?t.text:x(1).text;i&&C();let n=pe();return a&&C(),T(`==`),r(e,[Ge(n)])}let s=fe();if(w(`[`)){let t=ye(()=>D());return T(`]`),T(`==`),{kind:`Function`,name:s,bounds:t,body:O(),isLocal:e,isRecursive:m(s),location:n}}let c=o.index,l=He();return T(`==`),S(`INSTANCE`)?{...qe(s,l,e,n),definitionRange:y(c)}:r(s,l)},qe=(e,t,n,r)=>{let i=o.index;return T(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ve(),substitutions:w(`WITH`)?E(()=>{let e=o.index,t=he(),n=y(e);return T(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:y(i)}},Je=()=>{let e=o.index;return b(k(),e)},k=()=>{let e=h(x());if(S(`_`)&&x(1).kind===`Operator`)return C(),{name:C().text,arity:w(`_`)?2:1,location:e};if(x().kind===`Operator`&&S(`_`,1)){let t=C().text;return C(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=fe();if(!w(`(`))return{name:t,arity:0,location:e};let n=E(()=>T(`_`));return T(`)`),{name:t,arity:n.length,location:e}},Ye=()=>E(Je),Xe=()=>{let e=Ye();return e.forEach(e=>u[u.length-1].add(e.name)),e},Ze=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&gm.has(e.text)&&t.value++,e.kind===`Operator`&&_m.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Qe=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?S(`(`,1)||S(`[`,1)?S(`==`,Ze(1)):t.kind===`Operator`&&em.has(t.text)?S(`==`,2):t.kind===`Operator`&&$p.has(t.text)?x(2).kind===`Identifier`&&S(`==`,3):S(`==`,1):e.kind!==`String`&&nm.has(e.text)&&t.kind===`Identifier`&&S(`==`,2)},$e=[],et=()=>$e[$e.length-1]??-1,tt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),nt=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)},rt=e=>!e.text.endsWith(`.`)&&!fm.has(nt(e)),it=e=>{let t=nt(e);if(fm.has(t))return;let n=tt(e);if(n>=0)return`<${n}>${t}`;let r=et(),i=$e[$e.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},at=e=>{if(e.kind===`Keyword`)return lm.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return $e.length===0;if(e.text[1]===`+`||$e.length===0)return!0;let t=et();return t>=0&&tt(e)>t},A=e=>{let t=tt(e),n=$e.length-1,r=$e[n-1]??-1,i=$e[n]<0;return i&&($e[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:$e[n]===t},ot=e=>!d.has(e)&&p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),j=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!vm.has(e.name)&&!ot(e.name):!1,M=()=>{let e=x();return e.kind===`Step`?rt(e):e.kind===`Keyword`?pm.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Qe()},st=()=>{let e=o.index,t=x();return t.kind===`Operator`&&!rm.has(t.text)&&bm(t.text)?(o.index++,b({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:h(t)},e)):w(`MODULE`)?b({kind:`ModuleFact`,name:fe(),location:h(t)},e):O()},ct=e=>f[f.length-1]?.add(e),lt=e=>{f.push(/* @__PURE__ */ new Set);let t=e();return f.pop(),t},ut=e=>f.some(t=>t.has(e))||p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),dt=()=>{let e=o.index,t=x(),n=E(()=>{let e=x();if((e.kind!==`Identifier`||ie(e))&&e.kind!==`Operator`)throw ue(`Expected a definition name but found ${te(e)}`,e);return o.index++,e.text},`!`),r=h(t);return b(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 E(dt);let e=E(st),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&ut(e.name)):void 0;if(t)throw ce(`DEF clause entry should describe a defined operator`,t.location);return e},pt=()=>({facts:M()?E(st):[],defs:w(`DEF`)||w(`DEFS`)?ft():[]}),mt=()=>{let e=o.index,r=C(),i=r.text===`USE`&&w(`ONLY`),a=y(e),s={kind:r.text===`USE`?`Use`:`Hide`,isOnly:i,...pt(),keyword:a,location:h(r)},l=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!j(e)):[];if(l.length>0)throw c(l.map(n=>({location:t(n.location.range??y(e)),message:`The only expression allowed as a fact in a HIDE is
457
- the name of a theorem, assumption, or step.`})));return b(s,e)},ht=()=>{let e=o.index,t=h(x()),n=w(`NEW`),r=x().kind===`Keyword`?mm.get(x().text):void 0;if(!n&&r===void 0)throw ue(`Expected a declaration but found ${te(x())}`);if(r!==void 0&&C(),r===`Variable`){let n=pe();return ct(n.name),b({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=Je();ct(i.name);let a=(r??`Constant`)===`Constant`&&S(`\\in`);if(a&&i.arity>0)throw ce(`declared symbol with arguments before \\in`);return a&&C(),b({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=h(T(`ASSUME`)),n=E(()=>S(`ASSUME`)?lt(gt):x().kind===`Keyword`&&hm.has(x().text)?ht():O());return T(`PROVE`),b({kind:`AssumeProve`,assumptions:n,conclusion:O(),location:t},e)},_t=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&S(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&S(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=x();if(S(`USE`)||S(`HIDE`))return mt();if(S(`INSTANCE`)){let t=o.index;return b(qe(void 0,[],!1,h(e)),t)}if(S(`DEFINE`)||Qe()){let t=o.index;w(`DEFINE`);let n=[We(!1)];for(;Qe();)n.push(We(!1));let r={kind:`Define`,definitions:n,location:h(e)};return b(r,t)}if(w(`HAVE`))return{kind:`Have`,expression:O()};if(w(`TAKE`)){let e=xe(),t=me(e?[]:E(pe)),n=e?D():[];return vt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(w(`WITNESS`))return{kind:`Witness`,expressions:E(()=>O())};if(w(`PICK`)){let e=_t(`:`),t=me(e?E(pe):[]),n=e?[]:D();return vt(t.names,n),T(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:O()}}return w(`CASE`)?{kind:`Case`,expression:O()}:{kind:`Assert`,isSuffices:w(`SUFFICES`),statement:S(`ASSUME`)?gt():O()}},bt=e=>{let t=x();if(t.kind!==`Step`)throw ue(`Expected a step number but found ${te(t)}`,t);if(!A(t))throw ce(`${e?`QED step`:`step`}'s number has bad level`,t);if(tt(t)<0&&it(t)!==void 0)throw ce(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:it(t),token:t.text,location:h(t)}},xt=()=>{let e=o.index,t=bt(S(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;f.push(r);let i=w(`QED`)?{kind:`Qed`}:yt(),a=y(e),s=y(n),c=at(x());if(c&&!um.has(i.kind))throw ce(`Proof of a step that does not take a proof`);let l=c?Ct():void 0;return f.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(ct),b({...t,body:i,head:a,statement:s,proof:l},e)},St=()=>{let e=h(x());if(S(`BY`)||S(`PROOF`)&&S(`BY`,1)){w(`PROOF`),C();let t=y(o.index-1);return{kind:`By`,isOnly:w(`ONLY`),...pt(),keyword:t,location:e}}let t=x(+!!S(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){w(`PROOF`),C();let n=y(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}w(`PROOF`);let n=[xt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(xt());return{kind:`Steps`,level:et(),steps:n,location:e}},Ct=()=>{let e=o.index;$e.push(-1);let t=lt(St);return $e.pop(),b(t,e)},wt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Tt=e=>{let t=o.index,n=C(),r=x().kind===`Identifier`&&S(`==`,1)?fe():void 0;r!==void 0&&(d.add(r),C());let i=lt(()=>({statement:S(`ASSUME`)?gt():O(),proof:at(x())?Ct():void 0})),a=i.statement,s=b({name:r,statement:a,proof:i.proof,location:h(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&wt(e,b({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:h(n)},t))},Et=()=>{let e=o.index,t=C(),n=x().kind===`Identifier`&&S(`==`,1)?fe():void 0;return n!==void 0&&(d.add(n),C()),b({name:n,expression:O(),isAxiom:t.text===`AXIOM`,location:h(t)},e)},Dt=()=>{let e=h(T(`----`));T(`MODULE`);let t=ve();T(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(p.push(n),u.push(/* @__PURE__ */ new Set),w(`EXTENDS`)&&E(()=>{let e=o.index;n.extends.push(ve()),n.extendsRanges.push(y(e))});;){let t=o.index;ne.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:p[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},p.pop(),u.pop(),n;if(r.kind===`Separator`){if(S(`MODULE`,1)){let e=Dt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),T(`====`);continue}C()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=h(C()),r=Ye();n.constants.push(...r),e.range=y(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=h(C()),r=E(()=>{let e=o.index,t=h(x());return b({name:fe(),arity:0,location:t},e)});n.variables.push(...r),e.range=y(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(S(`USE`)&&S(`ONLY`,1))throw ue(`Expected a module unit but found ${te(r)}`);let e=mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:C(),n.units.push({kind:`Recursive`,declarations:Xe()});continue;case`INSTANCE`:Ot(n,b(qe(void 0,[],!1,h(r)),t));continue;case`LOCAL`:if(C(),S(`INSTANCE`)){Ot(n,b(qe(void 0,[],!0,h(r)),t));continue}Ot(n,b(Ke(!0),t));continue}r.kind===`Keyword`&&cm.has(r.text)?Tt(n):Ot(n,We(!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=_e.isUsed?Xp(e):void 0;if(At!==void 0)throw new l(At);return kt},wm=e=>Cm(e,`tlc`),Tm=(e,t)=>Cm(e,`tlc`,t),Em=e=>Cm(e,`tlapm`),Dm=e=>Cm(e,`sany`),Om=10454148508367108822n,km=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:Om);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),Am=Int32Array.from(km,e=>Number(BigInt.asIntN(32,e>>32n))),jm=Int32Array.from(km,e=>Number(BigInt.asIntN(32,e))),Mm=Number(BigInt.asIntN(32,Om>>32n)),Nm=Number(BigInt.asIntN(32,Om));let Pm=Mm,Fm=Nm;const Im=e=>{let t=(e^Fm)&255;Fm=(Fm>>>8|Pm<<24)^jm[t],Pm=Pm>>>8^Am[t]},Lm=(()=>{let e=[Am],t=[jm];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)^jm[t],a[e]=r[e]>>>8^Am[t]}e.push(a),t.push(o)}return{highs:e,lows:t}})(),Rm=Lm.highs[0],zm=Lm.highs[1],Bm=Lm.highs[2],Vm=Lm.highs[3],Hm=Lm.lows[0],Um=Lm.lows[1],Wm=Lm.lows[2],Gm=Lm.lows[3],Km=e=>{let t=Fm^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Fm=Pm^Gm[n]^Wm[r]^Um[i]^Hm[a],Pm=Vm[n]^Bm[r]^zm[i]^Rm[a]},qm=e=>{if(typeof e==`boolean`)return Im(0),Im(e?116:102),2;if(typeof e==`number`)return Im(1),Km(e),5;if(typeof e==`string`){Im(3),Km(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Km(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++)Im(e.charCodeAt(n));return 5+e.length}return Im(21),Km(Ot(e.name)+1),5},Jm=e=>{if(typeof e!=`object`||M(e))qm(e);else if(j(e)){let t=I(e);Im(9),Km(t.domain.length);for(let e=0;e<t.domain.length;e++)Jm(t.domain[e]),Jm(t.range[e])}else{let t=P(e).elements;Im(5),Km(t.length);for(let e of t)Jm(e)}},Ym=e=>{let t={high:Pm,low:Fm};Pm=Mm,Fm=Nm;for(let t of e)Jm(t);let n=BigInt(Pm>>>0)<<32n|BigInt(Fm>>>0);return Pm=t.high,Fm=t.low,n},Xm=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=Pm,a=Fm;return e.forEach((e,n)=>{Pm=Mm,Fm=Nm;for(let n of t)Jm(e[n]);r[2*n]=Fm,r[2*n+1]=Pm}),Pm=i,Fm=a,n},Zm=25214903917n,Qm=(1n<<48n)-1n,$m=2147483647,eh=e=>{let t={value:(BigInt.asUintN(64,e)^Zm)&Qm},n=e=>(t.value=t.value*Zm+11n&Qm,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^Zm)&Qm},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<=$m)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},th=[],nh=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},rh=()=>{for(let e=1277011;th.length<1341;e++)nh(e)&&th.push(e);return th},ih=e=>{let t=rh(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},ah=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},oh=e=>{for(let t=Math.max(e,9);;t++){let e=ah(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)}}},sh=(e,t,n)=>{if(t<=0)return[];let r=oh(t),i={index:BigInt(n.nextInt(t))},a=BigInt(ih(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},ch=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:$m),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},lh=(1n<<63n)-1n-24n,uh=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(lh*BigInt(n)+i)%t;return r<0n?r+t:r})},dh=(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,fh=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=qn(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>zt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>Xn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:Yn}}},ph=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,mh=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?ch:sh;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=ph(t,r)?void 0:fh(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt($m)?uh(e,t,n):i(e,Number(t),n)).map(e=>a.create(dh(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},hh=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new m(`RandomElement of the empty set`);return n},gh=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...qn(e.domain)];return zt(n,n.map(()=>gh(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Xn(e.names.map((n,r)=>[n,gh(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Yn(e.factors.map(e=>gh(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new m(`RandomElement of the empty set`);return e.low+r}return hh(P(e).elements,t)},_h=(e,t=0n)=>{let n=eh(t),r={random:eh(t),seededState:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Xn([]),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},vh=e=>Rn([...e.possibleCounts].map(([e,t])=>[e,t])),yh=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,vh(e)]]),bh=`----------------------------- MODULE Bags --------------------------------
392
+ `]]),ic=/* @__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)`]])]]),ac=j(`EOF`),oc=j(`IDENTIFIER`),sc=j(`DEFBREAK`),cc=(e,t)=>Array.from({length:j(t)-j(e)+1},(t,n)=>j(e)+n),lc=new Set(cc(`op_57`,`op_119`)),uc=new Set(cc(`op_1`,`op_119`)),dc=new Set(cc(`op_57`,`op_70`)),fc=/* @__PURE__ */ new Set([...cc(`ACTION`,`EXCEPT`),j(`EXTENDS`),...cc(`IF`,`SF`),j(`STATE`),...cc(`THEN`,`WITH`),j(`US`),...cc(`op_112`,`op_116`)]),pc=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),mc=new Map([...pc(`postfix`,160,160,!0,`[`),...pc(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...pc(`prefix`,120,120,!1,`-.`),...pc(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...pc(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...pc(`prefix`,40,40,!0,`\\lnot`),...pc(`nfix`,100,130,!0,`\\times`),...pc(`infix`,140,140,!1,`^`,`^^`),...pc(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...pc(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...pc(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...pc(`infix`,100,110,!0,`|`,`||`,`%%`),...pc(`infix`,100,110,!1,`%`),...pc(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...pc(`infix`,90,140,!1,`\\wr`),...pc(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...pc(`infix`,90,130,!1,`!!`),...pc(`infix`,90,90,!1,`...`,`..`),...pc(`infix`,80,80,!0,`\\intersect`,`\\union`),...pc(`infix`,80,80,!1,`\\`),...pc(`infix`,70,70,!1,`<:`,`:>`),...pc(`infix`,60,60,!0,`@@`),...pc(`infix`,50,140,!0,`\\cdot`),...pc(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...pc(`infix`,30,30,!0,`\\land`,`\\lor`),...pc(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...pc(`infix`,10,10,!1,`=>`)]),hc=new Map([...mc,...Zs.flatMap(e=>e.slice(1).map(t=>[t,mc.get(e[0])]))]),gc=hc.get(`[`),_c={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},vc=e=>({type:`tokens`,kinds:new Set(e)}),yc=e=>typeof e==`string`?e.startsWith(`<`)?vc([j(e.slice(1,-1))]):{type:`call`,name:e}:e,B=(...e)=>({type:`sequence`,units:e.map(yc)}),V=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:B(e))}),bc=e=>(...t)=>({type:e,body:B(...t)}),H=bc(`zeroOrMore`),xc=bc(`oneOrMore`),U=bc(`optional`),W=e=>({type:`action`,run:t=>e(t)??void 0}),G=e=>W(t=>{t.expecting=e}),K=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&B(...e.expansion),semantic:e.semantic}),Sc=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Cc=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Sc(e,n);return n},wc=(...e)=>{let t=e.map(j);return e=>t.includes(Cc(e,1).kind)},Tc=(e,t=Cc(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Ec=e=>{let t=Cc(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Dc=e=>wc(`CASESEP`)(e)&&Tc(e),Oc=e=>{let t=Cc(e,1);fc.has(t.kind)&&(t.kind=oc)},kc=(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}`,Ac=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),jc=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Mc=e=>e.operatorStacks[e.operatorStacks.length-1],Nc=(e,t)=>e.low>t.high,Pc=(e,t)=>e.high<t.low,Fc=e=>e.fix===`prefix`?e:hc.get(`${e.name}.`),Ic=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===gc?Ac(`FcnAppl`,[n,...r.node.heirs]):Ac(`PostfixExpr`,[n,r.node]),operator:void 0})},Lc=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Ac(`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:Ac(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Rc=e=>{let t=Mc(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 Ic(t,n),Rc(e);if(i.operator!==void 0){let t=Fc(r.operator);return t!==void 0&&Nc(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${kc(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 ${kc(e,a.node.first,a.node.last)} and expression at location ${kc(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Pc(a.operator,r.operator)?void 0:Nc(a.operator,r.operator)?(Lc(t,a.operator),Rc(e)):`Precedence conflict between ops ${a.operator.name} in block ${kc(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Fc(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Pc(s,r.operator))return;if(!Nc(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${kc(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Lc(t,s),Rc(e);let c=kc(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===_c?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},zc=e=>W(t=>{let n=Mc(t),r=jc(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:Rc(t)}),Bc=zc(()=>!1),Vc=zc(()=>!0),Hc=W(e=>{e.lastOperator=hc.get(e.token.image)}),Uc=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},Wc=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Uc(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Gc=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Tc(e,n.first.beginColumn))return n;let t=Gc(e,n);if(t!==void 0)return t}},Kc=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(j),n=(e,...t)=>t.some(t=>e.kind===j(t)),r=e=>e!==void 0&&lc.has(e.kind),i=e.token,a=Sc(e,i);i.next=void 0;let o=Sc(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===oc&&(e=e.next)}else if(e.kind===oc){let t=e.next;!r(t)||dc.has(t.kind)||uc.has(t.kind)&&t.next?.kind!==oc||(e=t.next?.kind===j(`SUBSTITUTE`)?i:uc.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==sc&&(e.next={kind:sc,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Sc(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},qc=e=>{let t=Cc(e,1);if(t.kind===j(`LAB`)){let n=1;for(;n!==0;)if(t=Sc(e,t),t.kind===j(`LAB`)&&n++,t.kind===j(`RAB`)&&n--,t.kind===ac)return!1;return Sc(e,t).kind===j(`IN`)}if(t.kind!==oc)return!1;for(t=Sc(e,t);t.kind===j(`COMMA`);){if(t=Sc(e,t),t.kind!==oc)return!1;t=Sc(e,t)}return t.kind===j(`IN`)},Jc=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Yc=e=>e.proofLevels.at(-1)??-1,Xc=e=>{let t=Cc(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:wc(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Yc(e)>=0&&Jc(t)>Yc(e):wc(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Zc=(e,t)=>{let n=Jc(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},Qc=e=>W(t=>Zc(t,t.token)?void 0:`${kc(t,t.token)}: ${e}`),$c=vc([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(j)),el=vc([...$c.kinds,j(`op_76`)]),tl=vc(uc),nl=vc(dc),rl=vc([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(j)),il=()=>H(K({expansion:[V($c,`<op_77>`)],semantic:Tc}),V(`PrefixOp`,`InfixOp`),Vc),al=()=>V(B(K({expansion:[`OpenStart`],semantic:Tc}),`OpenExpression`,Bc),B(K({semantic:Tc}),`ExtendableExpr`)),ol=()=>V(B(`<MODULE>`,G(`identifier`),`Identifier`),`Expression`),sl=()=>V(B(K({semantic:e=>wc(`ASSUME`,`BOXASSUME`)(e)||Cc(e,2).kind===j(`COLONCOLON`)&&[j(`ASSUME`),j(`BOXASSUME`)].includes(Cc(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),cl=()=>[`JuncItem`,H(K({semantic:Ec}),`JuncItem`)],ll=e=>W(t=>{t.expecting=e,Oc(t)}),ul=e=>W(t=>{t.isTerminalProof=e}),dl=(e,...t)=>B(...t.slice(0,-1),G(`==`),`<DEF>`,W(t=>{Kc(t),t.expecting=e}),t[t.length-1]),q=(e,t,n)=>({message:e,body:B(...t),exit:n}),fl={CompilationUnit:q(void 0,[W(Kc),U(`Prelude`),`Module`]),Prelude:q(void 0,[`<BEGIN_PRAGMA>`,H(V(`<NUMBER>`,`<IDENTIFIER>`))]),Module:q(`Module definition`,[G(`---- MODULE`),`BeginModule`,G(`EXTENDS clause or module body`),`Extends`,G(`Module body`),`Body`,G(`==== or more Module body`),`EndModule`]),BeginModule:q(`Begin module`,[G(`---- MODULE (beginning of module)`),V(`<_BM0>`,`<_BM1>`,`<_BM2>`),ll(`Identifier`),`Identifier`,W(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:q(void 0,[`<END_MODULE>`]),Extends:q(`Extends`,[U(`<EXTENDS>`,ll(`Identifier`),`Identifier`,G(`comma or module body`),H(`<COMMA>`,ll(`Identifier`),`Identifier`))]),Body:q(`Module body`,[G(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),H(V(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,B(K({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,B(K({amount:2}),`Instance`),B(K({amount:2}),`Assumption`),B(K({amount:2}),`Theorem`),B(K({amount:1}),`Module`,W(Kc)),B(K({semantic:e=>wc(`USE`)(e)&&Cc(e,2).kind!==j(`ONLY`)||wc(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:q(`variable declaration`,[`<VARIABLE>`,G(`Identifier`),`Identifier`,G(`comma or module body`),H(`<COMMA>`,G(`Identifier`),`Identifier`)]),ParamDeclaration:q(`Parameter declaration`,[G(`CONSTANT`),`ParamSubDecl`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G(`,`),H(`<COMMA>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:q(`Recursive`,[G(`RECURSIVE`),`<RECURSIVE>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G(`,`),H(`<COMMA>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G("`,' or `)'"))]),ConstantDeclarationItems:q(`Constant declaration items`,[G(`Identifier, _ or prefix op`),V(B(`Identifier`,G(`(, comma, or Module Body`),U(K({amount:2}),`<LBR>`,G(`_`),`<US>`,G(`comma or )`),H(`<COMMA>`,G(`_`),`<US>`,G(`comma or )`)),`<RBR>`)),B(`NonExpPrefixOp`,G(`_`),`<US>`),B(`<US>`,G(`prefix or postfix operator`),V(B(`InfixOp`,G(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:q(`Definition`,[G(`LOCAL, Identifier or Operator Symbol`),U(`<LOCAL>`),`<DEFBREAK>`,G(`LOCAL, Identifier or Operator Symbol`),V(dl(`Expression`,K({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,G(`[`),`<LSB>`,G(`Identifier`),`QuantBound`,G(`COMMA or ]`),H(`<COMMA>`,G(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),dl(`Expression`,K({expansion:[`<IDENTIFIER>`,nl]}),`PostfixLHS`,`Expression`),dl(`Expression`,K({expansion:[`<IDENTIFIER>`,tl]}),`InfixLHS`,`Expression`),dl(`Expression or Instance`,K({expansion:[`<IDENTIFIER>`,V(`<LBR>`,`<DEF>`)]}),`IdentLHS`,V(`Expression`,`Instantiation`)),dl(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:q(`Identifier tuple`,[`<LAB>`,G(`Identifier or >>`),U(`Identifier`,G(`COMMA or >>`),H(`<COMMA>`,G(`COMMA or >>`),`Identifier`,G(`COMMA or >>`))),`<RAB>`]),IdentLHS:q(`Identifier LHS`,[`Identifier`,G(`( or ==`),U(`<LBR>`,G(`Identifier Declaration, prefix op, _ or )`),V(`IdentDecl`,`SomeFixDecl`),G(`COMMA or )`),H(`<COMMA>`,G(`Identifier Declaration, prefix op or _`),V(`IdentDecl`,`SomeFixDecl`),G(`COMMA or )`)),`<RBR>`)]),PrefixLHS:q(`Prefix LHS`,[el,G(`Identifier`),`Identifier`]),InfixLHS:q(`Infix LHS`,[`Identifier`,tl,`Identifier`]),PostfixLHS:q(`Postfix LHS`,[`Identifier`,nl]),IdentDecl:q(`Identifier Declation`,[`Identifier`,G(`( or ...`),U(`<LBR>`,G(`_`),`<US>`,G(`COMMA or )`),H(`<COMMA>`,G(`_`),`<US>`,G(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:q(`Op. Symbol Declaration`,[V(B(`NonExpPrefixOp`,G(`_`),`<US>`),B(`<US>`,G(`infix or postfix operator`),V(B(`InfixOp`,G(`_`),`<US>`),`PostfixOp`)))]),Instance:q(`Instance`,[G(`LOCAL or instance`),U(`<LOCAL>`),`Instantiation`,G(`COMMA or Module Body`)]),Instantiation:q(`NonLocalInstance`,[`<INSTANCE>`,ll(`Module identifier`),`Identifier`,G(`WITH or another definition.`),U(`<WITH>`,G(``),`Substitution`,G(``),H(K({amount:3}),`<COMMA>`,G(``),`Substitution`,G(``)))]),Substitution:q(`Substitution`,[V(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),G(`<-`),`<SUBSTITUTE>`,G(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:q(void 0,[$c,Hc]),NonExpPrefixOp:q(void 0,[el,Hc]),InfixOp:q(`Infix Op`,[tl,Hc]),PostfixOp:q(void 0,[nl,Hc]),Identifier:q(void 0,[`<IDENTIFIER>`]),Assumption:q(`Assumption`,[G(`ASSUM...`),V(`<ASSUMPTION>`,`<ASSUME>`),U(K({amount:2}),U(`<DEFBREAK>`),`Identifier`,G(`==`),`<DEF>`),W(e=>{Kc(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:q(`Assume-Prove`,[V(B(`Identifier`,`<COLONCOLON>`,`AssumeProve`),B(V(`<ASSUME>`,`<BOXASSUME>`),G(`Expression, Declaration, or AssumeProve`),sl(),G("PROVE or `,'"),H(`<COMMA>`,G(`Expression, Declaration, or AssumeProve`),sl(),G("PROVE or `,'")),V(`<PROVE>`,`<BOXPROVE>`),G(`Expression`),`Expression`))]),NewSymb:q(`NEW symbol declaration`,[G(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),V(B(K({amount:2}),V(B(K({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),G(`Constant declaration`),V(B(K({amount:2}),`IdentDecl`,U(`<IN>`,W(e=>{let t=jc(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${kc(e,t.first,t.last)}`:void 0}),G(`Expression`),`Expression`)),`SomeFixDecl`)),B(K({amount:2}),U(`<NEW>`),`<VARIABLE>`,G(`Identifier`),`Identifier`),B(K({amount:2}),U(`<NEW>`),V(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),G(`Declaration`),V(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:q(`Domain binding`,[U(`<IN>`,G(`Expression`),`Expression`)]),Theorem:q(`Theorem`,[G(`THEOREM, PROPOSITION`),V(`<THEOREM>`,`<PROPOSITION>`),G(`Identifier, Assume-Prove or Expression`),U(K({amount:2}),`Identifier`,G(`==`),`<DEF>`),W(Kc),V(B(K({amount:3}),K({semantic:wc(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),U(K({semantic:Xc}),`Proof`)]),Proof:q(`Proof`,[W(e=>{e.proofLevels.push(-1)}),V(B(K({semantic:e=>wc(`BY`)(e)||Cc(e,2).kind===j(`BY`)}),`UseOrHideOrBy`),B(K({amount:2}),U(`<PROOF>`),V(`<OBVIOUS>`,`<OMITTED>`)),B(U(K({amount:2}),`<PROOF>`),H(K({semantic:e=>Cc(e,2).kind!==j(`QED`)}),`Step`,G(`a proof step`)),`QEDStep`)),W(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:q(`UseOrHideOrBy`,[V(B(U(`<PROOF>`),`<BY>`,ul(!0),U(`<ONLY>`)),B(`<USE>`,ul(!1),U(`<ONLY>`)),B(`<HIDE>`,ul(!1))),G("an expression, `MODULE' or `DEF'"),U(ol(),H(`<COMMA>`,G(`MODULE or expression`),ol(),W(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),U(`<DF>`,G(`MODULE or expression`),ol(),H(`<COMMA>`,G(`MODULE or expression`),ol(),W(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),W(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:q(`QED step`,[G(`Step number`),rl,Qc(`QED step's number has bad level.`),G(`QED`),`<QED>`,U(K({semantic:Xc}),`Proof`)]),Step:q(`Step`,[G(`Step number`),rl,Qc(`step's number has bad level.`),G(`proof step`),V(B(K({semantic:wc(`USE`,`HIDE`)}),`UseOrHideOrBy`),B(K({semantic:wc(`INSTANCE`)}),`Instantiation`),B(K({semantic:wc(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),U(K({semantic:Xc}),W(e=>{let t=jc(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${kc(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:q(`DefStep`,[U(`<DEFINE>`),xc(K({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:q(`HaveStep`,[`<HAVE>`,G(`expression`),`Expression`]),TakeStep:q(`TakeStep`,[`<TAKE>`,G(`identifier`),V(B(K({expansion:[V(B(`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,G(`comma or step`),H(`<COMMA>`,G(`identifier or tuple of identifiers`),`QuantBound`,G(`comma or proof step`))),B(`Identifier`,G(`comma or proof step`),H(`<COMMA>`,G(`identifier`),`Identifier`,G(`comma or proof step`))))]),WitnessStep:q(`WitnessStep`,[`<WITNESS>`,G(`expression`),`Expression`,H(`<COMMA>`,G(`expression`),`Expression`,G(`comma or colon`))]),PickStep:q(`PickStep`,[`<PICK>`,G(`identifier`),V(B(K({expansion:[`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,G(`comma, or colon`),H(`<COMMA>`,G(`identifier`),`Identifier`,G(`comma or colon`))),B(`QuantBound`,G(`comma or colon`),H(`<COMMA>`,G(`identifier or tuple of identifiers`),`QuantBound`,G(`comma or colon`)))),`<COLON>`,G(`expression`),`Expression`]),CaseStep:q(`CaseStep`,[`<CASE>`,G(`expression`),`Expression`]),AssertStep:q(`AssertStep`,[U(`<SUFFICES>`,G(`expression or ASSUME/PROVE`)),V(`Expression`,B(K({semantic:wc(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:q(void 0,[V(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:q(void 0,[V(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:q(`String`,[`<STRING_LITERAL>`]),Number:q(void 0,[`<NUMBER_LITERAL>`,U(K({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,H(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:q(void 0,[V(B(K({amount:2,expansion:[V(el,tl,nl),vc([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(j))],semantic:Tc}),V(`NonExpPrefixOp`,B(`InfixOp`,W(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${kc(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),B(K({expansion:[`<LAMBDA>`],semantic:Tc}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:q(`Quantified form`,[V(`<EXISTS>`,`<FORALL>`),V(B(K({expansion:[`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,H(`<COMMA>`,`Identifier`)),B(`QuantBound`,H(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:q(`Bound Quantified Expression`,[V(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,H(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:q(`Quant Bound`,[V(`IdentifierTuple`,B(`Identifier`,H(`<COMMA>`,`Identifier`,G(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:q(`Some { } form`,[`<LBC>`,U(V(B(K({semantic:qc}),V(`IdentifierTuple`,`Identifier`),G(`\\in`),`<IN>`,`Expression`,G(`':', ',' or '}'`),U(V(B(`<COLON>`,`Expression`),xc(`<COMMA>`,`Expression`)))),B(K({expansion:[V(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,H(`<COMMA>`,`Expression`)),B(K({expansion:[V(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,H(`<COMMA>`,`QuantBound`)),B(`Expression`,U(V(B(`<COLON>`,W(e=>{let t=jc(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`,H(`<COMMA>`,`QuantBound`)),xc(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:q(`Some [] Form`,[`<LSB>`,V(B(K({semantic:qc}),`QuantBound`,H(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),B(K({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,H(`<COMMA>`,`FieldVal`),`<RSB>`),B(K({semantic:e=>Cc(e,2).kind===j(`MAPTO`)&&fc.has(Cc(e,1).kind)}),W(e=>{Cc(e,1).kind=oc}),`FieldVal`,H(`<COMMA>`,`FieldVal`),`<RSB>`),B(K({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,H(`<COMMA>`,`FieldSet`),`<RSB>`),B(`Expression`,V(B(H(`<COMMA>`,`Expression`),`<RSB>`,W(e=>{let t=e.frames[e.frames.length-1];t.node=Ac(`FcnAppl`,t.heirs),e.lastOperator=gc})),B(`<ARROW>`,`Expression`,`<RSB>`),B(`<EXCEPT>`,`ExceptSpec`,H(`<COMMA>`,`ExceptSpec`),`<RSB>`),B(`<ARSB>`,`ReducedExpression`))))]),FieldVal:q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:q(`Except Spec`,[`<BANG>`,xc(`ExceptComponent`,G(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:q(`Except Component`,[V(B(`<DOT>`,W(Oc),`Identifier`,W(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),B(`<LSB>`,`Expression`,H(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:q(`Some << -- >> or >>_ Form`,[`<LAB>`,U(`Expression`,H(`<COMMA>`,`Expression`)),V(`<RAB>`,B(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:q(void 0,[`Identifier`,U(K({amount:2}),`OpArgs`),V(B(`<BANG>`,`NoOpExtension`),W(e=>{e.isFairnessHooked=e.token.kind===j(`RBR`)}))]),ReducedExpression:q(`restricted form of expression`,[V(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:q(`Fairness Expression`,[W(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),V(`<WF>`,`<SF>`),`ReducedExpression`,U(K({amount:2}),`<LBR>`,`Expression`,`<RBR>`,W(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`,H(K({semantic:e=>Dc(e)&&Cc(e,2).kind!==j(`OTHER`)}),`<CASESEP>`,`CaseArm`),U(K({semantic:Dc}),`<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`,[xc(V(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:q(`AND-OR Junction`,[W(e=>{let t=Cc(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),V(B(K({expansion:[`<OR>`]}),...cl()),B(K({expansion:[`<AND>`]}),...cl())),W(e=>{e.junctions.pop()})]),JuncItem:q(`Junction Item`,[V(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Gc(t,e.heirs[1]);return n&&`Item at ${kc(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${kc(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:q(`(Un)Bounded Choose`,[`<CHOOSE>`,V(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:q(`Lambda`,[`<LAMBDA>`,G(`Identifier`),`Identifier`,G("`,' or `:'"),H(`<COMMA>`,G(`Identifier`),`Identifier`,G("`,' or `:'")),`<COLON>`,G(`Expression`),`Expression`]),Expression:q(`Expression`,[W(e=>{e.operatorStacks.push([])}),il(),al()],(e,t)=>{let n=Mc(t);n.push({node:e.heirs[0],operator:_c});let r=Rc(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:q(`ExtendableExpr`,[V(B(K({expansion:[V(`<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`),Bc,H(V(B(K({expansion:[`PostfixOp`],semantic:Tc}),`PostfixOp`,Vc),B(K({expansion:[`<DOT>`],semantic:Tc}),`<DOT>`,W(Oc),K({semantic:Tc}),`Identifier`,W(e=>{let t=Mc(e);t[t.length-1].operator!==void 0&&Ic(t,t.length),t[t.length-1]={node:Ac(`RecordComponent`,[t[t.length-1].node,jc(e,2),jc(e,1)]),operator:void 0}})),B(K({expansion:[`<LSB>`],semantic:Tc}),G(`function argument`),`SBracketCases`,zc(e=>e.kind===`FcnAppl`)))),U(V(B(K({expansion:[`InfixOp`],semantic:Tc}),`InfixOp`,Vc,il(),al()),B(K({expansion:[`<COLONCOLON>`],semantic:Tc}),`<COLONCOLON>`,W(e=>{let t=Mc(e);if(!Wc(t[t.length-1].node))return`\`::' at ${kc(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,W(e=>{let t=Mc(e),n=jc(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Pc(r,e.lastOperator)){let t=jc(e,3);return`Removing label at ${kc(e,t.first,t.last)} would change expression parsing.`}t.push({node:Ac(`Label`,[jc(e,3),jc(e,2),n]),operator:void 0})}))))]),PrimitiveExp:q(`Primitive expression`,[V(B(K({expansion:[`String`],semantic:Tc}),`String`),B(K({expansion:[`<NUMBER_LITERAL>`],semantic:Tc}),`Number`),B(V(`Identifier`,B(V(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),W(e=>Yc(e)<0&&e.proofLevels.length<=1?`${kc(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${kc(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,B(K({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),U(K({amount:2}),`OpArgs`),H(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Uc(e.heirs)===void 0?e.heirs.length===1?Ac(`GeneralId`,e.heirs):void 0:Ac(`OpApplication`,e.heirs)}),BangExt:q(`Bang Extension`,[`<BANG>`,V(B(V(B(K({expansion:[`Identifier`],semantic:e=>Cc(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),U(K({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:q(`StructOp`,[G("`<<' , `>>' , `:' , `@' , or number"),V(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,B(K({semantic:e=>Cc(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${kc(t,n.first,n.last)}`:void 0}),OpenStart:q(void 0,[V(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},pl=/* @__PURE__ */ new Map,ml=e=>{let t=pl.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=ml(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,ml(fl[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 pl.set(e,n),n},hl=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},gl=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Sc(e,e.scanPosition)),e.scanPosition=Sc(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`},_l=(e,t)=>{if(t.type===`tokens`)return gl(e,t.kinds);if(t.type===`call`)return _l(e,fl[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||hl(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=_l(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||hl(e,t.semantic)?_l(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=_l(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=_l(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},vl=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=_l(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},yl=(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||ml(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!ml(a).hasSemanticStart?ml(a).first.has(Cc(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):vl(e,i,a)&&(o===void 0||o(e))}),bl=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,_l(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Sc(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===ac){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Sc(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Qe(e.token.image)}" `},xl=(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??bl(e)}\n\nResidual stack trace follows:\n${r}`,!1},Sl=(e,t)=>{let n=Sc(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,xl(e))},Cl=(e,t)=>{let n=fl[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Cc(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!wl(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 xl(e,i);let a=r.node??(r.heirs.length===0?void 0:Ac(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},wl=(e,t)=>{if(t.type===`tokens`)return Sl(e,t.kinds);if(t.type===`call`)return Cl(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||xl(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||xl(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||wl(e,t));if(t.type===`choice`){let n=yl(e,t.alternatives);return n===-1?xl(e):wl(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!wl(e,t.body))return!1;if(t.type===`optional`)return yl(e,[t.body])===-1||wl(e,t.body);for(;yl(e,[t.body])===0;)if(!wl(e,t.body))return!1;return!0},Tl=e=>{let t=Xe(e),n={kind:ac,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=wl(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(`
393
+ `)},El={low:15,high:15},Dl={low:16,high:16},J=(e,t,n)=>({low:e,high:t,isAssociative:n}),Ol=new Map([[`=>`,J(1,1,!1)],[`<=>`,J(2,2,!1)],[`~>`,J(2,2,!1)],[`-+->`,J(2,2,!1)],[`/\\`,J(3,3,!0)],[`\\/`,J(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,J(5,5,!1)]),[`\\cdot`,J(5,14,!0)],[`@@`,J(6,6,!0)],[`:>`,J(7,7,!1)],[`<:`,J(7,7,!1)],[`\\cup`,J(8,8,!0)],[`\\cap`,J(8,8,!0)],[`\\`,J(8,8,!1)],[`..`,J(9,9,!1)],[`...`,J(9,9,!1)],[`##`,J(9,13,!0)],[`$`,J(9,13,!0)],[`$$`,J(9,13,!0)],[`??`,J(9,13,!0)],[`!!`,J(9,13,!1)],[`\\sqcap`,J(9,13,!0)],[`\\sqcup`,J(9,13,!0)],[`\\uplus`,J(9,13,!0)],[`\\wr`,J(9,14,!1)],[`+`,J(10,10,!0)],[`++`,J(10,10,!0)],[`(+)`,J(10,10,!0)],[`\\oplus`,J(10,10,!0)],[`%`,J(10,11,!1)],[`%%`,J(10,11,!0)],[`|`,J(10,11,!0)],[`||`,J(10,11,!0)],[`\\X`,J(10,13,!1)],[`-`,J(11,11,!0)],[`--`,J(11,11,!0)],[`(-)`,J(11,11,!0)],[`\\ominus`,J(11,11,!0)],[`*`,J(13,13,!0)],[`**`,J(13,13,!0)],[`/`,J(13,13,!1)],[`//`,J(13,13,!1)],[`\\div`,J(13,13,!1)],[`\\o`,J(13,13,!0)],[`(.)`,J(13,13,!0)],[`\\odot`,J(13,13,!0)],[`(/)`,J(13,13,!1)],[`\\oslash`,J(13,13,!1)],[`(\\X)`,J(13,13,!0)],[`\\otimes`,J(13,13,!0)],[`&`,J(13,13,!0)],[`&&`,J(13,13,!0)],[`\\star`,J(13,13,!0)],[`\\bullet`,J(13,13,!0)],[`\\bigcirc`,J(13,13,!0)],[`^`,J(14,14,!1)],[`^^`,J(14,14,!1)]]),kl=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,Al=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),jl={low:17,high:17},Ml=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),Nl=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),Pl=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Fl=/* @__PURE__ */ new Set([...Pl,`'`]),Il=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Ll=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Rl=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),zl=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Bl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Fl]),Vl=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Hl=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Ul=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Wl=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Gl=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Kl=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),ql=/* @__PURE__ */ new Set([``,`*`,`-`]),Jl={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},Yl=(e,t)=>e.line-t.line||e.column-t.column,Xl=(e,t)=>({start:Yl(e.start,t.start)<=0?e.start:t.start,stop:Yl(e.stop,t.stop)>=0?e.stop:t.stop}),Zl=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),Ql={printed:``,set:``},$l={printed:`
394
+ `,set:``},eu={printed:`
395
+ `,set:`
396
+ `},tu=(e,t,n,r=`Proof.Parser`)=>new s(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:r,printed:`${e}${n.printed}`}}),nu=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),ru=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),iu=/* @__PURE__ */ new Set([`NEW`,...ru.keys()]),au=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),ou=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),su=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),cu=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Ol.has(e.operator):Pl.has(e.operator)),lu=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,uu=e=>Ol.has(e)||Pl.has(e)||e===`-.`,du=(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}}},fu=/* @__PURE__ */ new WeakMap,pu=(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(`
397
+ `)}\n`},mu=(e,t,n=Te(e,t===`tlapm`))=>{let r=t===`tlapm`,i=r?n:n.map(be),a=0,o=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],b=[],x=(e,t=a-1)=>{let n=e===t?b[e]:void 0;if(n)return n;let r=i[t];v[e]??=_(i[e]),y[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:v[e],end:y[t]};return e===t&&(b[e]=o),o},S=(e,t)=>(e.location.range=x(t),e),ee=(e=0)=>i[Math.min(a+e,i.length-1)],C=(e=0)=>{let t=ee(e),n=o[o.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},te=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),w=e=>r&&(e.kind===`Keyword`||su.has(e.text)),ne=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},T=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Kl.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:w(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,E=(e,t=ee(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column,o=new s(`${e} at line ${t.line}, column ${t.column}`,void 0,re(e,t,a,n));return f!==void 0&&h.set(o,f),o},re=(e,t,n,a)=>{if(!r)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=i[m[0]-1],s=a?`Unexpected ${T(a)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=a?ne(a):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ie=(e,t=ee())=>E(e,t,t),ae=e=>{let t={cursor:a,frame:f,restorePoints:m.length,offsideColumns:o.length,recursiveScopes:u.length},n=++p;f=n;try{let n=e();return f=t.frame,n}catch(e){if(!(e instanceof s)||h.get(e)!==n)throw e;a=t.cursor,f=t.frame,m.length=t.restorePoints,o.length=t.offsideColumns,u.length=t.recursiveScopes;return}},oe=e=>{let t=f;f=void 0;let n=e();return f=t,n},se=e=>{m.push(a);let t=e();return m.pop(),t},ce=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!w(e),D=(e,t=0)=>{let n=C(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=C();if(e.kind===`End`)throw ie(`Unexpected end of expression`);return a++,e},k=e=>D(e)?(a++,!0):!1,A=e=>{if(!D(e))throw ie(`Expected ${JSON.stringify(e)} but found ${te(C())}`);return O()},ue=()=>{let e=C();if(e.kind!==`Identifier`)throw ie(`Expected an identifier but found ${te(e)}`);if(w(e))throw ie(`Unexpected keyword ${e.text}`);return a++,e.text},de=()=>{let e=a;return{name:ue(),range:x(e)}},fe=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),pe=()=>{let e=C();return e.kind!==`String`&&(Ll.has(e.text)||Ol.has(e.text)||Fl.has(e.text))?(a++,e.text):ue()},me=!1,he=()=>C().kind===`Identifier`||!ce(C())?ue():(me=!0,O().text),ge=e=>{if(!r)return e();o.push(-1);let t=e();return o.pop(),t},_e=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},ve=(e=0)=>{if(D(`<<`,e)){let t=e+1;for(;C(t).kind===`Identifier`||D(`,`,t);)t++;return D(`>>`,t)&&D(`\\in`,t+1)}let t=e;for(;C(t).kind===`Identifier`;){if(D(`\\in`,t+1))return!0;if(!D(`,`,t+1))return!1;t+=2}return!1},ye=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e=1;for(;C(e).kind===`Identifier`&&D(`,`,e+1);)e+=2;return C(e).kind===`Identifier`&&D(`)`,e+1)&&D(`::`,e+2)},xe=()=>{if(!k(`<<`)){let e=de();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=fe(D(`>>`)?[]:_e(de));return A(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Se=()=>{let e=()=>{let e=_e(xe);A(`\\in`);let t=oe(M);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;D(`,`)&&(!r||ve(1));)O(),t.push(e());return t.flat()},Ce=()=>{let e=C();if(r&&su.has(e.text)){let t=a;O();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:S(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||D(`@`));if(e.kind===`Identifier`){let t=a,n=[],i=[],o=e=>(i.push(x(a,a)),n.push(ue()),e&&D(`(`)?j():[]),s=[o(!r)];for(;D(`!`)&&C(1).kind===`Identifier`;)O(),s.push(o(!0));let c=s.slice(0,-1),l=_(e);l.range={...x(t),end:i[i.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:i,location:l},lastArgs:s[s.length-1]}}if(D(`<<`)||D(`(`)||D(`{`)||D(`[`)||t){let e=a,t=ze();return{subscript:t.location.range?t:S(t,e),lastArgs:[]}}throw ie(`Expected a subscript but found ${te(e)}`)},we=e=>{let t=C(1),n=C(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`&&D(`==`,Fl.has(n.text)?3:4))},Ee=e=>{let t=C(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&Hl.has(t.text)||we(e)},De=()=>{let e=C(),t=e.kind===`Operator`&&(Ol.has(e.text)||Il.has(e.text))&&Ee(e);if(r&&e.kind!==`String`&&(Il.has(e.text)||Bl.has(e.text)&&e.text!==`'`&&!Pl.has(e.text)||zl.has(e.text)&&C(-1).text===`(`&&C(-1).line===e.line&&C(-1).endColumn+1===e.column&&C(1).text===`)`&&C(1).line===e.line&&C(1).column===e.endColumn+1)&&Ee(e))throw E(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw E(`\\X may not be used as an infix operator`,e);if(t)return a++,S({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},a-1);if(e.kind!==`String`&&Bl.has(e.text)&&Ee(e)){a++;let t=_(e);if(Pl.has(e.text))return S({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a-1);let n={kind:`Identifier`,name:`argument`,location:t};return S({kind:`Lambda`,params:[n.name],body:du(e.text,n,t),operator:e.text,location:_(e)},a-1)}if(D(`LAMBDA`)){let t=a;O();let n=fe(_e(de));A(`:`);let r=M();return S({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!r)return M();let n=ae(M);if(n)return n;throw ie(`Unexpected ${te(C())}`)},Oe,j=()=>ge(()=>{let e=a;A(`(`);let t=_e(De);return A(`)`),Oe=x(e),t}),ke=()=>{let e=O();o.push(e.column);let t=[M()],n=()=>{for(;lu(ee())&&ee().text===e.text&&ee().column===e.column;)a++,t.push(M())};return r?oe(n):n(),o.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},Ae=e=>ge(()=>{let t=_(e),n=C().kind===`Identifier`,i=D(`|->`,1)&&(n||ce(C()));if(i||n&&D(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a,n=_(C()),r=e();return n.range=x(t),A(i?`|->`:`:`),{name:r,value:M(),location:n}},o=[r(()=>n?ue():O().text),...k(`,`)?_e(()=>r(ue)):[]];return A(`]`),{kind:e,fields:o,location:t}}if(ve()){let e=a,n=Se();if(!r||D(`|->`)){A(`|->`);let e=M();return A(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}a=e}let o=M();if(k(`->`)){let e=M();return A(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(k(`EXCEPT`)){let e=_e(()=>{A(`!`);let e=[];for(;D(`.`)||D(`[`);)if(k(`.`)){if(!ce(C()))throw ie(`Expected a field name but found ${te(C())}`);if(!r&&D(`@`))throw ie(`@ used in !.@`);e.push({kind:`Field`,name:O().text})}else A(`[`),e.push({kind:`Index`,args:_e(()=>M())}),A(`]`);return A(`=`),{path:e,value:M()}});return A(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!D(`]_`)){let e=[o];for(;k(`,`);)e.push(M());return A(`]`),{kind:`Bracket`,args:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:o,subscript:Ce().subscript,location:t}}),je=()=>{let e=a,t=S(Ve(),e),n=_(O());return S({kind:`Apply`,operator:`\\in`,args:[t,oe(M)],location:n},e)},Me=e=>ge(()=>{let t=_(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ve()&&(C(1).text===`\\in`||D(`<<`))){let e=a,n=xe();A(`\\in`);let r=oe(M);if(k(`:`)){let e=oe(M);return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a=e}let n=C().kind===`Identifier`&&D(`\\in`,1)?je():M();if(k(`:`)){let e=Se();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;k(`,`);)r.push(M());return A(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ne=e=>{let t=_(e),n=ge(()=>D(`>>`)||D(`>>_`)?[]:_e(()=>M()));if(k(`>>_`)){if(n.length!==1)throw E(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:oe(Ce).subscript,location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},Pe=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ve()){let e=Se();return A(`:`),{kind:n,bounds:e,body:M(),location:t}}let i=fe(_e(de));return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:M(),isTemporal:r,location:t}},Fe=e=>{let t=[];do{let n=a;if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:M(),otherRange:x(n),location:_(e)};let r=M();A(`->`),t.push({condition:r,body:M()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Ie=()=>{let e=C(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Vl.has(e.text)||e.kind===`Operator`&&(Ol.has(e.text)||Fl.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Ll.has(e.text))},Le=()=>{let e=O();if(e.kind===`Number`)return{kind:`Operand`,operand:le(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a--,{kind:`Bound`,args:j()}}return{kind:`Name`,name:e.text,args:D(`(`)?j():[]}},Re=(e,t,n,r,i)=>{let o=[{kind:`Name`,name:e,args:t}],s=[x(r,r)],c=[n];for(;Ie();){O();let e=a;Oe=void 0;let t=Le();s.push(t.kind===`Bound`?x(e):x(e,e)),o.push(t),c.push(Oe)}let l=o.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=o.flatMap(e=>`args`in e?e.args:[]),f=o.map(e=>`args`in e?e.args.length:0);return l.length<o.length?{kind:`Subexpression`,selectors:o,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??x(r),selectorRanges:s,argumentRanges:c,location:i}},ze=e=>{let n=a,i=O(),o=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=_e(ue);return A(`:`),{kind:`Lambda`,params:e,body:M(),location:o}}if(i.kind===`Number`)return{kind:`Number`,value:le(i.text),text:i.text,location:o};if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:o};if(i.kind===`String`)return{kind:`String`,value:i.text,location:o};let s=i.kind===`Step`&&xt(i);if(!r&&s&&vt()<0&&_t.length<=1)throw E(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw E(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?St(i)??i.text:i.text;if(ye()){let a=fe(k(`(`)?_e(de):[]);a.names.length>0&&A(`)`),A(`::`);let s=x(n),l=M();if(!r&&e!==void 0&&c!==void 0&&cu(l)&&e.high>=c.low)throw E(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:a.names,paramRanges:a.ranges,head:s,body:l,location:o}}let a=D(`(`);if(t===`@`&&!a&&!Ie())return{kind:`ExceptAt`,location:o};let l=a?j():[];return Ie()?Re(t,l,a?Oe:void 0,n,o):a?{kind:`Apply`,operator:t,args:l,argumentsRange:Oe,location:o}:{kind:`Identifier`,name:t,location:o}}let l=i.kind===`Operator`&&(uu(i.text)||i.text===`'`&&!r);if(l&&D(`(`)){let e=j();return!r&&Ie()?Re(i.text,e,Oe,n,o):t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:o}:i.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:o}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,argumentsRange:Oe,location:o}}if(l&&!r)return Ie()?Re(i.text,[],void 0,n,o):{kind:`Identifier`,name:i.text,spelling:i.spelling,location:o};switch(i.text){case`(`:{let e=ge(()=>M());return A(`)`),fu.set(e,x(n)),e}case`[`:return Ae(i);case`{`:return Me(i);case`<<`:return Ne(i);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Pe(i);case`IF`:{let e=M();A(`THEN`);let t=M();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:M(),location:o}}case`CASE`:return Fe(i);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!k(`IN`);){if(r&&D(`RECURSIVE`))throw ie(`Unexpected keyword RECURSIVE`);if(k(`RECURSIVE`)){n.push(...N());continue}let i=ct(!r&&k(`LOCAL`));i.kind===`Instance`?t.push(i):e.push(i)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:M(),location:o}}case`CHOOSE`:{let e=xe(),t=k(`\\in`)?M():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:M(),location:o}}case`WF_`:case`SF_`:{let e=Ce(),t=!D(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:ge(()=>{A(`(`);let e=M();return A(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:o}}}throw ie(`Unexpected ${te(i)}`,i)},Be=(e,t,n)=>{c=l={low:t,high:n};let r=M(n+1),i=C(),a=Fl.has(i.text)?El.high:Ol.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw E(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Ve=()=>{let e=l;l=void 0;let t=C(),n=_(t);if(t.kind===`Operator`&&lu(t))return ke();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[Be(t,4,4)],location:n};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[Be(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return O(),du(t.text,Be(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:t.text,args:[Be(t,10,13)],location:n}}return ze(e)},He=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},Ue=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},We=()=>{O();let e=ge(()=>_e(()=>M()));return ge(()=>A(`]`)),e},Ge=e=>{let t=a,n=Ve(),r=n.location.range?n:S(n,t),i;for(;;){let n=C();if(n.kind!==`Operator`)break;let a=_(n);if(Fl.has(n.text)&&e<=15){O(),c=El,r=S(Ue(n,r),t);continue}if(n.text===`[`){let e=We();c=Dl,r=S({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&ce(C(1))){O();let e=O().text;r=S({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=Ol.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw E(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(O(),o.low>12&&D(`-`))throw E(`Precedence conflict between ${n.text} and -`,C());c=l=o;let s=M(o.high+1),u=i?.text===n.text;r=S(He(n,r,s,u,x(t).end),t),i={...o,text:n.text}}return r},Ke=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&xt(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&Ml.has(e.text),qe=(e,t)=>({start:t,end:a-1,expression:e.location.range?e:S(e,t)}),Je=(e,t,n,r)=>({...n,start:e,end:a-1,fixity:t,isLeft:!1,apply:r}),Ye=e=>e.kind===`Operator`&&Fl.has(e.text)&&D(`(`,1)?ae(()=>ge(()=>{O(),O();let t=M(),n=a-1;return A(`)`),{end:n,expression:Ue(e,t)}})):void 0,Xe=()=>{let e=0;for(let t=a+1;t<i.length;t++){let n=i[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(i[t-1].text!==`!`&&(au.has(n.text)&&e++,ou.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>D(`(`,1)&&Xe()?ae(()=>ge(()=>{O(),O();let t=M();A(`,`);let n=M();return A(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,Qe=e=>{let t=a,n=C(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,o=i?Ol.get(n.text):void 0;if(!e){if(D(`[`)){let e=We();return Je(t,`Postfix`,jl,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(D(`.`)&&ce(C(1))){O();let e=O().text;return Je(t,`Postfix`,jl,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(o){if(Ze(n)){a=t;return}return O(),{...Je(t,`Infix`,o,e=>He(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,x(e[0].start,e[1].end).end)),isLeft:kl(n.text,o),joins:n.text}}if(n.kind!==`Operator`||!Fl.has(n.text))return;if(Ye(n)){a=t;return}return O(),Je(t,`Postfix`,El,e=>Ue(n,e[0].expression))}if(n.kind===`Operator`&&lu(n))return qe(ke(),t);let s=o?Ze(n):void 0;if(s)return qe(s,t);let c=Ye(n);if(c)return c.expression.location.range=x(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?Al.get(n.text):void 0;if(l)return O(),Je(t,`Prefix`,l,e=>du(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Ke(n))return;let u=n.kind===`Operator`&&Nl.has(n.text);return qe(u?ze():oe(ze),t)},$e=e=>e!==void 0&&`fixity`in e,et=e=>e!==void 0&&!(`fixity`in e),tt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=x(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},nt=e=>{let t=e.pop(),n=e.pop();if(!et(t)||!$e(n))throw E(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(tt(n,et(r)?[r,t]:[t]))},rt=e=>{let t=e[e.length-2];return $e(t)?t:void 0},it=(e,t)=>t!==void 0&&e.high<t.low,at=()=>se(()=>{let e=ae(()=>Qe(!0));if(e===void 0){let e=ee();throw e.kind===`End`?ie(`Unexpected end of expression`,e):E(`required expressions(s) missing before '${T(e)}'`,e)}return oe(()=>{let t=[e];for(;;){let e=ae(()=>Qe($e(t[t.length-1])));if(e===void 0)break;if(et(e)||e.fixity===`Prefix`){t.push(e);continue}for(;it(e,rt(t));)nt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&et(n)){t.splice(-1,1,tt(e,[n]));continue}let r=rt(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!it(r,e)&&nt(t),t.push(e)}for(;t.length>1;)nt(t);let n=t[0];if(!et(n))throw E(`incomplete expression`);return n.expression})}),M=(e=0)=>r?at():Ge(e),ot=()=>{if(!k(`(`))return[];let e=mt();return A(`)`),e},st=()=>{let e=_(C()),t=M(),n=i[a-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},ct=e=>{let t=a;return S(ut(e),t)},lt=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),ut=e=>{let t=C(),n=a,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:x(n,a-2),...st(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&C(1).kind===`Operator`&&Ol.has(C(1).text)&&C(2).kind===`Identifier`&&D(`==`,3)){let e=de(),t=O().text,n=de();return A(`==`),i(t,[lt(e),lt(n)])}let o=t.kind!==`String`&&Ll.has(t.text),s=t.kind===`Identifier`&&Fl.has(C(1).text)&&D(`==`,2);if(o||s){let e=o?t.text:C(1).text;o&&O();let n=de();return s&&O(),A(`==`),i(e,[lt(n)])}let c=ue();if(k(`[`)){let t=ge(()=>Se());return A(`]`),A(`==`),{kind:`Function`,name:c,bounds:t,body:M(),isLocal:e,isRecursive:g(c),location:r}}let l=a,u=ot();return A(`==`),D(`INSTANCE`)?{...dt(c,u,e,r),definitionRange:x(l)}:i(c,u)},dt=(e,t,n,r)=>{let i=a;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:he(),substitutions:k(`WITH`)?_e(()=>{let e=a,t=pe(),n=x(e);return A(`<-`),{name:t,nameRange:n,expression:De()}}):[],isLocal:n,location:r,instanceRange:x(i)}},ft=()=>{let e=a;return S(pt(),e)},pt=()=>{let e=_(C());if(D(`_`)&&C(1).kind===`Operator`&&(Ol.has(C(1).text)||Fl.has(C(1).text)))return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(C().kind!==`String`&&(Ll.has(C().text)||r&&C().kind===`Operator`)&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ue();if(!k(`(`))return{name:t,arity:0,location:e};let n=_e(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},mt=()=>_e(ft),N=()=>{let e=mt();return e.forEach(e=>u[u.length-1].add(e.name)),e},ht=e=>{let t=0,n=e;do{let e=C(n);if(e.kind===`End`)return n;e.kind===`Operator`&&au.has(e.text)&&t++,e.kind===`Operator`&&ou.has(e.text)&&t--,n++}while(t>0);return n},gt=()=>{let e=C(),t=C(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,ht(1)):t.kind===`Operator`&&Fl.has(t.text)?D(`==`,2):t.kind===`Operator`&&Ol.has(t.text)?C(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):e.kind!==`String`&&Ll.has(e.text)&&t.kind===`Identifier`&&D(`==`,2)},_t=[],vt=()=>_t[_t.length-1]??-1,yt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),bt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},xt=e=>!e.text.endsWith(`.`)&&!ql.has(bt(e)),St=e=>{let t=bt(e);if(ql.has(t))return;let n=yt(e);if(n>=0)return`<${n}>${t}`;let r=vt(),i=_t[_t.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},P=e=>{if(e.kind===`Keyword`)return Wl.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return _t.length===0;if(e.text[1]===`+`||_t.length===0)return!0;let t=vt();return t>=0&&yt(e)>t},Ct=e=>{let t=yt(e),n=_t.length-1,r=_t[n-1]??-1,i=_t[n]<0;return i&&(_t[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:_t[n]===t},wt=()=>{let e=C();return e.kind===`Step`?xt(e):e.kind===`Keyword`?nu.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!gt()},Tt=()=>{let e=a,t=C();return t.kind===`Operator`&&!Rl.has(t.text)&&uu(t.text)?(a++,S({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):k(`MODULE`)?S({kind:`ModuleFact`,name:ue(),location:_(t)},e):M()},Et=()=>{let e=a,t=C(),n=_e(()=>{let e=C();if((e.kind!==`Identifier`||w(e))&&e.kind!==`Operator`)throw ie(`Expected a definition name but found ${te(e)}`,e);return a++,e.text},`!`),r=_(t);return S(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Dt=()=>_e(r?Et:Tt),Ot=()=>{let e=ae(M);if(!e)return[];let t=[e];return se(()=>{for(;D(`,`);){let e=ae(()=>(O(),M()));if(!e)return;t.push(e)}}),t},kt=()=>{let e=r?Ot():wt()?_e(Tt):[],t=k(`DEF`)||k(`DEFS`);if(r&&e.length===0&&!t)throw ie(`Expected a fact`);return{facts:e,defs:t?Dt():[]}},At=()=>{let e=a,t=O(),n=t.text===`USE`&&k(`ONLY`),r=x(e);return S({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...kt(),keyword:r,location:_(t)},e)},jt=()=>{let e=a,t=_(C()),n=k(`NEW`),i=r?a:e,o=r?_(C()):t,s=C().kind===`Keyword`?ru.get(C().text):void 0;if(!n&&s===void 0)throw ie(`Expected a declaration but found ${te(C())}`);if(s!==void 0&&O(),s===`Variable`){let e=de();return S({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:o},i)}let c=ft(),l=(s??`Constant`)===`Constant`&&D(`\\in`);if(l&&c.arity>0)throw E(`declared symbol with arguments before \\in`);return l&&O(),S({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?M():void 0,nameRange:c.location.range,location:o},i)},Mt=()=>{if(C().kind===`Identifier`&&D(`::`,1)&&D(`ASSUME`,2)&&(O(),O()),D(`ASSUME`))return Pt();if(C().kind===`Keyword`&&iu.has(C().text))return r?oe(jt):jt();if(!r)return M();let e=ae(M);if(e===void 0)throw ie(`Expected a hypothesis`);return e},Nt=()=>{let e=[Mt()];return se(()=>{for(;;){let t=ae(()=>(A(`,`),Mt()));if(t===void 0)break;e.push(t)}}),e},Pt=()=>{let e=a,t=_(A(`ASSUME`)),n=()=>{let n=r?Nt():_e(Mt);return A(`PROVE`),S({kind:`AssumeProve`,assumptions:n,conclusion:M(),location:t},e)};return r?oe(n):n()},Ft=e=>{let t=0;for(;C(t).kind===`Identifier`&&D(`,`,t+1);)t+=2;return C(t).kind===`Identifier`&&D(e,t+1)},It=()=>{let e=C();if(D(`USE`)||D(`HIDE`))return At();if(!r&&D(`INSTANCE`)){let t=a;return S(dt(void 0,[],!1,_(e)),t)}if(D(`DEFINE`)||gt()){let t=a;k(`DEFINE`);let n=[ct(!1)];for(;gt();)n.push(ct(!1));let r={kind:`Define`,definitions:n,location:_(e)};return S(r,t)}if(k(`HAVE`))return{kind:`Have`,expression:M()};if(k(`TAKE`)){let e=ve(),t=fe(e?[]:_e(de)),n=e?Se():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:_e(()=>M())};if(k(`PICK`)){let e=Ft(`:`),t=fe(e?_e(de):[]),n=e?[]:Se();return A(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:M()}}return k(`CASE`)?{kind:`Case`,expression:M()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?Pt():M()}},Lt=e=>{let n=C();if(n.kind!==`Step`)throw ie(`Expected a step number but found ${te(n)}`,n);if(!Ct(n))throw E(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&yt(n)<0&&St(n)!==void 0)throw E(`<*> and <+> cannot be used for a named step`,n);return a++,{name:St(n),token:n.text,location:_(n)}},Rt=()=>{let e=a,t=Lt(D(`QED`,1)),n=a,r=k(`QED`)?{kind:`Qed`}:It(),i=x(e),o=x(n),s=P(C());if(s&&!Gl.has(r.kind))throw E(`Proof of a step that does not take a proof`);let c=s?Vt():void 0;return S({...t,body:r,head:i,statement:o,proof:c},e)},zt=e=>{if(k(`BY`)){let t=x(a-1);return{kind:`By`,isOnly:k(`ONLY`),...kt(),keyword:t,location:e}}let t=C();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;O();let n=x(a-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Bt=()=>{let e=_(C());k(`PROOF`);let t=zt(e);if(t)return t;let n=[Rt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Rt());return{kind:`Steps`,level:vt(),steps:n,location:e}},Vt=()=>{let e=a;_t.push(-1);let t=Bt();return _t.pop(),S(t,e)},Ht=()=>C().kind===`Step`||C().kind===`Keyword`&&Wl.has(C().text),Ut=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Zl(e);let n=t.defs[t.defs.length-1]?.location.range;return Xl(Zl({...e,end:e.start}),Zl(n??t.keyword))},Wt=()=>{let e=a,t=_(C()),n=k(`PROOF`),r=zt(t);if(r){let t=S(r,e);return{kind:`Leaf`,proof:t,span:Zl(t.keyword),first:e,end:a-1}}let i=C();if(i.kind!==`Step`)throw ie(`Expected a step number but found ${te(i)}`);let o=a;O();let s=a,c=k(`QED`)?{kind:`Qed`}:It(),l=x(o);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:x(s),span:Ut(l,c),first:e,start:o,end:a-1}},Gt=(e,t,n,r)=>{let a=e[t];if(!a)return{proof:void 0,span:r,next:t,end:void 0};if(a.kind===`Leaf`)return{proof:a.proof,span:a.span,next:t+1,end:a.end};let o=Kt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(i[a.first]),range:x(a.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 tu(`Unexpected end of (sub)proof at level ${n} before QED step`,r,eu);if(a.kind===`Leaf`)throw tu(`Expecting a proof step but found a${Jl[a.proof.kind]} leaf proof`,a.span,eu);if(!i&&a.isProof)throw tu(`PROOF keyword found in step that does not begin subproof`,a.span,$l);let o=a.token.text[1];if(o===`+`&&!i)throw tu(`<+> used but no subproof expected`,a.span,$l);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:yt(a.token);if(s<n||!i&&s>n)return;let c=Gl.has(a.body.kind)?Gt(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:St(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:x(a.start,l)}},d=Xl(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:Xl(d,f.span)}},qt=()=>{if(!Ht())return;let e=[];for(;Ht();)e.push(Wt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Gt(e,0,0,t.span),r=e[n.next];if(r)throw tu(`extra step(s) after finished proof`,r.span,Ql,`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})},Yt=()=>{if(C().kind!==`Identifier`||!D(`==`,1))return;let e=ue();return O(),e},Xt=()=>{if(!r)return M();let e=ee(),t=ae(M);if(t)return t;throw ie(`Expected "====" but found ${te(e)}`,e)},Zt=e=>{let t=a,n=O(),i=Yt(),o=D(`ASSUME`)?Pt():Xt(),s=r?qt():P(C())?Vt():void 0,c=S({name:i,statement:o,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&o.kind!==`AssumeProve`&&Jt(e,i,o,c.location)},Qt=()=>{let e=a,t=O(),n=Yt();return S({name:n,expression:M(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},$t=()=>{let e=_(A(`----`));A(`MODULE`);let t=he();A(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(d.push(n),u.push(/* @__PURE__ */ new Set),k(`EXTENDS`)&&_e(()=>{let e=a;n.extends.push(he()),n.extendsRanges.push(x(e))});;){let t=a,r=C();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.pop(),n;if(r.kind===`Separator`){if(D(`MODULE`,1)){let e=$t();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(O()),r=mt();n.constants.push(...r),e.range=x(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(O()),r=_e(()=>{let e=a,t=_(C());return S({name:ue(),arity:0,location:t},e)});n.variables.push(...r),e.range=x(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Qt();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(D(`USE`)&&D(`ONLY`,1))throw ie(`Expected a module unit but found ${te(r)}`);let e=At();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(O()),r=N();e.range=x(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:en(n,S(dt(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){en(n,S(dt(void 0,[],!0,_(r)),t));continue}en(n,S(ut(!0),t));continue}r.kind===`Keyword`&&Ul.has(r.text)?Zt(n):en(n,ct(!1))}}},en=(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}))},tn=$t(),nn=me?Tl(e):void 0;if(nn!==void 0)throw new s(nn);return tn},hu=e=>mu(e,`tlc`),gu=(e,t)=>mu(e,`tlc`,t),_u=e=>mu(e,`tlapm`),vu=e=>mu(e,`sany`),yu={kind:`Local`},bu=`$subexpression`,xu=/* @__PURE__ */ new WeakMap,Su=/* @__PURE__ */ new WeakMap,Cu=/* @__PURE__ */ new WeakMap,wu=/* @__PURE__ */ new WeakMap,Tu=/* @__PURE__ */ new WeakMap,Eu=/* @__PURE__ */ new WeakMap,Du=/* @__PURE__ */ new WeakSet,Ou=/* @__PURE__ */ new WeakSet,ku=e=>Ou.has(e)||Au(Eu.get(e))!==void 0,Au=e=>e?.find(e=>e.isEmpty?ku(e.node):Du.has(e.node))?.error,ju=/* @__PURE__ */ new WeakMap,Mu=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Nu=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),Pu=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Fu=(e,t)=>Pu(e,t)?-1:+!!Pu(t,e),Iu=e=>e.kind===`Operator`?e.params.length:0,Lu=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ru=e=>e.name.includes(`!`),zu=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Bu=(e,t,n)=>{let r=t.bindings.get(e);return r&&Pu(r.position,t.location)&&(!n||Pu(r.position,n.start))?r:void 0},Vu=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),Hu=(e,t,n,r)=>{if(t===void 0)return!0;if(Vu(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${$s(e)} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${$s(e)}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${$s(e)}. \nThis duplicates the one at ${o}.`}),!1},Uu=(e,t,n,r)=>Hu(t,zu(e,t)??Bu(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Wu=(e,t,n)=>{Hu(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Gu=(e,t,n,r)=>t.reduce((e,t,i)=>Uu(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ku=(e,t,n)=>t.reduce((e,t)=>Uu(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),qu=e=>e.kind===`Name`?[e.name]:e.names,Ju=e=>e.flatMap(e=>qu(e.pattern)),Yu=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?Bu(e,t,void 0)!==void 0:Pu(n.location,t.location))?n:void 0},Xu=(e,t)=>{let n=Yu(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??Iu(n),params:r?.params??Lu(n),kind:`Definition`,range:n.location.range}}let r=Bu(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},Zu=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,Qu=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,$u=(e,t,n)=>zu(t,e)??Xu(e,n),ed=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),td=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:ed(e.location,e.spelling??t)},nd=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},rd=`In module --TLA+ BUILTINS--`,id=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),ad=(e,t,n)=>n.errors.push({location:g(t),message:`Cannot take subexpression of \`${$s(e)}'.`}),od=e=>!/^[\p{L}\d_]/u.test(e),sd=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),cd=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,ld=(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])}})},ud=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?ld(e.name,[],void 0):ld(e.operator,e.args,e.argumentCounts),dd=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),fd=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ju(e.bounds),body:e.body,sets:dd(e.bounds)};case`SetMap`:return{names:Ju(e.bounds),body:e.expression,sets:dd(e.bounds)};case`SetFilter`:return{names:qu(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:qu(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}},pd=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`:case`Selection`: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}},md=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,hd=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),gd=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`&&e.kind!==`Selection`)return e.kind===`Let`?gd(e.body,t):pt(e).reduce((e,n)=>e??gd(n,t),void 0)},_d=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??_d(i,t,n||hd(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&gd(e.set,t):gd(e,t)},vd=e=>e.kind===`Label`?vd(e.body):e,yd=e=>typeof e==`number`?`argument selector ${e}`:e,bd=`within the scope of a declaration
398
+ from outside that declaration's scope.`,xd=(e,t,n,r,i)=>{let a=(t,n)=>{let i=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;i&&r.errors.push({location:g(i),message:n})},o=n.isSuffices===n.isInProof,s=n.statement,c={node:s,isGoal:!0,isSufficesOpen:n.isSuffices},l=0,u=0;for(let[e,n]of t.slice(1).entries()){let r=e+1,i=c.node;if(n.kind===`Name`){if(t[r-1].kind!==`Name`)return i.kind!==`NewSymbol`&&i.kind!==`AssumeProve`&&vd(i).kind===`Let`?i:a(r-1,`A name selector here must be from a LET clause.`);let e=s.kind===`AssumeProve`?[...s.assumptions,s.conclusion]:[s],l=r===1?e.map((e,t)=>({position:t,label:_d(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?gd(i.body,n.name):void 0};if(!l?.label)return a(r,`Cannot find label \`${n.name}'.`);if(r===1&&s.kind===`AssumeProve`&&hd(s,l.position)&&o)return a(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${bd}`);if(n.args.length!==l.label.params.length)return a(r,`Label \`${n.name}' used with wrong number of arguments.`);c.node=l.label,c.isGoal=!1,c.isSufficesOpen=!1;continue}if(n.kind===`Colon`)return i;let d=n.kind===`Operand`?yd(n.operand):n.kind===`At`?`@`:`!(...)`,f=e=>n.kind===`Operand`?cd(n.operand,e):-1,p=`An unexpected null node specified by '${d}'.\nThis is probably due to a previous error.`;if(c.isSufficesOpen){if(f(1)!==0)return a(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);c.isSufficesOpen=!1;continue}if(i.kind===`NewSymbol`)return i;if(i.kind!==`AssumeProve`){let e=vd(i);if(Du.has(e))return a(r,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return a(r,`Selecting subexpression of expression that has none.`);if(ku(e))return a(r,`Choosing operand \`${d}' of subexpression with no operands.`);let t=fd(e);if(t&&n.kind!==`Operand`){let e=n.kind===`Bound`?n.args.length:0;if(n.kind===`Bound`&&e!==t.names.length)return a(r,`Selector with ${e} argument(s) used for quantifier with ${t.names.length} bound identifier(s).`);l+=t.names.length,u+=e,c.node=t.body,c.isGoal=!1;continue}let o=t?.sets,s=e.kind===`Identifier`?[]:o?o.length>0?o:void 0:pd(e);if(!s)return i;let m=e.kind===`Except`,h=f(m?e.updates.length+1:s.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(m&&h>0)return a(r,`Selecting subexpression of an EXCEPT not yet implemented.`);if(c.node=s[h],c.isGoal=!1,Du.has(c.node))return a(r,p);continue}let m=[...i.assumptions,i.conclusion],h=f(m.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(hd(i,h)&&(!c.isGoal||o))return a(r,`Accessing ASSUME/PROVE clause ${bd}`);let g=m[h];if(g.kind===`NewSymbol`&&r!==t.length-1)return a(r,`Selected a subexpression of a NEW clause of an ASSUME.`);if(c.node=g,c.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&Du.has(g))return a(r,p)}return c.node.kind===`AssumeProve`?i?c.node:a(void 0,`Selected ASSUME/PROVE instead of expression.`):c.node.kind===`NewSymbol`?i?c.node:a(void 0,`Selected a NEW declaration as an expression or operator.`):l===u?c.node:a(void 0,`Expected ${l} arguments but found ${u}.`)},Sd=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:g(e.location.range),message:n}),!0)},Cd=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=g(r),a=e.params.filter((r,i)=>{let a=zu(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:g(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},wd=(e,t,n,r)=>{if(!md(e))return!1;let i=ud(e),a=i[0],o=i.length>1&&a.kind===`Name`?zu(t,a.name)?.goal??Qu(a.name,n):void 0;return o&&{node:xd(e,i,o,n,r)}},Td=(e,t,n)=>{let r=zu(t,e)??Bu(e,n,void 0);return r?r.kind===`Instance`:Md(e,t,n)!==void 0&&[...n.bindings.keys()].some(t=>t.startsWith(`${e}!`))},Ed=(e,t,n,r)=>{let i=e.location;if(zd(e,n,r))return;let a=ju.get(e);if(a!==void 0)return a;if(Mu(t))return e.kind===`Apply`?e.args.length:0;let o=zu(n,t);if(o?.nonFactStep){r.errors.push({location:g(td(e,t)),message:`Step number of non-expression step used as an expression.`});return}let s=o?.goal?.keyword;if(s){r.errors.push({location:g(td(e,t)),message:`${s} proof step selected instead of expression.`});return}if(wd(e,n,r,!1)||sd(t)&&o)return e.kind===`Apply`?e.args.length:0;if(Td(t,n,r)){let n=td(e,t);r.errors.push({location:g({...n,start:{line:n.end.line,column:n.end.column-t.slice(t.lastIndexOf(`!`)+1).length+1}}),message:`Operator name ${t} is incomplete.`});return}if(o&&e.kind!==`OperatorReference`&&(e.resolution=yu),o)return o.arity;let c=Xu(t,r);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,ju.set(e,c.arity),c.arity;let l=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``,u=l===``?void 0:zu(n,l)??Xu(l,r);if(u&&!id.has(u.kind)){ad(l,e.kind!==`OperatorReference`&&e.selectorRanges?.[0]||td(e,t),r);return}if(e.kind!==`OperatorReference`&&l!==``&&Vd(l,e.kind===`Apply`&&e.argumentCounts?e.args.slice(0,e.argumentCounts[0]):[],e.selectorRanges?.[0],(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??i.range,n,r))return;if(u||l!==``&&Zu(l,r))return e.kind===`Apply`?e.args.length:0;let d=nd(e),f=e.kind===`OperatorReference`||d!==void 0;if(!od(t)||sd(t)||!f){r.errors.push({location:g(td(e,t)),message:`Unknown operator: \`${$s(t)}'.`});return}let p=e.spelling??t;r.errors.push({location:g(d===`prefix`&&p===`-.`?ed(i,`-`):td(e,t)),message:`Could not find declaration or definition of symbol '${p}'.`}),d&&Du.add(e),d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${p}'.`})},Dd=(e,t,n)=>(e.forEach(e=>Y(e.set,t,n)),e.reduce((e,t)=>Gu(e,qu(t.pattern),t.pattern.ranges,n),t)),Od=(e,t)=>e.kind===`Identifier`&&e.name===t&&N(e)||pt(e).some(e=>Od(e,t)),kd=(e,t)=>{e.kind===`FunctionConstruction`&&Od(e.body,t)&&(e.isRecursive=!0),pt(e).forEach(e=>kd(e,t))},Ad=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ju(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:g(o),message:e})},c=e.kind===`Function`?Dd(e.bounds,t,i):Ku(t,e.params,i),l=zu(c,a)??Bu(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${$s(a)} defined at wrong LET/IN level.`):l&&!u?s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${$s(a)} already defined or declared.`):l&&e.kind===`Function`&&l.arity>0?s(`Function ${$s(a)} has operator arguments in its RECURSIVE declaration.`):l&&e.kind===`Operator`&&(l.arity!==e.params.length||e.params.some(e=>e.arity>0))&&s(`Definition of ${$s(a)} has different arity than its RECURSIVE declaration.`),l&&u&&e.kind===`Operator`&&(l.params=Lu(e)),e.kind===`Function`?(Y(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),kd(e.body,a),e.isSelfReferential=Od(e.body,a)):Y(e.body,c,i),l&&u?((e.kind===`Operator`||l.arity===0)&&(l.isPending=!1,l.range=o),!1):e.kind===`Function`?l===void 0:Hu(a,zu(t,a)??Bu(a,i,o),{kind:`Definition`,arity:Iu(e),range:o},i)},jd=(e,t,n,r=[],i=[])=>{let a=/* @__PURE__ */ new Set,o=e.filter(e=>e.isRecursive&&i.every(t=>t.name!==e.name)).reduce((e,t)=>{if(zu(e,t.name)?.isPending)return e;let n={name:t.name,arity:Iu(t),params:Lu(t),kind:`Definition`,parent:e,isPending:!0};return a.add(n),n},t),s=/* @__PURE__ */ new Map,c=(e,t)=>{let r={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=Hu(t.name,zu(e,t.name)??Bu(t.name,n,r.range),r,n)?{...r,name:t.name,parent:e,isPending:!0}:void 0;return i&&a.add(i),s.set(t,i),i??e},l=[...n.isGenerated?[]:r,...i].toSorted((e,t)=>Fu(e.location,t.location)),u=(e,t)=>{let r=l.findIndex(e=>!t(e));return l.splice(0,r===-1?l.length:r).reduce((e,t)=>`kind`in t?Qd(t,e,n):c(e,t),e)},d=u(e.reduce((e,t)=>{let i=Mu(t.name)?e:u(e,e=>!Pu(t.location,e.location)),o={name:t.name,arity:Iu(t),kind:`Definition`,range:t.location.range,parent:i};if(Ru(t))return{...o,params:Lu(t)};let s=r.some(e=>e.location===t.location),c=n.isGenerated||t.isLocal||Mu(t.name),l=s?{...n,isGenerated:!0,errors:[],warnings:[]}:c?{...n,isGenerated:c}:n;return Ad(t,i,l,a)?{...o,params:Lu(t)}:i},o),()=>!0);return s.forEach((e,t)=>{let r=t.location.range;r&&!n.isGenerated&&(!e||e.isPending)&&n.errors.push({location:g(r),message:`Symbol ${$s(t.name)} declared in RECURSIVE statement but not defined.`})}),d},Md=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:zu(t,r)??Bu(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},Nd=(e,t,n)=>{if(!md(e))return!1;let r=ud(e),i=r.findIndex(e=>e.kind!==`Name`),a=Md(r.slice(0,i===-1?r.length:i).flatMap(e=>e.kind===`Name`?[e.name]:[]).join(`!`),t,n),o=r[0],s=o.kind===`Name`?o.args.length:0;if(!a||s===a.arity)return!1;let c=(e.kind===`Identifier`?void 0:e.argumentRanges?.[0])??e.location.range;return c&&n.errors.push({location:g(c),message:`The operator ${a.name} requires ${a.arity} arguments.`}),!0},Pd=(e,t,n,r,i)=>{let a=e?.kind===`Definition`?e.params:void 0;return!e||!a||a.length===e.arity?!1:(r&&!i.isGenerated&&i.errors.push({location:g(r),message:`Wrong number of arguments (${n}) given to operator '${$s(t)}', \nwhich requires ${a.length} arguments.`}),!0)},Fd=(e,t,n)=>{let r=e.location.range,i=e=>{r&&n.errors.push({location:g(r),message:e})},a=Cu.get(e);if(e.kind===`Lambda`&&e.operator!==void 0)i(`The operator ${$s(e.operator)} requires 1 arguments.`);else if(a)n.errors.push(a);else if(e.kind===`Lambda`&&r)Du.add(e),i(`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let r=Ed(e,e.operator,t,n);r!==void 0&&i(`The operator ${$s(e.operator)} requires ${r} arguments.`)}else Y(e,t,n)},Id=(e,t,n,r,i,a,o)=>{let s=(e,t)=>{e&&o.errors.push({location:g(e),message:t})},c=(e,c)=>{let l=Md(r,a,o)?.range??$u(r,a,o)?.range;l&&s(i,`Operator with incorrect arity passed as argument. \nOperator '${$s(e)}' of arity ${c} is argument number ${n+1} (counting from 1) to operator \`${g(l)}', \nbut an operator of arity ${t} was expected.`)},l=e.location.range;if(t===0)return Fd(e,a,o),!0;let u=fu.get(e);if(u)return s(u,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let d=xu.get(e)??e,f=d.kind===`Subexpression`||d.kind===`Apply`&&d.argumentCounts?.at(-1)===0?ud(d):[],p=f.findIndex(e=>`args`in e&&e.args.length>0);if(p!==-1&&md(d)){let e=f[p];return s(d.selectorRanges?.[p],`Selector \`${e.kind===`Name`?e.name:`!(...)`}' should not have argument(s).`),!1}if(e.kind===`Lambda`){if(xu.has(e)?Y(e,a,o):Bd(e,a,o),Au(Eu.get(e)))return!1;let u=e.params.length===t;return!u&&xu.has(e)?s(l,`Expected arity ${t} but found operator of arity ${e.params.length}.`):!u&&l&&e.operator===void 0?s(i,`Lambda expression with arity ${e.params.length} used as argument ${n+1} of operator \`${r}', \nbut an operator of arity ${t} is required.`):!u&&e.operator!==void 0&&c(e.operator,e.params.length),u}if(d!==e){let n=Au(Eu.get(e));return n&&o.errors.push(n),n||s(d.location.range,`Expected arity ${t} but found operator of arity 0.`),!1}if(e.kind===`Subexpression`)return Y(e,a,o),!1;if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let m=e.kind===`Identifier`?e.name:e.operator,h=$u(m,a,o)?.params??[],_=Ed(e,m,a,o);return e.kind===`Identifier`&&_!==void 0&&_!==t&&s(td(e,m),`Expected arity ${t} but found operator of arity ${_}.`),e.kind===`OperatorReference`&&_!==void 0&&_!==t&&c(m,_),_===t&&h.every(e=>e===0)},Ld=(e,t,n)=>{let r=e.operator,i=$u(r,t,n),a=Nd(e,t,n)?void 0:Ed(e,r,t,n);if(a!==void 0&&a!==e.args.length&&n.errors.push({location:g(e.argumentsRange??td(e,r)),message:`The operator ${$s(r)} requires ${a-(Md(r,t,n)?.arity??0)} arguments.`}),a!==e.args.length){Ou.add(e);return}let o=i&&(i.kind===`Definition`?i.params:e.args.map(()=>0));if(o===void 0){e.args.forEach(e=>Rd(e,t,n));return}let s=e.selectorRanges?.at(-1)??td(e,r),c=r===bu,l=e.args.slice(0,o.length).map((e,i)=>{let a=c?Tu.get(e):void 0;return Id(e,o[i],a?.index??i,a?.operator??r,a?.range??s,t,c?{...n,isGenerated:!1}:n)});Pd(i,r,e.args.length,e.location.range,n)||l.forEach((t,i)=>{!t&&e.location.range&&n.errors.push({location:g(e.location.range),message:`Argument number ${i+1} to operator '${c?`LAMBDA`:r}' \nshould be a ${o[i]}-parameter operator.`})})},Rd=(e,t,n)=>{e.kind===`Identifier`?Ed(e,e.name,t,n):Y(e,t,n)},zd=(e,t,n)=>{let r=Su.get(e);return r?(r.applications.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>Id(r,e.params[i],i,e.operator,e.range,t,n))),n.errors.push(Au(r.nulls)??r.error),!0):!1},Bd=(e,t,n)=>Y(e.body,Gu(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),Y=(e,t,n)=>{if(xu.has(e)&&!n.isGenerated){let r=Au(Eu.get(e));if(r){n.errors.push(r);return}Y(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>Y(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!n.isInExcept&&e.location.range&&(Ou.add(e),n.errors.push({location:g(e.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let r=e.name,i=Nd(e,t,n)?void 0:Ed(e,r,t,n);if(i===0){let i=$u(r,t,n),a=i?.kind;(a===`Variable`||a===`Theorem`||a?.startsWith(`New`)||Zu(r,n))&&Ou.add(e),Pd(i,r,0,td(e,r),n);return}i!==void 0&&n.errors.push({location:g(td(e,r)),message:`The operator ${$s(r)} requires ${i} arguments.`}),Ou.add(e);return}case`OperatorReference`:Ed(e,e.operator,t,n);return;case`Apply`:Ld(e,t,n);return;case`Lambda`:xu.has(e)?Bd(e,t,n):e.location.range&&(Du.add(e),n.errors.push({location:g(e.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:Y(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&Y(e.other,t,n);return;case`Let`:Y(e.body,jd(e.definitions,t,n,e.instances,e.recursive),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:Y(e.body,Dd(e.bounds,t,n),i(Ju(e.bounds)));return;case`UnboundedQuantifier`:Y(e.body,Gu(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&Y(e.set,t,n),Y(e.body,Gu(t,qu(e.pattern),e.pattern.ranges,n),i(qu(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:Y(e.predicate,Dd([e.bound],t,n),i(qu(e.bound.pattern)));return;case`SetMap`:Y(e.expression,Dd(e.bounds,t,n),i(Ju(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:g(r.location.range??ed(r.location,r.name)),message:`Non-unique fields in constructor.`}),Y(r.value,t,n)});return;case`Except`:Y(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),Y(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:Y(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Sd(e,n))return;Y(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Cd(e,t,n);return;case`Subexpression`:Hd(e,t,n)&&Ou.add(e);return;case`Selection`:return}},Vd=(e,t,n,r,i,a)=>{let o=zu(i,e)??Bu(e,a,void 0);return!o?.isPending||!n||!r?!1:t.length===o.arity?(t.forEach(e=>Y(e,i,a)),a.errors.push({location:g(n),message:`Subexpression of \`${e}' used inside the operator's definition.`}),!0):(a.errors.push({location:g(r),message:`The operator ${e} requires ${o.arity} arguments.`}),!0)},Hd=(e,t,n)=>{if(Nd(e,t,n)||zd(e,t,n))return!0;let r=e.selectors[0],i=e.selectorRanges?.[0],a=e.selectors.findIndex(e=>e.kind!==`Name`),o=e.selectors.slice(0,a).flatMap(e=>e.kind===`Name`?[e.name]:[]),s=o.findIndex((e,t)=>t>0&&Xu(o.slice(0,t+1).join(`!`),n)),c=o.length>1&&(zu(t,o[0])??Bu(o[0],n,void 0))?.kind===`Instance`,l=e.selectorRanges?.[a-1];if(c&&s===-1&&i&&l)return n.errors.push({location:g({module:i.module,start:i.start,end:l.end}),message:`Unknown operator: \`${$s(o.join(`!`))}'.`}),!0;let u=o.slice(0,s+1).join(`!`),d=s>0?Xu(u,n):void 0,f=e.selectors.slice(0,s+1).flatMap(e=>`args`in e?e.args:[]).length,p=e.argumentRanges?.[s]??e.location.range;if(d&&d.arity!==f&&p)return n.errors.push({location:g(p),message:`The operator ${$s(u)} requires ${d.arity} arguments.`}),!0;if(r.kind===`Name`&&e.selectors[1].kind!==`Name`&&i){let e=zu(t,r.name),a=e??Xu(r.name,n);if(a===void 0&&!Zu(r.name,n)||a?.kind===`Instance`)return n.errors.push({location:g(i),message:`Unknown operator: \`${$s(r.name)}'.`}),!0;if(a&&(!id.has(a.kind)||e?.nonFactStep))return ad(r.name,i,n),!0}if(r.kind===`Name`&&Vd(r.name,r.args,i,e.argumentRanges?.[0]??e.location.range,t,n))return!0;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Rd(e,t,n));let m=wd(e,t,n,!1);return m?m.node===void 0:!1},Ud=(e,t)=>{let n=e.location.range;!t.isModuleKnown(e.name,e.location)&&n&&t.errors.push({location:g({...n,start:{line:n.end.line,column:n.end.column-e.name.length+1}}),message:`Module \`${e.name}' used without being extended or instantiated.`})},Wd=(e,t,n,r)=>{if(e.kind===`ModuleFact`){Ud(e,r);return}if(e.kind===`ExceptAt`&&e.location.range)return r.errors.push({location:g(e.location.range),message:"Unknown operator: `@'."}),rd;let i=Kd(e,t,n,r);if(xu.has(e))return Y(e,n,r),i;if(Nd(e,n,r))return i;let a=wd(e,n,r,!0);if(a){let t=a.node?.kind;return t===void 0?rd:t===`AssumeProve`||t===`NewSymbol`?void 0:e.location.range&&g(e.location.range)}if(e.kind===`Subexpression`)return Hd(e,n,r)?rd:i;let o=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;return e.kind===`Identifier`&&zu(n,o)?.nonFactStep?(r.errors.push({location:g(td(e,o)),message:`Step number of non-fact used as a fact`}),rd):(Zu(o,r)||zu(n,o)?.goal||e.kind===`Identifier`&&Td(o,n,r)||Y(e,n,r),i)},Gd=(e,t,n)=>{if(e.kind===`ModuleFact`)return Ud(e,n),n.isModuleKnown(e.name,e.location);let r=e.location.range,i=e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:``;if(i===``||!r)return!0;let a=zu(t,i),o=a??Xu(i,n)??Bu(i,n,r);return o===void 0&&Zu(i,n)||(o===void 0&&n.errors.push({location:g(r),message:`Unknown operator: \`${$s(i)}'.`}),a?.nonFactStep===`Define`)||(a?.nonFactStep&&n.errors.push({location:g(r),message:`DEF clause entry refers to a non-definition step.`}),o&&id.has(o.kind)&&!sd(i))?!0:(n.errors.push({location:g(r),message:`DEF clause entry should describe a defined operator.`}),!1)},Kd=(e,t,n,r)=>{let i=e.location.range&&g(e.location.range);if(xu.has(e))return Au(Eu.get(e))?rd:t.location.range&&g(t.location.range);if(Su.has(e)||e.kind===`ExceptAt`)return rd;switch(e.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let t=ud(e)[0];if(e.kind===`Subexpression`||t.kind!==`Name`)return;let a=e.kind===`Identifier`?e.name:e.operator,o=zu(n,t.name)?.goal??Qu(t.name,r);if(Zu(a,r)||o||sd(a)&&zu(n,a)||e.kind===`Identifier`&&Td(a,n,r))return;let s=$u(a,n,r),c=e.kind===`Apply`?e.args.length:0;return s?.arity===c?i:rd}default:return i}},qd=(e,t,n)=>{let r=wu.get(e.facts)??e.facts,i=e.facts.map((e,i)=>Wd(e,r[i],t,n)),a=e.facts.filter(e=>e.kind!==`ModuleFact`||n.isModuleKnown(e.name,e.location)).length,o=e.defs.filter(e=>Gd(e,t,n)).length;i.forEach(t=>{t&&e.kind===`Hide`&&n.errors.push({location:t,message:`The only expression allowed as a fact in a HIDE is
399
+ the name of a theorem, assumption, or step.`})});let s=e.location.range;a+o===0&&s&&n.errors.push({location:g(s),message:e.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},Jd=(e,t,n)=>(e.set&&Y(e.set,t,n),Uu(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Yd=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Jd(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Yd(t,e.scope,e.unit,!0):Y(t,e.scope,e.unit),e),{scope:t,unit:n});return Y(e.conclusion,i.scope,i.unit),i.scope},Xd=(e,t,n)=>e.kind===`AssumeProve`?Yd(e,t,n):(Y(e,t,n),t),Zd=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&qd(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>ef(t,e,r),t)},Qd=(e,t,n)=>{let r=sf(e,t,n);return e.name===void 0?r:Uu(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},$d=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:dd(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},ef=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=$d(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=(t,n)=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,nonFactStep:n};switch(r.kind){case`Assert`:{let a=Xd(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Zd(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return Zd(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 qd(r,t,n),s(t,r.kind);case`Instance`:return s(Qd(r,t,i),r.kind);case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?Qd(t,e,i):jd([t],e,n),t),r.kind);case`Have`:case`Case`:return Y(r.expression,t,i),Zd(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>Y(e,t,i)),o(t);case`Take`:return o(Gu(Dd(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=Gu(Dd(r.bounds,t,i),r.names,r.nameRanges,i);return Y(r.body,a,{...i,labelParams:[...i.labelParams,...Ju(r.bounds),...r.names]}),Zd(e.proof,o(t),n),o(a)}default:return Zd(e.proof,o(t),n),o(t)}},tf=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Xd(e.statement,void 0,t);e.name!==void 0&&Wu(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Zd(e.proof,n,t),r&&(r.isInProof=!1)},nf={line:0,column:0},rf=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),af=(e,t)=>{let n=new Map([...Nu,...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},of=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(e,t)=>i.errors.push({location:t,message:`An operator must be substituted for symbol '${$s(e.name)}', and it must have arity ${e.arity}.`}),s=(e,t)=>{let n=t.location.range;if(e.arity===0){Fd(t,a,i);return}let r=fu.get(t);if(t.kind===`Lambda`&&!r){Bd(t,a,i),t.params.length!==e.arity&&n&&o(e,g(n));return}if(t.kind===`OperatorReference`&&!r){let r=Ed(t,t.operator,a,i);r===void 0?o(e,rd):r!==e.arity&&n&&o(e,g(n));return}if(t.kind!==`Identifier`||r){let t=r??n;t&&i.errors.push({location:g(t),message:`Arity ${e.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${$s(e.name)}'.`}),o(e,rd);return}let s=Ed(t,t.name,a,i);s!==void 0&&s!==e.arity&&i.errors.push({location:g(td(t,t.name)),message:`Expected arity ${e.arity} but found operator of arity ${s}.`}),s!==e.arity&&o(e,rd)},c=e.location.range,l=t.filter(e=>zu(a,e.name)!==void 0||Xu(e.name,i)!==void 0).map(t=>({declaration:t,expression:{kind:`Identifier`,name:t.name,location:e.location}}));l.filter(e=>e.declaration.arity===0).forEach(e=>{let t=Ed(e.expression,e.declaration.name,a,i);t&&c&&i.errors.push({location:g(c),message:`Wrong number of arguments (0) given to operator '${$s(e.declaration.name)}', \nwhich requires ${t} arguments.`})});let u=/* @__PURE__ */ new Map;return e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;s(r,a);let o=a.location.range;u.has(n)?o&&i.errors.push({location:g(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):u.set(n,a)}),l.filter(e=>!u.has(e.declaration.name)).forEach(e=>{(e.declaration.arity===0?0:Ed(e.expression,e.declaration.name,a,i))!==e.declaration.arity&&c&&o(e.declaration,g(c)),u.set(e.declaration.name,e.expression)}),t.filter(e=>!u.has(e.name)).forEach(e=>{let t=e.location.range;c&&t&&i.errors.push({location:g(c),message:`Substitution missing for symbol ${$s(e.name)} declared at ${g(t)} \nand instantiated in module ${n}.`})}),u},sf=(e,t,n)=>{let r=n.getInstance(e);return of(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>Uu(e,t[0],t[1],n),t)},cf=(e,t,n,r)=>{let i=af(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),of(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,isModuleKnown:r.isModuleKnown,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??nf}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},lf=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Fu(e.location,t.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof s)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},uf=(e,t)=>{let n=af(e,t.imported),r=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),i=new Map([...Nu,...t.bound].map(e=>[e[0],{...e[1],position:nf}])),a=/* @__PURE__ */ new Set,o=[],s=(e,a,o,s)=>({location:e,check:(c,l)=>s({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,isModuleKnown:t.isModuleKnown,location:e,self:a,facts:t.facts,goals:r,bindings:i,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),c=(e,t)=>e.map(e=>s(e.location,void 0,!1,n=>Wu(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return lf([...e.units.flatMap(e=>{let t=e.kind===`Variables`?{type:`A VARIABLE declaration`,location:e.location}:e.kind===`Constants`?{type:`A declaration`,location:e.location}:e.kind===`Module`?{type:`A MODULE `,location:e.module.location}:e.kind===`Theorem`?{type:`A THEOREM`,location:e.theorem.location}:e.kind===`Assumption`?{type:`An ASSUME`,location:e.assumption.location}:e.kind===`Use`?{type:`A USE or HIDE`,location:e.use.location}:void 0,n=t?.location.range;return!t||!n?[]:[{location:t.location,check:e=>{o.some(e=>e.binding?.isPending)&&e.push({location:g(n),message:`${t.type} may not appear within a recursive definition section.`})}}]}),...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...c(e.constants,`Constant`),...c(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>s(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=Hu(e.name,i.get(e.name),n,t);r&&(i.set(e.name,n),a.add(n)),o.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>s(t.location,t,!0,n=>{rf(e,t)?Y(t.body,void 0,n):Ad(t,void 0,n,a)&&i.set(t.name,{kind:`Definition`,arity:Iu(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>s(e.location,void 0,!1,n=>{Ku(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>Wu(t,e,n)),e.name!==void 0&&Wu(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>s(e.location,void 0,e.name!==void 0,t=>{Y(e.expression,void 0,t),e.name!==void 0&&Wu(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>s(e.location,void 0,e.name!==void 0,t=>tf(e,t))),...e.uses.map(e=>s(e.location,void 0,!1,t=>qd(e,void 0,t))),{location:e.location.range?.end??e.location,check:e=>o.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${$s(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},df=/* @__PURE__ */ new WeakSet,ff=/* @__PURE__ */ new WeakMap,pf=(e,t)=>{if(t.length===0)return e;let n={...e};return df.has(e)&&df.add(n),ff.set(n,[...t,...ff.get(e)??[]]),n},mf=(e,t,n=/* @__PURE__ */ new Set)=>{let r=bf(e,(e,r)=>mf(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&N(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&N(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},hf=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),gf=/* @__PURE__ */ new WeakMap,_f=e=>gf.get(e)??e.name,vf=(e,t)=>(_f(t)!==e.name&&gf.set(e,_f(t)),e),yf=(e,t)=>vf(e.kind===`Function`?{...e,bounds:hf(e.bounds,e=>t(e,[])),body:t(e.body,Ju(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),bf=(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=>yf(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:hf(e.bounds,n),body:t(e.body,Ju(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,qu(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,qu(e.bound.pattern))};case`SetMap`:return{...e,bounds:hf(e.bounds,n),expression:t(e.expression,Ju(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`Selection`:return{...e,expression:n(e.expression)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},xf=(e,t)=>{bf(e,(e,n)=>(t(e,n),e))},Sf=`LAMBDA`,Cf=e=>`${e}@SUBSTITUTION`,wf=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(wf),Tf=(e,t)=>{if(e.kind!==`Identifier`)return!wf(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=N(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!wf(n.body)},Ef=(e,t=/* @__PURE__ */ new Set)=>{let n=mt(e),r=n===void 0||t.has(n)?[]:[n];return xf(e,(e,n)=>r.push(...Ef(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Df=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}},Of=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),kf=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Af=(e,t)=>e.map(e=>({pattern:kf(e.pattern,t),set:e.set})),jf=(e,t)=>e.kind===`Function`?{...e,bounds:Af(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Mf=(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=>vf({...jf(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Af(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:kf(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:kf(e.bound.pattern,n),set:e.bound.set}};default:return e}},Nf=e=>`${e}@ENABLED`,Pf=(e,t)=>e.modes.get(t)??e,Ff=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!N(e)&&t.instantiation.variables.has(e.name),If=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>If(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Ff(e,t,n))return[e.name];let r=N(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?If(r.body,t,/* @__PURE__ */ new Map):void 0},Lf=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Ff(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Nf(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Uf(e.expression,Pf(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Uf(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Uf(e.subscript,Pf(t,`Primed`),n),location:r},Uf(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=If(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:Nf(r),location:e.location},location:e.location},Uf({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Rf=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:yu}),zf=(e,t)=>e.map(e=>Rf(e.name,t)),Bf=(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:zf(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Vf=(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:[...zf(t,r),...i.map(e=>Rf(e,r))],location:r},location:r}},Hf=(e,t)=>e.instantiation.isParameterized(t)?Gf(e,t):void 0,Uf=(e,t,n)=>{let r=e=>Uf(e,t,n);if(e.kind===`Selection`&&[...n].every(e=>e[0]===e[1])){let n=e.expression,i=t.selections.get(n)??r(n);return t.selections.set(n,i),{...e,expression:i}}let i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!N(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Uf(e.expression,Pf(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Uf(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Pf(t,`Enabled`),n)};let c=Lf(e,t,n);if(c)return c;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Tf(n,i)))return pf(n,[e]);if(n&&r){let t=Cf(e.name);return r.set(t,n),Rf(t,e.location)}let o=Hf(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&Iu(s)>0?Vf(o,a,Iu(s),e.location):{kind:`Apply`,operator:o,args:zf(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),c=i.substitutions.size>0||a.length>0||df.has(e),l=e=>(c&&df.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return l({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return l({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Sf,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Sf,args:n,resolution:yu},location:e.location};if(o)throw new s(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Hf(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...zf(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return pf(n,[e]);let r=Hf(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?Vf(r,a,Iu(o),e.location):{...e,operator:r}}let l=Df(t),u=bf(e,(e,i)=>i.length===0?r(e):Uf(e,t,Of(n,i,l)));return Mf(u,n,l)},Wf=(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:Rf(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Gf=(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=Df(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o,selections:/* @__PURE__ */ new Map}:e,c=jf(yf(i,(e,t)=>Uf(e,s,Of(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&ff.set(l,[u,...ff.get(i.body)??[]]),Wf({...c,body:l},r.params,i.location)}):t},Kf=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Ef(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t,selections:/* @__PURE__ */ new Map};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Hf(i,e)??e,getQualifiedKey:t=>{let n=Hf(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Wf(r,e.params,r.location)):t}}},qf=e=>e.kind===`Let`&&e.instances!==void 0||pt(e).some(qf),Jf=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=bf(e,e=>Jf(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Pu(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}},Yf=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Xf=(e,t)=>e.definitions.some(e=>qf(e.body))||e.assumptions.some(e=>qf(e.expression))||e.theorems.some(e=>{let t=Yf(e);return t!==void 0&&qf(t)})?{...e,definitions:e.definitions.map(e=>yf(e,e=>Jf(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Jf(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Yf(e);return n===void 0?e:{...e,statement:Jf(n,t,[])}})}:e,Zf=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),Qf={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]}},$f=(e,t)=>{let n=Qf[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},ep={Constant:0,Variable:1,State:1,Action:2,Temporal:3},tp=(e,t)=>`${e}${t}`,np=(e,t,n)=>`${e}${t}${n}`,rp=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},ip=(e,t,n)=>`${e},${t},${n}`,ap=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),op=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),sp=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),cp=(e,t)=>{t.constraints.forEach((t,n)=>op(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>sp(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},X=(e,t,n,r)=>({...ap(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),lp=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,up=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,dp=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=>[e[0],{...X(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),fp=X(`'`,2,[1],[0]),pp=X(`UNCHANGED`,2,[1],[0]),mp=X(`ENABLED`,1,[2],[0]),hp=X(`[]`,3,[3],[0]),gp=X(`<>`,3,[3],[0]),_p=X(`$ConjList`,0,[3],[1]),vp=X(`$DisjList`,0,[3],[1]),yp=X(`$IfThenElse`,0,[3],[1]),bp=X(`$Case`,0,[3],[1]),xp=X(`$BoundedForall`,0,[3],[1]),Sp=X(`$BoundedExists`,0,[3],[1]),Cp=X(`$UnboundedForall`,0,[3],[1]),wp=X(`$UnboundedExists`,0,[3],[1]),Tp=X(`$TemporalForall`,3,[3],[0]),Ep=X(`$TemporalExists`,3,[3],[0]),Dp=X(`$BoundedChoose`,0,[2],[1]),Op=X(`$UnboundedChoose`,0,[2],[1]),kp=X(`$SetEnumerate`,0,[2],[1]),Ap=X(`$Tuple`,0,[2],[1]),jp=X(`$SetOfFcns`,0,[2],[1]),Mp=X(`$CartesianProd`,0,[2],[1]),Np=X(`$SubsetOf`,0,[2],[1]),Pp=X(`$SetOfAll`,0,[2],[1]),Fp=X(`$FcnConstructor`,0,[3],[1]),Ip=X(`$RcdConstructor`,0,[3],[1]),Lp=X(`$SetOfRcds`,0,[2],[1]),Rp=X(`$Except`,0,[2],[1]),zp=X(`$Pair`,0,[3],[1]),Bp=X(`$Seq`,0,[2],[1]),Vp=X(`$FcnApply`,0,[2,2],[1,1]),Hp=X(`$RcdSelect`,0,[2,0],[1,1]),Up=X(`$SquareAct`,2,[2,1],[0,0]),Wp=X(`$AngleAct`,2,[2,1],[0,0]),Gp=X(`$WF`,3,[1,2],[0,0]),Kp=X(`$SF`,3,[1,2],[0,0]),qp=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity,level:0}])]),Jp=e=>e.map(e=>({name:e,arity:0})),Yp=(e,t)=>t.location.range?h(`${e}.`,t.location.range):new s(`${e} at line ${t.location.line}, column ${t.location.column}`),Xp=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Zp=e=>e.kind!==`Let`&&e.kind!==`Label`,Qp=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:r.level,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:b(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=b(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=dp.get(t)??Zf.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=ap(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(np(e,n,t))}),sp(r.argConstraints,tp(e,n),t.data.level),cp(r,t.data)}),r},a=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);t.forEach((t,n)=>{if(t.kind===`Value`&&t.data.level>lp(e,n))throw new s(`Level error in applying operator ${$s(e.name)}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)});let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(ip(t,n,r)),c=ap(Math.max(e.level,...t.filter((t,n)=>up(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{up(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),r.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>op(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||op(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>op(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||op(c.constraints,t,lp(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>op(c.constraints,e,lp(r,a)))}))}),e.argParams.forEach(e=>{let t=rp(e),n=a(t.operator);n?.kind===`Operator`&&op(c.constraints,t.param,lp(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>sp(c.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>sp(c.argConstraints,tp(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&sp(c.argConstraints,tp(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=rp(e),n=a(t.operator);n&&sp(c.argConstraints,tp(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(rp(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=rp(e),n=a(t.operator);if(n)n.kind===`Declared`&&c.argParams.add(np(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(np(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(np(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:y(`LAMBDA`,Jp(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=ap();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:i.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:ap()}}return{kind:`Value`,data:h(e,t)}},c=(e,t)=>e.map(e=>o(e,t)),l=(e,t,n,r=[],i=Ju(r))=>{let o=c(t,qp(n,Jp(i))),l=r.map(e=>h(e.set,n)),u=a(e,o,l,i),d=r[l.findIndex(e=>e.level>2)]?.pattern;if(d){let t=d.ranges?.[0];throw new s(`Level error in applying operator ${e.name}:\nThe level of the range for the bounded variable ${t?g(t):qu(d)[0]} \nexceeds the maximum level allowed by the operator`)}return u},u=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),d=(e,t,n)=>{let r=e.map(e=>e.data.level);if(r.includes(2)&&r.includes(3))throw Yp(`${n} has both temporal formula and action as arguments`,t)},f=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Yp(`Action used where only temporal formula or state predicate allowed`,e);Xp.has(e.operator)&&d(t,e,$s(e.operator))},p=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Zp(n)&&n.kind!==r)throw Yp(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},m=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=h(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=>cp(i,b(e,n))),i},h=(e,t)=>{try{return _(e,t)}catch(t){throw!(t instanceof s)||t.sany?t:Yp(t.message,e)}},_=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return ap();case`Identifier`:return u(r(e.name,t),[]);case`Apply`:{let n=c(e.args,t);return f(e,n),u(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=c(e.operands,t),r=e.kind===`And`;return d(n,e,e.isBulleted?`${r?`Conjunction`:`Disjunction`} list`:r?`\\land`:`\\lor`),a(r?_p:vp,n)}case`Prime`:return l(fp,[e.expression],t);case`Unchanged`:return l(pp,[e.expression],t);case`Enabled`:return l(mp,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return p(e,n.data.level),a(e.kind===`Always`?hp:gp,[n])}case`If`:return l(yp,[e.condition,e.consequent,e.alternative],t);case`Case`:return l(bp,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return m(e,t);case`Forall`:case`Exists`:{let n=l(e.kind===`Forall`?xp:Sp,[e.body],t,e.bounds),r=n.level===3?e.bounds.find(e=>h(e.set,t).level===2):void 0;if(r)throw Yp(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return l(e.isTemporal?e.quantifier===`Forall`?Tp:Ep:e.quantifier===`Forall`?Cp:wp,[e.body],t,[],e.names);case`Choose`:return l(e.set?Dp:Op,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],qu(e.pattern));case`SetEnumeration`:return l(kp,e.elements,t);case`Tuple`:return l(Ap,e.elements,t);case`FunctionSet`:return l(jp,[e.domain,e.range],t);case`Product`:return l(Mp,e.factors,t);case`SetFilter`:return l(Np,[e.predicate],t,[e.bound]);case`SetMap`:return l(Pp,[e.expression],t,e.bounds);case`FunctionConstruction`:return l(Fp,[e.body],t,e.bounds);case`Record`:return l(Ip,e.fields.map(e=>e.value),t);case`RecordSet`:return l(Lp,e.fields.map(e=>e.value),t);case`Except`:return a(Rp,[o(e.function,t),...e.updates.map(e=>({kind:`Value`,data:a(zp,[{kind:`Value`,data:a(Bp,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:ap()}:e.args.length===1?o(e.args[0],t):{kind:`Value`,data:l(Ap,e.args,t)}))},o(e.value,t)])}))]);case`FunctionApplication`:return a(Vp,[o(e.function,t),e.args.length===1?o(e.args[0],t):{kind:`Value`,data:l(Ap,e.args,t)}]);case`Bracket`:return ap();case`FieldAccess`:return a(Hp,[o(e.record,t),{kind:`Value`,data:ap()}]);case`BoxAction`:case`AngleAction`:return l(e.kind===`BoxAction`?Up:Wp,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return l(e.kind===`WeakFairness`?Gp:Kp,[e.subscript,e.action],t);case`Label`:return h(e.body,t);case`Selection`:{let r=e.expression,i=n.get(r);if(i)return i;let a=h(r,t);return n.set(r,a),a}case`Subexpression`:return ap()}},v=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>v(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`:case`Selection`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return pt(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,qp(t,Jp(e.names))),i;default:return xf(e,(e,r)=>a(e,n,qp(t,Jp(r)))),i}},y=(e,t,n,r)=>{let i=qp(r,t),a=h(n,i),o=e=>t.some(t=>t.name===e),s=v(n.kind===`Selection`?n.expression:n,i),c={...ap(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(tp(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(np(e.name,n,t.name))).map(e=>ip(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(rp(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=rp(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},b=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...ap(),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=y(e.name,i,a,n);return t.set(e,o),o};return{analyze:h,analyzeDefinition:b,toOperand:o}},$p=(e,t,n,r=[])=>{let i=new Map(t),a=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,i),a=e.location.range;return t?.level===3&&a&&r.push({location:g(a),message:`Level error:
400
+ Temporal formula used as set.`}),i.set(e.name,{kind:`Formal`,arity:e.arity,level:ep[e.level]}),t?[t]:[]}return[e.kind===`AssumeProve`?$p(e,i,n,r):n.analyze(e,i)]});a.push(n.analyze(e.conclusion,i));let o=ap(Math.max(...a.map(e=>e.level)));return a.forEach(e=>{e.params.forEach(e=>o.params.add(e)),cp(o,e)}),o},em=(e,t,n,r)=>{let i=Qp(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?$p(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=[];t.kind===`Assert`&&t.statement.kind===`AssumeProve`&&$p(t.statement,/* @__PURE__ */ new Map,i,n);let r=()=>o(e)===3,c=t.kind===`Pick`&&t.bounds.length>0&&r()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...n,...l(e.proof),...c,...e.proof?.kind===`Steps`&&r()?s(e.proof):[]]}):[],u=lf([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>{let t=i.analyze(e.expression,/* @__PURE__ */ new Map).level,n=e.location.range;if(t!==0&&n)throw h(`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${t}.`,n)}})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=[],n=e.statement.kind===`AssumeProve`?$p(e.statement,/* @__PURE__ */ new Map,i,t):i.analyze(e.statement,/* @__PURE__ */ new Map),r=[...t,...l(e.proof),...n.level===3?s(e.proof):[]];if(r.length>0)throw c(r)}})),...n],r);if(u.length>0)throw c(u,!1,void 0,r)},tm=1024,nm=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),rm=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),im=/* @__PURE__ */ new Set([...nm,...rm,`Enabled`]),am=/* @__PURE__ */ new Set([`~>`,`-+->`]),om=/* @__PURE__ */ new Set([...am,`\\cdot`]),sm=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),cm=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),lm=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),um=(e,t)=>sm.has(e)||t.builtins.get(e)?.isStateLevel===!0,dm=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(nm.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(rm.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&am.has(e.operator))return 224},o=/* @__PURE__ */ new Map,s=(e,n,c)=>{let l=e.kind;if(l===`Selection`){let t=o.get(e.expression)??0,r=n?c?1:2:c?4:8;if((t&r)!==0)return;o.set(e.expression,t|r)}let u=c?1:513;(im.has(l)||l===`UnboundedQuantifier`&&e.isTemporal===!0||l===`Apply`&&om.has(e.operator))&&(r[0]|=u),im.has(l)&&(r[0]|=16);let d=a(e);n&&d!==void 0&&(r[0]|=d);let f=n&&d===void 0,p=mt(e);if(p!==void 0&&N(e)&&t.variableIndex.has(p)&&(c||(r[0]|=512),f&&(r[0]|=32)),p!==void 0&&!N(e)){let e=t.substitutions.get(p)??p,n=t.definitions.get(e),a=t.constants.has(p),o=t.variableIndex.get(p);if((o!==void 0||t.builtins.get(e)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=u),o!==void 0&&(f&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:f,isOperatorArgument:c||l===`OperatorReference`||l===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{um(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),cm.has(e)&&(r[0]|=8),lm.has(e)&&(r[0]|=256),e===`TLCEval`&&(r[0]|=tm),!a&&um(e,t)&&(r[0]|=16);let n=t.builtins.get(e);f&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}pt(e).forEach(e=>s(e,f,c||l===`Lambda`))};return e.forEach(e=>s(e,!0,!1)),{row:r,edges:i}},fm=(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},pm=1294,mm=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),hm=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=dm(ft(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&pm,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=fm(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=fm(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=fm(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!mm(t[e],l[e*r]|p[e*r])))),h=fm(a,r,m,pm);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&pm:e),words:r}},gm=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?_m(ft(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},_m=(e,t)=>{let n=t.facts.words,r=dm(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=gm(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}mm(e.callee,r[0])||(i[0]|=r[0]&pm)}),i},vm=(e,t)=>!(gm(e,t)[0]&513),ym=(e,t)=>!(gm(e,t)[0]&512),bm={any:2,repeated:4,streamed:8,replayed:260,varying:258},xm=(e,t,n)=>(_m(e,t)[0]&bm[n])!==0,Sm=(e,t,n=`any`)=>(gm(e,t)[0]&bm[n])!==0,Cm=(e,t)=>!!(_m([e],t)[0]&tm),wm=(e,t)=>{let n=gm(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Tm=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},Em=(e,t)=>{let n=_m([e],t);return n[0]&16?void 0:Tm(n)},Dm=(e,t)=>!!(_m([e],t)[0]&1),Om=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),km=()=>({implication:Wy,negate:Gy,equivalent:Ky,body:qy,condition:(e,t)=>{if(typeof e!=`boolean`)throw Dy(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Oy(t,n,e);return e},apply:ma,expectFunction:By,tuple:fi,set:Xr,record:mi,writtenRecord:Sn,equal:_r,enumerate:eb,choiceElements:Nx,noChoice:e=>{throw Px(e)},filterPredicate:Mx,isReducible:dn,finiteElements:e=>F(e).elements,addBounded:sn,normalizedSet:ar,isBeyondBound:cn,cardinality:zi,functionDomain:ui,sortedFunction:or,unassigned:(e,t)=>{throw Fy(e,t)},prime:Qb,keepLazyContext:Vy,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Ry(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Am,jm;const Mm=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Nm=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Pm=e=>`local${e.counter++}`,Fm=(e,t=/* @__PURE__ */ new Set)=>{let n=mt(e);return n!==void 0&&t.add(n),e.kind!==`Selection`&&pt(e).forEach(e=>Fm(e,t)),t},Im=(e,t,n)=>{if(n.locals.size===0)return n.context;let r=Cm(t,e.environment),i=Fm(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=Nm(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},Lm=(e,t,n)=>`${Nm(e,sx(t,e.environment))}(${Im(e,t,n)})`,Rm=(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})`},zm=(e,t,n,r)=>{let i=Pm(e),a=Pm(e),o=Pm(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} }`},Bm=(e,t,n)=>{let r=t.kind===`Forall`;return Rm(e,n,n=>{let i=t.bounds.map(()=>Pm(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(${qm(e,r.set,n)}, ${Nm(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Pm(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${qm(e,t.body,n)}, ${Nm(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>zm(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Vm=(e,t,n,r,i)=>Rm(e,i,i=>{let a=Pm(e),o=Pm(e),s=Nm(e,t),c=`choiceElements(${qm(e,n,i)}, ${s}, ${Nm(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${qm(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${zm(e,a,o,l)} return noChoice(${s});`}),Hm=(e,t,n,r)=>Rm(e,r,r=>{let i=Pm(e),a=Pm(e),o=Pm(e),s=Pm(e),c=Nm(e,t),l=`if (!isReducible(${i})) return ${Nm(e,kx(t,e.environment))}(${i}, ${Im(e,t,r)});`,u=qm(e,t.bound.set,r);r.locals.set(n,s);let d=jx(t,e.environment)?` else break;`:``,f=`if (filterPredicate(${qm(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});${d}`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${zm(e,a,s,f)} return normalizedSet(${o});`}),Um=(e,t,n,r)=>Rm(e,r,r=>{let i=Pm(e),a=Pm(e),o=Pm(e),s=Pm(e),c=Pm(e),l=Pm(e),u=Nm(e,Ex(t,e.environment)),d=Im(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=qm(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${qm(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} = []; ${zm(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Wm=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=qm(e,r[0],n),a=qm(e,r[1],n),o=Nm(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${qm(e,r[0],n)}, ${Nm(e,t)})`;if(t.operator===`<=>`)return`equivalent(${qm(e,r[0],n)}, ${qm(e,r[1],n)}, ${Nm(e,t)})`;if(N(t))return Lm(e,t,n);let i=kb(t.operator,e.environment);if(i?.kind!==`Builtin`)return Lm(e,t,n);if(i.name===`DOMAIN`)return`${Nm(e,jy(t))}(${qm(e,r[0],n)})`;if(i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2)return`${Nm(e,My(t,i.evaluateBinary))}(${qm(e,r[0],n)}, ${qm(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&ux(r[0],a))return`${Nm(e,i.evaluateUnary)}(${qm(e,r[0],n)})`;let o=r.length===2&&ux(r[0],a)&&ux(r[1],a);return i.evaluateBinary&&o?`${Nm(e,i.evaluateBinary)}(${qm(e,r[0],n)}, ${qm(e,r[1],n)})`:Lm(e,t,n)},Gm=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(N(e))return!1;let r=Bb(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Gm(e.expression,t,n);case`FieldAccess`:return Gm(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Gm(e,t,n));default:return!1}},Km=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Km(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Km);default:return!1}},qm=(e,t,n)=>{let r=(t,r=n)=>qm(e,t,r);switch(t.kind){case`Number`:return gn(t.value)?String(t.value):Lm(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(N(t))return Lm(e,t,n);let i=Bb(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Nm(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Nm(e,i.value):Lm(e,t,n)}case`Apply`:return Wm(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Nm(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)}, ${Nm(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{xx(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Gm(t.function,n,e.environment)?r(t.function):Km(t.function)?r(t.function,i):Lm(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Nm(e,t)}))`,o=Ay(e.environment.runtime.version),s=o?`, ${Nm(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`${Nm(e,ky(t))}(${r(t.record)})`;case`Record`:{let i=Ix(t.fields);if(Lx(i))return Lm(e,t,n);let a=Nm(e,i.map(e=>e.name)),o=`[${t.fields.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}, ${Nm(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${Nm(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?Lm(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`)?Bm(e,t,n):Lm(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Vm(e,t,t.set,t.pattern.name,n):Lm(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!Tx(t)?Um(e,t,r.pattern.name,n):Lm(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Hm(e,t,t.bound.pattern.name,n):Lm(e,t,n);default:return Lm(e,t,n)}},Jm=(e,t)=>{if(!Om.has(e.kind)||(jm??=Mm(),!jm))return;let n={environment:t,references:[],helpers:[],counter:0},r=qm(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(`
401
+ `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Am??=km(),Function(...Object.keys(Am),...i,a)(...Object.values(Am),...n.references)},Ym=(e,n,r)=>new t(`Applying ${e} to the following value,\nwhich is not ${n}:\n${P(L(r))}`),Xm=e=>fn(e)?I(e):void 0,Zm=`a function with a finite domain`,Qm=(e,t,n)=>{let r=R(e,t,n),i=Xm(r);if(!i)throw Ym(n,Zm,r);return i},$m=(e,t)=>{let n=R(e,1,t),r=Xm(n),i=r&&rh(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw ws(`second`,t,`bag`,n);return i},eh=(e,t,n)=>{let r=t[n];if(!r||!nh(r))throw ws(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},th=(e,t)=>{if(!un(e)||!yi(e))throw t();return F(e).elements},nh=e=>e.range.every(e=>typeof e==`number`&&e>0),rh=(e,t)=>{let n=e.domain.findIndex(e=>Kr(t,e));return n===-1?void 0:e.range[n]},ih=(e,t)=>{if(typeof e==`number`)return e;throw t()},ah=(e,t,n)=>{let r=ih(e,n)+ih(t,n);if(Ns(r))throw Ps(`${e}+${t}`);return r},oh=(e,t,n,r,i)=>{let a=ih(e.range[t],r),o=rh(n,e.domain[t]);if(o===void 0)return a;let s=a-ih(o,i);if(Ns(s))throw Ps(`${a}-${o}`);return s},sh=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>Kr(t,e[0]));a?a[1]=ah(a[1],n,r):e.push([t,n])},ch=e=>e.domain.map((t,n)=>[t,e.range[n]]),lh=or([],[]),uh=e=>[ks(`EmptyBag`,lh),z(`IsABag`,1,e=>{let t=Xm(R(e,0,`IsABag`));return t!==void 0&&nh(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`),n=Qm(e,0,`BagCardinality`),r=()=>Ym(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return ah(e,t,r)},0)}),z(`BagIn`,2,e=>{let t=$m(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>$m(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>Xm(R(e,t,`(+)`))),n=eh(e,t,0),r=eh(e,t,1),i=ch(n),a=()=>ws(`second`,`(+)`,`bag`,R(e,1,`(+)`));return r.domain.forEach((e,t)=>sh(i,e,r.range[t],a,n.domain.length)),ti(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=Xm(t),i=Xm(n);if(!r)throw ws(`first`,`(-)`,`bag`,t);if(!i)throw ws(`second`,`(-)`,`bag`,n);let a=()=>ws(`first`,`(-)`,`bag`,t),o=()=>ws(`second`,`(-)`,`bag`,n);return ti(r.domain.flatMap((e,t)=>{let n=oh(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,e=>{let n=R(e,0,`BagUnion`),r=th(n,()=>Ym(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??lh;let i=()=>new t(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${P(L(n))}`),a=e=>{let t=Xm(e);if(!t)throw i();return t},o=ch(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>sh(o,e,t.range[n],i))}),ti(o)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=Xm(t),i=Xm(n);if(!r)throw Ym(`\\sqsubseteq`,Zm,t);if(!i)throw Ym(`\\sqsubseteq`,Zm,n);let a=()=>Ym(`\\sqsubseteq`,`a bag`,t),o=()=>Ym(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=rh(i,e);return ih(r.range[t],a)<=(n===void 0?0:ih(n,o))})}),As(`BagOfAll`,2,e=>{let t=Os(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=Xm(n);if(!r)throw ws(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>ws(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>sh(i,t.call([e]),r.range[n],a)),ti(i)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!fn(n))throw new T(`Attempted to apply the operator DOMAIN to a non-function\n(${Bs(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=I(n),i=F(Xr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new T(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Yr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>or(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>ga(Qm(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=th(t,()=>Ym(`BagToSet`,Zm,t));return or([...n],n.map(()=>1))})],dh={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},Z={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},fh={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},ph=[{lower:`true`,upper:`TRUE`,token:Z.true},{lower:`false`,upper:`FALSE`,token:Z.false},{lower:`null`,upper:`NULL`,token:Z.null}],mh=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
402
+ `],[`r`,`\r`],[`f`,`\f`]]),hh=1024,gh=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=Z.none,s=0,c=[dh.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===dh.emptyArray||e===dh.nonemptyArray?`[${u[t]}]`:e===dh.emptyDocument||e===dh.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new T(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
403
+ See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new T(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
404
+ `.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
405
+ `){r++,i=n;return}if(t===`\r`)return}},v=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
406
+ `)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},y=()=>{for(;n<e.length;){let t=e[n++];if(t===`
407
+ `)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},b=()=>{let e=y();if(e===void 0)throw m();return e},x=()=>{let t=ph.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return Z.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return Z.none}return n+r<e.length&&g(e[n+r])?Z.none:(n+=r,t.token)},S=()=>{let t=fh.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===hh)return Z.none;let a=e[n+i];if(a===`-`){if(t===fh.none)t=fh.sign;else if(t===fh.exponentE)t=fh.exponentSign;else return Z.none}else if(a===`+`){if(t!==fh.exponentE)return Z.none;t=fh.exponentSign}else if(a===`e`||a===`E`){if(t!==fh.digit&&t!==fh.fractionDigit)return Z.none;t=fh.exponentE}else if(a===`.`){if(t!==fh.digit)return Z.none;t=fh.decimal}else if(a<`0`||a>`9`){if(g(a))return Z.none;break}else if(t===fh.sign||t===fh.none)r=a===`0`,t=fh.digit;else if(t===fh.digit){if(r)return Z.none}else t===fh.decimal?t=fh.fractionDigit:(t===fh.exponentE||t===fh.exponentSign)&&(t=fh.exponentDigit)}return i===hh||t!==fh.digit&&t!==fh.fractionDigit&&t!==fh.exponentDigit?Z.none:(s=i,Z.number)},ee=()=>{let t=c.length-1,r=c[t];if(r===dh.emptyArray)c[t]=dh.nonemptyArray;else if(r===dh.nonemptyArray){let e=b();if(e===`]`)return Z.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===dh.emptyObject||r===dh.nonemptyObject){if(c[t]=dh.danglingName,r===dh.nonemptyObject){let e=b();if(e===`}`)return Z.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=b();if(e===`"`)return Z.doubleQuotedName;if(e===`'`)return h(),Z.singleQuotedName;if(e===`}`){if(r!==dh.nonemptyObject)return Z.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return Z.unquotedName;throw p(`Expected name`)}else if(r===dh.danglingName){c[t]=dh.nonemptyObject;let r=b();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===dh.emptyDocument){if(y()===void 0)return Z.eof;n--,e.startsWith(`)]}'
408
+ `,n)&&(n+=5),c[t]=dh.nonemptyDocument}else if(r===dh.nonemptyDocument){if(y()===void 0)return Z.eof;h(),n--}let i=y();if(i===void 0){if(r===dh.emptyDocument)return Z.eof;throw m()}if(i===`]`&&r===dh.emptyArray)return Z.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==dh.emptyArray&&r!==dh.nonemptyArray)throw p(`Unexpected value`);return h(),n--,Z.null}if(i===`'`)return h(),Z.singleQuoted;if(i===`"`)return Z.doubleQuoted;if(i===`[`)return Z.beginArray;if(i===`{`)return Z.beginObject;n--;let a=x();if(a!==Z.none)return a;let o=S();if(o!==Z.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),Z.unquoted},C=()=>(o===Z.none&&(o=ee()),o),te=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=mh.get(t);if(a!==void 0)return a;if(t===`
409
+ `)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},w=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+te(),o=n):s===`
410
+ `&&(r++,i=n)}throw p(`Unterminated string`)},ne=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},E=e=>{if(c.length-1>=255)throw new T(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=Z.none},re=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=Z.none},ie=()=>{let e=C();return e!==Z.endObject&&e!==Z.endArray&&e!==Z.eof},ae=()=>{let e=C(),t=e===Z.unquotedName?ne():w(e===Z.singleQuotedName?`'`:`"`);return o=Z.none,l[c.length-1]=t,t},oe=t=>t===Z.true||t===Z.false?t===Z.true:t===Z.null?null:t===Z.number?(n+=s,{literal:e.slice(n-s,n)}):t===Z.unquoted?ne():w(t===Z.singleQuoted?`'`:`"`),se=()=>{let e=C();if(e===Z.beginArray){E(dh.emptyArray);let e=[];for(;ie();)e.push(se());return re(),e}if(e===Z.beginObject){E(dh.emptyObject);let e=/* @__PURE__ */ new Map;for(;ie();)e.set(ae(),se());return re(),e}let t=oe(e);return o=Z.none,u[c.length-1]++,t};if(C()===Z.eof)return null;let ce=se();return a=!1,ce!==null&&C(),ce},_h=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),vh=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),yh=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),bh=e=>{if(!fn(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?pi(n):void 0},xh=(e,t)=>{let n=`tlc2.value.impl.${zs(e)}`,r=`tlc2.value.impl.${t}`;return new T(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Sh=e=>new T(`Cannot convert value: unsupported value type tlc2.value.impl.${zs(e)}`),Ch=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),wh=e=>`[${e.map(Oh).join(`,`)}]`,Th=e=>`{${xn(e).map(e=>`${Ch(typeof e[0]==`string`?e[0]:L(e[0]))}:${Oh(e[1])}`).join(`,`)}}`,Eh=e=>{let t=I(e),n=Wi(t);return n?wh(n):Th(t)},Dh=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Oh=e=>typeof e==`string`?Ch(e):typeof e==`object`?e.kind===`ModelValue`?Ch(e.name):zs(e)===`RecordValue`?Th(I(e)):kh(e):String(e),kh=e=>{let t=zs(e);if(t===`TupleValue`)return wh(I(e).range);if(Dh(t))return Eh(e);if(hi(e))return wh(F(e).elements);throw Sh(e)},Ah=e=>e.map(e=>`${Oh(e)}\n`).join(``),jh=e=>{let t=zs(e);if(t===`RecordValue`)return Th(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Oh(e)}`).join(`,`)}}`;if(Dh(t))return Eh(e);throw Sh(e)},Mh=e=>{if(e===null)throw new T(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Un(e);if(Array.isArray(e))return fi(e.map(Mh));if(e instanceof Map)return pi([...e].map(e=>[Un(e[0]),Mh(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||Ns(t))throw new T(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Nh=e=>{if(typeof e!=`string`)throw new T(`Cannot cast tlc2.value.impl.${zs(e)} to tlc2.value.impl.StringValue`);return e},Ph=(e,t)=>{let n=ma(e,t);if(typeof n!=`string`)throw xh(n,`StringValue`);return n},Fh=e=>{if(!vh.has(e.toLowerCase()))throw yh.has(e.toLowerCase())?new p(`IOUtils!Serialize does not support the charset ${e}`):new T(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Ih=(e,t,n,r)=>{let i=n.find(e=>!_h.has(e));if(i!==void 0)throw new T(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new T(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new T(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new p(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new T(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new T(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},Lh=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Rh=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new T(`${t} (No such file or directory)`);return n},zh=e=>[Hs(js(`ToJson`,1,e=>Un(Oh(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Hs(js(`ToJsonArray`,1,e=>Un(kh(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Hs(js(`ToJsonObject`,1,e=>Un(jh(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Hs(js(`JsonSerialize`,2,t=>{let n=Nh(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!Wi(r)&&!bh(r))throw ws(`second`,`JsonSerialize`,`sequence or record`,r);return Lh(e,n),e.writeFile?.(n,Oh(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`),Hs(js(`ndJsonSerialize`,2,t=>{let n=Nh(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=Wi(r);if(!i)throw ws(`second`,`ndJsonSerialize`,`sequence`,r);return Lh(e,n),e.writeFile?.(n,Ah(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`),Hs(js(`JsonDeserialize`,1,t=>Mh(gh(Rh(e,Nh(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Hs(js(`ndJsonDeserialize`,1,t=>fi(Rh(e,Nh(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Mh(gh(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Bh=(e,t)=>[Hs(Js(`Serialize`,3,(n,r)=>{let i=Ys(n,2,`Serialize`)(),a=bh(i);if(!a)throw ws(`third`,`ndJsonSerialize`,`sequence`,i);if(Ph(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ys(n,0,`Serialize`)(),s=Wi(o);if(!s)throw ws(`first`,`Serialize`,`sequence`,o);let c=Ys(n,1,`Serialize`)();if(typeof c!=`string`)throw ws(`second`,`ndJsonSerialize`,`sequence`,c);let l=ma(a,`openOptions`);if(zs(l)!==`TupleValue`)throw xh(l,`TupleValue`);let u=Ph(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw xh(e,`StringValue`);return e});return Fh(u),Ih(e,c,d,Ah(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)`)],Vh={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Hh=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=rr(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(Vh.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(Vh.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(Vh.boolean),o(+!!e);return}if(typeof e==`number`){o(Vh.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(Vh.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(Vh.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),un(e)){let t=F(e).elements;o(Vh.set),c(t.length),t.forEach(f);return}let p=I(e),m=lr(e);m===`tuple`?(o(Vh.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(Vh.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(Vh.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ie(Uint8Array.from(t))},Uh=e=>[Hs(js(`_TLCTraceSerialize`,2,t=>{let n=Nh(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Hh(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`)],Wh=25214903917n,Gh=(1n<<48n)-1n,Kh=e=>{let t=(BigInt.asUintN(64,e)^Wh)&Gh,n=e=>(t=t*Wh+11n&Gh,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^Wh)&Gh},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}},qh=[],Jh=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Yh=()=>{for(let e=1277011;qh.length<1341;e++)Jh(e)&&qh.push(e);return qh},Xh=e=>{let t=Yh(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},Zh=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},Qh=e=>{for(let t=Math.max(e,9);;t++){let e=Zh(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)}}},$h=(e,t,n)=>{if(t<=0)return[];let r=Qh(t),i=BigInt(n.nextInt(t)),a=BigInt(Xh(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},eg=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:en),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},tg=(1n<<63n)-1n-24n,ng=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(tg*BigInt(n)+i)%t;return r<0n?r+t:r})},rg=(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,ig=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=ui(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>or(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>pi(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:fi}}},ag=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,og=(e,t,n,r)=>{if(Ii(t))return[];let i=r===`1.7.4`?eg:$h;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=ag(t,r)?void 0:ig(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?ng(e,t,n):i(e,Number(t),n)).map(e=>a.create(rg(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},sg=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Ts(e.domain,`RandomElement`,e).elements];return or(n,n.map(()=>sg(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return pi(e.names.map((n,r)=>[n,sg(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return fi(e.factors.map(e=>sg(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new T(`Attempted to retrieve out-of-bounds element from the interval value ${P(L(e))}.`);return e.low+r}let n=Ts(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new T(`Index ${r} out of bounds for length ${n.length}`);return n[r]},cg=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ws(t,n,`nonnegative integer`,e);return e},lg=(e,t,n,r)=>Yr(Array.from({length:t},()=>Yr(e.filter(()=>r.nextDouble()<n)))),ug=(e,t)=>{let n=`RandomSetOfSubsets`,r=cg(R(e,0,n),`first`,n),i=cg(R(e,1,n),`second`,n),a=R(e,2,n);if(!un(a)||!yi(a))throw ws(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw ws(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ws(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return lg(o,r,o.length===0?0:i/o.length,t.getRandom())},dg=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,fg=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,pg=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(dg.test(t))return Number(t.replace(/[fFdD]$/,``));let n=fg.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},mg=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=cg(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw ws(`second`,n,`string literal representing a probability`,i);let a=pg(i);if(a===void 0||a<0||a>1)throw ws(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!un(o)||Kn(o)||!Vi(o))throw ws(`third`,n,`finite set`,o);let s=zi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ws(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return lg(F(o).elements,r,a,e.getRandom())}),hg=e=>[Hs(z(`RandomSubset`,2,t=>{let n=cg(R(t,0,`RandomSubset`),`first`,`RandomSubset`),r=R(t,1,`RandomSubset`);if(!hi(r)||!Vi(r))throw ws(`second`,`RandomSubset`,`a finite set`,r);let i=ag(r,e.version);if(i&&i.reduce((e,t)=>e*F(t).elements.length,1)>an())throw new T(on());return Yr(og(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,t=>ug(t,e)),z(`TestRandomSetOfSubsets`,3,t=>fi(Array.from({length:5},()=>F(ug(t,e)).elements.length)))],gg=(e,t=0n)=>{let n=Kh(t),r=Kh(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>pi([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Eo,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)},reseedRandom:()=>{i=void 0},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},_g=e=>ti([...e.possibleCounts].map(e=>[e[0],e[1]])),vg=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,_g(e)]]),yg=e=>pi([[`name`,e??`UnnamedAction`],[`location`,pi([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),bg=/* @__PURE__ */ new WeakSet,xg=e=>cr(ni(e),`record`),Sg=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(Un);let r=[[`action`,Yr(e)],[`state`,Yr(t)]],i=xg(n?r:[...r,[`console`,!1]]);return bg.add(i),i},Cg=(e,t,n,r=!0)=>{let i=e.map((e,t)=>fi([t+1,pi(Object.entries(e))])),a=i.slice(1).map((e,n)=>fi([i[n],t[n],e])),o=n?[fi([i[i.length-1],n.action,i[n.start]])]:[];return Sg([...a,...o],i,r)},wg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return vg(e).get(t)},Tg=(e,n,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0||!e.pause)return;n(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new t(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${P(L(r))}`)},Eg=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:Q(e),Dg=e=>e.every(e=>e!==void 0),Og=(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&&!N(e);if(i&&t.variableIndex.has(r))return 1;let a=pt(e).map(e=>Og(e,t,n)),o=i?Jy(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Og(o.body,t,n))),Math.max(0,...a)},kg=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Js(`AssertError`,2,e=>{let t=Os(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new T(`In computing AssertError, a non-string expression (${Eg(t)}) was used as the err of an AssertError(err, exp).`);let r=Ys(e,0,`AssertError`)();try{Ys(e,1,`AssertError`)()}catch(e){if(e instanceof T)return Lt(e.message,n.isTool)===r;throw e}return!1}),js(`TLCGetOrDefault`,2,e=>wg(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),js(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Dg(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new T(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?fi(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return pi(i===void 0?r:[[`_action`,i],...r])})):fi([pi([])])}),js(`CounterExample`,0,()=>n.counterExample??Sg([],[])),z(`ToTrace`,1,e=>{let n=R(e,0,`ToTrace`);if(typeof n!=`object`||!bg.has(n))throw new t(`The argument of ToTrace should be a CounterExample, but instead it is:\n${P(L(n))}`);let r=F(ma(n,`state`)).elements.map(e=>Wi(e)??[]);return fi(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let n=R(e,0,`TLCModelValue`);if(typeof n!=`string`)throw new t(`The argument of ModelValue should be a string, but instead it is:\n${P(L(n))}`);return nr(n)}),Js(`TLCDefer`,1,(e,t)=>{let r=Os(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{$(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Js(`PickSuccessor`,1,(t,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!Dg(i)||r?.next&&n.isSeen(i)))return!0;let a=Os(t,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new T(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Bs(o)}) was used as the condition of an IF.\n${a.expression?Eg(a.expression):``}`);if(o||!r?.next||!Dg(i)||!r.state||!Dg(r.state))return!0;let s=r.state,c=n.getSuccessorAction(s,i),l=t=>e(Et(n.isTool,Ct.moduleOverrideStdout,wt.none,t));for(;;){l(`Extend behavior of length ${n.getLevel(s)} with a "${c?.name}" step [<Action ${c?.location.range&&g(c.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new E;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)l(`${Xa(n.toRecord(s)).trimEnd()}\n~>\n${Xa(n.toRecord(i)).trimEnd()}`);else if(e[0]===`d`)l(Xa(n.toRecord(i),n.toRecord(s)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(i),!0;if(n.getSimulationValue===void 0)throw new p(`tla-ts can't mark a state explored while it searches depth first.`);l(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},Js(`TLCCache`,2,(e,t)=>{let i=Os(e,0,`TLCCache`),o=Fa(Ys(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Og(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=Ea(t);if(n)throw n;return Number(BigInt.asIntN(32,Eo([t])))}),Js(`TLCEvalDefinition`,1,(e,n)=>{let r=Ys(e,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new t(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${P(L(r))}`);let i=n?Jy(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 t(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${P(L(r))}`);if(i.kind===`Operator`&&i.params.length>0){let e=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new t(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${e.join(`, `)})`)}return i.kind===`Operator`?$(i.body,n):$({kind:`Identifier`,name:r,location:i.location},n)})]},Ag=(e,t)=>[js(`_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}),js(`_Counts`,0,()=>_g(t)),js(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(_g(t),!0)),!1)}),js(`_PrintCounts`,0,()=>(e(L(_g(t),!0)),!0))],jg=e=>`${e.getUTCFullYear()}.${Rt(e.getUTCMonth()+1)}.${Rt(e.getUTCDate())}.${Rt(e.getUTCHours())}${Rt(e.getUTCMinutes())}${Rt(e.getUTCSeconds())}`,Mg=e=>ti([...e].map(e=>[e[0],fi([e[1]])])),Ng=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Pg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Fg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Ig=(e,n,r)=>{if(e.version===`1.7.4`?!Pg.has(n)||!e.isStarted&&Fg.has(n):!e.isStarted&&Ng.has(n))throw new t(`TLCGet(${n}) was undefined.`);let i=e.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-e.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return a;case`stats`:return xg([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,a],[`worker`,0]]);case`config`:return xg([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,$a()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return xg([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Un(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Un(jg(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return yg(void 0);case`all`:return Mg(e.registers);case`all:named`:return Mg(vg(e))}if(n.startsWith(`s:`)){let r=vg(e).get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Un(e.properties.get(n.slice(2))??n);throw new t(`TLCGet(${n}) was undefined.`)},Lg=(e,n,r)=>{if(typeof n==`number`&&n>=0){let r=e.registers.get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new t(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${P(L(n))}`);return Ig(e,n,r?.state)},Rg=e=>e.length===0?[[]]:e.flatMap((t,n)=>Rg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),zg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach(zg),e.kind===`Function`&&e.range.forEach(zg))},Bg=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:or(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},Vg=(e,n)=>[z(`Print`,2,t=>(e(Ka([R(t,0,`Print`),R(t,1,`Print`)]).map(P).join(` `)),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(P(Ka([R(t,0,`PrintT`)])[0])),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new t(`The first argument of Assert evaluated to FALSE; the second argument was:\n${P(L(R(e,1,`Assert`)))}`,C.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ti([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=fn(t)?I(t):void 0,i=fn(n)?I(n):void 0;if(!r)throw ws(`first`,`@@`,`function`,t);if(!i)throw ws(`second`,`@@`,`function`,n);let a=bn(r),o=bn(i).filter(e=>!a.some(t=>Kr(e[0],t[0])));return ni([...a,...o])}),z(`ToString`,1,e=>Un(L(R(e,0,`ToString`),!0))),{...Js(`TLCEval`,1,(e,t)=>{let n=Bg(Ys(e,0,`TLCEval`)());return t===void 0&&zg(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=Ts(R(e,0,`Permutations`),`Permutations`).elements;return Yr(Rg(t).map(e=>ti(t.map((t,n)=>[t,e[n]]))))}),As(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=Wi(t);if(!n)throw ws(`first`,`SortSeq`,`natural number`,t);let r=Os(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ws(`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)}),fi(a)}),n.version===`1.7.4`?Hs({...js(`TLCGet`,1,(e,t)=>Lg(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Hs(Js(`TLCGet`,1,(e,t)=>Lg(n,Ys(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)`),js(`TLCSet`,2,t=>(Tg(n,e,R(t,0,`TLCSet`),R(t,1,`TLCSet`)),!0)),ks(`Any`,Xn),z(`RandomElement`,1,e=>sg(R(e,0,`RandomElement`),n.getRandom()))],Hg=`----------------------------- MODULE Bags --------------------------------
458
411
  (**************************************************************************)
459
412
  (* A bag, also called a multiset, is a set that can contain multiple *)
460
413
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -607,7 +560,7 @@ CopiesIn(e, B) ==
607
560
  7 Dec 98 : Corrected error found by Stephan Merz.
608
561
  6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
609
562
  5 Dec 98 : Initial version.
610
- `,xh=/* @__PURE__ */ new Map([[`Bags`,bh],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
563
+ `,Ug=/* @__PURE__ */ new Map([[`Bags`,Hg],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
611
564
  (***************************************************************************)
612
565
  (* The two definitions in this standard module are overridden by TLC in *)
613
566
  (* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
@@ -863,7 +816,52 @@ TestRandomSetOfSubsets(k, n, S) ==
863
816
  [i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
864
817
 
865
818
  =============================================================================
866
- `],[`RealTime`,`${Xe}\n`],[`Reals`,`${Ye}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
819
+ `],[`RealTime`,`----------------------------- MODULE RealTime -------------------------------
820
+ (***************************************************************************)
821
+ (* This standard module is described in Chapter 9 of the book "Specifying *)
822
+ (* Systems". The type of specification described there cannot be handled *)
823
+ (* by the TLC model checker. *)
824
+ (***************************************************************************)
825
+ EXTENDS Reals
826
+ VARIABLE now
827
+
828
+ RTBound(A, v, D, E) ==
829
+ LET TNext(t) == t' = IF <<A>>_v \\/ ~(ENABLED <<A>>_v)'
830
+ THEN 0
831
+ ELSE t + (now'-now)
832
+
833
+ Timer(t) == (t=0) /\\ [][TNext(t)]_<<t, v, now>>
834
+
835
+ MaxTime(t) == [](t \\leq E)
836
+
837
+ MinTime(t) == [][A => t \\geq D]_v
838
+ IN \\EE t : Timer(t) /\\ MaxTime(t) /\\ MinTime(t)
839
+ -----------------------------------------------------------------------------
840
+ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
841
+ /\\ UNCHANGED v
842
+ IN /\\ now \\in Real
843
+ /\\ [][NowNext]_now
844
+ /\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
845
+ =============================================================================
846
+ `],[`Reals`,`-------------------------------- MODULE Reals -------------------------------
847
+ (***************************************************************************)
848
+ (* This module provides dummy definitions of the operators that are *)
849
+ (* defined by the real Reals module. It is expected that any tool that *)
850
+ (* handles specifications that use real numbers will provide its own *)
851
+ (* implementations of these operators. TLC currently does not handle real *)
852
+ (* numbers and produces an error if a specification requires TLC to *)
853
+ (* evaluate the operators defined here or to evaluate any operator defined *)
854
+ (* in the Integers module that is applied to non-integer real numbers. *)
855
+ (* *)
856
+ (* See the book "Specifying Systems" for the real Reals module. *)
857
+ (***************************************************************************)
858
+ EXTENDS Integers
859
+
860
+ Real == "Reals"
861
+ a / b == CHOOSE m \\in Real : m * b = a
862
+ Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
863
+ =============================================================================
864
+ `],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
867
865
  (***************************************************************************)
868
866
  (* Defines operators on finite sequences, where a sequence of length n is *)
869
867
  (* represented as a function whose domain is the set 1..n (the set *)
@@ -1267,7 +1265,34 @@ TLCEvalDefinition(definitionName) ==
1267
1265
  TRUE \\* TODO
1268
1266
 
1269
1267
  ============================================================================
1270
- `],[`Toolbox`,`${Ze}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1268
+ `],[`Toolbox`,`----------------------------- MODULE Toolbox --------------------------------
1269
+ (***************************************************************************)
1270
+ (* *)
1271
+ (***************************************************************************)
1272
+ LOCAL INSTANCE Naturals \\* a + b
1273
+ LOCAL INSTANCE FiniteSets \\* Cardinality
1274
+ LOCAL INSTANCE TLC \\* TLCGet
1275
+
1276
+ -----------------------------------------------------------------------------
1277
+
1278
+ (* Trace Exploration *)
1279
+
1280
+ _TETrace ==
1281
+ CHOOSE f \\in [ (Nat \\ {0}) -> STRING ] : TRUE
1282
+
1283
+ LOCAL _TETraceLength == Cardinality(DOMAIN _TETrace)
1284
+
1285
+ \\* When evaluated as part of a TLC ALIAS expression, \`_TEPosition\` should be
1286
+ \\* redefined as \`TLCGet("level"), or replace with \`TLCGet(level)\` right away.
1287
+ \\* The definition below accounts for several "peculiarities" of the
1288
+ \\* Toolbox's trace exploration.
1289
+ _TEPosition ==
1290
+ IF TLCGet("level") >= _TETraceLength
1291
+ THEN _TETraceLength
1292
+ ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
1293
+
1294
+ =============================================================================
1295
+ `],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1271
1296
  LOCAL INSTANCE TLC
1272
1297
  LOCAL INSTANCE TLCExt
1273
1298
  LOCAL INSTANCE GraphViz
@@ -1667,7 +1692,7 @@ _TLCTrace ==
1667
1692
  /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1668
1693
 
1669
1694
  =============================================================================
1670
- `]]),Sh=new Map([...[...xh].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,bh.replace(`
1695
+ `]]),Wg=new Map([...[...Ug].filter(e=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e[0])),[`Bags`,Hg.replace(`
1671
1696
  LOCAL INSTANCE Naturals
1672
1697
  `,`
1673
1698
  EXTENDS TLC
@@ -1759,7 +1784,12 @@ _TEPosition ==
1759
1784
  ELSE TLCGet("level") + 1
1760
1785
 
1761
1786
  =============================================================================
1762
- `]]),Ch=(e=`master`)=>e===`1.7.4`?Sh:xh,wh=(e,t,r)=>new n(`Applying ${e} to the following value,\nwhich is not ${t}:\n${L(r)}`),Th=e=>j(e)?I(e):void 0,Eh=(e,t,n)=>{let r=R(e,t,n),i=Th(r);if(!i)throw wh(n,`a function with a finite domain`,r);return i},Dh=(e,t,n)=>{let r=R(e,t,n),i=Th(r);if(!i)throw gi(t===0?`first`:`second`,n,`bag`,r);return i},Oh=(e,t)=>{if(!A(e)||!N(e))throw t();return P(e).elements},kh=e=>e.range.every(e=>typeof e==`number`&&e>0),Ah=(e,t)=>{let n=e.domain.findIndex(e=>Xt(e,t));return n===-1?void 0:e.range[n]},jh=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Mh=jh(`BagDiff`,`tlc2.value.impl.Value`,2),Nh=jh(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Ph=jh(`BagUnion`,`tlc2.value.impl.Value`,1),Fh=jh(`BagOfAll`,`tlc2.value.impl.Value`,2),Ih=jh(`BagCup`,`tlc2.value.impl.Value`,2),Lh=jh(`BagCardinality`,`tlc2.value.impl.IntValue`,1),Rh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Ii(e)}`;throw Ri(t,`class ${n} cannot be cast to class tlc2.value.impl.IntValue (${n} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},zh=(e,t,n)=>{let r=Rh(e,n)+Rh(t,n);if(Ai(r))throw ji(`${e}+${t}`);return r},Bh=(e,t,n,r)=>{let i=Ah(n,e.domain[t]),a=Rh(e.range[t],r);return i===void 0?a:a-Rh(i,r)|0},Vh=(e,t)=>Rn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>Xt(e[0],r));a?a[1]=zh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),Hh=zt([],[]),Uh=e=>[Ei(`EmptyBag`,Hh),z(`IsABag`,1,e=>{let t=Th(R(e,0,`IsABag`));return t!==void 0&&kh(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return Eh(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw wh(`BagCardinality`,`a bag`,t);return zh(e,n,Lh)},0)}),z(`BagIn`,2,e=>{let t=R(e,1,`BagIn`),n=Ah(Eh(e,1,`BagIn`),R(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw gi(`second`,`BagIn`,`bag`,t);return n>0}),z(`CopiesIn`,2,e=>{let t=R(e,1,`CopiesIn`),n=Ah(Eh(e,1,`CopiesIn`),R(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw gi(`second`,`CopiesIn`,`bag`,t);return n}),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Dh(e,t,`(+)`);if(!kh(n))throw gi(t===0?`first`:`second`,`(+)`,`bag`,R(e,t,`(+)`));return n});return Vh(t,Ih)}),z(`\\ominus`,2,e=>{let t=Dh(e,0,`(-)`),n=Dh(e,1,`(-)`);return Rn(t.domain.flatMap((e,r)=>{let i=Bh(t,r,n,Mh);return i>0?[[e,i]]:[]}))}),z(`BagUnion`,1,e=>{let t=R(e,0,`BagUnion`),r=Oh(t,()=>wh(`BagUnion`,`a finite enumerable set`,t));if(r.length<2)return r[0]??Hh;let i=r.map(e=>{let r=Th(e);if(!r)throw new n(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(t)}`);return r});return Vh(i,Ph)}),z(`\\sqsubseteq`,2,e=>{let t=Eh(e,0,`\\sqsubseteq`),n=Eh(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>Bh(t,r,n,Nh)<=0)}),Di(`BagOfAll`,2,e=>{let t=Ti(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new n(`The first argument of BagOfAll should be an operator, but instead it is:\n${L(t.literalBody)}`);let r=R(e,1,`BagOfAll`),i=Th(r);if(!i)throw gi(`second`,`BagOfAll`,`function with a finite domain`,r);return Vh(i.domain.map((e,n)=>zt([t.call([e])],[i.range[n]])),Fh)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!j(n))throw new m(`DOMAIN expects a function but received ${L(n)}`);let r=I(n),i=Mn(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new m(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Mn(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>zt(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>zr(Eh(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=Oh(t,()=>wh(`BagToSet`,`a function with a finite domain`,t));return zt([...n],n.map(()=>1))})],Wh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,Gh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,Kh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,qh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Jh=`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`,Xh=e=>{if(!j(e))return!1;let t=I(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Zh=(e,t)=>Ri(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ii(t)}`),Qh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),$h=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Zh(t,e);return`[${P(e).elements.map(e=>tg(e,t)).join(`,`)}]`},eg=(e,t)=>{let n=I(e),r=Sr(n);return r?`[${r.map(e=>tg(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Qh(typeof e==`string`?e:L(e))}:${tg(n.range[r],t)}`).join(`,`)}}`},tg=(e,t)=>typeof e==`string`?Qh(e):typeof e==`object`?e.kind===`ModelValue`?Qh(e.name):A(e)?$h(e,t):eg(e,t):String(e),ng=e=>{if(A(e))return $h(e,Wh);if(!j(e)||Xh(e))throw Zh(Wh,e);return eg(e,Wh)},rg=e=>{if(!j(e))throw Zh(Gh,e);return eg(e,Gh)},ig=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))},ag=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return Dt(e);if(Array.isArray(e))return Yn(e.map(e=>ag(e,t)));if(typeof e==`object`&&e)return Xn(Object.entries(e).map(([e,n])=>[Dt(e),ag(n,t)]));throw Ri(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},og=(e,t)=>{if(e.trim()===``)return ag(null,t);try{return ag(JSON.parse(e,(e,t,n)=>typeof t==`number`?ig(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ri(t,e.message):e}},sg=(e,t)=>{if(typeof e!=`string`)throw Ri(t,`Cannot cast tlc2.value.impl.${Ii(e)} to tlc2.value.impl.StringValue`);return e},cg=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ri(n,`${t} (No such file or directory)`);return r},lg=e=>[Oi(`ToJson`,1,e=>Dt(tg(R(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Oi(`ToJsonArray`,1,e=>Dt(ng(R(e,0,`ToJsonArray`)))),Oi(`ToJsonObject`,1,e=>Dt(rg(R(e,0,`ToJsonObject`)))),Oi(`JsonSerialize`,2,t=>{let n=sg(R(t,0,`JsonSerialize`),Kh),r=R(t,1,`JsonSerialize`);if(!Sr(r)&&!Xh(r))throw gi(`second`,`JsonSerialize`,`sequence or record`,r);return e.writeFile?.(n,tg(r,Kh)),!0}),Oi(`ndJsonSerialize`,2,t=>{let n=sg(R(t,0,`ndJsonSerialize`),qh),r=R(t,1,`ndJsonSerialize`),i=Sr(r);if(!i)throw gi(`second`,`ndJsonSerialize`,`sequence`,r);return e.writeFile?.(n,i.map(e=>`${tg(e,qh)}\n`).join(``)),!0}),Oi(`JsonDeserialize`,1,t=>{let n=sg(R(t,0,`JsonDeserialize`),Jh);return og(cg(e,n,Jh),Jh)}),Oi(`ndJsonDeserialize`,1,t=>{let n=sg(R(t,0,`ndJsonDeserialize`),Yh);return Yn(cg(e,n,Yh).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>og(e,Yh)))})],ug=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,dg=1e6,fg=(e,t,n)=>{if(typeof e!=`number`||e<0)throw gi(t,n,`nonnegative integer`,e);return e},pg=(e,t,n,r)=>Mn(Array.from({length:t},()=>Mn(e.filter(()=>r.nextDouble()<n)))),mg=(e,t)=>{let n=`RandomSetOfSubsets`,r=fg(R(e,0,n),`first`,n),i=fg(R(e,1,n),`second`,n),a=R(e,2,n);if(!A(a)||!N(a))throw gi(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw gi(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw gi(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return pg(o,r,o.length===0?0:i/o.length,t.getRandom())},hg=e=>[Oi(`RandomSubset`,2,t=>{let n=R(t,0,`RandomSubset`);if(typeof n!=`number`)throw gi(`first`,`RandomSubset`,`nonnegative integer`,n);if(n<0)throw Ri(ug,String(n));let r=R(t,1,`RandomSubset`);if(!A(r)||!F(r)&&!N(r))throw gi(`second`,`RandomSubset`,`a finite set`,r);let i=ph(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>dg)throw Ri(ug,`Attempted to construct a set with too many elements (>${dg}).`);return Mn(mh(n,r,e.getRandom(),e.version))}),Oi(`RandomSetOfSubsets`,3,t=>mg(t,e)),Oi(`TestRandomSetOfSubsets`,3,t=>Yn(Array.from({length:5},()=>P(mg(t,e)).elements.length)))],gg=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,_g=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${gg})`,vg=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${gg}) throws java.io.IOException`,yg=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${gg})`,bg=e=>Xn([[`name`,e??`UnnamedAction`],[`location`,Xn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),xg=(e,t,n)=>{let r=e.map((e,t)=>Yn([t+1,Xn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Yn([r[n],t[n],e])),a=n?[Yn([r[r.length-1],n.action,r[n.start]])]:[];return Xn([[`action`,Mn([...i,...a])],[`state`,Mn(r)]])},Sg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return yh(e).get(t)},Cg=(e,t,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new n(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(r)}`)},wg=e=>e.every(e=>e!==void 0),Tg=(e,t)=>Xn(t.variables.map((t,n)=>[t,e[n]])),Eg=(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&&!k(e)){if(t.variableIndex.has(r))return!0;let e=Ru(r,t);if(e&&!n.has(e)&&(n.add(e),Eg(e.body,t,n)))return!0}return Je(e).some(e=>Eg(e,t,n))},Dg=(e,t)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[z(`AssertEq`,2,t=>{let n=R(t,0,`AssertEq`),r=R(t,1,`AssertEq`),i=Xt(n,r);return i||(e(L(`Assertion failed`,!0)),e(L(n,!0)),e(L(r,!0))),i}),Gi(`AssertError`,2,e=>{let n=Ti(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ri(_g,`In computing AssertError, a non-string expression (line ${n.location.line}, col ${n.location.column}) was used as the err of an AssertError(err, exp).`);let r=Ki(e,0,`AssertError`)();try{Ki(e,1,`AssertError`)()}catch(e){if(e instanceof m)return xa(e.message,t.isTool)===r;throw e}return!1}),Oi(`TLCGetOrDefault`,2,e=>{let n=R(e,0,`TLCGetOrDefault`);return Sg(t,n)??R(e,1,`TLCGetOrDefault`)}),{...Di(`TLCGetAndSet`,4,n=>{let r=R(n,0,`TLCGetAndSet`),i=Sg(t,r)??R(n,3,`TLCGetAndSet`),a=Ti(n,1,`TLCGetAndSet`);return Cg(t,e,r,a.call([i,R(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Oi(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!wg(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ri(vg,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Yn(t.getBehavior(r).map(e=>Tg(e,n.environment)))}),Oi(`CounterExample`,0,()=>t.counterExample??Xn([[`action`,Mn([])],[`state`,Mn([])]])),z(`ToTrace`,1,e=>{let t=R(e,0,`ToTrace`);if(!j(t)||!Xt(zr(t),Mn([`action`,`state`])))throw new m(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(t)}`);let n=P(Lr(t,`state`)).elements.map(e=>Sr(e)??[]);return Yn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let t=R(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new n(`The argument of ModelValue should be a string, but instead it is:\n${L(t)}`);return Lt(t)}),Gi(`TLCDefer`,1,()=>!0),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),Gi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!wg(r))throw Ri(yg,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Lu(Ki(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new _(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Gi(`TLCCache`,2,(e,t)=>{let n=Ti(e,0,`TLCCache`),i=ii(Ki(e,1,`TLCCache`)()),o=n.expression;if(!o||!t)return n.call([]);let s=Eg(o,t.environment,/* @__PURE__ */ new Set)&&t.state?a(t.state):r,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(i);if(l!==void 0)return l;let u=n.call([]);return c.set(i,u),u}),z(`TLCFP`,1,e=>Number(BigInt.asIntN(32,Ym([R(e,0,`TLCFP`)])))),Oi(`TLCEvalDefinition`,1,(e,t)=>{let r=R(e,0,`TLCEvalDefinition`),i=typeof r==`string`&&t?Ru(r,t.environment):void 0;if(!i||typeof r!=`string`||!t)throw new n(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(r)}`);if(i.kind===`Operator`&&i.params.length>0)throw new n(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${r}`);return H({kind:`Identifier`,name:r,location:i.location},t)})]},Og=(e,t)=>[Oi(`_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}),Oi(`_Counts`,0,()=>vh(t)),Oi(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(vh(t),!0)),!1)}),Oi(`_PrintCounts`,0,()=>(e(L(vh(t),!0)),!0))],kg=e=>String(e).padStart(2,`0`),Ag=e=>`${e.getUTCFullYear()}.${kg(e.getUTCMonth()+1)}.${kg(e.getUTCDate())}.${kg(e.getUTCHours())}${kg(e.getUTCMinutes())}${kg(e.getUTCSeconds())}`,jg=e=>Rn([...e].map(([e,t])=>[e,Yn([t])])),Mg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Ng=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Pg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Fg=(e,t,r)=>{if(e.version===`1.7.4`?!Ng.has(t)||!e.isStarted&&Pg.has(t):!e.isStarted&&Mg.has(t))throw new n(`TLCGet(${t}) was undefined.`);let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Xn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Xn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Xn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Dt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Dt(Ag(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return bg(void 0);case`all`:return jg(e.registers);case`all:named`:return jg(yh(e))}if(t.startsWith(`s:`)){let r=yh(e).get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(t.startsWith(`-D`))return Dt(e.properties.get(t.slice(2))??t);throw new n(`TLCGet(${t}) was undefined.`)},Ig=(e,t,r)=>{if(typeof t==`number`&&t>=0){let r=e.registers.get(t);if(r===void 0)throw new n(`TLCGet(${t}) was undefined.`);return r}if(typeof t!=`string`)throw new n(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(t)}`);return Fg(e,t,r?.state)},Lg=e=>e.length===0?[[]]:e.flatMap((t,n)=>Lg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Rg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Rg),e.kind===`Function`&&e.range.forEach(Rg))},zg=(e,t)=>[z(`Print`,2,t=>(e(`${it(L(R(t,0,`Print`),!0,!0))} ${it(L(R(t,1,`Print`),!0,!0))}`),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(it(L(R(t,0,`PrintT`),!0,!0))),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new n(`The first argument of Assert evaluated to FALSE; the second argument was:\n${it(L(R(e,1,`Assert`)))}`,a.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>Rn([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=wi(e,0,`@@`),n=wi(e,1,`@@`);return zn([...ft(t),...ft(n)])}),z(`ToString`,1,e=>Dt(L(R(e,0,`ToString`),!0))),z(`TLCEval`,1,e=>{let t=R(e,0,`TLCEval`);return Rg(t),t}),z(`Permutations`,1,e=>{let t=Si(e,0,`Permutations`);return Mn(Lg(t).map(e=>Rn(t.map((t,n)=>[t,e[n]]))))}),Di(`SortSeq`,2,e=>{let t=Ti(e,1,`SortSeq`);return Yn(Ci(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),t.version===`1.7.4`?zi({...Oi(`TLCGet`,1,(e,n)=>Ig(t,R(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):zi(Gi(`TLCGet`,1,(e,n)=>Ig(t,Ki(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),Oi(`TLCSet`,2,n=>{let r=R(n,0,`TLCSet`);return Cg(t,e,r,R(n,1,`TLCSet`)),!0}),Ei(`Any`,Nt),z(`RandomElement`,1,e=>gh(xi(e,0,`RandomElement`),t.getRandom()))],Bg=(e,t)=>e.every(e=>Er(e,t)),Vg=Mn([!1,!0]),Hg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Ln(Hg(e,t,r),Hg(e,r,n))},Ug=[`\\cup`,`\\cap`,`\\`],Wg=e=>typeof e==`object`&&e.kind===`MixedSet`,Gg=(e,t,n)=>{let r=t.kind===`Interval`?P(t).elements:t.elements;if(e!==`\\cup`){let t=e===`\\cap`;return Nn(r.filter(e=>Er(e,n)===t))}if(r.length===0)return n;if(!ot(n))return Kt({kind:`SetOperation`,operator:e,left:t,right:n});let i=P(n).elements.filter(e=>!Er(e,t));return Nn([...r,...i])},Kg=[Ei(`TRUE`,!0),Ei(`FALSE`,!1),Ei(`BOOLEAN`,Vg),Ei(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ki(`=`,An),ki(`#`,(e,t)=>!An(e,t)),z(`~`,1,e=>!yi(e,0,`~`)),z(`<=>`,2,e=>yi(e,0,`<=>`)===yi(e,1,`<=>`)),z(`/\\`,2,e=>yi(e,0,`/\\`)&&yi(e,1,`/\\`)),z(`\\/`,2,e=>yi(e,0,`\\/`)||yi(e,1,`\\/`)),z(`=>`,2,e=>!yi(e,0,`=>`)||yi(e,1,`=>`)),z(`\\in`,2,e=>Er(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Er(R(e,0,`\\notin`),R(e,1,`\\notin`))),z(`\\subseteq`,2,e=>{let t=bi(e,0,`\\subseteq`),n=R(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&N(t.base)?Bg(P(t.base).elements,n.base):Bg(P(t).elements,n)}),...Ug.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e);if(ot(n)&&ot(r)&&!Wg(n)&&!Wg(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?Ln:e===`\\cap`?In:Fn;return Tr((e,n)=>t(P(e),P(n)),(t,n)=>Gg(e,t,n),n,r)}return ot(n)?Gg(e,n,r):e!==`\\`&&ot(r)?Gg(e,r,n):Kt({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=bi(e,0,`UNION`),n=st(t)?t.elements.filter(st):[];if(!st(t)||n.length!==t.elements.length)return Kt({kind:`Union`,base:t});if(Wg(t)||n.some(Wg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Er(t,e)||e.elements.push(t)})),Nn(e.elements)}return n.length===0?Pn:Hg(n.map(P),0,n.length)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!j(t))throw new m(`DOMAIN expects a function but received ${L(t)}`);return zr(t)})],qg=Vi(`Integers`,`Neg`,`IntValue`,1),Jg=e=>{let t=Vi(e,`DotDot`,`IntervalValue`,2);return[Hi(e,`+`,`Plus`,(e,t)=>e+t),Hi(e,`-`,`Minus`,(e,t)=>e-t),Hi(e,`*`,`Times`,(e,t)=>e*t),Hi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new n(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new n(`0^0 is undefined.`);return e**t}),Hi(e,`\\div`,`Divide`,(t,r)=>{if(r===0)throw new n(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/r)|0;return e<0&&Math.imul(e,r)!==t?e-1:e}let i=Math.floor(t/r);if(Ai(i))throw ji(`${t} \\div ${r}`);return i}),Hi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new n(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),z(`..`,2,e=>({kind:`Interval`,low:Bi(R(e,0,`..`),t),high:Bi(R(e,1,`..`),t)}))]},Yg=Jg(`Naturals`),Xg=Jg(`Integers`),Zg=e=>{let t=Yg.indexOf(e);return t===-1?void 0:Xg[t]},Qg=[Ei(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Yg,Wi(`<`,(e,t)=>e<t),Wi(`>`,(e,t)=>e>t),Wi(`<=`,(e,t)=>e<=t),Wi(`>=`,(e,t)=>e>=t,`>`)],$g=[Ei(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Xg,Wi(`>=`,(e,t)=>e>=t),z(`-.`,1,e=>{let t=Bi(R(e,0,`-`),qg);if(Ai(-t))throw ji(`-${t}`);return-t})],e_=(e,t,r)=>{let i=R(e,t,r),a=Sr(i);if(!a)throw new n(`${r}\n${L(i)}`);return a},t_=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:e_(e,t,n)},n_=(e,t,n)=>typeof e==`string`?Dt(e.slice(t,n)):Yn(e.slice(t,n)),r_=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,i_=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,a_=(e,t)=>{let n=Af.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?zi(e,t):e}):t},o_=e=>a_(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>t_(e,0,r_(``,`Len`)).length),z(`\\o`,2,e=>{let t=t_(e,0,i_(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=e_(e,1,i_(`t \\o s`,`sequence`));return Yn([...t,...n])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new n(`${i_(`t \\o s`,`string`)}\n${L(r)}`);return Dt(t+r)}),z(`Append`,2,t=>Yn([...e_(t,0,i_(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let t=e_(e,0,r_(``,`Head`));if(t.length===0)throw new n(`Attempted to apply Head to the empty sequence.`);return t[0]}),z(`Tail`,1,e=>{let t=t_(e,0,r_(``,`Tail`));if(t.length===0)throw new n(`Attempted to apply Tail to the empty sequence.`);return n_(t,1)}),z(`SubSeq`,3,e=>{let t=t_(e,0,r_(`first `,`SubSeq`)),r=vi(e,1,`SubSeq`),i=vi(e,2,`SubSeq`);if(r>i)return n_(t,0,0);let a=r<1||r>t.length?{position:`second`,value:r}:i>t.length?{position:`third`,value:i}:void 0;if(a)throw new n(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${a.value}`);return n_(t,r-1,i)}),Di(`SelectSeq`,2,e=>{let t=Ti(e,1,`SelectSeq`);return Yn(e_(e,0,r_(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw gi(`second`,`SelectSeq`,`operator`,n);return n}))})]),s_=e=>a_(`FiniteSets`,[z(`IsFiniteSet`,1,e=>{let t=R(e,0,`IsFiniteSet`);if(A(t))return br(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new m(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${L(t)}\nis a finite set.`:`Attempted to check if the ${ct(t)} ${L(t)} is a finite set.`)}),z(`Cardinality`,1,t=>{let r=R(t,0,`Cardinality`);if(!A(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new n(`Attempted to compute cardinality of the value\n${L(r)}`);return vr(r,e)})]),c_=/* @__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`]]]),l_=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Qg};case`Integers`:return{extends:[`Naturals`],operators:$g};case`Sequences`:return{extends:[],operators:o_(n.version)};case`FiniteSets`:return{extends:[],operators:s_(n.version)};case`TLC`:return{extends:[],operators:a_(`TLC`,zg(t,n))};case`Randomization`:return{extends:[],operators:hg(n)};case`_Possible`:return{extends:[],operators:Og(t,n)};case`Json`:return{extends:[],operators:lg(r)};case`Bags`:return{extends:[],operators:Uh(i)};case`TLCExt`:return{extends:[],operators:Dg(t,n)};default:return}},u_=`$subexpression`,d_=(e,t)=>new l(`${e} at line ${t.line}, column ${t.column}`),f_=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return f_(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Je(e)){let e=f_(r,t,n);if(e)return e}},p_=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),m_=(e,t)=>{let n=e.location,r=p_(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 d_(`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 d_(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:u_,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:u_,args:e.args,location:n,resolution:Ia},location:n}},h_=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Ia})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ia}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ia};return m_({...t,params:[...t.params,...r]},a)},g_=(e,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 d_(i,a);Ra.set(r,{args:e.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:t(n),message:i}}),s.isFailed=!0},l=t=>{let r=[],i=[];for(;s.index<e.length;){let o=e[s.index];if(o.kind!==`Name`)throw d_(`Expected an operator name`,a);r.push(o.name),i.push(...o.args);let c=r.join(`!`),l=t?t.find(e=>as(e)===c):n(c);if(l)return{definition:l,name:c,args:i,earlier:i.length-o.args.length};s.index++}throw d_(`Unknown operator ${r.join(`!`)}`,a)},u=t=>{let n=l(t),u=n.definition,d=Ua(u),f=s.index===e.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 d_(`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<e.length&&!s.isFailed;){let t=e[s.index];if(t.kind!==`Name`)return;let n=r.selectorRanges?.[s.index],a=s.current&&f_(s.current,t.name,[]);if(!a)return c(n,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(!i&&t.args.length!==l.length)return c(n,`Label \`${t.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(...t.args),s.current=a.label.body,s.index++}},f=t=>{let n=s.current;if(!n)throw d_(`Subexpression selection failed`,a);if(t.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||uo(t.operand,1)!==0)throw d_(`A LET/IN expression has only one operand`,a);o.lets.push(n.definitions),s.current=n.body;return}let r=ho(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){o.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&o.args.push(...t.args),s.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],i=r[uo(t.operand,r.length)],o=e[s.index+1];if(!i||o?.kind!==`Operand`)throw d_(`A subexpression of CASE must have the form !i!j`,a);s.index++;let c=uo(o.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw d_(`Nonexistent CASE operand`,a);s.current=l;return}if(t.kind!==`Operand`)throw d_(`Unexpected subexpression selector`,a);let i=r?r.sets:go(n),c=i?.[uo(t.operand,i.length)];if(!c)throw d_(`Nonexistent operand specified by the selector`,a);s.current=c},p=u(void 0);if(s.isFailed)return r;if(p)return h_(p.definition,{...o,args:p.args});for(d();s.index<e.length&&!s.isFailed;){let t=e[s.index];if(t.kind===`Name`){for(;s.current?.kind===`Label`;)s.current=s.current.body;if(s.current?.kind!==`Let`)throw d_(`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 h_(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(t),s.index++}if(s.isFailed)return r;if(!s.current)throw d_(`Subexpression selection failed`,a);return m_(o,s.current)},__=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return fo(e,t,n)},v_=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Je(e).some(v_),y_=(e,t,n,r=!1)=>{if(!v_(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=cs(e,e=>y_(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>b_(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)=>y_(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:cs(e,e=>y_(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?__(a.name,[],void 0,t):a.kind===`Apply`?__(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=g_(o,t,a,r);return c!==a&&La.add(c),c},b_=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:y_(e.expression,t,n,!0)}))}),x_=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},S_=(e,t)=>b_(e,x_(t.definitions),()=>!1),C_=(e,t)=>{let n=x_([...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=>y_(e,n,i),o=e=>i(e)||!n(e),s=e=>y_(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 b_(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?b_(e,n,o):ss(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=>v_(e.body))||e.assumptions.some(e=>v_(e.expression))?{...p,definitions:e.definitions.map(e=>ss(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},w_=(e,t)=>e.maxLevels[t]??3,T_=e=>{let n=/* @__PURE__ */ new Map,r=t=>{let r=n.get(t);if(r)return r;let i=e(t),a=mc({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(t,a),a},i=/* @__PURE__ */ new Map,a=t=>{let n=i.get(t);if(n)return n;let a=e(t),o=r(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>Gs(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Gs(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>Ks(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=Hs(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)&&Gs(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(hc(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),i.set(t,c),c};return n=>{let i=/* @__PURE__ */ new Map,o=t(n.location.range??{module:n.instancer,start:n.location,end:n.location}),s=e=>i.set(`${o}\n${e}`,{location:o,message:e}),l=e(n.module),u=a(n.module),d=r(n.instancer),f=/* @__PURE__ */ new Map;n.lets.forEach(e=>f.set(e.name,{kind:`Let`,definition:e,scope:f}));let p=[...l.constants.map(e=>({...e,maximumLevel:0})),...l.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=d.analyze(t,f);return[{...e,level:n.level,operator:void 0,isLeibniz:!0}]}let r=d.toOperand(t,f);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),m=(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(p.forEach(e=>{!u.isConstant&&e.level>e.maximumLevel&&s(m(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${n.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),p.forEach(e=>{let t=u.constraints.get(e.name);t!==void 0&&e.level>t&&s(m(e.name,t));let r=e.operator;r&&Array.from({length:e.arity},(t,i)=>{let a=u.argConstraints.get(Bs(e.name,i));a!==void 0&&w_(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}.`)})}),u.argParams.forEach(e=>{let t=Hs(e),r=p.find(e=>e.name===t.operator)?.operator,i=p.find(e=>e.name===t.param);if(!r||!i)return;let a=w_(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 c([...i.values()])}},E_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],D_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),O_=new Map(wf.flatMap(e=>e.map(t=>[t,e[0]]))),k_=e=>O_.get(e)??e,A_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},j_=()=>{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}}},M_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:A_(e)&2147483647,kind:t,isLocal:n}),N_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:k_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:k_(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}},P_=(e,t)=>{let n=[];for(let r=t;;){let t=N_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},F_=e=>({line:e.line,column:e.column}),I_=(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=P_(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},L_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,R_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},z_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&L_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&L_(e[n+1],e[n+2])?n+=L_(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=>R_[e])}"`:r.text)}return t},B_=e=>e[2]?.text,V_=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},H_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>H_(e.modules,t)).find(Boolean),U_=e=>{let t=e===void 0?[]:be(e),n={module:void 0};return{tokens:t,ranges:V_(t),getModule:()=>n.module??=e===void 0?wm(``):Tm(e,t)}},W_=(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=U_(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:(Of.has(i)?t?.(i):void 0)??kf.get(i)??t?.(i)??Sm(e,i),{tokens:c,ranges:l,getModule:u}=a(s),d=l.get(B_(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:()=>H_(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()}},G_=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=P_(t,e+1);i.push({location:F_(t[e]),apply:e=>r.forEach(t=>e.put(M_(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:F_(u),apply:t=>t.put(M_(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`&&P_(t,l+1).every(e=>s.has(e))&&o(l,`definition`),D_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(a.push(F_(u)),i.push({location:F_(u),apply:e=>e.put(M_(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(M_(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=k_(e.name);i.push({location:e.location,apply:n=>n.put(M_(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(M_(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(M_(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Ha(e.location,t.location)?-1:+!!Ha(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=j_();n.set(i??``,o),Cf.toReversed().forEach(e=>o.put(M_(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)}}},K_=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),Tf.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},o=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=I_(a(e),e,o);return c.set(e,n),n},u=e=>o.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>o.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;z_(a(void 0)).forEach((e,t)=>{t===3&&Df.forEach(r),r(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),v.set(n.unit,[...v.get(n.unit)??[],i]),!_.has(i)){if(_.add(i),e(i).tokens.length===0){let t=n.unit??B_(e(void 0).tokens);throw s(i,t)}z_(a(i)).forEach(r)}}E_.forEach(r);let b=/* @__PURE__ */ new Set,ee=e=>{if(b.has(e))return;b.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(ee),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return ee(void 0),Ef.forEach(r),[...n]},q_=(e,t)=>{let n=W_(e,t),r=n.getParsed,i,a=()=>i??=G_(r);return{getStringOrder:e=>K_(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)}}},J_=e=>{switch(e.kind){case`Number`:if(!lt(e.value))throw v(new n(`Integer overflow: ${e.value} is outside TLC's 32-bit range`),a.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Lt(e.name);case`Set`:return Mn(e.elements.map(J_))}},Y_=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],X_=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof l))throw n;let r=Xp(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},Z_=e=>new l(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Q_=(e,n)=>e.location.range&&n.location.range&&{location:t(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${t(n.location.range)}.`},$_=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,ev=e=>e===`Theorem`?`ThmOrAssumpDefNode`:$_(e),tv=(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}),nv=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new m(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Xt(t,r)})});if(t)return t[1];throw new m(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},rv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Je(e).some(e=>rv(e,t)),iv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(bs(e),n.get(e)??n.size)),n},av=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),ov=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Eu(e);if(e.kind===`Number`&&!lt(e.value))throw Du(e);ov(e.kind===`Let`?[...Je(e),...av(e.instances??[])]:Je(e))}),sv=(e,n)=>{let r=n.order??q_(n.source,n.loadModule),i=r.parseModule(n.source),a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,p=new Map(Kg.map(e=>[e.name,e])),h=/* @__PURE__ */ new Map,_=_h(e.checkDeadlock,n.seed);_.isWarningEnabled=n.isWarningEnabled??!0,_.isTool=n.isTool??!1,_.version=n.version??`master`;let v=/* @__PURE__ */ new Map,y=/* @__PURE__ */ new Map,b=/* @__PURE__ */ new Map,ee=[],x=/* @__PURE__ */ new Map,te=[],ne=[],re=(e,t)=>te.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ie={value:0},ae=e=>`${e}#${ie.value++}`,oe=[],se=[],ce=T_(e=>{let t=b.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)}}),le=/* @__PURE__ */ new Map,ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,S=e=>{let t=h.get(e);if(t)return t;let r=l_(e,n.print,_,n.files,p);if(!r)return;c_.get(e)?.forEach(S);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>S(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{p.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Ls.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:zs(e,t.name)??i.get(t.name)?.range})}),h.set(e,i),i},C=e=>{if(Of.has(e)&&n.loadModule?.(e)!==void 0)return;let t=S(e),r=c_.get(e)??[];return t&&re(e,r),t&&r.includes(`Integers`)&&S(`Integers`),t},w=e=>(ov([...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]),...av(e.instances)]),e.modules.forEach(w),e);w(i);let T=(e,t)=>{let i=n.loadModule?.(e)??Qe.get(e)??Sm(n.source,e);if(i===void 0)throw s(e,t);let a=X_(i,e,r);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return w(a)},fe=e=>{let t=ne.indexOf(e.name);if(t!==-1){let n=[...ne.slice(t),e.name].map(e=>`${e}.tla`);throw new l(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];ne.push(e.name),te.push(n);let o=Se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:se,levelChecks:a});if(te.pop(),ne.pop(),i.length>0)throw c(i,!1,void 0,se);let s=r.find(e=>n.has(e.name)),u=s&&v.get(s.name),d=u&&Q_(s,u.module);if(d)throw c([d],!1,void 0,se);if(s)throw Z_(s);return a.forEach(e=>e()),{linked:o,closure:n}},pe=(e,t)=>{let r=v.get(e);if(r)return re(e,x.get(e)??[]),r;let i=fe(T(e,t));return(Ch(_.version).has(e)?l_(e,n.print,_,n.files,p):void 0)?.operators.forEach(e=>{let t=i.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(p.set(t.key,e),a.delete(t.key))}),v.set(e,i.linked),x.set(e,i.closure),re(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let s=i?void 0:C(e.module);if(s)return he(e,s);let c=i??pe(e.module,t.name);c.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let l=Y_(c),f=`#${ie.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Qo(S_(e,t),l,t,n);oe.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=Ms({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,ns(t,p)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>o.get(e)===!0,addDefinition:(n,i,s)=>{let c=ae(`${i}@${t.name}`),f=s(c);return a.set(c,f),l.length>0&&d.add(f),e.name!==void 0&&ue.set(c,`${e.name}!${ue.get(n)??i}`),o.set(c,!r),u.set(c,{source:n,prefix:e.params.length}),c},createName:ae});return ge(e,c.exported,l,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return l.length>0&&le.set(r,{name:n,location:e.location}),e.name!==void 0&&de.set(r,n),r})},he=(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}])),ge=(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,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:Es(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ve=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ye=(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=ve(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Es(r,n),location:n}}},E=(e,t,n,r)=>{let i=e.location,s=r?void 0:C(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=ve(n.arity);return _e(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${ie.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};oe.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=>rv(f(e),p),h=d.map(t=>{let n=ye(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=[],_=Ms({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Es(e.params,i),location:i,resolution:Ia}:Ts(`${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}:tv(a,i)),i},createName:ae}),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=ve(n.arity),o=[...e.params,...a];return _e(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...y]},be=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),xe=/* @__PURE__ */ new Map,Se=(e,r)=>{let s=Sf(e,n.loadClass?.(e.name),e===i);xe.set(e.name,s.overrides);let c=s.module,l=oe.length,u=new Map([...Kg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...r.symbols]),d=/* @__PURE__ */ new Map,f={location:qo,errors:[],warnings:[]},p=[f],m=e=>e.forEach((e,n)=>{let r=h.get(n);if(!r){u.set(n,e),h.set(n,e);return}if(!r.range||!e.range||t(r.range)===t(e.range))return;let i=t(e.range),a=t(r.range);ev(r.kind)===ev(e.kind)?f.warnings.push({location:i,message:`Warning: the ${$_(r.kind)} of '${n}' conflicts with \nits ${$_(r.kind)} at ${a}.`}):f.errors.push({location:i,message:`The ${$_(e.kind)} of '${n}' conflicts with \nits ${$_(r.kind)} at ${a}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,v=[],x=[...c.constants],te=c.variables.map(e=>e.name),ne=c.variables.map(e=>e.location);c.extends.forEach(e=>{let t=r.modules.get(e),n=t?void 0:C(e);if(n){m(n);return}let i=t??pe(e,c.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),ne.push(i.variableLocations[t]))}),m(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),v.push(i)});let re=new Map(u),ie=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],ae=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ie.forEach(e=>h.set(e.name,ae(e)));let le=e=>({key:S(e),arity:Ua(e),params:Wa(e),kind:Jo(c,e)?`Theorem`:`Definition`,range:e.location.range}),ue=x.length===0&&te.length===0,S=e=>c===i?e.name:`${e.name}@${r.id}`,w=/* @__PURE__ */ new Map,T=()=>new Map([...r.modules,..._]),fe=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&Ha(e.location,t.location)},_e=e=>{let t=c.modules.find(t=>t.name===e.module);return t?fe(t)?_.get(t.name):void 0:T().get(e.module)},ve=e=>({imported:u,getInstance:e=>{let t=_e(e),n=t?void 0:C(e.module);if(n)return{declarations:[],symbols:he(e,n),instancer:c.name};let r=t??pe(e.module,c.name),i=Y_(r);return{declarations:i,symbols:ge(e,r.exported,i,e=>e),instancer:c.name}},bound:re,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:S,instanced:w,facts:g,reports:p,warnings:r.warnings}),ye=e=>[...ie.filter(t=>Ha(t.location,e)).map(e=>[e.name,ae(e)]),...c.definitions.filter(t=>Ha(t.location,e)).map(e=>[e.name,le(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),Ce=e=>{let t=T(),n=t.get(e.name),i=n&&Q_(e,n.module);if(n&&!i)throw Z_(e);r.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=Se(e,{id:`${r.id}/${e.name}`,symbols:ye(e.location),modules:t,nested:r.nested,errors:a.errors,warnings:a.warnings,levelChecks:r.levelChecks});i&&a.errors.push(i),n||_.set(e.name,o),y.has(e.name)||y.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=me(e,c,ve(c),ue,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:()=>Ce(e)}))].sort((e,t)=>Ha(e.location,t.location)?-1:1).forEach(e=>e.link());let D=C_(Is(c,(e,t)=>E(e,t,c.name,_e(e))),be(u));r.errors.push(...es(D,ve(D))),D.definitions.forEach(e=>{let t=S(e);a.set(t,e),o.set(t,!ue);let n=le(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Ha(r,e.location))&&(u.set(e.name,n),e.isLocal||h.set(e.name,n))});let we={module:D,constants:x,variables:te,variableLocations:ne,visible:u,exported:h,modules:_,extended:v,facts:/* @__PURE__ */ new Set([...g,...[...D.theorems,...D.assumptions].flatMap(e=>e.name??[])])};b.has(c.name)||b.set(c.name,we);let Te=oe.splice(l).map(e=>({location:e.location,check:()=>ce(e)}));return r.levelChecks.push(()=>gc(D,{constants:new Set(x.map(e=>e.name)),variables:new Set(te),getDefinition:e=>a.get(u.get(e)?.key??e),getQualifiedName:e=>de.get(u.get(e)?.key??e)},Te,se)),ee.push(we),we},Ce=fe(i).linked;se.length>0&&!n.isSanyReported&&n.print(f(se));let D=e=>Ce.visible.get(e)?.key??e;Ce.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(Ce,/* @__PURE__ */ new Set);let Ee=Ce.constants.map(e=>e.name),De=Ce.variables,Oe=e=>e.module===void 0?[e.name,D(e.name)]:e.module===i.name||Ee.includes(e.name)?[]:[(v.get(e.module)??y.get(e.module))?.visible.get(e.name)?.key??e.name],ke=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:Ce.constants.find(t=>t.name===e)?.arity??0},Ae=/* @__PURE__ */ new Map,je=/* @__PURE__ */ new Set,Me=(e,t)=>{p.set(e,t),a.delete(e),Ae.delete(e),je.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=J_(e.value);kn(t),Oe(e).forEach(e=>{let n=ke(e);n===0?Ae.set(e,t):Me(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ne=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ne.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new g(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(J_),J_(e.value)]),Ne.set(t,n)}),Ne.forEach(e=>Oe(e).forEach(t=>Me(t,nv(e.name,ke(t)||e.rows[0][0].length,e.rows))));let Pe=new Map(e.substitutions.flatMap(e=>Oe(e).map(t=>[t,D(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!Ee.includes(n)&&!Ce.visible.has(n))throw new g(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new g(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let i=D(r),o=a.get(i);if(!(o!==void 0||p.has(i)||Ae.has(i)||Ee.includes(r)||De.includes(r)))throw new g(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(o?.kind===`Operator`&&o.params.length!==(Ce.constants.find(e=>e.name===n)?.arity??Ce.visible.get(n)?.arity))throw new g(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Fe=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Oe)),Ie=(e,t)=>{if(Fe.has(e))return{key:e,prefix:t};let n=u.get(e);return n&&Ie(n.source,t+n.prefix)};u.forEach((e,t)=>{let n=Ie(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=_e(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),Ce.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})});let Le=Ee.filter(e=>!Ae.has(e)&&!Pe.has(e)&&!je.has(e));if(Le.length>0&&!n.isUnconfigured){let e=r.getDeclarationOrder(`constant`).find(e=>Le.includes(e))??Le[0];throw new g(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&p.forEach((e,t)=>{let n=Zg(e);n&&p.set(t,n)});let Re=iv(De,ee.flatMap(e=>e.module.variables.map(e=>e.name))),ze=Ac({definitions:a,substitutions:Pe,constants:Ae,variableIndex:Re,builtins:p,variables:De}),Be={runtime:_,definitions:a,builtins:p,constants:Ae,substitutions:Pe,instanceNames:ue,variables:De,variableIndex:Re,facts:ze,startupValues:Array.from({length:ze.ids.size},()=>void 0),substitutedDefinitions:d,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ve=mc({constants:new Set(Ae.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>p.has(e))]),getDefinition:e=>Ru(e,Be)}),O=e=>{try{H(e,{environment:Be,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof m)return e;throw e}};Pe.forEach((e,t)=>{let n=a.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ve.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?O(n.body):void 0;if(r){let n=va(r)?``:` - specifically: ${r.message}`;throw new g(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),_.version!==`1.7.4`&&(_.isStarted=!0);let He=new Set(ee.flatMap(e=>e.module.instances.map(e=>e.module))),Ue=r.createDefinitionOrder();return{environment:Be,assumptions:we,variableLocations:Ce.variableLocations,instanceActions:le,startupDefinitions:ee.filter(e=>!He.has(e.module.name)||Y_(e).length===0).flatMap(e=>Ue(e===Ce?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:Ce.constants,rootSymbols:Ce.visible,javaOverrides:ee.flatMap(e=>xe.get(e.module.name)??[])}},cv={kind:`Boolean`,value:!0},lv={kind:`Boolean`,value:!1},uv=e=>e?cv:lv,dv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,fv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,$=(e,t)=>({kind:e,body:t}),pv=(e,t,n)=>({kind:e,operands:[t,n]}),mv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?mv(e,t.operands).operands:[t])}),hv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return hv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,hv(t)),0)}},gv=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 gv(e.body);case`And`:case`Or`:return e.operands.some(gv)}},_v=/* @__PURE__ */ new WeakMap,vv={count:0},yv=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`#${vv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(yv).join(`,`)})`;default:return`${e.kind}(${yv(e.body)})`}})();return _v.set(e,n),n},bv=(e,t)=>e===t||yv(e)===yv(t),xv=(e,t)=>{let n=yv(t);return e.some(e=>e===t||yv(e)===n)},Sv=e=>e===`And`?`Or`:`And`,Cv=(e,t)=>{switch(e.kind){case`Boolean`:return t?uv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?$(`Not`,e):e;case`Not`:return Cv(e.body,!t);case`And`:case`Or`:return mv(t?Sv(e.kind):e.kind,e.operands.map(e=>Cv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return $(n,Cv(e.body,t))}}},wv=e=>{switch(e.kind){case`Boolean`:return uv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return mv(Sv(e.kind),e.operands.map(wv));case`Always`:return $(`Eventually`,wv(e.body));case`Eventually`:return $(`Always`,wv(e.body));default:return $(`Not`,e)}},Tv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Tv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return uv(t)}return n.length===0?uv(!t):n.length===1?n[0]:mv(e.kind,n)}case`Not`:{let t=Tv(e.body);return t.kind===`Boolean`?uv(!t.value):$(`Not`,t)}case`Always`:case`Eventually`:{let t=Tv(e.body);return $(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Ev=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Dv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Dv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new m(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>mv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Dv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Ev(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:mv(`Or`,t);n.push($(`Always`,$(`Eventually`,e)))}return mv(`Or`,n)}case`Not`:return dv(e.body)?e:Dv(wv(e.body));default:return e}},Ov=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ov(e.operands[0]):mv(e.kind,e.operands.map(Ov));case`Not`:return e.body.kind===`Not`?Ov(e.body.body):$(`Not`,Ov(e.body));case`Always`:case`Eventually`:case`Next`:return $(e.kind,Ov(e.body));default:return e}},kv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return kv(e.operands[0]);let t=Math.floor(e.operands.length/2);return pv(e.kind,kv(mv(e.kind,e.operands.slice(0,t))),kv(mv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return $(e.kind,kv(e.body));default:return e}},Av=(e,t)=>{e.kind===`Eventually`&&!xv(t,e)&&t.push(e),`body`in e&&Av(e.body,t),`operands`in e&&e.operands.forEach(e=>Av(e,t))},jv=e=>{let t=e.filter(fv),n=e.flatMap(e=>e.kind===`Not`&&fv(e.body)?[e.body]:[]);return!t.some(e=>xv(n,e))},Mv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,$(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new m(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Nv=(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]}},Pv=(e,t,n)=>e.flatMap(e=>{let r=Nv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Fv=e=>[...new Set(e.map(yv))].sort().join(`|`),Iv=(e,t)=>{let n=new Set(t.map(Fv));return[...e.filter(e=>!n.has(Fv(e))),...t]},Lv=e=>{let t=Mv(e),n=Pv(t,`Always`,`And`),r=Pv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Nv(t,`Eventually`,`Or`);if(n&&!(xv(e,n.first)||xv(e,n.second)))return Iv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(xv(e,t.first)||xv(e,t.second))&&!xv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!jv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Nv(t[e],`Always`,`And`);n&&(xv(t,n.first)||t.push(n.first),xv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)xv(t,e.first)&&xv(t,e.second)&&!xv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!jv(t)?[]:i(t)};return a(e)},Rv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>hv(e)<=1)}),zv=e=>{let t=Lv([e]).map(Rv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Fv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Lv(n)){let n=Fv(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}},Bv=(e,t)=>!xv(e,t)||xv(e,t.body),Vv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&hv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Ev(e);if(n){let e=hv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(gv(e))throw new m(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Hv=(e,t)=>{let n=e.findIndex(e=>bv(e,t));return n===-1?(e.push(t),e.length-1):n},Uv=e=>{let t=Dv(Tv(Cv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ov(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Vv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:mv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:bv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&kv(e.formula),n=[];t&&Av(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Hv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Hv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Hv(i,e))}));return{tableau:t&&zv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Wv=()=>v(new m(`Temporal formula is a tautology (its negation is unsatisfiable).`),a.livenessEvaluationFailure),Gv=/* @__PURE__ */ new Set([`~>`,`-+->`]),Kv=/* @__PURE__ */ new WeakSet,qv=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Jv=(e,t)=>new m(`TLC cannot handle the temporal formula ${vu(e)}${t===void 0?``:`:\n${t}`}`),Yv=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=ju(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return r.isReleased?0: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=Ru(e,n);if(t)return Ic(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:k(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return cs(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 Gv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Xv=(e,t)=>{try{return qu(e,t)}catch(e){if(!(e instanceof m))throw e;if(!va(e))return;throw v(new m(`${u}${e.message}`),a.error)}},Zv=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>Zv(e,t,n,r,c,a||l!==void 0&&n.substitutedDefinitions.has(l),s);if(e.kind===`And`)return e.operands.flatMap(e=>s(e,t,vu(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,Qv(e,t,n));if(e.kind===`Identifier`){let r=k(e)?ju(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:Ru(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&Ic(a,n)>0){if(i.has(a))throw x();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=qv(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Yv(e,t,n)===3)){let t=hd(e,c),r=k(e)?void 0:Ru(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,Dd(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>Yv(e.set,t,n)===0),u=l?Xv(e.bounds,c):void 0;if(l&&u){let n=[];if(Ju(e.bounds,u,t,t=>(n.push(...s(e.body,t,vu(e.body))),!1)),n.length===0)throw Wv();return n}return[{expression:e,scope:t,name:o}]},Qv=(e,t,n)=>{let r=jd(e.definitions,qv(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Kv.add(e.binding);return r},$v=(e,t,n)=>{let i=n.runtime.version===`1.7.4`,a=(e,t,r)=>{let a=r===0&&!i?Yv(e,t,n):r;if(a===0){let r=H(e,qv(n,t));if(typeof r!=`boolean`)throw new m(`TLC expected a boolean value, but did not find one. ${yu(e)}`);return uv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},o={depth:0},s=(e,t,n,r)=>{if(o.depth>=100)throw x();o.depth++;let i=p(e,t);o.depth--;let s=hv(i);return s>2?i:a(n,r,s)},c=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,a=qv(n,t),o=k(e)||Ru(r,n)===void 0?ju(t,r):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&Kv.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:k(e)?gd(r,a):md(r,n);if(c?.kind!==`Closure`)throw Jv(e);let u=e.kind===`Apply`?e.args:[],d=!k(e)&&Ru(r,n)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>H(e,a)),s(c.body,Dd(c,u,a),e,t)),d)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof r||n&&!i;throw!(t instanceof m)||a?t:Jv(e)}},u=(e,t)=>{let i=Yv(e,t,n);if(!e.bounds.every(e=>Yv(e.set,t,n)===0)){if(i<=2)return a(e,t,i);throw Jv(e)}let o=[],s=e.kind===`Forall`;try{Yu(e.bounds,qv(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof m)||n instanceof r)throw n;if(i<=2)return a(e,t,i);throw Jv(e,s&&!va(n)?n.message:void 0)}return o.length===0?uv(s):d(e,t,mv(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=hv(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===`~`&&!k(e)||e.operator===`=>`),p=(e,t)=>{let r=Yv(e,t,n);if(r<=2&&!f(e))return a(e,t,r);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Qv(e,t,n));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?$(`Always`,pv(`Or`,$(`Not`,p(n[0],t)),$(`Eventually`,p(n[1],t)))):e.operator===`~`&&!k(e)?d(e,t,$(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,pv(`Or`,$(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,mv(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,n)===0){let r=H(e.condition,qv(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let r=p(e.condition,t);return d(e,t,pv(`Or`,pv(`And`,r,p(e.consequent,t)),pv(`And`,$(`Not`,r),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`,pv(`Or`,i,a))):pv(`Or`,$(`Eventually`,$(`Always`,i)),$(`Always`,$(`Eventually`,a)))}default:throw Jv(e)}};return p(e,t)},ey=(e,t,n,r,i)=>{let a=e=>ey(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?Lu(H(e.expression,a),`a temporal property predicate`):su(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Lu(H(e.unchanged,a),`a subscript`)?!1:Lu(H(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return ey(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new m(`TLC cannot evaluate a temporal formula in a single step`)}},ty=(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)=>ty(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 ey(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},ny=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),ry=(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},iy=e=>v(new m(`${i}${e}`),a.error),ay=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!M(e)||!M(i))throw iy(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},oy=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(oy);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},sy=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,cy=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new g(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw iy(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>H(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!A(a)||!N(a))throw iy(`The symmetry operator must specify a set of functions.`);let o=P(a).elements;if(!o.every(j))throw iy(`The symmetry values must be function records.`);let s=o.map(ay),c=r.body.kind===`Apply`?r.body.args:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=oy(sy(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ca.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;s.forEach(e=>{e.size>0&&d.set(ny(e),e)});let f=[...d.values()],p={start:0};for(;p.start<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p.start,t).forEach(e=>{let t=ry(n,e),r=ny(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p.start=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!sy(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>M(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},ly=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=dy(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(dy(e[r],t));return a}},uy=(e,t)=>{let n=[],r=[];for(let i of e){let e=dy(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Ft);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Ft(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},dy=(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=uy(e.elements,t);return n?Rt(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=ly(n.domain,t),i=ly(n.range,t)??n.range;if(r){let e=Rn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?zt(n.domain,e.range):e}return i===n.range?n:zt(n.domain,i)}if(n===`Interval`||!A(e)||!N(e))return e;let r=P(e),i=ly(r.elements,t);return i?Mn(i):r},fy=(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]=dy(e[o],i),a===0&&(a=Ft(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},py={line:0,column:0},my=e=>({kind:`Identifier`,name:e,location:py}),hy=/* @__PURE__ */ new Set([`name`,`property`]),gy=(e,t,n)=>{let r=Ru(t,n);if(!r)throw new g(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new g(hy.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},_y=(e,t,n)=>{if(Nc(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return H(my(e),zy(n,void 0,void 0))}catch(e){if(e instanceof m||p(e))return;throw e}},vy=(e,t,n)=>{let r=gy(e,t,n);if(_y(t,r,n)!==void 0)throw new g(`The ${e} ${t} cannot be a constant.`);return r},yy=(e,t,n)=>{let r=n.constants.has(t)?void 0:gy(e,t,n),i=r?_y(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new g(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},by=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},xy=(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})),dd(e.startupDefinitions,r),t.invariants.forEach(e=>{yy(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Sy=(e,t)=>{let n=mc({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>Ru(e,t)});return e.flatMap(e=>{let r=yy(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
1787
+ `]]),Gg=(e=`master`)=>e===`1.7.4`?Wg:Ug,Kg=(e,t)=>e.every(e=>Yi(e,t)),qg=Yr([!1,!0]);Wr(qg);const Jg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return ei(Jg(e,t,r),Jg(e,r,n))},Yg=[`\\cup`,`\\cap`,`\\`],Xg=e=>typeof e==`object`&&e.kind===`MixedSet`,Zg=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Qg=(e,t,n)=>{t.kind===`Interval`&&zi(t);let r=t.kind===`Interval`?t:Ur(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return ln(r,e=>{Yi(e,n)===i&&sn(a,e)}),Zg(t)?ar(a):Xr(a)}if(Ii(t))return n;if(!dn(n))return pr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return ln(r,e=>sn(i,e)),ln(n.kind===`Interval`?n:F(n).elements,e=>{Yi(e,t)||sn(i,e)}),Xr(i)},$g=(e,t)=>{let n=t.elements,r=0,i=n.length;for(;r<i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;a<e.low?r=t+1:i=t}for(let t=e.low;t<=e.high;t++,r++){if(r===n.length)return!1;let e=n[r];if(e!==t)return typeof e!=`number`&&void 0}return!0},e_=(e,t)=>{if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;let n=typeof t==`object`&&t.kind===`Set`?$g(e,t):void 0;if(n!==void 0)return n;for(let n=e.low;n<=e.high;n++)if(!Yi(n,t))return!1;return!0},t_=(e,t)=>{let n=(t,n)=>Ds([Ys(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},n_=[ks(`TRUE`,!0),ks(`FALSE`,!1),ks(`BOOLEAN`,qg),ks(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Ms(`=`,Kr),Ms(`#`,(e,t)=>!Kr(e,t)),z(`~`,1,e=>!Ds(e,0,`~`)),z(`<=>`,2,e=>Ds(e,0,`<=>`)===Ds(e,1,`<=>`)),t_(`/\\`,(e,t)=>e&&t()),t_(`\\/`,(e,t)=>e||t()),t_(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>Yi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Yi(R(e,0,`\\notin`),R(e,1,`\\notin`))),Ms(`\\subseteq`,(e,t)=>{if(typeof e==`object`&&e.kind===`Interval`)return e_(e,t);if(!un(e))throw new T(`\\subseteq expects a set but received ${L(e)}`);return typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&yi(e.base)?Kg(F(e.base).elements,t.base):!Ai(e,e=>!Yi(e,t))}),...Yg.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(dn(n)&&dn(r)&&!Xg(n)&&!Xg(r)&&!i&&!cn(n)&&!cn(r)){if(e===`\\cup`&&Ii(n))return r;let t=e===`\\cup`?ei:e===`\\cap`?$r:Qr;return qi((n,r)=>{let i=F(n),a=F(r),o=t(i,a);if(e===`\\cup`){let e=Ur(i),t=Qr(a,i).elements,n=e===i.elements&&(t.length===0||$n(e[e.length-1],t[0])<0);if(e.length+t.length>an())throw new u(on());if(n&&!i.isNormalized)return o;let r=o===i?ir(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=Zg(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Yi(e,o)))),o},(t,n)=>Qg(e,t,n),n,r)}return dn(n)?Qg(e,n,r):e!==`\\`&&dn(r)?Qg(e,r,n):pr({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=mn(t)?Ur(t):[],r=n.filter(mn);if(!mn(t)||r.length!==n.length)return pr({kind:`Union`,base:t});let i=r.flatMap(Ur),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Yi(t,e)||sn(e.elements,t)}),Xr(e.elements)};return Xg(t)||r.some(Xg)?a():r.length===0?Zr:qi(e=>Ui(Jg(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!fn(t))throw new T(`DOMAIN expects a function but received ${L(t)}`);return ga(t)})],r_=Ws(`Integers`,`Neg`,`IntValue`,1),i_=e=>{let n=Ws(e,`DotDot`,`IntervalValue`,2);return[Gs(e,`+`,`Plus`,(e,t)=>e+t),Gs(e,`-`,`Minus`,(e,t)=>e-t),Gs(e,`*`,`Times`,(e,t)=>e*t),Gs(e,`^`,`Expt`,(e,n)=>{if(n<0)throw new t(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(e===0&&n===0)throw new t(`0^0 is undefined.`);return e**n}),Gs(e,`\\div`,`Divide`,(e,n)=>{if(n===0)throw new t(`The second argument of \\div is 0.`);let r=Math.floor(e/n);if(Ns(r))throw Ps(`${e} \\div ${n}`);return r}),Gs(e,`%`,`Mod`,(e,n)=>{if(n<=0)throw new t(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(e%n+n)%n}),Ms(`..`,(e,t)=>{let r=Us(t,n);return{kind:`Interval`,low:Us(e,n),high:r}})]},a_=i_(`Naturals`),o_=i_(`Integers`),s_=e=>{let t=a_.indexOf(e);return t===-1?void 0:o_[t]},c_=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[Hs(qs(`<`,(e,t)=>e<t),t(`LT`)),Hs(qs(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Hs(qs(`<=`,(e,t)=>e<=t),t(`LE`)),Hs(qs(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},l_=[ks(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...a_,...c_(`Naturals`)],u_=[ks(`Int`,{kind:`InfiniteSet`,name:`Int`}),...o_,...c_(`Integers`),z(`-.`,1,e=>{let t=Us(R(e,0,`-`),r_);if(Ns(-t))throw Ps(`-${t}`);return-t})],d_=(e,n,r)=>{let i=R(e,n,r),a=Wi(i);if(!a)throw new t(`${r}\n${P(L(i))}`);return a},f_=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:d_(e,t,n)},p_=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw ws(n,`SubSeq`,`natural number`,r);return r},m_=(e,t,n)=>typeof e==`string`?Un(e.slice(t,n)):fi(e.slice(t,n)),h_=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,g_=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,__=(e,t)=>{let n=ic.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Hs(e,t):e}):t},v_=e=>__(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>f_(e,0,h_(``,`Len`)).length),z(`\\o`,2,e=>{let n=f_(e,0,g_(`s \\o t`,`sequence`));if(typeof n!=`string`){let t=d_(e,1,g_(`t \\o s`,`sequence`)),r=n.length===0?R(e,1,`\\o`):t.length===0?R(e,0,`\\o`):void 0;return r!==void 0&&lr(r)===`tuple`?r:fi([...n,...t])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new t(`${g_(`t \\o s`,`string`)}\n${P(L(r))}`);return Un(n+r)}),z(`Append`,2,t=>fi([...d_(t,0,g_(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let n=d_(e,0,h_(``,`Head`));if(n.length===0)throw new t(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,e=>{let n=f_(e,0,h_(``,`Tail`));if(n.length===0)throw new t(`Attempted to apply Tail to the empty sequence.`);return m_(n,1)}),z(`SubSeq`,3,e=>{let n=f_(e,0,h_(`first `,`SubSeq`)),r=p_(e,1,`second`),i=p_(e,2,`third`);if(r>i)return m_(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 t(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${P(L(R(e,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return m_(n,r-1,i)}),As(`SelectSeq`,2,e=>{let n=Os(e,1,`SelectSeq`);return fi(d_(e,0,h_(`first `,`SelectSeq`)).filter(e=>{let r=n.call([e]);if(typeof r!=`boolean`)throw new t(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),y_=e=>__(`FiniteSets`,[z(`IsFiniteSet`,1,e=>Vi(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!un(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new t(`Attempted to compute cardinality of the value\n${P(L(r))}`);return zi(r,e)})]),b_=[Hs(z(`Warshall`,1,e=>{let n=R(e,0,`Warshall`);if(!un(n)||Kn(n))throw new t(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${P(L(n))}`);zi(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=Fa(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(e=>{let n=Wi(e);if(n?.length!==2)throw new t(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${P(L(e))}`);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 Xr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[fi([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],x_=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return b_;if(e===`AnySet`)return[ks(`ANY`,Xn)];if(e===`IOUtils`)return Bh(r,a);if(e===`_TLCTrace`)return Uh(r);if(!Gg(n.version).has(e))return;let o=w_(e,t,n,r,i);return e===`Randomization`&&o?[...o,mg(n)]:o},S_=/* @__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`]]]),C_=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),w_=(e,t,n,r,i)=>{switch(e){case`Naturals`:return l_;case`Integers`:return u_;case`Sequences`:return v_(n.version);case`FiniteSets`:return y_(n.version);case`TLC`:return __(`TLC`,Vg(t,n));case`Randomization`:return hg(n);case`_Possible`:return Ag(t,n);case`Json`:return zh(r);case`Bags`:return __(`Bags`,uh(i));case`TLCExt`:return __(`TLCExt`,kg(t,n));default:return}},T_=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&ff.get(t)||[];r.expressions.push(...i,t);let a=Ki.sets,o=a??[],s=o.length;Ki.sets=o;try{return n()}catch(e){throw tx(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Ki.sets=a}},E_=(e,t,n)=>e.coverage?qo(e.coverage,t,n):-1,D_=(e,t,n)=>e.coverage?Yo(e.coverage,t,n):n(),O_=(e,t,n,r)=>D_(e,t,()=>$(n,r)),k_=(e,t,n,r)=>{let i=O_(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},A_=(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},j_=e=>!e.includes(void 0),M_=e=>e.variables.map(()=>void 0),N_=(e,t,n)=>{let r=[...e];return r[t]=n,r},P_=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},F_=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,I_=e=>e.kind===`Identifier`?e.name:void 0,L_=(e,t,n)=>{if(t.kind===`Label`)return L_(e,t.body,n);let r=I_(t);if(r===void 0)return;let i=Ly(n,r);if(i?.kind===`Thunk`)return L_(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=kb(r,e);return o?.kind===`Closure`&&o.params.length===0?L_(e,o.body,o.scope):void 0},R_=(e,t,n)=>{if(t.kind===`Prime`)return L_(e,t.expression,n);if(t.kind===`Label`)return R_(e,t.body,n);let r=I_(t);if(r===void 0)return;let i=Ly(n,r);if(i?.kind===`Thunk`)return R_(e,i.expression,i.scope);if(i)return;let a=kb(r,e);return a?.kind===`Closure`&&a.params.length===0?R_(e,a.body,a.scope):void 0},z_=e=>{if(typeof e!=`boolean`)throw new T(`TLC expected a boolean expression.`);return e},B_=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),V_=(e,t,n,r)=>{let i=U_(e,t,n,r);return i&&e.coverage&&!e.isInit&&Jo(e.coverage,r),i},H_=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Jo(r,n),Jo(r,r.roots[n])),e.onState(t),!0},U_=(e,t,n,r)=>t===void 0?j_(n)?H_(e,n,r):e.onIncomplete?.(n)??!1:j_(n)&&B_(e)?G_(e,t,n,r):t.kind===`Predicate`?K_(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?sv(e,t.expression,t.rest,t.scope,n,t.node):W_(e,t,n)&&V_(e,t.rest,n,t.node),W_=(e,t,n)=>{let r=e.environment,i=O_(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return O_(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Iy(t,r.runtime.version):t}})();try{return!Kr(i,a)}catch(t){throw e.callStack&&tx(e.callStack,[i],t),t}},G_=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return sv(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?W_(e,i,n):z_(O_(e,i.node,i.expression,A_(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return H_(e,n,r)},K_=(e,t,n,r,i,a)=>q_(e,t,n,r,i,E_(e,a,t)),q_=(e,t,n,r,i,a)=>T_(e,t,()=>{switch(t.kind){case`Let`:{let o=A_(e,r,i),s=t.definitions,c=e.coverage&&!e.isEnabled?Kb(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):Kb(s,o);return K_(e,t.body,n,c,i,a)}case`Label`:return K_(e,t.body,n,r,i,a);case`Selection`:return K_(e,t.expression,n,r,i,a);default:if(tv.has(t.kind))throw new T(`The state relation is not a boolean expression.`);return T_(e,t,()=>av(e,t,n,r,i,a))}}),J_=(e,t,n,r,i)=>z_(t)&&V_(e,n,r,i),Y_=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),X_=(e,t,n,r,i,a)=>{let o=A_(e,r,i);if(t.kind===`Identifier`){let s=Ly(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return K_(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return K_(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:kb(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&vm(c,e.environment))?K_(e,l.body,n,l.scope,i,a):J_(e,k_(e,a,t,o),n,i,a)}let s=Ab(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=D_(e,a,()=>Hb(s,t.args,o));return K_(e,s.body,n,r,i,a)}let c=Y_.has(t.operator)?O_(e,a,t,o):k_(e,a,t,o);return J_(e,c,n,i,a)},Z_=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?V_(e,t,N_(n,r,i),a):Kr(o,i)&&V_(e,t,n,a)},Q_=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),$_=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?L_(e.environment,o,r):R_(e.environment,o,r),l=A_(e,r,i);if(c===void 0)return O_(e,a,t,l)===!0&&V_(e,n,i,a);let u=O_(e,a,s,l),d=i[c];if(t.operator===`=`)return Z_(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return O_(e,a,t,l)===!0&&V_(e,n,i,a);if(!hi(f))throw new T(`The right side of \\IN is not enumerable.`);let p=ji(f),m=e.coverage&&rs(e.coverage,f,p,!1),h=p.reduce((t,r)=>(m?.next(),V_(e,n,N_(i,c,r),a)||t),!1);return m?.next(),h},ev=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),tv=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),nv={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},rv=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:nv[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${Q(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${Q(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${Q(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${Q(e)}`},iv=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=D_(e,r,()=>rb(t.bounds,e=>{let t=$(e,n);return{value:t,elements:eb(t,e,a)}})),s=o.map(e=>e.elements);ab(t.bounds,s,n.scope,e=>(i.push(e),!1));let c=e.coverage;return{bindings:i,charge:c&&as(c,o.map(e=>e.value),s)}},av=(e,t,n,r,i,a)=>{let o=A_(e,r,i);switch(t.kind){case`Identifier`:return X_(e,t,n,r,i,a);case`Apply`:return ev.has(t.operator)&&t.args.length===2?$_(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?z_(O_(e,a,t.args[0],o))?K_(e,t.args[1],n,r,i,a):V_(e,n,i,a):X_(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>Q_(`Predicate`,t,r,a,e),n);return K_(e,o[0],t,r,i,a)}let s=o[o.length-1];return q_(e,P_(t,o.length-1),Q_(`Predicate`,s,r,a,n),r,i,F_(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>K_(e,o,n,r,i,a)||t,!1);let s=q_(e,P_(t,o.length-1),n,r,i,F_(e,a)),c=K_(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:{let r=iv(e,t,o,a);return r.bindings.reduce((o,s)=>(r.charge?.(),K_(e,t.body,n,s,i,a)||o),!1)}case`Forall`:{let r=iv(e,t,o,a),s=r.bindings;if(s.forEach(()=>r.charge?.()),s.length===0)return V_(e,n,i,a);let c=s.slice(1).reduce((e,n)=>Q_(`Predicate`,t.body,n,a,e),n);return K_(e,t.body,c,s[0],i,a)}case`If`:return K_(e,z_(O_(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>z_(O_(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new T(`TLC encountered a CASE with no conditions true.`);return K_(e,s,n,r,i,a)}case`FunctionApplication`:{let r=fb(O_(e,a,t.function,e.isInit?o:Vy(o)));if(r){let s=D_(e,a,()=>pb(r,t,o));return K_(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return sv(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=K_(e,t.action,n,r,i,a);return sv(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return K_(e,t.action,Q_(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?rv(t):void 0;if(s!==void 0)throw new T(s);return J_(e,O_(e,a,t,o),n,i,a)},ov=(e,t,n)=>e.runtime.warn(Ct.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${Q(n)}`),sv=(e,t,n,r,i,a)=>T_(e,t,()=>{let o=E_(e,a,t),s=L_(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;e.isEnabled&&e.coverage&&Jo(e.coverage,o);let a=i[s];return a!==void 0&&!Kr(a,r)?(ov(e.environment,s,t),!1):Z_(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return V_(e,n,i,o);let c=s.reduceRight((e,t)=>Q_(`Unchanged`,t,r,o,e),n);return sv(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Ly(r,t.name);if(a?.kind===`Thunk`)return sv(e,a.expression,n,a.scope,i,o);let s=a?void 0:kb(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return sv(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=A_(e,r,i),s=Ab(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return sv(e,s.body,n,Hb(s,t.args,a),i,o)}let c=e.environment,l=O_(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=O_(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Kr(l,u)&&V_(e,n,i,o)}),cv=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:t===`enabled`&&e.coverage?.current===-1?void 0:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),lv=/* @__PURE__ */ Error(`The replay found a successor`),uv=(e,t,n,r)=>{let i=()=>{throw lv},a=r.coverage?.current??-1,o=cv(r,`enabled`,n,i,i),s=o.callStack,c=s?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Q_(`Changed`,e.subscript,t,a,void 0);K_(o,e.action,n,t,M_(r),a)}else K_(o,e,void 0,t,M_(r),a);return!1}catch(e){if(e!==lv)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},dv=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=cv(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>Q_(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);K_(o,i.expression,s,i.scope,M_(t),i.node??-1)},fv=(e,t,n,r)=>{if(e.some(e=>tv.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;pv(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},pv=(e,t,n,r,i,a)=>{let o=cv(r,`next`,n,i,a);K_(o,e.expression,void 0,e.scope,M_(r),t)},mv=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(L_(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=Ly(r,e.name)?void 0:kb(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,Kb(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`Selection`:a(e.expression,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`){R_(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Ly(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Ab(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:kb(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,Hb(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??[])},hv=/* @__PURE__ */ new WeakMap,gv=/* @__PURE__ */ new WeakMap,_v=(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},vv=(e,t,n)=>{let r=e.slice();return r[t]=n,r},yv=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,bv=(e,t)=>{let n=new T(t);return e.isInit?n:S(n,C.error)},xv=(e,t,n,r)=>{let i=Ey(n);return r&&tv.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 ${yv(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Sv=(e,t,n)=>{let r=Bs(t),i=Q(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 ${yv(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
1788
+ `:``}${i}`},Cv=(e,t,n)=>Ev(e,t,$(t,n)),wv=new Set(n_.map(e=>e.name)),Tv=e=>e.kind===`Apply`?wv.has(e.operator):e.kind!==`Identifier`&&!tv.has(e.kind),Ev=(e,t,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=xv(e,r,t,i);throw e.isInit&&i&&Tv(t)?new n(a):bv(e,a)},Dv=(e,t,n,r)=>r.environment.callStack?$(n,r):(e[t]??=cx(n,r.environment))(r),Ov=e=>e===`=`||e===`\\in`||e===`\\subseteq`,kv=(e,t,n)=>{let r=n?hv:gv,i=r.get(e);if(i)return i;let a=ly(e,t,n),o=n?void 0:cy(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},Av=(e,t)=>{if(t.constants.has(e))return;let n=Jy(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},jv=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return jv(e.expression,t,!1,r);if(e.kind!==`Identifier`||N(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Av(e.name,t);if(a&&!r.has(a))return r.add(a),jv(a.body,t,n,r)},Mv=(e,t,n)=>jv(e,t,!n),Nv=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Nv(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Kb(e.definitions,_v(r,t,n));return Nv(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Ly(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Nv(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=Av(e.name,r.environment);if(s)return Nv(s.body,void 0,n,r,i)},Pv=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||N(e))||!t&&e.kind===`Prime`,Fv=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Fv(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=Av(e.name,t);if(i)return n.add(e.name),Fv(i.body,t,n)},Iv=/* @__PURE__ */ new Set([`Label`,`Selection`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Lv=(e,t,n)=>Iv.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Ov(e.operator)&&(Pv(e.args[0],n)||Mv(e.args[0],t,n)!==void 0)||N(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Rv=/* @__PURE__ */ new Set,zv=(e,t)=>{if(N(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return xf(e,(e,i)=>{let a=r?zv(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},Bv=(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||N(e)?void 0:Jy(r,t);return i&&!n.has(i)&&(n.add(i),Bv(i.body,t,n))?!0:pt(e).some(e=>Bv(e,t,n))},Vv=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Mv(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=Fv(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Lv(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:kv(e,t,n)}},Hv=(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(Em(e,t)===void 0||Bv(e,t,/* @__PURE__ */ new Set))return!0;let n=zv(e,Rv);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)}},Uv=(e,t,n)=>{let r=e.map(e=>Vv(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=B_(t);for(let s=e;s<r.length;s++){if(s>0&&f&&dy(u)){d??=_v(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&&!Kr(t,i[e.index])}):void 0;if(o){ov(t.environment,o.index,o.expression);return}let s=n.expression,c=Dv(a,e,s,d);if(!Ev(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=_v(t,n,u);let r=Dv(i,s,e.expression,d);if(!Ev(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=_v(t,n,u);let r=Dv(i,s,e.value,d),a=u[e.index];if(a===void 0)u=vv(u,e.index,r),d=void 0;else if(!Kr(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(!Kr(e,n[i.index])){ov(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)},Wv=e=>{let t=rv(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw bv(n,t);Cv(n,e,_v(n,r,i))&&s(i,a)}},Gv=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=_v(r,i,a);if(a[l]!==void 0){Cv(r,e,u)&&c(a,o);return}let d=$(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!hi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${yv(r)}, the right side of \\IN is not enumerable.`;throw bv(r,`${t}\n${Q(e)}`)}let p=ji(f);if(r.generator){for(let e of og(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(vv(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(vv(a,l,p[e]),o)}},Kv=/* @__PURE__ */ new WeakMap,qv=e=>{let t=Kv.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(qv),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Kv.set(e,n),n},Jv=(e,t)=>{let n=e.args[0],r=Wv(e),i=(e,r,i)=>Nv(n,r,i,e,!t)??-1,a=Gv(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=$(e.args[1],_v(t,n,o));l(vv(o,u,d),s)}},Yv=(e,t,n)=>{let r=Q(e);return(i,a,o,s,c,l)=>{let u=_v(i,a,o),d=$(e.function,n?u:Vy(u)),f=fb(d);if(f!==void 0){kv(f.body,t,n)(i,pb(f,e,u),o,s,c,l);return}if(!fn(d))throw bv(i,`In computing ${yv(i)}, a non-function (${Bs(d)}) was applied as a function.\n${r}`);let p=$(e,u);if(typeof p!=`boolean`)throw bv(i,`In computing ${yv(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Xv=(e,t)=>{let n=qv(e);return Fv(e,t)?Uv([n],t,!1):e.kind===`Tuple`?kv(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Ly(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){kv(qv(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=_v(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Ab(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){kv(qv(n.body),t,!1)(r,Hb(n,e.args,u),a,o,s,c);return}}Cv(r,n,u)&&c(a,o)}},Zv=(e,t,n)=>{let r=e.operator,i=Wv(e),a=N(e)?void 0:kb(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=px(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=kv(a.body,t,n),o(e,i(_v(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=_v(a,o,s),f=Ab(e,d);f?.kind===`Closure`?kv(f.body,t,n)(a,Hb(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Qv=(e,t,n)=>{let r=Wv(e),i=N(e)?void 0:Av(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Ly(s,e.name);f?.kind===`Thunk`&&!f.isReleased?kv(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&wb(i,t)!==void 0?r(o,s,c,l,u,d):(a??=kv(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},$v=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||N(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`||!N(i))return;let a=jv(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},ey=e=>e.kind===`And`?e.operands.flatMap(ey):[e],ty=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Lv(e,t,!1),ny=e=>{let t=[];return(n,r,i)=>{let a=_v(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Ev(n,i,Dv(t,r,i,a)))return}}},ry=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=ey(e),r=n.findIndex(e=>!ty(e,t)||$v(e,t)),i=r===-1?void 0:$v(n[r],t);return i?{...i,before:r===0?void 0:ny(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>ry(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`||N(e))return;let r=kb(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=ry(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`||!N(o))return;let s=i.before,c=s&&px(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(_v(e,t,n)),n))}},iy=(e,t,n)=>{let r=Ly(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},ay=(e,t,n)=>{let r=e.map(e=>kv(e,t,n)),i=n?[]:e.map(e=>ry(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&&iy(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)}}},oy=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=Xh(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},sy=(e,t)=>{let n=kv(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=_v(r,i,a),u=t.runtime.version,d=rb(e.bounds,e=>$(e,l)).map((n,r)=>og(Qy(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,zy(i,l,e)))};f(d.length-1,i)}},cy=(e,t)=>{if(e.kind===`Exists`)return sy(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>kv(e,t,!1));return e.isBulleted?oy(n):n.reduce((e,t)=>oy([e,t]))},ly=(e,t,n)=>{let r=e=>kv(e,t,n);switch(e.kind){case`And`:return Uv(e.operands,t,n);case`Or`:return ay(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=Qy($(a.set,_v(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Ry(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Hv(e,t);if(o){let r=Uv(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=_v(n,i,a),d=rb(e.bounds,e=>Qy($(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Ry(t,o.names[e],r);if(e===d.length-1){let e=_v(n,i,a);if(!o.guards.every(t=>Cv(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{ob(e.bounds,_v(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Em(e,t)!==void 0&&!Bv(e.body,t,/* @__PURE__ */ new Set)?zv(e,Rv):void 0;return(t,n,r,o,s,c)=>{let l=[];ob(e.bounds,_v(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Ly(n,e)?.kind===`Value`)){u.every(n=>Cv(t,e.body,_v(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&dy(r)?u.slice(n).every(n=>Cv(t,e.body,_v(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=$(e.condition,_v(r,i,a));if(typeof l!=`boolean`)throw bv(r,Sv(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=_v(r,i,a),u=t.find(e=>{let t=$(e.condition,l);if(typeof t==`boolean`)return t;throw bv(r,`In computing ${yv(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Bs(t)}) was used as a guard condition of a CASE.\n${Ey(e.source)}`)})?.body??n;if(!u)throw bv(r,`In computing ${yv(r)}, TLC encountered a CASE with no conditions true.\n${Q(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Jb(e.definitions,t),a={impure:/* @__PURE__ */ new Set,streamed:i.streamed};return(t,r,o,s,c,l)=>n(t,Kb(e.definitions,_v(t,r,o),t.isEnabled?a:i),o,s,c,l)}case`Unchanged`:return n?()=>{throw new T(`UNCHANGED appears in an initial predicate at ${Cy(e)}`)}:Xv(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Cv(e,i,_v(e,n,r))}catch(n){throw e.isEnabled?Iy(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return ay([e.action,qv(e.subscript)],t,n);case`Label`:return r(e.body);case`Selection`:return r(e.expression);case`Identifier`:return Qv(e,t,n);case`FunctionApplication`:return Yv(e,t,n);case`Apply`:{let i=e.args;if(Ov(e.operator)){let r=Mv(i[0],t,n);if(r!==void 0)return e.operator===`=`?Uv([e],t,n):Gv(e,()=>r);if(Pv(i[0],n))return Jv(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=$(i[0],_v(n,r,a));if(typeof l!=`boolean`){let t=Bs(l),r=Q(e);throw bv(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return Zv(e,t,n)}default:return Wv(e)}},uy=e=>e.variables.map(()=>void 0),dy=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},fy=(e,t)=>{let n=t.state;if(!n||!dy(n))throw new T(`ENABLED needs a complete state at ${Cy(e)}`);let r=t.environment;if(r.callStack||r.coverage&&r.coverage.current!==-1)return uv(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return kv(e,r,!1)(i,t.scope,uy(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},py=(e,t,n,i,a)=>{let o={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};kv(e,t,!0)(o,i,uy(t),void 0,!1,e=>{if(!o.isStopped){if(!dy(e)){if(a){o.isStopped=a([...e]);return}throw S(new r([...e]),C.error)}o.isStopped=n(e)}})},my=(e,t,n)=>{let r=[];return py(e,t,e=>(r.push(e),!1),n),r},hy=(e,t,n)=>{let r=n.variables.filter((t,n)=>e[n]===void 0);return new ne(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)},gy=(e,t,n,r,i,a,o,s)=>{let c={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return kv(e,n,!1)(c,i,uy(n),void 0,!1,(e,t)=>{if(!c.isStopped){if(!dy(e)){if(s){s(e,t);return}throw hy(e,t,n)}c.successors++,c.isStopped=r({state:e,action:t})}}),c.successors},_y=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return kv(e,n,!1)(i,r,uy(n),void 0,!1,e=>{dy(e)||i.successors++}),i.successors>0},vy=(e,t,n,r)=>{let i=[];return gy(e,t,n,e=>(i.push(e),!1),r),i},yy=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),by=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),xy=e=>by.has(e.kind)||e.kind===`Apply`&&yy.has(e.operator),Sy=(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&&dn(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Cy=e=>`line ${e.location.line}, column ${e.location.column}`,Q=e=>{let t=e.location.range;return t?g(t):Cy(e)},wy={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Ty=(e,t)=>new T(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${Q(t)}`),Ey=e=>e.kind===`Number`?e.text??String(e.value):Q(e),Dy=(e,t)=>new T(`A non-boolean expression (${Bs(t)}) was used as the condition of an IF.\n${Q(e)}`),Oy=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new T(`A non-boolean expression (${Bs(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Ey(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new T(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Bs(n)}.\n${Q({...e,location:{...e.location,range:{...r,end:i}}})}`)},ky=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${P(L(n))}\n${Q(e)}`,r=e=>`Attempted to apply function:\n${P(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!fn(i))throw new T(`Attempted to select field "${t}" from a non-record value ${P(L(i))}\n${Q(e)}`);let a=lr(i);if(a===`tuple`)throw oa(t);return ma(i.kind===`LazyFunction`?I(i):i,t,a===`record`?n:r)}},Ay=e=>e===`1.7.4`?(t,n)=>ra(t,n,e):void 0,jy=e=>t=>{if(!fn(t))throw new T(`Attempted to apply the operator DOMAIN to a non-function\n(${Bs(t)})\n${Q(e)}`);return ga(t)},My=(e,t)=>(n,r)=>{if(!un(n)||Kn(n))throw new T(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Q(e)}`);return t(n,r)},Ny=e=>S(new T(`TLC can't handle real numbers.\n${e.text}`),C.configParseError),Py=e=>S(new T(`TLC can't handle a number this big.\n${e.text??e.value}`),C.error),Fy=(e,t)=>new re(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Q(t)}`,e),Iy=(e,t)=>e instanceof re&&t!==`1.7.4`?new T(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Ly=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Ry=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),zy=(e,t,n)=>{if(t.kind===`Name`)return Ry(e,t.name,n);let r=Wi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new T(`Argument mismatch in operator application.${e?g(e):``}`)}return t.names.reduce((e,t,n)=>Ry(e,t,r[n]),e)},By=(e,t)=>{if(fn(e))return e;throw new T(`A non-function (${Bs(e)}) was applied as a function.\n${Q(t)}`)},Vy=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Hy=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Uy=(e,t)=>{if(typeof e!=`boolean`)throw new T(`Expected ${t} to be a boolean but found ${L(e)}`);return e},Wy=(e,t,n)=>{if(typeof e!=`boolean`)throw new T(`Attempted to evaluate an expression of form P => Q when ${n} was\n${Bs(e)}.\n${Q(t)}`);return e},Gy=(e,t)=>{if(typeof e!=`boolean`)throw new T(`Attempted to apply the operator ~ to a non-boolean\n(${Bs(e)})\n${Q(t)}`);return!e},Ky=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new T(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${Q(n)}`);return e===t},qy=(e,t)=>{if(typeof e!=`boolean`)throw new T(`TLC expected a boolean value, but did not find one. ${Ey(t)}`);return e},Jy=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Yy=(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.`},Xy=(e,t,n)=>{if(!un(e)||Kn(e)){let r=L(e),i=n===`1.7.4`?void 0:Yy(e,r);throw new T(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Ey(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Ey(t)}\n${i}`)}},Zy=(e,t,n)=>(Xy(e,t,n),typeof e==`object`&&e.kind===`Interval`?ci(e):Ci(e)??ki(e)),Qy=(e,t,n)=>n===`1.7.4`?(Xy(e,t,n),Ci(e)??ji(e)):Zy(e,t,n),$y=e=>{if(typeof e==`object`&&e.kind===`Interval`)return zi(e),e},eb=(e,t,n)=>$y(e)??Qy(e,t,n),tb=(e,t,n)=>$y(e)??Zy(e,t,n),nb=(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},rb=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),ib=(e,t)=>rb(e,e=>eb($(e,t),e,t.environment.runtime.version)),ab=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):nb(t[n],t=>i(n-1,zy(a,e[n].pattern,t)));return i(e.length-1,n)},ob=(e,t,n)=>ab(e,ib(e,t),t.scope,n),sb=(e,t,n,r)=>{let i=rb(e,e=>{let n=$(e,t);return{value:n,elements:eb(n,e,t.environment.runtime.version)}}),a=i.map(e=>e.elements),o=as(n,i.map(e=>e.value),a);return ab(e,a,t.scope,e=>(o(),r(e)))},cb=(e,t)=>{let n=rb(e,e=>$(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},lb=(e,t,n)=>{if(e.length===1)return zy(t,e[0].pattern,n);let r=Wi(n)??[];return e.reduce((e,t,n)=>zy(e,t.pattern,r[n]),t)},ub=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,db=e=>Object.assign(e.value,{lambda:e}),fb=e=>ub(e)?e.lambda:void 0,pb=(e,t,n)=>{let r=e.value,i=t.args.map(e=>$(e,n)),a=i.length===1?i[0]:fi(i),o=(e,n,i)=>`In applying the function\n${P(L(r))},\nthe ${e} is:\n${P(L(n))}${i}.\n${Q(t.function)}`,s=e.bounds;if(s.length===1){if(!Yi(a,r.domain))throw new T(o(`first argument`,a,`which is not in its domain`));return lb(s,e.scope,a)}let c=Wi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new T(`Attempted to apply a function to an argument not in its domain.\n${Q(t.function)}`);let u=()=>new T(`In applying the function\n${P(L(r))},\nthe argument list is:\n${P(L(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Yi(n,l[t]))throw new T(o(r,n,`${e.pattern.kind===`Name`?``:`
1789
+ `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Wi(n)?.length!==e.pattern.names.length)throw new T(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return lb(s,e.scope,a)},mb=(e,t)=>{if(t.location.range)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:Ey(t)}},hb=(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}},gb=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},_b=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),vb=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),yb=(e,t)=>{let n=cb(e.bounds,t),r=gb(n,(n,r)=>$(e.body,Hy(t,lb(e.bounds,Ry(void 0,e.name,r),n))),hb(mb(e.bounds,e.body),e.bounds,n),_b(e.bounds));db({value:r,bounds:e.bounds,body:e.body,scope:Ry(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=yb(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?ur(i):i},bb=(e,t)=>{if(typeof t!=`object`||lr(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!dn(t.domain))return t;try{let e=I(t);return or(e.domain,e.range)}catch(e){if(e instanceof T)return t;throw e}},xb=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new T(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>yb(e,t):cx(vb(e),t):cx(e.body,t),Sb={name:``,binding:{kind:`Value`,value:!1},parent:void 0},Cb=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=xb(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=e.kind===`Operator`&&e.params.length===0&&Cm(e.body,t)?e=>(i===void 0?void 0:a[i])??r(Hy(e,hx(e.scope)?void 0:Sb)):i===void 0?e=>r(Hy(e,void 0)):e=>a[i]??r(Hy(e,void 0));return t.definitionEvaluators.set(e,o),o},wb=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Tb=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!ym(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>bb(e,xb(e,t)(i)));Wr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof T)&&!x(e))throw e}}),Eb=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&_r(e[n],t))}catch(e){if(e instanceof T)return!1;throw e}},Db=(e,t)=>{let n=e.cache;if(n!==void 0&&Eb(t.state,e.state)&&Eb(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?Yo(r,i,()=>$(e.expression,Hy(t,e.scope))):$(e.expression,Hy(t,e.scope));return(!e.isStreamed||Ni(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},Ob=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),kb=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return kb(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Ob(r):t.builtins.get(e)},Ab=(e,t)=>N(e)?jb(e.operator,t):kb(e.operator,t.environment)??jb(e.operator,t),jb=(e,t)=>{let n=Ly(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return kb(e,t.environment)},Mb=e=>e.kind===`Closure`?e.params.length:e.arity,Nb=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:jb(n,t);if(!r)throw new T(`Expected an operator argument at ${Cy(e)}`);return r},Pb=(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)=>Ry(e,n.name,t[r]),e.scope);return $(e.body,Hy(n,r))},Fb=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Mb(e),call:n=>Pb(e,n,t)},Ib=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=jb(e.name,t);return n!==void 0&&Mb(n)>0},Lb=(e,t)=>e.map(e=>Ib(e,t)?Fb(Nb(e,t),t):$(e,t)),Rb=(e,t)=>new T(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),zb=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Bb=(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 Bb(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([])}},Vb=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&gn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=zb(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=N(e)?void 0:Bb(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=Ly(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:zb(e,t)}}return t=>zb(e,t)},Hb=(e,t,n,r)=>{if(t.length!==e.params.length)throw Rb(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:Nb(t[a],n)}:(r?.[a]??Vb(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Ub=(e,t,n,r)=>e.kind===`Closure`?$(e.body,Hy(n,Hb(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>$(e,n))):e.isLazy?e.evaluate(dx(t,n),n):e.evaluate(Lb(t,n),n),Wb=/* @__PURE__ */ new WeakMap,Gb=e=>{let t=Wb.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return Wb.set(e,n),n},Kb=(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),a=!1;for(let o=e.length-1;o>=0;o--){let s=e[o];a||=s.isRecursive;let c=s.kind===`Operator`&&s.params.length===0&&!a?r[o].parent:i;r[o].binding=s.kind===`Function`?{kind:`Thunk`,expression:Gb(s),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:s.params.length>0||n?.impure.has(s)?{kind:`Operator`,operator:{kind:`Closure`,name:s.name,params:s.params,body:s.body,scope:c}}:{kind:`Thunk`,expression:s.body,scope:c,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(s)??!1}}let o=t.environment.coverage;return o&&o.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&o.values.set(e.binding,o.current)}),i},qb=(e,t,n)=>{let r=Ly(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Db(r,n);if(r?.kind===`Operator`){if(Mb(r.operator)===0)return Pb(r.operator,[],n);throw new T(`Operator ${e} is used without arguments`)}let i=Bb(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Fy(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Cb(i.definition,n.environment)(n);let a=n.environment.builtins.get(n.environment.substitutions.get(e)??e);if(a?.arity===0)return a.evaluate([],n);throw new T(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Q(t)}`)},Jb=(e,t)=>({impure:new Set(e.filter(e=>Sm(e,t,`varying`))),streamed:new Set(e.filter(e=>Sm(e,t,`streamed`)))}),Yb=e=>[...e.facts.ids.keys()].some(t=>Sm(t,e)),Xb=e=>[...e.facts.ids.keys()].some(t=>Sm(t,e,`repeated`)),Zb=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,Qb=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),$b=e=>t=>{let n=e(t);return _r(n,e(Qb(t)))},ex=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Ki.sets,o=Ki.callStack,s=a??[],c=s.length;Ki.sets=s,Ki.callStack=r;try{let a=t(i),o=Zb(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&xy(e)&&r.sources.set(o,e),o}catch(t){t instanceof u&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Sy(e,r.values),a=i&&!pt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!fn(a)?void 0:a;throw tx(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Ki.sets=a,Ki.callStack=o}},tx=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof T){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},nx=(e,t,n)=>{if(!(n instanceof T))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},rx=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}}),ix=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw Oy(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},ax=(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)}},ox=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=qo(n,i,e);Jo(n,a),n.current=a;try{let i=t(r),o=e.kind===`SetEnumeration`||(e.kind===`SetFilter`||e.kind===`SetMap`)&&dn(i)||e.kind===`SetFilter`&&typeof i==`object`&&i.kind===`FilteredSet`||(e.kind===`FunctionSet`||e.kind===`RecordSet`)&&typeof i==`object`&&i.kind===e.kind||e.kind===`Apply`&&e.operator===`SUBSET`&&typeof i==`object`&&i.kind===`Subset`;return typeof i==`object`&&o&&n.values.set(i,a),i}finally{n.current=i}},sx=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=zx(e,t),i=t.callStack,a=i&&ff.get(e),o=i?ex(e,r,t,i):r,s=i&&a?ax(e,a,o,i):o,c=t.coverage,l=c?ox(e,s,c):s;return t.evaluators.set(e,l),l},cx=(e,t)=>{if(t.callStack||t.coverage)return sx(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=Jm(e,t)??sx(e,t);return t.entryEvaluators.set(e,r),r},$=(e,t)=>cx(e,t.environment)(t),lx=(e,t)=>{let n=e.name,r=N(e)?void 0:Bb(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Fy(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??=Cb(e,t))(r)}return t=>qb(n,e,t)},ux=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||N(e))return!0;let n=kb(e.name,t);return n===void 0||Mb(n)===0},dx=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>$(e,t),expression:e})),fx=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(dx(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&ux(t[0],n)){let e=sx(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&ux(t[0],n)&&ux(t[1],n);if(i&&a){let e=sx(t[0],n),r=sx(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Lb(t,n),n)},px=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Rb(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Vb(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:Nb(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},mx=(e,t,n)=>{let r=px(e,t,n),i;return t=>(i??=cx(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},hx=e=>{for(let t=e;t!==void 0;t=t.parent){let e=t.binding;if(e.kind!==`Operator`||e.operator.kind!==`Closure`||e.operator.params.length===0)return!1;let n=e.operator.scope;for(;n!==void 0&&n!==t;)n=n.parent;if(n!==t)return!1}return!0},gx=/* @__PURE__ */ new Set([`\\cup`,`\\cap`,`\\`]),_x=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=sx(n[0],t),i=sx(n[1],t);return t=>!Wy(r(t),e,`P`)||Wy(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=sx(n[0],t);return t=>Gy(r(t),e)}if(e.operator===`<=>`){let r=sx(n[0],t),i=sx(n[1],t);return t=>Ky(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Ty(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=N(e)?void 0:kb(e.operator,t);if(r?.kind===`Closure`)return mx(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=sx(n[0],t),i=jy(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!df.has(e)&&!Dm(n[0],t),a=t.tlcEvalValues;return t=>{if(!i||!hx(t.scope))return r.evaluate(dx(n,t),t);let o=a.get(e);if(o!==void 0)return o;let s=r.evaluate(dx(n,t),void 0);return a.set(e,s),s}}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&r.evaluateBinary&&n.length===2){let i=sx(n[0],t),a=sx(n[1],t),o=My(e,r.evaluateBinary),s=t.coverage;return s?e=>{let t=i(e),n=a(e);if(typeof t!=`object`||t.kind!==`Set`||!s.values.has(t))return o(t,n);let r=t.elements.findIndex(e=>!Yi(e,n));return Xo(s,t,(r===-1?t.elements.length:r)+1),r===-1}:e=>o(i(e),a(e))}let i=t.coverage,a=r?.kind===`Builtin`?r.evaluateBinary:void 0;if(i&&a&&gx.has(e.operator)&&n.length===2){let r=sx(n[0],t),o=sx(n[1],t);return t=>{let n=r(t),s=o(t);return Zo(i,e.operator,n,s,a(n,s))}}if(r?.kind===`Builtin`)return fx(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new T(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let o=n.map(e=>Vb(e,t));return r=>{let i=jb(e.operator,r);if(i)return Ub(i,n,r,o);throw t.definitions.get(e.operator)?.kind===`Function`?new T(`${e.operator} is a function; apply it with brackets`):new T(`Unknown operator ${e.operator} at ${Cy(e)}`)}},vx=(e,t)=>{let n=e.kind===`Forall`,r=sx(e.body,t),i=e.bounds[0],a=t.coverage;if(a)return t=>sb(e.bounds,t,a,i=>qy(r(Hy(t,i)),e)!==n)?!n:n;if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=sx(i.set,t);return s=>nb(eb(o(s),i.set,t.runtime.version),t=>qy(r(Hy(s,Ry(s.scope,a,t))),e)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let i=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return a=>{let s=rb(o,e=>eb(sx(e,t)(a),e,t.runtime.version)),c=(t,o)=>t<0?qy(r(Hy(a,o)),e)!==n:nb(s[t],e=>c(t-1,Ry(o,i[t],e)));return c(o.length-1,a.scope)?!n:n}}return t=>ob(o,t,i=>qy(r(Hy(t,i)),e)!==n)?!n:n},yx=(e,t)=>{if(e.kind===`Tuple`)return fi(e.names.map(e=>{let n=Ly(t,e);return n?.kind===`Value`&&n.value}));let n=Ly(t,e.name);return n?.kind===`Value`?n.value:void 0},bx=/* @__PURE__ */ new WeakSet,xx=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&bx.add(e)},Sx=/* @__PURE__ */ new WeakMap,Cx=e=>{if(Sx.has(e))return Sx.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=mt(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),pt(e).every(n)},r=n(e)?[...t]:void 0;return Sx.set(e,r),r},wx=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Ly(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),Tx=e=>bx.has(e),Ex=(e,t)=>{let n=Tx(e),r=sx(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(Hy(t,Ry(t.scope,n,e)));if(cn(e))return zi(e),ln(e,i),f(e,t);let o=ui(e),s=or(o,o.map(i));return dn(e)?s:(s.lambdaDomain=e,ur(s))}let n=[],s=rb(i,(n,r)=>tb(i.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return ab(i,s,t.scope,e=>{let o=i.length===1?yx(a.pattern,e)??!1:fi(i.map(t=>yx(t.pattern,e)??!1));return n.push([o,r(Hy(t,e))]),!1}),ti(n)},c=mb(i,e.body),l=_b(i),u=Cx(e.body),d=t.coverage,f=(n,a)=>{let o=wx(a.scope,u),s=Hy(a,o),f=e=>r(Hy(s,lb(i,o,e))),p=d&&!t.callStack?d.current:-1,m=db({value:gb(n,d?e=>d.current===-1?f(e):Yo(d,p,()=>f(e)):f,hb(c,i,n),l),bounds:i,body:e.body,scope:o});return i.length===1?ur(m):m},p=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!yi(t))return f(t,r);if(!(i.length===1?dn(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(dn))){if(p)return f(t,r);try{return s(t,r)}catch(e){if(!(e instanceof T))throw e;return f(t,r)}}if(!p)return s(t,r);try{return s(t,r)}catch(t){throw nx(p,e,t),t}},createLazy:f}},Dx=(e,t)=>{let n=Ex(e,t).build,r=e.bounds,i=t.coverage;if(i)return t=>{let a=cb(r,t),o=n(a,t),s=r.length===1||typeof a!=`object`||a.kind!==`ProductSet`?[a]:a.factors;return(typeof o!=`object`||o.kind!==`LazyFunction`)&&s.every(dn)&&i.current!==-1&&i.covered.has(e)&&os(i,i.current,s),o};if(r.length===1&&r[0].pattern.kind===`Name`){let e=sx(r[0].set,t);return t=>n(e(t),t)}return e=>n(cb(r,e),e)},Ox=(e,t)=>{let n=bx.has(e);n&&xx(e.function);let r=sx(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=>sx(e,t))}),value:sx(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):fi(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Hy(i,Ry(i.scope,`@`,e))):_a(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(Ct.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Q(e.function)}`)}return n}},kx=(e,t)=>{let n=sx(e.predicate,t),r=e.bound.pattern,i=Ey(e.predicate),a=e.predicate.location.range&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:i},o=t.coverage,s=(t,n,c,l)=>{let u=(e,t)=>{if(r.kind===`Tuple`&&Wi(e)?.length!==r.names.length)throw new T(`Attempted to check if the value:\n${P(L(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(Hy(n,zy(n.scope,r,e)));if(typeof a!=`boolean`)throw new T(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${i} yielded non-Boolean value.`);return a},d=r=>s(t,{...n,environment:r},sx(e.predicate,r),-1);return!o||l===-1?{kind:`FilteredSet`,base:t,test:u,source:a,rebind:d}:{kind:`FilteredSet`,base:t,test:(e,t)=>Yo(o,t?-1:l,()=>u(e,t)),startPass:e=>{let n=es(o,t);return r=>{n?.next(),ns(o,t,r),o.secondary[l]++;let i=Yo(o,l,()=>u(r,!1));return e&&i&&o.secondary[l]++,i}},source:a,rebind:d}};return(e,t,r=-1)=>s(e,t,n,r)},Ax=e=>N(e)||e.kind===`OperatorReference`||pt(e).some(Ax),jx=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!Ax(e.predicate)&&!xm([e.predicate],t,`varying`),Mx=(e,t)=>{if(typeof e!=`boolean`)throw new T(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Bs(e)}.\n${Ey(t.predicate)}`);return e},Nx=(e,t,n,r)=>{if(!un(e)||Kn(e))throw new T(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Q(t)}`);return Gr(e),tb(e,n,r)},Px=e=>new T(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Q(e)}`),Fx=(e,t)=>{if(e.kind===`SetFilter`){let n=sx(e.predicate,t),r=sx(e.bound.set,t),i=kx(e,t),a=e.bound.pattern,o=t.coverage,s=jx(e,t);return t=>{let c=r(t);if(!dn(c))return i(c,t,o?.current);let l=[],u=c.kind===`Interval`?c:F(c).elements,d=Array.isArray(u)?u.length:u.high-u.low+1;for(let r=0;r<d;r++){let i=Array.isArray(u)?u[r]:u.low+r,o=n(Hy(t,zy(t.scope,a,i)));if(Mx(o,e))sn(l,i);else if(s)break}return o&&Xo(o,c,d+1),ar(l)}}if(e.kind===`SetMap`){let n=sx(e.expression,t),r=t.coverage;return t=>{let i=[],a=e=>(sn(i,n(Hy(t,e))),!1);return r?sb(e.bounds,t,r,a):ob(e.bounds,t,a),Xr(i)}}let n=e.set;if(!n)return()=>{throw new T(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${Q(e)}`)};let r=sx(e.body,t),i=sx(n,t),a=t.coverage;return t=>{let o=i(t),s=Nx(o,e,n,t.environment.runtime.version),c=a&&rs(a,o,s,!0),l,u=e.pattern;if(nb(s,n=>{if(c?.next(),u.kind===`Tuple`&&Wi(n)?.length!==u.names.length)throw new T(`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${Q(e)}`);let i=zy(t.scope,u,n);return qy(r(Hy(t,i)),e)?(l=yx(u,i),!0):!1}),l!==void 0)return l;throw c?.next(),Px(e)}},Ix=e=>[...e].sort((e,t)=>$n(e.name,t.name)),Lx=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Rx=(e,t)=>{let n=Ix(e),r=e.map(e=>sx(e.value,t));if(Lx(n))return t=>pi(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>Sn(i,t,r.map(t=>t(e)),a)}return e=>mi(i,r.map(t=>t(e)))},zx=(e,t)=>{let n=e=>sx(e,t);switch(e.kind){case`Number`:{let t=e.value;return gn(t)?()=>t:()=>{throw Py(e)}}case`Decimal`:return()=>{throw Ny(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return lx(e,t);case`Apply`:return _x(e,t);case`Bracket`:return()=>{throw new T(`A bracket without a function or subscript is not an expression at ${Cy(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new T(`An operator cannot be used as a value at ${Cy(e)}`)};case`And`:{let r=e.operands.map(n);return ix(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Oy(e,n,i);if(!i)return!1}return!0})}case`Or`:{let r=e.operands.map(n);return ix(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Oy(e,n,i);if(i)return!0}return!1})}case`Prime`:{let t=n(e.expression);return e=>t(Qb(e))}case`Unchanged`:return $b(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Dy(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new T(`A non-boolean expression (${Bs(t)}) was used as a condition of a CASE. ${Ey(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new T(`Attempted to evaluate a CASE with no conditions true.\n${Q(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Hy(n,Kb(e.definitions,n)))}case`Forall`:case`Exists`:return vx(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Ty(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new T(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${Q(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return Fx(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Xr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>fi(t.map(t=>t(e)))}case`FunctionConstruction`:return Dx(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return Rx(e.fields,t);case`RecordSet`:{let t=Ix(e.fields),r=t.map(e=>e.name),i=t.map(t=>e.fields.indexOf(t)),a=e.fields.map(e=>n(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:r,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:r,sets:i.map(e=>t[e])}}}case`Except`:return Ox(e,t);case`ExceptAt`:return t=>{let n=Ly(t.scope,`@`);if(n?.kind!==`Value`)throw new T(`@ appears outside an EXCEPT at ${Cy(e)}`);return n.value};case`FunctionApplication`:{xx(e.function);let r=n(e.function),i=t=>By(r(Vy(t)),e),a=e.args.map(n),o=Ay(t.runtime.version);if(a.length===1){let e=a[0];return t=>ma(i(t),e(t),o)}return e=>ma(i(e),fi(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=ky(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=$b(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new T(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${Q(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>fy(t,e)}case`Label`:return n(e.body);case`Selection`:return n(e.expression);case`Subexpression`:return()=>{throw new T(`The subexpression reference at ${Cy(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Ty(wy[e.kind],e)}}},Bx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Vx=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Oa(e[t]),16777619),r=Math.imul(r^Pa(e[t]),1540483477);t[0]=Bx(n)||1,t[1]=Bx(r)},Hx=()=>{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)}}},Ux=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),Wx=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=ya(t,Oa(e[n]));return t&1073741823},Gx=(e,t)=>{for(let n=0;n<t.length;n++)if(!yr(e[n],t[n]))return!1;return!0},Kx=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,qx=(e,t,n)=>{let r=e.slots.length-1;for(let i=Kx(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&Gx(e.states[r-1],n))return r-1}},Jx=(e,t,n)=>{let r=e.slots.length-1,i=Kx(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},Yx=(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&&Jx(e,t[n],t[n+1])}Jx(e,t,n+1)},Xx=(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}},Zx=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),Qx=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return Xx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},$x=e=>Atomics.load(e.used,0)*2>=e.slots.length,eS=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Xx(t,n);return{slots:t,used:e.used}},tS={kind:`Boolean`,value:!0},nS={kind:`Boolean`,value:!1},rS=e=>e?tS:nS,iS=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,aS=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,oS=(e,t)=>({kind:e,body:t}),sS=(e,t,n)=>({kind:e,operands:[t,n]}),cS=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?cS(e,t.operands).operands:[t])}),lS=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return lS(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,lS(t)),0)}},uS=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 uS(e.body);case`And`:case`Or`:return e.operands.some(uS)}},dS=/* @__PURE__ */ new WeakMap;let fS=0;const pS=e=>{let t=dS.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`#${fS++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(pS).join(`,`)})`;default:return`${e.kind}(${pS(e.body)})`}})();return dS.set(e,n),n},mS=(e,t)=>e===t||pS(e)===pS(t),hS=(e,t)=>{let n=pS(t);return e.some(e=>e===t||pS(e)===n)},gS=e=>e===`And`?`Or`:`And`,_S=(e,t)=>{switch(e.kind){case`Boolean`:return t?rS(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?oS(`Not`,e):e;case`Not`:return _S(e.body,!t);case`And`:case`Or`:return cS(t?gS(e.kind):e.kind,e.operands.map(e=>_S(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return oS(n,_S(e.body,t))}}},vS=e=>{switch(e.kind){case`Boolean`:return rS(!e.value);case`Not`:return e.body;case`And`:case`Or`:return cS(gS(e.kind),e.operands.map(vS));case`Always`:return oS(`Eventually`,vS(e.body));case`Eventually`:return oS(`Always`,vS(e.body));default:return oS(`Not`,e)}},yS=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=yS(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return rS(t)}return n.length===0?rS(!t):n.length===1?n[0]:cS(e.kind,n)}case`Not`:{let t=yS(e.body);return t.kind===`Boolean`?rS(!t.value):oS(`Not`,t)}case`Always`:case`Eventually`:{let t=yS(e.body);return oS(e.kind,t.kind===e.kind?t.body:t)}default:return e}},bS=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,xS=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=xS(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new T(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>cS(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=xS(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=bS(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:cS(`Or`,t);n.push(oS(`Always`,oS(`Eventually`,e)))}return cS(`Or`,n)}case`Not`:return iS(e.body)?e:xS(vS(e.body));default:return e}},SS=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?SS(e.operands[0]):cS(e.kind,e.operands.map(SS));case`Not`:return e.body.kind===`Not`?SS(e.body.body):oS(`Not`,SS(e.body));case`Always`:case`Eventually`:case`Next`:return oS(e.kind,SS(e.body));default:return e}},CS=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return CS(e.operands[0]);let t=Math.floor(e.operands.length/2);return sS(e.kind,CS(cS(e.kind,e.operands.slice(0,t))),CS(cS(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return oS(e.kind,CS(e.body));default:return e}},wS=(e,t)=>{e.kind===`Eventually`&&!hS(t,e)&&t.push(e),`body`in e&&wS(e.body,t),`operands`in e&&e.operands.forEach(e=>wS(e,t))},TS=e=>{let t=e.filter(aS),n=e.flatMap(e=>e.kind===`Not`&&aS(e.body)?[e.body]:[]);return!t.some(e=>hS(n,e))},ES=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,oS(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new T(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},DS=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:oS(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},OS=(e,t,n)=>e.flatMap(e=>{let r=DS(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),kS=e=>[...new Set(e.map(pS))].sort().join(`|`),AS=(e,t)=>{let n=new Set(t.map(kS));return[...e.filter(e=>!n.has(kS(e))),...t]},jS=e=>{let t=ES(e),n=OS(t,`Always`,`And`),r=OS(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=DS(t,`Eventually`,`Or`);if(n&&!(hS(e,n.first)||hS(e,n.second)))return AS(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(hS(e,t.first)||hS(e,t.second))&&!hS(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!TS(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=DS(t[e],`Always`,`And`);n&&(hS(t,n.first)||t.push(n.first),hS(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)hS(t,e.first)&&hS(t,e.second)&&!hS(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!TS(t)?[]:i(t)};return a(e)},MS=e=>({particle:e,successors:[],statePredicates:e.filter(e=>lS(e)<=1)}),NS=e=>{let t=jS([e]).map(MS),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=kS(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 jS(n)){let n=kS(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(MS(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},PS=(e,t)=>!hS(e,t)||hS(e,t.body),FS=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&lS(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=bS(e);if(n){let e=lS(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(uS(e))throw new T(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},IS=(e,t)=>{let n=e.findIndex(e=>mS(e,t));return n===-1?(e.push(t),e.length-1):n},LS=e=>{let t=xS(yS(_S(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=SS(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])FS(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:cS(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:mS(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&CS(e.formula),n=[];t&&wS(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>IS(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>IS(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>IS(i,e))}));return{tableau:t&&NS(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},RS=()=>S(new T(`Temporal formula is a tautology (its negation is unsatisfiable).`),C.livenessEvaluationFailure),zS=/* @__PURE__ */ new Set([`~>`,`-+->`]),BS=/* @__PURE__ */ new WeakSet,VS=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),HS=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),US=(e,t)=>new T(`TLC cannot handle the temporal formula ${Q(e)}${t===void 0?``:`:\n${t}`}`),WS=(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=WS(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Ly(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=Jy(e,n);if(t)return wm(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:N(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return bf(e,(e,o)=>(a=Math.max(a,WS(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(zS.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=N(e)?void 0:kb(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Hb(o,e.args,HS(n,t)))}default:return l(e)}},GS=(e,t)=>{try{return ib(e,t)}catch(e){if(!(e instanceof T))throw e;if(!Pt(e))return;throw S(new T(`${a}${e.message}`),C.error)}},KS=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>KS(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,Q(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Selection`)return a(e.expression,t);if(e.kind===`Let`)return a(e.body,qS(e,t,n));if(e.kind===`Identifier`){let r=N(e)?Ly(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,BS.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:Jy(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(wm(o,n)>0||wb(o,n)===void 0)){if(i.expanding.has(o))throw m();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=HS(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||WS(e,t,n)===3)){let t=Ab(e,o),r=N(e)?void 0:Jy(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,Hb(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>WS(e.set,t,n)===0),c=s?GS(e.bounds,o):void 0;if(s&&c){let n=[];if(ab(e.bounds,c,t,t=>(n.push(...a(e.body,t,Q(e.body))),!1)),n.length===0)throw RS();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},qS=(e,t,n)=>{let r=Kb(e.definitions,HS(n,t),Jb(e.definitions,n));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&BS.add(e.binding);return r},JS=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,a=(e,t,i)=>{let a=i===0&&!r?WS(e,t,n):i;if(a===0){let r=$(e,HS(n,t));if(typeof r!=`boolean`)throw new T(`TLC expected a boolean value, but did not find one. ${Ey(e)}`);return rS(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,s=(e,t,r,i)=>{if(o>=100)throw m();o++;let s=p(e,t);o--;let c=lS(s),l=c===0&&WS(r,i,n)>2;return c>2||l?s:a(r,i,c)},c=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=HS(n,t),o=N(e)||Jy(i,n)===void 0?Ly(t,i):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&BS.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:N(e)?jb(i,a):kb(i,n),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?VS.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,cS(f,n))}if(c?.kind!==`Closure`)throw US(e);let m=!N(e)&&Jy(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>$(e,a)),s(c.body,Hb(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof i||n&&!r;throw!(t instanceof T)||a?t:US(e)}},u=(e,t)=>{let r=WS(e,t,n),o=[],s=e.kind===`Forall`;try{ob(e.bounds,HS(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof T)||n instanceof i)throw n;if(r<=2)return a(e,t,r);throw US(e,s&&!Pt(n)?n.message:void 0)}return o.length===0?rS(s):d(e,t,cS(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=lS(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,cS(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,cS(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let i=WS(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Selection`:return p(e.expression,t);case`Let`:return p(e.body,qS(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!N(e))return d(e,t,oS(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,sS(`Or`,oS(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&WS(e.condition,t,n)===0){let r=$(e.condition,HS(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,sS(`Or`,sS(`And`,i,p(e.consequent,t)),sS(`And`,oS(`Not`,i),p(e.alternative,t))))}}if(i<=2)return a(e,t,i);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?oS(`Always`,sS(`Or`,oS(`Not`,p(e.args[0],t)),oS(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return oS(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=oS(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?oS(`Always`,oS(`Eventually`,sS(`Or`,i,a))):sS(`Or`,oS(`Eventually`,oS(`Always`,i)),oS(`Always`,oS(`Eventually`,a)))}default:throw US(e)}};return p(e,t)},YS=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?$(t.expression,r):fy(t.step,r);if(typeof i!=`boolean`)throw new T(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&Kr($(a,{environment:e,scope:i,state:n,next:void 0}),$(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=$(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new T(`Encountered an action predicate that's not a boolean.`);return o}}),XS=(e,t,n,r,i)=>{let a=e=>XS(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return XS(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new T(`TLC cannot evaluate a temporal formula in a single step`)}},ZS=(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)=>ZS(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 XS(e,t[r],t[a(r)],YS(i),/* @__PURE__ */ new Map)}},QS=`UnnamedAction`,$S={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},eC=e=>{let t=e.range??$S;return pi([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},tC=(e,t)=>{let n=[[`name`,e.name],[`location`,eC(e.location)]];return e.parameters.length>0&&n.push([`context`,pi(e.parameters)],[`parameters`,fi(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),pi(n)},nC=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),rC=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),iC=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,aC=e=>e.kind===`Apply`?e.args:[],oC=(e,t,n)=>{let r=iC(e);if(r===void 0)return;if(N(e)){let e=Ly(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=kb(r,n);return i?.kind===`Closure`?i:void 0},sC=(e,t)=>{try{return $(e,rC(t,void 0)),!0}catch(e){if(e instanceof v)return!1;throw e}},cC=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&ym(e,t)&&sC(e.body,t),lC=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&cC(e,t),uC=(e,t)=>{let n=Jy(e.name,t);return n?.body===e.body&&lC(n,t)},dC=(e,t)=>{if(e.kind!==`Identifier`||!N(e))return;let n=Ly(t,e.name);return n?.kind===`Thunk`?n:void 0},fC=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:qS(e,t,n)};let r=dC(e,t);return r&&{expression:r.expression,scope:r.scope}},pC=(e,t,n,r)=>t.kind===`Apply`?Hb(e,t.args,rC(r,n)):e.scope,mC=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ly(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),hC=(e,t)=>{try{return e()}catch(e){if(e instanceof v)return t();throw e}},gC=(e,t,n,r,i)=>{let a=aC(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=>WS(e,n,i)!==0)?o():hC(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),$(e,rC(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},_C=(e,t,n,r,i)=>{let a=()=>({name:n?.name??QS,location:e.location,parameters:mC(n,t),expression:e,scope:t});if(tv.has(e.kind))throw S(new T(`${l}The next state relation is not a boolean expression.\n${Ey(e)}`),C.error);switch(e.kind){case`Let`:return _C(e.body,qS(e,t,r),n,r,i);case`Label`:return _C(e.body,t,n,r,i);case`Selection`:return _C(e.expression,t,n,r,i);case`Or`:return e.operands.flatMap(e=>_C(e,t,n,r,i));case`Exists`:return hC(()=>{let o=[];return ob(e.bounds,rC(r,t),t=>(o.push(..._C(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=N(e)?void 0:i.get(iC(e)??``),s=oC(e,t,r);if(o)return gC(o,e,t,s,r);if(!s)return[a()];let c=aC(e),u=N(e)?s.name:r.instanceNames.get(iC(e)??``)??s.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return uC(s,r)||c.some(e=>WS(e,t,r)!==0)?d():hC(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:$(n,rC(r,t))},parent:e}),s.scope);return _C(s.body,e,{...s,name:u},r,i)},d)},vC=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>vC(e,t,n,r,i,o),s=(e,t,n)=>nC(e,pf(t,a),n),c=fC(e,t,n);if(c){o(c.expression,c.scope);return}let l=oC(e,t,n);if(l&&uC(l,n))return;let u=l?[...a,...ff.get(l.body)??[]]:a;if(l&&l.params.length===0){if(WS(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,Hb(l,e.args,rC(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(QS,e,t));return}let d=WS(e,t,n);d<=1?r.inits.push(s(QS,e,t)):d===3&&r.temporals.push(s(QS,e,t))},yC=(e,t,n,r,i)=>{let a=(t,n)=>yC(e,t,n,r,i),o=fC(t,n,r);if(o){a(o.expression,o.scope);return}let s=oC(t,n,r);if(s&&uC(s,r))return;if(s&&s.params.length===aC(t).length){a(s.body,pC(s,t,n,r));return}if(t.kind===`Forall`&&hC(()=>(ob(t.bounds,rC(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(nC(e,a)):WS(a,n,r)<2?i.invariants.push(nC(e,a)):i.impliedTemporals.push(nC(e,t));return}let c=WS(t,n,r);c<=1?i.impliedInits.push(nC(e,t)):c===3&&i.impliedTemporals.push(nC(e,t))},bC=(e,t)=>{let n=Jy(e,t);return n?.kind===`Operator`&&!lC(n,t)?n:void 0},xC=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:bC(e.specification,t);a&&(vC(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:QS,location:e.frames[0].location,parameters:[],expression:pf(e.expression,e.frames),scope:e.scope}]:_C(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:kb(e.init,t);o?.kind===`Closure`&&r.inits.push(nC(e.init??``,o.body));let s=e.next===void 0?void 0:kb(e.next,t);return s?.kind===`Closure`&&r.actions.push(..._C(s.body,s.scope,s,t,n)),r},SC=(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);if(e.kind===`Selection`)return i(e.expression,t);let a=fC(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&N(e)?Ly(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!N(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=oC(e,t,n);if(!s||s.params.length!==aC(e).length)return!0;let c=Jy(s.name,n);return c?.body===s.body&&cC(c,n)?!0:i(s.body,pC(s,e,t,n))};return i(e,t)?r:void 0},CC=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,wC=(e,t,n=!1)=>`${e.name===QS?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:CC(e)} ${g(e.location.range??$S)}`,TC=e=>`${e.name}${CC(e)}`,EC=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=bC(e,n);t&&i.invariants.push(nC(e,t.body))}),t.properties.forEach(e=>{let t=bC(e,n);t&&yC(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Yr(e.map(e=>{let n=a&&t&&xs(a,t,e.expression);return tC(e,n&&pi(n))})),s=e=>Yr(e.flatMap(e=>{let t=bC(e,n);return t?[pi([[`name`,t.name],[`location`,eC(t.location)]])]:[]}));return pi([[`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`,Yr(n.variables.map((e,t)=>pi([[`name`,e],[`location`,eC(r[t])],...a?[[`coverage`,pi([[`distinct`,ls(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},DC=2**50,OC=2**51,kC=(e,t,n,r)=>({fingerprint:e,tableau:t,position:n,stateChecks:r,successors:[],actionChecks:[],stepPositions:[],number:0}),AC=(e,t,n,r)=>{e.successors.push(t),e.actionChecks.push(n),e.stepPositions.push(r)},jC=(e,t)=>e.stepPositions[e.successors.indexOf(t)],MC=e=>{let t=e[e.length-1];return--e.length,t},NC=(e,t,n,r)=>{let i={initial:[],isPartial:!1},a=t.tableau;if(!a){let t=/* @__PURE__ */ new Map,r=kC(e[0],-1,0,n.getStates(0));AC(r,r,n.getStutters(0),0),t.set(e[0],r),i.initial.push(r);for(let i=1;i<e.length;i++){let a=t.get(e[i]);if(a===void 0){let a=kC(e[i],-1,i,n.getStates(i));AC(a,a,n.getStutters(i),i),AC(r,a,n.getSteps(i),i),t.set(e[i],a),r=a}else r.successors.includes(a)||AC(r,a,n.getSteps(i),i),r=a}return i}let o=/* @__PURE__ */ new Map,s=e=>{let t=o.get(e)??[];return o.set(e,t),t},c=(t,o,s,c,l,u)=>{for(let d=0;d<t.length;d++){let f=t[d],p=a.nodes[f.tableau].successors;for(let t=0;t<p.length;t++){let a=p[t],d=s[a];if(d===void 0){if(!n.isConsistent(a,c))continue;let t=kC(e[c],a,c,l);AC(f,t,u,c),o.push(t),s[a]=t}else f.successors.includes(d)||AC(f,d,u,c),d.position!==c&&(i.isPartial=!0,r&&!o.includes(d)&&o.push(d))}}},l=s(e[0]),u=n.getStates(0),d=n.getStutters(0);for(let t=0;t<a.initialCount;t++){if(!n.isConsistent(t,0))continue;let r=kC(e[0],t,0,u);i.initial.push(r),l[t]=r}for(let e of i.initial)for(let t of a.nodes[e.tableau].successors){let n=l[t];n?AC(e,n,d,0):i.isPartial=!0}let f=[...i.initial];r&&c(f,f,l,0,u,d);for(let t=1;t<e.length;t++){let r=s(e[t]),i=n.getStates(t),a=[];c(f,a,r,t,i,n.getSteps(t)),c(a,a,r,t,i,n.getStutters(t)),f=a}return i},PC=(e,t,n)=>{let r=t.promises,i=t.tableau?.nodes??[],a=[],o=1,s=DC+1,c=OC+1,l=s,u=c,d=s,f=c,p=t.models[0],m,h=(e,t)=>{let n=e.actionChecks[t],r=p.eventuallyAlways;for(let e=0;e<r.length;e++)if(!n[r[e]])return!1;return!0},g=t=>{let n=[],a=c-1,o=p.infinitelyOftenStates,s=p.infinitelyOftenActions,l=o.map(()=>!1),u=s.map(()=>!1),d=r.map(()=>!1),f=o.length+s.length+r.length,m=t;for(;f>0;){m.number=c;let e=f;search:for(;;){for(let e=0;e<o.length;e++)!l[e]&&m.stateChecks[o[e]]&&(l[e]=!0,f--);for(let e=0;e<r.length;e++)!d[e]&&PS(i[m.tableau].particle,r[e])&&(d[e]=!0,f--);if(f<=0)break;let t,p,h=f;for(let e=0;e<m.successors.length;e++){let r=m.successors[e],i=r.number;if(a<=i&&i<=c){t=r;for(let t=0;t<s.length;t++)!u[t]&&m.actionChecks[e][s[t]]&&(u[t]=!0,f--)}if(f<h){n.push(m),m=r,c++;break search}a<=i&&i<c&&(p=r)}if(f<e&&t){n.push(m),m=t,c++;break}for(;p===void 0;){m=MC(n);for(let e=0;e<m.successors.length;e++){let t=m.successors[e];if(a<=t.number&&t.number<c){n.push(m),p=t;break}}}n.push(m),m=p,m.number=c}}c++,m.number=c;close:for(;m!==t;){let e=!1;for(let r=0;r<m.successors.length;r++){let i=m.successors[r];if(a<=i.number&&i.number<c){if(n.push(m),i===t)break close;e=!0,m=i,m.number=c;break}}e||(m=MC(n))}n.length===0&&n.push(m);let h=[];for(let n=0;n<=t.position;n++)(n===0||e[n]!==e[n-1])&&h.push(n);let g=h.length;for(let e=1;e<n.length;e++)n[e].fingerprint!==n[e-1].fingerprint&&h.push(jC(n[e-1],n[e]));let _=n[n.length-1];return{positions:h,cyclePosition:g,backPosition:_.fingerprint===t.fingerprint?void 0:jC(_,t)}},_=e=>{let t=p.infinitelyOftenStates,n=p.infinitelyOftenActions,a=t.map(()=>!1),o=n.map(()=>!1),s=r.map(()=>!1),l=[e];for(e.number++;l.length>0;){let e=MC(l);for(let n=0;n<t.length;n++)a[n]||(a[n]=e.stateChecks[t[n]]);for(let t=0;t<e.successors.length;t++){let r=e.successors[t],i=r.number;if(i>=c)for(let r=0;r<n.length;r++)o[r]||(o[r]=e.actionChecks[t][n[r]]);i===c&&(r.number++,l.push(r))}for(let t=0;t<r.length;t++)PS(i[e.tableau].particle,r[t])&&(s[t]=!0)}c+=2,m!==void 0||a.includes(!1)||o.includes(!1)||s.includes(!1)||(m=g(e))},v=e=>{let t=e.successors.indexOf(e);return t!==-1&&d<=e.number&&h(e,t)},y=e=>{let t=MC(a);if(t===e&&!v(e))return e.number=c++,!1;for(t.number=c;t!==e;)t=MC(a),t.number=c;return!0},b=e=>{let t=s++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number;d<=i&&h(e,n)&&((i<l||f<=i&&i<u)&&(i=b(r)),i<t&&(t=i))}return t===e.number&&y(e)&&_(e),t},x=e=>{let t=MC(a);if(t===e&&!e.successors.includes(e)){e.number=DC;return}let n=[];for(d=s++,f=c,t.number=d,n.push(t);t!==e;)t=MC(a),t.number=d,n.push(t);return n},S=e=>{let n=x(e);if(n)for(let e of t.models){p=e,l=s,u=c;for(let e=n.length-1;e>=0;e--)n[e].number<u&&b(n[e])}},ee=e=>{let t=o++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number===0?ee(r):r.number;i<t&&(t=i)}return t===e.number&&S(e),t};for(let e of n)if(e.number===0&&ee(e),m)return m},FC=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=(t,n,i)=>(a.clear(),XS(t,e[n],i===void 0?void 0:e[i],r,a)),s=e.map((e,t)=>t),c=e.map((e,t)=>t);if(i){let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map;for(let i=0;i<e.length;i++){let a=n.get(t[i])??i;if(n.set(t[i],a),Gx(e[a],e[i])&&(s[i]=a),i===0)continue;let o=s[i-1]*e.length+s[i];c[i]=r.get(o)??i,r.set(o,c[i])}}let l=n.map(e=>{let t=[],n=[],r=[],a=[],l=e.tableau?.nodes.map(e=>e.statePredicates)??[];return{getStates:n=>{let r=s[n];return t[r]??=e.stateChecks.map(e=>o(e,r,void 0))},getSteps:t=>{let r=c[t];return n[r]??=e.actionChecks.map(e=>o(e,r-1,r))},getStutters:t=>{let n=s[t];return r[n]??=e.actionChecks.map(e=>o(e,n,n))},isConsistent:(e,t)=>{let n=s[t],r=a[n]??=[],c=i?r[e]:void 0;return c===void 0?(r[e]=l[e].every(e=>o(e,n,void 0)),r[e]):c}}}),u=[];for(let e=0;e<n.length;e++){let r=NC(t,n[e],l[e],!1),i=PC(t,n[e],r.initial);if(i)return i;r.isPartial&&u.push(e)}for(let e of u){let r=NC(t,n[e],l[e],!0),i=PC(t,n[e],r.initial);if(i)return i}},IC=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return IC(e.body);case`And`:case`Or`:return e.operands.some(IC);default:return!1}},LC=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,RC=e=>e.promises.some(e=>IC(e.body))||e.models.some(e=>!LC(e)),zC=(e,t)=>e.every((e,n)=>yr(e,t[n])),BC=e=>e.filter((t,n)=>n===0||e[n-1]!==t),VC=e=>({data:e(1024),length:0,create:e}),HC=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},UC=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},WC=e=>new Int32Array(e).fill(-1),GC=(e,t)=>(e.edgeStarts[t]??-1)!==-1,KC=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},qC=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,JC=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),YC=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},XC=2**53-1,ZC=(e,t,n)=>{let r=t.map(e=>JS(e.expression,e.scope,n)),i=e.map(e=>JS(e.expression,e.scope,n)),a=i.map(e=>oS(`Not`,e)),o=a.length===1?a[0]:cS(`Or`,a);return{formula:r.length===0?o:cS(`And`,[...r,o]),checks:i}},QC=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},$C=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>$C(e,t));return;default:$C(e.body,t)}},ew=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>$C(e,t));return[...t]},tw=e=>ew(e).flatMap(e=>QC(e).map(e=>e.expression)),nw=(e,t)=>{let n=/* @__PURE__ */ new Set;$C(e,n);let r=[...n].flatMap(QC);return r.every(e=>e.scope===void 0)?!xm(r.map(e=>e.expression),t,`repeated`):!Xb(t)},rw=(e,t,n,r,i,a)=>[...new Set(e.filter((e,o)=>{try{return!ZS(t[o],n,r,0,i)}catch(e){if(!a||!(e instanceof T))throw e;return a.push(e),!1}}).map(e=>e.name))],iw=(e,t,n)=>{if(e.length===0)return;let r=ZC(e,t,n),i=LS(r.formula),a=YS(n),o=nw(r.formula,n);return{solutions:i,findTraceViolation:(t,s)=>{let c=FC(t,s,i,a,o);if(!c)return;let l=[],u=rw(e,r.checks,c.positions.map(e=>t[e]),c.cyclePosition-1,n,l);return{...c,properties:u,failures:l}}}},aw=(e,t,n,r)=>{if(e.length===0)return;let i=ZC(e,t,n),a=nw(i.formula,n),o=LS(i.formula),s={atoms:YS(n),replay:void 0},c=ow(o,{atoms:{holdsState:(e,t)=>s.atoms.holdsState(e,t),holdsAction:(e,t,n)=>s.atoms.holdsAction(e,t,n)},isShared:a,isSame:zC,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},{getFingerprint:r.getFingerprint,forEachActionSuccessors:(e,t,n)=>r.forEachActionSuccessors(e,t,n,s.replay)},n.runtime.version!==`1.7.4`),l=(e,t)=>{if(e===void 0)return t();s.atoms=YS(e),s.replay=e;try{return t()}finally{s.atoms=YS(n),s.replay=void 0}};return{branches:c.branches,solutions:o,addInitialState:(e,t,n)=>l(n,()=>c.addInitialState(e,t)),addState:(e,t,n,r)=>l(r,()=>c.addState(e,t,n,r!==void 0)),storeState:c.storeState,getStateCounts:c.getStateCounts,findViolation:c.findViolation,getViolatedProperties:(t,r)=>rw(e,i.checks,t,r,n)}},ow=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new T(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=pS(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:VC(e=>new Int32Array(e)),edgeActions:VC(e=>new Uint8Array(e)),stateResults:VC(e=>new Uint8Array(e)),initial:[],firstNodes:VC(WC),lastNodes:VC(WC),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),y=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),b=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},x=(e,t,n,r,i,a)=>c(n,()=>b(e,t,r,i,a)),S=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},ee=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=UC(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},C=(e,t,n,r)=>{let i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),UC(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],UC(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?HC(e.firstNodes,t,[r]):e.nextSiblings[a]=r,HC(e.lastNodes,t,[r]),r},te=(e,t)=>t<0?e.checks.nodes.some((n,r)=>ee(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,w=(e,t,n)=>(te(e,t)||e.stateCount++,C(e,t,n,JC(e,t,n))),ne=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;HC(e.edgeTargets,o,n),i.forEach((t,n)=>HC(e.edgeActions,(o+n)*s,r,t*s,s)),HC(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},E={slots:/* @__PURE__ */ new Int32Array},re=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;E.slots=E.slots.length===s?E.slots.fill(0):new Int32Array(s);let c=e=>{let r=E.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=E.slots.length>>1){let e=E.slots;E.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}E.slots.length>s&&a++;let u=[];for(let e of E.slots)e!==0&&u.push(o[e-1]);return u},ie=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&y(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!x(e,n,a,r,s,c))continue;if(S(t,n)&&e.errorNode===void 0&&e.solution.models.some(LC)){e.errorNode=o;return}let i=ee(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??w(e,a,n);h.push(l),f.push(0),i===void 0&&ie(e,t,r,a,l,s,c)}let _=[g],b=1;if(n.forEachActionSuccessors(a,r,n=>{let o=m(n.length),l=new Uint8Array(n.length*d);_.push(l);for(let m=0;m<n.length;m++){let g=n[m],_=p(1);y(e,a,r,s,c,g.state,o,m*i.size,l,m*d);let v=e.isDone[g.index]===!0;for(let n of u.successors){if(!x(e,n,a,g.state,_,0))continue;let r=ee(e,g.index,n);if(r!==void 0&&h.includes(r))continue;let i=r??w(e,g.index,n);h.push(i),f.push(b+m),r===void 0&&v&&ie(e,t,g.state,g.index,i,_,0)}}b+=n.length}),h.length>0){let t=new Uint8Array(b*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;ne(e,o,h,t,f,l)}},ae=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)b(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),te(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of YC(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=ee(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??w(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ie(e,t,i.state,i.index,p,r,a*s)}}),ne(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:ce(e,e.errorNode)},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)JC(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{GC(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),GC(e,i)||e.stateCount++,ne(e,i,a,n,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)GC(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of KC(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}GC(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new T(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ce=(e,t)=>BC(se(e,t).reverse().map(t=>e.nodeStates[t])),D=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>GC(e,t)),c=[],l=t=>{let n=KC(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&PS(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=XC;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=XC,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>qC(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>KC(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=ce(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&qC(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(KC(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new T(`TLC failed to build the counterexample of a liveness property`);_=t,c=KC(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let y=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];y[y.length-1]!==n&&y.push(n)}let b=c[c.length-1];return y[y.length-1]===b&&y.pop(),{prefix:c.slice(0,-1),cycle:[b,...y.reverse()],isCycleConstrained:RC(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of KC(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new T(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=0;for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r,n.push(t,l,-42),c.push(l);let u=r++;KC(e,l).forEach((t,r)=>{GC(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)x(r,a,void 0,t,n,0)&&r.initial.push(ee(r,e,a)??w(r,e,a))}},addState:(e,t,n,r)=>{let a=re(e,t,n),o=p(a.length),s=a.findIndex(t=>t.index===e)*l.size,c=m(a.length);for(let n of _){let l=n.checks.actions.length,u=new Uint8Array(a.length*l);a.forEach((r,a)=>y(n,e,t,o,s,r.state,c,a*i.size,u,a*l));let d=v(n,e,t,o,s),f=n.solution.tableau;if(r&&(f?YC(n,e).some(e=>n.edgeCounts[e]>0):a.every(e=>GC(n,e.index))))throw new T(`The behavior graph holds every edge of the state already.`);if(!f){oe(n,a,u,d,e);continue}let p=ae(n,f,a,o,u,d,e);if(p)return p}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=ee(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,C(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=D(e,t);if(n)return n}}}},sw=e=>{switch(e.kind){case`Number`:if(!gn(e.value))throw S(new t(`TLC can't handle a number this big.\n${e.value}`),C.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return nr(e.name);case`Set`:return F({kind:`MixedSet`,elements:e.elements.map(sw)})}},cw=e=>{try{return sw(e)}catch(e){throw!(e instanceof T)||e instanceof t||e instanceof f?e:S(new T(`${l}${e.message}`),C.error)}},lw=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new T(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&_r(t,r)})});if(t)return t[1];throw new T(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},uw=e=>new w(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),dw=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=cw(e.value);Wr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new w(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(sw),sw(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,lw(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new w(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new w(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new w(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw uw(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw uw(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new w(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new w(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),v=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&v(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=v(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=Bf(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let y=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(y.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new w(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},fw=`tlc2/value/impl/`,pw={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},mw={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},hw=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)}},gw=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),_w=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],vw=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??gw.get(e[3])}${`[]`.repeat(e[1].length)}`),yw=(e,t)=>e[e[t].first].text,bw=(e,t)=>yw(e,t).replaceAll(`/`,`.`),xw=e=>{let t=hw(e);if(t.readUint32()!==3405691582)throw new s(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===pw.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===pw.integer?a.value=t.readInt32():r===pw.float?t.readUint32():r===pw.long||r===pw.double?(t.readBytes(8),e++):r===pw.class||r===pw.string||r===pw.methodType||r===pw.module||r===pw.package?a.first=t.readUint16():r===pw.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=bw(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=vw(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:hw(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>bw(n,d.readUint16())):[],p=_w.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=vw(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},Sw=(e,t)=>{let n=e[t],r=e[n.second];return{className:yw(e,n.first),name:e[r.first].text}},Cw=(e,t,n,r)=>{let i=()=>new p(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===pw.integer)return n.value;if(n.tag===pw.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=mw.iconstM1&&n<=mw.iconst5)o.push(n-mw.iconst0),e+=1;else if(n===mw.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===mw.sipush)o.push(l()<<16>>16),e+=3;else if(n===mw.ldc)o.push(c(a[e+1])),e+=2;else if(n===mw.ldcW)o.push(c(l())),e+=3;else if(n===mw.dup){let t=s();o.push(t,t),e+=1}else if(n===mw.getstatic){let n=Sw(t,l());if(n.className!==`${fw}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===mw.invokestatic){let n=Sw(t,l()),a=s();if(n.className!==`${fw}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===mw.new)o.push({className:yw(t,l()),value:void 0}),e+=3;else if(n===mw.invokespecial){let n=Sw(t,l()),a=s(),o=s();if(!(n.className===`${fw}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===mw.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},ww=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=xw(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:Cw(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)}))}},Tw=/* @__PURE__ */ new WeakMap,Ew=/* @__PURE__ */ new WeakMap,Dw=(e,t)=>{let n=yf(e,t),r=Tw.get(e);return r!==void 0&&Tw.set(n,r),n},Ow=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&Tw.set(n,e.arity)}),kw=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},Aw=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),jw=(e,t)=>new s(`${e} at line ${t.line}, column ${t.column}`),Mw=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Mw(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`&&e.kind!==`Selection`)for(let r of pt(e).slice(0,Ew.get(e))){let e=Mw(r,t,n);if(e)return e}},Nw=e=>({line:e.line,column:e.column}),Pw=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:Nw(n)}),e),Fw=(e,t)=>{let n=e.location;if(e.params.length===0)return t;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw jw(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:t,location:n}}if(e.args.length!==e.params.length)throw jw(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:bu,params:e.params,body:t,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:bu,args:e.args,location:n,resolution:yu},location:Nw(n)}},Iw=(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:yu})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:yu}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:yu};return Fw({...t,params:[...t.params,...r]},Pw(a,t.lets,n))},Lw=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s=-1,c,l,u=!1,d=0,f=[],p=[],m,h=(e,t)=>{!m&&e&&(m={location:g(e),message:t})},_=(e,t,r=!1)=>{let i=n.selectorRanges?.[o];e&&i&&f.push({node:e,error:{location:g(i),message:t},isEmpty:r})},v=(e,t)=>{if(!e)throw jw(t,i);Su.set(n,{applications:p,nulls:f,error:{location:g(e),message:t}}),Ew.set(n,d),u=!0},y=n=>{let r=[],a=[];for(;o<e.length;){let s=e[o];if(s.kind!==`Name`&&!n)return;if(s.kind!==`Name`)throw jw(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>_f(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o++}throw jw(`Unknown operator ${r.join(`!`)}`,i)},b=t=>{let l=y(t);if(!l){u=!0;return}let f=l.definition,m=Tw.get(f)??Iu(f),g=o===e.length-1;if(l.args.length!==m){let e=n.argumentRanges?.[o]??i.range,t=`The operator ${$s(l.name)} requires ${m-l.earlier} arguments.`;if(!r||l.args.length!==0)return d+=l.earlier,v(e,t);h(e,t)}if(d+=l.args.length,l.args.forEach((e,t)=>Tu.set(e,{operator:l.name,index:t,range:n.selectorRanges?.[o]})),g)return{definition:f,args:l.args};let _=f.location.range,b=Tw.has(f)&&_?.module===i.range?.module&&Pu(i,f.location);if(p.push({operator:l.name,range:n.selectorRanges?.[o],args:l.args,params:b?Array(m).fill(0):Lu(f)}),f.isRecursive&&_&&_.module===i.range?.module&&Pu(i,_.end))return v(n.selectorRanges?.[o],`Subexpression of \`${l.name}' used inside the operator's definition.`);if(f.kind!==`Operator`)throw jw(`Cannot select a subexpression of ${f.name}`,i);a.params.push(...f.params),a.args.push(...l.args),c=f.body,s=o,o++},x=()=>{for(;o<e.length&&!u;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],s=c&&Mw(c,t.name,[]);if(!s)return v(i,`Cannot find label \`${t.name}'.`);let l=s.label.params;if(t.args.length!==l.length){let e=`Label \`${t.name}' used with wrong number of arguments.`;if(!r)return v(i,e);h(i,e)}d+=t.args.length,a.lets.push(...s.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),p.push(Aw(t.name,i,t.args)),c=s.label.body,o++}},S=t=>{if(!c)throw jw(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;let r=n.selectorRanges?.[o],s=`Choosing operand \`${kw(t)}' of subexpression with no operands.`;if(Su.has(c)){v(r,s);return}if(xu.has(c)&&c.kind!==`Lambda`&&c!==l&&(_(c,s,!0),l=c,c=c.kind===`Let`&&c.body.kind===`Apply`&&c.body.operator===`$subexpression`?c.body:c.kind===`Selection`?c:{kind:`Tuple`,elements:[c],location:c.location}),c.kind===`Label`){c=c.body,S(t);return}let u=`Nonexistent operand specified by \`${kw(t)}'.`;if(c.kind===`Let`){if(t.kind!==`Operand`||cd(t.operand,1)!==0){v(r,`A LET/IN expression has only one operand.`);return}a.lets.push(c.definitions),c=c.body;return}let f=fd(c);if(f&&(t.kind===`Bound`||t.kind===`At`)){if(t.kind===`Bound`&&t.args.length!==f.names.length){v(r,`Selector with ${t.args.length} argument(s) used for quantifier with ${f.names.length} bound identifier(s).`);return}a.params.push(...f.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&(d+=t.args.length,a.args.push(...t.args),p.push(Aw(``,r,t.args))),c=xu.has(c)&&f.body.kind===`Selection`?f.body.expression:f.body;return}if(c.kind===`Case`){let i=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]];if(o===e.length-1){v(r,`Subexpression of CASE must have form !i!j.`);return}let a=t.kind===`Operand`?i[cd(t.operand,i.length)]:void 0;if(!a){v(r,u);return}o++;let s=e[o],l=s.kind===`Operand`?cd(s.operand,2):-1,d=n.selectorRanges?.[o];if(l===-1){v(d,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=l===0?a.condition:a.body;if(!f){v(d,`Selecting OTHER in a CASE statement.`);return}c=f;return}if(c.kind===`Except`&&t.kind===`Operand`&&cd(t.operand,c.updates.length+1)>0){v(r,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let m=f?f.sets:pd(c);if(!m&&c.kind!==`Identifier`){v(r,`Selecting subexpression of expression that has none.`);return}if(t.kind!==`Operand`){v(r,u);return}let h=m?.[cd(t.operand,m.length)];h?c=h:v(r,u)},ee=b(void 0);if(u)return n;if(ee)return Iw(ee.definition,{...a,args:ee.args});for(x();o<e.length&&!u;){let t=e[o];if(t.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)return v(n.selectorRanges?.[o-1],`A name selector here must be from a LET clause.`),n;a.lets.push(c.definitions);let e=b(c.definitions);if(u)return n;if(e)return Iw(e.definition,{...a,args:[...a.args,...e.args]});x()}else{if(t.kind===`Colon`&&e[o-1].kind!==`Name`)return v(n.selectorRanges?.[o-1],`!: should not follow an operand selector.`),n;if(t.kind===`Colon`&&e[o+1]?.kind!==`Name`&&(s!==o-1||o!==e.length-1))return v(n.selectorRanges?.[o],`\`!:' can be used only after a name and either at the end after an
1790
+ operator name or before an operator name.`),n;t.kind!==`Colon`&&(_(c,`Subexpression selection failed, probably due to an error in the selected expression.`),_(c,`Choosing operand \`${kw(t)}' of subexpression with no operands.`,!0)),S(t),_(c,`An unexpected null node specified by '${kw(e[o])}'.\nThis is probably due to a previous error.`),o++}}if(u)return n;if(!c)throw jw(`Subexpression selection failed`,i);let C=a.params.length,te=a.args.length;if(C!==te){let e=`Expected ${C} arguments but found ${te}.`;if(!r||te>0)return v(i.range,e),n;h(i.range,e)}let w=Pw(c,a.lets,i),ne=e=>({kind:`Selection`,expression:e,location:a.params.length===0&&w.kind!==`Lambda`?i:Nw(i)}),T=Fw(a,w.kind===`Lambda`?{...w,body:xu.has(w)?w.body:ne(w.body),location:i}:ne(w));return Eu.set(T,f),m&&Cu.set(T,m),T},Rw=(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 ld(e,t,n)},zw=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||pt(e).some(zw),Bw=(e,t,n,r=!1)=>{if(!zw(e))return e;if(e.kind===`Let`){e.recursive&&Ow(e.recursive,e.definitions);let r=[],i=n=>r.find(e=>e.name===n)??e.definitions.find(e=>e.name===n)??t(n),a=t=>!e.definitions.some(e=>e.name===t)&&n(t);e.definitions.forEach(e=>r.push(Dw(e,e=>Bw(e,i,a))));let o={...e,definitions:r,body:Bw(e.body,i,a)};return o.instances?{...o,instances:o.instances.map(e=>Vw(e,i,a))}:o}let i=e.kind===`Apply`?t(e.operator):void 0,a=i?.kind===`Operator`?i.params:e.kind===`Apply`?Zf.get(e.operator.slice(e.operator.lastIndexOf(`!`)+1))?.formals:void 0,o=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>Bw(e,t,n,a!==void 0&&a[r]?.arity!==0))}:bf(e,e=>Bw(e,t,n)),s=pt(e),c=pt(o).every((e,t)=>e===s[t])?e:o,l=c.kind===`Subexpression`?c.selectors:c.kind===`Identifier`?Rw(c.name,[],void 0,t):c.kind===`Apply`?Rw(c.operator,c.args,c.argumentCounts,t):void 0,u=l?.[0],d=t=>{Ew.set(e,t),Ew.set(c,t)};if(!l)return c.kind===`Apply`&&c.operator.includes(`!`)&&!t(c.operator)&&d(0),c;let f=l.findIndex(e=>e.kind!==`Name`),p=l.slice(0,f===-1?l.length:f),m=p.some((e,n)=>n>0&&t(p.slice(0,n+1).map(kw).join(`!`)));if(u?.kind===`Name`&&n(u.name)&&!m)return c;if(u?.kind===`Name`&&l[1].kind!==`Name`&&!t(u.name))return d(0),c;let h=Lw(l,t,c,r),g=Ew.get(c);g!==void 0&&d(g);let _=fu.get(e);return _&&h!==c&&fu.set(h,_),h!==c&&xu.set(h,c),h},Vw=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Bw(e.expression,t,n,!0)}))}),Hw=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Uw=(e,t)=>Vw(e,Hw(t.definitions),()=>!1),Ww=(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=/* @__PURE__ */ new Set([...e.definitions,...r]);Ow(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return Pu(e.location,t)||e.isRecursive&&n!==void 0&&Pu(n,t)},s=/* @__PURE__ */ new Map,c=(e,t)=>n=>{let r=e(n);if(!(!r||i.has(r)&&!o(r,t)))return s.get(r)??r},l=Hw([...t,...e.definitions]),u=e=>n.has(e),d=Hw([...t,...e.definitions,...r]),f=(e,t)=>Bw(e,c(d,t),e=>u(e)&&r.every(t=>t.name!==e)),p=e=>{let t=t=>u(t)||!e(t),n=n=>Bw(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return wu.set(t,e),t},i=e=>e.map(e=>({...e,set:n(e.set)})),a=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:a(e)),conclusion:n(e.conclusion)}:n(e),o=o=>{switch(o.kind){case`Use`:case`Hide`:return{...o,facts:r(o.facts)};case`Instance`:return Vw(o,e,t);case`Define`:return{...o,definitions:o.definitions.map(r=>r.kind===`Instance`?Vw(r,e,t):Dw(r,n))};case`Have`:case`Case`:return{...o,expression:n(o.expression)};case`Witness`:return{...o,expressions:o.expressions.map(n)};case`Take`:return{...o,bounds:i(o.bounds)};case`Pick`:return{...o,bounds:i(o.bounds),body:n(o.body)};case`Assert`:return{...o,statement:a(o.statement)};default:return o}},s=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:o,resolveProof:s};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(t.body.kind===`Define`){let e=t.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=p(t=>e.find(e=>e.name===t)??r(t))}return t})}};return{lookup:e,resolveFacts:r,resolveStatement:a,resolveStep:o,resolveProof:s}},m=e.definitions.some(e=>zw(e.body))||e.assumptions.some(e=>zw(e.expression));m&&[...e.definitions,...r].toSorted((e,t)=>Fu(e.location,t.location)).forEach(e=>s.set(e,Dw(e,t=>f(t,e.location))));let h={...e,theorems:e.theorems.map(e=>{let t=p(c(l,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&p(c(l,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>({...e,facts:p(c(l,e.location)).resolveFacts(e.facts)}))};return m?{...h,definitions:e.definitions.map(e=>s.get(e)??e),assumptions:e.assumptions.map(e=>({...e,expression:f(e.expression,e.location)}))}:h},Gw=(e,t)=>e.maxLevels[t]??3,Kw=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Qp({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>op(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>op(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>sp(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=rp(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)&&op(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($p(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,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,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&o(p(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&o(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(tp(e.name,n));i!==void 0&&Gw(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=rp(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=Gw(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw c([...r.values()])}},qw=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Jw=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Yw=new Map(Zs.flatMap(e=>e.map(t=>[t,e[0]]))),Xw=e=>Yw.get(e)??e,Zw=()=>{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}}},Qw=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:ht(e)&2147483647,kind:t,isLocal:n}),$w=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Xw(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Xw(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}},eT=(e,t)=>{let n=[];for(let r=t;;){let t=$w(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},tT=e=>({line:e.line,column:e.column}),nT=(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=eT(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},rT=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,iT={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},aT=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&rT(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&rT(e[n+1],e[n+2])?n+=rT(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=>iT[e])}"`:r.text)}return t},oT=e=>e[2]?.text,sT=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},cT=(e,t)=>e.find(e=>e.name===t)??e.map(e=>cT(e.modules,t)).find(Boolean),lT=e=>{let t=e===void 0?[]:Te(e),n;return{tokens:t,ranges:sT(t),getModule:()=>n??=e===void 0?hu(``):gu(e,t)}},uT=(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=lT(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)??rc.get(i)??Ug.get(i)??pu(e,i),c=a(s),l=c.tokens,u=c.ranges.get(oT(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:()=>cT(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()}},dT=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=eT(t,e+1);i.push({location:tT(t[e]),apply:e=>r.forEach(t=>e.put(Qw(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:tT(n),apply:t=>t.put(Qw(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`&&eT(t,u+1).every(e=>s.has(e))&&o(u,`definition`),Jw.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(tT(n)),i.push({location:tT(n),apply:e=>e.put(Qw(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(Qw(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=Xw(e.name);i.push({location:e.location,apply:n=>n.put(Qw(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(Qw(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Qw(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Pu(e.location,t.location)?-1:+!!Pu(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=Zw();n.set(i??``,o),Xs.toReversed().forEach(e=>o.put(Qw(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)}}},fT=(e,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)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),ec.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=nT(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;aT(o(void 0)).forEach((e,t)=>{t===3&&nc.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(d.add(`${n.key}>${r}`),v.set(n.unit,[...v.get(n.unit)??[],r]),!_.has(r)){if(_.add(r),e(r).tokens.length===0){let t=n.unit??oT(e(void 0).tokens);throw ee(r,t)}aT(o(r)).forEach(i)}}qw.forEach(i);let b=/* @__PURE__ */ new Set,x=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(x),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return x(void 0),n.forEach(e=>{let t=o(e);aT(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),tc.forEach(i),[...r]},pT=(e,t)=>{let n=uT(e,t),r=n.getParsed,i,a=()=>i??=dT(r);return{getStringOrder:(e,t)=>fT(r,e,t),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)}}},mT=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),hT=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],gT=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof s))throw n;let r=Tl(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},_T=e=>new s(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),vT=(e,t)=>e.location.range&&t.location.range&&{location:g(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${g(t.location.range)}.`},yT=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,bT=e=>e===`Theorem`?`ThmOrAssumpDefNode`:yT(e),xT=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Rf(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),ST=(e,t)=>{let n=mt(e);return n!==void 0&&t.has(n)||pt(e).some(e=>ST(e,t))},CT=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Nf(e),n.get(e)??n.size)),n},wT=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),TT=e=>e?.kind===`Steps`?e.steps.flatMap(e=>[...e.body.kind===`Instance`?[e.body]:[],...e.body.kind===`Define`?e.body.definitions.flatMap(e=>e.kind===`Instance`?[e]:[]):[],...TT(e.proof)]):[],ET=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Ny(e);if(e.kind===`Number`&&!gn(e.value))throw Py(e);ET(e.kind===`Let`?[...pt(e),...wT(e.instances??[])]:pt(e))}),DT=(e,t)=>{let n=t.order??pT(t.source,t.loadModule),r=n.parseModule(t.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,f=new Map(n_.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=gg(e.checkDeadlock,t.seed);m.isWarningEnabled=t.isWarningEnabled??!0,m.isTool=t.isTool??!1,m.version=t.version??`master`,m.readLine=t.readLine;let h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=[],y=/* @__PURE__ */ new Map,b=[],x=[],S=/* @__PURE__ */ new Set,C=(e,t)=>[S,...b].forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),te=0,ne=e=>`${e}#${te++}`,E=[],re=[],ie=Kw(e=>{let t=_.get(e)??A(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),ae=/* @__PURE__ */ new Map,oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=e=>{let n=p.get(e);if(n)return n;let r=w_(e,t.print,m,t.files,f);if(!r)return;S_.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return C_.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Zf.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:$f(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},D=e=>{let n=S_.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&C(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},O=e=>(ET([...e.definitions.flatMap(ft),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...wT(e.instances)]),e.modules.forEach(O),e);O(r);let le=(e,r)=>{let i=t.loadModule?.(e)??Gg(m.version).get(e)??pu(t.source,e);if(i===void 0)throw ee(e,r);let a=gT(i,e,n);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return O(a)},k=e=>{let t=x.indexOf(e.name);if(t!==-1){let n=[...x.slice(t),e.name].map(e=>`${e}.tla`);throw new s(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];x.push(e.name),b.push(n);let o=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:re,levelChecks:a});if(b.pop(),x.pop(),i.length>0)throw c(i,!1,void 0,re);let l=r.find(e=>n.has(e.name)),u=l&&h.get(l.name),d=u&&vT(l,u.module);if(d)throw c([d],!1,void 0,re);if(l)throw _T(l);return a.forEach(e=>e()),{linked:o,closure:n}},A=(e,n)=>{let r=h.get(e);if(r)return C(e,y.get(e)??[]),r;let a=k(le(e,n)),o=/* @__PURE__ */ new Map;return x_(e,t.print,m,t.files,f,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new T(`No definition of ${e} to fall back to`);return $(r.body,{environment:n.environment,scope:Hb(Ob(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=a.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&mT.has(e))return;let r=i.get(n.key);r&&o.set(t.name,r),f.set(n.key,t),i.delete(n.key)}),h.set(e,a.linked),y.set(e,a.closure),C(e,a.closure),a.linked},ue=(e,t,n,r,s)=>{let c=s?void 0:D(e.module);if(c)return de(e,c);let d=s??A(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=hT(d),p=`#${te++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=cf(Uw(e,t),f,t,n);E.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=Kf({params:g,substitutions:new Map([...h].map(e=>[e[0],mf(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>i.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,s,c)=>{let u=ne(`${s}@${t.name}`),d=c(u);return i.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&oe.set(u,`${e.name}!${oe.get(n)??s}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:ne,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return fe(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&ae.set(r,{name:n,location:e.location}),e.name!==void 0&&se.set(r,n),r})},de=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),fe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(e=>!i.has(e[0])).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:a.get(t[1].key)===!0?e.location.range:t[1].range}];let n=`${e.name}!${t[0]}`;return[n,{key:r(t[1].key,n),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind}]}))},pe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),me=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=pe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:zf(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:D(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=pe(t[1].arity,t[1].params);return Bf(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,o)});let c=r??A(e.module,n),l=`#${te++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=hT(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};E.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>ST(f(e),p),h=d.map(t=>{let n=me(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Kf({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:zf(e.params,o),location:o,resolution:yu}:Rf(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>a.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}:xT(a,i)),i},createName:ne}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])).map(t=>{let n=_.getKey(t[1].key),r=pe(t[1].arity,t[1].params),i=[...e.params,...r];return Bf(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,i,n===t[1].key?r:i,o)});return[...h,...g,...y]},ge=e=>[...e].flatMap(e=>{let t=i.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let o=ww(e,t.loadClass?.(e.name),e===r);_e.set(e.name,o.overrides);let s=o.module,c=E.length,l=new Map([...n_.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:nf,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);bT(n.kind)===bT(e.kind)?d.warnings.push({location:r,message:`Warning: the ${yT(n.kind)} of '${t}' conflicts with \nits ${yT(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${yT(e.kind)} of '${t}' conflicts with \nits ${yT(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,h=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,b=[],x=[...s.constants],ee=s.variables.filter((e,t)=>s.variables.findIndex(t=>t.name===e.name)===t),C=ee.map(e=>e.name),te=ee.map(e=>e.location);s.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:D(e);if(r){p(r);return}let i=t??A(e,s.name);x.push(...i.constants.filter(e=>x.every(t=>t.name!==e.name)&&!C.includes(e.name))),i.variables.forEach((e,t)=>{C.includes(e)||x.some(t=>t.name===e)||(C.push(e),te.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>h.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),b.push(i)});let w=new Map(l),ne=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],T=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ne.forEach(e=>m.set(e.name,T(e)));let ae=e=>({key:ce(e),arity:Iu(e),params:Lu(e),kind:rf(s,e)?`Theorem`:`Definition`,range:e.location.range}),oe=x.length===0&&C.length===0,ce=e=>s===r?e.name:`${e.name}@${n.id}`,O=/* @__PURE__ */ new Map,le=()=>new Map([...n.modules,...y]),k=e=>{let t=s.modules.find(t=>t.name===e.module);return t?Pu(t.location,e.location)?y.get(t.name):void 0:le().get(e.module)},pe=e=>({imported:l,getInstance:e=>{let t=k(e),n=t?void 0:D(e.module);if(n)return{declarations:[],symbols:de(e,n),instancer:s.name};let r=t??A(e.module,s.name),i=hT(r);return{declarations:i,symbols:fe(e,r.exported,i,e=>e),instancer:s.name}},bound:w,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,isModuleKnown:(e,t)=>e===s.name||S.has(e)||n.modules.has(e)||s.modules.some(n=>n.name===e&&Pu(n.location,t)),instanced:O,facts:h,reports:f,warnings:n.warnings}),me=e=>[...ne.filter(t=>Pu(t.location,e)).map(e=>[e.name,T(e)]),...s.definitions.filter(t=>Pu(t.location,e)).map(e=>[e.name,ae(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(l)),ye=e=>{let t=le(),r=t.get(e.name),i=r&&vT(e,r.module);if(r&&!i)throw _T(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:me(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||y.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=ue(e,s,pe(s),oe,le().get(e.module));O.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>Pu(e.location,t.location)?-1:1).forEach(e=>e.link());let be=Ww(Xf(s,(e,t)=>he(e,t,s.name,k(e))),ge(l));s.theorems.flatMap(e=>TT(e.proof)).filter(e=>!le().has(e.module)).forEach(e=>D(e.module)??A(e.module,s.name)),n.errors.push(...uf(be,pe(be))),be.definitions.forEach(e=>{let t=ce(e);i.set(t,e),a.set(t,!oe);let n=ae(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Pu(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let xe={module:be,constants:x,variables:C,variableLocations:te,visible:l,exported:m,modules:y,extended:b,facts:/* @__PURE__ */ new Set([...h,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,xe);let Se=E.splice(c).map(e=>({location:e.location,check:()=>ie(e)}));return n.levelChecks.push(()=>em(be,{constants:new Set(x.map(e=>e.name)),variables:new Set(C),getDefinition:e=>i.get(l.get(e)?.key??e),getQualifiedName:e=>se.get(l.get(e)?.key??e)},Se,re)),v.push(xe),xe},ye=k(r).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=A(e.module,r.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});v.push(...v.splice(v.indexOf(ye),1)),re.length>0&&!t.isSanyReported&&t.print(d(re));let Ce=t.runtimeInvariants??[];Ce.forEach(e=>{if(e.module===void 0)return;h.set(r.name,ye);let t=A(e.module,r.name);v.splice(v.indexOf(t),1);let n=i.get(t.visible.get(e.name)?.key??e.name);n&&i.set(e.name,n)}),ye.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:i.get(e.key);e.kind!==`postcondition`&&t&&i.set(e.operator,t)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(ye,/* @__PURE__ */ new Set);let Ee=ye.constants.map(e=>e.name),De=ye.variables,Oe=dw(e,{root:ye,moduleSymbols:new Map([...p,...[...h].map(e=>[e[0],e[1].visible]),[r.name,ye.visible]]),definitions:i,builtins:f,copySources:o,operatorConstants:new Map(Se.flatMap(e=>A(e.module,r.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),j=Oe.constants,ke=Oe.substitutions;be!==void 0&&f.forEach((e,t)=>{let n=s_(e);n&&f.set(t,n)});let Ae=CT(De,v.flatMap(e=>e.module.variables.map(e=>e.name))),je=hm({definitions:i,substitutions:ke,constants:j,variableIndex:Ae,builtins:f,variables:De}),Me={runtime:m,definitions:i,builtins:f,constants:j,substitutions:ke,instanceNames:oe,variables:De,variableIndex:Ae,facts:je,startupValues:Array.from({length:je.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Ne=Qp({constants:new Set(j.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>Jy(e,Me)}),Pe=e=>{try{$(e,{environment:Me,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof T)return e;throw e}};ke.forEach((e,t)=>{let n=i.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ne.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Pe(n.body):void 0;if(r){let n=Pt(r)?``:` - specifically: ${r.message}`;throw new w(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let Fe=new Set(v.flatMap(e=>e.module.instances.map(e=>e.module))),Ie=n.createDefinitionOrder();return{environment:Me,assumptions:we,variableLocations:ye.variableLocations,instanceActions:ae,startupDefinitions:v.filter(e=>!Fe.has(e.module.name)||hT(e).length===0).flatMap(e=>Ie(e===ye?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:v.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,runtimeInvariants:Ce,rootName:r.name}},OT=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),kT=(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},AT=e=>S(new T(`${l}${e}`),C.error),jT=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!pn(e)||!pn(i))throw AT(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},MT=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${NT(t)}`:n},NT=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(NT).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${MT(e.pattern,e.set)}:${NT(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(NT).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${NT(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>MT(e.pattern,e.set)).join(`,`)}|->${NT(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(NT);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},PT=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,FT=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new w(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw AT(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>$(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!un(a)||!yi(a))throw AT(`The symmetry operator must specify a set of functions.`);let o=F(a).elements;if(!o.every(fn))throw AT(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=NT(PT(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(Ct.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(jT).forEach(e=>{e.size>0&&d.set(OT(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=kT(n,e),r=OT(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!PT(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>pn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},IT=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=RT(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(RT(e[r],t));return a}},LT=(e,t)=>{let n=[],r=[];for(let i of e){let e=RT(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort($n);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push($n(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},RT=(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=LT(e.elements,t);return n?ir(n):e}if(n===`Function`||n===`LazyFunction`&&yi(e.domain)){let n=I(e),r=IT(n.domain,t),i=IT(n.range,t)??n.range;if(r){let e=ti(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?or(n.domain,e.range):e}return i===n.range?n:or(n.domain,i)}if(n===`Interval`||!un(e)||!yi(e))return e;let r=F(e),i=IT(r.elements,t);return i?Yr(i):r},zT=(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]=RT(e[o],i),a===0&&(a=$n(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},BT={line:0,column:0},VT=e=>({kind:`Identifier`,name:e,location:BT}),HT=e=>({name:e,expression:VT(e),scope:void 0}),UT=/* @__PURE__ */ new Set([`name`,`property`]),WT=(e,t,n)=>{let r=Jy(t,n);if(!r)throw new w(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new w(UT.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},GT=e=>e.body.kind===`Number`||e.body.kind===`String`,KT=(e,t,n)=>n.constants.has(e)?n.constants.get(e):GT(t)?void 0:wb(t,n),qT=(e,t,n)=>{if(n.constants.has(t))throw new w(`The ${e} ${t} cannot be a constant.`);let r=WT(e,t,n);if(KT(t,r,n)!==void 0)throw new w(`The ${e} ${t} cannot be a constant.`);return r},JT=(e,t,n)=>{let r=n.constants.has(t)?void 0:WT(e,t,n),i=r?KT(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new w(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},YT=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},XT=(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})),Tb(e.startupDefinitions,r),t.invariants.forEach(e=>{JT(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},ZT=(e,t)=>{let n=Qp({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=JT(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
1763
1791
  Note that a bug can cause TLC to incorrectly report this error.
1764
1792
  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 v(new g(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),a.safetyEvaluationFailure)}return[{name:e,expression:my(e),scope:void 0}]})},Cy=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Cy(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Ru(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Cy(n.body,t)}return[e]},wy=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||Yv(r,e.scope,t)>0)return!1;let i=H(r,zy(t,void 0,void 0,e.scope));if(i===!1)throw new g(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new g(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},Ty=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return vy(n,e,t),my(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[]}}if(e.init!==void 0||e.next!==void 0)throw new g(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],i=[],o=gy(`name`,e.specification,t),s=_y(e.specification,o,t);if(s!==void 0)throw new g(`The value of ${e.specification} is equal to ${L(s)}`);if(Zv(o.body,void 0,t,!1).forEach(o=>{let s=o.expression;if(wy(o,t,`spec`))return;if(s.kind===`UnboundedQuantifier`&&s.isTemporal)throw v(new g(`TLC does not support temporal existential, nor universal, quantification over state variables.`),a.error);if(s.kind===`Always`&&s.expression.kind===`BoxAction`){r.push({expression:s.expression.action,scope:o.scope});return}if(s.kind===`Always`&&Yv(s.expression,o.scope,t)<2)throw v(new m(`TLC cannot handle the temporal formula ${vu(s.expression)}`),a.error);let c=Yv(s,o.scope,t);if(c===3)i.push(o);else{if(c===2)throw new g(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(o)}}),r.length>1)throw new g(`The specification ${e.specification} must contain at most one [][Next]_vars`);let c=[...n,...r],l=e=>`$specification${e}`,u=c.reduce((e,t,n)=>t.scope===void 0?e:{name:l(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),d=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:l(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:n.length===0?void 0:{kind:`And`,operands:n.map(d),location:py},next:r.length===0?void 0:d(r[0],n.length),scope:u,temporals:i}},Ey=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=yy(`property`,e,t);if(!i)return;Yv(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Zv(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(wy(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Yv(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!k(e)?Ru(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Yv(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new g(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},Dy=(e,t,n)=>t.flatMap(t=>yy(e,t,n)?[{name:t,expression:my(t),scope:void 0}]:[]),Oy=(e,t)=>{let n=Ru(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ky=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new g(`_POSSIBLE lists ${n} more than once`);vy(`possible`,n,t);let i=my(n);if(Yv(i,void 0,t)===3)throw new g(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Ay=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||k(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},jy=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Ru(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},My=(e,t)=>e.flatMap(e=>Cy(e.expression,t).map(n=>{let r=e.scope===void 0?Rc(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Ay(n,r,t),predicate:jy(e.expression,t)}})),Ny=(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},Py=/[\u0100-\uffff]/,Fy=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Iy=e=>e.kind===`String`?Py.test(e.value):e.kind===`Set`&&e.elements.some(Iy),Ly=e=>e.kind===`String`&&Py.test(e.value)||e.kind===`Apply`&&Fy.has(e.operator)||Je(e).some(Ly),Ry=(e,t)=>e.constants.some(e=>Iy(e.value)||(e.args??[]).some(Iy))||[...t.definitions.values()].some(e=>Ly(e.body)||e.kind===`Function`&&e.bounds.some(e=>Ly(e.set))),zy=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),By=(e,t,n)=>Lu(H(e,t),n),Vy=(e,t,n=Hy)=>{let r=H(e,t);if(typeof r!=`boolean`)throw new m(n(e,t.environment));return r},Hy=(e,t)=>{let n=e.kind===`Identifier`?Ru(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`?_u(i):yu(r)}`},Uy=(e,t)=>Vy(e.expression,t,(n,r)=>(Vy(e.predicate,t),Hy(n,r))),Wy=()=>{},Gy=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=By(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ky=(e,t,n)=>{try{return By(e,zy(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof m)return{message:e.message};throw e}},qy=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ky(n.expression,t,`an assumption`);if(e)return{name:vu(n.expression),trace:[],message:e.message}}},Jy=(e,t,n,r)=>{let o=Sy(e.invariants,t),s=Ty(e,t),c=Ey(e,t,r),l=My([...o,...c.invariants],t),u=[...new Map(l.map(e=>[e.predicate,e])).values()],d=l.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||t.variables.length>0))throw new g(t.runtime.version===`1.7.4`?fa:`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new g(`The configuration file did not specify the next state predicate.`);let f=My(Dy(`constraint`,e.constraints,t),t),p=Dy(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&gy(`rlreward`,e.rlReward,t),e.periodic!==void 0&&gy(`periodic`,e.periodic,t);let h=ky(e.possible,t);if(t.variables.length===0)return;let _=e.symmetry===void 0?void 0:cy(e.symmetry,t,e.substitutions);e.view!==void 0&&gy(`view function`,e.view,t);let y=e.view===void 0?void 0:{name:e.view,expression:my(e.view),scope:void 0},b=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:py};return{...e,unchanged:t}}),ee=e=>Yv(e.expression,void 0,t)>=2,x=h.filter(e=>!ee(e)),te=h.filter(ee),ne=t.runtime,re={indices:void 0},ie=()=>{if(re.indices)return re.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return re.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),re.indices},ae=(e,n)=>H(e,zy(t,n,void 0)),oe=e=>{let t=ie(),n=_===void 0?e:fy(e,_,t);return Ym(y===void 0?t.map(e=>n[e]):[ae(y.expression,n)])},se=/* @__PURE__ */ new WeakSet,ce=(e,n,r)=>{let i=r&&!se.has(r)?r:void 0;if(Ny(e,n,i))return!1;try{let r=zy(t,n,void 0,e.scope),a=e.membership;return i&&a?!Ar(n[a.variable],i[a.variable],H(a.set,r)):!Uy(e,r)}catch(t){throw r?Ea(v(t,a.safetyEvaluationFailure),ca.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},le=Ry(e,t);ne.getFingerprint=oe;let ue=()=>{let e=h.find(e=>!ne.possibleCounts.get(e.name));if(!e)return;let n=Oy(e.name,t),r=n?` at ${_u(n)}`:``;return{name:e.name,code:ca.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:it(L(vh(ne),!0))}};return{properties:c,spec:s,isSymmetric:_!==void 0,isConstrained:f.length>0||p.length>0,getTlcOrder:ie,getStoredFingerprints:(e,t)=>y!==void 0||le?BigInt64Array.from(e,oe):Xm(t,ie()),getFingerprintState:e=>{if(le)return[String(oe(e))];let t=_===void 0?e:fy(e,_,ie());return y===void 0?t:[ae(y.expression,t)]},findViolatedInvariant:(e,t)=>{let n=l.find(n=>ce(n,e,t));return n&&se.add(e),n},getViolatedInvariants:e=>{let t=u.filter(t=>l.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)=>Vy(n,zy(t,e,void 0,r));f.every(e=>r(e.predicate,e.scope))&&n();let i=u.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=c.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(f.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope)))&&p.every(r=>Vy(r.expression,zy(n,e,t,r.scope))))||r())||u.every(e=>Vy(e.predicate,zy(n,t,void 0,e.scope))))&&b.every(r=>Vy(r.box,zy(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>f.every(r=>Ny(r,e,n)||Uy(r,zy(t,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(n=>!Vy(n.expression,zy(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>b.find(r=>{try{return!Vy(r.action,zy(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${vu(r.box)}`)&&!By(r.unchanged,zy(t,e,n,r.scope),`a subscript`)}catch(e){throw Ea(Yy(e),ca.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>p.every(r=>Vy(r.expression,zy(t,e,n),e=>`${i}${Hy(e,t)}`)),trackStatePossible:x.length===0?Wy:e=>Gy(x,ne,zy(t,e,void 0)),trackActionPossible:te.length===0?Wy:(e,n)=>Gy(te,ne,zy(t,e,n)),findUnwitnessedPossible:ue,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=Ru(e,t);return n!==void 0&&ud(n,t)!==void 0});if(r!==void 0){if(n)return;throw v(new m(`${i}The post condition ${r} cannot be a constant.`),a.error)}let o=ue();if(o)return o;for(let n of e.postconditions){let e=Ky(my(n),t,`a postcondition`);if(!e)continue;let r=Oy(n,t),i=r?` at ${_u(r)}`:``;return e.message===void 0?{name:n,code:ca.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:ca.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},Yy=e=>e instanceof n?v(e,e.exitCode):e,Xy=(e,t)=>e*((t-e)/2**64),Zy=e=>e.includes(`.`)?e:`${e}.0`,Qy=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return Zy(String(e));let[n,r]=e.toExponential().split(`e`);return`${Zy(n)}E${r.replace(`+`,``)}`},$y=e=>e!==void 0&&e>=`0`&&e<=`9`,eb=e=>{if(e===0)return`0.0`;let t=Qy(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;$y(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(;$y(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;$y(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for($y(t[n.next])&&Number(t[n.next])>=5&&(n.result=tb(n.result));$y(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},tb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${tb(r)}.`:n===`9`?`${tb(r)}0`:`${r}${Number(n)+1}`},nb=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},rb=(e,t,n)=>{if(Xy(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},ib=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}).`},ab=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},ob=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zr(e[t]),16777619),r=Math.imul(r^ri(e[t]),1540483477);t[0]=ab(n)||1,t[1]=ab(r)},sb=()=>{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)}}},cb=(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}},lb=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),ub=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return cb(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},db=e=>Atomics.load(e.used,0)*2>=e.slots.length,fb=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&cb(t,n);return{slots:t,used:e.used}},pb=[void 0,`lambda`,`tuple`,`record`],mb=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=Rr(e.domain);return t?(r(7),r(pb.indexOf(Ht(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(pb.indexOf(Ht(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})}},hb=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 Lt(t.strings[n[r.index++]]);if(e===5)return Rt(i(n[r.index++]));let a=pb[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=qn({kind:`Interval`,low:e,high:e+t-1});return Vt(zt(o,i(t)),a)}let o=n[r.index++],s=i(o);return Vt(zt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Ru as $,yv as A,pi as At,Sm as B,St as Bt,ey as C,Ma as Ct,mv as D,Xn as Dt,$v as E,Lt as Et,xg as F,wt as Ft,wf as G,Ke as Gt,Dm as H,I as Ht,Sh as I,Zr as It,Bd as J,T as Jt,jd as K,qe as Kt,xh as L,j as Lt,sv as M,Ct as Mt,q_ as N,Yr as Nt,$ as O,Mn as Ot,bg as P,Xr as Pt,_u as Q,Ch as R,Qt as Rt,Wv as S,Da as St,Yv as T,tn as Tt,Em as U,Je as Ut,wm as V,Et as Vt,Xp as W,k as Wt,H as X,ge as Xt,vu as Y,pe as Yt,Yu as Z,be as Zt,vy as _,Ca as _t,fb as a,uu as at,xy as b,ja as bt,ob as c,pl as ct,rb as d,ca as dt,Fd as et,Xy as f,la as ft,qy as g,wa as gt,Jy as h,xa as ht,lb as i,cu as it,Bv as j,L as jt,Uv as k,Yn as kt,eb as l,ml as lt,my as m,ba as mt,mb as n,ju as nt,ub as o,lu as ot,ib as p,da as pt,Dd as q,ze as qt,sb as r,md as rt,db as s,du as st,hb as t,Pd as tt,nb as u,Nc as ut,zy as v,_a as vt,ty as w,Hr as wt,Yy as x,va as xt,by as y,Fa as yt,Ym as z,Yt as zt};
1793
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw S(new w(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),C.safetyEvaluationFailure)}return[HT(e)]})},QT=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>QT(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=Jy(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&wb(n,t)===void 0)return QT(n.body,t)}return[e]},$T=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||WS(r,e.scope,t)>0)return!1;let i=$(r,_E(t,void 0,void 0,e.scope));if(i===!1)throw new w(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new w(`The operator ${r.name}, which equals ${L(i)},\ncannot be used as a ${n}`);return!0},eE=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return qT(n,e,t),VT(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new w(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):KT(e.specification,WT(`name`,e.specification,t),t);if(c!==void 0)throw new w(`The value of ${e.specification} is equal to ${L(c)}`);let l=WT(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;KS(l.body,void 0,t,!1).forEach(e=>{let c=e.expression,l=e.path.some(e=>{let n=Jy(e,t);return n?.kind===`Operator`&&WS(n.body,void 0,t)===1});if(!l&&$T(e,t,`spec`))return;let f=c.kind===`Identifier`&&!N(c)?t.variableIndex.get(c.name):void 0;if(!l&&c.kind===`Identifier`&&f!==void 0){let e=n[f].range;throw new w(`The operator ${c.name}, which equals ${e?g(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw S(new w(`TLC does not support temporal existential, nor universal, quantification over state variables.`),C.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=SC(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:Ct.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
1794
+ all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:Ct.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new w(`The specification contains more than one conjunct of the form [][Next]_v,
1795
+ but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&WS(c.expression,e.scope,t)<2)throw S(new T(`TLC cannot handle the temporal formula ${Q(c.expression)}`),C.error);let p=WS(c,e.scope,t);if(p===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(p===2)throw new w(`TLC cannot handle this conjunct of the spec:\n${Q(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),h=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(h),location:BT},next:o.length===0?void 0:h(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},tE=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=JT(`property`,e,t);if(!i)return;WS(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;KS(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if($T(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&WS(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!N(e)?Jy(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=WS(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=Q(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new w(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},nE=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},rE=(e,t,n)=>t.flatMap(t=>JT(e,t,n)?[HT(t)]:[]),iE=(e,t)=>{let n=Jy(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},aE=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new w(`_POSSIBLE lists ${n} more than once`);qT(`possible`,n,t);let i=HT(n);if(WS(i.expression,void 0,t)===3)throw new w(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),oE=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||N(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},sE=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=Jy(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},cE=(e,t)=>e.flatMap(e=>{let n=sE(e.expression,t);return(e.scope===void 0&&Em(n,t)===void 0?[n]:QT(e.expression,t)).map(r=>{let i=e.scope===void 0?Em(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:oE(r,i,t),predicate:n}})}),lE=(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},uE=/[\u0100-\uffff]/,dE=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),fE=e=>e.kind===`String`?uE.test(e.value):e.kind===`Set`&&e.elements.some(fE),pE=(e,t)=>{if(e.kind===`Selection`){if(t.has(e.expression))return!1;t.add(e.expression)}return e.kind===`String`&&uE.test(e.value)||e.kind===`Apply`&&dE.has(e.operator)||pt(e).some(e=>pE(e,t))},mE=(e,t)=>{let n=/* @__PURE__ */ new Set;return e.constants.some(e=>fE(e.value)||(e.args??[]).some(fE))||[...t.definitions.values()].some(e=>pE(e.body,n)||e.kind===`Function`&&e.bounds.some(e=>pE(e.set,n)))},hE=e=>{if(!fn(e))return;let t=bn(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},gE=(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`},_E=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),vE=(e,t,n)=>Uy($(e,t),n),yE=(e,t,n=xE)=>{let r=$(e,t);if(typeof r!=`boolean`)throw new T(n(e,t.environment));return r},bE=(e,t,n)=>{let r=t.kind===`Identifier`?Jy(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?g(a):Ey(i)}`},xE=(e,t)=>bE(`boolean`,e,t),SE=(e,t)=>yE(e.expression,t,(n,r)=>(e.predicate!==e.expression&&yE(e.predicate,t),xE(n,r))),CE=()=>{},wE=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=vE(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),TE=(e,t)=>{try{return e(_E(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof T)return{message:e.message};throw e}},EE=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=TE(e=>qy($(n.expression,e),n.expression),t);if(e)return{name:Ey(n.expression),trace:[],message:e.message}}},DE=(e,t,n,r=!1)=>{let i=pT(t.source,t.loadModule);return Nn(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),Rn(t),mo(t.fingerprintPolynomial??0),r&&Pn(),{order:i,specification:DT(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},OE=e=>{let t=typeof e.config==`string`?dt(e.config,e.version):e.config,n=DE(t,e,e.onPrint??console.log),r=n.specification;XT(r,t,e.onProgress);let i=e.coverage===void 0?void 0:jo(r.environment.variables.length),a=i?Mo(r.environment,i):r.environment,o,s=()=>o??=xC(t,a,r.instanceActions);a.runtime.getSpecification=()=>EC(s(),t,a,r.variableLocations);let c=PE(t,a,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants);return{config:t,specification:r,environment:a,search:c,getDescription:s,coverage:i,getCoverage:()=>i&&bs(i,a,r.variableLocations,c?.getTlcOrder()??[])}},kE=/* @__PURE__ */ Error(`The walk stopped`),AE=(e,t,n)=>{let r=(n,r)=>r.map(r=>({...r,node:Fo(e,n,Lo(r.name,r.expression,t),r.expression,r.scope)})),i=r(`init`,n.inits),a=r(`next`,n.actions);return Go(e,t,mv(a,t)),{inits:i,actions:a}},jE=(e,t,n,r,i,a=(e,t)=>{throw hy(e,t,r)})=>pv(t,t.node,n,r,n=>{e.primary[t.node]++,i(n)},n=>(e.primary[t.node]++,a(n,t.name),!0)),ME=(e,t,n)=>{let r=EE(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(Ct.assumptionFalse,e,e),C.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(Ct.assumptionEvaluationError,i,It(Ct.assumptionEvaluationError,i,!0)),C.assumptionViolation},NE=e=>S(new T(`${l}Could not find operator: ${e.operator} in module: ${e.module}`),C.error),PE=(e,t,n,r,i,a=[],o=[])=>{let s=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw NE(e);return{name:e.operator,key:e.key}}),c=ZT(e.invariants,t),u=eE(e,t,n,r,i),d=tE(e,t,i),f=e.properties[0],p=f&&Jy(f,t)?.location.range,m=e.specification,h=m&&Jy(m,t)?.location.range;u.isPropertyFairness&&p&&h&&i?.({kind:`warning`,code:Ct.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${g(p)} equals\nthe fairness constraints of the behavior specification ${m} at ${g(h)}.\nTherefore, checking whether ${m} => ${f} using TLC will never result in a violation of ${f}.`});let _=cE([...c,...d.invariants],t),v=_.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(v||d.initialPredicates.length>0||t.variables.length>0))throw new w(t.runtime.version===`1.7.4`?Ot:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&v)throw new w(`The configuration file did not specify the next state predicate.`);let y=cE(o.map(e=>{let n=Jy(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:VT(e.name),scope:void 0}}),t),b=[..._,...y],x=[...new Map(b.map(e=>[e.predicate,e])).values()],ee=rE(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),te=cE(ee,t),ne=rE(`action constraint`,e.actionConstraints,t),E=t.coverage,re=(e,n,r=!0)=>n.flatMap(n=>{if(!E)return[];let i=r?sE(n.expression,t):n.expression,a=Lo(r?n.name:void 0,i,t),o=Fo(E,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ie=[...re(`invariant`,c),...re(`invariant`,d.invariants,!1)],ae=new Map([...c,...d.invariants].map((e,n)=>[sE(e.expression,t),ie[n]])),oe=re(`constraint`,ne),se=re(`constraint`,ee),ce=new Map(se.map(e=>[e.expression,e])),D=[...new Map(te.map(e=>[e.predicate,e])).values()],O=re(`implied`,d.initialPredicates,!1),le=re(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),k=(e,n,r,i)=>{try{return Yo(e,n.node,()=>$(n.expression,_E(t,r,i,n.scope)))}catch{return}},A=(e,t,n)=>E&&e?Yo(E,e.node,()=>yE(e.expression,n)):yE(t,n),ue=(e,t,n)=>{if(E){for(let r of e){let e=k(E,r,t,n);if(typeof e!=`boolean`)return;if(!e)return E.primary[r.node]++,!1;E.secondary[r.node]++}return!0}};e.rlReward!==void 0&&WT(`rlreward`,e.rlReward,t),e.periodic!==void 0&&WT(`periodic`,e.periodic,t);let de=aE(e.possible,t);if(t.variables.length===0)return;let fe=e.symmetry===void 0?void 0:FT(e.symmetry,t,e.substitutions),pe=e.view===void 0?void 0:qT(`view function`,e.view,t),me=e.view??s(`view`)[0]?.name,he=me===void 0?void 0:HT(me),ge=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:BT};return{...e,unchanged:t}}),_e=e=>WS(e.expression,void 0,t)>=2,ve=de.filter(e=>!_e(e)),ye=de.filter(_e),be=t.runtime,xe,Se=()=>{if(xe)return xe;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return xe=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),xe},Ce=(e,n)=>$(e,_E(t,n,void 0)),we=e=>(he!==void 0&&e.forEach(Wr),fe===void 0?e:zT(e,fe,Se())),Te=e=>{let t=we(e);return Eo(he===void 0?Se().map(e=>t[e]):[Ce(he.expression,t)])},Ee=e=>d.initialPredicates.find((n,r)=>{let i=E&&k(E,O[r],e,void 0);return typeof i==`boolean`?!i:!yE(n.expression,_E(t,e,void 0,n.scope))}),De=/* @__PURE__ */ new WeakSet,Oe=(e,n,r)=>{let i=r&&!De.has(r)?r:void 0;if(lE(e,n,i))return!1;try{let r=_E(t,n,void 0,e.scope),a=e.membership;return i&&a?!na(n[a.variable],i[a.variable],$(a.set,r)):!SE(e,r)}catch(t){throw r?Ht(S(t,C.safetyEvaluationFailure),Ct.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},j=(e,t,n)=>{let r=ae.get(e.predicate),i=E&&r?k(E,r,t,void 0):void 0;return typeof i==`boolean`?!i:b.some(r=>r.predicate===e.predicate&&Oe(r,t,n))},ke=mE(e,t);be.getFingerprint=Te;let Ae=()=>{let e=de.find(e=>!be.possibleCounts.get(e.name));if(!e)return;let n=iE(e.name,t),r=n?` at ${g(n)}`:``;return{name:e.name,code:Ct.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:P(L(_g(be),!0))}},je=pe?.body.kind===`Tuple`?pe.body.elements:[],Me=je.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Ne=pe?.body.kind===`Tuple`&&Me.length===je.length&&new Set(Me).size===Me.length,Pe=(e,n)=>Ne?Se().filter(e=>Me.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${P(L(n[e]))}\n`).join(``):P(L(Ce(e,n))),Fe=(e,n,r)=>yE(e.expression,_E(t,n,r),e=>`${l}${xE(e,t)}`),Ie=e=>{let n=Object.fromEntries(Se().map(n=>[t.variables[n],e[n]]));return he===void 0?n:Bn(n,()=>Pe(he.expression,e))};return be.toRecord=Ie,{properties:d,spec:u,toRecord:Ie,evaluateAlias:(e,n,r,i)=>{let a=()=>Ie(n.map(e=>e??nr(`null`)));try{qT(`alias`,e,t);let i=$(VT(e),_E(t,n,r)),o=hE(i);return o===void 0?a():Hn(o,e)}catch(e){if(!(e instanceof w||e instanceof T))throw e;return{...a(),_ALIASEvalError:Lt(e.message,i)}}},isSymmetric:fe!==void 0,isConstrained:te.length>0||ne.length>0,getTypedChecks:n=>{if(E!==void 0||de.length>0||e.periodic!==void 0||[...b,...te].some(e=>e.scope!==void 0)||ne.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||he!==void 0)||u.init===void 0||u.next===void 0)return;let r=x.map(e=>e.predicate),i=[...new Set(te.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=nE(u.scope),c=e=>wb(e,t)===void 0&&Sm(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&vm(e,t)&&c(e))||xm([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...he?[he.expression]:[],...s,...tw(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>Ee(e)===void 0,actionProperties:d.actionProperties,symmetry:fe,view:he?.expression,variableOrder:Se(),liveness:n}},getTlcOrder:Se,getStoredFingerprints:(e,t)=>he!==void 0||ke?BigInt64Array.from(e,Te):Oo(t,Se()),getFingerprintState:e=>{if(ke)return[String(Te(e))];let t=we(e);return he===void 0?t:[Ce(he.expression,t)]},findViolatedInvariant:(e,t)=>{let n=E===void 0?b.find(n=>Oe(n,e,t)):x.find(n=>j(n,e,t));return n&&De.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of x)j(n,e,void 0)&&(De.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r,i)=>A(n,r,_E(t,e,void 0,i));D.every(e=>i(ce.get(e.predicate),e.predicate,e.scope))&&n();for(let e of x)i(ae.get(e.predicate),e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find((e,t)=>!i(O[t],e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(D.every(e=>A(ce.get(e.predicate),e.predicate,_E(n,t,void 0,e.scope)))&&ne.every((r,i)=>A(oe[i],r.expression,_E(n,e,t,r.scope))))||r())||x.every(e=>A(ae.get(e.predicate),e.predicate,_E(n,t,void 0,e.scope))))&&ge.every((r,i)=>A(le[i],r.box,_E(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>ue(se,e)??te.every(r=>lE(r,e,n)||SE(r,_E(t,e,void 0))),findFailedInitialPredicate:Ee,findViolatedActionProperty:(e,n)=>ge.find((r,i)=>{let a=E&&k(E,le[i],e,n);if(typeof a==`boolean`)return!a;try{return!yE(r.action,_E(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Q(r.box)}`)&&!vE(r.unchanged,_E(t,e,n,r.scope),`a subscript`)}catch(e){throw Ht(FE(e),Ct.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ue(oe,e,t)??ne.every(n=>Fe(n,e,t)),getExcludingConstraints:(e,n)=>[...te.filter(e=>!SE(e,_E(t,n,void 0))),...ne.filter(t=>!Fe(t,e,n))].map(e=>{let n=iE(e.name,t);return n?g(n):e.name}),trackStatePossible:ve.length===0?CE:e=>wE(ve,be,_E(t,e,void 0)),trackActionPossible:ye.length===0?CE:(e,n)=>wE(ye,be,_E(t,e,n)),findUnwitnessedPossible:Ae,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=VT(e.rlReward),o=$(a,_E(t,n,r));if(typeof o!=`number`)throw new T(bE(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=Jy(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!GT(n)&&wb(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw S(new T(i),C.configParseError)}let a=(e,n)=>{let r=TE(e=>yE(VT(n),e),t);if(!r)return;let i=Jy(n,t)?.body,a=iE(n,t),o=a?` at ${i?.kind===`Number`?Ey(i):g(a)}`:``;return r.message===void 0?{name:e,code:Ct.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:Ct.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=Ae();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},FE=e=>e instanceof t?S(e,e.exitCode):e,IE=(e,t)=>e*((t-e)/2**64),LE=e=>e.includes(`.`)?e:`${e}.0`,RE=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return LE(String(e));let[n,r]=e.toExponential().split(`e`);return`${LE(n)}E${r.replace(`+`,``)}`},zE=e=>e!==void 0&&e>=`0`&&e<=`9`,BE=e=>{if(e===0)return`0.0`;let t=RE(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;zE(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;zE(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;zE(t[n])&&r<2;)i+=t[n++],r++;for(zE(t[n])&&Number(t[n])>=5&&(i=VE(i));zE(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},VE=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${VE(r)}.`:n===`9`?`${VE(r)}0`:`${r}${Number(n)+1}`},HE=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}`)},UE=(e,t,n)=>{if(IE(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},WE=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}).`},GE=[void 0,`lambda`,`tuple`,`record`],KE=()=>{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=ha(e.domain);return t?(a(7),a(GE.indexOf(lr(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(GE.indexOf(lr(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})}},qE=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 nr(t.strings[n[r++]]);if(e===5)return ir(i(n[r++]));let a=GE[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=ui({kind:`Interval`,low:e,high:e+t-1});return cr(or(o,i(t)),a)}let o=n[r++],s=i(o);return cr(or(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{py as $,ji as $t,EC as A,So as At,Gx as B,pi as Bt,ow as C,pt as Cn,Tl as Ct,wC as D,be as Dn,Mo as Dt,ew as E,Ge as En,jo as Et,Ux as F,$n as Ft,Q as G,fi as Gt,Yx as H,or as Ht,qx as I,qi as It,Jy as J,Ea as Jt,$ as K,Xa as Kt,Wx as L,Sr as Lt,RS as M,_o as Mt,Hx as N,Eo as Nt,TC as O,Te as On,bs as Ot,Zx as P,en as Pt,hy as Q,rn as Qt,eS as R,ti as Rt,RT as S,ht as Sn,_u as St,iw as T,et as Tn,cs as Tt,Vx as U,mi as Ut,$x as V,Yr as Vt,rx as W,ir as Wt,Yb as X,an as Xt,wb as Y,Da as Yt,jx as Z,rr as Zt,ME as _,Pt as _n,xm as _t,UE as a,F as an,dv as at,jE as b,Rt as bn,hu as bt,kE as c,wt as cn,Wg as ct,NE as d,Lt as dn,yg as dt,Fn as en,gy as et,PE as f,Bt as fn,Cg as ft,OE as g,Jt as gn,vm as gt,gE as h,Qt as hn,Xh as ht,HE as i,Wr as in,_y as it,tC as j,xo as jt,xC as k,bo as kt,AE as l,Dt as ln,Ug as lt,_E as m,Nt as mn,Kh as mt,KE as n,yr as nn,vy as nt,IE as o,_r as on,fv as ot,EE as p,zt as pn,xg as pt,Bb as q,L as qt,BE as r,gr as rn,Bv as rt,WE as s,Ct as sn,pv as st,qE as t,yi as tn,my as tt,DE as u,It as un,Gg as ut,YT as v,Ut as vn,Pu as vt,aw as w,dt as wn,$s as wt,FE as x,_t as xn,vu as xt,XT as y,Yt as yn,pu as yt,Qx as z,nr as zt};