tla-ts 0.0.4-dev.6dec595 → 0.0.4-dev.7b5087a

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 (307) hide show
  1. package/README.md +27 -141
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +35 -1
  6. package/dist/index.d.ts +35 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +996 -0
  15. package/dist/prove.js +996 -0
  16. package/dist/run-cli.cjs +517 -47
  17. package/dist/run-cli.js +517 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/errors.ts +86 -0
  26. package/src/evaluate.ts +28 -7
  27. package/src/index.ts +10 -0
  28. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  29. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  30. package/src/obligations/ctx.ts +64 -0
  31. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  32. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  33. package/src/{obligation-format.ts → obligations/format.ts} +6 -5
  34. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  35. package/src/{obligations.ts → obligations/index.ts} +28 -12
  36. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  37. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  38. package/src/obligations/pickle.ts +100 -0
  39. package/src/obligations/pragma.ts +189 -0
  40. package/src/{obligation-printer.ts → obligations/printer.ts} +9 -63
  41. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  42. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  43. package/src/obligations/temporal.ts +319 -0
  44. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  45. package/src/ocaml-marshal.ts +172 -0
  46. package/src/parallel-worker.ts +2 -18
  47. package/src/parallel.ts +10 -43
  48. package/src/prove/decide-pool.ts +100 -0
  49. package/src/prove/deciders.ts +33 -0
  50. package/src/prove/isabelle/LICENSE +36 -0
  51. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  52. package/src/prove/isabelle/decide.ts +47 -0
  53. package/src/prove/isabelle/encode.ts +512 -0
  54. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  55. package/src/prove/isabelle/isar/method.ts +367 -0
  56. package/src/prove/isabelle/isar/proof.ts +28 -0
  57. package/src/prove/isabelle/isar/statement.ts +57 -0
  58. package/src/prove/isabelle/isar/theory.ts +192 -0
  59. package/src/prove/isabelle/isar/type-check.ts +278 -0
  60. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  61. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  62. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  63. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  64. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  65. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  66. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  67. package/src/prove/isabelle/provers/classical.ts +389 -0
  68. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  69. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  70. package/src/prove/isabelle/pure/consts.ts +32 -0
  71. package/src/prove/isabelle/pure/conv.ts +79 -0
  72. package/src/prove/isabelle/pure/drule.ts +264 -0
  73. package/src/prove/isabelle/pure/envir.ts +363 -0
  74. package/src/prove/isabelle/pure/goal.ts +53 -0
  75. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  76. package/src/prove/isabelle/pure/list.ts +12 -0
  77. package/src/prove/isabelle/pure/logic.ts +402 -0
  78. package/src/prove/isabelle/pure/name.ts +110 -0
  79. package/src/prove/isabelle/pure/net.ts +262 -0
  80. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  81. package/src/prove/isabelle/pure/pattern.ts +650 -0
  82. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  83. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  84. package/src/prove/isabelle/pure/search.ts +68 -0
  85. package/src/prove/isabelle/pure/seq.ts +156 -0
  86. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  87. package/src/prove/isabelle/pure/table.ts +208 -0
  88. package/src/prove/isabelle/pure/tactic.ts +276 -0
  89. package/src/prove/isabelle/pure/tactical.ts +347 -0
  90. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  91. package/src/prove/isabelle/pure/term.ts +808 -0
  92. package/src/prove/isabelle/pure/thm.ts +806 -0
  93. package/src/prove/isabelle/pure/type.ts +133 -0
  94. package/src/prove/isabelle/pure/unify.ts +753 -0
  95. package/src/prove/isabelle/pure/variable.ts +25 -0
  96. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  97. package/src/prove/isabelle/tla/context.ts +74 -0
  98. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  99. package/src/prove/isabelle/tla/logic.ts +215 -0
  100. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  101. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  102. package/src/prove/ocaml.ts +22 -0
  103. package/src/prove/prep/action.ts +520 -0
  104. package/src/prove/prep/defs.ts +33 -0
  105. package/src/prove/prep/elab.ts +156 -0
  106. package/src/prove/prep/enabled-axioms.ts +189 -0
  107. package/src/prove/prep/enabled.ts +43 -0
  108. package/src/prove/prep/fingerprint.ts +388 -0
  109. package/src/prove/prep/flatten.ts +70 -0
  110. package/src/prove/prep/level-comparison.ts +552 -0
  111. package/src/prove/prep/md5.ts +67 -0
  112. package/src/prove/prep/pragma.ts +221 -0
  113. package/src/prove/prep/trivial.ts +22 -0
  114. package/src/prove/prove-worker.ts +27 -0
  115. package/src/prove/prove.ts +528 -0
  116. package/src/prove/ptl/decide.ts +68 -0
  117. package/src/prove/ptl/encode.ts +256 -0
  118. package/src/prove/ptl/sat.ts +151 -0
  119. package/src/prove/ptl/tableau.ts +276 -0
  120. package/src/prove/smt/axiomatize.ts +69 -0
  121. package/src/prove/smt/axioms.ts +210 -0
  122. package/src/prove/smt/context.ts +108 -0
  123. package/src/prove/smt/data.ts +665 -0
  124. package/src/prove/smt/encode.ts +169 -0
  125. package/src/prove/smt/extensionality.ts +63 -0
  126. package/src/prove/smt/flatten.ts +127 -0
  127. package/src/prove/smt/format.ts +143 -0
  128. package/src/prove/smt/instances.ts +182 -0
  129. package/src/prove/smt/rewrite.ts +784 -0
  130. package/src/prove/smt/simplify.ts +57 -0
  131. package/src/prove/smt/solver/act-cache.ts +265 -0
  132. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  133. package/src/prove/smt/solver/array.ts +22 -0
  134. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  135. package/src/prove/smt/solver/ast-lt.ts +157 -0
  136. package/src/prove/smt/solver/ast-util.ts +147 -0
  137. package/src/prove/smt/solver/ast.ts +1315 -0
  138. package/src/prove/smt/solver/auf-solver.ts +572 -0
  139. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  140. package/src/prove/smt/solver/cg-table.ts +175 -0
  141. package/src/prove/smt/solver/clause.ts +276 -0
  142. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  143. package/src/prove/smt/solver/context.ts +1292 -0
  144. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  145. package/src/prove/smt/solver/der.ts +224 -0
  146. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  147. package/src/prove/smt/solver/e-matching.ts +659 -0
  148. package/src/prove/smt/solver/enode.ts +259 -0
  149. package/src/prove/smt/solver/expr-ref.ts +21 -0
  150. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  151. package/src/prove/smt/solver/fingerprints.ts +92 -0
  152. package/src/prove/smt/solver/flat-literals.ts +51 -0
  153. package/src/prove/smt/solver/goal.ts +138 -0
  154. package/src/prove/smt/solver/hash.ts +173 -0
  155. package/src/prove/smt/solver/hashtable.ts +166 -0
  156. package/src/prove/smt/solver/internalizer.ts +1381 -0
  157. package/src/prove/smt/solver/lbool.ts +5 -0
  158. package/src/prove/smt/solver/literal.ts +24 -0
  159. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  160. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  161. package/src/prove/smt/solver/lp/containers.ts +296 -0
  162. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  163. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  164. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  165. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  166. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  167. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  168. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  169. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  170. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  171. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  172. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  173. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  174. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  175. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  176. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  177. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  178. package/src/prove/smt/solver/lp/nex.ts +120 -0
  179. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  180. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  181. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  182. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  183. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  184. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  185. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  186. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  187. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  188. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  189. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  190. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  191. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  192. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  193. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  194. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  195. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  196. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  197. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  198. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  199. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  200. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  201. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  202. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  203. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  204. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  205. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  206. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  207. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  208. package/src/prove/smt/solver/model-checker.ts +347 -0
  209. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  210. package/src/prove/smt/solver/model-finder.ts +155 -0
  211. package/src/prove/smt/solver/model-generator.ts +97 -0
  212. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  213. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  214. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  215. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  216. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  217. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  218. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  219. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  220. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  221. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  222. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  223. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  224. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  225. package/src/prove/smt/solver/nnf.ts +469 -0
  226. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  227. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  228. package/src/prove/smt/solver/propagate-values.ts +83 -0
  229. package/src/prove/smt/solver/proto-model.ts +551 -0
  230. package/src/prove/smt/solver/pull-quant.ts +139 -0
  231. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  232. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  233. package/src/prove/smt/solver/qe-lite.ts +381 -0
  234. package/src/prove/smt/solver/qi-queue.ts +362 -0
  235. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  236. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  237. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  238. package/src/prove/smt/solver/random-gen.ts +10 -0
  239. package/src/prove/smt/solver/rational.ts +165 -0
  240. package/src/prove/smt/solver/ref-vector.ts +62 -0
  241. package/src/prove/smt/solver/relevancy.ts +247 -0
  242. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  243. package/src/prove/smt/solver/rewriter.ts +843 -0
  244. package/src/prove/smt/solver/rlimit.ts +79 -0
  245. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  246. package/src/prove/smt/solver/solver.ts +71 -0
  247. package/src/prove/smt/solver/sort.ts +35 -0
  248. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  249. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  250. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  251. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  252. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  253. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  254. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  255. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  256. package/src/prove/smt/solver/theory-lra.ts +56 -0
  257. package/src/prove/smt/solver/var-subst.ts +258 -0
  258. package/src/prove/smt/solver/z3-license.txt +10 -0
  259. package/src/prove/smt/table.ts +170 -0
  260. package/src/prove/tlapm/tlapm.ts +97 -0
  261. package/src/prove/tlaps-module.ts +510 -0
  262. package/src/prove/verdict.ts +19 -0
  263. package/src/prove/zenon/LICENSE +32 -0
  264. package/src/prove/zenon/check/check.ts +105 -0
  265. package/src/prove/zenon/check/definitions.ts +144 -0
  266. package/src/prove/zenon/check/equality.ts +182 -0
  267. package/src/prove/zenon/check/functions.ts +62 -0
  268. package/src/prove/zenon/check/keys.ts +125 -0
  269. package/src/prove/zenon/check/propositional.ts +104 -0
  270. package/src/prove/zenon/check/records.ts +188 -0
  271. package/src/prove/zenon/check/relations.ts +121 -0
  272. package/src/prove/zenon/check/rewrites.ts +224 -0
  273. package/src/prove/zenon/check/sets.ts +302 -0
  274. package/src/prove/zenon/check/terms.ts +127 -0
  275. package/src/prove/zenon/check/tla.ts +126 -0
  276. package/src/prove/zenon/decide.ts +113 -0
  277. package/src/prove/zenon/encode.ts +444 -0
  278. package/src/prove/zenon/eqrel.ts +300 -0
  279. package/src/prove/zenon/equality-rules.ts +435 -0
  280. package/src/prove/zenon/expr.ts +551 -0
  281. package/src/prove/zenon/index-table.ts +350 -0
  282. package/src/prove/zenon/isar-case.ts +513 -0
  283. package/src/prove/zenon/isar.ts +1249 -0
  284. package/src/prove/zenon/limits.ts +15 -0
  285. package/src/prove/zenon/llproof.ts +173 -0
  286. package/src/prove/zenon/mltoll.ts +1566 -0
  287. package/src/prove/zenon/node.ts +297 -0
  288. package/src/prove/zenon/ocaml.ts +169 -0
  289. package/src/prove/zenon/parse.ts +247 -0
  290. package/src/prove/zenon/phrase.ts +191 -0
  291. package/src/prove/zenon/proof.ts +198 -0
  292. package/src/prove/zenon/propositional-rules.ts +387 -0
  293. package/src/prove/zenon/rules.ts +94 -0
  294. package/src/prove/zenon/search.ts +288 -0
  295. package/src/prove/zenon/tla/functions.ts +151 -0
  296. package/src/prove/zenon/tla/llproof.ts +480 -0
  297. package/src/prove/zenon/tla/records.ts +225 -0
  298. package/src/prove/zenon/tla/rewrites.ts +447 -0
  299. package/src/prove/zenon/tla/sets.ts +304 -0
  300. package/src/prove/zenon/tla/terms.ts +181 -0
  301. package/src/prove/zenon/tla/tla.ts +506 -0
  302. package/src/run-cli.ts +338 -52
  303. package/src/tlapm-cache.ts +250 -0
  304. package/src/values.ts +8 -3
  305. package/src/worker.ts +65 -0
  306. package/dist/parallel.cjs +0 -12
  307. package/dist/parallel.js +0 -12
package/dist/transfer.js CHANGED
@@ -6,30 +6,24 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=/* @__PURE__ */ new WeakMap,n=(e,n)=>(e instanceof Error&&!t.has(e)&&t.set(e,n),e),r=e=>t.get(e),i=t=>{try{return t()}catch(t){throw n(t,e.error)}},a=e=>{let t=i(e);return t&&{branches:t.branches,addInitialState:(e,n,r)=>i(()=>t.addInitialState(e,n,r)),addState:(e,n,r,a)=>i(()=>t.addState(e,n,r,a)),findViolation:()=>i(()=>t.findViolation()),getViolatedProperties:(e,n)=>i(()=>t.getViolatedProperties(e,n))}},o=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,s=o(`java.lang.RuntimeException`),c=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`;var l=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},u=class extends l{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},d=class extends u{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},f=class extends d{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const p=(e,t=!1,n,r=[])=>new u(e.map(e=>`${e.location}\n\n${e.message}`).join(`
10
-
11
- `),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),m=(e,t)=>p([{location:`In module ${t}`,message:`Cannot find source file for module ${e} imported in module ${t}.`}],!0),h=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
12
- `)}`,g=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,_=(e,t)=>p([{location:g(t),message:e}]);var v=class extends l{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},y=class extends l{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}};const b=`This was a Java StackOverflowError. It was probably the result
13
- of an incorrect recursive function definition that caused TLC to enter
14
- an infinite loop when trying to compute the function or its application
15
- to an element in its putative domain.`;var x=class extends y{constructor(){super(b)}},ee=class extends y{state;action;variables;constructor(e,t,n,r){super(e),this.state=t,this.action=n,this.variables=r}},te=class extends y{variable;constructor(e,t){super(e),this.variable=t}},S=class extends y{exitCode;constructor(t,n=e.error){super(t),this.name=`TlaEvaluationError`,this.exitCode=n}},ne=class extends y{state;constructor(e){super(`current state is not a legal state`),this.name=`TlaEvaluationError`,this.state=e}},re=class extends l{failure;exception;constructor(e,t={}){super(e),this.name=`TlaProofError`,this.failure=t.exception===void 0?t.failure??e:void 0,this.exception=t.exception??`Failure(${JSON.stringify(this.failure)})`}},ie=class extends re{constructor(e=`Assert_failure`){super(`Oops, this seems to be a bug in TLAPM.`,{exception:e}),this.name=`TlaProofError`}},C=class extends l{constructor(e,t){super(e,t),this.name=`TlaUnsupportedError`}},ae=class extends C{unwound;constructor(e,t){super(e),this.name=`TlaJavaException`,this.unwound=t}};const oe=t=>r(t)??(t instanceof u?e.specParseError:t instanceof v?e.configParseError:t instanceof y?e.specEvaluationFailure:e.error);var se=class extends l{node;constructor(e,t){super(e),this.name=`PcalError`,this.node=t}},w=class extends l{constructor(e){super(e),this.name=`PcalRuntimeError`}},T=class extends l{constructor(e){super(`You have discovered a bug in pcal.trans.\nSend the following information and the\ninput file to the current maintainer(s).\n\n -- ${e}.`),this.name=`PcalBugError`}};const E=/* @__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(`.`)),D=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),ce=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),le=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),ue=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),de=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,fe=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),pe=e=>e.startsWith(`\\`)?parseInt(e.slice(2),fe.get(e[1].toLowerCase())):Number(e),me=/-{4,}[ \t]*MODULE\b/,he=e=>/[A-Za-z0-9_]/.test(e),O=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,r={value:n.length};for(;r.value>0&&!D.has(n.slice(0,r.value));)r.value--;let i=D.get(n.slice(0,r.value));return{text:i??`\\`,length:i===void 0?1:r.value+1}}let r=[e.slice(t,t+2),n].find(e=>ue.has(e));if(r!==void 0)return{text:ue.get(r)??``,length:r.length};let i=le.find(n=>e.startsWith(n,t));return i?{text:ce.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},ge=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),_e=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>ue.has(e)||ge.has(e));return n===void 0?void 0:{text:n,length:n.length}},ve=e=>e!==void 0&&e>=`0`&&e<=`9`,ye=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},be=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:ye(e,t+1,ve);if(n===t+1||e[n]!==`>`)return 0;let r=ye(e,n+1,he),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return ye(e,i?r+1:r,e=>e===`.`)-t},xe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Se=(e,t)=>t===` `?e+8-e%8:e+1,Ce=e=>{let t=me.exec(e);if(!t)throw new u(`Expected a module header such as ---- MODULE Name ----`);let n=[],r=/* @__PURE__ */ new Map,i=e.slice(0,t.index).split(`
16
- `),a={index:t.index,line:i.length,lineStart:t.index-i[i.length-1].length,moduleDepth:0},o={lineStart:-1,position:0,width:0},s=()=>{for((o.lineStart!==a.lineStart||o.position>a.index)&&(o.lineStart=a.lineStart,o.position=a.lineStart,o.width=0);o.position<a.index;o.position++)o.width=Se(o.width,e[o.position]);return Se(o.width,e[a.index])},c=(e,t,r,i)=>{let o=s();n.push({kind:e,text:t,spelling:i,line:a.line,column:o,endColumn:o+r-1}),a.index+=r},l=t=>{for(let n=0;n<t;n++)e[a.index]===`
17
- `&&(a.line++,a.lineStart=a.index+1),a.index++},d=t=>new u(`${t} at line ${a.line}, column ${s()}`,void 0,{reason:t,line:a.line,column:s(),isEnd:a.index>=e.length});for(;a.index<e.length;){let t=e[a.index];if(t===`
18
- `||t===` `||t===` `||t===`\r`){l(1);continue}if(e.startsWith(`\\*`,a.index)){let t=e.indexOf(`
19
- `,a.index);l((t===-1?e.length:t)-a.index);continue}if(e.startsWith(`(*`,a.index)){let t={value:0};do{if(a.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,a.index)?(t.value++,l(2)):e.startsWith(`*)`,a.index)?(t.value--,l(2)):l(1)}while(t.value>0);continue}if(e.startsWith(`----`,a.index)){let t=ye(e,a.index,e=>e===`-`)-a.index;e.slice(a.index+t).trimStart().startsWith(`MODULE`)&&a.moduleDepth++,c(`Separator`,`----`,t);continue}if(e.startsWith(`====`,a.index)){if(c(`ModuleEnd`,`====`,ye(e,a.index,e=>e===`=`)-a.index),a.moduleDepth--,a.moduleDepth<=0)break;continue}if(t===`"`){let t=a.line,r=s(),i=[];for(l(1);e[a.index]!==`"`;){if(a.index>=e.length||`
20
- \r`.includes(e[a.index]))throw d(`Unterminated string`);if(e[a.index]===`\\`){let t=e[a.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
21
- `,t:` `,r:`\r`,f:`\f`}[t]??t),l(2)}else i.push(e[a.index]),l(1)}l(1),n.push({kind:`String`,text:i.join(``),line:t,column:r,endColumn:s()-1});continue}let i=de.exec(e.slice(a.index,a.index+64));if(i){c(`Number`,i[0],i[0].length);continue}if(he(t)){let t=e.slice(a.index,ye(e,a.index,he));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(a.index))?.[0]??t;c(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){c(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){c(`Keyword`,t.slice(0,3),3);continue}let i=r.get(t)??t;r.set(i,i),c(E.has(t)?`Keyword`:`Identifier`,i,t.length);continue}if(`ℕℤℝ`.includes(t)){c(`Identifier`,r.get(t)??t,1),r.set(t,t);continue}let o=be(e,a.index);if(o>0){c(`Step`,e.slice(a.index,a.index+o),o);continue}let u=O(e,a.index);if(u){let t=e.slice(a.index,a.index+u.length);c(`Operator`,u.text,u.length,t===u.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=s();return n.push({kind:`End`,text:``,line:a.line,column:f,endColumn:f}),n},we=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],k=we.map(e=>e[0]),Te=new Map(k.map((e,t)=>[e,t]).reverse()),A=e=>{let t=Te.get(e);if(t===void 0)throw new l(`Unknown SANY token kind ${e}`);return t},Ee=new Map(we.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),De=Math.max(...[...Ee.keys()].map(e=>e.length)),Oe=Array.from({length:De},(e,t)=>De-t),ke=/----+ *MODULE/y,Ae=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],je=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),Me=je(String.raw`\.\/\\`),Ne=je(String.raw`\.\\\/`),Pe=String.raw`<(?:[0-9]+|\+|\*)>`,Fe=[[`_BM0`,[ke]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Pe}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Pe,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Pe}(?:\*\.*|-\.*|\.+)`,`y`)]]],Ie=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[ke]]],Le=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[ke]],[`BAND`,Me],[`BOR`,Ne],[`IDENTIFIER`,Ae]],j=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Re=(e,t,n)=>e.map(([e,r])=>({kind:A(e),length:Math.max(...r.map(e=>j(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),ze=(e,t)=>{let n=Oe.find(n=>Ee.has(e.slice(t,t+n))),r=Re(Fe,e,t);if(n===void 0)return r;let i={kind:Ee.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},Be=e=>e+8-e%8,Ve=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
9
+ import{B as e,D as t,E as n,F as r,H as i,I as a,L as o,M as s,N as c,O as l,P as u,R as d,S as f,U as p,V as m,W as h,_ as g,g as _,h as v,k as y,l as b,m as x,v as ee,z as S}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(` `),C=/* @__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`]]),ae=/^\\([bB][01]+|[oO][0-7]+|[hH][0-9a-fA-F]+)/,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/,w=e=>/[A-Za-z0-9_]/.test(e),T=(e,t)=>{let n=e[t];if(n===`\\`&&/[A-Za-z]/.test(e[t+1]??``)){let n=/^[A-Za-z]+/.exec(e.slice(t+1))?.[0]??``,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=[e.slice(t,t+2),n].find(e=>C.has(e));if(r!==void 0)return{text:C.get(r)??``,length:r.length};let i=ie.find(n=>e.startsWith(n,t));return i?{text:re.get(i)??i,length:i.length}:n===`\\`?{text:`\\`,length:1}:void 0},E=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),D=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>C.has(e)||E.has(e));return n===void 0?void 0:{text:n,length:n.length}},le=e=>e!==void 0&&e>=`0`&&e<=`9`,ue=(e,t,n)=>{let r={value:t};for(;r.value<e.length&&n(e[r.value]);)r.value++;return r.value},de=(e,t)=>{if(e[t]!==`<`)return 0;let n=e[t+1]===`+`||e[t+1]===`*`?t+2:ue(e,t+1,le);if(n===t+1||e[n]!==`>`)return 0;let r=ue(e,n+1,w),i=r===n+1&&(e[r]===`*`||e[r]===`-`);return ue(e,i?r+1:r,e=>e===`.`)-t},fe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,pe=(e,t)=>t===` `?e+8-e%8:e+1,me=e=>{let n=ce.exec(e);if(!n)throw new t(`Expected a module header such as ---- MODULE Name ----`);let r=[],i=/* @__PURE__ */ new Map,a=e.slice(0,n.index).split(`
10
+ `),o={index:n.index,line:a.length,lineStart:n.index-a[a.length-1].length,moduleDepth:0},s={lineStart:-1,position:0,width:0},c=()=>{for((s.lineStart!==o.lineStart||s.position>o.index)&&(s.lineStart=o.lineStart,s.position=o.lineStart,s.width=0);s.position<o.index;s.position++)s.width=pe(s.width,e[s.position]);return pe(s.width,e[o.index])},l=(e,t,n,i)=>{let a=c();r.push({kind:e,text:t,spelling:i,line:o.line,column:a,endColumn:a+n-1}),o.index+=n},u=t=>{for(let n=0;n<t;n++)e[o.index]===`
11
+ `&&(o.line++,o.lineStart=o.index+1),o.index++},d=n=>new t(`${n} at line ${o.line}, column ${c()}`,void 0,{reason:n,line:o.line,column:c(),isEnd:o.index>=e.length});for(;o.index<e.length;){let t=e[o.index];if(t===`
12
+ `||t===` `||t===` `||t===`\r`){u(1);continue}if(e.startsWith(`\\*`,o.index)){let t=e.indexOf(`
13
+ `,o.index);u((t===-1?e.length:t)-o.index);continue}if(e.startsWith(`(*`,o.index)){let t={value:0};do{if(o.index>=e.length)throw d(`Unterminated comment`);e.startsWith(`(*`,o.index)?(t.value++,u(2)):e.startsWith(`*)`,o.index)?(t.value--,u(2)):u(1)}while(t.value>0);continue}if(e.startsWith(`----`,o.index)){let t=ue(e,o.index,e=>e===`-`)-o.index;e.slice(o.index+t).trimStart().startsWith(`MODULE`)&&o.moduleDepth++,l(`Separator`,`----`,t);continue}if(e.startsWith(`====`,o.index)){if(l(`ModuleEnd`,`====`,ue(e,o.index,e=>e===`=`)-o.index),o.moduleDepth--,o.moduleDepth<=0)break;continue}if(t===`"`){let t=o.line,n=c(),i=[];for(u(1);e[o.index]!==`"`;){if(o.index>=e.length||`
14
+ \r`.includes(e[o.index]))throw d(`Unterminated string`);if(e[o.index]===`\\`){let t=e[o.index+1];if(t===void 0||!`ntrf\\"`.includes(t))throw d(`Invalid escape in string`);i.push({n:`
15
+ `,t:` `,r:`\r`,f:`\f`}[t]??t),u(2)}else i.push(e[o.index]),u(1)}u(1),r.push({kind:`String`,text:i.join(``),line:t,column:n,endColumn:c()-1});continue}let n=ae.exec(e.slice(o.index,o.index+64));if(n){l(`Number`,n[0],n[0].length);continue}if(w(t)){let t=e.slice(o.index,ue(e,o.index,w));if(/^\d+$/.test(t)){let n=/^\d+(\.\d+)?/.exec(e.slice(o.index))?.[0]??t;l(n.includes(`.`)?`Decimal`:`Number`,n,n.length);continue}let n=/^(_|\d+)/.exec(t)?.[0];if(n!==void 0&&!/[A-Za-z]/.test(t)){l(n===`_`?`Operator`:`Number`,n,n.length);continue}if(t.startsWith(`WF_`)||t.startsWith(`SF_`)){l(`Keyword`,t.slice(0,3),3);continue}let r=i.get(t)??t;i.set(r,r),l(te.has(t)?`Keyword`:`Identifier`,r,t.length);continue}if(`ℕℤℝ`.includes(t)){l(`Identifier`,i.get(t)??t,1),i.set(t,t);continue}let a=de(e,o.index);if(a>0){l(`Step`,e.slice(o.index,o.index+a),a);continue}let s=T(e,o.index);if(s){let t=e.slice(o.index,o.index+s.length);l(`Operator`,s.text,s.length,t===s.text?void 0:t)}else throw d(`Unexpected character ${JSON.stringify(t)}`)}let f=c();return r.push({kind:`End`,text:``,line:o.line,column:f,endColumn:f}),r},he=[[`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`]],ge=he.map(e=>e[0]),_e=new Map(ge.map((e,t)=>[e,t]).reverse()),O=e=>{let t=_e.get(e);if(t===void 0)throw new v(`Unknown SANY token kind ${e}`);return t},ve=new Map(he.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),ye=Math.max(...[...ve.keys()].map(e=>e.length)),be=Array.from({length:ye},(e,t)=>ye-t),xe=/----+ *MODULE/y,Se=[/_\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],Ce=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`)),we=Ce(String.raw`\.\/\\`),k=Ce(String.raw`\.\\\/`),Te=String.raw`<(?:[0-9]+|\+|\*)>`,A=[[`_BM0`,[xe]],[`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`,we],[`BOR`,k],[`IDENTIFIER`,Se],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Te}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Te,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Te}(?:\*\.*|-\.*|\.+)`,`y`)]]],Ee=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[xe]]],De=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[xe]],[`BAND`,we],[`BOR`,k],[`IDENTIFIER`,Se]],Oe=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),ke=(e,t,n)=>e.map(([e,r])=>({kind:O(e),length:Math.max(...r.map(e=>Oe(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),Ae=(e,t)=>{let n=be.find(n=>ve.has(e.slice(t,t+n))),r=ke(A,e,t);if(n===void 0)return r;let i={kind:ve.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},je=e=>e+8-e%8,Me=e=>{let t=[],n=[],r={line:1,column:0,isAfterCr:!1,isAfterLf:!1};for(let i of e)for(let e=0;e<i.length;e++)r.column++,r.isAfterLf?(r.isAfterLf=!1,r.line++,r.column=1):r.isAfterCr&&(r.isAfterCr=!1,i===`
22
16
  `?r.isAfterLf=!0:(r.line++,r.column=1)),i===`\r`?r.isAfterCr=!0:i===`
23
- `?r.isAfterLf=!0:i===` `&&(r.column=Be(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},He=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Ue=new Set([...Ee.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),We=(e,t)=>{let n=0;for(;Ue.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,j(He,e,t)))},Ge=e=>{let t=Ve(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(A(`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?Je(o,s,e[a],i):t.lines[n]===o?e[a]===`
24
- `||e[a]===`\r`?Je(o+1,0,void 0,i):Je(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=Re(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,k[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),k[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Ie);if(n.mode===`PRAGMA`)return s(Le);for(;n.offset<e.length;){let t=n.offset;if(`
25
- \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=ze(e,t);if(i.length===0){let n=We(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()}},Ke=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
26
- `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),qe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Ke.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Je=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${qe(n)}" (${n.charCodeAt(0)}), `}after : "${qe(r)}"`,Ye=e=>{let t=Ge(e);for(let e=t();typeof e!=`string`&&e.kind!==A(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?Be(e):e+1,e.beginColumn);return Je(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Xe=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ze=/* @__PURE__ */ new Set([...Xe,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),Qe=[`TYPE`,`TYPE_CONSTRAINT`],$e=/* @__PURE__ */ new Set([...Xe,...Qe]),et=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],tt=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:Je(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:Je(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
17
+ `?r.isAfterLf=!0:i===` `&&(r.column=je(r.column-1)),t.push(r.line),n.push(r.column);return{lines:t,columns:n}},Ne=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,Pe=new Set([...ve.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Fe=(e,t)=>{let n=0;for(;Pe.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,Oe(Ne,e,t)))},Ie=e=>{let t=Me(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(O(`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?Re(o,s,e[a],i):t.lines[n]===o?e[a]===`
18
+ `||e[a]===`\r`?Re(o+1,0,void 0,i):Re(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=ke(t,e,n.offset);if(i.length>0){let e=r(i.kind,n.offset,i.length);return n.offset+=i.length,ge[i.kind].startsWith(`_BM`)&&(n.mode=`SPEC`),ge[i.kind]===`BEGIN_PRAGMA`&&(n.mode=`PRAGMA`),e}n.offset++}return i()};return()=>{if(n.mode===`DEFAULT`)return s(Ee);if(n.mode===`PRAGMA`)return s(De);for(;n.offset<e.length;){let t=n.offset;if(`
19
+ \r`.includes(e[t]))n.offset++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=o();if(e!==void 0)return e}else{let i=Ae(e,t);if(i.length===0){let n=Fe(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()}},Le=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
20
+ `,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),j=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>Le.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),Re=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${j(n)}" (${n.charCodeAt(0)}), `}after : "${j(r)}"`,ze=e=>{let t=Ie(e);for(let e=t();typeof e!=`string`&&e.kind!==O(`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===` `?je(e):e+1,e.beginColumn);return Re(e.beginLine,n,e.image[t],e.image.slice(0,t))}},Be=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ve=/* @__PURE__ */ new Set([...Be,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),He=[`TYPE`,`TYPE_CONSTRAINT`],Ue=/* @__PURE__ */ new Set([...Be,...He]),We=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Ge=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:Re(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:Re(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
27
21
  `);t.length>1&&(n.line+=t.length-1,n.lineStart=n.index+e.length-t[t.length-1].length),n.index+=e.length};for(;n.index<e.length;){let o=e.slice(n.index),s=/^\s+/.exec(o)?.[0];if(s){a(s);continue}if(o.startsWith(`\\*`)){let e=o.indexOf(`
28
- `);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=et.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=_e(e,n.index)??O(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},nt=(e,t)=>new v(`TLC found an error in the configuration file at line ${e}\n${t}`),rt=(e,t)=>nt(e,`The keyword ${t} appeared twice.`),M=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),it=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),at=(e,t=`master`)=>{let n=t===`1.7.4`?$e:Ze,r=tt(e),i={index:0},a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new v(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw nt(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw nt(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw nt(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw nt(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw nt(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw nt(e,``);r.token=c()}if(r.token.text!==`=`)throw nt(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?M.get(e):void 0,i=n.has(e)?it.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw nt(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw rt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw nt(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw rt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!Qe.includes(e))throw nt(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw rt(t,e);s.add(e),p.token=c()}}return a},ot={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},st=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},ct=e=>e!==void 0&&/^\p{Nd}$/u.test(e),lt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),ut=e=>{let t=t=>{let n=ye(e,t,st);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l={index:t(i)};for(;l.index!==void 0&&e[l.index]!==a;){let n=o(l.index);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l.index=t(i)}if(l.index!==void 0)return c.last=l.index,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=ye(e,t,ct);if(e.startsWith(`..`,n)&&ct(e[n+2]))return{kind:`Constant`,first:t,last:ye(e,n+2,ct)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=ct(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ye(e,t+1,ct)-1,children:[]};if(lt(n))return{kind:`Constant`,first:t,last:ye(e,t,lt)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},dt=e=>{let t=e.length===0?void 0:ut(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=ot[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},N=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,ft=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),P=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),F=e=>typeof e==`object`&&e.kind===`ModelValue`,pt=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:N(e)?`set`:`function`,mt=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new S(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ht={isUsed:!1},gt=(e,t)=>(ht.isUsed=!0,e.writtenKeys=t,e),_t=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[Cr(e.domain,t)]]),vt=(e,t,n)=>gt(tn(e,t),n),yt=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(yt);e.writtenKeys=void 0,e.range.forEach(yt)}},bt=e=>e.every(e=>typeof e==`string`),xt=(e,t)=>e.length>0&&t.length>0&&bt(e)!==bt(t),St=(e,t)=>{ht.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return xt(n,r)?Cn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=zt(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:zt(t,n);if(r!==0)return r}return 0},Ct=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=zt(n[e],r[e]);if(t!==0)return t}return 0},wt=e=>F(e)?e.type:void 0,Tt=(e,t,n)=>{let r=wt(e),i=wt(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(F(e)&&F(t)){if(r===void 0||i===void 0||r===i)return;throw new y(`Attempted to ${a} the differently-typed model values ${z(e)} and ${z(t)}`)}throw r===void 0?new y(`Attempted to ${a} the typed model value ${z(t)} and the non-model value\n${z(e)}`):new y(`Attempted to ${a}${n?``:` the`} typed model value ${z(e)} and non-model value\n${z(t)}`)},Et={ranks:Object.create(null),size:0},Dt=e=>{Et.ranks=Object.create(null),Et.size=0,Bt.clear();for(let t of e)At(t)},Ot={is174:!1},kt=e=>{Ot.is174=e===`1.7.4`},At=e=>(Et.ranks[e]===void 0&&(Et.ranks[e]=Et.size++),e),jt=()=>Et.size,Mt=e=>Et.ranks[At(e)],Nt=(e,t)=>{if(e===t)return 0;let n=Et.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Pt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Ft=(e,t)=>(Pt(e)||Pt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),It=(e,t,n)=>{if(!Pt(e))throw new y(`Attempted to ${n} the set ${z(I(e)?L(e):e,!0)} with the value:\n${z(t,!0)}`);if(!Pt(t))throw new y(`Attempted to compare overridden value ${z(e,!0)} with non-overridden value:\n${z(t,!0)}`);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new y(`Attempted to compare ${z(e,!0)} with the value\n${z(t,!0)}`)},Lt={kind:`InfiniteSet`,name:`Any`},Rt=e=>{throw new y(`Attempted to compare ANY with the value\n${z(e)}`)},zt=(e,t)=>{if(e===t)return ht.isUsed&&yt(e),e===Lt?Rt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return St(e,t);if(n===`Set`&&r===`Set`)return Ct(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&Tt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Tt(e,t,!1),n===`ModelValue`?-1:1;if(e===Lt||t===Lt)return Rt(e===Lt?t:e);if(N(e)&&N(t)&&Ft(e,t))return It(e,t,`compare`);let i=N(e);if(i!==N(t))throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`);return i?Ct(L(e),L(t)):St(Nr(e),Nr(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Nt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Tt(e,t,!1),F(e))return-1;if(F(t))return 1;throw new y(`Attempted to compare ${pt(e)} ${z(e)} with ${pt(t)} ${z(t)}`)},Bt=/* @__PURE__ */ new Map,Vt=e=>{let t=Bt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Mt(e)};return Bt.set(e,n),n},Ht=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),Ut=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Wt={isPresent:!1},Gt=(e,t)=>(t===`lambda`&&(Wt.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Kt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,qt=e=>Gt(e,`lambda`),Jt=/* @__PURE__ */ new WeakSet,Yt=/* @__PURE__ */ new WeakSet,Xt={isPresent:!1},Zt=e=>(Xt.isPresent=!0,e),Qt=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),$t=e=>{Xt.isPresent&&typeof e==`object`&&Qt.has(e.kind)&&Yt.add(e)},en=e=>{if((Wt.isPresent||Xt.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(Jt.has(e))return;Jt.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(en),e.range.forEach(en)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(en):N(e)&&I(e)&&($t(e),L(e).elements.forEach(en))}},tn=(e,t)=>Gt(Ut(e,t),`record`),nn=(e,t)=>{if($t(e),e===t)return ht.isUsed&&yt(e),e!==Lt||Rt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Tt(e,t,!0),zt(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return St(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Ct(e,t)===0;if(F(e)||F(t))return Tt(e,t,!0),F(e)&&F(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return nn(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=R(e.domain),r=R(t.domain);if(n||r)return n===r;let i=R(e.range),a=R(t.range);return i||a?i===a:nn(e.domain,t.domain)&&nn(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(R(e))return R(t);if(R(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&nn(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return R(e)?R(t):!R(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>nn(e,t.factors[n]));let n=N(e)&&N(t)&&!(I(e)&&I(t));if(n&&Ft(e,t))return It(e,t,`check equality of`)===0;if(n){if(!Pt(e)){let n=L(e);if(!Pt(t))return Ct(n,L(t))===0}return ui(e)===ui(t)}return zt(e,t)===0},rn=e=>{let t=(e,t)=>e===t||e.length===t.length&&e.every((e,r)=>n(e,t[r])),n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ui(n)===ui(r);return n},an=rn(!1),on=rn(!0),sn=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},cn=e=>{if(!P(e))return;let t=Nr(e);return{domain:t.domain,range:t.range,low:sn(t.domain)}},ln=e=>{if(!P(e))return;let t=Nr(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},un=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to compare the typed model value ${z(e)} and the non-model value\n${z(t)}`);return 1},dn=(e,t)=>{if(wt(e)!==void 0)throw new y(`Attempted to check equality of the typed model value ${z(e)} and the non-model value\n${z(t)}`);return!1},fn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)?e.rank-t.rank:-1;if(!F(t))throw new y(`Attempted to compare the typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to compare the differently-typed model values ${z(e)} and ${z(t)}`);return e.rank-t.rank},pn=(e,t)=>{let n=wt(e);if(n===void 0)return F(t)&&e.name===t.name;if(!F(t))throw new y(`Attempted to check equality of typed model value ${z(e)} and non-model value\n${z(t)}`);let r=wt(t);if(r!==void 0&&r!==n)throw new y(`Attempted to check equality of the differently-typed model values ${z(e)} and ${z(t)}`);return e.name===t.name},mn={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},hn=(e,t,n)=>{let r=mn[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${z(e)} with ${r.other}:\n${z(t)}`},gn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return un(n,t);throw new y(`Attempted to compare the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>_n(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return _n(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new y(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${z(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},_n=(e,t)=>{for(let n=0;n<e.length;n++){let r=Cn(e[n],t[n]);if(r!==0)return r}return 0},vn=(e,t)=>{let n=Nr(e);if(e.kind===`Function`&&wr(n)!==void 0){let r=P(t)?wr(t):void 0;return r?n.range.length-r.length||_n(n.range,r):gn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return un(t,e);throw new y(`Attempted to compare record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length-r.domain.length||_n(n.domain,r.domain)||_n(n.range,r.range)}return gn({...n,low:sn(n.domain)},e,t)},yn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),bn=(e,t)=>Pt(e)||Pt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),xn=(e,t)=>{let n=yn(t)?t:L(t);return{elements:L(e).elements,otherElements:L(n).elements}},Sn=(e,t)=>{if(bn(e,t))return zt(e,t);if(!yn(e))return Sn(L(e),t);if(!N(t)){if(F(t))return un(t,e);throw new y(`Attempted to compare the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length-n.otherElements.length||_n(n.elements,n.otherElements)},Cn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return zt(e,t);if(F(t))return un(t,e);throw new y(hn(e,t,!1))}return e.kind===`ModelValue`?fn(e,t):P(e)?vn(e,t):Sn(e,t)},wn=(e,t)=>e.every((e,n)=>On(e,t[n])),Tn=(e,t,n)=>{let r=cn(n);if(!r){if(F(n))return dn(n,t);throw new y(`Attempted to check equality of the function ${z(t)} with the value:\n${z(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&wn(e.range,r.range);let i=e.low??r.low;return i===void 0?wn(e.domain,r.domain)&&wn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new y(`Attempted to compare an integer with non-integer:\n${z(e)}.`);return e===i+t})&&wn(e.range,r.range)},En=(e,t)=>{let n=Nr(e);if(e.kind===`Function`&&wr(n)!==void 0){let r=P(t)?wr(t):void 0;return r?n.range.length===r.length&&wn(n.range,r):Tn({...n,low:1},e,t)}if(Kt(e)===`record`){let r=ln(t);if(!r){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of record:\n${z(e)}\nwith non-record\n${z(t)}`)}return n.domain.length===r.domain.length&&wn(n.domain,r.domain)&&wn(n.range,r.range)}return Tn({...n,low:sn(n.domain)},e,t)},Dn=(e,t)=>{if(bn(e,t))return nn(e,t);if(!yn(e))return Dn(L(e),t);if(!N(t)){if(F(t))return dn(t,e);throw new y(`Attempted to check equality of the set ${z(e)} with the value:\n${z(t)}`)}let n=xn(e,t);return n.elements.length===n.otherElements.length&&wn(n.elements,n.otherElements)},On=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(F(t))return dn(t,e);throw new y(hn(e,t,!0))}return e.kind===`ModelValue`?pn(e,t):P(e)?En(e,t):Dn(e,t)},kn=e=>{let t=[];for(let n of e){let e=jn(n,t);e.isFound||t.splice(e.index,0,n)}return t},An=(e,t)=>{let n=Er.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},jn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=An(e,()=>Cn(e,t[r]));if(i===0)return{index:r,isFound:!0};i<0?n.high=r:n.low=r+1}return{index:n.low,isFound:!1}},Mn=(e,t)=>t.some(t=>An(t,()=>On(t,e))),Nn=/* @__PURE__ */ new WeakSet,Pn=e=>{typeof e==`object`&&(e.kind===`Set`&&(Nn.add(e),e.elements.forEach(Pn)),e.kind===`Function`&&(e.domain.forEach(Pn),e.range.forEach(Pn)))},Fn=(e,t)=>Dr(nn,On,e,t),In=e=>{for(let t=1;t<e.length;t++)if(zt(e[t-1],e[t])>=0)return!1;return!0},Ln=e=>{for(let t=1;t<e.length;t++)$t(e[t]);if(e.length<2||In(e))return Ht(e);let t=[...e].sort(zt),n=[t[0]];for(let e=1;e<t.length;e++)zt(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ht(n)},Rn=e=>Dr(Ln,e=>({kind:`MixedSet`,elements:e}),e,void 0),zn=Ht([]),Bn=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ht(i)},Vn=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&zt(r[a],t)<0;)a++;a<r.length&&zt(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ht(i)},Hn=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=zt(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=Ht(i);if(e.hash!==0&&e.hash!==Xr){let t=e.hash,n=0;for(;n<a.length;n++){let e=ti(a[n]);if(e===Xr)break;t=t+Jr(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+ai(a[e])|0;c.fingerprint=t}return c},Un=e=>{let t=e.length<2?e:[...e].sort((e,t)=>zt(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&zt(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Ut(n,r)},Wn=e=>{let t=Un(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:gt(t,e.map(e=>e[0]))},Gn=[],Kn=[],qn=/* @__PURE__ */ new WeakMap,Jn=e=>{let t=Gn[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return Gn[e]=n,n},Yn=e=>{if(br(e),e.low===1&&e.high>=1)return Jn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Xn=e=>e.length>0&&(e===Gn[e.length]||qn.has(e)),Zn=e=>{let t=L(e).elements;return Xn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Qn=e=>{let t=Kn[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Kn[e]=n,n},$n=e=>Gt(Ut(Jn(e.length),e),`tuple`),er=e=>Gt(Un(e),`record`),tr=e=>N(e)&&!Pt(e),nr=(e,t=!1)=>`UNION(${z(e.base,t)})`,rr=(e,t=e=>L(e).elements)=>{if(!tr(e.base))throw new y(`Attempted to enumerate the nonenumerable set:\n${nr(e)}`);return t(e.base)},ir=(e,t,n)=>{if(tr(e))return e;throw new y(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${z(e)}\nwhen enumerating:\n${nr(n)}`)},I=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return I(e.base);case`FunctionSet`:return I(e.domain)&&I(e.range)||ar(e.domain)===!0||ar(e)===!0;case`RecordSet`:return e.sets.every(I)||ar(e)===!0;case`ProductSet`:return e.factors.every(I)||ar(e)===!0;case`Union`:return I(e.base)&&pr(e.base).every(I);case`SetOperation`:return e.operator===`\\cup`?I(e.left)&&I(e.right):e.operator===`\\cap`?I(e.left)||I(e.right):I(e.left);default:return!1}},ar=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=ar(e.domain);return t===void 0?void 0:!t&&ar(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=ar(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return I(e)?L(e).elements.length===0:void 0;default:return}},or=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},sr=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},cr=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Pt(e.base))return;let t=L(e.base).elements;if(t.length<=30)return;let n={index:-1,indices:[0]},r=e=>{for(e<=n.index&&(n.index=-1);n.index<e;)n.index===-1?n.indices=[]:sr(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Ht(n.indices.map(e=>t[e]))},i=2**t.length,a=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<i;return new Proxy([],{get:(e,t,n)=>t===`length`?i:a(t)?r(Number(t)):Reflect.get(e,t,n),has:(e,t)=>a(t)||Reflect.has(e,t)})},lr=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ht(r.map(t=>e[t])));while(sr(r,e.length))}return t},ur=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Pt(a))throw new y(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},dr=(e,t=e=>L(e).elements)=>{if(typeof e!=`object`)throw new y(`Expected a set but found ${z(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return kn(e.elements);case`Interval`:{let t=Yn(e);return t!==Gn[t.length]&&qn.set(t,e),t}case`Subset`:{if(br(e.base)===0)return lr([]);if(!N(e.base))throw new y(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${dt(z(e.base))}`);let t=L(e.base).elements;if(t.length>30)throw new y(yr(e));return lr(t)}case`FunctionSet`:{if(!Ot.is174&&R(e))return[];if(Pt(e.domain))throw new y(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${z(e.domain)}\ncannot be enumerated.`);let n=Zn(e.domain);if((n.length>0||Ot.is174)&&Pt(e.range))throw new y(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${z(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return or(n.map(()=>r)).map(e=>Ut(n,e))}case`RecordSet`:{if(!Ot.is174&&R(e))return[];let n=ur(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${z(t)}`);return or(n).map(t=>er(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Ot.is174&&R(e))return[];let n=ur(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${z(e)}`);return or(n).map($n)}case`FilteredSet`:if(!N(e.base)||Pt(e.base))throw new y(`Attempted to enumerate { x \\in S : p(x) } when S:\n${z(e.base)}\nis not enumerable`);return L(e.base).elements.filter(e.test);case`Union`:{let t=rr(e).flatMap((t,n)=>L(ir(t,n,e)).elements);return L(Rn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!tr(e.left)||!tr(e.right)))throw new y(`Attempted to enumerate S \\cup T when S:\n${z(e.left)}\nand T:\n${z(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!tr(e.left)&&!tr(e.right))throw new y(`Attempted to enumerate S \\cap T when neither S:\n${z(e.left)}\nnor T:\n${z(e.right)}\nis enumerable`);if(e.operator===`\\`&&!tr(e.left))throw new y(`Attempted to enumerate S \\ T when S:\n${z(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Hn(L(e.left),L(e.right)).elements;let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return L(n).elements.filter(t=>Or(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to enumerate the non-enumerable set ${z(e)}`);default:throw new y(`Expected a set but found ${z(e)}`)}},fr=/* @__PURE__ */ new WeakMap,L=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ht(dr(e));let t=typeof e==`object`?fr.get(e):void 0;if(t)return t;let n=Er.sets;n?.push(e);let r=dr(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Ht(r):Ln(r);return typeof e==`object`&&fr.set(e,i),i},pr=e=>{if(typeof e!=`object`||Yt.has(e))return L(e).elements;let t=Er.sets;t?.push(e);let n=_r(e);return t?.pop(),n},mr=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,hr=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(hr);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(hr)&&e.range.every(hr);case`SetOperation`:return e.operator!==`\\cup`&&hr(e.left)&&hr(e.right);case`FilteredSet`:return hr(e.base);case`ProductSet`:return e.factors.every(hr);default:return!1}},gr=e=>typeof e!=`object`||Yt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?gr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||gr(e.left)||gr(e.right):mr(e)?.some(gr)??!1,_r=e=>{if(e.kind===`Union`)return rr(e,pr).flatMap((t,n)=>pr(ir(t,n,e)));if(e.kind===`FilteredSet`&&!Pt(e.base))return pr(e.base).filter(e.test);if(mr(e)?.some(gr))return dr(e,pr);if(e.kind!==`SetOperation`)return L(e).elements;if(e.operator===`\\cup`)return!tr(e.left)||!tr(e.right)?L(e).elements:[...pr(e.left),...pr(e.right)];let t=e.operator===`\\`||tr(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return tr(n)?pr(n).filter(t=>Or(t,r)===(e.operator===`\\cap`)):L(e).elements},R=e=>{if(typeof e!=`object`||!N(e))throw new y(`Shouldn't call isEmpty() on value ${z(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new y(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(R);case`RecordSet`:return e.sets.some(R);case`FunctionSet`:return!R(e.domain)&&R(e.range);case`Union`:return rr(e).every((t,n)=>R(ir(t,n,e)));default:return L(e).elements.length===0}},vr=(e,t,n)=>e.reduce((e,r)=>{let i=e*br(r,t);if(i>2147483647)throw new y(n());return i},1),yr=e=>`Overflow when computing the number of elements in:\n${z(e)}`,br=(e,t)=>{if(typeof e!=`object`)throw new y(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${z(e)}.`);switch(e.kind){case`ModelValue`:throw new y(`Attempted to compute the number of elements in the model value ${z(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return br(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new y(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new y(`Attempted to compute the number of elements in the overridden value ${z(e)}.`);case`Subset`:{let n=br(e.base,t);if(n>=31)throw new y(yr(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(R(e.domain))return 1;if(R(e.range))return 0;if(br(e.range,t)===1)return 1}let n=br(e.domain,t),r=br(e.range,t);if(r<=1)return n===0?1:r;let i={value:1};for(let t=0;t<n;t++)if(i.value*=r,i.value>2147483647)throw new y(yr(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&R(e)?0:vr(e.sets,t,()=>yr(e));case`ProductSet`:return t!==`1.7.4`&&R(e)?0:vr(e.factors,t,()=>`Overflow when computing the number of elements in ${z(e)}`);default:return $t(e),L(e).elements.length}},xr=e=>`Attempted to check if the set ${z(e)}is finite.`,Sr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new y(`Attempted to check if the ${pt(e)} ${z(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new y(`Attempted to check if the function:\n${z(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Sr(e.base)&&R(e.base);case`Subset`:return Sr(e.base);case`FunctionSet`:{let t=Sr(e.domain);if(t&&R(e.domain))return!0;let n=Sr(e.range);return n&&R(e.range)?!0:n&&(t||br(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(!Sr(e))n.isAllFinite=!1;else if(R(e))return!0;return n.isAllFinite}case`Union`:if(!tr(e.base))throw new y(`Attempted to check if the nonenumerable set:\n${nr(e)}\nis a finite set.`);return L(e.base).elements.every(Sr);case`SetOperation`:if(e.operator===`\\cup`)return Sr(e.left)&&Sr(e.right);if(e.operator===`\\cap`){if(!Sr(e.left)&&!Sr(e.right))throw new y(xr(e));return!0}if(Sr(e.left))return!0;if(!Sr(e.right))throw new y(xr(e));return!1;case`FilteredSet`:if(!Sr(e.base))throw new y(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${z(e.base)}\nis finite.`);return!0}},Cr=(e,t,n=zt)=>{let r={low:0,high:e.length-1};for(;r.low<=r.high;){let i=r.low+r.high>>1,a=n(e[i],t);if(a===0)return i;a<0?r.low=i+1:r.high=i-1}return-1},wr=e=>{if(typeof e!=`object`||!P(e))return;let t=Nr(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Tr=(e,t)=>{let n=`Attempted to check if the value:\n${z(e)}\nis an element of the`;if(!P(t))return`${n} ${pt(t)} ${z(t)}`;let r=Kt(t);return r===`record`?`Attempted to check if element:\n${z(e)}\nis in the record:\n${z(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${z(t)}`},Er={sets:void 0},Dr=(e,t,n,r)=>{let i=Er.sets,a=Er.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof y))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Or=(e,t)=>{let n=Er.sets;if(n===void 0)return jr(e,t);n.push(t);let r=jr(e,t);return n.pop(),r},kr=(e,t)=>Cr(t.elements,e)!==-1,Ar=(e,t)=>Nn.has(t)?jn(e,t.elements).isFound:Mn(e,t.elements),jr=(e,t)=>{if(!N(t))throw new y(Tr(e,t));switch(t.kind){case`Set`:return $t(e),Dr(kr,Ar,e,t);case`MixedSet`:return Mn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!F(e))throw new y(`Attempted to check if the value:\n${z(e)}\nis in the integer interval ${z(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(F(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new y(`Attempted to check if the value:\n${z(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!N(e)||Pt(e))throw new y(`Attempted to check if the non-enumerable value\n${dt(z(e))}\nis element of\n${dt(z(t))}`);return L(e).elements.every(e=>Or(e,t.base));case`FunctionSet`:{if(!P(e)){if(F(e))return!1;throw new y(`Attempted to check if \n${z(e)}\nwhich is not a TLC function value, is in the set of functions:\n${dt(z(t))}`)}let n=Nr(e),r=sn(n.domain);return(r===void 0?Fn(t.domain,Ht(n.domain)):Fn({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>Or(e,t.range))}case`RecordSet`:{let n=P(e)?Nr(e):void 0;if(!n||!bt(n.domain)){if(F(e))return!1;throw new y(`Attempted to check if non-record\n${z(e)}\nis in the set of records:\n${z(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Cr(n.domain,e);return i!==-1&&Or(n.range[i],t.sets[r])})}case`ProductSet`:{let n=P(e)?wr(e):void 0;if(n===void 0){if(P(e)&&Nr(e).domain.every(e=>typeof e==`number`)||F(e))return!1;throw new y(`Attempted to check if non-tuple\n${z(e)}\nis in the set of tuples:\n${z(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>Or(e,t.factors[n]))}case`FilteredSet`:return Or(e,t.base)&&t.test(e);case`Union`:if(!tr(t.base))throw new y(`Attempted to check if:\n ${z(e)}\nis an element of the non-enumerable set:\n ${nr(t)}`);return L(t.base).elements.some(t=>Or(e,t));case`SetOperation`:return t.operator===`\\cup`?Or(e,t.left)||Or(e,t.right):Or(e,t.left)&&Or(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=wr(e);if(n===void 0){if(F(e))return!1;throw new y(`Attempted to check if the value:\n${dt(z(e))}\nis an element of ${dt(z(t))}.`)}return n.every(e=>Or(e,t.base))}default:throw new y(Tr(e,t))}},Mr=(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?Or(e,n):e.range.every((e,r)=>Mr(e,t.range[r],n.range)),Nr=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){I(e.domain)||br(e.domain);let t=Zn(e.domain);return Gt(Ut(t,t.map(t=>e.apply(t))),Kt(e))}throw new y(`Expected a function but found ${z(e)}`)},Pr=(e,t,n)=>{let r=dt(z(e)),i=dt(z(t)),a=n===`1.7.4`;switch(Kt(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Fr=(e,t)=>{if(!Ot.is174)return Pr(e,t);let n=dt(z(t));return Kt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ir=(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},Lr=e=>new y(`Attempted to apply function with integer domain to the non-integer argument ${dt(z(e))}`),Rr=(e,t,n)=>{throw Ot.is174||e.length<32?e.forEach(e=>On(e,t)):Cr(e,t,Cn),n},zr=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Kt(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new y(n(e,t));if(a===void 0&&!Ot.is174&&Xn(r))throw Lr(t)}let i=Ir(r,t);return i===-1?Dr(Cr,Rr,r,t):i},Br=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!Or(t,e.domain))throw new y(Kt(e)===`lambda`?Pr(e,t):`Attempted to apply a function to ${z(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new y(`Attempted to apply ${z(e)}, which is not a function`);let r=n??Pr,i=zr(e,t,r);if(i===-1)throw new y(r(e,t));return e.range[i]},Vr=e=>Xn(e)?qn.get(e)??Qn(e.length):void 0,Hr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=Nr(e).domain;return Vr(t)??Ht(t)},Ur=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!I(e.domain))){if(!Or(t,e.domain))return e;let r=n(e.apply(t));return Gt({kind:`LazyFunction`,domain:e.domain,apply:n=>Fn(t,n)?r:e.apply(n),source:e.source},Kt(e))}if(!P(e))throw new y(`Attempted to apply EXCEPT construct to the value ${dt(z(e))}.`);let i=Nr(e),a=zr(i,t,Fr);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Gt(Ut(i.domain,o),Kt(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Xr){let e=ti(c);if(e!==Xr){let t=ti(i.domain[a]);l.hash=s===c?i.hash:i.hash-Yr(t,ti(s))+Yr(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-oi(e,s)+oi(e,c)|0}return l},Wr=/* @__PURE__ */ new WeakMap,Gr=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Kr=(e,t)=>Math.imul(e^t,16777619),qr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Gr(t)},Jr=e=>Gr(e+2654435769|0),Yr=(e,t)=>Gr(Math.imul(e,668265261)+t|0),Xr=795548749,Zr=e=>{if(e.kind===`ModelValue`)return Gr(Kr(qr(e.name),109));if(N(e)){if(!I(e))return Xr;let t=L(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=ti(t[e]);if(r===Xr)return Xr;n=n+Jr(r)|0}return n}if(e.kind===`LazyFunction`&&!I(e.domain))return Xr;let t=Nr(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=ti(t.domain[e]),i=ti(t.range[e]);if(r===Xr||i===Xr)return Xr;n=n+Yr(r,i)|0}return n},Qr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new y(`TLC has found a state in which the value of a variable contains ${z(e)}`);if(N(e)){L(e).elements.forEach(Qr);return}let t=Nr(e);t.domain.forEach(Qr),t.range.forEach(Qr)},$r=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{ti(e)===Xr&&Qr(e);return}catch(e){if(!(e instanceof y))throw e;return e}},ei=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[]}},ti=e=>{if(typeof e==`number`)return Gr(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return qr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Zr(e)),e.hash;let t=Wr.get(e);if(t!==void 0)return t;let n=Zr(e);return Wr.set(e,n),n},ni=/* @__PURE__ */ new WeakMap,ri=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},ii=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return ri(t)},ai=e=>ri(ci(e)+2135587861|0),oi=(e,t)=>ri(Math.imul(ci(e),374761393)+ci(t)|0),si=e=>{if(e.kind===`ModelValue`)return ri(ii(e.name)^60);if(N(e)){if(!I(e))return ii(ui(e));let t=L(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ai(t[e])|0;return n}let t=Nr(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+oi(t.domain[e],t.range[e])|0;return n},ci=e=>{if(typeof e==`number`)return ri(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return ii(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=si(e)),e.fingerprint;let t=ni.get(e);if(t!==void 0)return t;let n=si(e);return ni.set(e,n),n},li=/* @__PURE__ */ new WeakMap,ui=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=li.get(e);if(t!==void 0)return t;let n=di(e);return li.set(e,n),n},di=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ui(e.base)}>`;if(e.kind===`FilteredSet`&&!I(e))throw new y(`Attempted to compare the non-enumerable set ${z(e)} with another value`);if(N(e))return I(e)?`{${L(e).elements.map(ui).join(`,`)}}`:`<${e.kind} ${z(e)}>`;let t=Nr(e);return`(${t.domain.map((e,n)=>`${ui(e)}:${ui(t.range[n])}`).join(`,`)})`},fi=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,pi=e=>e.reduce((e,t)=>e===0?0:e*br(t),1),mi=e=>{if(e.kind===`Subset`)return br(e.base)<=6?L(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return L(e);if(e.kind===`FunctionSet`&&I(e.domain)&&br(e.domain)===0)return Ht([Ut([],[])]);let t=e.kind===`FunctionSet`?br(e.range)**br(e.domain):pi(e.kind===`RecordSet`?e.sets:e.factors);return t===0?zn:t<=1999?L(e):void 0},hi=(e,t)=>{if(t)return mi(e);if(I(e))try{return mi(e)}catch(e){if(e instanceof y)return;throw e}},gi=(e,t)=>{let n=e=>z(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return nr(e,t)}},_i=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),vi=e=>{if(I(e.domain))try{return Nr(e)}catch(e){if(e instanceof y)return;throw e}},z=(e,t=!1,n=!1)=>{let r=e=>z(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return fi(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(L(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=hi(e,t);return n?r(n):gi(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?vi(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${z(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ot.is174&&Kt(e)!==`tuple`)return`<< >>`;let a=r=>z(r,t,n&&Kt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Kt(e)===`record`||i.domain.every(e=>typeof e==`string`&&_i(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):_t(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},yi=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${dt(z(n))}\n`).join(``)},bi=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},xi=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=ti(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||on(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||on(i[e],n))return i[e]}return n.kind===`Set`?bi(n.elements,t):(bi(n.domain,t),bi(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}},Si=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},B=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,Ci=/* @__PURE__ */ new Set(/* @__PURE__ */ `=,#,~,<=>,/\\,\\/,=>,\\in,\\notin,\\subseteq,\\cup,\\cap,\\,SUBSET,UNION,DOMAIN,+,-,*,^,\\div,%,..,Seq,IsFiniteSet,RandomElement`.split(`,`)),wi=(e,t)=>Ci.has(e)?new y(t):new S(t),Ti=e=>typeof e==`object`&&e.kind===`Operator`,V=(e,t,n)=>{let r=e[t];if(r===void 0||Ti(r))throw wi(n,`${n} expects a value as argument ${t+1}`);return r},Ei=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`number`)throw wi(n,`${n} expects an integer but received ${z(r)}`);return r},Di=(e,t,n)=>{let r=V(e,t,n);if(typeof r!=`boolean`)throw wi(n,`${n} expects a boolean but received ${z(r)}`);return r},Oi=(e,t,n)=>{let r=V(e,t,n);if(!N(r))throw wi(n,`${n} expects a set but received ${z(r)}`);return r},ki=(e,t,n)=>{let r=Oi(e,t,n);if(!I(r))throw wi(n,`${n} cannot enumerate the non-enumerable set ${z(r)}`);return r},Ai=(e,t,n)=>L(ki(e,t,n)),ji=(e,t,n)=>Ai(e,t,n).elements,Mi=(e,t,n)=>{let r=V(e,t,n),i=wr(r);if(!i)throw wi(n,`${n} expects a sequence but received ${z(r)}`);return i},Ni=(e,t,n)=>{let r=V(e,t,n);if(!P(r))throw wi(n,`${n} expects a function but received ${z(r)}`);return Nr(r)},Pi=(e,t,n)=>{let r=e[t];if(r===void 0||!Ti(r))throw wi(n,`${n} expects an operator as argument ${t+1}`);return r},Fi=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),H=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),Ii=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),Li=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Ri=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(V(n,0,e),V(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),zi=e=>e>2147483647||e<-2147483648,Bi=e=>new S(`Overflow when computing ${e}`),Vi={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`},Hi={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ui={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`},Wi={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},Gi=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Hi[e.operator];if(e.kind!==`Function`)return Vi[e.kind];let t=Kt(e);return t===void 0?`FcnRcdValue`:Wi[t]},Ki=e=>Ui[Gi(e)],qi=(e,t)=>new y(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Ji=(e,t)=>{let n=n=>(...r)=>{let i=Er.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof y&&(e.isLazy===!0||!(n instanceof S))?(Er.sets&&(Er.sets.length=i),qi(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},Yi=(e,t)=>{if(typeof e!=`number`)throw qi(t,`Cannot cast tlc2.value.impl.${Gi(e)} to tlc2.value.impl.IntValue`);return e},Xi=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Zi=(e,t,n,r)=>{let i=Xi(e,n,`IntValue`,2);return Ri(t,(e,n)=>{let a=Yi(e,i),o=Yi(n,i),s=r(a,o);if(zi(s))throw Bi(`${a}${t}${o}`);return s})},Qi=(e,t,n)=>{if(typeof e!=`number`)throw new S(`The ${t} argument of ${n} should be an integer, but instead it is:\n${z(e)}`);return e},$i=(e,t,n=e)=>Ri(e,(e,r)=>t(Qi(e,`first`,n),Qi(r,`second`,n))),ea=(e,t,n)=>({...Li(e,t,n),isLazy:!0}),ta=(e,t,n)=>{let r=Pi(e,t,n);return()=>r.call([])},na=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`]),ra=()=>({bool:Cl,condition:(e,t)=>{if(typeof e!=`boolean`)throw ll(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw ul(t,n,e);return e},apply:Br,expectFunction:bl,tuple:$n,set:Rn,record:tn,writtenRecord:vt,equal:nn,enumerate:Pl,unassigned:(e,t)=>{throw Pd(e,t)},primeOutsideAction:e=>{throw Id(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:xl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>vl(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),ia={value:void 0},aa=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),oa=e=>`local${e.counter++}`,sa=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),Si(e).forEach(e=>sa(e,t)),t),ca=(e,t,n)=>{let r=aa(e,Zu(t,e.environment)),i=sa(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=aa(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},la=(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(()=>oa(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${pa(e,t.set,s)}, ${aa(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=oa(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${pa(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=oa(e),a=oa(e),o=oa(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})`},ua=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${pa(e,r[0],n)}, "the left side of =>") ? bool(${pa(e,r[1],n)}, "the right side of =>") : true)`;if(B(t))return ca(e,t,n);let i=ou(t.operator,e.environment);if(i?.kind!==`Builtin`)return ca(e,t,n);if(i.name===`DOMAIN`)return`${aa(e,pl(t))}(${pa(e,r[0],n)})`;if(i.name===`TLCEval`)return ca(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${aa(e,ml(t,i))}(${pa(e,r[0],n)}, ${pa(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&id(r[0],a))return`${aa(e,i.evaluateUnary)}(${pa(e,r[0],n)})`;let o=r.length===2&&id(r[0],a)&&id(r[1],a);return i.evaluateBinary&&o?`${aa(e,i.evaluateBinary)}(${pa(e,r[0],n)}, ${pa(e,r[1],n)})`:ca(e,t,n)},da=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(B(e))return!1;let r=gu(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return da(e.expression,t,n);case`FieldAccess`:return da(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>da(e,t,n));default:return!1}},fa=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return fa(e.record);case`FunctionApplication`:return[e.function,...e.args].every(fa);default:return!1}},pa=(e,t,n)=>{let r=(t,r=n)=>pa(e,t,r);if(Hu(t)&&Lu(t,e.environment))return ca(e,t,n);switch(t.kind){case`Number`:return wu(t.value)?String(t.value):ca(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(B(t))return ca(e,t,n);let i=gu(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=aa(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?aa(e,i.value):ca(e,t,n)}case`Apply`:return ua(e,t,n);case`And`:case`Or`:{let n=aa(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)}, ${aa(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{Od(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${da(t.function,n,e.environment)?r(t.function):fa(t.function)?r(t.function,i):ca(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${aa(e,t)}))`,o=fl(e.environment.runtime.version),s=o?`, ${aa(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`${aa(e,dl(t))}(${r(t.record)})`;case`Record`:{let i=Md(t.fields);if(Nd(i))return ca(e,t,n);let a=aa(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}, ${aa(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=aa(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`)?la(e,t,n):ca(e,t,n);default:return ca(e,t,n)}},ma=(e,t)=>{if(!na.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=pa(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
29
- `)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;ia.value??=ra();let o=ia.value,s=Object.keys(o);return Function(...s,...i,a)(...Object.values(o),...n.references)},ha={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},ga={none:0,error:1,warning:3,state:4},_a={0:``,1:`Error: `,3:`Warning: `,4:`State `},va=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===ga.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
30
- (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${_a[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},ya=`The configuration file did not specify the initial state predicate.
22
+ `);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=We.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=D(e,n.index)??T(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},Ke=(e,t)=>new x(`TLC found an error in the configuration file at line ${e}\n${t}`),qe=(e,t)=>Ke(e,`The keyword ${t} appeared twice.`),Je=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),Ye=/* @__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`]]),Xe=(e,t=`master`)=>{let n=t===`1.7.4`?Ue:Ve,r=Ge(e),i={index:0},a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new x(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw Ke(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw Ke(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw Ke(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw Ke(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw Ke(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw Ke(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw Ke(e,``);r.token=c()}if(r.token.text!==`=`)throw Ke(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?Je.get(e):void 0,i=n.has(e)?Ye.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw Ke(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 qe(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Ke(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw qe(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!He.includes(e))throw Ke(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw qe(t,e);s.add(e),p.token=c()}}return a},Ze={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:` `}},Qe=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},$e=e=>e!==void 0&&/^\p{Nd}$/u.test(e),et=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),tt=e=>{let t=t=>{let n=ue(e,t,Qe);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=ue(e,t,$e);if(e.startsWith(`..`,n)&&$e(e[n+2]))return{kind:`Constant`,first:t,last:ue(e,n+2,$e)-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=$e(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:ue(e,t+1,$e)-1,children:[]};if(et(n))return{kind:`Constant`,first:t,last:ue(e,t,et)-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)},nt=e=>{let t=e.length===0?void 0:tt(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=Ze[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},M=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,rt=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),N=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),P=e=>typeof e==`object`&&e.kind===`ModelValue`,it=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:M(e)?`set`:`function`,at=e=>{if(!Number.isInteger(e)||e>2147483647||e<-2147483648)throw new f(`Integer overflow: ${e} is outside TLC's 32-bit range`);return e},ot={isUsed:!1},st=(e,t)=>(ot.isUsed=!0,e.writtenKeys=t,e),ct=e=>(e.writtenKeys??e.domain).map(t=>[t,e.range[mr(e.domain,t)]]),lt=(e,t,n)=>st(Kt(e,t),n),ut=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(ut);e.writtenKeys=void 0,e.range.forEach(ut)}},dt=e=>e.every(e=>typeof e==`string`),ft=(e,t)=>e.length>0&&t.length>0&&dt(e)!==dt(t),pt=(e,t)=>{ot.isUsed&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return ft(n,r)?mn(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=At(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:At(t,n);if(r!==0)return r}return 0},mt=(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=At(n[e],r[e]);if(t!==0)return t}return 0},ht=e=>P(e)?e.type:void 0,gt=(e,t,n)=>{let r=ht(e),i=ht(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(P(e)&&P(t)){if(r===void 0||i===void 0||r===i)return;throw new _(`Attempted to ${a} the differently-typed model values ${R(e)} and ${R(t)}`)}throw r===void 0?new _(`Attempted to ${a} the typed model value ${R(t)} and the non-model value\n${R(e)}`):new _(`Attempted to ${a}${n?``:` the`} typed model value ${R(e)} and non-model value\n${R(t)}`)},_t={ranks:Object.create(null),size:0},vt=e=>{_t.ranks=Object.create(null),_t.size=0,jt.clear();for(let t of e)xt(t)},yt={is174:!1},bt=e=>{yt.is174=e===`1.7.4`},xt=e=>(_t.ranks[e]===void 0&&(_t.ranks[e]=_t.size++),e),St=()=>_t.size,Ct=e=>_t.ranks[xt(e)],wt=(e,t)=>{if(e===t)return 0;let n=_t.ranks,r=n[e],i=n[t];return r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Tt=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Et=(e,t)=>(Tt(e)||Tt(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Dt=(e,t,n)=>{if(!Tt(e))throw new _(`Attempted to ${n} the set ${R(F(e)?I(e):e,!0)} with the value:\n${R(t,!0)}`);if(!Tt(t))throw new _(`Attempted to compare overridden value ${R(e,!0)} with non-overridden value:\n${R(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 _(`Attempted to compare ${R(e,!0)} with the value\n${R(t,!0)}`)},Ot={kind:`InfiniteSet`,name:`Any`},kt=e=>{throw new _(`Attempted to compare ANY with the value\n${R(e)}`)},At=(e,t)=>{if(e===t)return ot.isUsed&&ut(e),e===Ot?kt(e):0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return pt(e,t);if(n===`Set`&&r===`Set`)return mt(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&&gt(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return gt(e,t,!1),n===`ModelValue`?-1:1;if(e===Ot||t===Ot)return kt(e===Ot?t:e);if(M(e)&&M(t)&&Et(e,t))return Dt(e,t,`compare`);let i=M(e);if(i!==M(t))throw new _(`Attempted to compare ${it(e)} ${R(e)} with ${it(t)} ${R(t)}`);return i?mt(I(e),I(t)):pt(wr(e),wr(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return wt(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(gt(e,t,!1),P(e))return-1;if(P(t))return 1;throw new _(`Attempted to compare ${it(e)} ${R(e)} with ${it(t)} ${R(t)}`)},jt=/* @__PURE__ */ new Map,Mt=e=>{let t=jt.get(e);if(t)return t;let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Ct(e)};return jt.set(e,n),n},Nt=e=>({kind:`Set`,elements:e,hash:0,fingerprint:0,isFingerprinted:!1}),Pt=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,isFingerprinted:!1}),Ft={isPresent:!1},It=(e,t)=>(t===`lambda`&&(Ft.isPresent=!0),t!==void 0&&(e.functionClass=t),e),Lt=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Rt=e=>It(e,`lambda`),zt=/* @__PURE__ */ new WeakSet,Bt=/* @__PURE__ */ new WeakSet,Vt={isPresent:!1},Ht=e=>(Vt.isPresent=!0,e),Ut=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Wt=e=>{Vt.isPresent&&typeof e==`object`&&Ut.has(e.kind)&&Bt.add(e)},Gt=e=>{if((Ft.isPresent||Vt.isPresent)&&typeof e==`object`){if(e.kind===`Function`||e.kind===`Set`){if(e.isFingerprinted)return;e.isFingerprinted=!0}else{if(zt.has(e))return;zt.add(e)}e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Gt),e.range.forEach(Gt)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Gt):M(e)&&F(e)&&(Wt(e),I(e).elements.forEach(Gt))}},Kt=(e,t)=>It(Pt(e,t),`record`),qt=(e,t)=>{if(Wt(e),e===t)return ot.isUsed&&ut(e),e!==Ot||kt(e);if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&gt(e,t,!0),At(e,t)===0);if((e.kind===`Set`||e.kind===`Function`)&&(t.kind===`Set`||t.kind===`Function`)&&e.hash!==0&&t.hash!==0&&e.hash!==t.hash)return!1;if(e.kind===`Function`&&t.kind===`Function`)return pt(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return mt(e,t)===0;if(P(e)||P(t))return gt(e,t,!0),P(e)&&P(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return qt(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=L(e.domain),r=L(t.domain);if(n||r)return n===r;let i=L(e.range),a=L(t.range);return i||a?i===a:qt(e.domain,t.domain)&&qt(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(L(e))return L(t);if(L(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]&&qt(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return L(e)?L(t):!L(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>qt(e,t.factors[n]));let n=M(e)&&M(t)&&!(F(e)&&F(t));if(n&&Et(e,t))return Dt(e,t,`check equality of`)===0;if(n){if(!Tt(e)){let n=I(e);if(!Tt(t))return mt(n,I(t))===0}return ti(e)===ti(t)}return At(e,t)===0},Jt=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ti(n)===ti(r);return n},Yt=Jt(!1),Xt=Jt(!0),Zt=e=>{let t=e.length===0?1:e[0];return typeof t==`number`&&e.every((e,n)=>e===t+n)?t:void 0},Qt=e=>{if(!N(e))return;let t=wr(e);return{domain:t.domain,range:t.range,low:Zt(t.domain)}},$t=e=>{if(!N(e))return;let t=wr(e);return t.domain.every(e=>typeof e==`string`)?t:void 0},en=(e,t)=>{if(ht(e)!==void 0)throw new _(`Attempted to compare the typed model value ${R(e)} and the non-model value\n${R(t)}`);return 1},tn=(e,t)=>{if(ht(e)!==void 0)throw new _(`Attempted to check equality of the typed model value ${R(e)} and the non-model value\n${R(t)}`);return!1},nn=(e,t)=>{let n=ht(e);if(n===void 0)return P(t)?e.rank-t.rank:-1;if(!P(t))throw new _(`Attempted to compare the typed model value ${R(e)} and non-model value\n${R(t)}`);let r=ht(t);if(r!==void 0&&r!==n)throw new _(`Attempted to compare the differently-typed model values ${R(e)} and ${R(t)}`);return e.rank-t.rank},rn=(e,t)=>{let n=ht(e);if(n===void 0)return P(t)&&e.name===t.name;if(!P(t))throw new _(`Attempted to check equality of typed model value ${R(e)} and non-model value\n${R(t)}`);let r=ht(t);if(r!==void 0&&r!==n)throw new _(`Attempted to check equality of the differently-typed model values ${R(e)} and ${R(t)}`);return e.name===t.name},an={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`}},on=(e,t,n)=>{let r=an[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${R(e)} with ${r.other}:\n${R(t)}`},sn=(e,t,n)=>{let r=Qt(n);if(!r){if(P(n))return en(n,t);throw new _(`Attempted to compare the function ${R(t)} with the value:\n${R(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>cn(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 cn(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 _(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${R(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},cn=(e,t)=>{for(let n=0;n<e.length;n++){let r=mn(e[n],t[n]);if(r!==0)return r}return 0},ln=(e,t)=>{let n=wr(e);if(e.kind===`Function`&&hr(n)!==void 0){let r=N(t)?hr(t):void 0;return r?n.range.length-r.length||cn(n.range,r):sn({...n,low:1},e,t)}if(Lt(e)===`record`){let r=$t(t);if(!r){if(P(t))return en(t,e);throw new _(`Attempted to compare record:\n${R(e)}\nwith non-record\n${R(t)}`)}return n.domain.length-r.domain.length||cn(n.domain,r.domain)||cn(n.range,r.range)}return sn({...n,low:Zt(n.domain)},e,t)},un=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),dn=(e,t)=>Tt(e)||Tt(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),fn=(e,t)=>{let n=un(t)?t:I(t);return{elements:I(e).elements,otherElements:I(n).elements}},pn=(e,t)=>{if(dn(e,t))return At(e,t);if(!un(e))return pn(I(e),t);if(!M(t)){if(P(t))return en(t,e);throw new _(`Attempted to compare the set ${R(e)} with the value:\n${R(t)}`)}let n=fn(e,t);return n.elements.length-n.otherElements.length||cn(n.elements,n.otherElements)},mn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return At(e,t);if(P(t))return en(t,e);throw new _(on(e,t,!1))}return e.kind===`ModelValue`?nn(e,t):N(e)?ln(e,t):pn(e,t)},hn=(e,t)=>e.every((e,n)=>yn(e,t[n])),gn=(e,t,n)=>{let r=Qt(n);if(!r){if(P(n))return tn(n,t);throw new _(`Attempted to check equality of the function ${R(t)} with the value:\n${R(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)&&hn(e.range,r.range);let i=e.low??r.low;return i===void 0?hn(e.domain,r.domain)&&hn(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new _(`Attempted to compare an integer with non-integer:\n${R(e)}.`);return e===i+t})&&hn(e.range,r.range)},_n=(e,t)=>{let n=wr(e);if(e.kind===`Function`&&hr(n)!==void 0){let r=N(t)?hr(t):void 0;return r?n.range.length===r.length&&hn(n.range,r):gn({...n,low:1},e,t)}if(Lt(e)===`record`){let r=$t(t);if(!r){if(P(t))return tn(t,e);throw new _(`Attempted to check equality of record:\n${R(e)}\nwith non-record\n${R(t)}`)}return n.domain.length===r.domain.length&&hn(n.domain,r.domain)&&hn(n.range,r.range)}return gn({...n,low:Zt(n.domain)},e,t)},vn=(e,t)=>{if(dn(e,t))return qt(e,t);if(!un(e))return vn(I(e),t);if(!M(t)){if(P(t))return tn(t,e);throw new _(`Attempted to check equality of the set ${R(e)} with the value:\n${R(t)}`)}let n=fn(e,t);return n.elements.length===n.otherElements.length&&hn(n.elements,n.otherElements)},yn=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(P(t))return tn(t,e);throw new _(on(e,t,!0))}return e.kind===`ModelValue`?rn(e,t):N(e)?_n(e,t):vn(e,t)},bn=e=>{let t=[];for(let n of e){let e=Sn(n,t);e.isFound||t.splice(e.index,0,n)}return t},xn=(e,t)=>{let n=_r.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Sn=(e,t)=>{let n={low:0,high:t.length};for(;n.low<n.high;){let r=n.low+(n.high-n.low>>1),i=xn(e,()=>mn(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}},Cn=(e,t)=>t.some(t=>xn(t,()=>yn(t,e))),wn=/* @__PURE__ */ new WeakSet,Tn=e=>{typeof e==`object`&&(e.kind===`Set`&&(wn.add(e),e.elements.forEach(Tn)),e.kind===`Function`&&(e.domain.forEach(Tn),e.range.forEach(Tn)))},En=(e,t)=>vr(qt,yn,e,t),Dn=e=>{for(let t=1;t<e.length;t++)if(At(e[t-1],e[t])>=0)return!1;return!0},On=e=>{for(let t=1;t<e.length;t++)Wt(e[t]);if(e.length<2||Dn(e))return Nt(e);let t=[...e].sort(At),n=[t[0]];for(let e=1;e<t.length;e++)At(n[n.length-1],t[e])!==0&&n.push(t[e]);return Nt(n)},kn=e=>vr(On,e=>({kind:`MixedSet`,elements:e}),e,void 0),An=Nt([]),jn=(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&&At(r[a],t)<0;)a++;a<r.length&&At(r[a],t)===0||i.push(t)}return i.length===n.length?e:Nt(i)},Mn=(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&&At(r[a],t)<0;)a++;a<r.length&&At(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Nt(i)},Nn=(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=At(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=Nt(i);if(e.hash!==0&&e.hash!==Vr){let t=e.hash,n=0;for(;n<a.length;n++){let e=Kr(a[n]);if(e===Vr)break;t=t+zr(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+Xr(a[e])|0;c.fingerprint=t}return c},Pn=e=>{let t=e.length<2?e:[...e].sort((e,t)=>At(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&At(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Pt(n,r)},Fn=e=>{let t=Pn(e);return t.domain.length!==e.length||e.some(e=>typeof e[0]!=`string`)||e.every((e,n)=>e[0]===t.domain[n])?t:st(t,e.map(e=>e[0]))},In=[],Ln=[],Rn=/* @__PURE__ */ new WeakMap,zn=e=>{let t=In[e];if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return In[e]=n,n},Bn=e=>{if(dr(e),e.low===1&&e.high>=1)return zn(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Vn=e=>e.length>0&&(e===In[e.length]||Rn.has(e)),Hn=e=>{let t=I(e).elements;return Vn(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Un=e=>{let t=Ln[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Ln[e]=n,n},Wn=e=>It(Pt(zn(e.length),e),`tuple`),Gn=e=>It(Pn(e),`record`),Kn=e=>M(e)&&!Tt(e),qn=(e,t=!1)=>`UNION(${R(e.base,t)})`,Jn=(e,t=e=>I(e).elements)=>{if(!Kn(e.base))throw new _(`Attempted to enumerate the nonenumerable set:\n${qn(e)}`);return t(e.base)},Yn=(e,t,n)=>{if(Kn(e))return e;throw new _(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${R(e)}\nwhen enumerating:\n${qn(n)}`)},F=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return F(e.base);case`FunctionSet`:return F(e.domain)&&F(e.range)||Xn(e.domain)===!0||Xn(e)===!0;case`RecordSet`:return e.sets.every(F)||Xn(e)===!0;case`ProductSet`:return e.factors.every(F)||Xn(e)===!0;case`Union`:return F(e.base)&&ir(e.base).every(F);case`SetOperation`:return e.operator===`\\cup`?F(e.left)&&F(e.right):e.operator===`\\cap`?F(e.left)||F(e.right):F(e.left);default:return!1}},Xn=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=Xn(e.domain);return t===void 0?void 0:!t&&Xn(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Xn(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return F(e)?I(e).elements.length===0:void 0;default:return}},Zn=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},Qn=(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},$n=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Tt(e.base))return;let t=I(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=[]:Qn(n.indices,t.length)||(n.indices=Array.from({length:n.indices.length+1},(e,t)=>t)),n.index++;return Nt(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)})},er=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Nt(r.map(t=>e[t])));while(Qn(r,e.length))}return t},tr=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Tt(a))throw new _(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},nr=(e,t=e=>I(e).elements)=>{if(typeof e!=`object`)throw new _(`Expected a set but found ${R(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return bn(e.elements);case`Interval`:{let t=Bn(e);return t!==In[t.length]&&Rn.set(t,e),t}case`Subset`:{if(dr(e.base)===0)return er([]);if(!M(e.base))throw new _(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${nt(R(e.base))}`);let t=I(e.base).elements;if(t.length>30)throw new _(ur(e));return er(t)}case`FunctionSet`:{if(!yt.is174&&L(e))return[];if(Tt(e.domain))throw new _(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${R(e.domain)}\ncannot be enumerated.`);let n=Hn(e.domain);if((n.length>0||yt.is174)&&Tt(e.range))throw new _(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${R(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return Zn(n.map(()=>r)).map(e=>Pt(n,e))}case`RecordSet`:{if(!yt.is174&&L(e))return[];let n=tr(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${R(t)}`);return Zn(n).map(t=>Gn(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!yt.is174&&L(e))return[];let n=tr(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${R(e)}`);return Zn(n).map(Wn)}case`FilteredSet`:if(!M(e.base)||Tt(e.base))throw new _(`Attempted to enumerate { x \\in S : p(x) } when S:\n${R(e.base)}\nis not enumerable`);return I(e.base).elements.filter(e.test);case`Union`:{let t=Jn(e).flatMap((t,n)=>I(Yn(t,n,e)).elements);return I(kn(t)).elements}case`SetOperation`:{if(e.operator===`\\cup`&&(!Kn(e.left)||!Kn(e.right)))throw new _(`Attempted to enumerate S \\cup T when S:\n${R(e.left)}\nand T:\n${R(e.right)}\nare not both enumerable`);if(e.operator===`\\cap`&&!Kn(e.left)&&!Kn(e.right))throw new _(`Attempted to enumerate S \\cap T when neither S:\n${R(e.left)}\nnor T:\n${R(e.right)}\nis enumerable`);if(e.operator===`\\`&&!Kn(e.left))throw new _(`Attempted to enumerate S \\ T when S:\n${R(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return Nn(I(e.left),I(e.right)).elements;let t=e.operator===`\\`||Kn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return I(n).elements.filter(t=>yr(t,r)===(e.operator===`\\cap`))}case`InfiniteSet`:case`SequenceSet`:throw new _(`Attempted to enumerate the non-enumerable set ${R(e)}`);default:throw new _(`Expected a set but found ${R(e)}`)}},rr=/* @__PURE__ */ new WeakMap,I=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Nt(nr(e));let t=typeof e==`object`?rr.get(e):void 0;if(t)return t;let n=_r.sets;n?.push(e);let r=nr(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`)?Nt(r):On(r);return typeof e==`object`&&rr.set(e,i),i},ir=e=>{if(typeof e!=`object`||Bt.has(e))return I(e).elements;let t=_r.sets;t?.push(e);let n=cr(e);return t?.pop(),n},ar=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,or=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(or);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(or)&&e.range.every(or);case`SetOperation`:return e.operator!==`\\cup`&&or(e.left)&&or(e.right);case`FilteredSet`:return or(e.base);case`ProductSet`:return e.factors.every(or);default:return!1}},sr=e=>typeof e!=`object`||Bt.has(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?sr(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||sr(e.left)||sr(e.right):ar(e)?.some(sr)??!1,cr=e=>{if(e.kind===`Union`)return Jn(e,ir).flatMap((t,n)=>ir(Yn(t,n,e)));if(e.kind===`FilteredSet`&&!Tt(e.base))return ir(e.base).filter(e.test);if(ar(e)?.some(sr))return nr(e,ir);if(e.kind!==`SetOperation`)return I(e).elements;if(e.operator===`\\cup`)return!Kn(e.left)||!Kn(e.right)?I(e).elements:[...ir(e.left),...ir(e.right)];let t=e.operator===`\\`||Kn(e.left),n=t?e.left:e.right,r=t?e.right:e.left;return Kn(n)?ir(n).filter(t=>yr(t,r)===(e.operator===`\\cap`)):I(e).elements},L=e=>{if(typeof e!=`object`||!M(e))throw new _(`Shouldn't call isEmpty() on value ${R(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new _(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(L);case`RecordSet`:return e.sets.some(L);case`FunctionSet`:return!L(e.domain)&&L(e.range);case`Union`:return Jn(e).every((t,n)=>L(Yn(t,n,e)));default:return I(e).elements.length===0}},lr=(e,t,n)=>e.reduce((e,r)=>{let i=e*dr(r,t);if(i>2147483647)throw new _(n());return i},1),ur=e=>`Overflow when computing the number of elements in:\n${R(e)}`,dr=(e,t)=>{if(typeof e!=`object`)throw new _(`Attempted to compute the number of elements in the ${typeof e==`number`?`integer`:typeof e==`string`?`string`:`boolean`} ${R(e)}.`);switch(e.kind){case`ModelValue`:throw new _(`Attempted to compute the number of elements in the model value ${R(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return dr(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new _(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new _(`Attempted to compute the number of elements in the overridden value ${R(e)}.`);case`Subset`:{let n=dr(e.base,t);if(n>=31)throw new _(ur(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(L(e.domain))return 1;if(L(e.range))return 0;if(dr(e.range,t)===1)return 1}let n=dr(e.domain,t),r=dr(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 _(ur(e));return i.value}case`RecordSet`:return t!==`1.7.4`&&L(e)?0:lr(e.sets,t,()=>ur(e));case`ProductSet`:return t!==`1.7.4`&&L(e)?0:lr(e.factors,t,()=>`Overflow when computing the number of elements in ${R(e)}`);default:return Wt(e),I(e).elements.length}},fr=e=>`Attempted to check if the set ${R(e)}is finite.`,pr=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new _(`Attempted to check if the ${it(e)} ${R(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new _(`Attempted to check if the function:\n${R(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return pr(e.base)&&L(e.base);case`Subset`:return pr(e.base);case`FunctionSet`:{let t=pr(e.domain);if(t&&L(e.domain))return!0;let n=pr(e.range);return n&&L(e.range)?!0:n&&(t||dr(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(!pr(e))n.isAllFinite=!1;else if(L(e))return!0;return n.isAllFinite}case`Union`:if(!Kn(e.base))throw new _(`Attempted to check if the nonenumerable set:\n${qn(e)}\nis a finite set.`);return I(e.base).elements.every(pr);case`SetOperation`:if(e.operator===`\\cup`)return pr(e.left)&&pr(e.right);if(e.operator===`\\cap`){if(!pr(e.left)&&!pr(e.right))throw new _(fr(e));return!0}if(pr(e.left))return!0;if(!pr(e.right))throw new _(fr(e));return!1;case`FilteredSet`:if(!pr(e.base))throw new _(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${R(e.base)}\nis finite.`);return!0}},mr=(e,t,n=At)=>{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},hr=e=>{if(typeof e!=`object`||!N(e))return;let t=wr(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},gr=(e,t)=>{let n=`Attempted to check if the value:\n${R(e)}\nis an element of the`;if(!N(t))return`${n} ${it(t)} ${R(t)}`;let r=Lt(t);return r===`record`?`Attempted to check if element:\n${R(e)}\nis in the record:\n${R(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${R(t)}`},_r={sets:void 0},vr=(e,t,n,r)=>{let i=_r.sets,a=_r.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof _))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)}},yr=(e,t)=>{let n=_r.sets;if(n===void 0)return Sr(e,t);n.push(t);let r=Sr(e,t);return n.pop(),r},br=(e,t)=>mr(t.elements,e)!==-1,xr=(e,t)=>wn.has(t)?Sn(e,t.elements).isFound:Cn(e,t.elements),Sr=(e,t)=>{if(!M(t))throw new _(gr(e,t));switch(t.kind){case`Set`:return Wt(e),vr(br,xr,e,t);case`MixedSet`:return Cn(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&!P(e))throw new _(`Attempted to check if the value:\n${R(e)}\nis in the integer interval ${R(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(P(e))return!1;if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new _(`Attempted to check if the value:\n${R(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!M(e)||Tt(e))throw new _(`Attempted to check if the non-enumerable value\n${nt(R(e))}\nis element of\n${nt(R(t))}`);return I(e).elements.every(e=>yr(e,t.base));case`FunctionSet`:{if(!N(e)){if(P(e))return!1;throw new _(`Attempted to check if \n${R(e)}\nwhich is not a TLC function value, is in the set of functions:\n${nt(R(t))}`)}let n=wr(e),r=Zt(n.domain);return(r===void 0?En(t.domain,Nt(n.domain)):En({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>yr(e,t.range))}case`RecordSet`:{let n=N(e)?wr(e):void 0;if(!n||!dt(n.domain)){if(P(e))return!1;throw new _(`Attempted to check if non-record\n${R(e)}\nis in the set of records:\n${R(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=mr(n.domain,e);return i!==-1&&yr(n.range[i],t.sets[r])})}case`ProductSet`:{let n=N(e)?hr(e):void 0;if(n===void 0){if(N(e)&&wr(e).domain.every(e=>typeof e==`number`)||P(e))return!1;throw new _(`Attempted to check if non-tuple\n${R(e)}\nis in the set of tuples:\n${R(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>yr(e,t.factors[n]))}case`FilteredSet`:return yr(e,t.base)&&t.test(e);case`Union`:if(!Kn(t.base))throw new _(`Attempted to check if:\n ${R(e)}\nis an element of the non-enumerable set:\n ${qn(t)}`);return I(t.base).elements.some(t=>yr(e,t));case`SetOperation`:return t.operator===`\\cup`?yr(e,t.left)||yr(e,t.right):yr(e,t.left)&&yr(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=hr(e);if(n===void 0){if(P(e))return!1;throw new _(`Attempted to check if the value:\n${nt(R(e))}\nis an element of ${nt(R(t))}.`)}return n.every(e=>yr(e,t.base))}default:throw new _(gr(e,t))}},Cr=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?yr(e,n):e.range.every((e,r)=>Cr(e,t.range[r],n.range)),wr=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){F(e.domain)||dr(e.domain);let t=Hn(e.domain);return It(Pt(t,t.map(t=>e.apply(t))),Lt(e))}throw new _(`Expected a function but found ${R(e)}`)},Tr=(e,t,n)=>{let r=nt(R(e)),i=nt(R(t)),a=n===`1.7.4`;switch(Lt(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.`}},Er=(e,t)=>{if(!yt.is174)return Tr(e,t);let n=nt(R(t));return Lt(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Dr=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Or=e=>new _(`Attempted to apply function with integer domain to the non-integer argument ${nt(R(e))}`),kr=(e,t,n)=>{throw yt.is174||e.length<32?e.forEach(e=>yn(e,t)):mr(e,t,mn),n},Ar=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Lt(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new _(n(e,t));if(a===void 0&&!yt.is174&&Vn(r))throw Or(t)}let i=Dr(r,t);return i===-1?vr(mr,kr,r,t):i},jr=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(!yr(t,e.domain))throw new _(Lt(e)===`lambda`?Tr(e,t):`Attempted to apply a function to ${R(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new _(`Attempted to apply ${R(e)}, which is not a function`);let r=n??Tr,i=Ar(e,t,r);if(i===-1)throw new _(r(e,t));return e.range[i]},Mr=e=>Vn(e)?Rn.get(e)??Un(e.length):void 0,Nr=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=wr(e).domain;return Mr(t)??Nt(t)},Pr=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||!F(e.domain))){if(!yr(t,e.domain))return e;let r=n(e.apply(t));return It({kind:`LazyFunction`,domain:e.domain,apply:n=>En(t,n)?r:e.apply(n),source:e.source},Lt(e))}if(!N(e))throw new _(`Attempted to apply EXCEPT construct to the value ${nt(R(e))}.`);let i=wr(e),a=Ar(i,t,Er);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=It(Pt(i.domain,o),Lt(i));if(l.writtenKeys=i.writtenKeys,i.hash!==0&&i.hash!==Vr){let e=Kr(c);if(e!==Vr){let t=Kr(i.domain[a]);l.hash=s===c?i.hash:i.hash-Br(t,Kr(s))+Br(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Zr(e,s)+Zr(e,c)|0}return l},Fr=/* @__PURE__ */ new WeakMap,Ir=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Lr=(e,t)=>Math.imul(e^t,16777619),Rr=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Ir(t)},zr=e=>Ir(e+2654435769|0),Br=(e,t)=>Ir(Math.imul(e,668265261)+t|0),Vr=795548749,Hr=e=>{if(e.kind===`ModelValue`)return Ir(Lr(Rr(e.name),109));if(M(e)){if(!F(e))return Vr;let t=I(e).elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Kr(t[e]);if(r===Vr)return Vr;n=n+zr(r)|0}return n}if(e.kind===`LazyFunction`&&!F(e.domain))return Vr;let t=wr(e),n=1725019383;for(let e=0;e<t.domain.length;e++){let r=Kr(t.domain[e]),i=Kr(t.range[e]);if(r===Vr||i===Vr)return Vr;n=n+Br(r,i)|0}return n},Ur=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new _(`TLC has found a state in which the value of a variable contains ${R(e)}`);if(M(e)){I(e).elements.forEach(Ur);return}let t=wr(e);t.domain.forEach(Ur),t.range.forEach(Ur)},Wr=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Kr(e)===Vr&&Ur(e);return}catch(e){if(!(e instanceof _))throw e;return e}},Gr=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Kr=e=>{if(typeof e==`number`)return Ir(e^1540483477);if(typeof e==`boolean`)return e?729683222:682545830;if(typeof e==`string`)return Rr(e);if(e.kind===`Set`||e.kind===`Function`)return e.hash===0&&(e.hash=Hr(e)),e.hash;let t=Fr.get(e);if(t!==void 0)return t;let n=Hr(e);return Fr.set(e,n),n},qr=/* @__PURE__ */ new WeakMap,Jr=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Yr=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Jr(t)},Xr=e=>Jr($r(e)+2135587861|0),Zr=(e,t)=>Jr(Math.imul($r(e),374761393)+$r(t)|0),Qr=e=>{if(e.kind===`ModelValue`)return Jr(Yr(e.name)^60);if(M(e)){if(!F(e))return Yr(ti(e));let t=I(e).elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Xr(t[e])|0;return n}let t=wr(e),n=1291169091;for(let e=0;e<t.domain.length;e++)n=n+Zr(t.domain[e],t.range[e])|0;return n},$r=e=>{if(typeof e==`number`)return Jr(e^1759714724);if(typeof e==`boolean`)return e?1000000007:521288629;if(typeof e==`string`)return Yr(e);if(e.kind===`Set`||e.kind===`Function`)return e.fingerprint===0&&(e.fingerprint=Qr(e)),e.fingerprint;let t=qr.get(e);if(t!==void 0)return t;let n=Qr(e);return qr.set(e,n),n},ei=/* @__PURE__ */ new WeakMap,ti=e=>{if(typeof e==`boolean`)return e?`T`:`F`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return JSON.stringify(e);let t=ei.get(e);if(t!==void 0)return t;let n=ni(e);return ei.set(e,n),n},ni=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ti(e.base)}>`;if(e.kind===`FilteredSet`&&!F(e))throw new _(`Attempted to compare the non-enumerable set ${R(e)} with another value`);if(M(e))return F(e)?`{${I(e).elements.map(ti).join(`,`)}}`:`<${e.kind} ${R(e)}>`;let t=wr(e);return`(${t.domain.map((e,n)=>`${ti(e)}:${ti(t.range[n])}`).join(`,`)})`},ri=e=>`"${e.replace(/\\/g,`\\\\`).replace(/"/g,`\\"`).replace(/\n/g,`\\n`).replace(/\t/g,`\\t`)}"`,ii=e=>e.reduce((e,t)=>e===0?0:e*dr(t),1),ai=e=>{if(e.kind===`Subset`)return dr(e.base)<=6?I(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return I(e);if(e.kind===`FunctionSet`&&F(e.domain)&&dr(e.domain)===0)return Nt([Pt([],[])]);let t=e.kind===`FunctionSet`?dr(e.range)**dr(e.domain):ii(e.kind===`RecordSet`?e.sets:e.factors);return t===0?An:t<=1999?I(e):void 0},oi=(e,t)=>{if(t)return ai(e);if(F(e))try{return ai(e)}catch(e){if(e instanceof _)return;throw e}},si=(e,t)=>{let n=e=>R(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return qn(e,t)}},ci=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),li=e=>{if(F(e.domain))try{return wr(e)}catch(e){if(e instanceof _)return;throw e}},R=(e,t=!1,n=!1)=>{let r=e=>R(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ri(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(I(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=oi(e,t);return n?r(n):si(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?li(e):e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${R(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&yt.is174&&Lt(e)!==`tuple`)return`<< >>`;let a=r=>R(r,t,n&&Lt(e)!==`lambda`);return i.domain.every((e,t)=>e===t+1)?`<<${i.range.map(a).join(`, `)}>>`:Lt(e)===`record`||i.domain.every(e=>typeof e==`string`&&ci(e))?`[${(n||i.hash!==0||i.fingerprint!==0?i.domain.map((e,t)=>[e,i.range[t]]):ct(i)).map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${i.domain.map((e,t)=>`${r(e)} :> ${a(i.range[t])}`).join(` @@ `)})`}}},ui=e=>{let t=Object.entries(e);return t.map(([e,n])=>`${t.length===1?``:`/\\ `}${e} = ${nt(R(n))}\n`).join(``)},di=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},fi=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Kr(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Xt(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Xt(i[e],n))return i[e]}return n.kind===`Set`?di(n.elements,t):(di(n.domain,t),di(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}},pi=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:[])}},z=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,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 _(t):new f(t),gi=e=>typeof e==`object`&&e.kind===`Operator`,B=(e,t,n)=>{let r=e[t];if(r===void 0||gi(r))throw hi(n,`${n} expects a value as argument ${t+1}`);return r},_i=(e,t,n)=>{let r=B(e,t,n);if(typeof r!=`number`)throw hi(n,`${n} expects an integer but received ${R(r)}`);return r},vi=(e,t,n)=>{let r=B(e,t,n);if(typeof r!=`boolean`)throw hi(n,`${n} expects a boolean but received ${R(r)}`);return r},yi=(e,t,n)=>{let r=B(e,t,n);if(!M(r))throw hi(n,`${n} expects a set but received ${R(r)}`);return r},bi=(e,t,n)=>{let r=yi(e,t,n);if(!F(r))throw hi(n,`${n} cannot enumerate the non-enumerable set ${R(r)}`);return r},xi=(e,t,n)=>I(bi(e,t,n)),Si=(e,t,n)=>xi(e,t,n).elements,Ci=(e,t,n)=>{let r=B(e,t,n),i=hr(r);if(!i)throw hi(n,`${n} expects a sequence but received ${R(r)}`);return i},wi=(e,t,n)=>{let r=B(e,t,n);if(!N(r))throw hi(n,`${n} expects a function but received ${R(r)}`);return wr(r)},Ti=(e,t,n)=>{let r=e[t];if(r===void 0||!gi(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}),V=(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(B(n,0,e),B(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ai=e=>e>2147483647||e<-2147483648,ji=e=>new f(`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=Lt(e);return t===void 0?`FcnRcdValue`:Fi[t]},Li=e=>Pi[Ii(e)],Ri=(e,t)=>new _(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),zi=(e,t)=>{let n=n=>(...r)=>{let i=_r.sets?.length??0;try{return n(...r)}catch(n){throw n instanceof _&&(e.isLazy===!0||!(n instanceof f))?(_r.sets&&(_r.sets.length=i),Ri(t,n.message)):n}};return{...e,evaluate:n(e.evaluate),evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(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,n)=>{if(typeof e!=`number`)throw new f(`The ${t} argument of ${n} should be an integer, but instead it is:\n${R(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:ml,condition:(e,t)=>{if(typeof e!=`boolean`)throw el(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw tl(t,n,e);return e},apply:jr,expectFunction:dl,tuple:Wn,set:kn,record:Kt,writtenRecord:lt,equal:qt,enumerate:Tl,unassigned:(e,t)=>{throw wd(e,t)},primeOutsideAction:e=>{throw Ed(e)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:fl,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>ll(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})}),Yi={value:void 0},Xi=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Zi=e=>`local${e.counter++}`,Qi=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),pi(e).forEach(e=>Qi(e,t)),t),$i=(e,t,n)=>{let r=Xi(e,Hu(t,e.environment)),i=Qi(t),a=[...n.locals].filter(([e])=>i.has(e));if(a.length===0)return`${r}(${n.context})`;let o=Xi(e,a.map(([e])=>e));return`${r}(extend(${n.context}, ${o}, [${a.map(([,e])=>e).join(`, `)}]))`},ea=(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(()=>Zi(e)),l=t.bounds.map((t,n)=>`const ${c[n]} = enumerate(${ia(e,t.set,s)}, ${Xi(e,t.set)}, ${JSON.stringify(e.environment.runtime.version)});`),u=t.bounds.map(t=>{let n=Zi(e);return t.pattern.kind===`Name`&&s.locals.set(t.pattern.name,n),n}),d=`if (bool(${ia(e,t.body,s)}, ${i}) !== ${r}) return ${!r};`,f=u.reduce((t,n,r)=>{let i=Zi(e),a=Zi(e),o=Zi(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})`},ta=(e,t,n)=>{let r=t.args;if(t.operator===`=>`)return`(bool(${ia(e,r[0],n)}, "the left side of =>") ? bool(${ia(e,r[1],n)}, "the right side of =>") : true)`;if(z(t))return $i(e,t,n);let i=Zl(t.operator,e.environment);if(i?.kind!==`Builtin`)return $i(e,t,n);if(i.name===`DOMAIN`)return`${Xi(e,il(t))}(${ia(e,r[0],n)})`;if(i.name===`TLCEval`)return $i(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Xi(e,al(t,i))}(${ia(e,r[0],n)}, ${ia(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&Yu(r[0],a))return`${Xi(e,i.evaluateUnary)}(${ia(e,r[0],n)})`;let o=r.length===2&&Yu(r[0],a)&&Yu(r[1],a);return i.evaluateBinary&&o?`${Xi(e,i.evaluateBinary)}(${ia(e,r[0],n)}, ${ia(e,r[1],n)})`:$i(e,t,n)},na=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(z(e))return!1;let r=su(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return na(e.expression,t,n);case`FieldAccess`:return na(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>na(e,t,n));default:return!1}},ra=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return ra(e.record);case`FunctionApplication`:return[e.function,...e.args].every(ra);default:return!1}},ia=(e,t,n)=>{let r=(t,r=n)=>ia(e,t,r);if(Nu(t)&&Ou(t,e.environment))return $i(e,t,n);switch(t.kind){case`Number`:return hu(t.value)?String(t.value):$i(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(z(t))return $i(e,t,n);let i=su(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Xi(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Xi(e,i.value):$i(e,t,n)}case`Apply`:return ta(e,t,n);case`And`:case`Or`:{let n=Xi(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)}, ${Xi(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{vd(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${na(t.function,n,e.environment)?r(t.function):ra(t.function)?r(t.function,i):$i(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Xi(e,t)}))`,o=rl(e.environment.runtime.version),s=o?`, ${Xi(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`${Xi(e,nl(t))}(${r(t.record)})`;case`Record`:{let i=Sd(t.fields);if(Cd(i))return $i(e,t,n);let a=Xi(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}, ${Xi(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=Xi(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`)?ea(e,t,n):$i(e,t,n);default:return $i(e,t,n)}},aa=(e,t)=>{if(!qi.has(e.kind))return;let n={environment:t,references:[],helpers:[],counter:0},r=ia(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(`
23
+ `)}\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)},oa={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},sa={none:0,error:1,warning:3,state:4},ca={0:``,1:`Error: `,3:`Warning: `,4:`State `},la=(e,t=!0,n=`master`)=>{let r=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,i,a)=>{let o=i===sa.warning;if(o&&!t)return;let s=o&&!e&&r.size===0?`
24
+ (Use the -nowarning option to disable this warning.)`:``,c=e?`@!@!@STARTMSG ${n}:${i} @!@!@\n${a}\n@!@!@ENDMSG ${n} @!@!@`:`${ca[i]}${a}${s}`;o&&r.has(c)||(o&&r.add(c),console.log(c))}}},ua=`The configuration file did not specify the initial state predicate.
31
25
  Can also be caused by trying to run TLC on a specification from
32
- a module imported with a parameterized INSTANCE statement.`,ba=[[1005,b,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
26
+ a module imported with a parameterized INSTANCE statement.`,da=[[1005,b,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
33
27
  %1%`,!0],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
34
28
  %1%,
35
29
  but it produced the following error:
@@ -52,7 +46,7 @@ element is not a bag:
52
46
  %5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
53
47
  on the right-hand side of a <- after already appearing on the
54
48
  left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
55
- is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,ya,!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:
49
+ 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,ua,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
56
50
  %1%`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
57
51
  %1%`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
58
52
  but instead found %3%.
@@ -70,14 +64,14 @@ The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configurat
70
64
  Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
71
65
  It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
72
66
  %1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
73
- `,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]],xa={value:void 0},Sa=()=>xa.value??=ba.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),Ca=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,wa=e=>Ca.test(e)?void 0:Sa().find(t=>t.pattern.test(e))?.message,Ta=e=>e instanceof S||wa(e.message)?.isEvalException===!0,Ea=/* @__PURE__ */ new Map([[1e3,`
67
+ `,!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]],fa={value:void 0},pa=()=>fa.value??=da.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),ma=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+ : ))/,ha=e=>ma.test(e)?void 0:pa().find(t=>t.pattern.test(e))?.message,ga=e=>e instanceof f||ha(e.message)?.isEvalException===!0,_a=/* @__PURE__ */ new Map([[1e3,`
74
68
  : `],[2105,`failed.
75
69
  `],[2154,`but it produced the following error:
76
70
  `],[2213,`:
77
- `],[2281,` - specifically: `]]),Da=(e,t,n)=>{let r=n?Ea.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)}${Oa(t.slice(a),n)}`},Oa=(e,t)=>{let n=t?wa(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${ga.none} @!@!@\n${Da(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ka=e=>String(e).padStart(2,`0`),Aa=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 ${ka(r%24)}h`:e>36e5?`${ka(r%24)}h ${ka(n)}min`:e>6e4?`${ka(n)}min ${ka(t)}s`:`${ka(t)}s`},ja=e=>`${e.getFullYear()}-${ka(e.getMonth()+1)}-${ka(e.getDate())} ${ka(e.getHours())}:${ka(e.getMinutes())}:${ka(e.getSeconds())}`,Ma={kind:`Local`},Na=/* @__PURE__ */ new WeakSet,Pa=/* @__PURE__ */ new WeakMap,Fa=/* @__PURE__ */ new WeakMap,Ia=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},La=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),Ra=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,za=e=>e.kind===`Operator`?e.params.length:0,Ba=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Va=e=>e.name.includes(`!`),Ha=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Ua=(e,t,n)=>{let r=t.bindings.get(e);return r&&Ra(r.position,t.location)&&(!n||Ra(r.position,n.start))?r:void 0},Wa=(e,t)=>e!==void 0&&t!==void 0&&g(e)===g(t),Ga=(e,t,n,r)=>{if(t===void 0)return!0;if(Wa(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=g(i),o=t.range&&g(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},Ka=(e,t,n,r)=>Ga(t,Ha(e,t)??Ua(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,qa=(e,t,n)=>{Ga(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Ja=(e,t,n,r)=>t.reduce((e,t,i)=>Ka(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ya=(e,t,n)=>t.reduce((e,t)=>Ka(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Xa=e=>e.kind===`Name`?[e.name]:e.names,Za=e=>e.flatMap(e=>Xa(e.pattern)),Qa=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||Ra(n.location,t.location))?n:void 0},$a=(e,t)=>{let n=Qa(e,t);return n?{key:t.getKey(n),arity:za(n),params:Ba(n),kind:`Definition`}:t.imported.get(e)},eo=(e,t,n)=>Ha(t,e)??$a(e,n),to=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),no=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:to(e.location,e.spelling??t)},ro=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return Ra(e.location,e.args[0].location)?`prefix`:`postfix`}},io=e=>!/^[\p{L}\d_]/u.test(e),ao=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),oo=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,so=(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])}})},co=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?so(e.name,[],void 0):so(e.operator,e.args,e.argumentCounts),lo=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),uo=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Za(e.bounds),body:e.body,sets:lo(e.bounds)};case`SetMap`:return{names:Za(e.bounds),body:e.expression,sets:lo(e.bounds)};case`SetFilter`:return{names:Xa(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Xa(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}},fo=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}},po=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,mo=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),ho=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?ho(e.body,t):Si(e).reduce((e,n)=>e??ho(n,t),void 0)},go=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??go(i,t,n||mo(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&ho(e.set,t):ho(e,t)},_o=e=>e.kind===`Label`?_o(e.body):e,vo=e=>typeof e==`number`?`argument selector ${e}`:e,yo=`within the scope of a declaration
78
- from outside that declaration's scope.`,bo=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:g(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&_o(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:go(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?ho(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&mo(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${yo}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=vo(n.operand);if(l.isSufficesOpen){if(oo(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=_o(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?eo(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=uo(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:fo(e);if(!c)return;let f=oo(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=oo(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(mo(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${yo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},xo=(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)},So=(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=Ha(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)},Co=(e,t,n,r)=>{if(!po(e))return!1;let i=co(e),a=i[0],o=i.length>1&&a.kind===`Name`?Ha(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&bo(e,i,o,t,n,r),o!==void 0},wo=(e,t,n,r)=>{let i=e.location;if(Po(e,n,r))return;let a=Fa.get(e);if(a!==void 0)return a;if(Ia(t))return e.kind===`Apply`?e.args.length:0;let o=Ha(n,t);if(o?.isNonFact){r.errors.push({location:g(no(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Co(e,n,r,!1)||ao(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Ma),o)return o.arity;let s=$a(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Fa.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(Ha(n,c)!==void 0||$a(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=g(e.kind===`Apply`&&l===`-.`?to(i,`-`):no(e,t));if(!io(t)||ao(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=ro(e);d&&i.range&&r.errors.push({location:g(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},To=(e,t,n)=>(e.forEach(e=>U(e.set,t,n)),e.reduce((e,t)=>Ja(e,Xa(t.pattern),t.pattern.ranges,n),t)),Eo=(e,t)=>e.kind===`Identifier`&&e.name===t&&B(e)||Si(e).some(e=>Eo(e,t)),Do=(e,t)=>{e.kind===`FunctionConstruction`&&Eo(e.body,t)&&(e.isRecursive=!0),Si(e).forEach(e=>Do(e,t))},Oo=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Za(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`?To(e.bounds,t,i):Ya(t,e.params,i),l=Ha(c,a)??Ua(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(U(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Do(e.body,a),e.isSelfReferential=Eo(e.body,a)):U(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:Ga(a,Ha(t,a)??Ua(a,i,o),{kind:`Definition`,arity:za(e),range:o},i)},ko=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Ha(e,t.name)?.isPending)return e;let n={name:t.name,arity:za(t),params:Ba(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)=>Bo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Ia(t.name)?e:s(e,e=>!Ra(t.location,e.location)),o={name:t.name,arity:za(t),kind:`Definition`,range:t.location.range,parent:a};if(Va(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Ia(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Oo(t,a,u,i)?{...o,params:Ba(t)}:a},a),()=>!0)},Ao=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Ha(t,r)??Ua(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},jo=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Ao(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:g(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Mo=(e,t,n)=>{if(jo(e,t,n))return;let r=e.operator,i=eo(r,t,n),a=wo(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:g(e.argumentsRange??no(e,r)),message:`The operator ${r} requires ${a-(Ao(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>No(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:g(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=wo(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else U(i,t,n);return!0}if(i.kind===`Lambda`){U(i,t,n);let o=i.params.length===c;return!o&&Na.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??no(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return U(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=eo(u,t,n)?.params??[],f=wo(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(no(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},No=(e,t,n)=>{e.kind===`Identifier`?wo(e,e.name,t,n):U(e,t,n)},Po=(e,t,n)=>{let r=Pa.get(e);return r?(r.args.forEach(e=>No(e,t,n)),n.errors.push(r.error),!0):!1},U=(e,t,n)=>{if(Na.has(e)&&!n.isGenerated){U(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>U(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(jo(e,t,n))return;let r=e.name,i=wo(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:g(no(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:wo(e,e.operator,t,n);return;case`Apply`:Mo(e,t,n);return;case`Lambda`:U(e.body,Ja(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:U(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&U(e.other,t,n);return;case`Let`:U(e.body,ko(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:U(e.body,To(e.bounds,t,n),i(Za(e.bounds)));return;case`UnboundedQuantifier`:U(e.body,Ja(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&U(e.set,t,n),U(e.body,Ja(t,Xa(e.pattern),e.pattern.ranges,n),i(Xa(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:U(e.predicate,To([e.bound],t,n),i(Xa(e.bound.pattern)));return;case`SetMap`:U(e.expression,To(e.bounds,t,n),i(Za(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??to(r.location,r.name)),message:`Non-unique fields in constructor.`}),U(r.value,t,n)});return;case`Except`:U(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),U(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:U(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(xo(e,n))return;U(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),So(e,t,n);return;case`Subexpression`:if(Po(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>No(e,t,n)),Co(e,t,n,!1)}},Fo=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||jo(e,t,n)||Co(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Ha(t,r)?.isNonFact?n.errors.push({location:g(no(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||U(e,t,n)}),Io=(e,t,n)=>(e.set&&U(e.set,t,n),Ka(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Lo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Io(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Lo(t,e.scope,e.unit,!0):U(t,e.scope,e.unit),e),{scope:t,unit:n});return U(e.conclusion,i.scope,i.unit),i.scope},Ro=(e,t,n)=>e.kind===`AssumeProve`?Lo(e,t,n):(U(e,t,n),t),zo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Fo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Vo(t,e,r),t)},Bo=(e,t,n)=>{let r=qo(e,t,n);return e.name===void 0?r:Ka(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Vo=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=Ro(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return zo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return zo(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Fo(r.facts,t,n),o(t);case`Instance`:return o(Bo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?Bo(t,e,i):ko([t],e,n),t));case`Have`:case`Case`:return U(r.expression,t,i),zo(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>U(e,t,i)),a(t);case`Take`:return a(Ja(To(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=Ja(To(r.bounds,t,i),r.names,r.nameRanges,i);return U(r.body,o,{...i,labelParams:[...i.labelParams,...Za(r.bounds),...r.names]}),zo(e.proof,a(t),n),a(o)}default:return zo(e.proof,a(t),n),a(t)}},Ho=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Ro(e.statement,void 0,t);e.name!==void 0&&qa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),zo(e.proof,n,t),r&&(r.isInProof=!1)},Uo={line:0,column:0},Wo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Go=(e,t)=>{let n=new Map([...La,...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},Ko=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){U(n,a,i);return}let r=wo(n,n.name,a,i);if(r!==void 0&&r!==t.arity)throw new u(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},s=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:g(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;o(r,a);let c=a.location.range;s.has(n)?c&&i.errors.push({location:g(c),message:`Multiple substitutions for symbol '${n}' in substitution.`}):s.set(n,a)});let c=t.filter(e=>!s.has(e.name)),l=e=>!Ha(a,e.name)&&!$a(e.name,i);return c.filter(e=>!l(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};o(t,n),s.set(t.name,n)}),c.filter(l).forEach(t=>{let r=e.location.range,a=t.location.range;r&&a&&i.errors.push({location:g(r),message:`Substitution missing for symbol ${t.name} declared at ${g(a)} \nand instantiated in module ${n}.`})}),s},qo=(e,t,n)=>{let r=n.getInstance(e);return Ko(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>Ka(e,t,r,n),t)},Jo=(e,t,n,r)=>{let i=Go(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Ko(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:Uo}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Yo=(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)=>Ra(e.location,t.location)?-1:+!!Ra(t.location,e.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof u)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},Xo=(e,t)=>{let n=Go(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...La,...t.bound].map(([e,t])=>[e,{...t,position:Uo}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>qa(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return Yo([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=Ga(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);Wo(e,t)?U(t.body,void 0,i):Oo(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:za(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);Ya(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>qa(t,e,i)),e.name!==void 0&&qa(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);U(e.expression,void 0,r),e.name!==void 0&&qa(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>Ho(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Fo(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:g(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Zo=/* @__PURE__ */ new WeakSet,Qo=/* @__PURE__ */ new WeakSet,$o=(e,t,n=/* @__PURE__ */ new Set)=>{let r=as(e,(e,r)=>$o(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&B(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&B(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},es=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),ts=/* @__PURE__ */ new WeakMap,ns=e=>ts.get(e)??e.name,rs=(e,t)=>(ns(t)!==e.name&&ts.set(e,ns(t)),e),is=(e,t)=>rs(e.kind===`Function`?{...e,bounds:es(e.bounds,e=>t(e,[])),body:t(e.body,Za(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),as=(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=>is(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:es(e.bounds,n),body:t(e.body,Za(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,Xa(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,Xa(e.bound.pattern))};case`SetMap`:return{...e,bounds:es(e.bounds,n),expression:t(e.expression,Za(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)}}},os=`LAMBDA`,ss=(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 as(e,(e,n)=>(r.push(...ss(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},cs=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}},ls=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),us=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ds=(e,t)=>e.map(e=>({pattern:us(e.pattern,t),set:e.set})),fs=(e,t)=>e.kind===`Function`?{...e,bounds:ds(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},ps=(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=>rs({...fs(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ds(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:us(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:us(e.bound.pattern,n),set:e.bound.set}};default:return e}},ms=e=>`${e}@ENABLED`,hs=(e,t)=>e.modes.get(t)??e,gs=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!B(e)&&t.instantiation.variables.has(e.name),_s=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>_s(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(gs(e,t,n))return[e.name];let r=B(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?_s(r.body,t,/* @__PURE__ */ new Map):void 0},vs=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return gs(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:ms(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Cs(e.expression,hs(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Cs(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Cs(e.subscript,hs(t,`Primed`),n),location:r},Cs(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=_s(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:ms(r),location:e.location},location:e.location},Cs({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},ys=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),bs=(e,t)=>e.map(e=>ys(e.name,t)),xs=(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:[...bs(t,r),...i.map(e=>ys(e,r))],location:r},location:r}},Ss=(e,t)=>e.instantiation.isParameterized(t)?Ts(e,t):void 0,Cs=(e,t,n)=>{let r=e=>Cs(e,t,n),i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!B(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Cs(e.expression,hs(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Cs(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},hs(t,`Enabled`),n)};let s=vs(e,t,n);if(s)return s;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name);if(n)return Zo.add(n),n;let r=Ss(t,e.name);if(r===void 0)return e;if(a.length===0)return{...e,name:r};let o=i.getDefinition(e.name);return o&&za(o)>0?xs(r,a,za(o),e.location):{kind:`Apply`,operator:r,args:bs(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),s=i.substitutions.size>0||a.length>0||Qo.has(e),c=e=>(s&&Qo.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return c({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return c({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:os,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:os,args:n,resolution:{kind:`Local`}},location:e.location};if(o)throw new u(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let l=Ss(t,e.operator);return l===void 0?c({...e,args:n}):{...e,operator:l,args:[...bs(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=Ss(t,e.operator);if(n===void 0)return e;let r=i.getDefinition(e.operator);return a.length>0&&r?xs(n,a,za(r),e.location):{...e,operator:n}}let c=cs(t),l=as(e,(e,i)=>i.length===0?r(e):Cs(e,t,ls(n,i,c)));return ps(l,n,c)},ws=(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:ys(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Ts=(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=cs(e),o=fs(is(i,(t,n)=>Cs(t,e,ls(/* @__PURE__ */ new Map,n,a))),a);return ws(o,r.params,i.location)}):t},Es=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>ss(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=>Ss(i,e)??e,getQualifiedKey:t=>{let n=Ss(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>ws(r,e.params,r.location)):t}}},Ds=e=>e.kind===`Let`&&e.instances!==void 0||Si(e).some(Ds),Os=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=as(e,e=>Os(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Ra(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}},ks=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,As=(e,t)=>e.definitions.some(e=>Ds(e.body))||e.assumptions.some(e=>Ds(e.expression))||e.theorems.some(e=>{let t=ks(e);return t!==void 0&&Ds(t)})?{...e,definitions:e.definitions.map(e=>is(e,e=>Os(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:Os(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=ks(e);return n===void 0?e:{...e,statement:Os(n,t,[])}})}:e,js=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=Er.sets,a=i??[],o=a.length;Er.sets=a;try{return n()}catch(e){throw Ju(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,Er.sets=i}},Ms=(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},Ns=e=>!e.includes(void 0),Ps=e=>e.variables.map(()=>void 0),Fs=(e,t,n)=>{let r=[...e];return r[t]=n,r},Is=(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}},Ls=e=>e.kind===`Identifier`?e.name:void 0,Rs=(e,t,n)=>{if(t.kind===`Label`)return Rs(e,t.body,n);let r=Ls(t);if(r===void 0)return;let i=_l(n,r);if(i?.kind===`Thunk`)return Rs(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=ou(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?Rs(e,o.body,o.scope):void 0},zs=(e,t,n)=>{if(t.kind===`Prime`)return Rs(e,t.expression,n);if(t.kind===`Label`)return zs(e,t.body,n);let r=Ls(t);if(r===void 0)return;let i=_l(n,r);if(i?.kind===`Thunk`)return zs(e,i.expression,i.scope);if(i)return;let a=ou(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?zs(e,a.body,a.scope):void 0},Bs=e=>{if(typeof e!=`boolean`)throw new y(`TLC expected a boolean expression.`);return e},Vs=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Hs=(e,t,n)=>{t===void 0?Ns(n)&&e.onState(n):Ns(n)&&Vs(e)?Ws(e,t,n):t.kind===`Predicate`?Gs(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?ec(e,t.expression,t.rest,t.scope,n):Us(e,t,n)&&Hs(e,t.rest,n)},Us=(e,t,n)=>{let r=e.environment,i=W(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return W(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Fd(t,r.runtime.version):t}})();return!nn(i,a)},Ws=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){ec(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Us(e,r,n):!Bs(W(r.expression,Ms(e,r.scope,n))))return}e.onState(n)},Gs=(e,t,n,r,i)=>js(e,t,()=>{switch(t.kind){case`Let`:Gs(e,t.body,n,Su(t.definitions,Ms(e,r,i)),i);return;case`Label`:Gs(e,t.body,n,r,i);return;default:if(Qs.has(t.kind))throw new y(`The state relation is not a boolean expression.`);js(e,t,()=>$s(e,t,n,r,i))}}),Ks=(e,t,n,r)=>{Bs(t)&&Hs(e,n,r)},qs=(e,t,n,r,i)=>{let a=Ms(e,r,i);if(t.kind===`Identifier`){let o=_l(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Gs(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Gs(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:ou(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&Ol(s,e.environment))){Gs(e,c.body,n,c.scope,i);return}Ks(e,W(t,a),n,i);return}let o=cu(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Gs(e,o.body,n,bu(o,t.args,a),i):Ks(e,W(t,a),n,i)},Js=(e,t,n,r,i)=>{let a=n[r];a===void 0?Hs(e,t,Fs(n,r,i)):nn(a,i)&&Hs(e,t,n)},Ys=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Xs=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?Rs(e,a,r):zs(e,a,r),c=Ms(e,r,i);if(s===void 0){W(t,c)===!0&&Hs(e,n,i);return}let l=W(o,c),u=i[s];if(t.operator===`=`){Js(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)W(t,c)===!0&&Hs(e,n,i);else{if(!tr(d))throw new y(`The right side of \\IN is not enumerable.`);for(let t of pr(d))Hs(e,n,Fs(i,s,t))}},Zs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Qs=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),$s=(e,t,n,r,i)=>{let a=Ms(e,r,i);switch(t.kind){case`Identifier`:qs(e,t,n,r,i);return;case`Apply`:if(Zs.has(t.operator)&&t.args.length===2){Xs(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(Bs(W(t.args[0],a))){Gs(e,t.args[1],n,r,i);return}Hs(e,n,i);return}qs(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)=>Ys(`Predicate`,t,r,e),n);Gs(e,a[0],t,r,i);return}let o=a[a.length-1];Gs(e,Is(t,a.length-1),Ys(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Gs(e,t,n,r,i));return}Gs(e,Is(t,a.length-1),n,r,i),Gs(e,a[a.length-1],n,r,i);return}case`Exists`:zl(t.bounds,a,r=>(Gs(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(zl(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Hs(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Ys(`Predicate`,t.body,n,e),n);Gs(e,t.body,o,r[0],i);return}case`If`:Gs(e,Bs(W(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>Bs(W(e.condition,a)))?.body??t.other;if(o===void 0)throw new y(`TLC encountered a CASE with no conditions true.`);Gs(e,o,n,r,i);return}case`FunctionApplication`:{let r=Wl(W(t.function,e.isInit?a:xl(a)));if(r){Gs(e,r.body,n,Gl(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){ec(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Gs(e,t.action,n,r,i),ec(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Gs(e,t.action,Ys(`Changed`,t.subscript,r,n),r,i);return}}Ks(e,W(t,a),n,i)},ec=(e,t,n,r,i)=>js(e,t,()=>{let a=Rs(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&Js(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Hs(e,n,i);return}let s=o.reduceRight((e,t)=>Ys(`Unchanged`,t,r,e),n);ec(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=_l(r,t.name);if(a?.kind===`Thunk`){ec(e,a.expression,n,a.scope,i);return}let o=a?void 0:ou(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){ec(e,o.body,n,o.scope,i);return}}let o=e.environment,s=W(t,{environment:o,scope:r,state:e.current,next:void 0}),c=W(t,{environment:o,scope:r,state:i,next:void 0});nn(s,c)&&Hs(e,n,i)}),tc=(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}},nc=/* @__PURE__ */ Error(`The replay found a successor`),rc=(e,t,n,r)=>{let i=tc(r,!1,n,()=>{throw nc},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Ys(`Changed`,e.subscript,t,void 0);Gs(i,e.action,n,t,Ps(r))}else Gs(i,e,void 0,t,Ps(r));return!1}catch(e){if(e!==nc)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},ic=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=tc(t,!0,void 0,n),o=i.reduceRight((e,t)=>Ys(`Predicate`,t.expression,t.scope,e),void 0);Gs(a,r.expression,o,r.scope,Ps(t))},ac=(e,t,n,r)=>{e.some(e=>Qs.has(e.expression.kind))||e.forEach(e=>{let i=[],a=tc(n,!1,t,e=>i.push(e));Gs(a,e.expression,void 0,e.scope,Ps(n)),i.forEach(t=>r(t,e))})},oc=/* @__PURE__ */ new WeakMap,sc=/* @__PURE__ */ new WeakMap,cc=(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},lc=(e,t,n)=>{let r=e.slice();return r[t]=n,r},uc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,dc=(t,r)=>{let i=new y(r);return t.isInit?i:n(i,e.error)},fc=(e,t,n,r)=>{let i=cl(n);return r&&Qs.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${uc(e)}, TLC expected a boolean expression,\nbut instead found ${z(t)}.\n${i}`},pc=(e,t,n)=>{let r=Ki(t),i=sl(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 ${uc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
79
- `:``}${i}`},mc=(e,t,n,r=!0)=>hc(e,t,W(t,n),r),hc=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw dc(e,fc(e,n,t,r))},gc=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=$u(n,r.environment))(r),_c=e=>e===`=`||e===`\\in`||e===`\\subseteq`,vc=(e,t,n)=>{let r=n?oc:sc,i=r.get(e);if(i)return i;let a=Gc(e,t,n);return r.set(e,a),a},yc=(e,t)=>{if(t.constants.has(e))return;let n=wl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},bc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return bc(e.expression,t,!1,r);if(e.kind!==`Identifier`||B(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=yc(e.name,t);if(a&&!r.has(a))return r.add(a),bc(a.body,t,n,r)},xc=(e,t,n)=>bc(e,t,!n),Sc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Sc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=Su(e.definitions,cc(r,t,n));return Sc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=_l(t,e.name);if(a?.kind===`Thunk`)return Sc(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=yc(e.name,r.environment);if(s)return Sc(s.body,void 0,n,r,i)},Cc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||B(e))||!t&&e.kind===`Prime`,wc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>wc(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=yc(e.name,t);if(i)return n.add(e.name),wc(i.body,t,n)},Tc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Ec=(e,t,n)=>Tc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||_c(e.operator)&&(Cc(e.args[0],n)||xc(e.args[0],t,n)!==void 0)||B(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Dc=/* @__PURE__ */ new Set,Oc=(e,t)=>{if(B(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return as(e,(e,i)=>{let a=r.isReadOnly?Oc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},kc=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||B(e)?void 0:wl(r,t);return i&&!n.has(i)&&(n.add(i),kc(i.body,t,n))?!0:Si(e).some(e=>kc(e,t,n))},Ac=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=xc(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=wc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return Ec(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:vc(e,t,n)}},jc=(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(Vd(e,t)===void 0||kc(e,t,/* @__PURE__ */ new Set))return!0;let n=Oc(e,Dc);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)}},Mc=(e,t,n)=>{let r=e.map(e=>Ac(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Vs(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Yc(u)){d??=cc(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=gc(a,e,n,d);if(!hc(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=cc(t,n,u);let r=gc(i,s,e.expression,d);if(!hc(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=cc(t,n,u);let r=gc(i,s,e.value,d),a=u[e.index];if(a===void 0)u=lc(u,e.index,r),d=void 0;else if(!nn(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=u[t];if(e===void 0)u=lc(u,t,n[t]),d=void 0;else if(!nn(e,n[t]))return}continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},Nc=e=>(t,n,r,i,a,o)=>{mc(t,e,cc(t,n,r))&&o(r,i)},Pc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=cc(r,i,a);if(a[l]!==void 0){mc(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!tr(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${uc(r)}, the right side of \\IN is not enumerable.`;throw dc(r,`${t}\n${sl(e)}`)}let p=pr(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(lc(a,l,p[e]),o)}},Fc=/* @__PURE__ */ new WeakMap,Ic=e=>{let t=Fc.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Ic),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Fc.set(e,n),n},Lc=(e,t)=>{let n=e.args[0],r=Nc(e),i=(e,r,i)=>Sc(n,r,i,e,!t)??-1,a=Pc(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],cc(t,n,o));l(lc(o,u,d),s)}},Rc=(e,t,n)=>{let r=sl(e);return(i,a,o,s,c,l)=>{let u=cc(i,a,o),d=W(e.function,n?u:xl(u)),f=Wl(d);if(f!==void 0){vc(f.body,t,n)(i,Gl(f,e,u),o,s,c,l);return}if(!P(d))throw dc(i,`In computing ${uc(i)}, a non-function (${Ki(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw dc(i,`In computing ${uc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},zc=(e,t)=>{if(wc(e,t))return Mc([Ic(e)],t,!1);if(e.kind===`Tuple`)return vc(Ic(e),t,!1);let n=Ic(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?_l(i,e.name):void 0;l?.kind===`Thunk`?vc(Ic(l.expression),t,!1)(r,l.scope,a,o,s,c):mc(r,n,cc(r,i,a))&&c(a,o)}},Bc=(e,t,n)=>{let r=e.operator,i=Nc(e),a=B(e)?void 0:ou(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=sd(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=vc(a.body,t,n),o.body(e,i(cc(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=cc(a,o,s),f=cu(e,d);f?.kind===`Closure`?vc(f.body,t,n)(a,bu(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Vc=(e,t,n)=>{let r=Nc(e),i=B(e)?void 0:yc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=_l(s,e.name);f?.kind===`Thunk`?vc(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=vc(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Hc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||B(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!B(a))return;let o=bc(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Hc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||B(e))return;let r=ou(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Hc(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(i&&o?.kind===`Identifier`&&B(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Uc=(e,t,n)=>{let r=_l(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},Wc=(e,t,n)=>{let r=e.map(e=>vc(e,t,n)),i=n?[]:e.map(e=>Hc(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Uc(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Gc=(e,t,n)=>{let r=e=>vc(e,t,n);switch(e.kind){case`And`:return Mc(e.operands,t,n);case`Or`:return Wc(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=Ml(W(a.set,cc(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,vl(r,e,u[t]),o,s,c,l)}}let o=n?void 0:jc(e,t);if(o){let r=Mc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=cc(n,i,a),d=e.bounds.map(e=>Ml(W(e.set,u),e.set,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=vl(t,o.names[e],r);if(e===d.length-1){let e=cc(n,i,a);if(!o.guards.every(t=>mc(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{zl(e.bounds,cc(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Vd(e,t)!==void 0&&!kc(e.body,t,/* @__PURE__ */ new Set)?Oc(e,Dc):void 0;return(t,n,r,o,s,c)=>{let l=[];zl(e.bounds,cc(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>_l(n,e)?.kind===`Value`)){u.every(n=>mc(t,e.body,cc(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Yc(r)?u.slice(n).every(n=>mc(t,e.body,cc(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,cc(r,i,a));if(typeof l!=`boolean`)throw dc(r,pc(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=cc(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw dc(r,`In computing ${uc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Ki(t)}) was used as a guard condition of a CASE.\n${cl(e.source)}`)})?.body??n;if(!u)throw dc(r,`In computing ${uc(r)}, TLC encountered a CASE with no conditions true.\n${sl(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=Nu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,Su(e.definitions,cc(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new y(`UNCHANGED appears in an initial predicate at ${al(e)}`)}:zc(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Ic(e.subscript),a=(e,n,r)=>{try{return mc(e,i,cc(e,n,r))}catch(n){throw e.isEnabled?Fd(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,Ic(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Vc(e,t,n);case`FunctionApplication`:return Rc(e,t,n);case`Apply`:{let i=e.args;if(_c(e.operator)){let r=xc(i[0],t,n);if(r!==void 0)return e.operator===`=`?Mc([e],t,n):Pc(e,()=>r);if(Cc(i[0],n))return Lc(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=W(i[0],cc(t,n,r));(typeof c==`boolean`?c:Cl(c,`the left side of => at ${al(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return Bc(e,t,n)}default:return Nc(e)}},Kc=/* @__PURE__ */ new WeakMap,qc=e=>{let t=Kc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Kc.set(e,n),n},Jc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Yc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Xc=(e,t)=>{let n=t.state;if(!n||!Yc(n))throw new y(`ENABLED needs a complete state at ${al(e)}`);let r=t.environment;if(r.callStack)return rc(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return vc(e,r,!1)(i,t.scope,qc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Zc=(t,r,i,a)=>{let o={environment:r,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};vc(t,r,!0)(o,a,qc(r),void 0,!1,t=>{if(!o.isStopped){if(!Yc(t))throw n(new ne([...t]),e.error);o.isStopped=i(t)}})},Qc=(e,t,n)=>{let r=[];return Zc(e,t,e=>(r.push(e),!1),n),r},$c=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return vc(e,n,!1)(a,i,qc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Yc(e)){let r=Jc(e,n);throw new ee(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},el=(e,t,n,r)=>{let i=[];return $c(e,t,n,e=>(i.push(e),!1),r),i},tl=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),nl=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),rl=e=>nl.has(e.kind)||e.kind===`Apply`&&tl.has(e.operator),il=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&ft(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},al=e=>`line ${e.location.line}, column ${e.location.column}`,ol=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,sl=e=>{let t=e.location.range;return t?ol(t):al(e)},cl=e=>e.kind===`Number`?e.text??String(e.value):sl(e),ll=(e,t)=>new y(`A non-boolean expression (${Ki(t)}) was used as the condition of an IF.\n${sl(e)}`),ul=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new y(`A non-boolean expression (${Ki(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${cl(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new y(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Ki(n)}.\n${sl({...e,location:{...e.location,range:{...r,end:i}}})}`)},dl=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${z(n)}\n${sl(e)}`,r=e=>`Attempted to apply function:\n${dt(z(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!P(i))throw new y(`Attempted to select field "${t}" from a non-record value ${dt(z(i))}\n${sl(e)}`);let a=Kt(i);if(a===`tuple`)throw Lr(t);return Br(i,t,a===`record`?n:r)}},fl=e=>e===`1.7.4`?(t,n)=>Pr(t,n,e):void 0,pl=e=>t=>{if(!P(t))throw new y(`Attempted to apply the operator DOMAIN to a non-function\n(${Ki(t)})\n${sl(e)}`);return Hr(t)},ml=(e,t)=>(n,r)=>{if(!N(n)||Pt(n))throw new y(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${sl(e)}`);return t.evaluate([n,r])},hl=t=>n(new y(`TLC can't handle real numbers: ${t.text} at ${al(t)}`),e.configParseError),gl=t=>n(new y(`TLC can't handle a number this big: ${t.text??t.value} at ${al(t)}`),e.error),_l=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},vl=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),yl=(e,t,n)=>{if(t.kind===`Name`)return vl(e,t.name,n);let r=wr(n);if(!r||r.length!==t.names.length)throw new y(`Cannot bind <<${t.names.join(`, `)}>> to ${z(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>vl(e,t,r[n]),e)},bl=(e,t)=>{if(P(e))return e;throw new y(`A non-function (${Ki(e)}) was applied as a function.\n${sl(t)}`)},xl=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Sl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),Cl=(e,t)=>{if(typeof e!=`boolean`)throw new y(`Expected ${t} to be a boolean but found ${z(e)}`);return e},wl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),Tl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),El=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),Dl=(e,t)=>{if(Tl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&El.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=wl(n,t);if(e&&!t.constants.has(n)&&!Ol(e,t))return!0}return Si(e).some(e=>Dl(e,t))},Ol=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!Dl(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>Dl(e.set,t)));return t.constantLevels.set(e,r),r},kl=(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.`},Al=(e,t,n)=>{if(!N(e)||Pt(e)){let r=z(e),i=n===`1.7.4`?void 0:kl(e,r);throw new y(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${cl(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${cl(t)}\n${i}`)}},jl=(e,t,n)=>(Al(e,t,n),typeof e==`object`&&e.kind===`Interval`?Yn(e):cr(e)??L(e).elements),Ml=(e,t,n)=>n===`1.7.4`?(Al(e,t,n),cr(e)??pr(e)):jl(e,t,n),Nl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return br(e),e},Pl=(e,t,n)=>Nl(e)??Ml(e,t,n),Fl=(e,t,n)=>Nl(e)??jl(e,t,n),Il=(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},Ll=(e,t)=>e.map(e=>Pl(W(e.set,t),e.set,t.environment.runtime.version)),Rl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Il(t[n],t=>i(n-1,yl(a,e[n].pattern,t)));return i(e.length-1,n)},zl=(e,t,n)=>Rl(e,Ll(e,t),t.scope,n),Bl=(e,t)=>{let n=e.map(e=>W(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Vl=(e,t,n)=>{if(e.length===1)return yl(t,e[0].pattern,n);let r=wr(n)??[];return e.reduce((e,t,n)=>yl(e,t.pattern,r[n]),t)},Hl=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Ul=e=>Object.assign(e.value,{lambda:e}),Wl=e=>Hl(e)?e.lambda:void 0,Gl=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:$n(i),o=(e,n,i)=>`In applying the function\n${dt(z(r))},\nthe ${e} is:\n${dt(z(n))}${i}.\n${sl(t.function)}`,s=e.bounds;if(s.length===1){if(!Or(a,r.domain))throw new y(o(`first argument`,a,`which is not in its domain`));return Vl(s,e.scope,a)}let c=wr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new y(`Attempted to apply a function to an argument not in its domain.\n${sl(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!Or(n,l[t]))throw new y(o(r,n,`${e.pattern.kind===`Name`?``:`
80
- `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&wr(n)?.length!==e.pattern.names.length)throw new y(o(r,n,`which does not match its formal parameter`))}),Vl(s,e.scope,$n(c.slice(0,s.length)))},Kl=/* @__PURE__ */ new WeakMap,ql=(e,t)=>{let n=Kl.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:ol(r)};return Kl.set(t,i),i},Jl=(e,t,n)=>{let r=ql(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Yl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=ti(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(an(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Xl=/* @__PURE__ */ new WeakMap,Zl=e=>{let t=Xl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Xl.set(e,n),n},Ql=(e,t)=>{let n=Bl(e.bounds,t),r=Yl(n,(n,r)=>W(e.body,Sl(t,Vl(e.bounds,vl(void 0,e.name,r),n))),Jl(e.bounds,e.body,n));return Ul({value:r,bounds:e.bounds,body:e.body,scope:vl(void 0,e.name,r)}),e.bounds.length===1?qt(r):r},$l=(e,t)=>{if(typeof t!=`object`||Kt(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!ft(t.domain))return t;try{let e=Nr(t);return Ut(e.domain,e.range)}catch(e){if(e instanceof y)return t;throw e}},eu=(e,t)=>e.kind===`Function`?e.isSelfReferential?Ql(e,t):W(Zl(e),t):W(e.body,t),tu=(e,t)=>{let n=Ol(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new y(`Operator ${e.name} requires ${e.params.length} arguments`);let i=Sl(t,void 0);if(!n)return eu(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>$l(e,eu(e,i)));return t.environment.definitionValues.set(e,a),a},nu=(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))&&Ol(e,t))try{Pn(tu(e,{environment:t,scope:void 0,state:void 0,next:void 0}))}catch(e){if(!(e instanceof y)&&!c(e))throw e}}),ru=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=W(e.expression,Sl(t,e.scope));return n&&(!e.isStreamed||hr(r))&&(e.cache=r),r},iu=/* @__PURE__ */ new WeakMap,au=e=>{let t=iu.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return iu.set(e,n),n},ou=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return ou(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?au(r):t.builtins.get(e)},su=/* @__PURE__ */ new WeakMap,cu=(e,t)=>{if(B(e))return lu(e.operator,t);let n=su.get(e),r=n===void 0?ou(e.operator,t.environment)??null:n;return n===void 0&&su.set(e,r),r??lu(e.operator,t)},lu=(e,t)=>{let n=_l(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return ou(e,t.environment)},uu=e=>e.kind===`Closure`?e.params.length:e.arity,du=(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:lu(n,t);if(!r)throw new y(`Expected an operator argument at ${al(e)}`);return r},fu=(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)=>vl(e,n.name,t[r]),e.scope);return W(e.body,Sl(n,r))},pu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:uu(e),call:n=>fu(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},mu=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=lu(e.name,t);return n!==void 0&&uu(n)>0},hu=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),gu=(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 gu(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([])}},_u=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&wu(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=B(e)?void 0:gu(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=_l(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:hu(e,t)}}return t=>hu(e,t)},vu=/* @__PURE__ */ new WeakMap,yu=(e,t)=>{let n=vu.get(e);if(n)return n;let r=_u(e,t);return vu.set(e,r),r},bu=(e,t,n)=>{if(t.length!==e.params.length)throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`);let r=e.scope;for(let i=0;i<t.length;i++){let a=e.params[i],o=a.arity>0?{kind:`Operator`,operator:du(t[i],n)}:yu(t[i],n.environment)(n);r={name:a.name,binding:o,parent:r}}return r},xu=(e,t,n)=>e.kind===`Closure`?W(e.body,Sl(n,bu(e,t,n))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(ad(t,n),n):e.evaluate(t.map(e=>mu(e,n)?pu(du(e,n),n):W(e,n)),n),Su=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),Cu=(e,t,n)=>{let r=_l(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return ru(r,n);if(r?.kind===`Operator`){if(uu(r.operator)===0)return fu(r.operator,[],n);throw new y(`Operator ${e} is used without arguments`)}let i=gu(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Pd(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return tu(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new y(`Unknown identifier ${e} at ${al(t)}`)},wu=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,Tu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Eu=(e,t)=>Tu.has(e)||t.builtins.get(e)?.isStateLevel===!0,Du={builtins:Tu,definitions:/* @__PURE__ */ new WeakMap},Ou={builtins:new Set([...Tu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},ku=(e,t)=>e.kind===`Operator`&&e.params.length===0&&Ol(e,t),Au=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!B(e)){let e=wl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!ku(e,t)&&ju(e,t,n))return!0}return Si(e).some(e=>Au(e,t,n))},ju=(e,t,n=Du)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=Au(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>Au(e.set,t,n));return n.definitions.set(e,i),i},Mu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},Nu=(e,t)=>({impure:new Set(e.filter(e=>ju(e,t))),streamed:new Set(e.filter(e=>ju(e,t,Mu)))}),Pu=e=>[...e.definitions.values()].some(t=>ju(t,e)),Fu=e=>[...e.definitions.values()].some(t=>ju(t,e,Ou)),Iu=/* @__PURE__ */ new WeakMap,Lu=(e,t)=>{let n=Iu.get(e);if(n!==void 0)return n;let r=Vu(e,t,zu);return Iu.set(e,r),r},Ru=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),zu=/* @__PURE__ */ new Set,Bu=(e,t,n)=>n.size===0?Lu(e,t):Vu(e,t,n),Vu=(e,t,n)=>{if(!Ru.has(e.kind))return!1;if(e.kind===`Identifier`&&B(e))return n.has(e.name);if(B(e))return!1;if(e.kind===`Identifier`){let n=gu(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&ku(n.definition,t)}if(e.kind===`Apply`){if(Eu(e.operator,t)||Mu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=ou(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=wl(e.operator,t);if(!n||!Ol(n,t)||ju(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&Bu(e,t,n))}let r={value:!0};return as(e,(e,i)=>(r.value&&=Bu(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Hu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Uu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Wu=(e,t)=>{if(e.kind===`Identifier`&&B(e))return!t.has(e.name);if(B(e))return!0;let n={value:!1};return as(e,(e,r)=>(n.value||=Wu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Gu=(e,t)=>Zo.has(e)&&Hu(e)&&Vd(e,t)!==void 0&&!Wu(e,zu),Ku=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,qu=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Er.sets,o=Er.callStack,s=a??[],c=s.length;Er.sets=s,Er.callStack=r;try{let a=t(i),o=Ku(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&rl(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=il(e,r.values),a=i&&!Si(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!P(a)?void 0:a;throw Ju(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Er.sets=a,Er.callStack=o}},Ju=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof y){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Yu=(e,t,n)=>{if(!(n instanceof y))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},Xu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Zu=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Rd(e,t),i=t.callStack,a=i?qu(e,r,t,i):Hu(e)&&Lu(e,t)?Uu(r):Gu(e,t)?nd(r):r;return t.evaluators.set(e,a),a},Qu=/* @__PURE__ */ new WeakMap,$u=(e,t)=>{if(t.callStack)return Zu(e,t);let n=Qu.get(e);if(n)return n;let r=(Hu(e)&&Lu(e,t)?void 0:ma(e,t))??Zu(e,t);return Qu.set(e,r),r},W=(e,t)=>$u(e,t.environment)(t),ed=(e,t)=>{let n=e.name,r=B(e)?void 0:gu(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Pd(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&Ol(e,t))return t=>tu(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=$u(e.body,t),n.body(Sl(r,void 0)));return td(e,t)?nd(r):r}return t=>tu(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>tu(e,t);return Ol(e,t)||!td(e,t)?n:nd(n)}return t=>Cu(n,e,t)},td=(e,t)=>Vd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>Vd(e.set,t)!==void 0)),nd=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},rd=(e,t)=>{let n=ou(e,t);return n!==void 0&&uu(n)>0},id=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!B(e)&&rd(e.name,t)),ad=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),od=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(ad(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&id(t[0],n)){let e=Zu(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&id(t[0],n)&&id(t[1],n);if(i&&a){let e=Zu(t[0],n),r=Zu(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>mu(e,n)?pu(du(e,n),n):W(e,n)),n)},sd=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new y(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:yu(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:du(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},cd=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),ld=/* @__PURE__ */ new WeakMap,ud=e=>{let t=ld.get(e);if(t)return t;let n={constant:cd(),state:cd()};return ld.set(e,n),n},dd=e=>e.kind===`ExceptAt`||Si(e).some(dd),fd=/* @__PURE__ */ new WeakMap,pd=(e,t)=>{let n=fd.get(e);if(n!==void 0)return n;let r=Vd(e,t)!==void 0&&Oc(e,zu),i=r&&[...new Set(dd(e)?[...r,`@`]:r)];return fd.set(e,i??!1),i??!1},md=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,hd={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},gd=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:ti(e),_d=e=>md(e)?(hd.sources[hd.sourceCount++]=void 0,hd.args[hd.argCount++]=e,hd.hash=Kr(hd.hash,gd(e)),!0):!1,vd=(e,t,n)=>{if(!t)return!1;hd.sources[hd.sourceCount++]=e,hd.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=_l(n,t[e]);if(r?.kind!==`Value`||!md(r.value))return!1;hd.args[hd.argCount++]=r.value,hd.hash=Kr(hd.hash,gd(r.value))}return!0},yd=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&wu(e.value))return()=>_d(e.value);if(e.kind===`Identifier`){let n=B(e)?void 0:gu(e.name,t);if(n?.kind===`Value`)return()=>_d(n.value);if(n===void 0)return n=>{let r=_l(n.scope,e.name);return r?.kind===`Value`?_d(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:vd(r.expression,pd(r.expression,t),r.scope)}}let n=pd(e,t);return t=>vd(e,n,t.scope)},bd=e=>{if(e.args.length!==hd.argCount||e.sources.length!==hd.sourceCount)return!1;for(let t=0;t<hd.sourceCount;t++)if(e.sources[t]!==hd.sources[t])return!1;for(let t=0;t<hd.argCount;t++)if(!an(e.args[t],hd.args[t]))return!1;return!0},xd=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(bd(e[t]))return e[t]}},Sd=(e,t)=>{let n=wl(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!ju(n,t))return Ol(n,t)?`constant`:td(n,t)?`state`:void 0},Cd=(e,t,n,r)=>{let i=sd(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=$u(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=ud(e),c=t.map(e=>yd(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);hd.sourceCount=0,hd.argCount=0,hd.hash=t.length,hd.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||hd.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=hd.hash&1073741823,d=a.calls.get(u),f=xd(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=hd.sources.slice(0,hd.sourceCount),m=hd.args.slice(0,hd.argCount),h=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:h};d?d.push(e):a.calls.set(u,[e])}return h}},wd=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Zu(n[0],t),r=Zu(n[1],t);return t=>!Cl(e(t),`the left side of =>`)||Cl(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new y(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=B(e)?void 0:ou(e.operator,t);if(r?.kind===`Closure`){let i=t.callStack?void 0:Sd(e,t);return Cd(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Zu(n[0],t),i=pl(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Zu(n[0],t);return Qo.has(e)||Dl(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=Zu(n[0],t),a=Zu(n[1],t),o=ml(e,r);return e=>o(i(e),a(e))}return r?.kind===`Builtin`?od(r,n,t):e.operator===`\\cdot`&&n.length===2?()=>{throw new y(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)}:r=>{let i=lu(e.operator,r);if(i)return xu(i,n,r);throw t.definitions.get(e.operator)?.kind===`Function`?new y(`${e.operator} is a function; apply it with brackets`):new y(`Unknown operator ${e.operator} at ${al(e)}`)}},Td=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Zu(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Zu(a.set,t);return s=>Il(Pl(o(s),a.set,t.runtime.version),t=>Cl(i(Sl(s,vl(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=>Zu(e.set,t));return s=>{let c=a.map((e,n)=>Pl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?Cl(i(Sl(s,a)),r)!==n:Il(c[t],n=>l(t-1,vl(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>zl(o,e,t=>Cl(i(Sl(e,t)),r)!==n)?!n:n},Ed=(e,t)=>{if(e.kind===`Tuple`)return $n(e.names.map(e=>{let n=_l(t,e);return n?.kind===`Value`&&n.value}));let n=_l(t,e.name);return n?.kind===`Value`?n.value:void 0},Dd=/* @__PURE__ */ new WeakSet,Od=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&Dd.add(e)},kd=(e,t)=>{let n=Dd.has(e),r=Zu(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Zu(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=Zn(e),o=Ut(i,i.map(e=>r(Sl(t,vl(t.scope,n,e)))));return ft(e)?o:qt(o)}let n=[],s=i.map(e=>Fl(W(e.set,t),e.set,t.environment.runtime.version));return Rl(i,s,t.scope,e=>{let o=i.length===1?Ed(a.pattern,e)??!1:$n(i.map(t=>Ed(t.pattern,e)??!1));return n.push([o,r(Sl(t,e))]),!1}),Un(n)},l=(t,n)=>{let a=Ul({value:Yl(t,e=>r(Sl(n,Vl(i,n.scope,e))),Jl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?qt(a):a},u=t.callStack;return t=>{let r=o?s(t):Bl(i,t);if(e.isRecursive||n||t.isKeepLazy||!I(r))return l(r,t);if(!ft(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof y))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Yu(u,e,t),t}}},Ad=(e,t)=>{let n=Dd.has(e);n&&Od(e.function);let r=Zu(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=>Zu(e,t))}),value:Zu(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):$n(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Sl(i,vl(i.scope,`@`,e))):Ur(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(ha.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${sl(e.function)}`)}return n}},jd=(e,t)=>{if(e.kind===`SetFilter`){let n=Zu(e.predicate,t),r=Zu(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:ol(a)},s=(e,t)=>n=>Cl(e(Sl(t,yl(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},Zu(e.predicate,r))});return e=>{let t=r(e);return ft(t)?Ht(L(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Zu(e.expression,t);return t=>{let r=[];return zl(e.bounds,t,e=>(r.push(n(Sl(t,e))),!1)),Rn(r)}}let n=e.set;if(!n)return()=>{throw new y(`TLC cannot evaluate an unbounded CHOOSE at ${al(e)}`)};let r=Zu(e.body,t),i=Zu(n,t);return t=>{let a=i(t);if(!N(a)||Pt(a))throw new y(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${sl(e)}`);let o={value:void 0},s=Fl(a,n,t.environment.runtime.version);if(Il(s,n=>{let i=yl(t.scope,e.pattern,n);return Cl(r(Sl(t,i)),`the body of CHOOSE`)?(o.value=Ed(e.pattern,i),!0):!1}),o.value===void 0)throw new y(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${sl(e)}`);return o.value}},Md=e=>[...e].sort((e,t)=>zt(e.name,t.name)),Nd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),Pd=(e,t)=>new te(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${sl(t)}`,e),Fd=(e,t)=>e instanceof te&&t!==`1.7.4`?new y(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Id=e=>new y(`A primed expression appears outside an action at ${al(e)}`),Ld=(e,t)=>{let n=Md(e),r=Nd(n),i=n.map(e=>Zu(e.value,t));if(r)return e=>er(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>vt(a,i.map(t=>t(e)),o):e=>tn(a,i.map(t=>t(e)))},Rd=(e,t)=>{let n=e=>Zu(e,t);switch(e.kind){case`Number`:{let t=e.value;return wu(t)?()=>t:()=>{throw gl(e)}}case`Decimal`:return()=>{throw hl(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return ed(e,t);case`Apply`:return wd(e,t);case`Bracket`:return()=>{throw new y(`A bracket without a function or subscript is not an expression at ${al(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new y(`An operator cannot be used as a value at ${al(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 ul(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 ul(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Id(e);return t({environment:n.environment,scope:n.scope,state:n.next,next:void 0,isKeepLazy:n.isKeepLazy})}}case`Unchanged`:{let t=n({kind:`Prime`,expression:e.expression,location:e.location}),r=n(e.expression);return e=>nn(t(e),r(e))}case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw ll(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new y(`A non-boolean expression (${Ki(t)}) was used as a condition of a CASE. ${cl(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new y(`Attempted to evaluate a CASE with no conditions true.\n${sl(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Sl(n,Su(e.definitions,n)))}case`Forall`:case`Exists`:return Td(e,t);case`UnboundedQuantifier`:return()=>{throw new y(`TLC cannot evaluate an unbounded quantifier at ${al(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return jd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Rn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>$n(t.map(t=>t(e)))}case`FunctionConstruction`:return kd(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 Ld(e.fields,t);case`RecordSet`:{let t=Md(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 Ad(e,t);case`ExceptAt`:return t=>{let n=_l(t.scope,`@`);if(n?.kind!==`Value`)throw new y(`@ appears outside an EXCEPT at ${al(e)}`);return n.value};case`FunctionApplication`:{Od(e.function);let r=n(e.function),i=t=>bl(r(xl(t)),e),a=e.args.map(n),o=fl(t.runtime.version);if(a.length===1){let e=a[0];return t=>Br(i(t),e(t),o)}return e=>Br(i(e),$n(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=dl(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?Cl(t(e),`an action`)||r(e):Cl(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Xc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new y(`The subexpression reference at ${al(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new y(`TLC cannot evaluate a temporal formula in a state at ${al(e)}`)}}},zd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Bd=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Vd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(zd.has(e.kind))return!1;let a=Bd(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&Eu(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return Si(e).every(i)};return i(e)?[...n]:void 0},Hd=`-------------------------------- MODULE Reals -------------------------------
71
+ `],[2281,` - specifically: `]]),va=(e,t,n)=>{let r=n?_a.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)}${ya(t.slice(a),n)}`},ya=(e,t)=>{let n=t?ha(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${sa.none} @!@!@\n${va(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ba=e=>String(e).padStart(2,`0`),xa=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 ${ba(r%24)}h`:e>36e5?`${ba(r%24)}h ${ba(n)}min`:e>6e4?`${ba(n)}min ${ba(t)}s`:`${ba(t)}s`},Sa=e=>`${e.getFullYear()}-${ba(e.getMonth()+1)}-${ba(e.getDate())} ${ba(e.getHours())}:${ba(e.getMinutes())}:${ba(e.getSeconds())}`,Ca={kind:`Local`},wa=/* @__PURE__ */ new WeakSet,Ta=/* @__PURE__ */ new WeakMap,Ea=/* @__PURE__ */ new WeakMap,Da=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Oa=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ka=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Aa=e=>e.kind===`Operator`?e.params.length:0,ja=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ma=e=>e.name.includes(`!`),Na=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Pa=(e,t,n)=>{let r=t.bindings.get(e);return r&&ka(r.position,t.location)&&(!n||ka(r.position,n.start))?r:void 0},Fa=(e,t)=>e!==void 0&&t!==void 0&&a(e)===a(t),Ia=(e,t,n,r)=>{if(t===void 0)return!0;if(Fa(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let o=a(i),s=t.range&&a(t.range);return t.kind===`Builtin`?r.errors.push({location:o,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:o,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${s}.`}):r.warnings.push({location:o,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${s}.`}),!1},La=(e,t,n,r)=>Ia(t,Na(e,t)??Pa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Ra=(e,t,n)=>{Ia(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},za=(e,t,n,r)=>t.reduce((e,t,i)=>La(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Ba=(e,t,n)=>t.reduce((e,t)=>La(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),Va=e=>e.kind===`Name`?[e.name]:e.names,Ha=e=>e.flatMap(e=>Va(e.pattern)),Ua=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ka(n.location,t.location))?n:void 0},Wa=(e,t)=>{let n=Ua(e,t);return n?{key:t.getKey(n),arity:Aa(n),params:ja(n),kind:`Definition`}:t.imported.get(e)},Ga=(e,t,n)=>Na(t,e)??Wa(e,n),Ka=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),qa=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Ka(e.location,e.spelling??t)},Ja=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ka(e.location,e.args[0].location)?`prefix`:`postfix`}},Ya=e=>!/^[\p{L}\d_]/u.test(e),Xa=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Za=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Qa=(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])}})},$a=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Qa(e.name,[],void 0):Qa(e.operator,e.args,e.argumentCounts),eo=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),to=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Ha(e.bounds),body:e.body,sets:eo(e.bounds)};case`SetMap`:return{names:Ha(e.bounds),body:e.expression,sets:eo(e.bounds)};case`SetFilter`:return{names:Va(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Va(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}},no=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}},ro=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,io=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),ao=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?ao(e.body,t):pi(e).reduce((e,n)=>e??ao(n,t),void 0)},oo=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??oo(i,t,n||io(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&ao(e.set,t):ao(e,t)},so=e=>e.kind===`Label`?so(e.body):e,co=e=>typeof e==`number`?`argument selector ${e}`:e,lo=`within the scope of a declaration
72
+ from outside that declaration's scope.`,uo=(e,t,n,r,i,o)=>{let s=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:a(r),message:n})},c=n.isSuffices===n.isInProof,l=n.statement,u={node:l,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,o=u.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return o.kind!==`NewSymbol`&&o.kind!==`AssumeProve`&&so(o).kind===`Let`?void 0:s(a-1,`A name selector here must be from a LET clause.`);let e=l.kind===`AssumeProve`?[...l.assumptions,l.conclusion]:[l],r=a===1?e.map((e,t)=>({position:t,label:oo(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:o.kind===`Label`?ao(o.body,n.name):void 0};if(!r?.label)return s(a,`Cannot find label \`${n.name}'.`);if(a===1&&l.kind===`AssumeProve`&&io(l,r.position)&&c)return s(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${lo}`);if(n.args.length!==r.label.params.length)return s(a,`Label \`${n.name}' used with wrong number of arguments.`);u.node=r.label,u.isGoal=!1,u.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=co(n.operand);if(u.isSufficesOpen){if(Za(n.operand,1)!==0)return s(a,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=so(o);if([`Number`,`Decimal`,`String`].includes(e.kind))return s(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?Ga(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return s(a,`Choosing operand \`${d}' of subexpression with no operands.`);let c=to(e)?.sets,l=e.kind===`Identifier`?[]:c?c.length>0?c:void 0:e.kind===`Except`?void 0:no(e);if(!l)return;let f=Za(n.operand,l.length);if(f===-1)return s(a,`Nonexistent operand specified by \`${d}'.`);u.node=l[f],u.isGoal=!1;continue}let f=[...o.assumptions,o.conclusion],p=Za(n.operand,f.length);if(p===-1)return s(a,`Nonexistent operand specified by \`${d}'.`);if(io(o,p)&&(!u.isGoal||c))return s(a,`Accessing ASSUME/PROVE clause ${lo}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return s(a,`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.`))},fo=(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:a(e.location.range),message:n}),!0)},po=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=a(r),o=e.params.filter((r,i)=>{let o=Na(t,r)?.kind===`Parameter`,s=e.paramRanges?.[i];return!o&&s&&n.errors.push({location:a(s),message:`Illegal parameter ${r} of label \`${e.name}'.`}),o});o.filter((e,t)=>o.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!o.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let s=[...new Set(o.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!o.includes(e))];s.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${s.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},mo=(e,t,n,r)=>{if(!ro(e))return!1;let i=$a(e),a=i[0],o=i.length>1&&a.kind===`Name`?Na(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&uo(e,i,o,t,n,r),o!==void 0},ho=(e,t,n,r)=>{let i=e.location;if(To(e,n,r))return;let o=Ea.get(e);if(o!==void 0)return o;if(Da(t))return e.kind===`Apply`?e.args.length:0;let s=Na(n,t);if(s?.isNonFact){r.errors.push({location:a(qa(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(mo(e,n,r,!1)||Xa(t)&&s)return e.kind===`Apply`?e.args.length:0;if(s&&e.kind!==`OperatorReference`&&(e.resolution=Ca),s)return s.arity;let c=Wa(t,r);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,Ea.set(e,c.arity),c.arity;let l=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(l!==``&&(Na(n,l)!==void 0||Wa(l,r)!==void 0||r.facts.has(l)))return e.kind===`Apply`?e.args.length:0;let u=(e.kind===`Identifier`?void 0:e.spelling)??t,d=a(e.kind===`Apply`&&u===`-.`?Ka(i,`-`):qa(e,t));if(!Ya(t)||Xa(t)){r.errors.push({location:d,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:d,message:`Could not find declaration or definition of symbol '${u}'.`});let f=Ja(e);f&&i.range&&r.errors.push({location:a(i.range),message:`Couldn't resolve ${f} operator symbol \`${u}'.`})},go=(e,t,n)=>(e.forEach(e=>H(e.set,t,n)),e.reduce((e,t)=>za(e,Va(t.pattern),t.pattern.ranges,n),t)),_o=(e,t)=>e.kind===`Identifier`&&e.name===t&&z(e)||pi(e).some(e=>_o(e,t)),vo=(e,t)=>{e.kind===`FunctionConstruction`&&_o(e.body,t)&&(e.isRecursive=!0),pi(e).forEach(e=>vo(e,t))},yo=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Ha(e.bounds):[],labels:/* @__PURE__ */ new Set},o=e.name,s=e.location.range,c=e=>{s&&!i.isGenerated&&i.errors.push({location:a(s),message:e})},l=e.kind===`Function`?go(e.bounds,t,i):Ba(t,e.params,i),u=Na(l,o)??Pa(o,i,s),d=u?.isPending===!0&&r.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`?(H(e.body,{name:o,kind:`Parameter`,arity:0,range:s,parent:l},i),vo(e.body,o),e.isSelfReferential=_o(e.body,o)):H(e.body,l,i),u&&d?(u.isPending=!1,u.range=s,!1):e.kind===`Function`?u===void 0:Ia(o,Na(t,o)??Pa(o,i,s),{kind:`Definition`,arity:Aa(e),range:s},i)},bo=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(Na(e,t.name)?.isPending)return e;let n={name:t.name,arity:Aa(t),params:ja(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)=>jo(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Da(t.name)?e:s(e,e=>!ka(t.location,e.location)),o={name:t.name,arity:Aa(t),kind:`Definition`,range:t.location.range,parent:a};if(Ma(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Da(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return yo(t,a,u,i)?{...o,params:ja(t)}:a},a),()=>!0)},xo=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:Na(t,r)??Pa(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},So=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=xo(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let o=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return o&&n.errors.push({location:a(o),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},Co=(e,t,n)=>{if(So(e,t,n))return;let r=e.operator,i=Ga(r,t,n),o=ho(e,r,t,n);if(o===void 0)return;if(o!==e.args.length){n.errors.push({location:a(e.argumentsRange??qa(e,r)),message:`The operator ${r} requires ${o-(xo(r,t,n)?.arity??0)} arguments.`});return}let s=i&&(i.kind===`Definition`?i.params:[]);if(s===void 0){e.args.forEach(e=>wo(e,t,n));return}let c=(e,t)=>{e&&n.errors.push({location:a(e),message:t})};e.args.map((i,a)=>{let o=s[a]??0,l=i.location.range;if(o===0){if(i.kind===`Lambda`&&i.operator!==void 0)c(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)c(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=ho(i,i.operator,t,n);e!==void 0&&c(l,`The operator ${i.operator} requires ${e} arguments.`)}else H(i,t,n);return!0}if(i.kind===`Lambda`){H(i,t,n);let s=i.params.length===o;return!s&&wa.has(i)?c(l,`Expected arity ${o} but found operator of arity ${i.params.length}.`):!s&&l&&i.operator===void 0&&c(e.selectorRanges?.at(-1)??qa(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${o} is required.`),s}if(i.kind===`Subexpression`)return H(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return c(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return c(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=Ga(u,t,n)?.params??[],f=ho(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==o&&c(qa(i,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 '${r}' \nshould be a ${s[n]}-parameter operator.`)})},wo=(e,t,n)=>{e.kind===`Identifier`?ho(e,e.name,t,n):H(e,t,n)},To=(e,t,n)=>{let r=Ta.get(e);return r?(r.args.forEach(e=>wo(e,t,n)),n.errors.push(r.error),!0):!1},H=(e,t,n)=>{if(wa.has(e)&&!n.isGenerated){H(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>H(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(So(e,t,n))return;let r=e.name,i=ho(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:a(qa(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:ho(e,e.operator,t,n);return;case`Apply`:Co(e,t,n);return;case`Lambda`:H(e.body,za(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:H(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&&H(e.other,t,n);return;case`Let`:H(e.body,bo(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:H(e.body,go(e.bounds,t,n),i(Ha(e.bounds)));return;case`UnboundedQuantifier`:H(e.body,za(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&H(e.set,t,n),H(e.body,za(t,Va(e.pattern),e.pattern.ranges,n),i(Va(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:H(e.predicate,go([e.bound],t,n),i(Va(e.bound.pattern)));return;case`SetMap`:H(e.expression,go(e.bounds,t,n),i(Ha(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:a(r.location.range??Ka(r.location,r.name)),message:`Non-unique fields in constructor.`}),H(r.value,t,n)});return;case`Except`:H(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),H(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:H(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(fo(e,n))return;H(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),po(e,t,n);return;case`Subexpression`:if(To(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>wo(e,t,n)),mo(e,t,n,!1)}},Eo=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||So(e,t,n)||mo(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&Na(t,r)?.isNonFact?n.errors.push({location:a(qa(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||H(e,t,n)}),Do=(e,t,n)=>(e.set&&H(e.set,t,n),La(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Oo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Do(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Oo(t,e.scope,e.unit,!0):H(t,e.scope,e.unit),e),{scope:t,unit:n});return H(e.conclusion,i.scope,i.unit),i.scope},ko=(e,t,n)=>e.kind===`AssumeProve`?Oo(e,t,n):(H(e,t,n),t),Ao=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Eo(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>Mo(t,e,r),t)},jo=(e,t,n)=>{let r=Ro(e,t,n);return e.name===void 0?r:La(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Mo=(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=ko(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ao(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return Ao(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 Eo(r.facts,t,n),o(t);case`Instance`:return o(jo(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?jo(t,e,i):bo([t],e,n),t));case`Have`:case`Case`:return H(r.expression,t,i),Ao(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>H(e,t,i)),a(t);case`Take`:return a(za(go(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=za(go(r.bounds,t,i),r.names,r.nameRanges,i);return H(r.body,o,{...i,labelParams:[...i.labelParams,...Ha(r.bounds),...r.names]}),Ao(e.proof,a(t),n),a(o)}default:return Ao(e.proof,a(t),n),a(t)}},No=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ko(e.statement,void 0,t);e.name!==void 0&&Ra(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ao(e.proof,n,t),r&&(r.isInProof=!1)},Po={line:0,column:0},Fo=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Io=(e,t)=>{let n=new Map([...Oa,...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},Lo=(e,n,r,i,o)=>{let s=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),c=(n,r)=>{if(n.arity===0||r.kind!==`Identifier`){H(r,s,o);return}let i=ho(r,r.name,s,o);if(i!==void 0&&i!==n.arity)throw new t(`An operator must be substituted for symbol '${n.name}', and it must have arity ${n.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},l=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let t=e.name,r=n.find(e=>e.name===t);if(!r){o.errors.push({location:a(e.nameRange),message:`Identifier '${t}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;c(r,i);let s=i.location.range;l.has(t)?s&&o.errors.push({location:a(s),message:`Multiple substitutions for symbol '${t}' in substitution.`}):l.set(t,i)});let u=n.filter(e=>!l.has(e.name)),d=e=>!Na(s,e.name)&&!Wa(e.name,o);return u.filter(e=>!d(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};c(t,n),l.set(t.name,n)}),u.filter(d).forEach(t=>{let n=e.location.range,i=t.location.range;n&&i&&o.errors.push({location:a(n),message:`Substitution missing for symbol ${t.name} declared at ${a(i)} \nand instantiated in module ${r}.`})}),l},Ro=(e,t,n)=>{let r=n.getInstance(e);return Lo(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>La(e,t,r,n),t)},zo=(e,t,n,r)=>{let i=Io(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),Lo(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:Po}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Bo=(e,n)=>{let r=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>ka(e.location,t.location)?-1:+!!ka(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof t)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(r,e)),o.forEach(e=>i(n,e))}),r},Vo=(e,t)=>{let n=Io(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),o=new Map([...Oa,...t.bound].map(([e,t])=>[e,{...t,position:Po}])),s=/* @__PURE__ */ new Set,c=[],l=(e,a,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:a,facts:r,goals:i,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)=>Ra(e.name,{kind:t,arity:e.arity,range:e.location.range},l(e.location,void 0,n,r,!1))}));return Bo([...t.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=Ia(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);Fo(e,t)?H(t.body,void 0,i):yo(t,void 0,i,s)&&o.set(t.name,{kind:`Definition`,arity:Aa(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=l(e.location,void 0,n,r,!1);Ba(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>Ra(t,e,i)),e.name!==void 0&&Ra(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);H(e.expression,void 0,r),e.name!==void 0&&Ra(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>No(e,l(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Eo(e.facts,void 0,l(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>c.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:a(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Ho=/* @__PURE__ */ new WeakSet,Uo=/* @__PURE__ */ new WeakSet,Wo=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Xo(e,(e,r)=>Wo(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&z(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&z(r)&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Go=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Ko=/* @__PURE__ */ new WeakMap,qo=e=>Ko.get(e)??e.name,Jo=(e,t)=>(qo(t)!==e.name&&Ko.set(e,qo(t)),e),Yo=(e,t)=>Jo(e.kind===`Function`?{...e,bounds:Go(e.bounds,e=>t(e,[])),body:t(e.body,Ha(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Xo=(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=>Yo(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Go(e.bounds,n),body:t(e.body,Ha(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,Va(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,Va(e.bound.pattern))};case`SetMap`:return{...e,bounds:Go(e.bounds,n),expression:t(e.expression,Ha(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)}}},Zo=`LAMBDA`,Qo=(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 Xo(e,(e,n)=>(r.push(...Qo(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},$o=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}},es=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),ts=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},ns=(e,t)=>e.map(e=>({pattern:ts(e.pattern,t),set:e.set})),rs=(e,t)=>e.kind===`Function`?{...e,bounds:ns(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},is=(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=>Jo({...rs(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:ns(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:ts(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:ts(e.bound.pattern,n),set:e.bound.set}};default:return e}},as=e=>`${e}@ENABLED`,os=(e,t)=>e.modes.get(t)??e,ss=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!z(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=z(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},ls=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return ss(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:as(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:ms(e.expression,os(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[ms(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:ms(e.subscript,os(t,`Primed`),n),location:r},ms(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:as(r),location:e.location},location:e.location},ms({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},us=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:{kind:`Local`}}),ds=(e,t)=>e.map(e=>us(e.name,t)),fs=(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:[...ds(t,r),...i.map(e=>us(e,r))],location:r},location:r}},ps=(e,t)=>e.instantiation.isParameterized(t)?gs(e,t):void 0,ms=(e,n,r)=>{let i=e=>ms(e,n,r),a=n.instantiation,o=a.params,s=t=>!r.has(t)&&!z(e);if(e.kind===`Enabled`&&n.mode===`Normal`)return{...e,expression:ms(e.expression,os(n,`Enabled`),r)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&n.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:ms(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},os(n,`Enabled`),r)};let c=ls(e,n,r);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let t=a.substitutions.get(e.name);if(t)return Ho.add(t),t;let r=ps(n,e.name);if(r===void 0)return e;if(o.length===0)return{...e,name:r};let i=a.getDefinition(e.name);return i&&Aa(i)>0?fs(r,o,Aa(i),e.location):{kind:`Apply`,operator:r,args:ds(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let r=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||Uo.has(e),l=e=>(c&&Uo.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:r,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...r],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Zo,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:Zo,args:r,resolution:{kind:`Local`}},location:e.location};if(s)throw new t(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=ps(n,e.operator);return u===void 0?l({...e,args:r}):{...e,operator:u,args:[...ds(o,e.location),...r]}}if(e.kind===`OperatorReference`&&s(e.operator)){let t=ps(n,e.operator);if(t===void 0)return e;let r=a.getDefinition(e.operator);return o.length>0&&r?fs(t,o,Aa(r),e.location):{...e,operator:t}}let l=$o(n),u=Xo(e,(e,t)=>t.length===0?i(e):ms(e,n,es(r,t,l)));return is(u,r,l)},hs=(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:us(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},gs=(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=$o(e),o=rs(Yo(i,(t,n)=>ms(t,e,es(/* @__PURE__ */ new Map,n,a))),a);return hs(o,r.params,i.location)}):t},_s=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Qo(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=>ps(i,e)??e,getQualifiedKey:t=>{let n=ps(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>hs(r,e.params,r.location)):t}}},vs=e=>e.kind===`Let`&&e.instances!==void 0||pi(e).some(vs),ys=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Xo(e,e=>ys(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ka(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}},bs=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,xs=(e,t)=>e.definitions.some(e=>vs(e.body))||e.assumptions.some(e=>vs(e.expression))||e.theorems.some(e=>{let t=bs(e);return t!==void 0&&vs(t)})?{...e,definitions:e.definitions.map(e=>Yo(e,e=>ys(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:ys(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=bs(e);return n===void 0?e:{...e,statement:ys(n,t,[])}})}:e,Ss=(e,t,n)=>{let r=e.callStack;r.expressions.push(t);let i=_r.sets,a=i??[],o=a.length;_r.sets=a;try{return n()}catch(e){throw zu(r,a.slice(o),e),e}finally{r.isFrozen||r.expressions.pop(),a.length=o,_r.sets=i}},Cs=(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},ws=e=>!e.includes(void 0),Ts=e=>e.variables.map(()=>void 0),Es=(e,t,n)=>{let r=[...e];return r[t]=n,r},Ds=(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}},Os=e=>e.kind===`Identifier`?e.name:void 0,ks=(e,t,n)=>{if(t.kind===`Label`)return ks(e,t.body,n);let r=Os(t);if(r===void 0)return;let i=cl(n,r);if(i?.kind===`Thunk`)return ks(e,i.expression,i.scope);if(i)return;let a=e.environment.variableIndex.get(r);if(a!==void 0)return a;let o=Zl(r,e.environment);return o?.kind===`Closure`&&o.params.length===0?ks(e,o.body,o.scope):void 0},As=(e,t,n)=>{if(t.kind===`Prime`)return ks(e,t.expression,n);if(t.kind===`Label`)return As(e,t.body,n);let r=Os(t);if(r===void 0)return;let i=cl(n,r);if(i?.kind===`Thunk`)return As(e,i.expression,i.scope);if(i)return;let a=Zl(r,e.environment);return a?.kind===`Closure`&&a.params.length===0?As(e,a.body,a.scope):void 0},js=e=>{if(typeof e!=`boolean`)throw new _(`TLC expected a boolean expression.`);return e},Ms=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Ns=(e,t,n)=>{t===void 0?ws(n)&&e.onState(n):ws(n)&&Ms(e)?Fs(e,t,n):t.kind===`Predicate`?Is(e,t.expression,t.rest,t.scope,n):t.kind===`Unchanged`?Gs(e,t.expression,t.rest,t.scope,n):Ps(e,t,n)&&Ns(e,t.rest,n)},Ps=(e,t,n)=>{let r=e.environment,i=U(t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return U(t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Td(t,r.runtime.version):t}})();return!qt(i,a)},Fs=(e,t,n)=>{for(let r=t;r!==void 0;r=r.rest){if(r.kind===`Unchanged`){Gs(e,r.expression,r.rest,r.scope,n);return}if(r.kind===`Changed`?!Ps(e,r,n):!js(U(r.expression,Cs(e,r.scope,n))))return}e.onState(n)},Is=(e,t,n,r,i)=>Ss(e,t,()=>{switch(t.kind){case`Let`:Is(e,t.body,n,pu(t.definitions,Cs(e,r,i)),i);return;case`Label`:Is(e,t.body,n,r,i);return;default:if(Us.has(t.kind))throw new _(`The state relation is not a boolean expression.`);Ss(e,t,()=>Ws(e,t,n,r,i))}}),Ls=(e,t,n,r)=>{js(t)&&Ns(e,n,r)},Rs=(e,t,n,r,i)=>{let a=Cs(e,r,i);if(t.kind===`Identifier`){let o=cl(r,t.name);if(o?.kind===`Thunk`&&o.cache===void 0){Is(e,o.expression,n,o.scope,i);return}if(o?.kind===`Operator`&&o.operator.kind===`Closure`&&o.operator.params.length===0){Is(e,o.operator.body,n,o.operator.scope,i);return}let s=o?void 0:e.environment.definitions.get(t.name),c=o?void 0:Zl(t.name,e.environment);if(c?.kind===`Closure`&&c.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(s&&yl(s,e.environment))){Is(e,c.body,n,c.scope,i);return}Ls(e,U(t,a),n,i);return}let o=$l(t,a);o?.kind===`Closure`&&o.params.length===t.args.length?Is(e,o.body,n,du(o,t.args,a),i):Ls(e,U(t,a),n,i)},zs=(e,t,n,r,i)=>{let a=n[r];a===void 0?Ns(e,t,Es(n,r,i)):qt(a,i)&&Ns(e,t,n)},Bs=(e,t,n,r)=>({kind:e,expression:t,scope:n,rest:r}),Vs=(e,t,n,r,i)=>{let[a,o]=t.args,s=e.isInit?ks(e,a,r):As(e,a,r),c=Cs(e,r,i);if(s===void 0){U(t,c)===!0&&Ns(e,n,i);return}let l=U(o,c),u=i[s];if(t.operator===`=`){zs(e,n,i,s,l);return}let d=t.operator===`\\subseteq`?{kind:`Subset`,base:l}:l;if(u!==void 0)U(t,c)===!0&&Ns(e,n,i);else{if(!Kn(d))throw new _(`The right side of \\IN is not enumerable.`);for(let t of ir(d))Ns(e,n,Es(i,s,t))}},Hs=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Us=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Ws=(e,t,n,r,i)=>{let a=Cs(e,r,i);switch(t.kind){case`Identifier`:Rs(e,t,n,r,i);return;case`Apply`:if(Hs.has(t.operator)&&t.args.length===2){Vs(e,t,n,r,i);return}if(t.operator===`=>`&&t.args.length===2){if(js(U(t.args[0],a))){Is(e,t.args[1],n,r,i);return}Ns(e,n,i);return}Rs(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)=>Bs(`Predicate`,t,r,e),n);Is(e,a[0],t,r,i);return}let o=a[a.length-1];Is(e,Ds(t,a.length-1),Bs(`Predicate`,o,r,n),r,i);return}case`Or`:{let a=t.operands;if(t.isBulleted||a.length===2){a.forEach(t=>Is(e,t,n,r,i));return}Is(e,Ds(t,a.length-1),n,r,i),Is(e,a[a.length-1],n,r,i);return}case`Exists`:Al(t.bounds,a,r=>(Is(e,t.body,n,r,i),!1));return;case`Forall`:{let r=[];if(Al(t.bounds,a,e=>(r.push(e),!1)),r.length===0){Ns(e,n,i);return}let o=r.slice(1).reduce((e,n)=>Bs(`Predicate`,t.body,n,e),n);Is(e,t.body,o,r[0],i);return}case`If`:Is(e,js(U(t.condition,a))?t.consequent:t.alternative,n,r,i);return;case`Case`:{let o=t.arms.find(e=>js(U(e.condition,a)))?.body??t.other;if(o===void 0)throw new _(`TLC encountered a CASE with no conditions true.`);Is(e,o,n,r,i);return}case`FunctionApplication`:{let r=Fl(U(t.function,e.isInit?a:fl(a)));if(r){Is(e,r.body,n,Il(r,t,a),i);return}break}case`Unchanged`:if(!e.isInit){Gs(e,t.expression,n,r,i);return}break;case`BoxAction`:if(!e.isInit){Is(e,t.action,n,r,i),Gs(e,t.subscript,n,r,i);return}break;case`AngleAction`:if(!e.isInit){Is(e,t.action,Bs(`Changed`,t.subscript,r,n),r,i);return}}Ls(e,U(t,a),n,i)},Gs=(e,t,n,r,i)=>Ss(e,t,()=>{let a=ks(e,t,r);if(a!==void 0){let t=e.current?.[a];t!==void 0&&zs(e,n,i,a,t);return}if(t.kind===`Tuple`){let[a,...o]=t.elements;if(a===void 0){Ns(e,n,i);return}let s=o.reduceRight((e,t)=>Bs(`Unchanged`,t,r,e),n);Gs(e,a,s,r,i);return}if(t.kind===`Identifier`){let a=cl(r,t.name);if(a?.kind===`Thunk`){Gs(e,a.expression,n,a.scope,i);return}let o=a?void 0:Zl(t.name,e.environment);if(o?.kind===`Closure`&&o.params.length===0){Gs(e,o.body,n,o.scope,i);return}}let o=e.environment,s=U(t,{environment:o,scope:r,state:e.current,next:void 0}),c=U(t,{environment:o,scope:r,state:i,next:void 0});qt(s,c)&&Ns(e,n,i)}),Ks=(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}},qs=/* @__PURE__ */ Error(`The replay found a successor`),Js=(e,t,n,r)=>{let i=Ks(r,!1,n,()=>{throw qs},!0),a=i.callStack.expressions.length;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Bs(`Changed`,e.subscript,t,void 0);Is(i,e.action,n,t,Ts(r))}else Is(i,e,void 0,t,Ts(r));return!1}catch(e){if(e!==qs)throw e;return i.callStack.expressions.length=a,i.callStack.isFrozen=!1,!0}},Ys=(e,t,n)=>{let[r,...i]=e;if(r===void 0)return;let a=Ks(t,!0,void 0,n),o=i.reduceRight((e,t)=>Bs(`Predicate`,t.expression,t.scope,e),void 0);Is(a,r.expression,o,r.scope,Ts(t))},Xs=(e,t,n,r)=>{e.some(e=>Us.has(e.expression.kind))||e.forEach(e=>{let i=[],a=Ks(n,!1,t,e=>i.push(e));Is(a,e.expression,void 0,e.scope,Ts(n)),i.forEach(t=>r(t,e))})},Zs=/* @__PURE__ */ new WeakMap,Qs=/* @__PURE__ */ new WeakMap,$s=(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},ec=(e,t,n)=>{let r=e.slice();return r[t]=n,r},tc=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,nc=(e,t)=>{let n=new _(t);return e.isInit?n:p(n,m.error)},rc=(e,t,n,r)=>{let i=$c(n);return r&&Us.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 ${tc(e)}, TLC expected a boolean expression,\nbut instead found ${R(t)}.\n${i}`},ic=(e,t,n)=>{let r=Li(t),i=Qc(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 ${tc(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
73
+ `:``}${i}`},ac=(e,t,n,r=!0)=>oc(e,t,U(t,n),r),oc=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;throw nc(e,rc(e,n,t,r))},sc=(e,t,n,r)=>r.environment.callStack?U(n,r):(e[t]??=Wu(n,r.environment))(r),cc=e=>e===`=`||e===`\\in`||e===`\\subseteq`,lc=(e,t,n)=>{let r=n?Zs:Qs,i=r.get(e);if(i)return i;let a=Ic(e,t,n);return r.set(e,a),a},uc=(e,t)=>{if(t.constants.has(e))return;let n=hl(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},dc=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return dc(e.expression,t,!1,r);if(e.kind!==`Identifier`||z(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=uc(e.name,t);if(a&&!r.has(a))return r.add(a),dc(a.body,t,n,r)},fc=(e,t,n)=>dc(e,t,!n),pc=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return pc(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=pu(e.definitions,$s(r,t,n));return pc(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=cl(t,e.name);if(a?.kind===`Thunk`)return pc(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=uc(e.name,r.environment);if(s)return pc(s.body,void 0,n,r,i)},mc=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||z(e))||!t&&e.kind===`Prime`,hc=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>hc(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=uc(e.name,t);if(i)return n.add(e.name),hc(i.body,t,n)},gc=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),_c=(e,t,n)=>gc.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||cc(e.operator)&&(mc(e.args[0],n)||fc(e.args[0],t,n)!==void 0)||z(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,vc=/* @__PURE__ */ new Set,yc=(e,t)=>{if(z(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r={isReadOnly:!0};return Xo(e,(e,i)=>{let a=r.isReadOnly?yc(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r.isReadOnly=!1,e}),r.isReadOnly?n:void 0},bc=(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||z(e)?void 0:hl(r,t);return i&&!n.has(i)&&(n.add(i),bc(i.body,t,n))?!0:pi(e).some(e=>bc(e,t,n))},xc=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=fc(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=hc(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,indices:n}}return _c(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:lc(e,t,n)}},Sc=(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(jd(e,t)===void 0||bc(e,t,/* @__PURE__ */ new Set))return!0;let n=yc(e,vc);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)}},Cc=(e,t,n)=>{let r=e.map(e=>xc(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Ms(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Bc(u)){d??=$s(t,n,u);for(let e=s;e<r.length;e++){let n=r[e].expression,i=sc(a,e,n,d);if(!oc(t,n,i,!1))return}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=$s(t,n,u);let r=sc(i,s,e.expression,d);if(!oc(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=$s(t,n,u);let r=sc(i,s,e.value,d),a=u[e.index];if(a===void 0)u=ec(u,e.index,r),d=void 0;else if(!qt(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;for(let t of e.indices){let e=u[t];if(e===void 0)u=ec(u,t,n[t]),d=void 0;else if(!qt(e,n[t]))return}continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},wc=e=>(t,n,r,i,a,o)=>{ac(t,e,$s(t,n,r))&&o(r,i)},Tc=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=$s(r,i,a);if(a[l]!==void 0){ac(r,e,u)&&c(a,o);return}let d=U(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Kn(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${tc(r)}, the right side of \\IN is not enumerable.`;throw nc(r,`${t}\n${Qc(e)}`)}let p=ir(f);for(let e=0;e<p.length&&!r.isStopped;e++)c(ec(a,l,p[e]),o)}},Ec=/* @__PURE__ */ new WeakMap,Dc=e=>{let t=Ec.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(Dc),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return Ec.set(e,n),n},Oc=(e,t)=>{let n=e.args[0],r=wc(e),i=(e,r,i)=>pc(n,r,i,e,!t)??-1,a=Tc(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=U(e.args[1],$s(t,n,o));l(ec(o,u,d),s)}},kc=(e,t,n)=>{let r=Qc(e);return(i,a,o,s,c,l)=>{let u=$s(i,a,o),d=U(e.function,n?u:fl(u)),f=Fl(d);if(f!==void 0){lc(f.body,t,n)(i,Il(f,e,u),o,s,c,l);return}if(!N(d))throw nc(i,`In computing ${tc(i)}, a non-function (${Li(d)}) was applied as a function.\n${r}`);let p=U(e,u);if(typeof p!=`boolean`)throw nc(i,`In computing ${tc(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},Ac=(e,t)=>{if(hc(e,t))return Cc([Dc(e)],t,!1);if(e.kind===`Tuple`)return lc(Dc(e),t,!1);let n=Dc(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?cl(i,e.name):void 0;l?.kind===`Thunk`?lc(Dc(l.expression),t,!1)(r,l.scope,a,o,s,c):ac(r,n,$s(r,i,a))&&c(a,o)}},jc=(e,t,n)=>{let r=e.operator,i=wc(e),a=z(e)?void 0:Zl(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=Qu(a,e.args,t),o={body:void 0};return(e,s,c,l,u,d)=>{o.body??=lc(a.body,t,n),o.body(e,i($s(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=$s(a,o,s),f=$l(e,d);f?.kind===`Closure`?lc(f.body,t,n)(a,du(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Mc=(e,t,n)=>{let r=wc(e),i=z(e)?void 0:uc(e.name,t),a={body:void 0};return(o,s,c,l,u,d)=>{let f=cl(s,e.name);f?.kind===`Thunk`?lc(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i?r(o,s,c,l,u,d):(a.body??=lc(i.body,t,n),a.body(o,void 0,c,u?l:i.name,u,d))}},Nc=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=e.operands[0];if(n.kind!==`Apply`||n.operator!==`=`||z(n))return;let r=n.args[0],i=n.args[1];if(r.kind!==`FunctionApplication`||i.kind!==`String`)return;let a=r.args.length===1?r.args[0]:void 0;if(a?.kind!==`Identifier`||!z(a))return;let o=dc(r.function,t,!1);return o===void 0?void 0:{variable:o,argument:a.name,labels:/* @__PURE__ */ new Set([i.value])}}if(e.kind===`Or`){let r=e.operands.map(e=>Nc(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o}}if(e.kind!==`Apply`||z(e))return;let r=Zl(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Nc(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`&&z(o))return{variable:i.variable,argument:o.name,labels:i.labels}},Pc=(e,t,n)=>{let r=cl(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},Fc=(e,t,n)=>{let r=e.map(e=>lc(e,t,n)),i=n?[]:e.map(e=>Nc(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e?.labels:void 0);return(e,t,n,i,s,c)=>{let l=a&&Pc(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++)(l===void 0||o[a]?.has(l)!==!1)&&r[a](e,t,n,i,s,c)}},Ic=(e,t,n)=>{let r=e=>lc(e,t,n);switch(e.kind){case`And`:return Cc(e.operands,t,n);case`Or`:return Fc(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=Cl(U(a.set,$s(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,ll(r,e,u[t]),o,s,c,l)}}let o=n?void 0:Sc(e,t);if(o){let r=Cc(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=$s(n,i,a),d=e.bounds.map(e=>Cl(U(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=ll(t,o.names[e],r);if(e===d.length-1){let e=$s(n,i,a);if(!o.guards.every(t=>ac(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Al(e.bounds,$s(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&jd(e,t)!==void 0&&!bc(e.body,t,/* @__PURE__ */ new Set)?yc(e,vc):void 0;return(t,n,r,o,s,c)=>{let l=[];Al(e.bounds,$s(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>cl(n,e)?.kind===`Value`)){u.every(n=>ac(t,e.body,$s(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Bc(r)?u.slice(n).every(n=>ac(t,e.body,$s(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=U(e.condition,$s(r,i,a));if(typeof l!=`boolean`)throw nc(r,ic(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=$s(r,i,a),u=t.find(e=>{let t=U(e.condition,l);if(typeof t==`boolean`)return t;throw nc(r,`In computing ${tc(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Li(t)}) was used as a guard condition of a CASE.\n${$c(e.source)}`)})?.body??n;if(!u)throw nc(r,`In computing ${tc(r)}, TLC encountered a CASE with no conditions true.\n${Qc(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=wu(e.definitions,t);return(t,r,a,o,s,c)=>n(t,pu(e.definitions,$s(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new _(`UNCHANGED appears in an initial predicate at ${Xc(e)}`)}:Ac(e.expression,t);case`AngleAction`:{let n=r(e.action),i=Dc(e.subscript),a=(e,n,r)=>{try{return ac(e,i,$s(e,n,r))}catch(n){throw e.isEnabled?Td(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,Dc(e.subscript)],location:e.location});case`Label`:return r(e.body);case`Identifier`:return Mc(e,t,n);case`FunctionApplication`:return kc(e,t,n);case`Apply`:{let i=e.args;if(cc(e.operator)){let r=fc(i[0],t,n);if(r!==void 0)return e.operator===`=`?Cc([e],t,n):Tc(e,()=>r);if(mc(i[0],n))return Oc(e,n)}if(e.operator===`=>`){let e=r(i[1]);return(t,n,r,a,o,s)=>{let c=U(i[0],$s(t,n,r));(typeof c==`boolean`?c:ml(c,`the left side of => at ${Xc(i[0])}`))?e(t,n,r,a,o,s):s(r,a)}}return jc(e,t,n)}default:return wc(e)}},Lc=/* @__PURE__ */ new WeakMap,Rc=e=>{let t=Lc.get(e);if(t)return t;let n=e.variables.map(()=>void 0);return Lc.set(e,n),n},zc=(e,t)=>t.variables.filter((t,n)=>e[n]===void 0),Bc=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Vc=(e,t)=>{let n=t.state;if(!n||!Bc(n))throw new _(`ENABLED needs a complete state at ${Xc(e)}`);let r=t.environment;if(r.callStack)return Js(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1};return lc(e,r,!1)(i,t.scope,Rc(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Hc=(e,t,n,r)=>{let i={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1};lc(e,t,!0)(i,r,Rc(t),void 0,!1,e=>{if(!i.isStopped){if(!Bc(e))throw p(new g([...e]),m.error);i.isStopped=n(e)}})},Uc=(e,t,n)=>{let r=[];return Hc(e,t,e=>(r.push(e),!1),n),r},Wc=(e,t,n,r,i)=>{let a={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1},o={successors:0};return lc(e,n,!1)(a,i,Rc(n),void 0,!1,(e,t)=>{if(!a.isStopped){if(!Bc(e)){let r=zc(e,n);throw new ee(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)}o.successors++,a.isStopped=r({state:e,action:t})}}),o.successors},Gc=(e,t,n,r)=>{let i=[];return Wc(e,t,n,e=>(i.push(e),!1),r),i},Kc=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),qc=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Jc=e=>qc.has(e.kind)||e.kind===`Apply`&&Kc.has(e.operator),Yc=(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&&rt(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Xc=e=>`line ${e.location.line}, column ${e.location.column}`,Zc=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,Qc=e=>{let t=e.location.range;return t?Zc(t):Xc(e)},$c=e=>e.kind===`Number`?e.text??String(e.value):Qc(e),el=(e,t)=>new _(`A non-boolean expression (${Li(t)}) was used as the condition of an IF.\n${Qc(e)}`),tl=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new _(`A non-boolean expression (${Li(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${$c(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new _(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Li(n)}.\n${Qc({...e,location:{...e.location,range:{...r,end:i}}})}`)},nl=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${R(n)}\n${Qc(e)}`,r=e=>`Attempted to apply function:\n${nt(R(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!N(i))throw new _(`Attempted to select field "${t}" from a non-record value ${nt(R(i))}\n${Qc(e)}`);let a=Lt(i);if(a===`tuple`)throw Or(t);return jr(i,t,a===`record`?n:r)}},rl=e=>e===`1.7.4`?(t,n)=>Tr(t,n,e):void 0,il=e=>t=>{if(!N(t))throw new _(`Attempted to apply the operator DOMAIN to a non-function\n(${Li(t)})\n${Qc(e)}`);return Nr(t)},al=(e,t)=>(n,r)=>{if(!M(n)||Tt(n))throw new _(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Qc(e)}`);return t.evaluate([n,r])},ol=e=>p(new _(`TLC can't handle real numbers: ${e.text} at ${Xc(e)}`),m.configParseError),sl=e=>p(new _(`TLC can't handle a number this big: ${e.text??e.value} at ${Xc(e)}`),m.error),cl=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},ll=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),ul=(e,t,n)=>{if(t.kind===`Name`)return ll(e,t.name,n);let r=hr(n);if(!r||r.length!==t.names.length)throw new _(`Cannot bind <<${t.names.join(`, `)}>> to ${R(n)}, which is not a tuple of that length`);return t.names.reduce((e,t,n)=>ll(e,t,r[n]),e)},dl=(e,t)=>{if(N(e))return e;throw new _(`A non-function (${Li(e)}) was applied as a function.\n${Qc(t)}`)},fl=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},pl=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),ml=(e,t)=>{if(typeof e!=`boolean`)throw new _(`Expected ${t} to be a boolean but found ${R(e)}`);return e},hl=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),gl=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`BoxAction`,`AngleAction`,`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),_l=/* @__PURE__ */ new Set([`~>`,`-+->`,`\\cdot`]),vl=(e,t)=>{if(gl.has(e.kind)||e.kind===`UnboundedQuantifier`&&e.isTemporal===!0||e.kind===`Apply`&&_l.has(e.operator))return!0;let n=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(n!==void 0){if(t.variableIndex.has(n)||t.builtins.get(n)?.isStateLevel)return!0;let e=hl(n,t);if(e&&!t.constants.has(n)&&!yl(e,t))return!0}return pi(e).some(e=>vl(e,t))},yl=(e,t)=>{let n=t.constantLevels.get(e);if(n!==void 0)return n;t.constantLevels.set(e,!0);let r=!vl(e.body,t)&&(e.kind===`Operator`||!e.bounds.some(e=>vl(e.set,t)));return t.constantLevels.set(e,r),r},bl=(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.`},xl=(e,t,n)=>{if(!M(e)||Tt(e)){let r=R(e),i=n===`1.7.4`?void 0:bl(e,r);throw new _(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${$c(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${$c(t)}\n${i}`)}},Sl=(e,t,n)=>(xl(e,t,n),typeof e==`object`&&e.kind===`Interval`?Bn(e):$n(e)??I(e).elements),Cl=(e,t,n)=>n===`1.7.4`?(xl(e,t,n),$n(e)??ir(e)):Sl(e,t,n),wl=e=>{if(typeof e==`object`&&e.kind===`Interval`)return dr(e),e},Tl=(e,t,n)=>wl(e)??Cl(e,t,n),El=(e,t,n)=>wl(e)??Sl(e,t,n),Dl=(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},Ol=(e,t)=>e.map(e=>Tl(U(e.set,t),e.set,t.environment.runtime.version)),kl=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Dl(t[n],t=>i(n-1,ul(a,e[n].pattern,t)));return i(e.length-1,n)},Al=(e,t,n)=>kl(e,Ol(e,t),t.scope,n),jl=(e,t)=>{let n=e.map(e=>U(e.set,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Ml=(e,t,n)=>{if(e.length===1)return ul(t,e[0].pattern,n);let r=hr(n)??[];return e.reduce((e,t,n)=>ul(e,t.pattern,r[n]),t)},Nl=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Pl=e=>Object.assign(e.value,{lambda:e}),Fl=e=>Nl(e)?e.lambda:void 0,Il=(e,t,n)=>{let r=e.value,i=t.args.map(e=>U(e,n)),a=i.length===1?i[0]:Wn(i),o=(e,n,i)=>`In applying the function\n${nt(R(r))},\nthe ${e} is:\n${nt(R(n))}${i}.\n${Qc(t.function)}`,s=e.bounds;if(s.length===1){if(!yr(a,r.domain))throw new _(o(`first argument`,a,`which is not in its domain`));return Ml(s,e.scope,a)}let c=hr(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0||c.length<s.length)throw new _(`Attempted to apply a function to an argument not in its domain.\n${Qc(t.function)}`);return s.forEach((e,t)=>{let n=c[t],r=`argument number ${t+1}`;if(!yr(n,l[t]))throw new _(o(r,n,`${e.pattern.kind===`Name`?``:`
74
+ `}which is not in its domain`));if(e.pattern.kind===`Tuple`&&hr(n)?.length!==e.pattern.names.length)throw new _(o(r,n,`which does not match its formal parameter`))}),Ml(s,e.scope,Wn(c.slice(0,s.length)))},Ll=/* @__PURE__ */ new WeakMap,Rl=(e,t)=>{let n=Ll.get(t);if(n)return n;let r=t.location.range;if(!r)return;let i={parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Zc(r)};return Ll.set(t,i),i},zl=(e,t,n)=>{let r=Rl(e,t);if(!r)return;let i=e.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:r.parameters.map(e=>({name:e.name,domain:i[e.index]})),body:r.body}},Bl=(e,t,n)=>{let r=/* @__PURE__ */ new Map,i={kind:`LazyFunction`,domain:e,source:n,apply:e=>{let n=Kr(e),a=r.get(n);if(a!==void 0){for(let t=0;t<a.length;t+=2)if(Yt(a[t],e))return a[t+1]}let o=t(e,i),s=r.get(n);return s===void 0?r.set(n,[e,o]):s.push(e,o),o}};return i},Vl=/* @__PURE__ */ new WeakMap,Hl=e=>{let t=Vl.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location};return Vl.set(e,n),n},Ul=(e,t)=>{let n=jl(e.bounds,t),r=Bl(n,(n,r)=>U(e.body,pl(t,Ml(e.bounds,ll(void 0,e.name,r),n))),zl(e.bounds,e.body,n));return Pl({value:r,bounds:e.bounds,body:e.body,scope:ll(void 0,e.name,r)}),e.bounds.length===1?Rt(r):r},Wl=(e,t)=>{if(typeof t!=`object`||Lt(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!rt(t.domain))return t;try{let e=wr(t);return Pt(e.domain,e.range)}catch(e){if(e instanceof _)return t;throw e}},Gl=(e,t)=>e.kind===`Function`?e.isSelfReferential?Ul(e,t):U(Hl(e),t):U(e.body,t),Kl=(e,t)=>{let n=yl(e,t.environment),r=n?t.environment.definitionValues.get(e):void 0;if(r!==void 0)return r;if(e.kind===`Operator`&&e.params.length>0)throw new _(`Operator ${e.name} requires ${e.params.length} arguments`);let i=pl(t,void 0);if(!n)return Gl(e,i);let a=t.environment.runtime.evaluateAtStartup(()=>Wl(e,Gl(e,i)));return t.environment.definitionValues.set(e,a),a},ql=(t,n)=>t.forEach(t=>{if(t.kind===`Operator`&&t.params.length>0)return;let r=t.name;if(!(n.constants.has(r)||n.substitutions.has(r))&&yl(t,n))try{Tn(Kl(t,{environment:n,scope:void 0,state:void 0,next:void 0}))}catch(t){if(!(t instanceof _)&&!e(t))throw t}}),Jl=(e,t)=>{let n=e.state===t.state&&e.next===t.next;if(n&&e.cache!==void 0)return e.cache;let r=U(e.expression,pl(t,e.scope));return n&&(!e.isStreamed||or(r))&&(e.cache=r),r},Yl=/* @__PURE__ */ new WeakMap,Xl=e=>{let t=Yl.get(e);if(t)return t;let n={kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0};return Yl.set(e,n),n},Zl=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Zl(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Xl(r):t.builtins.get(e)},Ql=/* @__PURE__ */ new WeakMap,$l=(e,t)=>{if(z(e))return eu(e.operator,t);let n=Ql.get(e),r=n===void 0?Zl(e.operator,t.environment)??null:n;return n===void 0&&Ql.set(e,r),r??eu(e.operator,t)},eu=(e,t)=>{let n=cl(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Zl(e,t.environment)},tu=e=>e.kind===`Closure`?e.params.length:e.arity,nu=(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:eu(n,t);if(!r)throw new _(`Expected an operator argument at ${Xc(e)}`);return r},ru=(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)=>ll(e,n.name,t[r]),e.scope);return U(e.body,pl(n,r))},iu=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:tu(e),call:n=>ru(e,n,t),literalBody:e.kind===`Closure`&&(e.body.kind===`Number`||e.body.kind===`String`)?e.body.value:void 0},au=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=eu(e.name,t);return n!==void 0&&tu(n)>0},ou=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),su=(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 su(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([])}},cu=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&hu(e.value)){let t={kind:`Value`,value:e.value};return()=>t}if(e.kind===`Identifier`){let n=z(e)?void 0:su(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0)return t=>{let n=cl(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:ou(e,t)}}return t=>ou(e,t)},lu=/* @__PURE__ */ new WeakMap,uu=(e,t)=>{let n=lu.get(e);if(n)return n;let r=cu(e,t);return lu.set(e,r),r},du=(e,t,n,r)=>{if(t.length!==e.params.length)throw new _(`Operator ${e.name} expects ${e.params.length} arguments but received ${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:nu(t[a],n)}:(r?.[a]??uu(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},fu=(e,t,n,r,i)=>{if(e.kind===`Closure`){let a=pl(n,du(e,t,n,i));return n.environment.callStack?U(e.body,a):(r.entry?.body===e.body?r.entry:r.entry={body:e.body,evaluator:Wu(e.body,n.environment)}).evaluator(a)}return e.kind===`Operator`?e.call(t.map(e=>U(e,n))):e.isLazy?e.evaluate(Xu(t,n),n):e.evaluate(t.map(e=>au(e,n)?iu(nu(e,n),n):U(e,n)),n)},pu=(e,t,n)=>e.reduce((e,r)=>{let i={name:r.name,binding:{kind:`Value`,value:!1},parent:e};return r.kind===`Function`?(i.binding={kind:`Thunk`,expression:{kind:`FunctionConstruction`,bounds:r.bounds,body:r.body,location:r.location,isRecursive:!0},scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1},i):r.params.length>0||n?.impure.has(r)?(i.binding={kind:`Operator`,operator:{kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:i}},i):(i.binding={kind:`Thunk`,expression:r.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(r)??!1},i)},t.scope),mu=(e,t,n)=>{let r=cl(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Jl(r,n);if(r?.kind===`Operator`){if(tu(r.operator)===0)return ru(r.operator,[],n);throw new _(`Operator ${e} is used without arguments`)}let i=su(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw wd(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Kl(i.definition,n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new _(`Unknown identifier ${e} at ${Xc(t)}`)},hu=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648,gu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),_u=(e,t)=>gu.has(e)||t.builtins.get(e)?.isStateLevel===!0,vu={builtins:gu,definitions:/* @__PURE__ */ new WeakMap},yu={builtins:new Set([...gu].filter(e=>e!==`Assert`)),definitions:/* @__PURE__ */ new WeakMap},bu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&yl(e,t),xu=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0;if(r!==void 0&&!z(e)){let e=hl(r,t),i=n.builtins.has(r)||t.builtins.get(r)?.isStateLevel===!0;if(!e&&i||e&&!bu(e,t)&&Su(e,t,n))return!0}return pi(e).some(e=>xu(e,t,n))},Su=(e,t,n=vu)=>{let r=n.definitions.get(e);if(r!==void 0)return r;n.definitions.set(e,!1);let i=xu(e.body,t,n)||e.kind===`Function`&&e.bounds.some(e=>xu(e.set,t,n));return n.definitions.set(e,i),i},Cu={builtins:/* @__PURE__ */ new Set([`UNION`,`\\cup`]),definitions:/* @__PURE__ */ new WeakMap},wu=(e,t)=>({impure:new Set(e.filter(e=>Su(e,t))),streamed:new Set(e.filter(e=>Su(e,t,Cu)))}),Tu=e=>[...e.definitions.values()].some(t=>Su(t,e)),Eu=e=>[...e.definitions.values()].some(t=>Su(t,e,yu)),Du=/* @__PURE__ */ new WeakMap,Ou=(e,t)=>{let n=Du.get(e);if(n!==void 0)return n;let r=Mu(e,t,Au);return Du.set(e,r),r},ku=/* @__PURE__ */ new Set([`Number`,`String`,`Identifier`,`Apply`,`And`,`Or`,`If`,`Case`,`SetEnumeration`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`FunctionApplication`,`FieldAccess`,`Product`,`SetFilter`,`SetMap`,`Forall`,`Exists`,`Choose`,`FunctionConstruction`,`Let`]),Au=/* @__PURE__ */ new Set,ju=(e,t,n)=>n.size===0?Ou(e,t):Mu(e,t,n),Mu=(e,t,n)=>{if(!ku.has(e.kind))return!1;if(e.kind===`Identifier`&&z(e))return n.has(e.name);if(z(e))return!1;if(e.kind===`Identifier`){let n=su(e.name,t);return n?.kind===`Value`||n?.kind===`Definition`&&bu(n.definition,t)}if(e.kind===`Apply`){if(_u(e.operator,t)||Cu.builtins.has(e.operator)||e.operator===`~>`)return!1;let r=Zl(e.operator,t);if(r?.kind!==`Builtin`&&r?.kind!==`Closure`)return!1;if(r.kind===`Closure`){let n=hl(e.operator,t);if(!n||!yl(n,t)||Su(n,t))return!1}return!(r.kind===`Closure`?r.params:[]).some(e=>e.arity>0)&&e.args.every(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&ju(e,t,n))}let r={value:!0};return Xo(e,(e,i)=>(r.value&&=ju(e,t,i.length===0?n:/* @__PURE__ */ new Set([...n,...i])),e)),r.value},Nu=e=>e.kind!==`Number`&&e.kind!==`String`&&e.kind!==`Identifier`,Pu=e=>{let t={value:void 0};return n=>{if(t.value!==void 0)return t.value;let r=e(n);return t.value=r,r}},Fu=(e,t)=>{if(e.kind===`Identifier`&&z(e))return!t.has(e.name);if(z(e))return!0;let n={value:!1};return Xo(e,(e,r)=>(n.value||=Fu(e,r.length===0?t:/* @__PURE__ */ new Set([...t,...r])),e)),n.value},Iu=(e,t)=>Ho.has(e)&&Nu(e)&&jd(e,t)!==void 0&&!Fu(e,Au),Lu=e=>typeof e==`object`&&e.kind===`FilteredSet`&&`rebind`in e,Ru=(e,t,n,r)=>i=>{r.expressions.push(e);let a=_r.sets,o=_r.callStack,s=a??[],c=s.length;_r.sets=s,_r.callStack=r;try{let a=t(i),o=Lu(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Jc(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=Yc(e,r.values),a=i&&!pi(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!N(a)?void 0:a;throw zu(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,_r.sets=a,_r.callStack=o}},zu=(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 _){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},Bu=(e,t,n)=>{if(!(n instanceof _))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}},Vu=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),Hu=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=Od(e,t),i=t.callStack,a=i?Ru(e,r,t,i):Nu(e)&&Ou(e,t)?Pu(r):Iu(e,t)?qu(r):r;return t.evaluators.set(e,a),a},Uu=/* @__PURE__ */ new WeakMap,Wu=(e,t)=>{if(t.callStack)return Hu(e,t);let n=Uu.get(e);if(n)return n;let r=(Nu(e)&&Ou(e,t)?void 0:aa(e,t))??Hu(e,t);return Uu.set(e,r),r},U=(e,t)=>Wu(e,t.environment)(t),Gu=(e,t)=>{let n=e.name,r=z(e)?void 0:su(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw wd(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`&&r.definition.kind===`Operator`){let e=r.definition;if(e.params.length===0&&yl(e,t))return t=>Kl(e,t);if(e.params.length===0){let n={body:void 0},r=r=>(n.body??=Wu(e.body,t),n.body(pl(r,void 0)));return Ku(e,t)?qu(r):r}return t=>Kl(e,t)}if(r?.kind===`Definition`){let e=r.definition,n=t=>Kl(e,t);return yl(e,t)||!Ku(e,t)?n:qu(n)}return t=>mu(n,e,t)},Ku=(e,t)=>jd(e.body,t)!==void 0&&(e.kind===`Operator`||e.bounds.every(e=>jd(e.set,t)!==void 0)),qu=e=>{let t={recent:void 0,recentValue:void 0,previous:void 0,previousValue:void 0};return n=>{let r=n.state;if(r!==void 0&&t.recent===r&&t.recentValue!==void 0)return t.recentValue;if(r!==void 0&&t.previous===r&&t.previousValue!==void 0)return t.previousValue;let i=e(n);return t.previous=t.recent,t.previousValue=t.recentValue,t.recent=r,t.recentValue=i,i}},Ju=(e,t)=>{let n=Zl(e,t);return n!==void 0&&tu(n)>0},Yu=(e,t)=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`&&!(e.kind===`Identifier`&&!z(e)&&Ju(e.name,t)),Xu=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>U(e,t),expression:e})),Zu=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(Xu(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&Yu(t[0],n)){let e=Hu(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&Yu(t[0],n)&&Yu(t[1],n);if(i&&a){let e=Hu(t[0],n),r=Hu(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(t.map(e=>au(e,n)?iu(nu(e,n),n):U(e,n)),n)},Qu=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw new _(`Operator ${e.name} expects ${e.params.length} arguments but received ${t.length}`)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:uu(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:nu(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},$u=()=>({calls:/* @__PURE__ */ new Map,size:0,state:void 0}),ed=/* @__PURE__ */ new WeakMap,td=e=>{let t=ed.get(e);if(t)return t;let n={constant:$u(),state:$u()};return ed.set(e,n),n},nd=e=>e.kind===`ExceptAt`||pi(e).some(nd),rd=/* @__PURE__ */ new WeakMap,id=(e,t)=>{let n=rd.get(e);if(n!==void 0)return n;let r=jd(e,t)!==void 0&&yc(e,Au),i=r&&[...new Set(nd(e)?[...r,`@`]:r)];return rd.set(e,i??!1),i??!1},ad=e=>typeof e!=`object`||e.kind===`ModelValue`||e.kind===`Set`||e.kind===`Function`||e.kind===`Interval`,W={sources:[],sourceCount:0,args:[],argCount:0,hash:0,isStateKeyed:!1},od=e=>typeof e==`object`&&e.kind===`ModelValue`?e.rank:Kr(e),sd=e=>ad(e)?(W.sources[W.sourceCount++]=void 0,W.args[W.argCount++]=e,W.hash=Lr(W.hash,od(e)),!0):!1,cd=(e,t,n)=>{if(!t)return!1;W.sources[W.sourceCount++]=e,W.isStateKeyed=!0;for(let e=0;e<t.length;e++){let r=cl(n,t[e]);if(r?.kind!==`Value`||!ad(r.value))return!1;W.args[W.argCount++]=r.value,W.hash=Lr(W.hash,od(r.value))}return!0},ld=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&hu(e.value))return()=>sd(e.value);if(e.kind===`Identifier`){let n=z(e)?void 0:su(e.name,t);if(n?.kind===`Value`)return()=>sd(n.value);if(n===void 0)return n=>{let r=cl(n.scope,e.name);return r?.kind===`Value`?sd(r.value):r?.kind!==`Thunk`||r.state!==n.state?!1:cd(r.expression,id(r.expression,t),r.scope)}}let n=id(e,t);return t=>cd(e,n,t.scope)},ud=e=>{if(e.args.length!==W.argCount||e.sources.length!==W.sourceCount)return!1;for(let t=0;t<W.sourceCount;t++)if(e.sources[t]!==W.sources[t])return!1;for(let t=0;t<W.argCount;t++)if(!Yt(e.args[t],W.args[t]))return!1;return!0},dd=e=>{if(e!==void 0){for(let t=0;t<e.length;t++)if(ud(e[t]))return e[t]}},fd=(e,t)=>{let n=hl(e.operator,t);if(n?.kind===`Operator`&&n.params.length>0&&n.params.every(e=>e.arity===0)&&!Su(n,t))return yl(n,t)?`constant`:Ku(n,t)?`state`:void 0},pd=(e,t,n,r)=>{let i=Qu(e,t,n),a={body:void 0},o=(t,r)=>(a.body??=Wu(e.body,n),a.body({environment:n,scope:t,state:r.state,next:r.next,isKeepLazy:r.isKeepLazy}));if(!r||t.length!==e.params.length)return e=>o(i(e),e);let s=td(e),c=t.map(e=>ld(e,n)),l={hits:0,misses:0};return e=>{if(e.isKeepLazy)return o(i(e),e);W.sourceCount=0,W.argCount=0,W.hash=t.length,W.isStateKeyed=!1;for(let t=0;t<c.length;t++)if(!c[t](e))return o(i(e),e);let n=r===`state`||W.isStateKeyed;if(n&&l.misses>1024&&l.hits<l.misses)return o(i(e),e);let a=n?s.state:s.constant;n&&a.state!==e.state&&(a.state=e.state,a.calls.clear(),a.size=0);let u=W.hash&1073741823,d=a.calls.get(u),f=dd(d);if(f)return n&&l.hits++,f.value;n&&l.misses++;let p=W.sources.slice(0,W.sourceCount),m=W.args.slice(0,W.argCount),h=o(i(e),e);if(a.size<65536){a.size++;let e={sources:p,args:m,value:h};d?d.push(e):a.calls.set(u,[e])}return h}},md=(e,t)=>{let n=e.args;if(e.operator===`=>`){let e=Hu(n[0],t),r=Hu(n[1],t);return t=>!ml(e(t),`the left side of =>`)||ml(r(t),`the right side of =>`)}if(e.operator===`~>`)return()=>{throw new _(`TLC cannot evaluate a temporal formula such as ~> in a state`)};let r=z(e)?void 0:Zl(e.operator,t);if(r?.kind===`Closure`){let i=t.callStack?void 0:fd(e,t);return pd(r,n,t,i)}if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=Hu(n[0],t),i=il(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=Hu(n[0],t);return Uo.has(e)||vl(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=Hu(n[0],t),a=Hu(n[1],t),o=al(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return Zu(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new _(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={entry:void 0},a=n.map(e=>uu(e,t));return r=>{let o=eu(e.operator,r);if(o)return fu(o,n,r,i,a);throw t.definitions.get(e.operator)?.kind===`Function`?new _(`${e.operator} is a function; apply it with brackets`):new _(`Unknown operator ${e.operator} at ${Xc(e)}`)}},hd=(e,t)=>{let n=e.kind===`Forall`,r=n?`the body of \\A`:`the body of \\E`,i=Hu(e.body,t),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name,o=Hu(a.set,t);return s=>Dl(Tl(o(s),a.set,t.runtime.version),t=>ml(i(pl(s,ll(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=>Hu(e.set,t));return s=>{let c=a.map((e,n)=>Tl(e(s),o[n].set,t.runtime.version)),l=(t,a)=>t<0?ml(i(pl(s,a)),r)!==n:Dl(c[t],n=>l(t-1,ll(a,e[t],n)));return l(o.length-1,s.scope)?!n:n}}return e=>Al(o,e,t=>ml(i(pl(e,t)),r)!==n)?!n:n},gd=(e,t)=>{if(e.kind===`Tuple`)return Wn(e.names.map(e=>{let n=cl(t,e);return n?.kind===`Value`&&n.value}));let n=cl(t,e.name);return n?.kind===`Value`?n.value:void 0},_d=/* @__PURE__ */ new WeakSet,vd=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&_d.add(e)},yd=(e,t)=>{let n=_d.has(e),r=Hu(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=Hu(a.set,t),c=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=Hn(e),o=Pt(i,i.map(e=>r(pl(t,ll(t.scope,n,e)))));return rt(e)?o:Rt(o)}let n=[],s=i.map(e=>El(U(e.set,t),e.set,t.environment.runtime.version));return kl(i,s,t.scope,e=>{let o=i.length===1?gd(a.pattern,e)??!1:Wn(i.map(t=>gd(t.pattern,e)??!1));return n.push([o,r(pl(t,e))]),!1}),Pn(n)},l=(t,n)=>{let a=Pl({value:Bl(t,e=>r(pl(n,Ml(i,n.scope,e))),zl(i,e.body,t)),bounds:i,body:e.body,scope:n.scope});return i.length===1?Rt(a):a},u=t.callStack;return t=>{let r=o?s(t):jl(i,t);if(e.isRecursive||n||t.isKeepLazy||!F(r))return l(r,t);if(!rt(r)){if(u)return l(r,t);try{return c(r,t)}catch(e){if(!(e instanceof _))throw e;return l(r,t)}}if(!u)return c(r,t);try{return c(r,t)}catch(t){throw Bu(u,e,t),t}}},bd=(e,t)=>{let n=_d.has(e);n&&vd(e.function);let r=Hu(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=>Hu(e,t))}),value:Hu(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Wn(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(pl(i,ll(i.scope,`@`,e))):Pr(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(oa.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Qc(e.function)}`)}return n}},xd=(e,t)=>{if(e.kind===`SetFilter`){let n=Hu(e.predicate,t),r=Hu(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:Zc(a)},s=(e,t)=>n=>ml(e(pl(t,ul(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},Hu(e.predicate,r))});return e=>{let t=r(e);return rt(t)?Nt(I(t).elements.filter(s(n,e))):c(t,e,n)}}if(e.kind===`SetMap`){let n=Hu(e.expression,t);return t=>{let r=[];return Al(e.bounds,t,e=>(r.push(n(pl(t,e))),!1)),kn(r)}}let n=e.set;if(!n)return()=>{throw new _(`TLC cannot evaluate an unbounded CHOOSE at ${Xc(e)}`)};let r=Hu(e.body,t),i=Hu(n,t);return t=>{let a=i(t);if(!M(a)||Tt(a))throw new _(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Qc(e)}`);let o={value:void 0},s=El(a,n,t.environment.runtime.version);if(Dl(s,n=>{let i=ul(t.scope,e.pattern,n);return ml(r(pl(t,i)),`the body of CHOOSE`)?(o.value=gd(e.pattern,i),!0):!1}),o.value===void 0)throw new _(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Qc(e)}`);return o.value}},Sd=e=>[...e].sort((e,t)=>At(e.name,t.name)),Cd=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),wd=(e,t)=>new l(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Qc(t)}`,e),Td=(e,t)=>e instanceof l&&t!==`1.7.4`?new _(`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,Ed=e=>new _(`A primed expression appears outside an action at ${Xc(e)}`),Dd=(e,t)=>{let n=Sd(e),r=Cd(n),i=n.map(e=>Hu(e.value,t));if(r)return e=>Gn(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=>lt(a,i.map(t=>t(e)),o):e=>Kt(a,i.map(t=>t(e)))},Od=(e,t)=>{let n=e=>Hu(e,t);switch(e.kind){case`Number`:{let t=e.value;return hu(t)?()=>t:()=>{throw sl(e)}}case`Decimal`:return()=>{throw ol(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return Gu(e,t);case`Apply`:return md(e,t);case`Bracket`:return()=>{throw new _(`A bracket without a function or subscript is not an expression at ${Xc(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new _(`An operator cannot be used as a value at ${Xc(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 tl(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 tl(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return n=>{if(!n.next)throw Ed(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=>qt(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 el(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 _(`A non-boolean expression (${Li(t)}) was used as a condition of a CASE. ${$c(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new _(`Attempted to evaluate a CASE with no conditions true.\n${Qc(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(pl(n,pu(e.definitions,n)))}case`Forall`:case`Exists`:return hd(e,t);case`UnboundedQuantifier`:return()=>{throw new _(`TLC cannot evaluate an unbounded quantifier at ${Xc(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return xd(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>kn(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Wn(t.map(t=>t(e)))}case`FunctionConstruction`:return yd(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 Dd(e.fields,t);case`RecordSet`:{let t=Sd(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 bd(e,t);case`ExceptAt`:return t=>{let n=cl(t.scope,`@`);if(n?.kind!==`Value`)throw new _(`@ appears outside an EXCEPT at ${Xc(e)}`);return n.value};case`FunctionApplication`:{vd(e.function);let r=n(e.function),i=t=>dl(r(fl(t)),e),a=e.args.map(n),o=rl(t.runtime.version);if(a.length===1){let e=a[0];return t=>jr(i(t),e(t),o)}return e=>jr(i(e),Wn(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=nl(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?ml(t(e),`an action`)||r(e):ml(t(e),`an action`)&&!r(e)}case`Enabled`:{let t=e.expression;return e=>Vc(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new _(`The subexpression reference at ${Xc(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw new _(`TLC cannot evaluate a temporal formula in a state at ${Xc(e)}`)}}},kd=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`Enabled`,`Always`,`Eventually`,`BoxAction`,`AngleAction`,`WeakFairness`,`StrongFairness`]),Ad=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},jd=(e,t)=>{let n=/* @__PURE__ */ new Set,r=/* @__PURE__ */ new Set,i=e=>{if(kd.has(e.kind))return!1;let a=Ad(e),o=(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`;if(a!==void 0&&!o&&!t.constants.has(a)){let e=t.substitutions.get(a)??a,o=t.definitions.get(e);if(!o&&_u(e,t))return!1;let s=t.variableIndex.get(a);if(s!==void 0&&n.add(s),o&&!r.has(o)&&(r.add(o),!i(o.body)||o.kind!==`Operator`&&!o.bounds.every(e=>i(e.set))))return!1}return pi(e).every(i)};return i(e)?[...n]:void 0},Md=`-------------------------------- MODULE Reals -------------------------------
81
75
  (***************************************************************************)
82
76
  (* This module provides dummy definitions of the operators that are *)
83
77
  (* defined by the real Reals module. It is expected that any tool that *)
@@ -94,7 +88,7 @@ EXTENDS Integers
94
88
  Real == "Reals"
95
89
  a / b == CHOOSE m \\in Real : m * b = a
96
90
  Infinity == CHOOSE i : (i \\notin Real) /\\ (\\A r \\in Real : i > r)
97
- =============================================================================`,Ud=`----------------------------- MODULE RealTime -------------------------------
91
+ =============================================================================`,Nd=`----------------------------- MODULE RealTime -------------------------------
98
92
  (***************************************************************************)
99
93
  (* This standard module is described in Chapter 9 of the book "Specifying *)
100
94
  (* Systems". The type of specification described there cannot be handled *)
@@ -120,7 +114,7 @@ RTnow(v) == LET NowNext == /\\ now' \\in {r \\in Real : r > now}
120
114
  IN /\\ now \\in Real
121
115
  /\\ [][NowNext]_now
122
116
  /\\ \\A r \\in Real : WF_now(NowNext /\\ (now'>r))
123
- =============================================================================`,Wd=`----------------------------- MODULE Toolbox --------------------------------
117
+ =============================================================================`,Pd=`----------------------------- MODULE Toolbox --------------------------------
124
118
  (***************************************************************************)
125
119
  (* *)
126
120
  (***************************************************************************)
@@ -146,7 +140,7 @@ _TEPosition ==
146
140
  THEN _TETraceLength
147
141
  ELSE IF TLCGet("level") = 0 THEN 1 ELSE TLCGet("level")
148
142
 
149
- =============================================================================`,Gd=/* @__PURE__ */ new Map([[`Reals`,Hd],[`RealTime`,Ud],[`Toolbox`,Wd]]),Kd=`tlc2/value/impl/`,qd=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)}},Jd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),Yd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Xd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Jd.get(e[3])}${`[]`.repeat(e[1].length)}`),Zd=(e,t)=>e[e[t].first].text,Qd=(e,t)=>Zd(e,t).replaceAll(`/`,`.`),$d=e=>{let t=qd(e);if(t.readUint32()!==3405691582)throw new u(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===1?a.text=i.decode(t.readBytes(t.readUint16())):r===3?a.value=t.readInt32():r===4?t.readUint32():r===5||r===6?(t.readBytes(8),e++):r===7||r===8||r===16||r===19||r===20?a.first=t.readUint16():r===15?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=Qd(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=Xd(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:qd(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()},()=>Qd(n,d.readUint16())):[],p=Yd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Xd(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}},ef=(e,t)=>{let n=e[t],r=e[n.second];return{className:Zd(e,n.first),name:e[r.first].text}},tf=(e,t,n,r)=>{let i=()=>new C(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=ef(t,l());if(n.className!==`${Kd}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=ef(t,l()),a=s();if(n.className!==`${Kd}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:Zd(t,l()),value:void 0}),e+=3;else if(n===183){let n=ef(t,l()),a=s(),o=s();if(!(n.className===`${Kd}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},nf=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=$d(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:tf(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)}))}},rf=/* @__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(`,`),af=[[`\\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`,`≀`],[`^+`,`⁺`]],of=/* @__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(`,`),sf=/* @__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(`.`),cf=/* @__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(`.`),lf=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),uf=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
143
+ =============================================================================`,Fd=/* @__PURE__ */ new Map([[`Reals`,Md],[`RealTime`,Nd],[`Toolbox`,Pd]]),Id=`tlc2/value/impl/`,Ld=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)}},Rd=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),zd=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],Bd=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??Rd.get(e[3])}${`[]`.repeat(e[1].length)}`),Vd=(e,t)=>e[e[t].first].text,Hd=(e,t)=>Vd(e,t).replaceAll(`/`,`.`),Ud=e=>{let n=Ld(e);if(n.readUint32()!==3405691582)throw new t(`A module override is not a class file`);n.readUint16(),n.readUint16();let r=[],i=n.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let t=n.readUint8(),i={tag:t,text:``,value:0,first:0,second:0};r[e]=i,t===1?i.text=a.decode(n.readBytes(n.readUint16())):t===3?i.value=n.readInt32():t===4?n.readUint32():t===5||t===6?(n.readBytes(8),e++):t===7||t===8||t===16||t===19||t===20?i.first=n.readUint16():t===15?(n.readUint8(),i.first=n.readUint16()):(i.first=n.readUint16(),i.second=n.readUint16())}n.readUint16();let o=Hd(r,n.readUint16());n.readUint16(),n.readBytes(n.readUint16()*2);for(let e=n.readUint16();e>0;e--){n.readBytes(6);for(let e=n.readUint16();e>0;e--)n.readUint16(),n.readBytes(n.readUint32())}let s=[];for(let e=n.readUint16();e>0;e--){let e=n.readUint16(),t=r[n.readUint16()].text,i=r[n.readUint16()].text,a=i.indexOf(`)`),c=Bd(i.slice(1,a)),l=Array.from({length:n.readUint16()},()=>({name:r[n.readUint16()].text,reader:Ld(n.readBytes(n.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>Hd(r,d.readUint16())):[],p=zd.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=Bd(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:t,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${t}(${c.join(`,`)})${h}`})}return{pool:r,methods:s}},Wd=(e,t)=>{let n=e[t],r=e[n.second];return{className:Vd(e,n.first),name:e[r.first].text}},Gd=(e,t,n,r)=>{let i=()=>new y(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===3)return n.value;if(n.tag===8)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=2&&n<=8)o.push(n-3),e+=1;else if(n===16)o.push(a[e+1]<<24>>24),e+=2;else if(n===17)o.push(l()<<16>>16),e+=3;else if(n===18)o.push(c(a[e+1])),e+=2;else if(n===19)o.push(c(l())),e+=3;else if(n===89){let t=s();o.push(t,t),e+=1}else if(n===178){let n=Wd(t,l());if(n.className!==`${Id}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===184){let n=Wd(t,l()),a=s();if(n.className!==`${Id}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===187)o.push({className:Vd(t,l()),value:void 0}),e+=3;else if(n===183){let n=Wd(t,l()),a=s(),o=s();if(!(n.className===`${Id}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===176){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},Kd=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Ud(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:Gd(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)}))}},qd=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Jd=[[`\\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`,`≀`],[`^+`,`⁺`]],Yd=/* @__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(`,`),Xd=/* @__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(`.`),Zd=/* @__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(`.`),Qd=/* @__PURE__ */ new Set([`Bags`,`Json`,`Randomization`,`TLCExt`]),$d=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
150
144
  Nat == { }
151
145
  a+b == {a, b}
152
146
  a-b == CHOOSE n : b + n = a
@@ -462,9 +456,9 @@ _CheckName(name) ==
462
456
  => (PrintT(counts) /\\ FALSE)
463
457
  _PrintCounts == PrintT(_Counts)
464
458
  =============================================================================
465
- `]]),df=/* @__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)`]])]]),ff=A(`EOF`),pf=A(`IDENTIFIER`),mf=A(`DEFBREAK`),hf=(e,t)=>Array.from({length:A(t)-A(e)+1},(t,n)=>A(e)+n),gf=new Set(hf(`op_57`,`op_119`)),_f=new Set(hf(`op_1`,`op_119`)),vf=new Set(hf(`op_57`,`op_70`)),yf=/* @__PURE__ */ new Set([...hf(`ACTION`,`EXCEPT`),A(`EXTENDS`),...hf(`IF`,`SF`),A(`STATE`),...hf(`THEN`,`WITH`),A(`US`),...hf(`op_112`,`op_116`)]),bf=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),xf=new Map([...bf(`postfix`,160,160,!0,`[`),...bf(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...bf(`prefix`,120,120,!1,`-.`),...bf(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...bf(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...bf(`prefix`,40,40,!0,`\\lnot`),...bf(`nfix`,100,130,!0,`\\times`),...bf(`infix`,140,140,!1,`^`,`^^`),...bf(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...bf(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...bf(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...bf(`infix`,100,110,!0,`|`,`||`,`%%`),...bf(`infix`,100,110,!1,`%`),...bf(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...bf(`infix`,90,140,!1,`\\wr`),...bf(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...bf(`infix`,90,130,!1,`!!`),...bf(`infix`,90,90,!1,`...`,`..`),...bf(`infix`,80,80,!0,`\\intersect`,`\\union`),...bf(`infix`,80,80,!1,`\\`),...bf(`infix`,70,70,!1,`<:`,`:>`),...bf(`infix`,60,60,!0,`@@`),...bf(`infix`,50,140,!0,`\\cdot`),...bf(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...bf(`infix`,30,30,!0,`\\land`,`\\lor`),...bf(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...bf(`infix`,10,10,!1,`=>`)]),Sf=new Map([...xf,...af.flatMap(e=>e.slice(1).map(t=>[t,xf.get(e[0])]))]),Cf=Sf.get(`[`),wf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Tf=e=>({type:`tokens`,kinds:new Set(e)}),Ef=e=>typeof e==`string`?e.startsWith(`<`)?Tf([A(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(Ef)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),Df=e=>(...t)=>({type:e,body:G(...t)}),q=Df(`zeroOrMore`),Of=Df(`oneOrMore`),J=Df(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),kf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Af=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=kf(e,n);return n},jf=(...e)=>{let t=e.map(A);return e=>t.includes(Af(e,1).kind)},Mf=(e,t=Af(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Nf=e=>{let t=Af(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Pf=e=>jf(`CASESEP`)(e)&&Mf(e),Ff=e=>{let t=Af(e,1);yf.has(t.kind)&&(t.kind=pf)},If=(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}`,Lf=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Rf=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},zf=e=>e.operatorStacks[e.operatorStacks.length-1],Bf=(e,t)=>e.low>t.high,Vf=(e,t)=>e.high<t.low,Hf=e=>e.fix===`prefix`?e:Sf.get(`${e.name}.`),Uf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Cf?Lf(`FcnAppl`,[n,...r.node.heirs]):Lf(`PostfixExpr`,[n,r.node]),operator:void 0})},Wf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Lf(`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:Lf(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Gf=e=>{let t=zf(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 Uf(t,n),Gf(e);if(i.operator!==void 0){let t=Hf(r.operator);return t!==void 0&&Bf(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${If(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 ${If(e,a.node.first,a.node.last)} and expression at location ${If(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Vf(a.operator,r.operator)?void 0:Bf(a.operator,r.operator)?(Wf(t,a.operator),Gf(e)):`Precedence conflict between ops ${a.operator.name} in block ${If(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Hf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Vf(s,r.operator))return;if(!Bf(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${If(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Wf(t,s),Gf(e);let c=If(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===wf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Kf=e=>Y(t=>{let n=zf(t),r=Rf(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:Gf(t)}),qf=Kf(()=>!1),Jf=Kf(()=>!0),Yf=Y(e=>{e.lastOperator=Sf.get(e.token.image)}),Xf=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Zf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Xf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Qf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Mf(e,n.first.beginColumn))return n;let t=Qf(e,n);if(t!==void 0)return t}},$f=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(A),n=(e,...t)=>t.some(t=>e.kind===A(t)),r=e=>e!==void 0&&gf.has(e.kind),i=e.token,a=kf(e,i);i.next=void 0;let o=kf(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===pf&&(e=e.next)}else if(e.kind===pf){let t=e.next;!r(t)||vf.has(t.kind)||_f.has(t.kind)&&t.next?.kind!==pf||(e=t.next?.kind===A(`SUBSTITUTE`)?i:_f.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==mf&&(e.next={kind:mf,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=kf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},ep=e=>{let t=Af(e,1);if(t.kind===A(`LAB`)){let n=1;for(;n!==0;)if(t=kf(e,t),t.kind===A(`LAB`)&&n++,t.kind===A(`RAB`)&&n--,t.kind===ff)return!1;return kf(e,t).kind===A(`IN`)}if(t.kind!==pf)return!1;for(t=kf(e,t);t.kind===A(`COMMA`);){if(t=kf(e,t),t.kind!==pf)return!1;t=kf(e,t)}return t.kind===A(`IN`)},tp=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),np=e=>e.proofLevels.at(-1)??-1,rp=e=>{let t=Af(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:jf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||np(e)>=0&&tp(t)>np(e):jf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},ip=(e,t)=>{let n=tp(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},ap=e=>Y(t=>ip(t,t.token)?void 0:`${If(t,t.token)}: ${e}`),op=Tf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(A)),sp=Tf([...op.kinds,A(`op_76`)]),cp=Tf(_f),lp=Tf(vf),up=Tf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(A)),dp=()=>q(Z({expansion:[K(op,`<op_77>`)],semantic:Mf}),K(`PrefixOp`,`InfixOp`),Jf),fp=()=>K(G(Z({expansion:[`OpenStart`],semantic:Mf}),`OpenExpression`,qf),G(Z({semantic:Mf}),`ExtendableExpr`)),pp=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),mp=()=>K(G(Z({semantic:e=>jf(`ASSUME`,`BOXASSUME`)(e)||Af(e,2).kind===A(`COLONCOLON`)&&[A(`ASSUME`),A(`BOXASSUME`)].includes(Af(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),hp=()=>[`JuncItem`,q(Z({semantic:Nf}),`JuncItem`)],gp=e=>Y(t=>{t.expecting=e,Ff(t)}),_p=e=>Y(t=>{t.isTerminalProof=e}),vp=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{$f(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),yp={CompilationUnit:Q(void 0,[Y($f),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),gp(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,gp(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,gp(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y($f)),G(Z({semantic:e=>jf(`USE`)(e)&&Af(e,2).kind!==A(`ONLY`)||jf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(vp(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),vp(`Expression`,Z({expansion:[`<IDENTIFIER>`,lp]}),`PostfixLHS`,`Expression`),vp(`Expression`,Z({expansion:[`<IDENTIFIER>`,cp]}),`InfixLHS`,`Expression`),vp(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),vp(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[sp,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,cp,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,lp]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,gp(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[op,Yf]),NonExpPrefixOp:Q(void 0,[sp,Yf]),InfixOp:Q(`Infix Op`,[cp,Yf]),PostfixOp:Q(void 0,[lp,Yf]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{$f(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),mp(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),mp(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=Rf(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${If(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y($f),K(G(Z({amount:3}),Z({semantic:jf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:rp}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>jf(`BY`)(e)||Af(e,2).kind===A(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>Af(e,2).kind!==A(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,_p(!0),J(`<ONLY>`)),G(`<USE>`,_p(!1),J(`<ONLY>`)),G(`<HIDE>`,_p(!1))),X("an expression, `MODULE' or `DEF'"),J(pp(),q(`<COMMA>`,X(`MODULE or expression`),pp(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),pp(),q(`<COMMA>`,X(`MODULE or expression`),pp(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),up,ap(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:rp}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),up,ap(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:jf(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:jf(`INSTANCE`)}),`Instantiation`),G(Z({semantic:jf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:rp}),Y(e=>{let t=Rf(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${If(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),Of(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:jf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(sp,cp,lp),Tf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(A))],semantic:Mf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${If(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Mf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:ep}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),Of(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=Rf(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),Of(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:ep}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>Af(e,2).kind===A(`MAPTO`)&&yf.has(Af(e,1).kind)}),Y(e=>{Af(e,1).kind=pf}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=Lf(`FcnAppl`,t.heirs),e.lastOperator=Cf})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,Of(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Ff),`Identifier`),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===A(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>Pf(e)&&Af(e,2).kind!==A(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Pf}),`<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`,[Of(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=Af(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...hp()),G(Z({expansion:[`<AND>`]}),...hp())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Qf(t,e.heirs[1]);return n&&`Item at ${If(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${If(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),dp(),fp()],(e,t)=>{let n=zf(t);n.push({node:e.heirs[0],operator:wf});let r=Gf(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),qf,q(K(G(Z({expansion:[`PostfixOp`],semantic:Mf}),`PostfixOp`,Jf),G(Z({expansion:[`<DOT>`],semantic:Mf}),`<DOT>`,Y(Ff),Z({semantic:Mf}),`Identifier`,Y(e=>{let t=zf(e);t[t.length-1].operator!==void 0&&Uf(t,t.length),t[t.length-1]={node:Lf(`RecordComponent`,[t[t.length-1].node,Rf(e,2),Rf(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Mf}),X(`function argument`),`SBracketCases`,Kf(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Mf}),`InfixOp`,Jf,dp(),fp()),G(Z({expansion:[`<COLONCOLON>`],semantic:Mf}),`<COLONCOLON>`,Y(e=>{let t=zf(e);if(!Zf(t[t.length-1].node))return`\`::' at ${If(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=zf(e),n=Rf(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Vf(r,e.lastOperator)){let t=Rf(e,3);return`Removing label at ${If(e,t.first,t.last)} would change expression parsing.`}t.push({node:Lf(`Label`,[Rf(e,3),Rf(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Mf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Mf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>np(e)<0&&e.proofLevels.length<=1?`${If(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${If(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Xf(e.heirs)===void 0?e.heirs.length===1?Lf(`GeneralId`,e.heirs):void 0:Lf(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>Af(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>Af(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${If(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},bp=/* @__PURE__ */ new Map,xp=e=>{let t=bp.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=xp(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,xp(yp[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 bp.set(e,n),n},Sp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},Cp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=kf(e,e.scanPosition)),e.scanPosition=kf(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`},wp=(e,t)=>{if(t.type===`tokens`)return Cp(e,t.kinds);if(t.type===`call`)return wp(e,yp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Sp(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=wp(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||Sp(e,t.semantic)?wp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=wp(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=wp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Tp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=wp(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},Ep=(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||xp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!xp(a).hasSemanticStart?xp(a).first.has(Af(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Tp(e,i,a)&&(o===void 0||o(e))}),Dp=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,wp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=kf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===ff){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=kf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${qe(e.token.image)}" `},Op=(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??Dp(e)}\n\nResidual stack trace follows:\n${r}`,!1},kp=(e,t)=>{let n=kf(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,Op(e))},Ap=(e,t)=>{let n=yp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Af(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!jp(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 Op(e,i);let a=r.node??(r.heirs.length===0?void 0:Lf(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},jp=(e,t)=>{if(t.type===`tokens`)return kp(e,t.kinds);if(t.type===`call`)return Ap(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Op(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Op(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||jp(e,t));if(t.type===`choice`){let n=Ep(e,t.alternatives);return n===-1?Op(e):jp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!jp(e,t.body))return!1;if(t.type===`optional`)return Ep(e,[t.body])===-1||jp(e,t.body);for(;Ep(e,[t.body])===0;)if(!jp(e,t.body))return!1;return!0},Mp=e=>{let t=Ge(e),n={kind:ff,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=jp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},Np={low:15,high:15},Pp={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Fp=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),Ip=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Lp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Rp=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),zp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Bp=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),Vp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Ip]),Hp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Fp.has(e.operator):Ip.has(e.operator)),Up=e=>Fp.has(e)||Ip.has(e)||e===`-.`,Wp=(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}}},Gp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Kp=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),qp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Jp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Yp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Xp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Zp=/* @__PURE__ */ new Set([``,`*`,`-`]),Qp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),$p=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),em=/* @__PURE__ */ new Set([`NEW`,...$p.keys()]),tm=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),nm=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),rm=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),im=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
466
- `)}\n`},am=(e,t)=>{let n=t===`tlapm`,r=n?Ce(e):Ce(e).map(xe),i={index:0,offsideColumns:[]},a={},o=[],s=/* @__PURE__ */ new Set,c=[],l=[],d=e=>o[o.length-1].has(e),f=e=>({line:e.line,column:n&&e.kind===`String`?e.endColumn:e.column,range:void 0}),m=[],h=[],_=[],v=(e,t=i.index-1)=>{let n=e===t?_[e]:void 0;if(n)return n;let a=r[t];m[e]??=f(r[e]),h[t]??={line:a.line,column:a.endColumn};let o={module:l[0].name,start:m[e],end:h[t]};return e===t&&(_[e]=o),o},y=(e,t)=>(e.location.range=v(t),e),b=(e=0)=>r[Math.min(i.index+e,r.length-1)],x=(e=0)=>{let t=b(e),n=i.offsideColumns[i.offsideColumns.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ee=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),te={index:0},S=e=>{let t=r.slice(te.index,i.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>n&&(e.kind===`Keyword`||rm.has(e.text)),re=e=>{let t=r.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Xp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(e,t=b(),n)=>{let i=r[r.length-1],a=t.line===i.line&&t.column===i.column;return new u(`${e} at line ${t.line}, column ${t.column}`,void 0,ae(e,t,a,n))},ae=(e,t,i,a)=>{if(n&&i){let e=r[r.length-1];return{reason:`Unexpected EOF`,...S(re(e)),isEnd:i}}return n&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:i}:{reason:e,line:t.line,column:t.column,isEnd:i}},oe=(e,t=b())=>C(e,t,t),se=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw C(`Unexpected end of expression`);return i.index++,e},E=e=>w(e)?(i.index++,!0):!1,D=e=>{if(!w(e))throw oe(`Expected ${JSON.stringify(e)} but found ${ee(x())}`);return T()},ce=()=>{let e=x();if(e.kind!==`Identifier`)throw oe(`Expected an identifier but found ${ee(e)}`);if(ne(e))throw oe(`Unexpected keyword ${e.text}`);return i.index++,e.text},le=()=>{let e=i.index;return{name:ce(),range:v(e)}},ue=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),de=()=>{let e=x();return e.kind!==`String`&&(Rp.has(e.text)||Fp.has(e.text)||Ip.has(e.text)||e.text===`'`)?(i.index++,e.text):ce()},fe={isUsed:!1},me=()=>x().kind===`Identifier`||!se(x())?ce():(fe.isUsed=!0,T().text),he=e=>{if(!n)return e();i.offsideColumns.push(-1);let t=e();return i.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},ge=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},_e=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},ve=()=>{if(!E(`<<`)){let e=le();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ue(O(le));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},ye=()=>O(()=>{let e=O(ve);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),be=()=>{let e=x();if(e.kind===`Identifier`){let t=i.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(ce());return y({kind:`Identifier`,name:n.join(`!`),location:f(e)},t)}if(w(`<<`)||w(`(`))return Fe();throw oe(`Expected a subscript but found ${ee(e)}`)},Se=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,Ip.has(n.text)?3:4))},we=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&Kp.has(t.text)||Se(e)},k=()=>{let e=x(),t=e.kind===`Operator`&&(Fp.has(e.text)||Lp.has(e.text))&&we(e);if(n&&e.kind!==`String`&&(Lp.has(e.text)||Vp.has(e.text)&&e.text!==`'`&&!Ip.has(e.text)||Bp.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&we(e))throw C(`incomplete expression`,e);if(t)return i.index++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:f(e)},i.index-1);if(e.kind!==`String`&&Vp.has(e.text)&&we(e)){i.index++;let t=f(e);if(Ip.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},i.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Wp(e.text,n,t),operator:e.text,location:f(e)},i.index-1)}if(w(`LAMBDA`)){let t=i.index;T();let n=ue(O(le));D(`:`);let r=j();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:f(e)},t)}return j()},Te={range:void 0},A=()=>he(()=>{let e=i.index;D(`(`);let t=O(k);return D(`)`),Te.range=v(e),t}),Ee=()=>{let e=T();i.offsideColumns.push(e.column);let t=[j()];for(;b().text===e.text&&b().column===e.column;)i.index++,t.push(j());return i.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:f(e)}},De=e=>he(()=>{let t=f(e),r=x().kind===`Identifier`,a=w(`|->`,1)&&(r||se(x()));if(a||r&&w(`:`,1)){let e=a?`Record`:`RecordSet`,n=e=>{let t=i.index,n=f(x()),r=e();return n.range=v(t),D(a?`|->`:`:`),{name:r,value:j(),location:n}},o=[n(()=>r?ce():T().text),...E(`,`)?O(()=>n(ce)):[]];return D(`]`),{kind:e,fields:o,location:t}}if(ge()){let e=ye();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let o=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!se(x()))throw oe(`Expected a field name but found ${ee(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!n&&!w(`]_`)){let e=[o];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:o,subscript:be(),location:t}}),Oe=()=>{let e=i.index,t=y(Le(),e),n=f(T());return y({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},ke=e=>he(()=>{let t=f(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ge()&&(x(1).text===`\\in`||w(`<<`))){let e=i.index,n=ve();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}i.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Oe():j();if(E(`:`)){let e=ye();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ae=e=>{let t=f(e),n=he(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:be(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},je=e=>{let t=f(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ge()){let e=ye();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=ue(O(le));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Me=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:f(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:f(e)}},Ne=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Gp.has(e.text)||e.kind===`Operator`&&(Fp.has(e.text)||Ip.has(e.text)||Lp.has(e.text)))},Pe=()=>{let e=T();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return i.index--,{kind:`Bound`,args:A()}}return{kind:`Name`,name:e.text,args:w(`(`)?A():[]}},Fe=e=>{let t=i.index,r=T(),s=f(r);if(n&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=O(ce);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:s}}if(r.kind===`Number`){if(n&&/^\\[BOH]/.test(r.text))throw C(`incomplete expression`,r);return{kind:`Number`,value:pe(r.text),text:r.text,location:s}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:s};if(r.kind===`String`)return{kind:`String`,value:r.text,location:s};let c=r.kind===`Step`&&et(r);if(c&&Ze()<0&&Xe.length<=1)throw C(`Step number used outside proof`,r);if(c&&r.text[1]===`+`)throw C(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||c){let o=c?tt(r)??r.text:r.text;if(_e()){let t=ue(E(`(`)?O(le):[]);t.names.length>0&&D(`)`),D(`::`);let i=j();if(!n&&e!==void 0&&a.last!==void 0&&Hp(i)&&e.high>=a.last.low)throw C(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:o,params:t.names,paramRanges:t.ranges,body:i,location:s}}let l=w(`(`);if(o===`@`&&!l&&!Ne())return{kind:`ExceptAt`,location:s};let u=l?A():[],d=[l?Te.range:void 0];if(!Ne())return l?{kind:`Apply`,operator:o,args:u,argumentsRange:Te.range,location:s}:{kind:`Identifier`,name:o,location:s};let f=[{kind:`Name`,name:o,args:u}],p=[v(t,t)];for(;Ne();)T(),p.push(v(i.index,i.index)),Te.range=void 0,f.push(Pe()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),y=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:s}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:s}:_.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:h,args:g,argumentCounts:_,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}:{kind:`Apply`,operator:h,args:g,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:s}}if(r.kind===`Operator`&&Up(r.text)&&w(`(`))return{kind:`Apply`,operator:r.text,spelling:r.spelling,args:A(),location:s};if(r.kind===`Operator`&&Up(r.text)&&!n)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:s};switch(r.text){case`(`:{let e=he(()=>j());return D(`)`),e}case`[`:return De(r);case`{`:return ke(r);case`<<`:return Ae(r);case`@`:return{kind:`ExceptAt`,location:s};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return je(r);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:s}}case`CASE`:return Me(r);case`LET`:{let e=[],t=[];for(o.push(/* @__PURE__ */ new Set);!E(`IN`);){if(n&&w(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,S(b()));if(E(`RECURSIVE`)){qe();continue}let r=Be(!1);r.kind===`Instance`?t.push(r):e.push(r)}o.pop();let r=j();return t.length===0?{kind:`Let`,definitions:e,body:r,location:s}:{kind:`Let`,definitions:e,instances:t,body:r,location:s}}case`CHOOSE`:{let e=ve(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:s}}case`WF_`:case`SF_`:{let e=be(),t=he(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:s}}}throw oe(`Unexpected ${ee(r)}`,r)},Ie=(e,t,r)=>{a.last=a.preceding={low:t,high:r};let i=j(r+1),o=x(),s=o.text===`'`||Ip.has(o.text)?Np.high:Fp.get(o.text)?.high;if(!n&&o.kind===`Operator`&&s!==void 0&&s>=t)throw C(`Precedence conflict between ${e.text} and ${o.text}`,o);return i},Le=()=>{let e=a.preceding;a.preceding=void 0;let t=x(),r=f(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ee();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Ie(t,4,4)],location:r};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Ie(t,12,12)],location:r};case`[]`:return T(),{kind:`Always`,expression:Ie(t,4,15),location:r};case`<>`:return T(),{kind:`Eventually`,expression:Ie(t,4,15),location:r};case`ENABLED`:return T(),{kind:`Enabled`,expression:Ie(t,4,15),location:r};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Ie(t,4,15),location:r};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[n?j(9):Ie(t,10,13)],location:r}}return Fe(e)},j=(e=0)=>{let t=i.index,n=Le(),r={left:n.location.range?n:y(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=f(n);if(n.text===`'`&&e<=15){T(),a.last=Np,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(Ip.has(n.text)&&e<=15){T(),a.last=Np,r.left=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=he(()=>O(()=>j()));he(()=>D(`]`)),a.last=Pp,r.left=y({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&se(x(1))){T();let e=T().text;r.left=y({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let o=Fp.get(n.text);if(!o||o.low<e)break;let s=r.previous;if(s){let e=!(s.low>o.high||s.high<o.low),t=s.text===n.text&&o.isAssociative;if(e&&!t&&(s.text!==`\\X`||n.text!==`\\X`))throw C(`Precedence conflict between ${s.text} and ${n.text}`,n)}if(T(),o.low>12&&w(`-`))throw C(`Precedence conflict between ${n.text} and -`,x());a.last=a.preceding=o;let c=j(o.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[v(t).end];r.left=l.kind===e&&s?.text===n.text?{...l,operands:[...l.operands,c],prefixEnds:[...l.prefixEnds??[],...a]}:{kind:e,operands:[l,c],prefixEnds:a,location:i}}else r.left=n.text===`\\X`?l.kind===`Product`&&s?.text===`\\X`?{...l,factors:[...l.factors,c]}:{kind:`Product`,factors:[l,c],location:i}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[l,c],location:i};r.left=y(r.left,t),r.previous={...o,text:n.text}}return r.left},Re=()=>{if(!E(`(`))return[];let e=Ke();return D(`)`),e},ze=()=>{let e=f(x()),t=j(),n=r[i.index-1],a={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:l[0].name,start:e,end:a}}},Be=e=>{let t=i.index;return y(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=x(),n=f(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...ze(),isLocal:e,isRecursive:d(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&Fp.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=le(),t=T().text,n=le();return D(`==`),r(t,[Ve(e),Ve(n)])}let a=t.kind!==`String`&&Rp.has(t.text),o=t.kind===`Identifier`&&Ip.has(x(1).text)&&w(`==`,2);if(a||o){let e=a?t.text:x(1).text;a&&T();let n=le();return o&&T(),D(`==`),r(e,[Ve(n)])}let s=ce();if(E(`[`)){let t=he(()=>ye());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:d(s),location:n}}let c=i.index,l=Re();return D(`==`),w(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:v(c)}:r(s,l)},Ue=(e,t,n,r)=>{let a=i.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:E(`WITH`)?O(()=>{let e=i.index,t=de(),n=v(e);return D(`<-`),{name:t,nameRange:n,expression:k()}}):[],isLocal:n,location:r,instanceRange:v(a)}},We=()=>{let e=i.index;return y(Ge(),e)},Ge=()=>{let e=f(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=ce();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Ke=()=>O(We),qe=()=>{let e=Ke();return e.forEach(e=>o[o.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&tm.has(e.text)&&t.value++,e.kind===`Operator`&&nm.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Je(1)):t.kind===`Operator`&&Ip.has(t.text)?w(`==`,2):t.kind===`Operator`&&Fp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&Rp.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!Zp.has($e(e)),tt=e=>{let t=$e(e);if(Zp.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return Jp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},rt=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},M=e=>!s.has(e)&&l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),it=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!rm.has(e.name)&&!M(e.name):!1,at=()=>{let e=x();return e.kind===`Step`?et(e):e.kind===`Keyword`?Qp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},ot=()=>{let e=i.index,t=x();return t.kind===`Operator`&&!zp.has(t.text)&&Up(t.text)?(i.index++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:f(t)},e)):E(`MODULE`)?y({kind:`ModuleFact`,name:ce(),location:f(t)},e):j()},st=e=>c[c.length-1]?.add(e),ct=e=>{c.push(/* @__PURE__ */ new Set);let t=e();return c.pop(),t},lt=e=>c.some(t=>t.has(e))||l.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ut=()=>{let e=i.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw oe(`Expected a definition name but found ${ee(e)}`,e);return i.index++,e.text},`!`),r=f(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},dt=()=>{if(n)return O(ut);let e=O(ot),r=t===`tlc`?e.find(e=>e.kind===`Identifier`&&lt(e.name)):void 0;if(r)throw C(`DEF clause entry should describe a defined operator`,r.location);return e},N=()=>({facts:at()?O(ot):[],defs:E(`DEF`)||E(`DEFS`)?dt():[]}),ft=()=>{let e=i.index,n=T(),r=n.text===`USE`&&E(`ONLY`),a=v(e),o={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,...N(),keyword:a,location:f(n)},s=o.kind===`Hide`&&t===`tlc`?o.facts.filter(e=>!it(e)):[];if(s.length>0)throw p(s.map(t=>({location:g(t.location.range??v(e)),message:`The only expression allowed as a fact in a HIDE is
467
- the name of a theorem, assumption, or step.`})));return y(o,e)},P=()=>{let e=i.index,t=f(x()),n=E(`NEW`),r=x().kind===`Keyword`?$p.get(x().text):void 0;if(!n&&r===void 0)throw oe(`Expected a declaration but found ${ee(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=le();return st(n.name),y({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let a=We();st(a.name);let o=(r??`Constant`)===`Constant`&&w(`\\in`);if(o&&a.arity>0)throw C(`declared symbol with arguments before \\in`);return o&&T(),y({kind:`NewSymbol`,name:a.name,arity:a.arity,level:r??`Constant`,set:o?j():void 0,nameRange:a.location.range,location:t},e)},F=()=>{let e=i.index,t=f(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?ct(F):x().kind===`Keyword`&&em.has(x().text)?P():j());return D(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},pt=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},mt=(e,t)=>{e.forEach(st),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(st))},ht=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return ft();if(w(`INSTANCE`)){let t=i.index;return y(Ue(void 0,[],!1,f(e)),t)}if(w(`DEFINE`)||Ye()){let t=i.index;E(`DEFINE`);let n=[Be(!1)];for(;Ye();)n.push(Be(!1));let r={kind:`Define`,definitions:n,location:f(e)};return y(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=ge(),t=ue(e?[]:O(le)),n=e?ye():[];return mt(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=pt(`:`),t=ue(e?O(le):[]),n=e?[]:ye();return mt(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?F():j()}},gt=e=>{let t=x();if(t.kind!==`Step`)throw oe(`Expected a step number but found ${ee(t)}`,t);if(!rt(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return i.index++,{name:tt(t),token:t.text,location:f(t)}},_t=()=>{let e=i.index,t=gt(w(`QED`,1)),n=i.index,r=/* @__PURE__ */ new Set;c.push(r);let a=E(`QED`)?{kind:`Qed`}:ht(),o=v(e),s=v(n),l=nt(x());if(l&&!Yp.has(a.kind))throw C(`Proof of a step that does not take a proof`);let u=l?yt():void 0;return c.pop(),(a.kind!==`Assert`||a.isSuffices)&&r.forEach(st),y({...t,body:a,head:o,statement:s,proof:u},e)},vt=()=>{let e=f(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=v(i.index-1);return{kind:`By`,isOnly:E(`ONLY`),...N(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=v(i.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[_t()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(_t());return{kind:`Steps`,level:Ze(),steps:n,location:e}},yt=()=>{let e=i.index;Xe.push(-1);let t=ct(vt);return Xe.pop(),y(t,e)},bt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},xt=e=>{let t=i.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?ce():void 0;r!==void 0&&(s.add(r),T());let a=ct(()=>({statement:w(`ASSUME`)?F():j(),proof:nt(x())?yt():void 0})),o=a.statement,c=y({name:r,statement:o,proof:a.proof,location:f(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&o.kind!==`AssumeProve`&&bt(e,y({kind:`Operator`,name:r,params:[],body:o,isLocal:!1,isRecursive:!1,location:f(n)},t))},St=()=>{let e=i.index;return y(Ct(),e)},Ct=()=>{let e=T(),t=f(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=ce();return s.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},wt=()=>{let e=f(D(`----`));D(`MODULE`);let t=me();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(l.push(n),o.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=i.index;n.extends.push(me()),n.extendsRanges.push(v(e))});;){let t=i.index;te.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:l[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},l.pop(),o.pop(),n;if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=wt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=f(T()),r=Ke();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=f(T()),r=O(()=>{let e=i.index,t=f(x());return y({name:ce(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=St();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&bt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw oe(`Expected a module unit but found ${ee(r)}`);let e=ft();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Tt(n,y(Ue(void 0,[],!1,f(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){Tt(n,y(Ue(void 0,[],!0,f(r)),t));continue}Tt(n,y(He(!0),t));continue}r.kind===`Keyword`&&qp.has(r.text)?xt(n):Tt(n,Be(!1))}}},Tt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Et=wt(),Dt=fe.isUsed?Mp(e):void 0;if(Dt!==void 0)throw new u(Dt);return Et},om=e=>am(e,`tlc`),sm=e=>am(e,`tlapm`),cm=e=>am(e,`sany`),lm=25214903917n,um=(1n<<48n)-1n,dm=2147483647,fm=e=>{let t={value:(BigInt.asUintN(64,e)^lm)&um},n=e=>(t.value=t.value*lm+11n&um,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^lm)&um},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<=dm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},pm=10454148508367108822n,mm=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:pm);return Array.from({length:256},(t,n)=>e.slice(64,72).reverse().reduce((e,t,r)=>n>>r&1?e^t:e,0n))})(),hm=Int32Array.from(mm,e=>Number(BigInt.asIntN(32,e>>32n))),gm=Int32Array.from(mm,e=>Number(BigInt.asIntN(32,e))),_m=Number(BigInt.asIntN(32,pm>>32n)),vm=Number(BigInt.asIntN(32,pm));let ym=_m,bm=vm;const xm=e=>{let t=(e^bm)&255;bm=(bm>>>8|ym<<24)^gm[t],ym=ym>>>8^hm[t]},Sm=e=>{for(let t=0;t<32;t+=8)xm(e>>>t)},Cm=e=>{if(typeof e==`boolean`)xm(0),xm(e?116:102);else if(typeof e==`number`)xm(1),Sm(e);else if(typeof e==`string`){xm(3),Sm(e.length);for(let t=0;t<e.length;t++)xm(e.charCodeAt(t))}else if(F(e))xm(21),Sm(Mt(e.name)+1);else if(P(e)){let t=Nr(e);xm(9),Sm(t.domain.length);for(let e=0;e<t.domain.length;e++)Cm(t.domain[e]),Cm(t.range[e])}else{let t=L(e).elements;xm(5),Sm(t.length);for(let e of t)Cm(e)}},wm=e=>{let t={high:ym,low:bm};ym=_m,bm=vm;for(let t of e)Cm(t);let n=BigInt(ym>>>0)<<32n|BigInt(bm>>>0);return ym=t.high,bm=t.low,n},Tm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||F(e))return 5;if(typeof e==`string`)return 5+e.length;if(P(e)){let t=Nr(e);return t.domain.reduce((e,n,r)=>e+Tm(n)+Tm(t.range[r]),5)}return L(e).elements.reduce((e,t)=>e+Tm(t),5)},Em=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){ym=n<32?0:1<<n-32,bm=n<32?1<<n:0;for(let t=0;t<e;t++)xm(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^ym,t[n+1]=t[a+1]^bm}}return t},Dm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=n.get(e);if(t)return t;let r=Em(e);return n.set(e,r),r},o=e=>{if(typeof e!=`object`||F(e))return Cm(e),Tm(e);let t=s(e),n={high:ym,low:bm},r=a(i[t]);ym=i[t+1],bm=i[t+2];for(let e=0;e<8;e++){let t=e<4?n.low:n.high,i=(e*256+(t>>>(e&3)*8&255))*2;ym^=r[i],bm^=r[i+1]}return i[t]},s=e=>{let t=r.get(e);if(t!==void 0)return t;let n={high:ym,low:bm};ym=0,bm=0;let a={value:5};if(P(e)){let t=Nr(e);xm(9),Sm(t.domain.length);for(let e=0;e<t.domain.length;e++)a.value+=o(t.domain[e]),a.value+=o(t.range[e])}else{let t=L(e).elements;xm(5),Sm(t.length);for(let e of t)a.value+=o(e)}let s=i.length;return r.set(e,s),i.push(a.value,ym,bm),ym=n.high,bm=n.low,s};return(n,r)=>{let i={high:ym,low:bm};ym=_m,bm=vm;for(let t of e)o(n[t]);t[2*r]=bm,t[2*r+1]=ym,ym=i.high,bm=i.low}},Om=[],km=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},Am=()=>{for(let e=1277011;Om.length<1341;e++)km(e)&&Om.push(e);return Om},jm=e=>{let t=Am(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Mm=e=>{let t=[],n={value:e};for(let e=2;e*e<=n.value;e++)for(;n.value%e===0;)t.push(e),n.value/=e;return n.value>1&&t.push(n.value),t},Nm=e=>{for(let t=Math.max(e,9);;t++){let e=Mm(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)}}},Pm=(e,t,n)=>{if(t<=0)return[];let r=Nm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(jm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Fm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:dm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Im=(1n<<63n)-1n-24n,Lm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Im*BigInt(n)+i)%t;return r<0n?r+t:r})},Rm=(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,zm=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Zn(e.domain),n=L(e.range).elements;return{lists:t.map(()=>n),create:e=>Ut(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>L(e).elements),create:t=>er(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>L(e).elements),create:$n}}},Bm=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,Vm=(e,t,n,r)=>{if(R(t))return[];let i=r===`1.7.4`?Fm:Pm;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=Bm(t,r)?void 0:zm(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(dm)?Lm(e,t,n):i(e,Number(t),n)).map(e=>a.create(Rm(a.lists,e)))}let o=L(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Hm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new y(`RandomElement of the empty set`);return n},Um=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Zn(e.domain)];return Ut(n,n.map(()=>Um(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return er(e.names.map((n,r)=>[n,Um(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return $n(e.factors.map(e=>Um(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new y(`RandomElement of the empty set`);return e.low+r}return Hm(L(e).elements,t)},Wm=(e,t=0n)=>{let n=fm(t),r={random:fm(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>er([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:wm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Gm=e=>Un([...e.possibleCounts].map(([e,t])=>[e,t])),Km=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Gm(e)]]),qm=`----------------------------- MODULE Bags --------------------------------
459
+ `]]),ef=/* @__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)`]])]]),tf=O(`EOF`),nf=O(`IDENTIFIER`),rf=O(`DEFBREAK`),af=(e,t)=>Array.from({length:O(t)-O(e)+1},(t,n)=>O(e)+n),of=new Set(af(`op_57`,`op_119`)),sf=new Set(af(`op_1`,`op_119`)),cf=new Set(af(`op_57`,`op_70`)),lf=/* @__PURE__ */ new Set([...af(`ACTION`,`EXCEPT`),O(`EXTENDS`),...af(`IF`,`SF`),O(`STATE`),...af(`THEN`,`WITH`),O(`US`),...af(`op_112`,`op_116`)]),uf=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),df=new Map([...uf(`postfix`,160,160,!0,`[`),...uf(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...uf(`prefix`,120,120,!1,`-.`),...uf(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...uf(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...uf(`prefix`,40,40,!0,`\\lnot`),...uf(`nfix`,100,130,!0,`\\times`),...uf(`infix`,140,140,!1,`^`,`^^`),...uf(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...uf(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...uf(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...uf(`infix`,100,110,!0,`|`,`||`,`%%`),...uf(`infix`,100,110,!1,`%`),...uf(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...uf(`infix`,90,140,!1,`\\wr`),...uf(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...uf(`infix`,90,130,!1,`!!`),...uf(`infix`,90,90,!1,`...`,`..`),...uf(`infix`,80,80,!0,`\\intersect`,`\\union`),...uf(`infix`,80,80,!1,`\\`),...uf(`infix`,70,70,!1,`<:`,`:>`),...uf(`infix`,60,60,!0,`@@`),...uf(`infix`,50,140,!0,`\\cdot`),...uf(`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`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...uf(`infix`,30,30,!0,`\\land`,`\\lor`),...uf(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...uf(`infix`,10,10,!1,`=>`)]),ff=new Map([...df,...Jd.flatMap(e=>e.slice(1).map(t=>[t,df.get(e[0])]))]),pf=ff.get(`[`),mf={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},hf=e=>({type:`tokens`,kinds:new Set(e)}),gf=e=>typeof e==`string`?e.startsWith(`<`)?hf([O(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(gf)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),_f=e=>(...t)=>({type:e,body:G(...t)}),q=_f(`zeroOrMore`),vf=_f(`oneOrMore`),J=_f(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),yf=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),bf=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=yf(e,n);return n},xf=(...e)=>{let t=e.map(O);return e=>t.includes(bf(e,1).kind)},Sf=(e,t=bf(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Cf=e=>{let t=bf(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},wf=e=>xf(`CASESEP`)(e)&&Sf(e),Tf=e=>{let t=bf(e,1);lf.has(t.kind)&&(t.kind=nf)},Ef=(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}`,Df=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Of=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},kf=e=>e.operatorStacks[e.operatorStacks.length-1],Af=(e,t)=>e.low>t.high,jf=(e,t)=>e.high<t.low,Mf=e=>e.fix===`prefix`?e:ff.get(`${e.name}.`),Nf=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===pf?Df(`FcnAppl`,[n,...r.node.heirs]):Df(`PostfixExpr`,[n,r.node]),operator:void 0})},Pf=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Df(`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:Df(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Ff=e=>{let t=kf(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 Nf(t,n),Ff(e);if(i.operator!==void 0){let t=Mf(r.operator);return t!==void 0&&Af(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Ef(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 ${Ef(e,a.node.first,a.node.last)} and expression at location ${Ef(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return jf(a.operator,r.operator)?void 0:Af(a.operator,r.operator)?(Pf(t,a.operator),Ff(e)):`Precedence conflict between ops ${a.operator.name} in block ${Ef(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Mf(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(jf(s,r.operator))return;if(!Af(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Ef(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Pf(t,s),Ff(e);let c=Ef(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===mf?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},If=e=>Y(t=>{let n=kf(t),r=Of(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:Ff(t)}),Lf=If(()=>!1),Rf=If(()=>!0),zf=Y(e=>{e.lastOperator=ff.get(e.token.image)}),Bf=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},Vf=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`?Bf(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Hf=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Sf(e,n.first.beginColumn))return n;let t=Hf(e,n);if(t!==void 0)return t}},Uf=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(O),n=(e,...t)=>t.some(t=>e.kind===O(t)),r=e=>e!==void 0&&of.has(e.kind),i=e.token,a=yf(e,i);i.next=void 0;let o=yf(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===nf&&(e=e.next)}else if(e.kind===nf){let t=e.next;!r(t)||cf.has(t.kind)||sf.has(t.kind)&&t.next?.kind!==nf||(e=t.next?.kind===O(`SUBSTITUTE`)?i:sf.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==rf&&(e.next={kind:rf,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=yf(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Wf=e=>{let t=bf(e,1);if(t.kind===O(`LAB`)){let n=1;for(;n!==0;)if(t=yf(e,t),t.kind===O(`LAB`)&&n++,t.kind===O(`RAB`)&&n--,t.kind===tf)return!1;return yf(e,t).kind===O(`IN`)}if(t.kind!==nf)return!1;for(t=yf(e,t);t.kind===O(`COMMA`);){if(t=yf(e,t),t.kind!==nf)return!1;t=yf(e,t)}return t.kind===O(`IN`)},Gf=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Kf=e=>e.proofLevels.at(-1)??-1,qf=e=>{let t=bf(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:xf(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Kf(e)>=0&&Gf(t)>Kf(e):xf(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Jf=(e,t)=>{let n=Gf(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},Yf=e=>Y(t=>Jf(t,t.token)?void 0:`${Ef(t,t.token)}: ${e}`),Xf=hf([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(O)),Zf=hf([...Xf.kinds,O(`op_76`)]),Qf=hf(sf),$f=hf(cf),ep=hf([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(O)),tp=()=>q(Z({expansion:[K(Xf,`<op_77>`)],semantic:Sf}),K(`PrefixOp`,`InfixOp`),Rf),np=()=>K(G(Z({expansion:[`OpenStart`],semantic:Sf}),`OpenExpression`,Lf),G(Z({semantic:Sf}),`ExtendableExpr`)),rp=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),ip=()=>K(G(Z({semantic:e=>xf(`ASSUME`,`BOXASSUME`)(e)||bf(e,2).kind===O(`COLONCOLON`)&&[O(`ASSUME`),O(`BOXASSUME`)].includes(bf(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),ap=()=>[`JuncItem`,q(Z({semantic:Cf}),`JuncItem`)],op=e=>Y(t=>{t.expecting=e,Tf(t)}),sp=e=>Y(t=>{t.isTerminalProof=e}),cp=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Uf(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),lp={CompilationUnit:Q(void 0,[Y(Uf),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),op(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,op(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,op(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(Uf)),G(Z({semantic:e=>xf(`USE`)(e)&&bf(e,2).kind!==O(`ONLY`)||xf(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(cp(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),cp(`Expression`,Z({expansion:[`<IDENTIFIER>`,$f]}),`PostfixLHS`,`Expression`),cp(`Expression`,Z({expansion:[`<IDENTIFIER>`,Qf]}),`InfixLHS`,`Expression`),cp(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),cp(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[Zf,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Qf,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,$f]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,op(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[Xf,zf]),NonExpPrefixOp:Q(void 0,[Zf,zf]),InfixOp:Q(`Infix Op`,[Qf,zf]),PostfixOp:Q(void 0,[$f,zf]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Uf(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),ip(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),ip(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=Of(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Ef(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(Uf),K(G(Z({amount:3}),Z({semantic:xf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:qf}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>xf(`BY`)(e)||bf(e,2).kind===O(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>bf(e,2).kind!==O(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,sp(!0),J(`<ONLY>`)),G(`<USE>`,sp(!1),J(`<ONLY>`)),G(`<HIDE>`,sp(!1))),X("an expression, `MODULE' or `DEF'"),J(rp(),q(`<COMMA>`,X(`MODULE or expression`),rp(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),rp(),q(`<COMMA>`,X(`MODULE or expression`),rp(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),ep,Yf(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:qf}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),ep,Yf(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:xf(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:xf(`INSTANCE`)}),`Instantiation`),G(Z({semantic:xf(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:qf}),Y(e=>{let t=Of(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Ef(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),vf(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:xf(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(Zf,Qf,$f),hf([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(O))],semantic:Sf}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Ef(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:Sf}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Wf}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),vf(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=Of(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),vf(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Wf}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>bf(e,2).kind===O(`MAPTO`)&&lf.has(bf(e,1).kind)}),Y(e=>{bf(e,1).kind=nf}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=Df(`FcnAppl`,t.heirs),e.lastOperator=pf})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,vf(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(Tf),`Identifier`),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===O(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>wf(e)&&bf(e,2).kind!==O(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:wf}),`<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`,[vf(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=bf(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...ap()),G(Z({expansion:[`<AND>`]}),...ap())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Hf(t,e.heirs[1]);return n&&`Item at ${Ef(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Ef(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),tp(),np()],(e,t)=>{let n=kf(t);n.push({node:e.heirs[0],operator:mf});let r=Ff(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Lf,q(K(G(Z({expansion:[`PostfixOp`],semantic:Sf}),`PostfixOp`,Rf),G(Z({expansion:[`<DOT>`],semantic:Sf}),`<DOT>`,Y(Tf),Z({semantic:Sf}),`Identifier`,Y(e=>{let t=kf(e);t[t.length-1].operator!==void 0&&Nf(t,t.length),t[t.length-1]={node:Df(`RecordComponent`,[t[t.length-1].node,Of(e,2),Of(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:Sf}),X(`function argument`),`SBracketCases`,If(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:Sf}),`InfixOp`,Rf,tp(),np()),G(Z({expansion:[`<COLONCOLON>`],semantic:Sf}),`<COLONCOLON>`,Y(e=>{let t=kf(e);if(!Vf(t[t.length-1].node))return`\`::' at ${Ef(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=kf(e),n=Of(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!jf(r,e.lastOperator)){let t=Of(e,3);return`Removing label at ${Ef(e,t.first,t.last)} would change expression parsing.`}t.push({node:Df(`Label`,[Of(e,3),Of(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:Sf}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:Sf}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Kf(e)<0&&e.proofLevels.length<=1?`${Ef(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Ef(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Bf(e.heirs)===void 0?e.heirs.length===1?Df(`GeneralId`,e.heirs):void 0:Df(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>bf(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>bf(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Ef(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},up=/* @__PURE__ */ new Map,dp=e=>{let t=up.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=dp(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,dp(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 up.set(e,n),n},fp=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},pp=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=yf(e,e.scanPosition)),e.scanPosition=yf(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`},mp=(e,t)=>{if(t.type===`tokens`)return pp(e,t.kinds);if(t.type===`call`)return mp(e,lp[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||fp(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=mp(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||fp(e,t.semantic)?mp(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=mp(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=mp(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},hp=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=mp(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},gp=(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||dp(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!dp(a).hasSemanticStart?dp(a).first.has(bf(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):hp(e,i,a)&&(o===void 0||o(e))}),_p=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,mp(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=yf(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===tf){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=yf(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${j(e.token.image)}" `},vp=(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??_p(e)}\n\nResidual stack trace follows:\n${r}`,!1},yp=(e,t)=>{let n=yf(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,vp(e))},bp=(e,t)=>{let n=lp[t];n.message!==void 0&&(e.messages.push({name:n.message,token:bf(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!xp(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 vp(e,i);let a=r.node??(r.heirs.length===0?void 0:Df(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},xp=(e,t)=>{if(t.type===`tokens`)return yp(e,t.kinds);if(t.type===`call`)return bp(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||vp(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||vp(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||xp(e,t));if(t.type===`choice`){let n=gp(e,t.alternatives);return n===-1?vp(e):xp(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!xp(e,t.body))return!1;if(t.type===`optional`)return gp(e,[t.body])===-1||xp(e,t.body);for(;gp(e,[t.body])===0;)if(!xp(e,t.body))return!1;return!0},Sp=e=>{let t=Ie(e),n={kind:tf,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=xp(r,{type:`call`,name:`CompilationUnit`});return r.lexicalError===void 0?i||r.report===void 0?void 0:`***Parse Error***\n${r.report}`:r.lexicalError},Cp={low:15,high:15},wp={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),Tp=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),Ep=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Dp=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Op=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),kp=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Ap=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),jp=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,`'`,...Ep]),Mp=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Tp.has(e.operator):Ep.has(e.operator)),Np=e=>Tp.has(e)||Ep.has(e)||e===`-.`,Pp=(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}}},Fp=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Ip=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Lp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Rp=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),zp=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Bp=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Vp=/* @__PURE__ */ new Set([``,`*`,`-`]),Hp=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Up=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Wp=/* @__PURE__ */ new Set([`NEW`,...Up.keys()]),Gp=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Kp=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),qp=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Jp=(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(`
460
+ `)}\n`},Yp=(e,n)=>{let r=n===`tlapm`,i=r?me(e):me(e).map(fe),o={index:0,offsideColumns:[]},s={},c=[],l=/* @__PURE__ */ new Set,d=[],f=[],p=e=>c[c.length-1].has(e),m=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),h=[],g=[],_=[],v=(e,t=o.index-1)=>{let n=e===t?_[e]:void 0;if(n)return n;let r=i[t];h[e]??=m(i[e]),g[t]??={line:r.line,column:r.endColumn};let a={module:f[0].name,start:h[e],end:g[t]};return e===t&&(_[e]=a),a},y=(e,t)=>(e.location.range=v(t),e),b=(e=0)=>i[Math.min(o.index+e,i.length-1)],x=(e=0)=>{let t=b(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},ee=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),S={index:0},te=e=>{let t=i.slice(S.index,o.index).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},ne=e=>r&&(e.kind===`Keyword`||qp.has(e.text)),re=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},ie=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Bp.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,C=(e,n=b(),r)=>{let a=i[i.length-1],o=n.line===a.line&&n.column===a.column;return new t(`${e} at line ${n.line}, column ${n.column}`,void 0,ae(e,n,o,r))},ae=(e,t,n,a)=>{if(r&&n){let e=i[i.length-1];return{reason:`Unexpected EOF`,...te(re(e)),isEnd:n}}return r&&a?{reason:`Unexpected ${ie(a)}`,...re(a),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},oe=(e,t=b())=>C(e,t,t),ce=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),w=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},T=()=>{let e=x();if(e.kind===`End`)throw C(`Unexpected end of expression`);return o.index++,e},E=e=>w(e)?(o.index++,!0):!1,D=e=>{if(!w(e))throw oe(`Expected ${JSON.stringify(e)} but found ${ee(x())}`);return T()},le=()=>{let e=x();if(e.kind!==`Identifier`)throw oe(`Expected an identifier but found ${ee(e)}`);if(ne(e))throw oe(`Unexpected keyword ${e.text}`);return o.index++,e.text},ue=()=>{let e=o.index;return{name:le(),range:v(e)}},de=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),pe=()=>{let e=x();return e.kind!==`String`&&(Op.has(e.text)||Tp.has(e.text)||Ep.has(e.text)||e.text===`'`)?(o.index++,e.text):le()},he={isUsed:!1},ge=()=>x().kind===`Identifier`||!ce(x())?le():(he.isUsed=!0,T().text),_e=e=>{if(!r)return e();o.offsideColumns.push(-1);let t=e();return o.offsideColumns.pop(),t},O=(e,t=`,`)=>{let n=[e()];for(;E(t);)n.push(e());return n},ve=()=>{if(w(`<<`)){let e={value:1};for(;x(e.value).kind===`Identifier`||w(`,`,e.value);)e.value++;return w(`>>`,e.value)&&w(`\\in`,e.value+1)}let e={value:0};for(;x(e.value).kind===`Identifier`;){if(w(`\\in`,e.value+1))return!0;if(!w(`,`,e.value+1))return!1;e.value+=2}return!1},ye=()=>{if(w(`::`))return!0;if(!w(`(`))return!1;let e={value:1};for(;x(e.value).kind===`Identifier`&&w(`,`,e.value+1);)e.value+=2;return x(e.value).kind===`Identifier`&&w(`)`,e.value+1)&&w(`::`,e.value+2)},be=()=>{if(!E(`<<`)){let e=ue();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=de(O(ue));return D(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},xe=()=>O(()=>{let e=O(be);D(`\\in`);let t=j();return e.map(e=>({pattern:e,set:t}))}).flat(),Se=()=>{let e=x();if(e.kind===`Identifier`){let t=o.index,n=[T().text];for(;w(`!`)&&x(1).kind===`Identifier`;)T(),n.push(le());return y({kind:`Identifier`,name:n.join(`!`),location:m(e)},t)}if(w(`<<`)||w(`(`))return Fe();throw oe(`Expected a subscript but found ${ee(e)}`)},Ce=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&w(`==`,Ep.has(n.text)?3:4))},we=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||w(`,`,1)||w(`)`,1)||t.kind===`Keyword`&&Ip.has(t.text)||Ce(e)},k=()=>{let e=x(),t=e.kind===`Operator`&&(Tp.has(e.text)||Dp.has(e.text))&&we(e);if(r&&e.kind!==`String`&&(Dp.has(e.text)||jp.has(e.text)&&e.text!==`'`&&!Ep.has(e.text)||Ap.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&we(e))throw C(`incomplete expression`,e);if(t)return o.index++,y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:m(e)},o.index-1);if(e.kind!==`String`&&jp.has(e.text)&&we(e)){o.index++;let t=m(e);if(Ep.has(e.text))return y({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o.index-1);let n={kind:`Identifier`,name:`argument`,location:t};return y({kind:`Lambda`,params:[n.name],body:Pp(e.text,n,t),operator:e.text,location:m(e)},o.index-1)}if(w(`LAMBDA`)){let t=o.index;T();let n=de(O(ue));D(`:`);let r=j();return y({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:m(e)},t)}return j()},Te={range:void 0},A=()=>_e(()=>{let e=o.index;D(`(`);let t=O(k);return D(`)`),Te.range=v(e),t}),Ee=()=>{let e=T();o.offsideColumns.push(e.column);let t=[j()];for(;b().text===e.text&&b().column===e.column;)o.index++,t.push(j());return o.offsideColumns.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:m(e)}},De=e=>_e(()=>{let t=m(e),n=x().kind===`Identifier`,i=w(`|->`,1)&&(n||ce(x()));if(i||n&&w(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=o.index,n=m(x()),r=e();return n.range=v(t),D(i?`|->`:`:`),{name:r,value:j(),location:n}},a=[r(()=>n?le():T().text),...E(`,`)?O(()=>r(le)):[]];return D(`]`),{kind:e,fields:a,location:t}}if(ve()){let e=xe();D(`|->`);let n=j();return D(`]`),{kind:`FunctionConstruction`,bounds:e,body:n,location:t}}let a=j();if(E(`->`)){let e=j();return D(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(E(`EXCEPT`)){let e=O(()=>{D(`!`);let e=[];for(;w(`.`)||w(`[`);)if(E(`.`)){if(!ce(x()))throw oe(`Expected a field name but found ${ee(x())}`);e.push({kind:`Field`,name:T().text})}else D(`[`),e.push({kind:`Index`,args:O(()=>j())}),D(`]`);return D(`=`),{path:e,value:j()}});return D(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!r&&!w(`]_`)){let e=[a];for(;E(`,`);)e.push(j());return D(`]`),{kind:`Bracket`,args:e,location:t}}return D(`]_`),{kind:`BoxAction`,action:a,subscript:Se(),location:t}}),Oe=()=>{let e=o.index,t=y(Le(),e),n=m(T());return y({kind:`Apply`,operator:`\\in`,args:[t,j()],location:n},e)},ke=e=>_e(()=>{let t=m(e);if(E(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(ve()&&(x(1).text===`\\in`||w(`<<`))){let e=o.index,n=be();D(`\\in`);let r=j();if(E(`:`)){let e=j();return D(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o.index=e}let n=x().kind===`Identifier`&&w(`\\in`,1)?Oe():j();if(E(`:`)){let e=xe();return D(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;E(`,`);)r.push(j());return D(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Ae=e=>{let t=m(e),n=_e(()=>w(`>>`)||w(`>>_`)?[]:O(()=>j()));if(E(`>>_`)){if(n.length!==1)throw C(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Se(),location:t}}return D(`>>`),{kind:`Tuple`,elements:n,location:t}},je=e=>{let t=m(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&ve()){let e=xe();return D(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=de(O(ue));return D(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Me=e=>{let t=[];do{if(E(`OTHER`))return D(`->`),{kind:`Case`,arms:t,other:j(),location:m(e)};let n=j();D(`->`),t.push({condition:n,body:j()})}while(E(`[]`));return{kind:`Case`,arms:t,other:void 0,location:m(e)}},Ne=()=>{let e=x(1);return w(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Fp.has(e.text)||e.kind===`Operator`&&(Tp.has(e.text)||Ep.has(e.text)||Dp.has(e.text)))},Pe=()=>{let e=T();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:A()}}return{kind:`Name`,name:e.text,args:w(`(`)?A():[]}},Fe=e=>{let t=o.index,n=T(),i=m(n);if(r&&n.kind===`Keyword`&&n.text===`LAMBDA`){let e=O(le);return D(`:`),{kind:`Lambda`,params:e,body:j(),location:i}}if(n.kind===`Number`){if(r&&/^\\[BOH]/.test(n.text))throw C(`incomplete expression`,n);return{kind:`Number`,value:se(n.text),text:n.text,location:i}}if(n.kind===`Decimal`)return{kind:`Decimal`,text:n.text,location:i};if(n.kind===`String`)return{kind:`String`,value:n.text,location:i};let a=n.kind===`Step`&&et(n);if(a&&Ze()<0&&Xe.length<=1)throw C(`Step number used outside proof`,n);if(a&&n.text[1]===`+`)throw C(`<+> step number used in an expression`,n);if(n.kind===`Identifier`||a){let c=a?tt(n)??n.text:n.text;if(ye()){let t=de(E(`(`)?O(ue):[]);t.names.length>0&&D(`)`),D(`::`);let a=j();if(!r&&e!==void 0&&s.last!==void 0&&Mp(a)&&e.high>=s.last.low)throw C(`Removing the label would change expression parsing`,n);return{kind:`Label`,name:c,params:t.names,paramRanges:t.ranges,body:a,location:i}}let l=w(`(`);if(c===`@`&&!l&&!Ne())return{kind:`ExceptAt`,location:i};let u=l?A():[],d=[l?Te.range:void 0];if(!Ne())return l?{kind:`Apply`,operator:c,args:u,argumentsRange:Te.range,location:i}:{kind:`Identifier`,name:c,location:i};let f=[{kind:`Name`,name:c,args:u}],p=[v(t,t)];for(;Ne();)T(),p.push(v(o.index,o.index)),Te.range=void 0,f.push(Pe()),d.push(Te.range);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),_=f.map(e=>`args`in e?e.args.length:0),y=d.at(-1)??v(t);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:i}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:i}:_.slice(0,-1).some(e=>e>0)?{kind:`Apply`,operator:h,args:g,argumentCounts:_,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:i}:{kind:`Apply`,operator:h,args:g,argumentsRange:y,selectorRanges:p,argumentRanges:d,location:i}}if(n.kind===`Operator`&&Np(n.text)&&w(`(`))return{kind:`Apply`,operator:n.text,spelling:n.spelling,args:A(),location:i};if(n.kind===`Operator`&&Np(n.text)&&!r)return{kind:`Identifier`,name:n.text,spelling:n.spelling,location:i};switch(n.text){case`(`:{let e=_e(()=>j());return D(`)`),e}case`[`:return De(n);case`{`:return ke(n);case`<<`:return Ae(n);case`@`:return{kind:`ExceptAt`,location:i};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return je(n);case`IF`:{let e=j();D(`THEN`);let t=j();return D(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:i}}case`CASE`:return Me(n);case`LET`:{let e=[],t=[];for(c.push(/* @__PURE__ */ new Set);!E(`IN`);){if(r&&w(`RECURSIVE`))throw C(`Unexpected keyword RECURSIVE`,te(b()));if(E(`RECURSIVE`)){qe();continue}let n=Be(!1);n.kind===`Instance`?t.push(n):e.push(n)}c.pop();let n=j();return t.length===0?{kind:`Let`,definitions:e,body:n,location:i}:{kind:`Let`,definitions:e,instances:t,body:n,location:i}}case`CHOOSE`:{let e=be(),t=E(`\\in`)?j():void 0;return D(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:i}}case`WF_`:case`SF_`:{let e=Se(),t=_e(()=>{D(`(`);let e=j();return D(`)`),e});return{kind:n.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e,action:t,location:i}}}throw oe(`Unexpected ${ee(n)}`,n)},Ie=(e,t,n)=>{s.last=s.preceding={low:t,high:n};let i=j(n+1),a=x(),o=a.text===`'`||Ep.has(a.text)?Cp.high:Tp.get(a.text)?.high;if(!r&&a.kind===`Operator`&&o!==void 0&&o>=t)throw C(`Precedence conflict between ${e.text} and ${a.text}`,a);return i},Le=()=>{let e=s.preceding;s.preceding=void 0;let t=x(),n=m(t);if(t.kind===`Operator`&&(t.text===`/\\`||t.text===`\\/`))return Ee();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return T(),{kind:`Apply`,operator:`~`,args:[Ie(t,4,4)],location:n};case`-`:return T(),{kind:`Apply`,operator:`-.`,args:[Ie(t,12,12)],location:n};case`[]`:return T(),{kind:`Always`,expression:Ie(t,4,15),location:n};case`<>`:return T(),{kind:`Eventually`,expression:Ie(t,4,15),location:n};case`ENABLED`:return T(),{kind:`Enabled`,expression:Ie(t,4,15),location:n};case`UNCHANGED`:return T(),{kind:`Unchanged`,expression:Ie(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return T(),{kind:`Apply`,operator:t.text,args:[r?j(9):Ie(t,10,13)],location:n}}return Fe(e)},j=(e=0)=>{let t=o.index,n=Le(),r={left:n.location.range?n:y(n,t),previous:void 0};for(;;){let n=x();if(n.kind!==`Operator`)break;let i=m(n);if(n.text===`'`&&e<=15){T(),s.last=Cp,r.left=y({kind:`Prime`,expression:r.left,location:i},t);continue}if(Ep.has(n.text)&&e<=15){T(),s.last=Cp,r.left=y({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r.left],location:i},t);continue}if(n.text===`[`){T();let e=_e(()=>O(()=>j()));_e(()=>D(`]`)),s.last=wp,r.left=y({kind:`FunctionApplication`,function:r.left,args:e,location:i},t);continue}if(n.text===`.`&&ce(x(1))){T();let e=T().text;r.left=y({kind:`FieldAccess`,record:r.left,field:e,location:i},t);continue}let a=Tp.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 C(`Precedence conflict between ${o.text} and ${n.text}`,n)}if(T(),a.low>12&&w(`-`))throw C(`Precedence conflict between ${n.text} and -`,x());s.last=s.preceding=a;let c=j(a.high+1),l=r.left;if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,a=[v(t).end];r.left=l.kind===e&&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=y(r.left,t),r.previous={...a,text:n.text}}return r.left},Re=()=>{if(!E(`(`))return[];let e=Ke();return D(`)`),e},ze=()=>{let e=m(x()),t=j(),n=i[o.index-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:f[0].name,start:e,end:r}}},Be=e=>{let t=o.index;return y(He(e),t)},Ve=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),He=e=>{let t=x(),n=m(t),r=(t,r)=>({kind:`Operator`,name:t,params:r,...ze(),isLocal:e,isRecursive:p(t),location:n});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&Tp.has(x(1).text)&&x(2).kind===`Identifier`&&w(`==`,3)){let e=ue(),t=T().text,n=ue();return D(`==`),r(t,[Ve(e),Ve(n)])}let i=t.kind!==`String`&&Op.has(t.text),a=t.kind===`Identifier`&&Ep.has(x(1).text)&&w(`==`,2);if(i||a){let e=i?t.text:x(1).text;i&&T();let n=ue();return a&&T(),D(`==`),r(e,[Ve(n)])}let s=le();if(E(`[`)){let t=_e(()=>xe());return D(`]`),D(`==`),{kind:`Function`,name:s,bounds:t,body:j(),isLocal:e,isRecursive:p(s),location:n}}let c=o.index,l=Re();return D(`==`),w(`INSTANCE`)?{...Ue(s,l,e,n),definitionRange:v(c)}:r(s,l)},Ue=(e,t,n,r)=>{let i=o.index;return D(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ge(),substitutions:E(`WITH`)?O(()=>{let e=o.index,t=pe(),n=v(e);return D(`<-`),{name:t,nameRange:n,expression:k()}}):[],isLocal:n,location:r,instanceRange:v(i)}},We=()=>{let e=o.index;return y(Ge(),e)},Ge=()=>{let e=m(x());if(w(`_`)&&x(1).kind===`Operator`)return T(),{name:T().text,arity:E(`_`)?2:1,location:e};if(x().kind===`Operator`&&w(`_`,1)){let t=T().text;return T(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=le();if(!E(`(`))return{name:t,arity:0,location:e};let n=O(()=>D(`_`));return D(`)`),{name:t,arity:n.length,location:e}},Ke=()=>O(We),qe=()=>{let e=Ke();return e.forEach(e=>c[c.length-1].add(e.name)),e},Je=e=>{let t={value:0,offset:e};do{let e=x(t.offset);if(e.kind===`End`)return t.offset;e.kind===`Operator`&&Gp.has(e.text)&&t.value++,e.kind===`Operator`&&Kp.has(e.text)&&t.value--,t.offset++}while(t.value>0);return t.offset},Ye=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?w(`(`,1)||w(`[`,1)?w(`==`,Je(1)):t.kind===`Operator`&&Ep.has(t.text)?w(`==`,2):t.kind===`Operator`&&Tp.has(t.text)?x(2).kind===`Identifier`&&w(`==`,3):w(`==`,1):e.kind!==`String`&&Op.has(e.text)&&t.kind===`Identifier`&&w(`==`,2)},Xe=[],Ze=()=>Xe[Xe.length-1]??-1,Qe=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),$e=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n={value:t.length};for(;t[n.value-1]===`.`;)n.value--;return t.slice(0,n.value)},et=e=>!e.text.endsWith(`.`)&&!Vp.has($e(e)),tt=e=>{let t=$e(e);if(Vp.has(t))return;let n=Qe(e);if(n>=0)return`<${n}>${t}`;let r=Ze(),i=Xe[Xe.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},nt=e=>{if(e.kind===`Keyword`)return Rp.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return Xe.length===0;if(e.text[1]===`+`||Xe.length===0)return!0;let t=Ze();return t>=0&&Qe(e)>t},M=e=>{let t=Qe(e),n=Xe.length-1,r=Xe[n-1]??-1,i=Xe[n]<0;return i&&(Xe[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:Xe[n]===t},rt=e=>!l.has(e)&&f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),N=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!qp.has(e.name)&&!rt(e.name):!1,P=()=>{let e=x();return e.kind===`Step`?et(e):e.kind===`Keyword`?Hp.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!Ye()},it=()=>{let e=o.index,t=x();return t.kind===`Operator`&&!kp.has(t.text)&&Np(t.text)?(o.index++,y({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:m(t)},e)):E(`MODULE`)?y({kind:`ModuleFact`,name:le(),location:m(t)},e):j()},at=e=>d[d.length-1]?.add(e),ot=e=>{d.push(/* @__PURE__ */ new Set);let t=e();return d.pop(),t},st=e=>d.some(t=>t.has(e))||f.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),ct=()=>{let e=o.index,t=x(),n=O(()=>{let e=x();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw oe(`Expected a definition name but found ${ee(e)}`,e);return o.index++,e.text},`!`),r=m(t);return y(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},lt=()=>{if(r)return O(ct);let e=O(it),t=n===`tlc`?e.find(e=>e.kind===`Identifier`&&st(e.name)):void 0;if(t)throw C(`DEF clause entry should describe a defined operator`,t.location);return e},ut=()=>({facts:P()?O(it):[],defs:E(`DEF`)||E(`DEFS`)?lt():[]}),dt=()=>{let e=o.index,t=T(),r=t.text===`USE`&&E(`ONLY`),i=v(e),s={kind:t.text===`USE`?`Use`:`Hide`,isOnly:r,...ut(),keyword:i,location:m(t)},c=s.kind===`Hide`&&n===`tlc`?s.facts.filter(e=>!N(e)):[];if(c.length>0)throw u(c.map(t=>({location:a(t.location.range??v(e)),message:`The only expression allowed as a fact in a HIDE is
461
+ the name of a theorem, assumption, or step.`})));return y(s,e)},ft=()=>{let e=o.index,t=m(x()),n=E(`NEW`),r=x().kind===`Keyword`?Up.get(x().text):void 0;if(!n&&r===void 0)throw oe(`Expected a declaration but found ${ee(x())}`);if(r!==void 0&&T(),r===`Variable`){let n=ue();return at(n.name),y({kind:`NewSymbol`,name:n.name,arity:0,level:r,set:void 0,nameRange:n.range,location:t},e)}let i=We();at(i.name);let a=(r??`Constant`)===`Constant`&&w(`\\in`);if(a&&i.arity>0)throw C(`declared symbol with arguments before \\in`);return a&&T(),y({kind:`NewSymbol`,name:i.name,arity:i.arity,level:r??`Constant`,set:a?j():void 0,nameRange:i.location.range,location:t},e)},pt=()=>{let e=o.index,t=m(D(`ASSUME`)),n=O(()=>w(`ASSUME`)?ot(pt):x().kind===`Keyword`&&Wp.has(x().text)?ft():j());return D(`PROVE`),y({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)},mt=e=>{let t={value:0};for(;x(t.value).kind===`Identifier`&&w(`,`,t.value+1);)t.value+=2;return x(t.value).kind===`Identifier`&&w(e,t.value+1)},ht=(e,t)=>{e.forEach(at),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(at))},gt=()=>{let e=x();if(w(`USE`)||w(`HIDE`))return dt();if(w(`INSTANCE`)){let t=o.index;return y(Ue(void 0,[],!1,m(e)),t)}if(w(`DEFINE`)||Ye()){let t=o.index;E(`DEFINE`);let n=[Be(!1)];for(;Ye();)n.push(Be(!1));let r={kind:`Define`,definitions:n,location:m(e)};return y(r,t)}if(E(`HAVE`))return{kind:`Have`,expression:j()};if(E(`TAKE`)){let e=ve(),t=de(e?[]:O(ue)),n=e?xe():[];return ht(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(E(`WITNESS`))return{kind:`Witness`,expressions:O(()=>j())};if(E(`PICK`)){let e=mt(`:`),t=de(e?O(ue):[]),n=e?[]:xe();return ht(t.names,n),D(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return E(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:E(`SUFFICES`),statement:w(`ASSUME`)?pt():j()}},_t=e=>{let t=x();if(t.kind!==`Step`)throw oe(`Expected a step number but found ${ee(t)}`,t);if(!M(t))throw C(`${e?`QED step`:`step`}'s number has bad level`,t);if(Qe(t)<0&&tt(t)!==void 0)throw C(`<*> and <+> cannot be used for a named step`,t);return o.index++,{name:tt(t),token:t.text,location:m(t)}},vt=()=>{let e=o.index,t=_t(w(`QED`,1)),n=o.index,r=/* @__PURE__ */ new Set;d.push(r);let i=E(`QED`)?{kind:`Qed`}:gt(),a=v(e),s=v(n),c=nt(x());if(c&&!zp.has(i.kind))throw C(`Proof of a step that does not take a proof`);let l=c?bt():void 0;return d.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(at),y({...t,body:i,head:a,statement:s,proof:l},e)},yt=()=>{let e=m(x());if(w(`BY`)||w(`PROOF`)&&w(`BY`,1)){E(`PROOF`),T();let t=v(o.index-1);return{kind:`By`,isOnly:E(`ONLY`),...ut(),keyword:t,location:e}}let t=x(+!!w(`PROOF`));if(t.kind===`Keyword`&&(t.text===`OBVIOUS`||t.text===`OMITTED`)){E(`PROOF`),T();let n=v(o.index-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}}E(`PROOF`);let n=[vt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(vt());return{kind:`Steps`,level:Ze(),steps:n,location:e}},bt=()=>{let e=o.index;Xe.push(-1);let t=ot(yt);return Xe.pop(),y(t,e)},xt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},St=e=>{let t=o.index,n=T(),r=x().kind===`Identifier`&&w(`==`,1)?le():void 0;r!==void 0&&(l.add(r),T());let i=ot(()=>({statement:w(`ASSUME`)?pt():j(),proof:nt(x())?bt():void 0})),a=i.statement,s=y({name:r,statement:a,proof:i.proof,location:m(n)},t);e.theorems.push(s),e.units.push({kind:`Theorem`,theorem:s}),r!==void 0&&a.kind!==`AssumeProve`&&xt(e,y({kind:`Operator`,name:r,params:[],body:a,isLocal:!1,isRecursive:!1,location:m(n)},t))},Ct=()=>{let e=o.index;return y(wt(),e)},wt=()=>{let e=T(),t=m(e),n=e.text===`AXIOM`;if(x().kind===`Identifier`&&w(`==`,1)){let e=le();return l.add(e),T(),{name:e,expression:j(),isAxiom:n,location:t}}return{name:void 0,expression:j(),isAxiom:n,location:t}},Tt=()=>{let e=m(D(`----`));D(`MODULE`);let t=ge();D(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(f.push(n),c.push(/* @__PURE__ */ new Set),E(`EXTENDS`)&&O(()=>{let e=o.index;n.extends.push(ge()),n.extendsRanges.push(v(e))});;){let t=o.index;S.index=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:f[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},f.pop(),c.pop(),n;if(r.kind===`Separator`){if(w(`MODULE`,1)){let e=Tt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),D(`====`);continue}T()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=m(T()),r=Ke();n.constants.push(...r),e.range=v(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=m(T()),r=O(()=>{let e=o.index,t=m(x());return y({name:le(),arity:0,location:t},e)});n.variables.push(...r),e.range=v(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Ct();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&xt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(w(`USE`)&&w(`ONLY`,1))throw oe(`Expected a module unit but found ${ee(r)}`);let e=dt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:T(),n.units.push({kind:`Recursive`,declarations:qe()});continue;case`INSTANCE`:Et(n,y(Ue(void 0,[],!1,m(r)),t));continue;case`LOCAL`:if(T(),w(`INSTANCE`)){Et(n,y(Ue(void 0,[],!0,m(r)),t));continue}Et(n,y(He(!0),t));continue}r.kind===`Keyword`&&Lp.has(r.text)?St(n):Et(n,Be(!1))}}},Et=(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}))},Dt=Tt(),Ot=he.isUsed?Sp(e):void 0;if(Ot!==void 0)throw new t(Ot);return Dt},Xp=e=>Yp(e,`tlc`),Zp=e=>Yp(e,`tlapm`),Qp=e=>Yp(e,`sany`),$p=25214903917n,em=(1n<<48n)-1n,tm=2147483647,nm=e=>{let t={value:(BigInt.asUintN(64,e)^$p)&em},n=e=>(t.value=t.value*$p+11n&em,Number(BigInt.asIntN(32,t.value>>BigInt(48-e))));return{setSeed:e=>{t.value=(BigInt.asUintN(64,e)^$p)&em},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<=tm)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},rm=10454148508367108822n,im=(()=>{let e=[];for(let t=1n<<63n;e.length<72;)e.push(t),t=t>>1n^((t&1n)==0n?0n:rm);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(im,e=>Number(BigInt.asIntN(32,e>>32n))),om=Int32Array.from(im,e=>Number(BigInt.asIntN(32,e))),sm=Number(BigInt.asIntN(32,rm>>32n)),cm=Number(BigInt.asIntN(32,rm));let lm=sm,um=cm;const dm=e=>{let t=(e^um)&255;um=(um>>>8|lm<<24)^om[t],lm=lm>>>8^am[t]},fm=e=>{for(let t=0;t<32;t+=8)dm(e>>>t)},pm=e=>{if(typeof e==`boolean`)dm(0),dm(e?116:102);else if(typeof e==`number`)dm(1),fm(e);else if(typeof e==`string`){dm(3),fm(e.length);for(let t=0;t<e.length;t++)dm(e.charCodeAt(t))}else if(P(e))dm(21),fm(Ct(e.name)+1);else if(N(e)){let t=wr(e);dm(9),fm(t.domain.length);for(let e=0;e<t.domain.length;e++)pm(t.domain[e]),pm(t.range[e])}else{let t=I(e).elements;dm(5),fm(t.length);for(let e of t)pm(e)}},mm=e=>{let t={high:lm,low:um};lm=sm,um=cm;for(let t of e)pm(t);let n=BigInt(lm>>>0)<<32n|BigInt(um>>>0);return lm=t.high,um=t.low,n},hm=e=>{if(typeof e==`boolean`)return 2;if(typeof e==`number`||P(e))return 5;if(typeof e==`string`)return 5+e.length;if(N(e)){let t=wr(e);return t.domain.reduce((e,n,r)=>e+hm(n)+hm(t.range[r]),5)}return I(e).elements.reduce((e,t)=>e+hm(t),5)},gm=e=>{let t=/* @__PURE__ */ new Int32Array(4096);for(let n=0;n<64;n++){lm=n<32?0:1<<n-32,um=n<32?1<<n:0;for(let t=0;t<e;t++)dm(0);let r=n>>3,i=1<<(n&7);for(let e=i;e<2*i;e++){let n=(r*256+e)*2,a=(r*256+e-i)*2;t[n]=t[a]^lm,t[n+1]=t[a+1]^um}}return t},_m=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=[],a=e=>{let t=n.get(e);if(t)return t;let r=gm(e);return n.set(e,r),r},o=e=>{if(typeof e!=`object`||P(e))return pm(e),hm(e);let t=s(e),n={high:lm,low:um},r=a(i[t]);lm=i[t+1],um=i[t+2];for(let e=0;e<8;e++){let t=e<4?n.low:n.high,i=(e*256+(t>>>(e&3)*8&255))*2;lm^=r[i],um^=r[i+1]}return i[t]},s=e=>{let t=r.get(e);if(t!==void 0)return t;let n={high:lm,low:um};lm=0,um=0;let a={value:5};if(N(e)){let t=wr(e);dm(9),fm(t.domain.length);for(let e=0;e<t.domain.length;e++)a.value+=o(t.domain[e]),a.value+=o(t.range[e])}else{let t=I(e).elements;dm(5),fm(t.length);for(let e of t)a.value+=o(e)}let s=i.length;return r.set(e,s),i.push(a.value,lm,um),lm=n.high,um=n.low,s};return(n,r)=>{let i={high:lm,low:um};lm=sm,um=cm;for(let t of e)o(n[t]);t[2*r]=um,t[2*r+1]=lm,lm=i.high,um=i.low}},vm=[],ym=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},bm=()=>{for(let e=1277011;vm.length<1341;e++)ym(e)&&vm.push(e);return vm},xm=e=>{let t=bm(),n={index:t.length};for(;n.index===t.length;)n.index=Math.floor(e.nextDouble()*t.length);return t[n.index]},Sm=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},Cm=e=>{for(let t=Math.max(e,9);;t++){let e=Sm(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)}}},wm=(e,t,n)=>{if(t<=0)return[];let r=Cm(t),i={index:BigInt(n.nextInt(t))},a=BigInt(xm(n));return Array.from({length:e},()=>{do i.index=(r.multiplier*i.index+a)%r.modulus;while(i.index>=t);return i.index})},Tm=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:tm),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},Em=(1n<<63n)-1n-24n,Dm=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(Em*BigInt(n)+i)%t;return r<0n?r+t:r})},Om=(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,km=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Hn(e.domain),n=I(e.range).elements;return{lists:t.map(()=>n),create:e=>Pt(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>I(e).elements),create:t=>Gn(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>I(e).elements),create:Wn}}},Am=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,jm=(e,t,n,r)=>{if(L(t))return[];let i=r===`1.7.4`?Tm:wm;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=Am(t,r)?void 0:km(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(tm)?Dm(e,t,n):i(e,Number(t),n)).map(e=>a.create(Om(a.lists,e)))}let o=I(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},Mm=(e,t)=>{let n=e[Math.floor(t.nextDouble()*e.length)];if(n===void 0)throw new _(`RandomElement of the empty set`);return n},Nm=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Hn(e.domain)];return Pt(n,n.map(()=>Nm(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Gn(e.names.map((n,r)=>[n,Nm(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Wn(e.factors.map(e=>Nm(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 _(`RandomElement of the empty set`);return e.low+r}return Mm(I(e).elements,t)},Pm=(e,t=0n)=>{let n=nm(t),r={random:nm(t),state:void 0},i={isStartup:!1},a={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Gn([]),counterExample:void 0,isSeen:()=>!1,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:mm,getRandom:()=>{let e=i.isStartup?void 0:a.getCurrentState();return e===void 0?n:(e!==r.state&&(r.random.setSeed(a.getFingerprint(e)^BigInt.asUintN(64,t)),r.state=e),r.random)},evaluateAtStartup:e=>{let t=i.isStartup;i.isStartup=!0;try{return e()}finally{i.isStartup=t}},pause:()=>{},warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return a},Fm=e=>Pn([...e.possibleCounts].map(([e,t])=>[e,t])),Im=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Fm(e)]]),Lm=`----------------------------- MODULE Bags --------------------------------
468
462
  (**************************************************************************)
469
463
  (* A bag, also called a multiset, is a set that can contain multiple *)
470
464
  (* copies of the same element. A bag can have infinitely many elements, *)
@@ -617,7 +611,7 @@ CopiesIn(e, B) ==
617
611
  7 Dec 98 : Corrected error found by Stephan Merz.
618
612
  6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
619
613
  5 Dec 98 : Initial version.
620
- `,Jm=/* @__PURE__ */ new Map([[`Bags`,qm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
614
+ `,Rm=/* @__PURE__ */ new Map([[`Bags`,Lm],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
621
615
  (***************************************************************************)
622
616
  (* The two definitions in this standard module are overridden by TLC in *)
623
617
  (* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
@@ -873,7 +867,7 @@ TestRandomSetOfSubsets(k, n, S) ==
873
867
  [i \\in 1..5 |-> Cardinality(RandomSetOfSubsets(k, n, S))]
874
868
 
875
869
  =============================================================================
876
- `],[`RealTime`,`${Ud}\n`],[`Reals`,`${Hd}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
870
+ `],[`RealTime`,`${Nd}\n`],[`Reals`,`${Md}\n`],[`Sequences`,`------------------------------ MODULE Sequences -----------------------------
877
871
  (***************************************************************************)
878
872
  (* Defines operators on finite sequences, where a sequence of length n is *)
879
873
  (* represented as a function whose domain is the set 1..n (the set *)
@@ -1277,7 +1271,7 @@ TLCEvalDefinition(definitionName) ==
1277
1271
  TRUE \\* TODO
1278
1272
 
1279
1273
  ============================================================================
1280
- `],[`Toolbox`,`${Wd}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1274
+ `],[`Toolbox`,`${Pd}\n`],[`_DotTrace`,`------------------------------- MODULE _DotTrace -------------------------------
1281
1275
  LOCAL INSTANCE TLC
1282
1276
  LOCAL INSTANCE TLCExt
1283
1277
  LOCAL INSTANCE GraphViz
@@ -1677,7 +1671,7 @@ _TLCTrace ==
1677
1671
  /\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
1678
1672
 
1679
1673
  =============================================================================
1680
- `]]),Ym=new Map([...[...Jm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,qm.replace(`
1674
+ `]]),zm=new Map([...[...Rm].filter(([e])=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e)),[`Bags`,Lm.replace(`
1681
1675
  LOCAL INSTANCE Naturals
1682
1676
  `,`
1683
1677
  EXTENDS TLC
@@ -1769,16 +1763,16 @@ _TEPosition ==
1769
1763
  ELSE TLCGet("level") + 1
1770
1764
 
1771
1765
  =============================================================================
1772
- `]]),Xm=(e=`master`)=>e===`1.7.4`?Ym:Jm,Zm=(e,t,n)=>new S(`Applying ${e} to the following value,\nwhich is not ${t}:\n${z(n)}`),Qm=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${z(r)}`),$m=e=>P(e)?Nr(e):void 0,eh=(e,t,n)=>{let r=V(e,t,n),i=$m(r);if(!i)throw Zm(n,`a function with a finite domain`,r);return i},th=(e,t,n)=>{let r=V(e,t,n),i=$m(r);if(!i)throw Qm(t===0?`first`:`second`,n,`bag`,r);return i},nh=(e,t)=>{if(!N(e)||!I(e))throw t();return L(e).elements},rh=e=>e.range.every(e=>typeof e==`number`&&e>0),ih=(e,t)=>{let n=e.domain.findIndex(e=>nn(e,t));return n===-1?void 0:e.range[n]},ah=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,oh=ah(`BagDiff`,`tlc2.value.impl.Value`,2),sh=ah(`SqSubseteq`,`tlc2.value.IBoolValue`,2),ch=ah(`BagUnion`,`tlc2.value.impl.Value`,1),lh=ah(`BagOfAll`,`tlc2.value.impl.Value`,2),uh=ah(`BagCup`,`tlc2.value.impl.Value`,2),dh=ah(`BagCardinality`,`tlc2.value.impl.IntValue`,1),fh=(e,t)=>{if(typeof e==`number`)return e;let n=`tlc2.value.impl.${Gi(e)}`;throw qi(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')`)},ph=(e,t,n)=>{let r=fh(e,n)+fh(t,n);if(zi(r))throw Bi(`${e}+${t}`);return r},mh=(e,t,n,r)=>{let i=ih(n,e.domain[t]),a=fh(e.range[t],r);return i===void 0?a:a-fh(i,r)|0},hh=(e,t)=>Un(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>nn(e[0],r));a?a[1]=ph(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),gh=Ut([],[]),_h=e=>[Fi(`EmptyBag`,gh),H(`IsABag`,1,e=>{let t=$m(V(e,0,`IsABag`));return t!==void 0&&rh(t)}),H(`BagCardinality`,1,e=>{let t=V(e,0,`BagCardinality`);return eh(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Zm(`BagCardinality`,`a bag`,t);return ph(e,n,dh)},0)}),H(`BagIn`,2,e=>{let t=V(e,1,`BagIn`),n=ih(eh(e,1,`BagIn`),V(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Qm(`second`,`BagIn`,`bag`,t);return n>0}),H(`CopiesIn`,2,e=>{let t=V(e,1,`CopiesIn`),n=ih(eh(e,1,`CopiesIn`),V(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Qm(`second`,`CopiesIn`,`bag`,t);return n}),H(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=th(e,t,`(+)`);if(!rh(n))throw Qm(t===0?`first`:`second`,`(+)`,`bag`,V(e,t,`(+)`));return n});return hh(t,uh)}),H(`\\ominus`,2,e=>{let t=th(e,0,`(-)`),n=th(e,1,`(-)`);return Un(t.domain.flatMap((e,r)=>{let i=mh(t,r,n,oh);return i>0?[[e,i]]:[]}))}),H(`BagUnion`,1,e=>{let t=V(e,0,`BagUnion`),n=nh(t,()=>Zm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??gh;let r=n.map(e=>{let n=$m(e);if(!n)throw new S(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${z(t)}`);return n});return hh(r,ch)}),H(`\\sqsubseteq`,2,e=>{let t=eh(e,0,`\\sqsubseteq`),n=eh(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>mh(t,r,n,sh)<=0)}),Ii(`BagOfAll`,2,e=>{let t=Pi(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new S(`The first argument of BagOfAll should be an operator, but instead it is:\n${z(t.literalBody)}`);let n=V(e,1,`BagOfAll`),r=$m(n);if(!r)throw Qm(`second`,`BagOfAll`,`function with a finite domain`,n);return hh(r.domain.map((e,n)=>Ut([t.call([e])],[r.range[n]])),lh)}),H(`SubBag`,1,t=>{let n=V(t,0,`SubBag`);if(!P(n))throw new y(`DOMAIN expects a function but received ${z(n)}`);let r=Nr(n),i=Ln(r.range).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new y(`Attempted to apply a function to ${z(r)}, which is not in its domain`);return Ln(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Ut(e.map(e=>e[0]),e.map(e=>e[1]))))}),H(`BagToSet`,1,e=>Hr(eh(e,0,`BagToSet`))),H(`SetToBag`,1,e=>{let t=V(e,0,`SetToBag`),n=nh(t,()=>Zm(`BagToSet`,`a function with a finite domain`,t));return Ut([...n],n.map(()=>1))})],vh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,yh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,bh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,xh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,Sh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,Ch=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,wh=e=>{if(!P(e))return!1;let t=Nr(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},Th=(e,t)=>qi(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Gi(t)}`),Eh=(e,t)=>qi(e,`Cannot cast tlc2.value.impl.${Gi(t)} to tlc2.value.impl.StringValue`),Dh=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Oh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw Th(t,e);return`[${L(e).elements.map(e=>Ah(e,t)).join(`,`)}]`},kh=(e,t)=>{let n=Nr(e),r=wr(n);return r?`[${r.map(e=>Ah(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${Dh(typeof e==`string`?e:z(e))}:${Ah(n.range[r],t)}`).join(`,`)}}`},Ah=(e,t)=>typeof e==`string`?Dh(e):typeof e==`object`?e.kind===`ModelValue`?Dh(e.name):N(e)?Oh(e,t):kh(e,t):String(e),jh=e=>{if(N(e))return Oh(e,vh);if(!P(e)||wh(e))throw Th(vh,e);return kh(e,vh)},Mh=e=>{if(!P(e))throw Th(yh,e);return kh(e,yh)},Nh=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))},Ph=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return At(e);if(Array.isArray(e))return $n(e.map(e=>Ph(e,t)));if(typeof e==`object`&&e)return er(Object.entries(e).map(([e,n])=>[At(e),Ph(n,t)]));throw qi(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Fh=(e,t)=>{if(e.trim()===``)return Ph(null,t);try{return Ph(JSON.parse(e,(e,t,n)=>typeof t==`number`?Nh(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?qi(t,e.message):e}},Ih=(e,t)=>{if(typeof e!=`string`)throw Eh(t,e);return e},Lh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw qi(n,`${t} (No such file or directory)`);return r},Rh=e=>[Li(`ToJson`,1,e=>At(Ah(V(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Li(`ToJsonArray`,1,e=>At(jh(V(e,0,`ToJsonArray`)))),Li(`ToJsonObject`,1,e=>At(Mh(V(e,0,`ToJsonObject`)))),Li(`JsonSerialize`,2,t=>{let n=Ih(V(t,0,`JsonSerialize`),bh),r=V(t,1,`JsonSerialize`);if(!wr(r)&&!wh(r))throw new S(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${z(r)}`);return e.writeFile?.(n,Ah(r,bh)),!0}),Li(`ndJsonSerialize`,2,t=>{let n=Ih(V(t,0,`ndJsonSerialize`),xh),r=V(t,1,`ndJsonSerialize`),i=wr(r);if(!i)throw new S(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${z(r)}`);return e.writeFile?.(n,i.map(e=>`${Ah(e,xh)}\n`).join(``)),!0}),Li(`JsonDeserialize`,1,t=>{let n=Ih(V(t,0,`JsonDeserialize`),Sh);return Fh(Lh(e,n,Sh),Sh)}),Li(`ndJsonDeserialize`,1,t=>{let n=Ih(V(t,0,`ndJsonDeserialize`),Ch);return $n(Lh(e,n,Ch).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Fh(e,Ch)))})],zh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Bh=1e6,Vh=(e,t,n,r)=>new S(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Hh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Vh(t,n,`nonnegative integer`,z(e));return e},Uh=(e,t,n,r)=>{if(!N(e)||!I(e))throw Vh(t,n,r,z(e));return L(e).elements},Wh=(e,t,n,r)=>Ln(Array.from({length:t},()=>Ln(e.filter(()=>r.nextDouble()<n)))),Gh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Hh(V(e,0,n),`first`,n),i=Hh(V(e,1,n),`second`,n),a=Uh(V(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw Vh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw Vh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Wh(a,r,a.length===0?0:i/a.length,t.getRandom())},Kh=e=>[Li(`RandomSubset`,2,t=>{let n=V(t,0,`RandomSubset`);if(typeof n!=`number`)throw Vh(`first`,`RandomSubset`,`nonnegative integer`,z(n));if(n<0)throw qi(zh,String(n));let r=V(t,1,`RandomSubset`);if(!N(r)||!R(r)&&!I(r))throw Vh(`second`,`RandomSubset`,`a finite set`,z(r));let i=Bm(r,e.version);if(i&&i.reduce((e,t)=>e*L(t).elements.length,1)>Bh)throw qi(zh,`Attempted to construct a set with too many elements (>${Bh}).`);return Ln(Vm(n,r,e.getRandom(),e.version))}),Li(`RandomSetOfSubsets`,3,t=>Gh(t,e)),Li(`TestRandomSetOfSubsets`,3,t=>$n(Array.from({length:5},()=>L(Gh(t,e)).elements.length)))],qh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Jh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${qh})`,Yh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${qh}) throws java.io.IOException`,Xh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${qh})`,Zh=()=>er([[`action`,Ln([])],[`state`,Ln([])]]),Qh=()=>er([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),$h=e=>er([[`name`,e??`UnnamedAction`],[`location`,Qh()]]),eg=(e,t,n)=>{let r=e.map((e,t)=>$n([t+1,er(Object.entries(e))])),i=r.slice(1).map((e,n)=>$n([r[n],t[n],e])),a=n?[$n([r[r.length-1],n.action,r[n.start]])]:[];return er([[`action`,Ln([...i,...a])],[`state`,Ln(r)]])},tg=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Km(e).get(t)},ng=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),z(r));else throw new S(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${z(n)}`)},rg=e=>e.every(e=>e!==void 0),ig=(e,t)=>er(t.variables.map((t,n)=>[t,e[n]])),ag=(e,t,n)=>{let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0;if(e.kind===`Prime`||e.kind===`Unchanged`)return!0;if(r!==void 0&&!B(e)){if(t.variableIndex.has(r))return!0;let e=wl(r,t);if(e&&!n.has(e)&&(n.add(e),ag(e.body,t,n)))return!0}return Si(e).some(e=>ag(e,t,n))},og=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[H(`AssertEq`,2,t=>{let n=V(t,0,`AssertEq`),r=V(t,1,`AssertEq`),i=nn(n,r);return i||(e(z(`Assertion failed`,!0)),e(z(n,!0)),e(z(r,!0))),i}),ea(`AssertError`,2,e=>{let n=Pi(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw qi(Jh,`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=ta(e,0,`AssertError`)();try{ta(e,1,`AssertError`)()}catch(e){if(e instanceof y)return Oa(e.message,t.isTool)===r;throw e}return!1}),Li(`TLCGetOrDefault`,2,e=>{let n=V(e,0,`TLCGetOrDefault`);return tg(t,n)??V(e,1,`TLCGetOrDefault`)}),{...Ii(`TLCGetAndSet`,4,n=>{let r=V(n,0,`TLCGetAndSet`),i=tg(t,r)??V(n,3,`TLCGetAndSet`),a=Pi(n,1,`TLCGetAndSet`);return ng(t,e,r,a.call([i,V(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Li(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!rg(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw qi(Yh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return $n(t.getBehavior(r).map(e=>ig(e,n.environment)))}),Li(`CounterExample`,0,()=>t.counterExample??Zh()),H(`ToTrace`,1,e=>{let t=V(e,0,`ToTrace`);if(!P(t)||!nn(Hr(t),Ln([`action`,`state`])))throw new y(`The argument of ToTrace should be a CounterExample, but instead it is:\n${z(t)}`);let n=L(Br(t,`state`)).elements.map(e=>wr(e)??[]);return $n(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),H(`TLCModelValue`,1,e=>{let t=V(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new S(`The argument of ModelValue should be a string, but instead it is:\n${z(t)}`);return Vt(t)}),ea(`TLCDefer`,1,()=>!0),H(`TLCNoOp`,1,e=>V(e,0,`TLCNoOp`)),ea(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!rg(r))throw qi(Xh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||Cl(ta(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new C(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),ea(`TLCCache`,2,(e,t)=>{let r=Pi(e,0,`TLCCache`),a=ui(ta(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=ag(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),H(`TLCFP`,1,e=>Number(BigInt.asIntN(32,wm([V(e,0,`TLCFP`)])))),Li(`TLCEvalDefinition`,1,(e,t)=>{let n=V(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?wl(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new S(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${z(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new S(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return W({kind:`Identifier`,name:n,location:r.location},t)})]},sg=(e,t)=>[Li(`_Track`,2,e=>{let n=String(V(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,V(e,0,`_Track`)===!0?r+1:r),!0}),Li(`_Counts`,0,()=>Gm(t)),Li(`_CheckName`,1,n=>{let r=String(V(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(z(Gm(t),!0)),!1)}),Li(`_PrintCounts`,0,()=>(e(z(Gm(t),!0)),!0))],cg=e=>String(e).padStart(2,`0`),lg=e=>`${e.getUTCFullYear()}.${cg(e.getUTCMonth()+1)}.${cg(e.getUTCDate())}.${cg(e.getUTCHours())}${cg(e.getUTCMinutes())}${cg(e.getUTCSeconds())}`,ug=e=>Un([...e].map(([e,t])=>[e,$n([t])])),dg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),fg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),pg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),mg=(e,t,n)=>{if(e.version===`1.7.4`?!fg.has(t)||!e.isStarted&&pg.has(t):!e.isStarted&&dg.has(t))throw new S(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return er([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return er([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return er([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,At(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,At(lg(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return $h(void 0);case`all`:return ug(e.registers);case`all:named`:return ug(Km(e))}if(t.startsWith(`s:`)){let n=Km(e).get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return At(e.properties.get(t.slice(2))??t);throw new S(`TLCGet(${t}) was undefined.`)},hg=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new S(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new S(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${z(t)}`);return mg(e,t,n?.state)},gg=e=>e.length===0?[[]]:e.flatMap((t,n)=>gg([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),_g=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&L(e).elements.forEach(_g),e.kind===`Function`&&e.range.forEach(_g))},vg=(t,n)=>[H(`Print`,2,e=>(t(`${dt(z(V(e,0,`Print`),!0,!0))} ${dt(z(V(e,1,`Print`),!0,!0))}`),V(e,1,`Print`))),H(`PrintT`,1,e=>(t(dt(z(V(e,0,`PrintT`),!0,!0))),!0)),H(`Assert`,2,t=>{if(V(t,0,`Assert`)!==!0)throw new S(`The first argument of Assert evaluated to FALSE; the second argument was:\n${dt(z(V(t,1,`Assert`)))}`,e.assertViolation);return!0}),H(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),H(`:>`,2,e=>Un([[V(e,0,`:>`),V(e,1,`:>`)]])),H(`@@`,2,e=>{let t=Ni(e,0,`@@`),n=Ni(e,1,`@@`);return Wn([..._t(t),..._t(n)])}),H(`ToString`,1,e=>At(z(V(e,0,`ToString`),!0))),H(`TLCEval`,1,e=>{let t=V(e,0,`TLCEval`);return _g(t),t}),H(`Permutations`,1,e=>{let t=ji(e,0,`Permutations`);return Ln(gg(t).map(e=>Un(t.map((t,n)=>[t,e[n]]))))}),Ii(`SortSeq`,2,e=>{let t=Pi(e,1,`SortSeq`);return $n(Mi(e,0,`SortSeq`).reduce((e,n)=>{let r=e.findIndex(e=>t.call([n,e])===!0);return r===-1?[...e,n]:[...e.slice(0,r),n,...e.slice(r)]},[]))}),n.version===`1.7.4`?Ji({...Li(`TLCGet`,1,(e,t)=>hg(n,V(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Ji(ea(`TLCGet`,1,(e,t)=>hg(n,ta(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)`),Li(`TLCSet`,2,e=>{let r=V(e,0,`TLCSet`);return ng(n,t,r,V(e,1,`TLCSet`)),!0}),Fi(`Any`,Lt),H(`RandomElement`,1,e=>Um(ki(e,0,`RandomElement`),n.getRandom()))],yg=(e,t)=>e.every(e=>Or(e,t)),bg=Ln([!1,!0]),xg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Hn(xg(e,t,r),xg(e,r,n))},Sg=[`\\cup`,`\\cap`,`\\`],Cg=e=>typeof e==`object`&&e.kind===`MixedSet`,wg=e=>e.kind===`Interval`?L(e).elements:e.elements,Tg=(e,t,n)=>{let r=wg(t);if(e!==`\\cup`){let t=e===`\\cap`;return Rn(r.filter(e=>Or(e,n)===t))}if(r.length===0)return n;if(!ft(n))return Zt({kind:`SetOperation`,operator:e,left:t,right:n});let i=L(n).elements.filter(e=>!Or(e,t));return Rn([...r,...i])},Eg=[Fi(`TRUE`,!0),Fi(`FALSE`,!1),Fi(`BOOLEAN`,bg),Fi(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Ri(`=`,Fn),Ri(`#`,(e,t)=>!Fn(e,t)),H(`~`,1,e=>!Di(e,0,`~`)),H(`<=>`,2,e=>Di(e,0,`<=>`)===Di(e,1,`<=>`)),H(`/\\`,2,e=>Di(e,0,`/\\`)&&Di(e,1,`/\\`)),H(`\\/`,2,e=>Di(e,0,`\\/`)||Di(e,1,`\\/`)),H(`=>`,2,e=>!Di(e,0,`=>`)||Di(e,1,`=>`)),H(`\\in`,2,e=>Or(V(e,0,`\\in`),V(e,1,`\\in`))),H(`\\notin`,2,e=>!Or(V(e,0,`\\notin`),V(e,1,`\\notin`))),H(`\\subseteq`,2,e=>{let t=Oi(e,0,`\\subseteq`),n=V(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&I(t.base)?yg(L(t.base).elements,n.base):yg(L(t).elements,n)}),...Sg.map(e=>H(e,2,t=>{let n=V(t,0,e),r=V(t,1,e);if(ft(n)&&ft(r)&&!Cg(n)&&!Cg(r)){if(e===`\\cup`&&R(n))return r;let t=e===`\\cup`?Hn:e===`\\cap`?Vn:Bn;return Dr((e,n)=>t(L(e),L(n)),(t,n)=>Tg(e,t,n),n,r)}return ft(n)?Tg(e,n,r):e!==`\\`&&ft(r)?Tg(e,r,n):Zt({kind:`SetOperation`,operator:e,left:n,right:r})})),H(`SUBSET`,1,e=>({kind:`Subset`,base:V(e,0,`SUBSET`)})),H(`UNION`,1,e=>{let t=Oi(e,0,`UNION`),n=yn(t)?t.elements.filter(yn):[];if(!yn(t)||n.length!==t.elements.length)return Zt({kind:`Union`,base:t});if(Cg(t)||n.some(Cg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Or(t,e)||e.elements.push(t)})),Rn(e.elements)}return n.length===0?zn:xg(n.map(L),0,n.length)}),H(`DOMAIN`,1,e=>{let t=V(e,0,`DOMAIN`);if(!P(t))throw new y(`DOMAIN expects a function but received ${z(t)}`);return Hr(t)})],Dg=Xi(`Integers`,`Neg`,`IntValue`,1),Og=e=>{let t=Xi(e,`DotDot`,`IntervalValue`,2);return[Zi(e,`+`,`Plus`,(e,t)=>e+t),Zi(e,`-`,`Minus`,(e,t)=>e-t),Zi(e,`*`,`Times`,(e,t)=>e*t),Zi(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new S(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new S(`0^0 is undefined.`);return e**t}),Zi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new S(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(zi(r))throw Bi(`${t} \\div ${n}`);return r}),Zi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new S(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),H(`..`,2,e=>({kind:`Interval`,low:Yi(V(e,0,`..`),t),high:Yi(V(e,1,`..`),t)}))]},kg=Og(`Naturals`),Ag=Og(`Integers`),jg=e=>{let t=kg.indexOf(e);return t===-1?void 0:Ag[t]},Mg=[Fi(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...kg,$i(`<`,(e,t)=>e<t),$i(`>`,(e,t)=>e>t),$i(`<=`,(e,t)=>e<=t),$i(`>=`,(e,t)=>e>=t,`>`)],Ng=[Fi(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Ag,$i(`>=`,(e,t)=>e>=t),H(`-.`,1,e=>{let t=Yi(V(e,0,`-`),Dg);if(zi(-t))throw Bi(`-${t}`);return-t})],Pg=(e,t,n)=>{let r=V(e,t,n),i=wr(r);if(!i)throw new S(`${n}\n${z(r)}`);return i},Fg=(e,t,n)=>{let r=V(e,t,n);return typeof r==`string`?r:Pg(e,t,n)},Ig=(e,t,n)=>typeof e==`string`?At(e.slice(t,n)):$n(e.slice(t,n)),Lg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Rg=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,zg=(e,t)=>{let n=df.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Ji(e,t):e}):t},Bg=e=>zg(`Sequences`,[H(`Seq`,1,e=>({kind:`SequenceSet`,base:V(e,0,`Seq`)})),H(`Len`,1,e=>Fg(e,0,Lg(``,`Len`)).length),H(`\\o`,2,e=>{let t=Fg(e,0,Rg(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Pg(e,1,Rg(`t \\o s`,`sequence`));return $n([...t,...n])}let n=V(e,1,`\\o`);if(typeof n!=`string`)throw new S(`${Rg(`t \\o s`,`string`)}\n${z(n)}`);return At(t+n)}),H(`Append`,2,t=>$n([...Pg(t,0,Rg(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),V(t,1,`Append`)])),H(`Head`,1,e=>{let t=Pg(e,0,Lg(``,`Head`));if(t.length===0)throw new S(`Attempted to apply Head to the empty sequence.`);return t[0]}),H(`Tail`,1,e=>{let t=Fg(e,0,Lg(``,`Tail`));if(t.length===0)throw new S(`Attempted to apply Tail to the empty sequence.`);return Ig(t,1)}),H(`SubSeq`,3,e=>{let t=Fg(e,0,Lg(`first `,`SubSeq`)),n=Ei(e,1,`SubSeq`),r=Ei(e,2,`SubSeq`);if(n>r)return Ig(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new S(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${z(V(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Ig(t,n-1,r)}),Ii(`SelectSeq`,2,e=>{let t=Pi(e,1,`SelectSeq`);return $n(Pg(e,0,Lg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new S(`The second argument of SelectSeq should be a operator, but instead it is:\n${z(n)}`);return n}))})]),Vg=e=>zg(`FiniteSets`,[H(`IsFiniteSet`,1,e=>{let t=V(e,0,`IsFiniteSet`);if(N(t))return Sr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new y(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${z(t)}\nis a finite set.`:`Attempted to check if the ${pt(t)} ${z(t)} is a finite set.`)}),H(`Cardinality`,1,t=>{let n=V(t,0,`Cardinality`);if(!N(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new S(`Attempted to compute cardinality of the value\n${z(n)}`);return br(n,e)})]),Hg=/* @__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`]]]),Ug=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Mg};case`Integers`:return{extends:[`Naturals`],operators:Ng};case`Sequences`:return{extends:[],operators:Bg(n.version)};case`FiniteSets`:return{extends:[],operators:Vg(n.version)};case`TLC`:return{extends:[],operators:zg(`TLC`,vg(t,n))};case`Randomization`:return{extends:[],operators:Kh(n)};case`_Possible`:return{extends:[],operators:sg(t,n)};case`Json`:return{extends:[],operators:Rh(r)};case`Bags`:return{extends:[],operators:_h(i)};case`TLCExt`:return{extends:[],operators:og(t,n)};default:return}},Wg=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}])),Gg={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]}},Kg=(e,t)=>{let n=Gg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},qg=`$subexpression`,Jg=(e,t)=>new u(`${e} at line ${t.line}, column ${t.column}`),Yg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Yg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of Si(e)){let e=Yg(r,t,n);if(e)return e}},Xg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Zg=(e,t)=>{let n=e.location,r=Xg(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 Jg(`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 Jg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:qg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:qg,args:e.args,location:n,resolution:Ma},location:n}},Qg=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Ma})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ma}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ma};return Zg({...t,params:[...t.params,...r]},a)},$g=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o={index:0,current:void 0,isFailed:!1},s=(t,r)=>{if(!t)throw Jg(r,i);Pa.set(n,{args:e.slice(0,o.index).flatMap(e=>`args`in e?e.args:[]),error:{location:g(t),message:r}}),o.isFailed=!0},c=n=>{let r=[],a=[];for(;o.index<e.length;){let s=e[o.index];if(s.kind!==`Name`)throw Jg(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>ns(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o.index++}throw Jg(`Unknown operator ${r.join(`!`)}`,i)},l=t=>{let l=c(t),u=l.definition,d=za(u),f=o.index===e.length-1;if(l.args.length!==d&&(!r||l.args.length!==0))return s(n.argumentRanges?.[o.index]??i.range,`The operator ${l.name} requires ${d-l.earlier} arguments.`);if(f)return{definition:u,args:l.args};if(u.kind!==`Operator`)throw Jg(`Cannot select a subexpression of ${u.name}`,i);a.params.push(...u.params),a.args.push(...l.args),o.current=u.body,o.index++},u=()=>{for(;o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o.index],c=o.current&&Yg(o.current,t.name,[]);if(!c)return s(i,`Cannot find label \`${t.name}'.`);let l=c.label.params;if(!r&&t.args.length!==l.length)return s(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...l.map(e=>({name:e,arity:0}))),a.args.push(...t.args),o.current=c.label.body,o.index++}},d=t=>{let n=o.current;if(!n)throw Jg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){o.current=n.body,d(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||oo(t.operand,1)!==0)throw Jg(`A LET/IN expression has only one operand`,i);a.lets.push(n.definitions),o.current=n.body;return}let r=uo(n);if(r&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...r.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),o.current=r.body;return}if(n.kind===`Case`&&t.kind===`Operand`){let r=[...n.arms,...n.other?[{condition:void 0,body:n.other}]:[]],a=r[oo(t.operand,r.length)],s=e[o.index+1];if(!a||s?.kind!==`Operand`)throw Jg(`A subexpression of CASE must have the form !i!j`,i);o.index++;let c=oo(s.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw Jg(`Nonexistent CASE operand`,i);o.current=l;return}if(t.kind!==`Operand`)throw Jg(`Unexpected subexpression selector`,i);let s=r?r.sets:fo(n),c=s?.[oo(t.operand,s.length)];if(!c)throw Jg(`Nonexistent operand specified by the selector`,i);o.current=c},f=l(void 0);if(o.isFailed)return n;if(f)return Qg(f.definition,{...a,args:f.args});for(u();o.index<e.length&&!o.isFailed;){let t=e[o.index];if(t.kind===`Name`){for(;o.current?.kind===`Label`;)o.current=o.current.body;if(o.current?.kind!==`Let`)throw Jg(`A name selector here must be from a LET clause`,i);a.lets.push(o.current.definitions);let e=l(o.current.definitions);if(o.isFailed)return n;if(e)return Qg(e.definition,{...a,args:[...a.args,...e.args]});u()}else d(t),o.index++}if(o.isFailed)return n;if(!o.current)throw Jg(`Subexpression selection failed`,i);return Zg(a,o.current)},e_=(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 so(e,t,n)},t_=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||Si(e).some(t_),n_=(e,t,n,r=!1)=>{if(!t_(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=as(e,e=>n_(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>r_(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)=>n_(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:as(e,e=>n_(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?e_(a.name,[],void 0,t):a.kind===`Apply`?e_(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&&Na.add(c),c},r_=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:n_(e.expression,t,n,!0)}))}),i_=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},a_=(e,t)=>r_(e,i_(t.definitions),()=>!1),o_=(e,t)=>{let n=i_([...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=>n_(e,n,i),o=e=>i(e)||!n(e),s=e=>n_(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 r_(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?r_(e,n,o):is(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=>t_(e.body))||e.assumptions.some(e=>t_(e.expression))?{...p,definitions:e.definitions.map(e=>is(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},s_=(e,t)=>`${e}${t}`,c_=(e,t,n)=>`${e}${t}${n}`,l_=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},u_=(e,t,n)=>`${e},${t},${n}`,d_=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),f_=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),p_=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),m_=(e,t,n,r)=>({...d_(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),h_=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,g_=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,__=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,{...m_(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),v_=m_(`$Set`,0,[2],[1]),y_=m_(`$Junction`,0,[3],[1]),b_=m_(`$Choose`,0,[2],[1]),x_=m_(`$Function`,0,[3],[1]),S_=m_(`$FcnApply`,0,[2,2],[1,1]),C_=m_(`$RcdSelect`,0,[2,0],[1,1]),w_=m_(`'`,2,[1],[0]),T_=m_(`ENABLED`,1,[2],[0]),E_=m_(`[]`,3,[3],[0]),D_=m_(`$SquareAct`,2,[2,1],[0,0]),O_=m_(`$WF`,3,[1,2],[0,0]),k_=m_(`$TemporalExists`,3,[3],[0]),A_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),j_=e=>e.map(e=>({name:e,arity:0})),M_=(e,t)=>t.location.range?_(`${e}.`,t.location.range):new u(`${e} at line ${t.location.line}, column ${t.location.column}`),N_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),P_=e=>e.kind!==`Let`&&e.kind!==`Label`,F_=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=__.get(t)??Wg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=d_(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(c_(e,n,t))}),t.data.constraints.forEach((e,t)=>f_(r.constraints,t,e)),p_(r.argConstraints,s_(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>p_(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>h_(e,n))throw new u(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new u(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(u_(t,n,r)),s=d_(Math.max(e.level,...t.filter((t,n)=>g_(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)=>{g_(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)=>f_(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||f_(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>f_(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||f_(s.constraints,t,h_(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=>f_(s.constraints,e,h_(r,a)))}))}),e.argParams.forEach(e=>{let t=l_(e),n=a(t.operator)?.operator;n&&f_(s.constraints,t.param,h_(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>p_(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>p_(s.argConstraints,s_(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&p_(s.argConstraints,s_(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=l_(e),n=a(t.operator);n&&p_(s.argConstraints,s_(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(l_(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=l_(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(c_(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(c_(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(c_(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,j_(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=d_();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=A_(n,j_(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},c=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),l=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw M_(`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 M_(`Action used where only temporal formula or state predicate allowed`,e);N_.has(e.operator)&&l(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&P_(n)&&n.kind!==r)throw M_(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)=>f_(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>p_(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof u)||t.sany?t:M_(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return d_();case`Identifier`:return c(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),c(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return l(n,e),i(y_,n)}case`Prime`:case`Unchanged`:return s(w_,[e.expression],t);case`Enabled`:return s(T_,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(E_,[n])}case`If`:return s(y_,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(y_,[...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(y_,[e.body],t,e.bounds.map(e=>e.set),Za(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw M_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return s(e.isTemporal?k_:y_,[e.body],t,[],e.names);case`Choose`:return s(b_,[e.body],t,e.set?[e.set]:[],Xa(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(v_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(v_,[e.predicate],t,[e.bound.set],Xa(e.bound.pattern));case`SetMap`:return s(v_,[e.expression],t,e.bounds.map(e=>e.set),Za(e.bounds));case`FunctionConstruction`:return s(x_,[e.body],t,e.bounds.map(e=>e.set),Za(e.bounds));case`Record`:return s(x_,e.fields.map(e=>e.value),t);case`RecordSet`:return s(v_,e.fields.map(e=>e.value),t);case`Except`:return s(v_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(S_,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(v_,e.args,t)}]);case`Bracket`:return d_();case`FieldAccess`:return i(C_,[a(e.record,t),{data:d_()}]);case`BoxAction`:case`AngleAction`:return s(D_,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(O_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return d_()}},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 Si(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,A_(t,j_(e.names))),i;default:return as(e,(e,n)=>(a(e,r,A_(t,j_(n))),e)),i}},_=(e,t,n,r)=>{let i=A_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...d_(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(s_(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(c_(e.name,n,t.name))).map(e=>u_(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(l_(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=l_(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,{...d_(),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}},I_=(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`?I_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=d_(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>f_(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>p_(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},L_=(e,t,n,r)=>{let i=F_(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`?I_(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=g(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:g(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=Yo([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?I_(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw p(n)}})),...n],r);if(l.length>0)throw p(l,!1,void 0,r)},R_=(e,t)=>e.maxLevels[t]??3,z_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=F_({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=>f_(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>f_(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>p_(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=l_(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)&&f_(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(I_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=g(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get(s_(e.name,i));a!==void 0&&R_(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=l_(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=R_(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw p([...r.values()])}},B_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],V_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),H_=new Map(af.flatMap(e=>e.map(t=>[t,e[0]]))),U_=e=>H_.get(e)??e,W_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},G_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(W_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},K_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),q_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:U_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:U_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},J_=(e,t)=>{let n=[];for(let r=t;;){let t=q_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Y_=e=>({line:e.line,column:e.column}),X_=(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=J_(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},Z_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Q_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},$_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Z_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Z_(e[n+1],e[n+2])?n+=Z_(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=>Q_[e])}"`:r.text)}return t},ev=e=>e[2]?.text,tv=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},nv=(e,t)=>e.find(e=>e.name===t)??e.map(e=>nv(e.modules,t)).find(Boolean),rv=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(lf.has(i)?t?.(i):void 0)??uf.get(i)??t?.(i)??im(e,i),s=o===void 0?[]:Ce(o),c=tv(s),l=c.get(ev(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=om(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>nv(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},iv=(e,t)=>{let n=rv(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=J_(t,e+1);r.push({location:Y_(t[e]),apply:e=>i.forEach(t=>e.put(K_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:Y_(u),apply:t=>t.put(K_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&J_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),V_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(Y_(u)),r.push({location:Y_(u),apply:e=>e.put(K_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(K_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=U_(e.name);r.push({location:e.location,apply:n=>n.put(K_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(K_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(K_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Ra(e.location,t.location)?-1:+!!Ra(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=G_();i.set(e??``,s),rf.toReversed().forEach(e=>s.put(K_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},av=(e,t,n)=>iv(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),ov=(e,t)=>{let n=iv(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},sv=(e,t)=>av(e,t,`variable`),cv=(e,t,n)=>{let r=rv(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),of.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=X_(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;$_(s(void 0)).forEach((e,t)=>{t===3&&cf.forEach(a),a(e)});let x=u(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(f.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??ev(r(void 0).tokens);throw m(n,e)}$_(s(n)).forEach(a)}}B_.forEach(a);let ee=/* @__PURE__ */ new Set,te=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(te),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return te(void 0),sf.forEach(a),[...i]},lv=t=>{switch(t.kind){case`Number`:try{return mt(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Vt(t.name);case`Set`:return Ln(t.elements.map(lv))}},uv=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],dv=(e,t)=>{try{return om(e)}catch(n){if(!(n instanceof u))throw n;let r=Mp(e);throw r===void 0?n:p([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},fv=e=>new u(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),pv=(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)}.`},mv=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,hv=e=>e===`Theorem`?`ThmOrAssumpDefNode`:mv(e),gv=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Ma},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),_v=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>z(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new y(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&nn(t,r)})});if(t)return t[1];throw new y(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:z(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},vv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||Si(e).some(e=>vv(e,t)),yv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ms(e),n.get(e)??n.size)),n},bv=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),xv=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw hl(e);if(e.kind===`Number`&&!wu(e.value))throw gl(e);xv(e.kind===`Let`?[...Si(e),...bv(e.instances??[])]:Si(e))}),Sv=(e,t)=>{let n=om(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Set,s=new Map(Eg.map(e=>[e.name,e])),c=/* @__PURE__ */ new Map,l=Wm(e.checkDeadlock,t.seed);l.isWarningEnabled=t.isWarningEnabled??!0,l.isTool=t.isTool??!1,l.version=t.version??`master`;let d=/* @__PURE__ */ new Map,f=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,b=[],x=/* @__PURE__ */ new Map,ee=[],te=[],S=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=z_(e=>{let t=_.get(e)??ue(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>r.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,w=/* @__PURE__ */ new Map,T=e=>{let n=c.get(e);if(n)return n;let r=Ug(e,t.print,l,t.files,s);if(!r)return;Hg.get(e)?.forEach(T);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>T(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{s.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Wg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Kg(e,t.name)??i.get(t.name)?.range})}),c.set(e,i),i},E=e=>{if(lf.has(e)&&t.loadModule?.(e)!==void 0)return;let n=T(e),r=Hg.get(e)??[];return n&&S(e,r),n&&r.includes(`Integers`)&&T(`Integers`),n},D=e=>(xv([...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]),...bv(e.instances)]),e.modules.forEach(D),e);D(n);let ce=(e,n)=>{let r=t.loadModule?.(e)??Gd.get(e)??im(t.source,e);if(r===void 0)throw m(e,n);let i=dv(r,e);if(i.name!==e)throw p([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return D(i)},le=e=>{let t=te.indexOf(e.name);if(t!==-1)throw new u(`Circular dependency among .tla files; dependency cycle is: ${[...te.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];te.push(e.name),ee.push(n);let o=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:C,levelChecks:a});if(ee.pop(),te.pop(),i.length>0)throw p(i,!1,void 0,C);let s=r.find(e=>n.has(e.name)),c=s&&d.get(s.name),l=c&&pv(s,c.module);if(l)throw p([l],!1,void 0,C);if(s)throw fv(s);return a.forEach(e=>e()),{linked:o,closure:n}},ue=(e,n)=>{let i=d.get(e);if(i)return S(e,x.get(e)??[]),i;let a=le(ce(e,n));return(Xm(l.version).has(e)?Ug(e,t.print,l,t.files,s):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(s.set(t.key,e),r.delete(t.key))}),d.set(e,a.linked),x.set(e,a.closure),S(e,a.closure),a.linked},de=(e,t,n,s,c)=>{let l=c?void 0:E(e.module);if(l)return fe(e,l);let u=c??ue(e.module,t.name);u.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let d=uv(u),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=Jo(a_(e,t),d,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=Es({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,$o(t,p)])),variables:new Set(u.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,c,l)=>{let u=re(`${c}@${t.name}`),f=l(u);return r.set(u,f),d.length>0&&o.add(f),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??c}`),i.set(u,!s),a.set(u,{source:n,prefix:e.params.length}),u},createName:re});return pe(e,u.exported,d,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return d.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&w.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let a=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!a.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:i.get(n.key)===!0?e.location.range:n.range}];let a=`${e.name}!${t}`;return[a,{key:r(n.key,a),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Ma})),he=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),O=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ge=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=O(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},_e=(e,t,n,a)=>{let o=e.location,s=a?void 0:E(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=O(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=uv(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};ie.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>vv(f(e),p),h=d.map(t=>{let n=ge(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Es({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,o),location:o,resolution:Ma}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Ma}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:gv(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=O(n.arity),a=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,a)=>{let o=nf(e,t.loadClass?.(e.name),e===n);ye.set(e.name,o.overrides);let s=o.module,c=ie.length,l=new Map([...Eg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...a.symbols]),u=/* @__PURE__ */ new Map,d={location:Uo,errors:[],warnings:[]},p=[d],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||g(n.range)===g(e.range))return;let r=g(e.range),i=g(n.range);hv(n.kind)===hv(e.kind)?d.warnings.push({location:r,message:`Warning: the ${mv(n.kind)} of '${t}' conflicts with \nits ${mv(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${mv(e.kind)} of '${t}' conflicts with \nits ${mv(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,x=[],ee=[...s.constants],te=s.variables.map(e=>e.name),S=s.variables.map(e=>e.location);s.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:E(e);if(n){m(n);return}let r=t??ue(e,s.name);ee.push(...r.constants.filter(e=>ee.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{te.includes(e)||(te.push(e),S.push(r.variableLocations[t]))}),m(r.exported),r.facts.forEach(e=>v.add(e)),r.modules.forEach((e,t)=>y.set(t,e)),x.push(r)});let ne=new Map(l),re=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:D(e),arity:za(e),params:Ba(e),kind:Wo(s,e)?`Theorem`:`Definition`,range:e.location.range}),T=ee.length===0&&te.length===0,D=e=>s===n?e.name:`${e.name}@${a.id}`,ce=/* @__PURE__ */ new Map,le=()=>new Map([...a.modules,...y]),me=e=>{let t=s.instances.find(t=>t.module===e.name);return t!==void 0&&Ra(e.location,t.location)},he=e=>{let t=s.modules.find(t=>t.name===e.module);return t?me(t)?y.get(t.name):void 0:le().get(e.module)},O=e=>({imported:l,getInstance:e=>{let t=he(e),n=t?void 0:E(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:s.name};let r=t??ue(e.module,s.name),i=uv(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:D,instanced:ce,facts:v,reports:p,warnings:a.warnings}),ge=e=>[...re.filter(t=>Ra(t.location,e)).map(e=>[e.name,oe(e)]),...s.definitions.filter(t=>Ra(t.location,e)).map(e=>[e.name,se(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),xe=e=>{let t=le(),n=t.get(e.name),r=n&&pv(e,n.module);if(n&&!r)throw fv(e);a.nested.push(e);let i={location:e.location,errors:[],warnings:[]};p.push(i);let o=be(e,{id:`${a.id}/${e.name}`,symbols:ge(e.location),modules:t,nested:a.nested,errors:i.errors,warnings:i.warnings,levelChecks:a.levelChecks});r&&i.errors.push(r),n||y.set(e.name,o),f.has(e.name)||f.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=de(e,s,O(s),T,le().get(e.module));ce.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))})}})),...s.modules.map(e=>({location:e.location,link:()=>xe(e)}))].sort((e,t)=>Ra(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=o_(As(s,(e,t)=>_e(e,t,s.name,he(e))),ve(l));a.errors.push(...Xo(Se,O(Se))),Se.definitions.forEach(e=>{let t=D(e);r.set(t,e),i.set(t,!T);let n=se(e),a=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||a!==void 0&&!Ra(a,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:te,variableLocations:S,visible:l,exported:h,modules:y,extended:x,facts:/* @__PURE__ */ new Set([...v,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,Ce);let we=ie.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return a.levelChecks.push(()=>L_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(te),getDefinition:e=>r.get(l.get(e)?.key??e),getQualifiedName:e=>w.get(l.get(e)?.key??e)},we,C)),b.push(Ce),Ce},xe=le(n).linked;C.length>0&&!t.isSanyReported&&t.print(h(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===n.name||k.includes(e.name)?[]:[(d.get(e.module)??f.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{s.set(e,t),r.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=lv(e.value);Pn(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new v(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(lv),lv(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,_v(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new v(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new v(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=Se(i),o=r.get(a);if(!(o!==void 0||s.has(a)||De.has(a)||k.includes(i)||Te.includes(i)))throw new v(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new v(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&Ne(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=Ne(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=he(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!t.isUnconfigured)throw new v(`The constant parameter ${av(t.source,t.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0]} is not assigned a value by the configuration file.`);t.isTraceRecorded&&s.forEach((e,t)=>{let n=jg(e);n&&s.set(t,n)});let Fe={runtime:l,definitions:r,builtins:s,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:yv(Te,b.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:o,evaluators:/* @__PURE__ */ new WeakMap},Ie=F_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>s.has(e))]),getDefinition:e=>wl(e,Fe)}),Le=e=>{try{W(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof y)return e;throw e}};je.forEach((e,t)=>{let n=r.get(e),i=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(i)throw new v(`The configuration file substitutes constant ${t} with non-constant ${e}${Ta(i)?``:` - specifically: ${i.message}`}`)}),l.version!==`1.7.4`&&(l.isStarted=!0);let j=new Set(b.flatMap(e=>e.module.instances.map(e=>e.module))),Re=ov(t.source,t.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:b.filter(e=>!j.has(e.module.name)||uv(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=r.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:b.flatMap(e=>ye.get(e.module.name)??[])}},Cv={kind:`Boolean`,value:!0},wv={kind:`Boolean`,value:!1},Tv=e=>e?Cv:wv,Ev=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,Dv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Ov=(e,t)=>({kind:e,body:t}),kv=(e,t,n)=>({kind:e,operands:[t,n]}),Av=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?Av(e,t.operands).operands:[t])}),jv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return jv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,jv(t)),0)}},Mv=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 Mv(e.body);case`And`:case`Or`:return e.operands.some(Mv)}},Nv=/* @__PURE__ */ new WeakMap,Pv={count:0},Fv=e=>{let t=Nv.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`#${Pv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Fv).join(`,`)})`;default:return`${e.kind}(${Fv(e.body)})`}})();return Nv.set(e,n),n},Iv=(e,t)=>e===t||Fv(e)===Fv(t),Lv=(e,t)=>{let n=Fv(t);return e.some(e=>e===t||Fv(e)===n)},Rv=e=>e===`And`?`Or`:`And`,zv=(e,t)=>{switch(e.kind){case`Boolean`:return t?Tv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Ov(`Not`,e):e;case`Not`:return zv(e.body,!t);case`And`:case`Or`:return Av(t?Rv(e.kind):e.kind,e.operands.map(e=>zv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Ov(n,zv(e.body,t))}}},Bv=e=>{switch(e.kind){case`Boolean`:return Tv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return Av(Rv(e.kind),e.operands.map(Bv));case`Always`:return Ov(`Eventually`,Bv(e.body));case`Eventually`:return Ov(`Always`,Bv(e.body));default:return Ov(`Not`,e)}},Vv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Vv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return Tv(t)}return n.length===0?Tv(!t):n.length===1?n[0]:Av(e.kind,n)}case`Not`:{let t=Vv(e.body);return t.kind===`Boolean`?Tv(!t.value):Ov(`Not`,t)}case`Always`:case`Eventually`:{let t=Vv(e.body);return Ov(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Hv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Uv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Uv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new y(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>Av(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Uv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Hv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:Av(`Or`,t);n.push(Ov(`Always`,Ov(`Eventually`,e)))}return Av(`Or`,n)}case`Not`:return Ev(e.body)?e:Uv(Bv(e.body));default:return e}},Wv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Wv(e.operands[0]):Av(e.kind,e.operands.map(Wv));case`Not`:return e.body.kind===`Not`?Wv(e.body.body):Ov(`Not`,Wv(e.body));case`Always`:case`Eventually`:case`Next`:return Ov(e.kind,Wv(e.body));default:return e}},Gv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Gv(e.operands[0]);let t=Math.floor(e.operands.length/2);return kv(e.kind,Gv(Av(e.kind,e.operands.slice(0,t))),Gv(Av(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Ov(e.kind,Gv(e.body));default:return e}},Kv=(e,t)=>{e.kind===`Eventually`&&!Lv(t,e)&&t.push(e),`body`in e&&Kv(e.body,t),`operands`in e&&e.operands.forEach(e=>Kv(e,t))},qv=e=>{let t=e.filter(Dv),n=e.flatMap(e=>e.kind===`Not`&&Dv(e.body)?[e.body]:[]);return!t.some(e=>Lv(n,e))},Jv=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,Ov(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new y(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Yv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Ov(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Xv=(e,t,n)=>e.flatMap(e=>{let r=Yv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Zv=e=>[...new Set(e.map(Fv))].sort().join(`|`),Qv=(e,t)=>{let n=new Set(t.map(Zv));return[...e.filter(e=>!n.has(Zv(e))),...t]},$v=e=>{let t=Jv(e),n=Xv(t,`Always`,`And`),r=Xv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Yv(t,`Eventually`,`Or`);if(n&&!(Lv(e,n.first)||Lv(e,n.second)))return Qv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Lv(e,t.first)||Lv(e,t.second))&&!Lv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!qv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Yv(t[e],`Always`,`And`);n&&(Lv(t,n.first)||t.push(n.first),Lv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Lv(t,e.first)&&Lv(t,e.second)&&!Lv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!qv(t)?[]:i(t)};return a(e)},ey=e=>({particle:e,successors:[],statePredicates:e.filter(e=>jv(e)<=1)}),ty=e=>{let t=$v([e]).map(ey),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Zv(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 $v(n)){let n=Zv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(ey(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},ny=(e,t)=>!Lv(e,t)||Lv(e,t.body),ry=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&jv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Hv(e);if(n){let e=jv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Mv(e))throw new y(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},iy=(e,t)=>{let n=e.findIndex(e=>Iv(e,t));return n===-1?(e.push(t),e.length-1):n},ay=e=>{let t=Uv(Vv(zv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Wv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])ry(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:Av(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Iv(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Gv(e.formula),n=[];t&&Kv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>iy(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>iy(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>iy(i,e))}));return{tableau:t&&ty(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},oy=()=>n(new y(`Temporal formula is a tautology (its negation is unsatisfiable).`),e.livenessEvaluationFailure),sy=()=>n(new x,e.error),cy=/* @__PURE__ */ new Set([`~>`,`-+->`]),ly=/* @__PURE__ */ new WeakMap,uy=/* @__PURE__ */ new WeakSet,dy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),fy=(e,t)=>new y(`TLC cannot handle the temporal formula ${sl(e)}${t===void 0?``:`:\n${t}`}`),py=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=_l(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return py(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?py(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=wl(e,n);if(t)return my(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:B(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return as(e,(e,a)=>(i.value=Math.max(i.value,py(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 cy.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},my=(e,t)=>{let n=ly.get(e);if(n!==void 0)return n;ly.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(py(e.body,void 0,t),...r.map(e=>py(e.set,void 0,t)));return ly.set(e,i),i},hy=(t,r)=>{try{return Ll(t,r)}catch(t){if(!(t instanceof y))throw t;if(!Ta(t))return;throw n(new y(`${o(`tlc2.tool.EvalException`)}${t.message}`),e.error)}},gy=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>gy(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,sl(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,_y(e,t,n));if(e.kind===`Identifier`){let r=B(e)?_l(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:wl(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&my(a,n)>0){if(i.has(a))throw sy();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=dy(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||py(e,t,n)===3)){let t=cu(e,c),r=B(e)?void 0:wl(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,bu(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>py(e.set,t,n)===0),u=l?hy(e.bounds,c):void 0;if(l&&u){let n=[];if(Rl(e.bounds,u,t,t=>(n.push(...s(e.body,t,sl(e.body))),!1)),n.length===0)throw oy();return n}return[{expression:e,scope:t,name:o}]},_y=(e,t,n)=>{let r=Su(e.definitions,dy(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&uy.add(e.binding);return r},vy=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),yy=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?py(e,t,n):i;if(a===0){let r=W(e,dy(n,t));if(typeof r!=`boolean`)throw new y(`TLC expected a boolean value, but did not find one. ${cl(e)}`);return Tv(r)}return a===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},a={depth:0},o=(e,t,n,r)=>{if(a.depth>=100)throw sy();a.depth++;let o=f(e,t);a.depth--;let s=jv(o);return s>2?o:i(n,r,s)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=dy(n,t),s=B(e)||wl(i,n)===void 0?_l(t,i):void 0;if(s?.kind===`Thunk`&&uy.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:B(e)?lu(i,a):ou(i,n);if(l?.kind!==`Closure`)throw fy(e);let u=e.kind===`Apply`?e.args:[],d=!B(e)&&wl(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,bu(l,u,a),e,t)),d)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof x||n&&!r;throw!(t instanceof y)||i?t:fy(e)}},l=(e,t)=>{let r=py(e,t,n);if(!e.bounds.every(e=>py(e.set,t,n)===0)){if(r<=2)return i(e,t,r);throw fy(e)}let a=[],o=e.kind===`Forall`;try{zl(e.bounds,dy(n,t),t=>(a.push(f(e.body,t)),!1))}catch(n){if(!(n instanceof y)||n instanceof x)throw n;if(r<=2)return i(e,t,r);throw fy(e,o&&!Ta(n)?n.message:void 0)}return a.length===0?Tv(o):u(e,t,Av(o?`And`:`Or`,a))},u=(e,t,n)=>{let r=jv(n);return r>2?n:i(e,t,r)},d=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!B(e)||e.operator===`=>`),f=(e,t)=>{let a=py(e,t,n);if(a<=2&&!d(e))return i(e,t,a);switch(e.kind){case`Label`:return f(e.body,t);case`Let`:return f(e.body,_y(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Ov(`Always`,kv(`Or`,Ov(`Not`,f(n[0],t)),Ov(`Eventually`,f(n[1],t)))):e.operator===`~`&&!B(e)?u(e,t,Ov(`Not`,f(n[0],t))):e.operator===`=>`?u(e,t,kv(`Or`,Ov(`Not`,f(n[0],t)),f(n[1],t))):s(e,t)}case`And`:case`Or`:return u(e,t,Av(e.kind,e.operands.map(e=>f(e,t))));case`Forall`:case`Exists`:return l(e,t);case`If`:{if(!r&&py(e.condition,t,n)===0){let r=W(e.condition,dy(n,t));if(typeof r==`boolean`)return f(r?e.consequent:e.alternative,t)}let i=f(e.condition,t);return u(e,t,kv(`Or`,kv(`And`,i,f(e.consequent,t)),kv(`And`,Ov(`Not`,i),f(e.alternative,t))))}case`Always`:case`Eventually`:return Ov(e.kind,f(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=vy(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Ov(`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`?Ov(`Always`,Ov(`Eventually`,kv(`Or`,i,a))):kv(`Or`,Ov(`Eventually`,Ov(`Always`,i)),Ov(`Always`,Ov(`Eventually`,a)))}default:throw fy(e)}};return f(e,t)},by=(e,t,n,r,i)=>{let a=e=>by(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`?Cl(W(e.expression,a),`a temporal property predicate`):Xc(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&&Cl(W(e.unchanged,a),`a subscript`)?!1:Cl(W(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return by(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new y(`TLC cannot evaluate a temporal formula in a single step`)}},xy=(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)=>xy(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 by(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Sy=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Sy(e.body);case`And`:case`Or`:return e.operands.some(Sy);default:return!1}},Cy=e=>e.promises.some(e=>Sy(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),wy=(e,t)=>e.every((e,n)=>an(e,t[n])),Ty=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Ey=e=>({data:e(1024),length:0,create:e}),Dy=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},Oy=(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}},ky=e=>new Int32Array(e).fill(-1),Ay=(e,t)=>(e.edgeStarts[t]??-1)!==-1,jy=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},My=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Ny=(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),Py=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Fy=2**53-1,Iy=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>yy(e.expression,e.scope,n)),a=e.map(e=>Ov(`Not`,yy(e.expression,e.scope,n))),o=a.length===1?a[0]:Av(`Or`,a),s=i.length===0?o:Av(`And`,[...i,o]),c=ay(s);if(c.length===0)throw oy();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Fv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Ey(e=>new Int32Array(e)),edgeActions:Ey(e=>new Uint8Array(e)),stateResults:Ey(e=>new Uint8Array(e)),initial:[],firstNodes:Ey(ky),lastNodes:Ey(ky),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),d={multiplier:1},f=!Fu(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>by(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!by(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!by(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},te=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),S=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Oy(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n)=>{let r=Ny(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Oy(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],Oy(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?Dy(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Dy(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;Dy(e.edgeTargets,a,n),r.forEach((t,n)=>Dy(e.edgeActions,(a+n)*o,t)),Dy(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&wy(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&te(e)){e.errorNode=a;return}let o=S(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=S(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of Py(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=S(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return Ty(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Ny(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{Ay(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Ay(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 jy(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}Ay(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new y(`Couldn't re-create liveness trace (path) starting at: ${t}`)},w=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>Ay(e,t)),c=[],l=t=>{let n=jy(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&ny(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=Fy;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]=Fy,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>My(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>jy(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=Ty(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},_={node:r},v=e=>o.has(e),b=e=>{l.push(_.node),_.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&My(e,_.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(jy(e,_.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!v(r)||!a(_.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(v(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);_.node=t,n.unvisited=jy(e,t).find(e=>v(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,_.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:Cy(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of jy(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new y(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};jy(e,l).forEach((t,r)=>{Ay(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(S(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=v(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=w(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!xy(a[i].body,t,r,0,n)).map(e=>e.name))]}},Ly=`UnnamedAction`,Ry={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},zy=e=>{let t=e.range??Ry;return er([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},By=e=>{let t=[[`name`,e.name],[`location`,zy(e.location)]];return e.parameters.length===0?er(t):er([...t,[`context`,er(e.parameters)],[`parameters`,$n(e.parameters.map(e=>e[0]))]])},Vy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),Hy=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Uy=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Wy=e=>e.kind===`Apply`?e.args:[],Gy=(e,t,n)=>{let r=Uy(e);if(r===void 0)return;if(B(e)){let e=_l(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=ou(r,n);return i?.kind===`Closure`?i:void 0},Ky=(e,t)=>{try{return W(e,Hy(t,void 0)),!0}catch(e){if(e instanceof l)return!1;throw e}},qy=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Ol(e,t)&&Ky(e.body,t),Jy=(e,t)=>{let n=wl(e.name,t);return n?.body===e.body&&qy(n,t)},Yy=(e,t)=>{if(e.kind!==`Identifier`||!B(e))return;let n=_l(t,e.name);return n?.kind===`Thunk`?n:void 0},Xy=(e,t)=>(e?.params??[]).flatMap(e=>{let n=_l(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Zy=(e,t)=>{try{return e()}catch(e){if(e instanceof l)return t();throw e}},Qy=(e,t,n,r,i)=>{let a=Wy(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>py(e,n,i)!==0)?o():Zy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,Hy(i,n))]),expression:t,scope:n}],o)},$y=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Ly,location:e.location,parameters:Xy(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return $y(e.body,Su(e.definitions,Hy(r,t)),n,r,i);case`Label`:return $y(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>$y(e,t,n,r,i));case`Exists`:return Zy(()=>{let o=[];return zl(e.bounds,Hy(r,t),t=>(o.push(...$y(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=B(e)?void 0:i.get(Uy(e)??``),s=Gy(e,t,r);if(o)return Qy(o,e,t,s,r);if(!s)return[a()];let c=Wy(e),l=B(e)?s.name:r.instanceNames.get(Uy(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return Jy(s,r)||c.some(e=>py(e,t,r)!==0)?u():Zy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:W(n,Hy(r,t))},parent:e}),s.scope);return $y(s.body,e,{...s,name:l},r,i)},u)},eb=(e,t,n,r,i)=>{let a=(e,t)=>eb(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Su(e.definitions,Hy(n,t)));return}let o=Yy(e,t);if(o){a(o.expression,o.scope);return}let s=Gy(e,t,n);if(s&&Jy(s,n))return;if(s&&s.params.length===0){if(py(s.body,s.scope,n)===1){r.inits.push(Vy(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,bu(s,e.args,Hy(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(Vy(Ly,e));return}let c=py(e,t,n);c<=1?r.inits.push(Vy(Ly,e)):c===3&&r.temporals.push(Vy(Ly,e))},tb=(e,t,n,r,i)=>{let a=(t,n)=>tb(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Su(t.definitions,Hy(r,n)));return}let o=Yy(t,n);if(o){a(o.expression,o.scope);return}let s=Gy(t,n,r);if(s&&Jy(s,r))return;if(s&&s.params.length===Wy(t).length){a(s.body,t.kind===`Apply`?bu(s,t.args,Hy(r,n)):s.scope);return}if(t.kind===`Forall`&&Zy(()=>(zl(t.bounds,Hy(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Vy(e,a)):py(a,n,r)<2?i.invariants.push(Vy(e,a)):i.impliedTemporals.push(Vy(e,t));return}let c=py(t,n,r);c<=1?i.impliedInits.push(Vy(e,t)):c===3&&i.impliedTemporals.push(Vy(e,t))},nb=(e,t)=>{let n=wl(e,t);return n?.kind===`Operator`&&!qy(n,t)?n:void 0},rb=e=>er([[`name`,e.name],[`location`,zy(e.location)]]),ib=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:nb(e.specification,t);a&&(eb(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...$y(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:ou(e.init,t);o?.kind===`Closure`&&r.inits.push(Vy(e.init??``,o.body));let s=e.next===void 0?void 0:ou(e.next,t);return s?.kind===`Closure`&&r.actions.push(...$y(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=nb(e,t);n&&r.invariants.push(Vy(e,n.body))}),e.properties.forEach(e=>{let n=nb(e,t);n&&tb(e,n.body,void 0,t,r)}),r},ab=(e,t,n)=>ib(e,t,n).inits,ob=(e,t,n)=>ib(e,t,n).actions,sb=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>z(e[1])).join(`,`)})`,cb=(e,t)=>`${e.name===Ly?`Action`:e.name}${t===`1.7.4`?``:sb(e)} ${g(e.location.range??Ry)}`,lb=e=>`${e.name}${sb(e)}`,ub=(e,t,n,r)=>{let i=ib(e,t,r),a=e=>Ln(e.map(By)),o=e=>Ln(e.flatMap(e=>{let n=nb(e,t);return n?[rb(n)]:[]}));return er([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,Ln(t.variables.map((e,t)=>er([[`name`,e],[`location`,zy(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},db=`paired12`,fb=(e,t=16)=>e<=t*.75?t:fb(e,t*2),pb=(e,t)=>{let n=fb(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},mb=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),hb=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),gb=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),_b=e=>gb(e).replaceAll(`
1773
- `,`\\n`),vb=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},yb=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
1766
+ `]]),Bm=(e=`master`)=>e===`1.7.4`?zm:Rm,Vm=(e,t,n)=>new f(`Applying ${e} to the following value,\nwhich is not ${t}:\n${R(n)}`),Hm=(e,t,n,r)=>new f(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${R(r)}`),Um=e=>N(e)?wr(e):void 0,Wm=(e,t,n)=>{let r=B(e,t,n),i=Um(r);if(!i)throw Vm(n,`a function with a finite domain`,r);return i},Gm=(e,t,n)=>{let r=B(e,t,n),i=Um(r);if(!i)throw Hm(t===0?`first`:`second`,n,`bag`,r);return i},Km=(e,t)=>{if(!M(e)||!F(e))throw t();return I(e).elements},qm=e=>e.range.every(e=>typeof e==`number`&&e>0),Jm=(e,t)=>{let n=e.domain.findIndex(e=>qt(e,t));return n===-1?void 0:e.range[n]},Ym=(e,t,n)=>`public static ${t} tlc2.module.Bags.${e}(${Array.from({length:n},()=>`tlc2.value.impl.Value`).join(`,`)})`,Xm=Ym(`BagDiff`,`tlc2.value.impl.Value`,2),Zm=Ym(`SqSubseteq`,`tlc2.value.IBoolValue`,2),Qm=Ym(`BagUnion`,`tlc2.value.impl.Value`,1),$m=Ym(`BagOfAll`,`tlc2.value.impl.Value`,2),eh=Ym(`BagCup`,`tlc2.value.impl.Value`,2),th=Ym(`BagCardinality`,`tlc2.value.impl.IntValue`,1),nh=(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')`)},rh=(e,t,n)=>{let r=nh(e,n)+nh(t,n);if(Ai(r))throw ji(`${e}+${t}`);return r},ih=(e,t,n,r)=>{let i=Jm(n,e.domain[t]),a=nh(e.range[t],r);return i===void 0?a:a-nh(i,r)|0},ah=(e,t)=>Pn(e.reduce((e,n)=>(n.domain.forEach((r,i)=>{let a=e.find(e=>qt(e[0],r));a?a[1]=rh(a[1],n.range[i],t):e.push([r,n.range[i]])}),e),[])),oh=Pt([],[]),sh=e=>[Ei(`EmptyBag`,oh),V(`IsABag`,1,e=>{let t=Um(B(e,0,`IsABag`));return t!==void 0&&qm(t)}),V(`BagCardinality`,1,e=>{let t=B(e,0,`BagCardinality`);return Wm(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw Vm(`BagCardinality`,`a bag`,t);return rh(e,n,th)},0)}),V(`BagIn`,2,e=>{let t=B(e,1,`BagIn`),n=Jm(Wm(e,1,`BagIn`),B(e,0,`BagIn`));if(n===void 0)return!1;if(typeof n!=`number`)throw Hm(`second`,`BagIn`,`bag`,t);return n>0}),V(`CopiesIn`,2,e=>{let t=B(e,1,`CopiesIn`),n=Jm(Wm(e,1,`CopiesIn`),B(e,0,`CopiesIn`));if(n===void 0)return 0;if(typeof n!=`number`)throw Hm(`second`,`CopiesIn`,`bag`,t);return n}),V(`\\oplus`,2,e=>{let t=[0,1].map(t=>{let n=Gm(e,t,`(+)`);if(!qm(n))throw Hm(t===0?`first`:`second`,`(+)`,`bag`,B(e,t,`(+)`));return n});return ah(t,eh)}),V(`\\ominus`,2,e=>{let t=Gm(e,0,`(-)`),n=Gm(e,1,`(-)`);return Pn(t.domain.flatMap((e,r)=>{let i=ih(t,r,n,Xm);return i>0?[[e,i]]:[]}))}),V(`BagUnion`,1,e=>{let t=B(e,0,`BagUnion`),n=Km(t,()=>Vm(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??oh;let r=n.map(e=>{let n=Um(e);if(!n)throw new f(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${R(t)}`);return n});return ah(r,Qm)}),V(`\\sqsubseteq`,2,e=>{let t=Wm(e,0,`\\sqsubseteq`),n=Wm(e,1,`\\sqsubseteq`);return t.domain.every((e,r)=>ih(t,r,n,Zm)<=0)}),Di(`BagOfAll`,2,e=>{let t=Ti(e,0,`BagOfAll`);if(t.literalBody!==void 0)throw new f(`The first argument of BagOfAll should be an operator, but instead it is:\n${R(t.literalBody)}`);let n=B(e,1,`BagOfAll`),r=Um(n);if(!r)throw Hm(`second`,`BagOfAll`,`function with a finite domain`,n);return ah(r.domain.map((e,n)=>Pt([t.call([e])],[r.range[n]])),$m)}),V(`SubBag`,1,t=>{let n=B(t,0,`SubBag`);if(!N(n))throw new _(`DOMAIN expects a function but received ${R(n)}`);let r=wr(n),i=On(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 _(`Attempted to apply a function to ${R(r)}, which is not in its domain`);return On(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Pt(e.map(e=>e[0]),e.map(e=>e[1]))))}),V(`BagToSet`,1,e=>Nr(Wm(e,0,`BagToSet`))),V(`SetToBag`,1,e=>{let t=B(e,0,`SetToBag`),n=Km(t,()=>Vm(`BagToSet`,`a function with a finite domain`,t));return Pt([...n],n.map(()=>1))})],ch=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`,lh=`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`,uh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,dh=`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`,fh=`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,ph=`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`,mh=e=>{if(!N(e))return!1;let t=wr(e).domain;return t.length>0&&t.every(e=>typeof e==`string`)},hh=(e,t)=>Ri(e,`Cannot convert value: unsupported value type tlc2.value.impl.${Ii(t)}`),gh=(e,t)=>Ri(e,`Cannot cast tlc2.value.impl.${Ii(t)} to tlc2.value.impl.StringValue`),_h=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),vh=(e,t)=>{if(typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`))throw hh(t,e);return`[${I(e).elements.map(e=>bh(e,t)).join(`,`)}]`},yh=(e,t)=>{let n=wr(e),r=hr(n);return r?`[${r.map(e=>bh(e,t)).join(`,`)}]`:`{${n.domain.map((e,r)=>`${_h(typeof e==`string`?e:R(e))}:${bh(n.range[r],t)}`).join(`,`)}}`},bh=(e,t)=>typeof e==`string`?_h(e):typeof e==`object`?e.kind===`ModelValue`?_h(e.name):M(e)?vh(e,t):yh(e,t):String(e),xh=e=>{if(M(e))return vh(e,ch);if(!N(e)||mh(e))throw hh(ch,e);return yh(e,ch)},Sh=e=>{if(!N(e))throw hh(lh,e);return yh(e,lh)},Ch=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))},wh=(e,t)=>{if(typeof e==`boolean`||typeof e==`number`)return e;if(typeof e==`string`)return xt(e);if(Array.isArray(e))return Wn(e.map(e=>wh(e,t)));if(typeof e==`object`&&e)return Gn(Object.entries(e).map(([e,n])=>[xt(e),wh(n,t)]));throw Ri(t,`Cannot convert value: unsupported JSON value ${String(e)}`)},Th=(e,t)=>{if(e.trim()===``)return wh(null,t);try{return wh(JSON.parse(e,(e,t,n)=>typeof t==`number`?Ch(n?.source??String(t)):t),t)}catch(e){throw e instanceof SyntaxError?Ri(t,e.message):e}},Eh=(e,t)=>{if(typeof e!=`string`)throw gh(t,e);return e},Dh=(e,t,n)=>{let r=e.readFile?.(t);if(r===void 0)throw Ri(n,`${t} (No such file or directory)`);return r},Oh=e=>[Oi(`ToJson`,1,e=>xt(bh(B(e,0,`ToJson`),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`))),Oi(`ToJsonArray`,1,e=>xt(xh(B(e,0,`ToJsonArray`)))),Oi(`ToJsonObject`,1,e=>xt(Sh(B(e,0,`ToJsonObject`)))),Oi(`JsonSerialize`,2,t=>{let n=Eh(B(t,0,`JsonSerialize`),uh),r=B(t,1,`JsonSerialize`);if(!hr(r)&&!mh(r))throw new f(`The second argument of JsonSerialize should be a sequence or record, but instead it is:\n${R(r)}`);return e.writeFile?.(n,bh(r,uh)),!0}),Oi(`ndJsonSerialize`,2,t=>{let n=Eh(B(t,0,`ndJsonSerialize`),dh),r=B(t,1,`ndJsonSerialize`),i=hr(r);if(!i)throw new f(`The second argument of ndJsonSerialize should be a sequence, but instead it is:\n${R(r)}`);return e.writeFile?.(n,i.map(e=>`${bh(e,dh)}\n`).join(``)),!0}),Oi(`JsonDeserialize`,1,t=>{let n=Eh(B(t,0,`JsonDeserialize`),fh);return Th(Dh(e,n,fh),fh)}),Oi(`ndJsonDeserialize`,1,t=>{let n=Eh(B(t,0,`ndJsonDeserialize`),ph);return Wn(Dh(e,n,ph).split(/\r\n|\r|\n/).map(e=>e.trim()).filter(e=>e!==``).map(e=>Th(e,ph)))})],kh=`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`,Ah=1e6,jh=(e,t,n,r)=>new f(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${r}`),Mh=(e,t,n)=>{if(typeof e!=`number`||e<0)throw jh(t,n,`nonnegative integer`,R(e));return e},Nh=(e,t,n,r)=>{if(!M(e)||!F(e))throw jh(t,n,r,R(e));return I(e).elements},Ph=(e,t,n,r)=>On(Array.from({length:t},()=>On(e.filter(()=>r.nextDouble()<n)))),Fh=(e,t)=>{let n=`RandomSetOfSubsets`,r=Mh(B(e,0,n),`first`,n),i=Mh(B(e,1,n),`second`,n),a=Nh(B(e,2,n),`third`,n,`finite set`);if(a.length<31&&r>2**a.length)throw jh(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${a.length}`,String(r));if(a.length<i)throw jh(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,String(i));return Ph(a,r,a.length===0?0:i/a.length,t.getRandom())},Ih=e=>[Oi(`RandomSubset`,2,t=>{let n=B(t,0,`RandomSubset`);if(typeof n!=`number`)throw jh(`first`,`RandomSubset`,`nonnegative integer`,R(n));if(n<0)throw Ri(kh,String(n));let r=B(t,1,`RandomSubset`);if(!M(r)||!L(r)&&!F(r))throw jh(`second`,`RandomSubset`,`a finite set`,R(r));let i=Am(r,e.version);if(i&&i.reduce((e,t)=>e*I(t).elements.length,1)>Ah)throw Ri(kh,`Attempted to construct a set with too many elements (>${Ah}).`);return On(jm(n,r,e.getRandom(),e.version))}),Oi(`RandomSetOfSubsets`,3,t=>Fh(t,e)),Oi(`TestRandomSetOfSubsets`,3,t=>Wn(Array.from({length:5},()=>I(Fh(t,e)).elements.length)))],Lh=`tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel`,Rh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(${Lh})`,zh=`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(${Lh}) throws java.io.IOException`,Bh=`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(${Lh})`,Vh=()=>Gn([[`action`,On([])],[`state`,On([])]]),Hh=()=>Gn([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]]),Uh=e=>Gn([[`name`,e??`UnnamedAction`],[`location`,Hh()]]),Wh=(e,t,n)=>{let r=e.map((e,t)=>Wn([t+1,Gn(Object.entries(e))])),i=r.slice(1).map((e,n)=>Wn([r[n],t[n],e])),a=n?[Wn([r[r.length-1],n.action,r[n.start]])]:[];return Gn([[`action`,On([...i,...a])],[`state`,On(r)]])},Gh=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Im(e).get(t)},Kh=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),R(r));else throw new f(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${R(n)}`)},qh=e=>e.every(e=>e!==void 0),Jh=(e,t)=>Gn(t.variables.map((t,n)=>[t,e[n]])),Yh=(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&&!z(e)){if(t.variableIndex.has(r))return!0;let e=hl(r,t);if(e&&!n.has(e)&&(n.add(e),Yh(e.body,t,n)))return!0}return pi(e).some(e=>Yh(e,t,n))},Xh=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[V(`AssertEq`,2,t=>{let n=B(t,0,`AssertEq`),r=B(t,1,`AssertEq`),i=qt(n,r);return i||(e(R(`Assertion failed`,!0)),e(R(n,!0)),e(R(r,!0))),i}),Gi(`AssertError`,2,e=>{let n=Ti(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw Ri(Rh,`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 _)return ya(e.message,t.isTool)===r;throw e}return!1}),Oi(`TLCGetOrDefault`,2,e=>{let n=B(e,0,`TLCGetOrDefault`);return Gh(t,n)??B(e,1,`TLCGetOrDefault`)}),{...Di(`TLCGetAndSet`,4,n=>{let r=B(n,0,`TLCGetAndSet`),i=Gh(t,r)??B(n,3,`TLCGetAndSet`),a=Ti(n,1,`TLCGetAndSet`);return Kh(t,e,r,a.call([i,B(n,2,`TLCGetAndSet`)])),i}),isStateLevel:!0},Oi(`Trace`,0,(e,n)=>{let r=n?.state;if(!n||!r||!qh(r)){let e=(n?.environment.variables??[]).filter((e,t)=>r?.[t]===void 0);throw Ri(zh,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return Wn(t.getBehavior(r).map(e=>Jh(e,n.environment)))}),Oi(`CounterExample`,0,()=>t.counterExample??Vh()),V(`ToTrace`,1,e=>{let t=B(e,0,`ToTrace`);if(!N(t)||!qt(Nr(t),On([`action`,`state`])))throw new _(`The argument of ToTrace should be a CounterExample, but instead it is:\n${R(t)}`);let n=I(jr(t,`state`)).elements.map(e=>hr(e)??[]);return Wn(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),V(`TLCModelValue`,1,e=>{let t=B(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new f(`The argument of ModelValue should be a string, but instead it is:\n${R(t)}`);return Mt(t)}),Gi(`TLCDefer`,1,()=>!0),V(`TLCNoOp`,1,e=>B(e,0,`TLCNoOp`)),Gi(`PickSuccessor`,1,(e,n)=>{let r=n?.next;if(!r||!qh(r))throw Ri(Bh,`Cannot invoke "tlc2.value.IValue.fingerPrint(long)" because "minVals[i]" is null`);if(t.isSeen(r)||ml(Ki(e,0,`PickSuccessor`)(),`the condition of PickSuccessor`))return!0;throw new y(`PickSuccessor needs interactive input to extend the behavior with a new state`)}),Gi(`TLCCache`,2,(e,t)=>{let r=Ti(e,0,`TLCCache`),a=ti(Ki(e,1,`TLCCache`)()),o=r.expression;if(!o||!t)return r.call([]);let s=Yh(o,t.environment,/* @__PURE__ */ new Set)&&t.state?i(t.state):n,c=s.get(o)??/* @__PURE__ */ new Map;s.set(o,c);let l=c.get(a);if(l!==void 0)return l;let u=r.call([]);return c.set(a,u),u}),V(`TLCFP`,1,e=>Number(BigInt.asIntN(32,mm([B(e,0,`TLCFP`)])))),Oi(`TLCEvalDefinition`,1,(e,t)=>{let n=B(e,0,`TLCEvalDefinition`),r=typeof n==`string`&&t?hl(n,t.environment):void 0;if(!r||typeof n!=`string`||!t)throw new f(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${R(n)}`);if(r.kind===`Operator`&&r.params.length>0)throw new f(`The argument of TLCEvalDefinition should be a zero-arity definition, but instead it is:\n${n}`);return U({kind:`Identifier`,name:n,location:r.location},t)})]},Zh=(e,t)=>[Oi(`_Track`,2,e=>{let n=String(B(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,B(e,0,`_Track`)===!0?r+1:r),!0}),Oi(`_Counts`,0,()=>Fm(t)),Oi(`_CheckName`,1,n=>{let r=String(B(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(R(Fm(t),!0)),!1)}),Oi(`_PrintCounts`,0,()=>(e(R(Fm(t),!0)),!0))],Qh=e=>String(e).padStart(2,`0`),$h=e=>`${e.getUTCFullYear()}.${Qh(e.getUTCMonth()+1)}.${Qh(e.getUTCDate())}.${Qh(e.getUTCHours())}${Qh(e.getUTCMinutes())}${Qh(e.getUTCSeconds())}`,eg=e=>Pn([...e].map(([e,t])=>[e,Wn([t])])),tg=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),ng=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),rg=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),ig=(e,t,n)=>{if(e.version===`1.7.4`?!ng.has(t)||!e.isStarted&&rg.has(t):!e.isStarted&&tg.has(t))throw new f(`TLCGet(${t}) was undefined.`);let r=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return r;case`stats`:return Gn([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,r],[`worker`,0]]);case`config`:return Gn([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,`0`],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Gn([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,xt(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,xt($h(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return Uh(void 0);case`all`:return eg(e.registers);case`all:named`:return eg(Im(e))}if(t.startsWith(`s:`)){let n=Im(e).get(t);if(n===void 0)throw new f(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return xt(e.properties.get(t.slice(2))??t);throw new f(`TLCGet(${t}) was undefined.`)},ag=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new f(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new f(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${R(t)}`);return ig(e,t,n?.state)},og=e=>e.length===0?[[]]:e.flatMap((t,n)=>og([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),sg=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&I(e).elements.forEach(sg),e.kind===`Function`&&e.range.forEach(sg))},cg=(e,t)=>[V(`Print`,2,t=>(e(`${nt(R(B(t,0,`Print`),!0,!0))} ${nt(R(B(t,1,`Print`),!0,!0))}`),B(t,1,`Print`))),V(`PrintT`,1,t=>(e(nt(R(B(t,0,`PrintT`),!0,!0))),!0)),V(`Assert`,2,e=>{if(B(e,0,`Assert`)!==!0)throw new f(`The first argument of Assert evaluated to FALSE; the second argument was:\n${nt(R(B(e,1,`Assert`)))}`,m.assertViolation);return!0}),V(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),V(`:>`,2,e=>Pn([[B(e,0,`:>`),B(e,1,`:>`)]])),V(`@@`,2,e=>{let t=wi(e,0,`@@`),n=wi(e,1,`@@`);return Fn([...ct(t),...ct(n)])}),V(`ToString`,1,e=>xt(R(B(e,0,`ToString`),!0))),V(`TLCEval`,1,e=>{let t=B(e,0,`TLCEval`);return sg(t),t}),V(`Permutations`,1,e=>{let t=Si(e,0,`Permutations`);return On(og(t).map(e=>Pn(t.map((t,n)=>[t,e[n]]))))}),Di(`SortSeq`,2,e=>{let t=Ti(e,1,`SortSeq`);return Wn(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)=>ag(t,B(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)=>ag(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=B(n,0,`TLCSet`);return Kh(t,e,r,B(n,1,`TLCSet`)),!0}),Ei(`Any`,Ot),V(`RandomElement`,1,e=>Nm(bi(e,0,`RandomElement`),t.getRandom()))],lg=(e,t)=>e.every(e=>yr(e,t)),ug=On([!1,!0]),dg=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Nn(dg(e,t,r),dg(e,r,n))},fg=[`\\cup`,`\\cap`,`\\`],pg=e=>typeof e==`object`&&e.kind===`MixedSet`,mg=e=>e.kind===`Interval`?I(e).elements:e.elements,hg=(e,t,n)=>{let r=mg(t);if(e!==`\\cup`){let t=e===`\\cap`;return kn(r.filter(e=>yr(e,n)===t))}if(r.length===0)return n;if(!rt(n))return Ht({kind:`SetOperation`,operator:e,left:t,right:n});let i=I(n).elements.filter(e=>!yr(e,t));return kn([...r,...i])},gg=[Ei(`TRUE`,!0),Ei(`FALSE`,!1),Ei(`BOOLEAN`,ug),Ei(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ki(`=`,En),ki(`#`,(e,t)=>!En(e,t)),V(`~`,1,e=>!vi(e,0,`~`)),V(`<=>`,2,e=>vi(e,0,`<=>`)===vi(e,1,`<=>`)),V(`/\\`,2,e=>vi(e,0,`/\\`)&&vi(e,1,`/\\`)),V(`\\/`,2,e=>vi(e,0,`\\/`)||vi(e,1,`\\/`)),V(`=>`,2,e=>!vi(e,0,`=>`)||vi(e,1,`=>`)),V(`\\in`,2,e=>yr(B(e,0,`\\in`),B(e,1,`\\in`))),V(`\\notin`,2,e=>!yr(B(e,0,`\\notin`),B(e,1,`\\notin`))),V(`\\subseteq`,2,e=>{let t=yi(e,0,`\\subseteq`),n=B(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&F(t.base)?lg(I(t.base).elements,n.base):lg(I(t).elements,n)}),...fg.map(e=>V(e,2,t=>{let n=B(t,0,e),r=B(t,1,e);if(rt(n)&&rt(r)&&!pg(n)&&!pg(r)){if(e===`\\cup`&&L(n))return r;let t=e===`\\cup`?Nn:e===`\\cap`?Mn:jn;return vr((e,n)=>t(I(e),I(n)),(t,n)=>hg(e,t,n),n,r)}return rt(n)?hg(e,n,r):e!==`\\`&&rt(r)?hg(e,r,n):Ht({kind:`SetOperation`,operator:e,left:n,right:r})})),V(`SUBSET`,1,e=>({kind:`Subset`,base:B(e,0,`SUBSET`)})),V(`UNION`,1,e=>{let t=yi(e,0,`UNION`),n=un(t)?t.elements.filter(un):[];if(!un(t)||n.length!==t.elements.length)return Ht({kind:`Union`,base:t});if(pg(t)||n.some(pg)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{yr(t,e)||e.elements.push(t)})),kn(e.elements)}return n.length===0?An:dg(n.map(I),0,n.length)}),V(`DOMAIN`,1,e=>{let t=B(e,0,`DOMAIN`);if(!N(t))throw new _(`DOMAIN expects a function but received ${R(t)}`);return Nr(t)})],_g=Vi(`Integers`,`Neg`,`IntValue`,1),vg=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 f(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new f(`0^0 is undefined.`);return e**t}),Hi(e,`\\div`,`Divide`,(t,n)=>{if(n===0)throw new f(`The second argument of \\div is 0.`);if(e===`Naturals`){let e=Math.trunc(t/n)|0;return e<0&&Math.imul(e,n)!==t?e-1:e}let r=Math.floor(t/n);if(Ai(r))throw ji(`${t} \\div ${n}`);return r}),Hi(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new f(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),V(`..`,2,e=>({kind:`Interval`,low:Bi(B(e,0,`..`),t),high:Bi(B(e,1,`..`),t)}))]},yg=vg(`Naturals`),bg=vg(`Integers`),xg=e=>{let t=yg.indexOf(e);return t===-1?void 0:bg[t]},Sg=[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,`>`)],Cg=[Ei(`Int`,{kind:`InfiniteSet`,name:`Int`}),...bg,Wi(`>=`,(e,t)=>e>=t),V(`-.`,1,e=>{let t=Bi(B(e,0,`-`),_g);if(Ai(-t))throw ji(`-${t}`);return-t})],wg=(e,t,n)=>{let r=B(e,t,n),i=hr(r);if(!i)throw new f(`${n}\n${R(r)}`);return i},Tg=(e,t,n)=>{let r=B(e,t,n);return typeof r==`string`?r:wg(e,t,n)},Eg=(e,t,n)=>typeof e==`string`?xt(e.slice(t,n)):Wn(e.slice(t,n)),Dg=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Og=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,kg=(e,t)=>{let n=ef.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?zi(e,t):e}):t},Ag=e=>kg(`Sequences`,[V(`Seq`,1,e=>({kind:`SequenceSet`,base:B(e,0,`Seq`)})),V(`Len`,1,e=>Tg(e,0,Dg(``,`Len`)).length),V(`\\o`,2,e=>{let t=Tg(e,0,Og(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=wg(e,1,Og(`t \\o s`,`sequence`));return Wn([...t,...n])}let n=B(e,1,`\\o`);if(typeof n!=`string`)throw new f(`${Og(`t \\o s`,`string`)}\n${R(n)}`);return xt(t+n)}),V(`Append`,2,t=>Wn([...wg(t,0,Og(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),B(t,1,`Append`)])),V(`Head`,1,e=>{let t=wg(e,0,Dg(``,`Head`));if(t.length===0)throw new f(`Attempted to apply Head to the empty sequence.`);return t[0]}),V(`Tail`,1,e=>{let t=Tg(e,0,Dg(``,`Tail`));if(t.length===0)throw new f(`Attempted to apply Tail to the empty sequence.`);return Eg(t,1)}),V(`SubSeq`,3,e=>{let t=Tg(e,0,Dg(`first `,`SubSeq`)),n=_i(e,1,`SubSeq`),r=_i(e,2,`SubSeq`);if(n>r)return Eg(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new f(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${R(B(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Eg(t,n-1,r)}),Di(`SelectSeq`,2,e=>{let t=Ti(e,1,`SelectSeq`);return Wn(wg(e,0,Dg(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new f(`The second argument of SelectSeq should be a operator, but instead it is:\n${R(n)}`);return n}))})]),jg=e=>kg(`FiniteSets`,[V(`IsFiniteSet`,1,e=>{let t=B(e,0,`IsFiniteSet`);if(M(t))return pr(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new _(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${R(t)}\nis a finite set.`:`Attempted to check if the ${it(t)} ${R(t)} is a finite set.`)}),V(`Cardinality`,1,t=>{let n=B(t,0,`Cardinality`);if(!M(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new f(`Attempted to compute cardinality of the value\n${R(n)}`);return dr(n,e)})]),Mg=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Ng=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:Sg};case`Integers`:return{extends:[`Naturals`],operators:Cg};case`Sequences`:return{extends:[],operators:Ag(n.version)};case`FiniteSets`:return{extends:[],operators:jg(n.version)};case`TLC`:return{extends:[],operators:kg(`TLC`,cg(t,n))};case`Randomization`:return{extends:[],operators:Ih(n)};case`_Possible`:return{extends:[],operators:Zh(t,n)};case`Json`:return{extends:[],operators:Oh(r)};case`Bags`:return{extends:[],operators:sh(i)};case`TLCExt`:return{extends:[],operators:Xh(t,n)};default:return}},Pg=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}])),Fg={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]}},Ig=(e,t)=>{let n=Fg[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},Lg=`$subexpression`,Rg=(e,n)=>new t(`${e} at line ${n.line}, column ${n.column}`),zg=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return zg(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of pi(e)){let e=zg(r,t,n);if(e)return e}},Bg=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),Vg=(e,t)=>{let n=e.location,r=Bg(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 Rg(`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 Rg(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Lg,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Lg,args:e.args,location:n,resolution:Ca},location:n}},Hg=(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:Ca})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Ca}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Ca};return Vg({...t,params:[...t.params,...r]},a)},Ug=(e,t,n,r)=>{let i=n.location,o={params:[],args:[],lets:[],location:i},s={index:0,current:void 0,isFailed:!1},c=(t,r)=>{if(!t)throw Rg(r,i);Ta.set(n,{args:e.slice(0,s.index).flatMap(e=>`args`in e?e.args:[]),error:{location:a(t),message:r}}),s.isFailed=!0},l=n=>{let r=[],a=[];for(;s.index<e.length;){let o=e[s.index];if(o.kind!==`Name`)throw Rg(`Expected an operator name`,i);r.push(o.name),a.push(...o.args);let c=r.join(`!`),l=n?n.find(e=>qo(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-o.args.length};s.index++}throw Rg(`Unknown operator ${r.join(`!`)}`,i)},u=t=>{let a=l(t),u=a.definition,d=Aa(u),f=s.index===e.length-1;if(a.args.length!==d&&(!r||a.args.length!==0))return c(n.argumentRanges?.[s.index]??i.range,`The operator ${a.name} requires ${d-a.earlier} arguments.`);if(f)return{definition:u,args:a.args};if(u.kind!==`Operator`)throw Rg(`Cannot select a subexpression of ${u.name}`,i);o.params.push(...u.params),o.args.push(...a.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 i=n.selectorRanges?.[s.index],a=s.current&&zg(s.current,t.name,[]);if(!a)return c(i,`Cannot find label \`${t.name}'.`);let l=a.label.params;if(!r&&t.args.length!==l.length)return c(i,`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 Rg(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(n.kind===`Label`){s.current=n.body,f(t);return}if(n.kind===`Let`){if(t.kind!==`Operand`||Za(t.operand,1)!==0)throw Rg(`A LET/IN expression has only one operand`,i);o.lets.push(n.definitions),s.current=n.body;return}let r=to(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}]:[]],a=r[Za(t.operand,r.length)],o=e[s.index+1];if(!a||o?.kind!==`Operand`)throw Rg(`A subexpression of CASE must have the form !i!j`,i);s.index++;let c=Za(o.operand,2),l=c===0?a.condition:c===1?a.body:void 0;if(!l)throw Rg(`Nonexistent CASE operand`,i);s.current=l;return}if(t.kind!==`Operand`)throw Rg(`Unexpected subexpression selector`,i);let a=r?r.sets:no(n),c=a?.[Za(t.operand,a.length)];if(!c)throw Rg(`Nonexistent operand specified by the selector`,i);s.current=c},p=u(void 0);if(s.isFailed)return n;if(p)return Hg(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 Rg(`A name selector here must be from a LET clause`,i);o.lets.push(s.current.definitions);let e=u(s.current.definitions);if(s.isFailed)return n;if(e)return Hg(e.definition,{...o,args:[...o.args,...e.args]});d()}else f(t),s.index++}if(s.isFailed)return n;if(!s.current)throw Rg(`Subexpression selection failed`,i);return Vg(o,s.current)},Wg=(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 Qa(e,t,n)},Gg=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||pi(e).some(Gg),Kg=(e,t,n,r=!1)=>{if(!Gg(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=Xo(e,e=>Kg(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>qg(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)=>Kg(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:Xo(e,e=>Kg(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?Wg(a.name,[],void 0,t):a.kind===`Apply`?Wg(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=Ug(o,t,a,r);return c!==a&&wa.add(c),c},qg=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:Kg(e.expression,t,n,!0)}))}),Jg=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},Yg=(e,t)=>qg(e,Jg(t.definitions),()=>!1),Xg=(e,t)=>{let n=Jg([...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=>Kg(e,n,i),o=e=>i(e)||!n(e),s=e=>Kg(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 qg(e,n,o);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?qg(e,n,o):Yo(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=>Gg(e.body))||e.assumptions.some(e=>Gg(e.expression))?{...p,definitions:e.definitions.map(e=>Yo(e,a)),assumptions:e.assumptions.map(e=>({...e,expression:a(e.expression)}))}:p},Zg=(e,t)=>`${e}${t}`,Qg=(e,t,n)=>`${e}${t}${n}`,$g=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},e_=(e,t,n)=>`${e},${t},${n}`,t_=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),n_=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),r_=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),i_=(e,t,n,r)=>({...t_(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),a_=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,o_=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,s_=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,{...i_(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),c_=i_(`$Set`,0,[2],[1]),l_=i_(`$Junction`,0,[3],[1]),u_=i_(`$Choose`,0,[2],[1]),d_=i_(`$Function`,0,[3],[1]),f_=i_(`$FcnApply`,0,[2,2],[1,1]),p_=i_(`$RcdSelect`,0,[2,0],[1,1]),m_=i_(`'`,2,[1],[0]),h_=i_(`ENABLED`,1,[2],[0]),g_=i_(`[]`,3,[3],[0]),__=i_(`$SquareAct`,2,[2,1],[0,0]),v_=i_(`$WF`,3,[1,2],[0,0]),y_=i_(`$TemporalExists`,3,[3],[0]),b_=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),x_=e=>e.map(e=>({name:e,arity:0})),S_=(e,n)=>n.location.range?r(`${e}.`,n.location.range):new t(`${e} at line ${n.location.line}, column ${n.location.column}`),C_=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),w_=e=>e.kind!==`Let`&&e.kind!==`Label`,T_=e=>{let n=/* @__PURE__ */ new Map,r=(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=s_.get(t)??Pg.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=t_(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(Qg(e,n,t))}),t.data.constraints.forEach((e,t)=>n_(r.constraints,t,e)),r_(r.argConstraints,Zg(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>r_(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(e,n,r=[],i=[])=>{let a=e=>i.includes(e);if(n.forEach((n,r)=>{if(!(n.operator||n.declared)&&n.data.level>a_(e,r))throw new t(`Level error in applying operator ${e.name}:\nThe level of argument ${r+1} exceeds the maximum level allowed by the operator`)}),r.some(e=>e.level>2))throw new t(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=t=>{let r=e.formals.findIndex(e=>e.name===t);return r===-1?void 0:n[r]},s=(t,n,r)=>e.conditions.has(e_(t,n,r)),c=t_(Math.max(e.level,...n.filter((t,n)=>o_(e,n)===1).map(e=>e.data.level),...r.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),n.forEach((t,n)=>{o_(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),r.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>n_(c.constraints,t,e)),n.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||n_(c.constraints,t,e)})),r.forEach(e=>e.constraints.forEach((e,t)=>n_(c.constraints,t,e))),n.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||n_(c.constraints,t,a_(e,n))})),n.forEach((e,t)=>{let r=e.operator;r&&n.forEach((e,n)=>r.formals.forEach((i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>n_(c.constraints,e,a_(r,a)))}))}),e.argParams.forEach(e=>{let t=$g(e),n=o(t.operator)?.operator;n&&n_(c.constraints,t.param,a_(n,t.index))}),[e.argConstraints,...n.map(e=>e.data.argConstraints),...r.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>r_(c.argConstraints,t,e))),n.forEach((t,r)=>{let i=t.declared;i&&(Array.from({length:i.arity},(t,n)=>r_(c.argConstraints,Zg(i.name,n),e.minMaxLevels[r]?.[n]??0)),n.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&r_(c.argConstraints,Zg(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=$g(e),n=o(t.operator);n&&r_(c.argConstraints,Zg(t.operator,t.index),n.data.level)}),n.forEach(e=>e.data.argParams.forEach(e=>{a($g(e).param)||c.argParams.add(e)})),r.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=$g(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(Qg(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(Qg(t.operator,t.index,e)))}}),n.forEach((e,t)=>{let r=e.declared;r&&n.forEach((e,n)=>Array.from({length:r.arity},(i,a)=>{s(t,n,a)&&e.data.params.forEach(e=>c.argParams.add(Qg(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=_(`LAMBDA`,x_(e.params),e.body,t);return{data:n,operator:n}}let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let i=r(n,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=t_();return e.params.add(n),{data:e,declared:{name:n,arity:i.arity}}}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=b_(n,x_(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw S_(`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 S_(`Action used where only temporal formula or state predicate allowed`,e);C_.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&w_(n)&&n.kind!==r)throw S_(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)=>n_(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>r_(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,n)=>{try{return h(e,n)}catch(n){throw!(n instanceof t)||n.sany?n:S_(n.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return t_();case`Identifier`:return l(r(e.name,t),[]);case`Apply`:{let n=s(e.args,t);return d(e,n),l(r(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(l_,n)}case`Prime`:case`Unchanged`:return c(m_,[e.expression],t);case`Enabled`:return c(h_,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(g_,[n])}case`If`:return c(l_,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(l_,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(l_,[e.body],t,e.bounds.map(e=>e.set),Ha(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw S_(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?y_:l_,[e.body],t,[],e.names);case`Choose`:return c(u_,[e.body],t,e.set?[e.set]:[],Va(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(c_,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(c_,[e.predicate],t,[e.bound.set],Va(e.bound.pattern));case`SetMap`:return c(c_,[e.expression],t,e.bounds.map(e=>e.set),Ha(e.bounds));case`FunctionConstruction`:return c(d_,[e.body],t,e.bounds.map(e=>e.set),Ha(e.bounds));case`Record`:return c(d_,e.fields.map(e=>e.value),t);case`RecordSet`:return c(c_,e.fields.map(e=>e.value),t);case`Except`:return c(c_,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(f_,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(c_,e.args,t)}]);case`Bracket`:return t_();case`FieldAccess`:return a(p_,[o(e.record,t),{data:t_()}]);case`BoxAction`:case`AngleAction`:return c(__,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(v_,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return t_()}},g=(e,t,n=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,r=n,a=t)=>g(e,a,r,i),o=(e,o)=>{let s=r(e,t);s.kind===`Declared`?(n&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return pi(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,n||e.isTemporal===!0,b_(t,x_(e.names))),i;default:return Xo(e,(e,r)=>(a(e,n,b_(t,x_(r))),e)),i}},_=(e,t,n,r)=>{let i=b_(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...t_(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(Zg(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(Qg(e.name,n,t.name))).map(e=>e_(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($g(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=$g(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},v=(e,t)=>{let r=n.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];n.set(e,{...t_(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=_(e.name,i,a,t);return n.set(e,o),o};return{analyze:m,analyzeDefinition:v,toOperand:o}},E_=(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`?E_(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=t_(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>n_(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>r_(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},D_=(e,t,n,r)=>{let i=T_(t),o=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),s=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?o([t.expression]):t.kind===`Witness`?o(t.expressions):t.kind===`Take`?o(t.bounds.map(e=>e.set)):t.kind===`Pick`?o([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?E_(t.statement,/* @__PURE__ */ new Map,i).level:o([t.statement]):0},c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=a(e.statement),n=()=>s(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...c(e.proof)]:e.body.kind===`Qed`?c(e.proof):[]}):[],l=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>s(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>o([e.set])!==0).flatMap(e=>e.set.location.range?[{location:a(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...l(e.proof),...r,...e.proof?.kind===`Steps`&&n()?c(e.proof):[]]}):[],d=Bo([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?E_(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...l(e.proof),...t.level===3?c(e.proof):[]];if(n.length>0)throw u(n)}})),...n],r);if(d.length>0)throw u(d,!1,void 0,r)},O_=(e,t)=>e.maxLevels[t]??3,k_=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=T_({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=>n_(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>n_(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>r_(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=$g(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)&&n_(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(E_(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,o=a(t.location.range??{module:t.instancer,start:t.location,end:t.location}),s=e=>r.set(`${o}\n${e}`,{location:o,message:e}),c=e(t.module),l=i(t.module),d=n(t.instancer),f=/* @__PURE__ */ new Map;t.lets.forEach(e=>f.set(e.name,{kind:`Let`,definition:e,scope:f}));let p=[...c.constants.map(e=>({...e,maximumLevel:0})),...c.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=d.analyze(n,f);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=d.toOperand(n,f);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),m=(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(p.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&s(m(e.name,e.maximumLevel)),e.isLeibniz||s(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),p.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&s(m(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=l.argConstraints.get(Zg(e.name,i));a!==void 0&&O_(r,i)<a&&s(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),l.argParams.forEach(e=>{let n=$g(e),r=p.find(e=>e.name===n.operator)?.operator,i=p.find(e=>e.name===n.param);if(!r||!i)return;let a=O_(r,n.index);i.level>a&&s(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw u([...r.values()])}},A_=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],j_=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),M_=new Map(Jd.flatMap(e=>e.map(t=>[t,e[0]]))),N_=e=>M_.get(e)??e,P_=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},F_=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(P_(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},I_=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),L_=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:N_(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:N_(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},R_=(e,t)=>{let n=[];for(let r=t;;){let t=L_(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},z_=e=>({line:e.line,column:e.column}),B_=(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=R_(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},V_=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,H_={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},U_=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&V_(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&V_(e[n+1],e[n+2])?n+=V_(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=>H_[e])}"`:r.text)}return t},W_=e=>e[2]?.text,G_=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},K_=(e,t)=>e.find(e=>e.name===t)??e.map(e=>K_(e.modules,t)).find(Boolean),q_=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:(Qd.has(i)?t?.(i):void 0)??$d.get(i)??t?.(i)??Jp(e,i),s=o===void 0?[]:me(o),c=G_(s),l=c.get(W_(s)??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=Xp(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>K_(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},J_=(e,t)=>{let n=q_(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],a=(e,n)=>{let i=R_(t,e+1);r.push({location:z_(t[e]),apply:e=>i.forEach(t=>e.put(I_(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,o)=>{let l=e.start+o,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:z_(u),apply:t=>t.put(I_(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&a(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&a(l,`variable`),u.text===`RECURSIVE`&&R_(t,l+1).every(e=>s.has(e))&&a(l,`definition`),j_.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(z_(u)),r.push({location:z_(u),apply:e=>e.put(I_(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(I_(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=N_(e.name);r.push({location:e.location,apply:n=>n.put(I_(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=o(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),a=n.filter(e=>e.kind===`theorem`);[...i,...a].forEach(n=>{n.isLocal||t.put(I_(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(I_(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>ka(e.location,t.location)?-1:+!!ka(t.location,e.location))},i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=e=>{let t=i.get(e??``);if(t)return t;let s=F_();i.set(e??``,s),qd.toReversed().forEach(e=>s.put(I_(e,`builtin`,!1)));let c=n(e);return c.getModule().extends.forEach(e=>o(e).inserted.forEach(e=>{e.isLocal||s.put(e)})),a.set(s,s.inserted.length),r(c).forEach(e=>e.apply(s)),s};return{getContext:o,getOwnEntries:e=>{let t=o(e);return t.inserted.slice(a.get(t))}}},Y_=(e,t,n)=>J_(e,t).getContext(void 0).enumerate().filter(e=>e.kind===n).map(e=>e.name).reverse(),X_=(e,t)=>{let n=J_(e,t);return n.getContext(void 0),e=>n.getOwnEntries(e).filter(e=>e.kind===`definition`).map(e=>e.name)},Z_=(e,t)=>Y_(e,t,`variable`),Q_=(e,t,n)=>{let r=q_(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),Yd.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Map,d=e=>{let t=u.get(e);if(t)return t;let n=B_(s(e),e,l);return u.set(e,n),n},f=e=>l.get(e)??d(e),p=/* @__PURE__ */ new Set,m=(e,t)=>l.has(t)||p.has(`${e.key}>${t}`),h=(e,t,n)=>{let r=[...e.extends.map(f),...e.instances.filter(t=>m(e,t)).map(f),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},g=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!m(n,e));return i===void 0?h(n,r,t):[n,i]};return t},_=g(e=>e.extends),v=g(e=>e.instances),y=/* @__PURE__ */ new Set([void 0]),b=/* @__PURE__ */ new Map;U_(s(void 0)).forEach((e,t)=>{t===3&&Zd.forEach(a),a(e)});let x=d(void 0);for(;;){let e=_(x,/* @__PURE__ */ new Set)??v(x,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;if(p.add(`${t.key}>${n}`),b.set(t.unit,[...b.get(t.unit)??[],n]),!y.has(n)){if(y.add(n),r(n).tokens.length===0){let e=t.unit??W_(r(void 0).tokens);throw c(n,e)}U_(s(n)).forEach(a)}}A_.forEach(a);let ee=/* @__PURE__ */ new Set,S=e=>{if(ee.has(e))return;ee.add(e);let t=b.get(e)??[],n=d(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(S),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return S(void 0),Xd.forEach(a),[...i]},$_=e=>{switch(e.kind){case`Number`:try{return at(e.value)}catch(e){throw p(e,m.error)}case`String`:case`Boolean`:return e.value;case`ModelValue`:return Mt(e.name);case`Set`:return On(e.elements.map($_))}},ev=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],tv=(e,n)=>{try{return Xp(e)}catch(r){if(!(r instanceof t))throw r;let i=Sp(e);throw i===void 0?r:u([{location:`In module ${n}`,message:`Could not parse module ${n} from file ${n}.tla`}],!0,i)}},nv=e=>new t(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),rv=(e,t)=>e.location.range&&t.location.range&&{location:a(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${a(t.location.range)}.`},iv=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,av=e=>e===`Theorem`?`ThmOrAssumpDefNode`:iv(e),ov=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Ca},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),sv=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>R(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new _(`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`)&&qt(t,r)})});if(t)return t[1];throw new _(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:R(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},cv=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||pi(e).some(e=>cv(e,t)),lv=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(as(e),n.get(e)??n.size)),n},uv=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),dv=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw ol(e);if(e.kind===`Number`&&!hu(e.value))throw sl(e);dv(e.kind===`Let`?[...pi(e),...uv(e.instances??[])]:pi(e))}),fv=(e,n)=>{let r=Xp(n.source),i=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,d=/* @__PURE__ */ new Set,f=new Map(gg.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=Pm(e.checkDeadlock,n.seed);m.isWarningEnabled=n.isWarningEnabled??!0,m.isTool=n.isTool??!1,m.version=n.version??`master`;let h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,y=[],b=/* @__PURE__ */ new Map,ee=[],S=[],te=(e,t)=>ee.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne={value:0},re=e=>`${e}#${ne.value++}`,ie=[],C=[],ae=k_(e=>{let t=v.get(e)??ue(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)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,ce=/* @__PURE__ */ new Map,w=e=>{let t=p.get(e);if(t)return t;let r=Ng(e,n.print,m,n.files,f);if(!r)return;Mg.get(e)?.forEach(w);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>w(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{f.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Pg.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ig(e,t.name)??i.get(t.name)?.range})}),p.set(e,i),i},T=e=>{if(Qd.has(e)&&n.loadModule?.(e)!==void 0)return;let t=w(e),r=Mg.get(e)??[];return t&&te(e,r),t&&r.includes(`Integers`)&&w(`Integers`),t},E=e=>(dv([...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]),...uv(e.instances)]),e.modules.forEach(E),e);E(r);let D=(e,t)=>{let r=n.loadModule?.(e)??Fd.get(e)??Jp(n.source,e);if(r===void 0)throw c(e,t);let i=tv(r,e);if(i.name!==e)throw u([{location:`Unknown location`,message:`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`}],!0);return E(i)},le=e=>{let n=S.indexOf(e.name);if(n!==-1){let r=[...S.slice(n),e.name].map(e=>`${e}.tla`);throw new t(`Circular dependency among .tla files; dependency cycle is: ${r.join(` --> `)}`)}let r=/* @__PURE__ */ new Set,i=[],a=[],o=[];S.push(e.name),ee.push(r);let s=be(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:C,levelChecks:o});if(ee.pop(),S.pop(),a.length>0)throw u(a,!1,void 0,C);let c=i.find(e=>r.has(e.name)),l=c&&h.get(c.name),d=l&&rv(c,l.module);if(d)throw u([d],!1,void 0,C);if(c)throw nv(c);return o.forEach(e=>e()),{linked:s,closure:r}},ue=(e,t)=>{let r=h.get(e);if(r)return te(e,b.get(e)??[]),r;let a=le(D(e,t));return(Bm(m.version).has(e)?Ng(e,n.print,m,n.files,f):void 0)?.operators.forEach(e=>{let t=a.linked.visible.get(e.name);t?.kind===`Definition`&&t.arity===e.arity&&(f.set(t.key,e),i.delete(t.key))}),h.set(e,a.linked),b.set(e,a.closure),te(e,a.closure),a.linked},de=(e,t,n,r,a)=>{let o=a?void 0:T(e.module);if(o)return fe(e,o);let c=a??ue(e.module,t.name);c.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let u=ev(c),f=`#${ne.value++}`,p=new Map(e.params.map(e=>[e.name,`${e.name}${f}`])),m=zo(Yg(e,t),u,t,n);ie.push({module:e.module,instancer:t.name,lets:[],substitutions:m,location:e.location});let h=_s({params:e.params.map(e=>({...e,name:`${e.name}${f}`})),substitutions:new Map([...m].map(([e,t])=>[e,Wo(t,p)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,a,o)=>{let c=re(`${a}@${t.name}`),f=o(c);return i.set(c,f),u.length>0&&d.add(f),e.name!==void 0&&se.set(c,`${e.name}!${se.get(n)??a}`),s.set(c,!r),l.set(c,{source:n,prefix:e.params.length}),c},createName:re});return pe(e,c.exported,u,(t,n)=>{let r=e.name===void 0?h.getKey(t):h.getQualifiedKey(t);return u.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&ce.set(r,n),r})},fe=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),pe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},me=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Ca})),he=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:me(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ge=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),_e=(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=ge(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:me(r,n),location:n}}},O=(e,t,n,r)=>{let a=e.location,o=r?void 0:T(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=ge(n.arity);return he(`${e.name}!${t}`,n.key,[...e.params,...r],r,a)});let c=r??ue(e.module,n),l=`#${ne.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=ev(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:a};ie.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:a});let p=new Set(e.params.map(e=>e.name)),m=e=>cv(f(e),p),h=d.map(t=>{let n=_e(f(t),t,a);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:a}}),g=[],_=_s({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:me(e.params,a),location:a,resolution:Ca}:{kind:`Identifier`,name:`${t.name}${l}`,location:a,resolution:Ca}])),variables:new Set(c.variables),getDefinition:e=>i.get(e),isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:ov(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=ge(n.arity),o=[...e.params,...i];return he(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?i:o,a)});return[...h,...g,...y]},ve=e=>[...e].flatMap(([e,t])=>{let n=i.get(t.key);return n?[{...n,name:e}]:[]}),ye=/* @__PURE__ */ new Map,be=(e,t)=>{let o=Kd(e,n.loadClass?.(e.name),e===r);ye.set(e.name,o.overrides);let c=o.module,l=ie.length,u=new Map([...gg.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...t.symbols]),d=/* @__PURE__ */ new Map,f={location:Po,errors:[],warnings:[]},p=[f],m=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){u.set(t,e),h.set(t,e);return}if(!n.range||!e.range||a(n.range)===a(e.range))return;let r=a(e.range),i=a(n.range);av(n.kind)===av(e.kind)?f.warnings.push({location:r,message:`Warning: the ${iv(n.kind)} of '${t}' conflicts with \nits ${iv(n.kind)} at ${i}.`}):f.errors.push({location:r,message:`The ${iv(e.kind)} of '${t}' conflicts with \nits ${iv(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Set,b=/* @__PURE__ */ new Map,x=[],ee=[...c.constants],S=c.variables.map(e=>e.name),te=c.variables.map(e=>e.location);c.extends.forEach(e=>{let n=t.modules.get(e),r=n?void 0:T(e);if(r){m(r);return}let i=n??ue(e,c.name);ee.push(...i.constants.filter(e=>ee.every(t=>t.name!==e.name))),i.variables.forEach((e,t)=>{S.includes(e)||(S.push(e),te.push(i.variableLocations[t]))}),m(i.exported),i.facts.forEach(e=>_.add(e)),i.modules.forEach((e,t)=>b.set(t,e)),x.push(i)});let ne=new Map(u),re=[...c.constants.map(e=>({...e,kind:`Constant`})),...c.variables.map(e=>({...e,kind:`Variable`}))],oe=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});re.forEach(e=>h.set(e.name,oe(e)));let se=e=>({key:E(e),arity:Aa(e),params:ja(e),kind:Fo(c,e)?`Theorem`:`Definition`,range:e.location.range}),w=ee.length===0&&S.length===0,E=e=>c===r?e.name:`${e.name}@${t.id}`,D=/* @__PURE__ */ new Map,le=()=>new Map([...t.modules,...b]),me=e=>{let t=c.instances.find(t=>t.module===e.name);return t!==void 0&&ka(e.location,t.location)},he=e=>{let t=c.modules.find(t=>t.name===e.module);return t?me(t)?b.get(t.name):void 0:le().get(e.module)},ge=e=>({imported:u,getInstance:e=>{let t=he(e),n=t?void 0:T(e.module);if(n)return{declarations:[],symbols:fe(e,n),instancer:c.name};let r=t??ue(e.module,c.name),i=ev(r);return{declarations:i,symbols:pe(e,r.exported,i,e=>e),instancer:c.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:E,instanced:D,facts:_,reports:p,warnings:t.warnings}),_e=e=>[...re.filter(t=>ka(t.location,e)).map(e=>[e.name,oe(e)]),...c.definitions.filter(t=>ka(t.location,e)).map(e=>[e.name,se(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(u)),xe=e=>{let n=le(),r=n.get(e.name),i=r&&rv(e,r.module);if(r&&!i)throw nv(e);t.nested.push(e);let a={location:e.location,errors:[],warnings:[]};p.push(a);let o=be(e,{id:`${t.id}/${e.name}`,symbols:_e(e.location),modules:n,nested:t.nested,errors:a.errors,warnings:a.warnings,levelChecks:t.levelChecks});i&&a.errors.push(i),r||b.set(e.name,o),g.has(e.name)||g.set(e.name,o)};[...c.instances.map(e=>({location:e.location,link:()=>{let t=de(e,c,ge(c),w,le().get(e.module));D.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:()=>xe(e)}))].sort((e,t)=>ka(e.location,t.location)?-1:1).forEach(e=>e.link());let Se=Xg(xs(c,(e,t)=>O(e,t,c.name,he(e))),ve(u));t.errors.push(...Vo(Se,ge(Se))),Se.definitions.forEach(e=>{let t=E(e);i.set(t,e),s.set(t,!w);let n=se(e),r=d.get(e.name);(n.kind!==`Theorem`||u.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ka(r,e.location))&&(u.set(e.name,n),e.isLocal||h.set(e.name,n))});let Ce={module:Se,constants:ee,variables:S,variableLocations:te,visible:u,exported:h,modules:b,extended:x,facts:/* @__PURE__ */ new Set([..._,...[...Se.theorems,...Se.assumptions].flatMap(e=>e.name??[])])};v.has(c.name)||v.set(c.name,Ce);let we=ie.splice(l).map(e=>({location:e.location,check:()=>ae(e)}));return t.levelChecks.push(()=>D_(Se,{constants:new Set(ee.map(e=>e.name)),variables:new Set(S),getDefinition:e=>i.get(u.get(e)?.key??e),getQualifiedName:e=>ce.get(u.get(e)?.key??e)},we,C)),y.push(Ce),Ce},xe=le(r).linked;C.length>0&&!n.isSanyReported&&n.print(o(C));let Se=e=>xe.visible.get(e)?.key??e;xe.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)});let Ce=[],we=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>we(e,t)),Ce.push(...e.module.assumptions))};we(xe,/* @__PURE__ */ new Set);let k=xe.constants.map(e=>e.name),Te=xe.variables,A=e=>e.module===void 0?[e.name,Se(e.name)]:e.module===r.name||k.includes(e.name)?[]:[(h.get(e.module)??g.get(e.module))?.visible.get(e.name)?.key??e.name],Ee=e=>{let t=i.get(e);return t?.kind===`Operator`?t.params.length:xe.constants.find(t=>t.name===e)?.arity??0},De=/* @__PURE__ */ new Map,Oe=/* @__PURE__ */ new Set,ke=(e,t)=>{f.set(e,t),i.delete(e),De.delete(e),Oe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=$_(e.value);Tn(t),A(e).forEach(e=>{let n=Ee(e);n===0?De.set(e,t):ke(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Ae=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Ae.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new x(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map($_),$_(e.value)]),Ae.set(t,n)}),Ae.forEach(e=>A(e).forEach(t=>ke(t,sv(e.name,Ee(t)||e.rows[0][0].length,e.rows))));let je=new Map(e.substitutions.flatMap(e=>A(e).map(t=>[t,Se(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!k.includes(n)&&!xe.visible.has(n))throw new x(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new x(`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 a=Se(r),o=i.get(a);if(!(o!==void 0||f.has(a)||De.has(a)||k.includes(r)||Te.includes(r)))throw new x(`The configuration file substitutes for ${n} with the undefined identifier ${r}.`);if(o?.kind===`Operator`&&o.params.length!==(xe.constants.find(e=>e.name===n)?.arity??xe.visible.get(n)?.arity))throw new x(`The configuration file substitutes for ${n} with ${r} of different number of arguments.`)});let Me=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(A)),Ne=(e,t)=>{if(Me.has(e))return{key:e,prefix:t};let n=l.get(e);return n&&Ne(n.source,t+n.prefix)};l.forEach((e,t)=>{let n=Ne(e.source,e.prefix),r=i.get(t);if(!n||!r)return;let a=r.kind===`Operator`?r.params:[],o=he(t,n.key,a,a.slice(n.prefix),r.location);i.set(t,o),xe.visible.forEach((e,n)=>{e.key===t&&n!==t&&i.set(n,o)})});let Pe=k.filter(e=>!De.has(e)&&!je.has(e)&&!Oe.has(e));if(Pe.length>0&&!n.isUnconfigured){let e=Y_(n.source,n.loadModule,`constant`).find(e=>Pe.includes(e))??Pe[0];throw new x(`The constant parameter ${e} is not assigned a value by the configuration file.`)}n.isTraceRecorded&&f.forEach((e,t)=>{let n=xg(e);n&&f.set(t,n)});let Fe={runtime:m,definitions:i,builtins:f,constants:De,substitutions:je,instanceNames:se,variables:Te,variableIndex:lv(Te,y.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,substitutedDefinitions:d,evaluators:/* @__PURE__ */ new WeakMap},Ie=T_({constants:new Set(De.keys()),variables:/* @__PURE__ */ new Set([...Te,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>f.has(e))]),getDefinition:e=>hl(e,Fe)}),Le=e=>{try{U(e,{environment:Fe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof _)return e;throw e}};je.forEach((e,t)=>{let n=i.get(e),r=k.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Ie.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Le(n.body):void 0;if(r){let n=ga(r)?``:` - specifically: ${r.message}`;throw new x(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),m.version!==`1.7.4`&&(m.isStarted=!0);let j=new Set(y.flatMap(e=>e.module.instances.map(e=>e.module))),Re=X_(n.source,n.loadModule);return{environment:Fe,assumptions:Ce,variableLocations:xe.variableLocations,instanceActions:oe,startupDefinitions:y.filter(e=>!j.has(e.module.name)||ev(e).length===0).flatMap(e=>Re(e===xe?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),rootConstants:xe.constants,rootSymbols:xe.visible,javaOverrides:y.flatMap(e=>ye.get(e.module.name)??[])}},pv={kind:`Boolean`,value:!0},mv={kind:`Boolean`,value:!1},hv=e=>e?pv:mv,gv=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,_v=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,vv=(e,t)=>({kind:e,body:t}),yv=(e,t,n)=>({kind:e,operands:[t,n]}),bv=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?bv(e,t.operands).operands:[t])}),xv=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return xv(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,xv(t)),0)}},Sv=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return Sv(e.body);case`And`:case`Or`:return e.operands.some(Sv)}},Cv=/* @__PURE__ */ new WeakMap,wv={count:0},Tv=e=>{let t=Cv.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${wv.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(Tv).join(`,`)})`;default:return`${e.kind}(${Tv(e.body)})`}})();return Cv.set(e,n),n},Ev=(e,t)=>e===t||Tv(e)===Tv(t),Dv=(e,t)=>{let n=Tv(t);return e.some(e=>e===t||Tv(e)===n)},Ov=e=>e===`And`?`Or`:`And`,kv=(e,t)=>{switch(e.kind){case`Boolean`:return t?hv(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?vv(`Not`,e):e;case`Not`:return kv(e.body,!t);case`And`:case`Or`:return bv(t?Ov(e.kind):e.kind,e.operands.map(e=>kv(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return vv(n,kv(e.body,t))}}},Av=e=>{switch(e.kind){case`Boolean`:return hv(!e.value);case`Not`:return e.body;case`And`:case`Or`:return bv(Ov(e.kind),e.operands.map(Av));case`Always`:return vv(`Eventually`,Av(e.body));case`Eventually`:return vv(`Always`,Av(e.body));default:return vv(`Not`,e)}},jv=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=jv(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return hv(t)}return n.length===0?hv(!t):n.length===1?n[0]:bv(e.kind,n)}case`Not`:{let t=jv(e.body);return t.kind===`Boolean`?hv(!t.value):vv(`Not`,t)}case`Always`:case`Eventually`:{let t=jv(e.body);return vv(e.kind,t.kind===e.kind?t.body:t)}default:return e}},Mv=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Nv=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=Nv(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new _(`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=>bv(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Nv(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=Mv(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:bv(`Or`,t);n.push(vv(`Always`,vv(`Eventually`,e)))}return bv(`Or`,n)}case`Not`:return gv(e.body)?e:Nv(Av(e.body));default:return e}},Pv=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Pv(e.operands[0]):bv(e.kind,e.operands.map(Pv));case`Not`:return e.body.kind===`Not`?Pv(e.body.body):vv(`Not`,Pv(e.body));case`Always`:case`Eventually`:case`Next`:return vv(e.kind,Pv(e.body));default:return e}},Fv=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Fv(e.operands[0]);let t=Math.floor(e.operands.length/2);return yv(e.kind,Fv(bv(e.kind,e.operands.slice(0,t))),Fv(bv(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return vv(e.kind,Fv(e.body));default:return e}},Iv=(e,t)=>{e.kind===`Eventually`&&!Dv(t,e)&&t.push(e),`body`in e&&Iv(e.body,t),`operands`in e&&e.operands.forEach(e=>Iv(e,t))},Lv=e=>{let t=e.filter(_v),n=e.flatMap(e=>e.kind===`Not`&&_v(e.body)?[e.body]:[]);return!t.some(e=>Dv(n,e))},Rv=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,vv(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new _(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},zv=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:vv(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Bv=(e,t,n)=>e.flatMap(e=>{let r=zv(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Vv=e=>[...new Set(e.map(Tv))].sort().join(`|`),Hv=(e,t)=>{let n=new Set(t.map(Vv));return[...e.filter(e=>!n.has(Vv(e))),...t]},Uv=e=>{let t=Rv(e),n=Bv(t,`Always`,`And`),r=Bv(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=zv(t,`Eventually`,`Or`);if(n&&!(Dv(e,n.first)||Dv(e,n.second)))return Hv(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(Dv(e,t.first)||Dv(e,t.second))&&!Dv(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Lv(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=zv(t[e],`Always`,`And`);n&&(Dv(t,n.first)||t.push(n.first),Dv(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)Dv(t,e.first)&&Dv(t,e.second)&&!Dv(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Lv(t)?[]:i(t)};return a(e)},Wv=e=>({particle:e,successors:[],statePredicates:e.filter(e=>xv(e)<=1)}),Gv=e=>{let t=Uv([e]).map(Wv),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Vv(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Uv(n)){let n=Vv(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Wv(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Kv=(e,t)=>!Dv(e,t)||Dv(e,t.body),qv=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&xv(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=Mv(e);if(n){let e=xv(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(Sv(e))throw new _(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Jv=(e,t)=>{let n=e.findIndex(e=>Ev(e,t));return n===-1?(e.push(t),e.length-1):n},Yv=e=>{let t=Nv(jv(kv(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Pv(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])qv(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:bv(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:Ev(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Fv(e.formula),n=[];t&&Iv(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Jv(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Jv(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Jv(i,e))}));return{tableau:t&&Gv(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Xv=()=>p(new _(`Temporal formula is a tautology (its negation is unsatisfiable).`),m.livenessEvaluationFailure),Zv=()=>p(new n,m.error),Qv=/* @__PURE__ */ new Set([`~>`,`-+->`]),$v=/* @__PURE__ */ new WeakMap,ey=/* @__PURE__ */ new WeakSet,ty=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),ny=(e,t)=>new _(`TLC cannot handle the temporal formula ${Qc(e)}${t===void 0?``:`:\n${t}`}`),ry=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=cl(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return ry(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?ry(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=hl(e,n);if(t)return iy(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?r.isStateLevel&&!r.isLevelConstant?1:0:void 0},o=(e,t)=>r.has(e)?0:z(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Xo(e,(e,a)=>(i.value=Math.max(i.value,ry(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 Qv.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},iy=(e,t)=>{let n=$v.get(e);if(n!==void 0)return n;$v.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max(ry(e.body,void 0,t),...r.map(e=>ry(e.set,void 0,t)));return $v.set(e,i),i},ay=(e,t)=>{try{return Ol(e,t)}catch(e){if(!(e instanceof _))throw e;if(!ga(e))return;throw p(new _(`${S(`tlc2.tool.EvalException`)}${e.message}`),m.error)}},oy=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o)=>{let s=(e,t,s=o,c=i,l)=>oy(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,Qc(e)));if(e.kind===`Label`)return s(e.body,t);if(e.kind===`Let`)return s(e.body,sy(e,t,n));if(e.kind===`Identifier`){let r=z(e)?cl(t,e.name):void 0;if(r?.kind===`Thunk`)return s(r.expression,r.scope);let a=n.constants.has(e.name)?void 0:hl(e.name,n);if(!r&&a?.kind===`Operator`&&a.params.length===0&&iy(a,n)>0){if(i.has(a))throw Zv();return s(a.body,void 0,a.name,/* @__PURE__ */ new Set([...i,a]),a)}}let c=ty(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||ry(e,t,n)===3)){let t=$l(e,c),r=z(e)?void 0:hl(e.operator,n);if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&!a)return s(t.body,du(t,e.args,c),e.operator,i,r)}let l=r&&e.kind===`Forall`&&e.bounds.every(e=>ry(e.set,t,n)===0),u=l?ay(e.bounds,c):void 0;if(l&&u){let n=[];if(kl(e.bounds,u,t,t=>(n.push(...s(e.body,t,Qc(e.body))),!1)),n.length===0)throw Xv();return n}return[{expression:e,scope:t,name:o}]},sy=(e,t,n)=>{let r=pu(e.definitions,ty(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&ey.add(e.binding);return r},cy=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),ly=(e,t,r)=>{let i=r.runtime.version===`1.7.4`,a=(e,t,n)=>{let a=n===0&&!i?ry(e,t,r):n;if(a===0){let n=U(e,ty(r,t));if(typeof n!=`boolean`)throw new _(`TLC expected a boolean value, but did not find one. ${$c(e)}`);return hv(n)}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 Zv();o.depth++;let i=p(e,t);o.depth--;let s=xv(i);return s>2?i:a(n,r,s)},c=(e,t)=>{let n=e.kind===`Identifier`?e.name:e.operator,a=ty(r,t),o=z(e)||hl(n,r)===void 0?cl(t,n):void 0;if(o?.kind===`Thunk`&&ey.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:z(e)?eu(n,a):Zl(n,r);if(c?.kind!==`Closure`)throw ny(e);let u=e.kind===`Apply`?e.args:[],d=!z(e)&&hl(n,r)?.isRecursive===!0;return l(e,()=>(i&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>U(e,a)),s(c.body,du(c,u,a),e,t)),d)},l=(e,t,r=!1)=>{try{return t()}catch(t){let a=t instanceof n||r&&!i;throw!(t instanceof _)||a?t:ny(e)}},u=(e,t)=>{let i=ry(e,t,r);if(!e.bounds.every(e=>ry(e.set,t,r)===0)){if(i<=2)return a(e,t,i);throw ny(e)}let o=[],s=e.kind===`Forall`;try{Al(e.bounds,ty(r,t),t=>(o.push(p(e.body,t)),!1))}catch(r){if(!(r instanceof _)||r instanceof n)throw r;if(i<=2)return a(e,t,i);throw ny(e,s&&!ga(r)?r.message:void 0)}return o.length===0?hv(s):d(e,t,bv(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=xv(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===`~`&&!z(e)||e.operator===`=>`),p=(e,t)=>{let n=ry(e,t,r);if(n<=2&&!f(e))return a(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,sy(e,t,r));case`Identifier`:return c(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?vv(`Always`,yv(`Or`,vv(`Not`,p(n[0],t)),vv(`Eventually`,p(n[1],t)))):e.operator===`~`&&!z(e)?d(e,t,vv(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,yv(`Or`,vv(`Not`,p(n[0],t)),p(n[1],t))):c(e,t)}case`And`:case`Or`:return d(e,t,bv(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!i&&ry(e.condition,t,r)===0){let n=U(e.condition,ty(r,t));if(typeof n==`boolean`)return p(n?e.consequent:e.alternative,t)}let n=p(e.condition,t);return d(e,t,yv(`Or`,yv(`And`,n,p(e.consequent,t)),yv(`And`,vv(`Not`,n),p(e.alternative,t))))}case`Always`:case`Eventually`:return vv(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=cy(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=vv(`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`?vv(`Always`,vv(`Eventually`,yv(`Or`,i,a))):yv(`Or`,vv(`Eventually`,vv(`Always`,i)),vv(`Always`,vv(`Eventually`,a)))}default:throw ny(e)}};return p(e,t)},uy=(e,t,n,r,i)=>{let a=e=>uy(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`?ml(U(e.expression,a),`a temporal property predicate`):Vc(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&&ml(U(e.unchanged,a),`a subscript`)?!1:ml(U(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 uy(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new _(`TLC cannot evaluate a temporal formula in a single step`)}},dy=(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)=>dy(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 uy(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},fy=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return fy(e.body);case`And`:case`Or`:return e.operands.some(fy);default:return!1}},py=e=>e.promises.some(e=>fy(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),my=(e,t)=>e.every((e,n)=>Yt(e,t[n])),hy=e=>e.filter((t,n)=>n===0||e[n-1]!==t),gy=e=>({data:e(1024),length:0,create:e}),_y=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},vy=(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}},yy=e=>new Int32Array(e).fill(-1),by=(e,t)=>(e.edgeStarts[t]??-1)!==-1,xy=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Sy=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Cy=(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),wy=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Ty=2**53-1,Ey=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>ly(e.expression,e.scope,n)),a=e.map(e=>vv(`Not`,ly(e.expression,e.scope,n))),o=a.length===1?a[0]:bv(`Or`,a),s=i.length===0?o:bv(`And`,[...i,o]),c=Yv(s);if(c.length===0)throw Xv();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=Tv(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:gy(e=>new Int32Array(e)),edgeActions:gy(e=>new Uint8Array(e)),stateResults:gy(e=>new Uint8Array(e)),initial:[],firstNodes:gy(yy),lastNodes:gy(yy),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),d={multiplier:1},f=!Eu(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},v=(e,t)=>uy(e,t,void 0,p.environment,f?h(t):/* @__PURE__ */ new Map),y=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!v(e,n))),b=(e,t,n,r)=>g(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!uy(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=h(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!uy(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>v(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},S=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=vy(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n)=>{let r=Cy(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),vy(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],vy(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?_y(e.firstNodes,t,[r]):e.nextSiblings[a]=r,_y(e.lastNodes,t,[r]),r},re=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;_y(e.edgeTargets,a,n),r.forEach((t,n)=>_y(e.edgeActions,(a+n)*o,t)),_y(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&my(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=y(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&S(e)){e.errorNode=a;return}let o=te(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=te(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,l,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of wy(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=te(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),re(e,s,a,c,i)}if(e.errorNode!==void 0)return hy(se(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},oe=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Cy(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{by(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,a,o,r)},se=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)by(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 xy(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}by(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new _(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ce=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>by(e,t)),c=[],l=t=>{let n=xy(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&Kv(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=Ty;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]=Ty,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>Sy(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>xy(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=hy(se(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g={count:f.length+m.length+h.length},v={node:r},y=e=>o.has(e),b=e=>{l.push(v.node),v.node=e};for(;g.count>0;){let r=g.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&Sy(e,v.node,t)&&(f[n]=!0,g.count--)}),n.promises.forEach((e,t)=>{!h[t]&&u(v.node,e)&&(h[t]=!0,g.count--)}),!(g.count<=0);){let n={last:-1,unvisited:-1},o=g.count;if(xy(e,v.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!a(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(v.node,c,e)&&(m[t]=!0,g.count--)})}return g.count<o?(b(r),d.clear(),!0):(y(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(g.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new _(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=xy(e,t).find(e=>y(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,v.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:py(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of xy(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new _(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};xy(e,l).forEach((t,r)=>{by(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(te(n,e,i)??ne(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=y(r,e,t),o=r.solution.tableau,s=o?ae(r,o,n,i,a,e):oe(r,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=ce(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!dy(a[i].body,t,r,0,n)).map(e=>e.name))]}},Dy=`UnnamedAction`,Oy={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},ky=e=>{let t=e.range??Oy;return Gn([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Ay=e=>{let t=[[`name`,e.name],[`location`,ky(e.location)]];return e.parameters.length===0?Gn(t):Gn([...t,[`context`,Gn(e.parameters)],[`parameters`,Wn(e.parameters.map(e=>e[0]))]])},jy=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),My=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ny=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Py=e=>e.kind===`Apply`?e.args:[],Fy=(e,t,n)=>{let r=Ny(e);if(r===void 0)return;if(z(e)){let e=cl(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=Zl(r,n);return i?.kind===`Closure`?i:void 0},Iy=(e,t)=>{try{return U(e,My(t,void 0)),!0}catch(e){if(e instanceof v)return!1;throw e}},Ly=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&yl(e,t)&&Iy(e.body,t),Ry=(e,t)=>{let n=hl(e.name,t);return n?.body===e.body&&Ly(n,t)},zy=(e,t)=>{if(e.kind!==`Identifier`||!z(e))return;let n=cl(t,e.name);return n?.kind===`Thunk`?n:void 0},By=(e,t)=>(e?.params??[]).flatMap(e=>{let n=cl(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Vy=(e,t)=>{try{return e()}catch(e){if(e instanceof v)return t();throw e}},Hy=(e,t,n,r,i)=>{let a=Py(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>ry(e,n,i)!==0)?o():Vy(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),U(e,My(i,n))]),expression:t,scope:n}],o)},Uy=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Dy,location:e.location,parameters:By(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return Uy(e.body,pu(e.definitions,My(r,t)),n,r,i);case`Label`:return Uy(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>Uy(e,t,n,r,i));case`Exists`:return Vy(()=>{let o=[];return Al(e.bounds,My(r,t),t=>(o.push(...Uy(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=z(e)?void 0:i.get(Ny(e)??``),s=Fy(e,t,r);if(o)return Hy(o,e,t,s,r);if(!s)return[a()];let c=Py(e),l=z(e)?s.name:r.instanceNames.get(Ny(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return Ry(s,r)||c.some(e=>ry(e,t,r)!==0)?u():Vy(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:U(n,My(r,t))},parent:e}),s.scope);return Uy(s.body,e,{...s,name:l},r,i)},u)},Wy=(e,t,n,r,i)=>{let a=(e,t)=>Wy(e,t,n,r,i);if(e.kind===`Let`){a(e.body,pu(e.definitions,My(n,t)));return}let o=zy(e,t);if(o){a(o.expression,o.scope);return}let s=Fy(e,t,n);if(s&&Ry(s,n))return;if(s&&s.params.length===0){if(ry(s.body,s.scope,n)===1){r.inits.push(jy(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,du(s,e.args,My(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(jy(Dy,e));return}let c=ry(e,t,n);c<=1?r.inits.push(jy(Dy,e)):c===3&&r.temporals.push(jy(Dy,e))},Gy=(e,t,n,r,i)=>{let a=(t,n)=>Gy(e,t,n,r,i);if(t.kind===`Let`){a(t.body,pu(t.definitions,My(r,n)));return}let o=zy(t,n);if(o){a(o.expression,o.scope);return}let s=Fy(t,n,r);if(s&&Ry(s,r))return;if(s&&s.params.length===Py(t).length){a(s.body,t.kind===`Apply`?du(s,t.args,My(r,n)):s.scope);return}if(t.kind===`Forall`&&Vy(()=>(Al(t.bounds,My(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(jy(e,a)):ry(a,n,r)<2?i.invariants.push(jy(e,a)):i.impliedTemporals.push(jy(e,t));return}let c=ry(t,n,r);c<=1?i.impliedInits.push(jy(e,t)):c===3&&i.impliedTemporals.push(jy(e,t))},Ky=(e,t)=>{let n=hl(e,t);return n?.kind===`Operator`&&!Ly(n,t)?n:void 0},qy=e=>Gn([[`name`,e.name],[`location`,ky(e.location)]]),Jy=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Ky(e.specification,t);a&&(Wy(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...Uy(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Zl(e.init,t);o?.kind===`Closure`&&r.inits.push(jy(e.init??``,o.body));let s=e.next===void 0?void 0:Zl(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Uy(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Ky(e,t);n&&r.invariants.push(jy(e,n.body))}),e.properties.forEach(e=>{let n=Ky(e,t);n&&Gy(e,n.body,void 0,t,r)}),r},Yy=(e,t,n)=>Jy(e,t,n).inits,Xy=(e,t,n)=>Jy(e,t,n).actions,Zy=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>R(e[1])).join(`,`)})`,Qy=(e,t)=>`${e.name===Dy?`Action`:e.name}${t===`1.7.4`?``:Zy(e)} ${a(e.location.range??Oy)}`,$y=e=>`${e.name}${Zy(e)}`,eb=(e,t,n,r)=>{let i=Jy(e,t,r),a=e=>On(e.map(Ay)),o=e=>On(e.flatMap(e=>{let n=Ky(e,t);return n?[qy(n)]:[]}));return Gn([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,On(t.variables.map((e,t)=>Gn([[`name`,e],[`location`,ky(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},tb=`paired12`,nb=(e,t=16)=>e<=t*.75?t:nb(e,t*2),rb=(e,t)=>{let n=nb(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},ib=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),ab=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),ob=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),sb=e=>ob(e).replaceAll(`
1767
+ `,`\\n`),cb=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},lb=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
1774
1768
  `,r?``:`node [shape=box,style=rounded]
1775
- `,e.colorize?`edge [colorscheme="${db}"]\n`:``,`nodesep=0.35;
1769
+ `,e.colorize?`edge [colorscheme="${tb}"]\n`:``,`nodesep=0.35;
1776
1770
  `,`subgraph cluster_graph {
1777
1771
  `,`color="white";
1778
1772
  `],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=e=>{let t=a.get(e.level)??/* @__PURE__ */ new Set;a.set(e.level,t.add(e.fingerprint))},c=e=>{if(!e)return 1;let t=o.get(e.name)??o.size+2;return o.set(e.name,t),t},l=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
1779
- `,`node [ labeljust="l",colorscheme="${db}",style=filled,shape=record ]\n`,...pb([...o.keys()],hb).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...pb([...a],e=>e[0]).map(e=>`{rank = same; ${pb([...e[1]],mb).map(e=>`${e};`).join(``)}}\n`),`}
1780
- `,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${_b(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?gb(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${_b(n.getText())}"`;i.push(`${n.fingerprint} [label="${_b(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},bb=(e,t,n)=>e.dot?yb(e,t,n):vb(e,t),xb=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Sb=(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},Cb=t=>n(new y(`${s}${t}`),e.error),wb=e=>{let t=Nr(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!F(e)||!F(i))throw Cb(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},Tb=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(Tb);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},Eb=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,Db=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new v(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw Cb(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!N(a)||!I(a))throw Cb(`The symmetry operator must specify a set of functions.`);let o=L(a).elements;if(!o.every(P))throw Cb(`The symmetry values must be function records.`);let s=o.map(wb),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=Tb(Eb(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(ha.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(xb(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=Sb(n,e),r=xb(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(!Eb(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>F(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},Ob=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=jb(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(jb(e[r],t));return a}},kb=(e,t)=>{let n=[],r=[];for(let i of e){let e=jb(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(zt);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(zt(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},Ab=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,jb=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Ab(e);if(n===0||n>64)return Mb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Mb(e,t),a=i!==e&&an(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},Mb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=kb(e.elements,t);return n?Ht(n):e}if(n===`Function`||n===`LazyFunction`&&I(e.domain)){let n=Nr(e),r=Ob(n.domain,t),i=Ob(n.range,t)??n.range;if(r){let e=Un(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ut(n.domain,e.range):e}return i===n.range?n:Ut(n.domain,i)}if(n===`Interval`||!N(e)||!I(e))return e;let r=L(e),i=Ob(r.elements,t);return i?Ln(i):r},Nb=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},Pb=(e,t,n)=>e.images[t]??=jb(e.images[0],n.permutations[t-1]),Fb=(e,t,n,r)=>{let i=Nb(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=zt(Pb(i,t,r),Pb(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},Ib=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?Fb(i,t,n,r):0;if(o!==0)return o<0}return!1},Lb=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>Ib(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?Pb(Nb(e,t),r,t):e)},Rb=(e,t)=>e*((t-e)/2**64),zb=e=>e.includes(`.`)?e:`${e}.0`,Bb=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return zb(String(e));let[n,r]=e.toExponential().split(`e`);return`${zb(n)}E${r.replace(`+`,``)}`},Vb=e=>e!==void 0&&e>=`0`&&e<=`9`,Hb=e=>{if(e===0)return`0.0`;let t=Bb(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;Vb(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(;Vb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;Vb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(Vb(t[n.next])&&Number(t[n.next])>=5&&(n.result=Ub(n.result));Vb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Ub=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Ub(r)}.`:n===`9`?`${Ub(r)}0`:`${r}${Number(n)+1}`},Wb=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}`)},Gb=(e,t,n)=>{if(Rb(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},Kb=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}).`},qb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),Jb={line:0,column:0},Yb=`Failed to recover the initial state from its fingerprint.`,Xb=`Failed to recover the next state from its fingerprint.`,Zb=e=>({kind:`Identifier`,name:e,location:Jb}),Qb=/* @__PURE__ */ new Set([`name`,`property`]),$b=(e,t,n)=>{let r=wl(t,n);if(!r)throw new v(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new v(Qb.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},ex=(e,t,n)=>{if(Ol(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return W(Zb(e),Cx(n,void 0,void 0))}catch(e){if(e instanceof y||c(e))return;throw e}},tx=(e,t,n)=>{let r=$b(e,t,n);if(ex(t,r,n)!==void 0)throw new v(`The ${e} ${t} cannot be a constant.`);return r},nx=(e,t,n)=>{let r=n.constants.has(t)?void 0:$b(e,t,n),i=r?ex(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new v(`The ${e} of ${t} is equal to ${z(i)}`);return i===void 0?r:void 0},rx=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},ix=(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})),nu(e.startupDefinitions,r),t.invariants.forEach(e=>{nx(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},ax=(t,r)=>{let i=F_({constants:new Set(r.constants.keys()),variables:new Set(r.variables),getDefinition:e=>wl(e,r)});return t.flatMap(t=>{let a=nx(`invariant`,t,r);if(!a)return[];let o=i.analyzeDefinition(a,/* @__PURE__ */ new Map);if(o.level>=2){let r=o.params.size===0?``:`
1773
+ `,`node [ labeljust="l",colorscheme="${tb}",style=filled,shape=record ]\n`,...rb([...o.keys()],ab).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...rb([...a],e=>e[0]).map(e=>`{rank = same; ${rb([...e[1]],ib).map(e=>`${e};`).join(``)}}\n`),`}
1774
+ `,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${sb(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?ob(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${sb(n.getText())}"`;i.push(`${n.fingerprint} [label="${sb(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},ub=(e,t,n)=>e.dot?lb(e,t,n):cb(e,t),db=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),fb=(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},pb=e=>p(new _(`${s}${e}`),m.error),mb=e=>{let t=wr(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!P(e)||!P(i))throw pb(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},hb=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind!==`Apply`)return``;let t=e.args.map(hb);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},gb=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,_b=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new x(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw pb(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>U(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!M(a)||!F(a))throw pb(`The symmetry operator must specify a set of functions.`);let o=I(a).elements;if(!o.every(N))throw pb(`The symmetry values must be function records.`);let s=o.map(mb),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=hb(gb(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(oa.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(db(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=fb(n,e),r=db(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(!gb(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=>P(e)&&m.has(e.name))})),d.size===0)return;let g=Math.max(256,Math.floor(4194304/d.size));return{permutations:[...d.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:g})),orbits:/* @__PURE__ */ new WeakMap,orbitCount:0,orbitLimit:g}},vb=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=xb(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(xb(e[r],t));return a}},yb=(e,t)=>{let n=[],r=[];for(let i of e){let e=xb(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(At);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(At(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},bb=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,xb=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=bb(e);if(n===0||n>64)return Sb(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Sb(e,t),a=i!==e&&Yt(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},Sb=(e,t)=>{let n=e.kind;if(n===`Set`){let n=yb(e.elements,t);return n?Nt(n):e}if(n===`Function`||n===`LazyFunction`&&F(e.domain)){let n=wr(e),r=vb(n.domain,t),i=vb(n.range,t)??n.range;if(r){let e=Pn(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Pt(n.domain,e.range):e}return i===n.range?n:Pt(n.domain,i)}if(n===`Interval`||!M(e)||!F(e))return e;let r=I(e),i=vb(r.elements,t);return i?On(i):r},Cb=(e,t)=>{let n=t.orbits.get(e);if(n!==void 0)return n;t.orbitCount>=t.orbitLimit&&(t.orbits=/* @__PURE__ */ new WeakMap,t.orbitCount=0);let r={images:[e],comparisons:[]};return t.orbits.set(e,r),t.orbitCount++,r},wb=(e,t,n)=>e.images[t]??=xb(e.images[0],n.permutations[t-1]),Tb=(e,t,n,r)=>{let i=Cb(e,r),a=i.comparisons[n]??=new Int8Array(r.permutations.length+1);if(a[t]===0){let e=At(wb(i,t,r),wb(i,n,r));a[t]=Math.sign(e)+2}return a[t]-2},Eb=(e,t,n,r,i)=>{for(let a of i){let i=e[a],o=typeof i==`object`?Tb(i,t,n,r):0;if(o!==0)return o<0}return!1},Db=(e,t,n)=>{let r=t.permutations.reduce((r,i,a)=>Eb(e,a+1,r,t,n)?a+1:r,0);return r===0?e:e.map(e=>typeof e==`object`?wb(Cb(e,t),r,t):e)},Ob=(e,t)=>e*((t-e)/2**64),kb=e=>e.includes(`.`)?e:`${e}.0`,Ab=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return kb(String(e));let[n,r]=e.toExponential().split(`e`);return`${kb(n)}E${r.replace(`+`,``)}`},jb=e=>e!==void 0&&e>=`0`&&e<=`9`,Mb=e=>{if(e===0)return`0.0`;let t=Ab(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;jb(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(;jb(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;jb(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(jb(t[n.next])&&Number(t[n.next])>=5&&(n.result=Nb(n.result));jb(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Nb=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Nb(r)}.`:n===`9`?`${Nb(r)}0`:`${r}${Number(n)+1}`},Pb=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}`)},Fb=(e,t,n)=>{if(Ob(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}).`},Lb=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),Rb={line:0,column:0},zb=`Failed to recover the initial state from its fingerprint.`,Bb=`Failed to recover the next state from its fingerprint.`,Vb=e=>({kind:`Identifier`,name:e,location:Rb}),Hb=/* @__PURE__ */ new Set([`name`,`property`]),Ub=(e,t,n)=>{let r=hl(t,n);if(!r)throw new x(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new x(Hb.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},Wb=(t,n,r)=>{if(yl(n,r)&&n.body.kind!==`Number`&&n.body.kind!==`String`)try{return U(Vb(t),px(r,void 0,void 0))}catch(t){if(t instanceof _||e(t))return;throw t}},Gb=(e,t,n)=>{let r=Ub(e,t,n);if(Wb(t,r,n)!==void 0)throw new x(`The ${e} ${t} cannot be a constant.`);return r},Kb=(e,t,n)=>{let r=n.constants.has(t)?void 0:Ub(e,t,n),i=r?Wb(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new x(`The ${e} of ${t} is equal to ${R(i)}`);return i===void 0?r:void 0},qb=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},Jb=(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})),ql(e.startupDefinitions,r),t.invariants.forEach(e=>{Kb(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},Yb=(e,t)=>{let n=T_({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>hl(e,t)});return e.flatMap(e=>{let r=Kb(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
1781
1775
  Note that a bug can cause TLC to incorrectly report this error.
1782
1776
  If you believe your TLA+ or PlusCal specification to be correct,
1783
- please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw n(new v(`The invariant ${t} is not a state predicate (one with no primes or temporal operators).${r}`),e.safetyEvaluationFailure)}return[{name:t,expression:Zb(t),scope:void 0}]})},ox=(e,t)=>{if(!P(e))return;let n=Nr(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},sx=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>sx(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=wl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return sx(n.body,t)}return[e]},cx=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||py(r,e.scope,t)>0)return!1;let i=W(r,Cx(t,void 0,void 0,e.scope));if(i===!1)throw new v(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new v(`The operator ${r.name}, which equals ${z(i)},\ncannot be used as a ${n}`);return!0},lx=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e!==void 0)return tx(t,e,r),Zb(e)};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}if(t.init!==void 0||t.next!==void 0)throw new v(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let i=[],a=[],o=[],s=$b(`name`,t.specification,r),c=ex(t.specification,s,r);if(c!==void 0)throw new v(`The value of ${t.specification} is equal to ${z(c)}`);if(gy(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(cx(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new v(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&py(c.expression,s.scope,r)<2)throw n(new y(`TLC cannot handle the temporal formula ${sl(c.expression)}`),e.error);let l=py(c,s.scope,r);if(l===3)o.push(s);else{if(l===2)throw new v(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new v(`The specification ${t.specification} must contain at most one [][Next]_vars`);let l=[...i,...a],u=e=>`$specification${e}`,d=l.reduce((e,t,n)=>t.scope===void 0?e:{name:u(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),f=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:u(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(f),location:Jb},next:a.length===0?void 0:f(a[0],i.length),scope:d,temporals:o}},ux=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=nx(`property`,e,t);if(!i)return;py(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;gy(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(cx(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`&&py(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!B(e)?wl(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=py(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new v(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},dx=(e,t,n)=>t.flatMap(t=>nx(e,t,n)?[{name:t,expression:Zb(t),scope:void 0}]:[]),fx=(e,t)=>{let n=wl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},px=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new v(`_POSSIBLE lists ${n} more than once`);tx(`possible`,n,t);let i=Zb(n);if(py(i,void 0,t)===3)throw new v(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),mx=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||B(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},hx=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=wl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},gx=(e,t)=>e.flatMap(e=>sx(e.expression,t).map(n=>{let r=e.scope===void 0?Vd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:mx(n,r,t),predicate:hx(e.expression,t)}})),_x=(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},vx=/[\u0100-\uffff]/,yx=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),bx=e=>e.kind===`String`?vx.test(e.value):e.kind===`Set`&&e.elements.some(bx),xx=e=>e.kind===`String`&&vx.test(e.value)||e.kind===`Apply`&&yx.has(e.operator)||Si(e).some(xx),Sx=(e,t)=>e.constants.some(e=>bx(e.value)||(e.args??[]).some(bx))||[...t.definitions.values()].some(e=>xx(e.body)||e.kind===`Function`&&e.bounds.some(e=>xx(e.set))),Cx=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),wx=(e,t,n)=>Cl(W(e,t),n),Tx=(e,t,n=Ex)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new y(n(e,t.environment));return r},Ex=(e,t)=>{let n=e.kind===`Identifier`?wl(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`?ol(i):cl(r)}`},Dx=(e,t)=>Tx(e.expression,t,(n,r)=>(Tx(e.predicate,t),Ex(n,r))),Ox=()=>{},kx=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=wx(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),Ax=(e,t,n)=>{try{return wx(e,Cx(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof y)return{message:e.message};throw e}},jx=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=Ax(n.expression,t,`an assumption`);if(e)return{name:sl(n.expression),trace:[],message:e.message}}},Mx=(t,r,i,a)=>{let o=ax(t.invariants,r),c=lx(t,r),l=ux(t,r,a),u=gx([...o,...l.invariants],r),d=[...new Map(u.map(e=>[e.predicate,e])).values()],f=u.length>0||l.actionProperties.length>0||l.liveness.length>0;if(c.init===void 0&&(f||l.initialPredicates.length>0||r.variables.length>0))throw new v(r.runtime.version===`1.7.4`?ya:`The configuration file did not specify the initial state predicate.`);if(c.next===void 0&&f)throw new v(`The configuration file did not specify the next state predicate.`);let p=gx(dx(`constraint`,t.constraints,r),r),m=dx(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&$b(`rlreward`,t.rlReward,r),t.periodic!==void 0&&$b(`periodic`,t.periodic,r);let h=px(t.possible,r);if(r.variables.length===0)return;let g=t.symmetry===void 0?void 0:Db(t.symmetry,r,t.substitutions);t.view!==void 0&&$b(`view function`,t.view,r);let _=t.view===void 0?void 0:{name:t.view,expression:Zb(t.view),scope:void 0},b=l.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Jb};return{...e,unchanged:t}}),x=e=>py(e.expression,void 0,r)>=2,ee=h.filter(e=>!x(e)),te=h.filter(x),S=r.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return ne.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),ne.indices},ie=(e,t)=>W(e,Cx(r,t,void 0)),C=e=>{let t=re(),n=g===void 0?e:Lb(e,g,t);return wm(_===void 0?t.map(e=>n[e]):[ie(_.expression,n)])},ae=Sx(t,r);S.getFingerprint=C;let oe=()=>{let e=h.find(e=>!S.possibleCounts.get(e.name));if(!e)return;let t=fx(e.name,r),n=t?` at ${ol(t)}`:``;return{name:e.name,code:ha.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:dt(z(Gm(S),!0))}};return{properties:l,spec:c,isSymmetric:g!==void 0,isConstrained:p.length>0||m.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(_!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=Dm(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:Lb(e,g,re());return _===void 0?t:[ie(_.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(_x(a,t,i))return!1;try{let e=Cx(r,t,void 0,a.scope),n=a.membership;return i&&n?!Mr(t[n.variable],i[n.variable],W(n.set,e)):!Dx(a,e)}catch(t){throw i?zx(n(t,e.safetyEvaluationFailure),ha.invariantEvaluationFailed,`Evaluating invariant ${a.name} failed.`):t}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>Tx(n,Cx(t,e,void 0,r));p.every(e=>r(e.predicate,e.scope))&&n();let i=d.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=l.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(p.every(e=>Tx(e.predicate,Cx(n,t,void 0,e.scope)))&&m.every(r=>Tx(r.expression,Cx(n,e,t,r.scope))))||r())||d.every(e=>Tx(e.predicate,Cx(n,t,void 0,e.scope))))&&b.every(r=>Tx(r.box,Cx(n,e,t,r.scope))),satisfiesConstraints:(e,t)=>p.every(n=>_x(n,e,t)||Dx(n,Cx(r,e,void 0))),findFailedInitialPredicate:e=>l.initialPredicates.find(t=>!Tx(t.expression,Cx(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>b.find(n=>{try{return!Tx(n.action,Cx(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${sl(n.box)}`)&&!wx(n.unchanged,Cx(r,e,t,n.scope),`a subscript`)}catch(e){throw zx(Nx(e),ha.actionPropertyEvaluationFailed,`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>m.every(n=>Tx(n.expression,Cx(r,e,t),e=>`${s}${Ex(e,r)}`)),trackStatePossible:ee.length===0?Ox:e=>kx(ee,S,Cx(r,e,void 0)),trackActionPossible:te.length===0?Ox:(e,t)=>kx(te,S,Cx(r,e,t)),findUnwitnessedPossible:oe,findPostconditionViolation:(i=!1)=>{let a=t.postconditions.find(e=>{let t=wl(e,r);return t!==void 0&&r.definitionValues.has(t)});if(a!==void 0){if(i)return;throw n(new y(`${s}The post condition ${a} cannot be a constant.`),e.error)}let o=oe();if(o)return o;for(let e of t.postconditions){let t=Ax(Zb(e),r,`a postcondition`);if(!t)continue;let n=fx(e,r),i=n?` at ${ol(n)}`:``;return t.message===void 0?{name:e,code:ha.postconditionFalse,message:`Postcondition ${e}${i} is false.`}:{name:e,code:ha.postconditionFailed,message:`Evaluating postcondition ${e}${i} failed.\n${t.message}`}}}}},Nx=e=>e instanceof S?n(e,e.exitCode):e,Px=/* @__PURE__ */ Error(`The replay stopped`),Fx=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),Ix=t=>{let n=wa(t.message);return n&&!n.isEvalException&&Fx.has(n.code)?e.configParseError:oe(t)},Lx=t=>{let n=t.cause;return n instanceof y?Lx(n):t instanceof S?t.exitCode:e.specEvaluationFailure},Rx=/* @__PURE__ */ new WeakMap,zx=(e,t,r)=>{if(!(e instanceof y))return e;let i=n(new y(`${r}\n${e.message}`,e),oe(e));return Rx.set(i,{code:t,headline:r,inner:e}),i},Bx=s.slice(0,s.indexOf(`
1784
- `)),Vx=`${s}tlc2.tool.EvalException: `,Hx=`${s}util.Assert$TLCRuntimeException: `,Ux=o(`tlc2.tool.EvalException`),Wx=e=>Ta(e)?Vx:Hx,Gx=e=>{try{return e()}catch(e){throw e instanceof y?Ta(e)?new y(`${Ux}${e.message}`):wa(e.message)?e:new y(`${s}${e.message}`):e}},Kx=[Vx,Hx,s,Ux],qx=(e,t)=>{let n=Rx.get(e);if(n)return`${n.headline}\n${qx(n.inner,t)}`;let r=e.message,i=Kx.find(e=>r.startsWith(e))??``;return`${i}${Oa(r.slice(i.length),t)}`},Jx=(e,t)=>{let n=Rx.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:qx(e,!0)};if(t&&Ta(e))return{code:wa(r)?.code??ha.general,message:r,toolMessage:r};let i=t&&!r.startsWith(Bx)?s:``;return{code:ha.general,message:`${i}${r}`,toolMessage:`${i}${qx(e,!0)}`}},Yx=e=>{let t=e.dump&&bb(e.dump,e.writeFile,e.version);try{return Zx(e,t)}catch(e){throw c(e)?Xx():e}finally{t?.close()}},Xx=()=>n(new x,e.error),Zx=(t,i)=>{let o=typeof t.config==`string`?at(t.config,t.version):t.config,l=t.onPrint??console.log,u={lines:void 0},d=e=>{u.lines?u.lines.push(e):l(e)},f=e=>{let t=u.lines,n=[];u.lines=n;try{return{result:e(),lines:n}}finally{u.lines=t}};Dt(cv(t.source,o,t.loadModule)),kt(t.version);let p=Sv(o,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:d,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});ix(p,o,t.onProgress);let m=p.environment,h=m.runtime,g=h.version===`1.7.4`;h.pause=t.onPause??(()=>{}),h.getSpecification=()=>ub(o,m,p.variableLocations,p.instanceActions);let _={depth:0,initialStates:void 0},b=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:h.generatedStates,distinctStates:h.distinctStates,queuedStates:h.queueSize,depth:h.generatedStates===0?0:Math.max(_.depth,1),initialStates:_.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),te=Array.from({length:32},()=>0),re={newStates:0},ie=()=>Math.min(re.newStates,31),C=()=>te.map((e,t)=>t===ie()?e+1:e),ae=()=>g?[...te]:C(),se=(e,t,n)=>g?[]:e.getViolatedProperties(t,n),w=(e,t=[...te])=>({...e,violationOutDegrees:t}),T=()=>({...b(`success`),outDegrees:[...te],fingerprintDistance:Gb(h.distinctStates,h.generatedStates,()=>E?E.getStoredFingerprints(A,Ee):BigInt64Array.from(A,h.getFingerprint))}),E=Mx(o,m,()=>sv(t.source,t.loadModule),t.onProgress),D=()=>jx(p.assumptions,m);if(!E){h.isStarted=!0;let e=D();return e?b(`assumption-violation`,e):(_.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates}),T())}let ce=o.postconditions.length>0||o.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?By(t):$h(e.action)},fe=(e,t)=>{ce&&(h.counterExample=eg(e.map(ue),e.slice(1).map(de),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:f(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return b(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=E.spec,he=E.getFingerprintState,O={value:void 0},ge=()=>O.value??=ob(o,m,p.instanceActions),_e=e=>{let t=Xu(m),n=t.callStack;try{e(t);return}catch(e){return c(e)?{callStack:[],fingerprint:void 0}:!(e instanceof y)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=ei(e).find(e=>$r(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=$r(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(en)},be=()=>{let e=tt.fingerprint?[tt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return Qe(Je(r),r)!==-1||e.some(e=>Xe(e,r))?!1:(e.push(r),h.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return _e(r=>{if(ic(ab(o,m,p.instanceActions),r,i=>{if(rx(e.count,e=>u.lines?.push(e)),e.count++,h.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(h.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw u.lines?.push({kind:`initial-state-violation`,...e,state:t}),Px}}catch(e){if(!(e instanceof y)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>_e(t=>{let n=A[e],r=i&&ot(n,ke[e]),a=be();ac(ge(),n,t,(o,s)=>{if(!E.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return r&&i?.writeSuccessor(r,ot(o,ke[e]+1),!n,N?{name:s.name,signature:lb(s)}:void 0),n}))throw Px})}),Ce=o.view!==void 0||o.symmetry!==void 0,we=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let k=a(()=>Gx(()=>Iy(E.properties.liveness,me.temporals,m,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,h.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=M.livenessSource;return M.livenessSource=e,$c(me.next,t,m,e=>{if(je(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=Qe(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),M.livenessSource=r,n}})));h.isStarted=!0;let Te=E.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=xi(),Me=e=>Object.fromEntries(E.getTlcOrder().map(t=>[m.variables[t],e[t]])),Ne=(e,t,n,r)=>(h.getLevel=()=>n+1,h.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=tx(`alias`,e,m).body,i=W(Zb(e),Cx(m,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return ox(i,a)??Me(n)}catch(e){if(!(e instanceof v||e instanceof y))throw e;return{...Me(n),_ALIASEvalError:Oa(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=ge(),a={...M};Object.assign(M,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>el(e.expression,t,m,e.scope).some(e=>Xe(o(e.state),s)));return Object.assign(M,a),c},Ie=(e,n,r={})=>{let i=o.alias,a=r.known??1,s=e.length>1?f(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:f(()=>Fe(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),l=c.map(e=>e.lines),u=r.loopStart,d=g&&u!==void 0?u+1:e.length-a,p=d>0?[s,...l.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&cb(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,u),output:r===0?p:r<d?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:a>0&&!g?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Qc(me.init,m,me.scope),j=(e,t)=>f(()=>{for(let n of ge()){let r=el(n.expression,e,m,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Xe(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=f(()=>Ce||Pu(m)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new y(Yb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ze(i,e[n]);if(!a)throw new y(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,Yb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Xe(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:g?[]:f(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&g?e.success:n.callStack?n.isCallStackFirst?oe(t):n.isLiveCallStack?r(t)??(t instanceof S?t.exitCode:e.error):n.isInitial||n.fingerprint?e.specEvaluationFailure:Lx(t):n.isInitial?Ix(t):oe(t),Ge=(e,t,n={})=>{let r=c(e)?new x:e;if(!(r instanceof y))throw r;let i=t.trace.length>0&&!n.traceFailure?fe(t.trace,void 0):void 0,a=i?.unwitnessed??i?.postcondition,o=[...t.traceOutput??[],...i?.lines??[]];return{...b(`error`,void 0,{...Jx(r,n.isNextState??!1),...t,...o.length>0&&{traceOutput:o},...a&&{postcondition:a},initialState:n.initialState&&!(r instanceof S)?Me(n.initialState):void 0,exitCode:We(r,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Ke=(n,r)=>{h.generatedStates++;let i=ge(),a=i.length===1?i[0]:i.find(e=>e.name===r.action),o=r.variables,s=i.length===1?`the next-state action`:`action ${r.action} of the next-state relation`,c=g?`assigned`:`defined`,l=`Successor state is not completely specified by ${s}. The following variable${o.length>1?`s are`:` is`} not ${c}: ${o.join(`, `)}.\n`,u=Vt(`null`),d=r.state.map(e=>e??u),f=Ge(r,He(n));return w({...f,failure:f.failure&&{...f.failure,code:ha.incompleteSuccessor,message:l,toolMessage:l,exitCode:e.specEvaluationFailure,trace:[...f.failure.trace,{action:r.action,label:a&&cb(a,t.version),state:Me(d)}]}})},qe=(e,t)=>{let n=Be(e,Xb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new y(Xb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Kr(t,ti(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=$r(t);if(e)throw e}},Xe=(e,t)=>{for(let n=0;n<t.length;n++)if(!an(e[n],t[n]))return!1;return!0},Ze=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,Qe=(e,t)=>{let n=Ae.slots.length-1;for(let r=Ze(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Xe(Ee[n-1],t))return n-1}},$e=(e,t)=>{let n=Ae.slots.length-1,r=Ze(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},et=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&$e(e[t],e[t+1])}$e(e,t+1)},tt={fingerprint:void 0},nt=e=>{h.distinctStates=A.length+1,_.depth=Math.max(_.depth,e),h.diameter=Math.max(h.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},M={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},it=e=>e===-1?[]:[...it(De[e]),A[e]];h.isSeen=e=>{let t=he(e);return Qe(Je(t),t)!==-1},h.getBehavior=e=>{let t=e===M.candidate?-1:A.indexOf(e);return t===-1?[...it(M.index),e]:it(t)},h.getCurrentState=()=>M.index===-1?void 0:A[M.index],h.setLivenessSource=e=>{M.livenessSource=e??-1},h.getLevel=e=>{let t=M.livenessSource;if(g){let e=t===-1?M.isExpanding?M.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===M.candidate?M.candidateLevel:M.index===-1?0:e===A[M.index]?ke[M.index]:M.isExpanding?ke[M.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let ot=(e,t)=>({fingerprint:BigInt.asIntN(64,h.getFingerprint(e)),level:t,getLabel:()=>yi(o.alias===void 0?Me(e):Pe(o.alias,e,void 0)),getText:()=>yi(Me(e))}),st=e=>{je(e),h.generatedStates++,h.initialStates++,M.candidate=e,M.candidateLevel=1;let t=he(e),n=Je(t),r=E.satisfiesConstraints(e);if(r&&(E.trackStatePossible(e),Ye(t),e.forEach(en)),r&&Qe(n,t)!==-1)return;tt.fingerprint=r?t:void 0,r&&(nt(1),h.queueSize++,k?.addInitialState(A.length,e),i?.writeInitialState(ot(e,1)));let a=E.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});r&&(et(n,A.length),rt(e,t,-1,void 0))},ct=(e,t,n,r,a)=>{let o=A[e];h.generatedStates++,M.candidate=t.state,M.candidateLevel=ke[e]+1,Te&&je(t.state);let s=he(t.state),l=Je(s),u=Qe(l,s),d=E.satisfiesConstraints(t.state,o);d&&E.trackStatePossible(t.state);let p=d&&E.satisfiesActionConstraints(o,t.state);p&&(E.trackActionPossible(o,t.state),Ye(s),t.state.forEach(en));let m=p?u:-1;if(r&&p&&i?.writeSuccessor(r,ot(t.state,ke[e]+1),m!==-1,a&&{name:a.name,signature:lb(a)}),m!==-1&&k){let e=A[m],r=e.every((e,n)=>e===t.state[n]);n.push({index:m,state:r?e:t.state})}let g=p&&m===-1;if(g&&k&&n.push({index:A.length,state:t.state}),tt.fingerprint=g?s:void 0,g&&(nt(ke[e]+1),re.newStates++),m===-1)try{let n=E.findViolatedInvariant(t.state,o);if(n)return w(pe(`invariant-violation`,{name:n.name,...Ve(e,t)}))}catch(n){if(c(n))throw n;let r=f(()=>Se(e));return Ge(n,qb(Ue(e,t),r.lines),r.result??{outDegrees:ae()})}let _=E.findViolatedActionProperty(o,t.state);if(_)return w(pe(`liveness-violation`,{name:_.name,...Ve(e,t)}));g&&(Te||je(t.state),et(l,A.length),rt(t.state,s,e,t.action),h.queueSize++)},lt={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let ut=D();if(ut)return b(`assumption-violation`,ut);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Zc(me.init,m,e=>{rx(h.initialStates,t.onProgress);try{lt.result=st(e)}catch(t){let n=f(xe);lt.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return lt.result!==void 0},me.scope)}catch(e){if(e instanceof ne){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Vt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=f(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(lt.result)return lt.result;_.initialStates={generated:h.initialStates,distinct:h.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:_.initialStates});let dt=me.next;if(dt===void 0){if(A.length>0)throw new y(`No next state actions defined to generate successor states from.`);return T()}let N=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),ft=(e,t)=>{if(!N)return $c(dt,e,m,e=>t(e,void 0),me.scope);let n={isStopped:!1};return ge().reduce((r,i)=>n.isStopped?r:r+$c(i.expression,e,m,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},P=(e,t)=>{if(!k||g)return;let n=_e(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},F=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof y))throw n;return P(e,t)}},pt=(e,t)=>{let n=f(()=>F(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=f(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},mt=e=>Ge(Xx(),He(e)),ht=(e,t,n)=>{if(c(e))return mt(t);let r=pt(t,n);return Ge(Nx(e),qb(He(t),r.lines),{isNextState:!0,...r.result})},gt=(t,r)=>{let a=A[t],l=i&&ot(a,ke[t]),u=ft(a,(e,n)=>{try{lt.result=ct(t,e,r,l,n)}catch(n){if(c(n))return lt.result=mt(t),!0;let i=g?f(()=>Se(t)):pt(t,r);if(g&&n instanceof y&&!Rx.has(n))return lt.result=Ge(new y(`${Wx(n)}${n.message}`,n),qb({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let a=he(e.state).some(e=>$r(e)!==void 0)&&n instanceof y?Jx(Ta(n)?new y(`${Ux}${n.message}`):n,!0):void 0;lt.result=Ge(n,qb(a?He(t):Ue(t,e),i.lines),{isNextState:!0,...i.result,traceFailure:a})}return lt.result!==void 0});M.isExpanding=!1;let d=lt.result;if(d?.violation&&!g){let e=f(()=>F(t,r));return{...d,violation:qb(d.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(d)return d;let p=()=>{k&&l&&g&&i?.writeStuttering(l);let e=k?.addState(t,a,r);if(!k||!e)return;let n=qe(e),o=se(k,n.map(e=>e.state),n.length-1);return pe(`property-violation`,{name:o[0],properties:o,...Ie(n,e,{known:0})})};if(u===0&&o.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),n=f(()=>{try{return{additional:p()?.violation}}catch(e){if(!(e instanceof y))throw e;return{isFailed:!0,callStack:P(t,r)}}}),i=e.violation?{...e,violation:qb(e.violation,n.lines)}:e,a=w(i,n.result.isFailed?ae():C());return n.result.additional?{...a,additionalViolation:n.result.additional}:n.result.callStack?{...a,liveCallStack:n.result.callStack}:a}try{return p()}catch(i){if(g&&i instanceof y){let t=new y(`${Ta(i)?Ux:s}${i.message}`);return Ge(n(t,e.error),{trace:[]},{outDegrees:ae()})}let o=_e(e=>k?.addState(t,a,r,e));return Ge(i,He(t),{outDegrees:ae(),callStack:o?.callStack.length?o.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},_t=()=>{let e=o.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:ha.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=wl(e,m)?.location.range;if(!(me.temporals.length>0||!n))return{code:ha.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${ol(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},vt=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:f(()=>Fe(l,u,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&cb(d.result,t.version),warning:p?_t():void 0},()=>c===l?de(o[o.length-1]):d.result?By(d.result):$h(ze(u,c)?.action))},yt=k!==void 0&&t.livenessCheck!==`final`,bt=performance.now(),xt={at:bt+3e3,size:1,time:0},St=e=>{let n=performance.now();if(!((e-xt.size)/xt.size>.1)||xt.time>(n-bt)*.2||(xt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:b(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),xt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!h.isStopped;e++){M.index=e,M.candidate=void 0,h.queueSize=A.length-e-1,M.isExpanding=!0;let n=[];try{lt.result=gt(e,n)}catch(t){lt.result=t instanceof ee?Ke(e,t):ht(t,e,n)}if(lt.result)return lt.result;if(te[ie()]++,re.newStates=0,(yt||t.onProgress)&&performance.now()>=xt.at){xt.at=performance.now()+6e4;let n=yt?St(e+1):void 0;if(k&&n)return vt(k,n);t.onProgress?.({kind:`progress`,statistics:b(`success`)})}}M.index=-1,M.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:h.distinctStates,statistics:b(`success`)});let Ct=k?.findViolation();if(k&&Ct)return vt(k,Ct);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return b(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return T()},Qx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},$x=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^ti(e[t]),16777619),r=Math.imul(r^ci(e[t]),1540483477);t[0]=Qx(n)||1,t[1]=Qx(r)},eS=()=>{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)}}},tS=(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}},nS=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),rS=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return tS(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},iS=e=>Atomics.load(e.used,0)*2>=e.slots.length,aS=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&tS(t,n);return{slots:t,used:e.used}},oS=[void 0,`lambda`,`tuple`,`record`],sS=()=>{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=Vr(e.domain);return t?(r(7),r(oS.indexOf(Kt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(oS.indexOf(Kt(e))),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},cS=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Vt(t.strings[n[r.index++]]);if(e===5)return Ht(i(n[r.index++]));let a=oS[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Zn({kind:`Interval`,low:e,high:e+t-1});return Gt(Ut(o,i(t)),a)}let o=n[r.index++],s=i(o);return Gt(Ut(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Ye as $,sm as A,Da as B,Ym as C,im as D,wm as E,Qc as F,Si as G,ja as H,el as I,z as J,xi as K,ha as L,af as M,sl as N,om as O,Pu as P,at as Q,ga as R,sv as S,Xm as T,Aa as U,Oa as V,wa as W,Dt as X,jt as Y,kt as Z,Rb as _,oe as _t,aS as a,w as at,av as b,n as bt,$x as c,y as ct,jx as d,re as dt,Be as et,rx as f,d as ft,Gb as g,s as gt,Wb as h,ie as ht,nS as i,se as it,Mp as j,cm as k,Yx as l,ae as lt,Hb as m,C as mt,sS as n,Ce as nt,rS as o,v as ot,ix as p,u as pt,yi as q,eS as r,T as rt,iS as s,l as st,cS as t,xe as tt,Mx as u,f as ut,Kb as v,o as vt,Jm as w,cv as x,Sv as y,e as yt,va as z};
1777
+ please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw p(new x(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),m.safetyEvaluationFailure)}return[{name:e,expression:Vb(e),scope:void 0}]})},Xb=(e,t)=>{if(!N(e))return;let n=wr(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Zb=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Zb(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=hl(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Zb(n.body,t)}return[e]},Qb=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||ry(r,e.scope,t)>0)return!1;let i=U(r,px(t,void 0,void 0,e.scope));if(i===!1)throw new x(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new x(`The operator ${r.name}, which equals ${R(i)},\ncannot be used as a ${n}`);return!0},$b=(e,t)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return Gb(n,e,t),Vb(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 x(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let n=[],r=[],i=[],a=Ub(`name`,e.specification,t),o=Wb(e.specification,a,t);if(o!==void 0)throw new x(`The value of ${e.specification} is equal to ${R(o)}`);if(oy(a.body,void 0,t,!1).forEach(a=>{let o=a.expression;if(Qb(a,t,`spec`))return;if(o.kind===`UnboundedQuantifier`&&o.isTemporal)throw p(new x(`TLC does not support temporal existential, nor universal, quantification over state variables.`),m.error);if(o.kind===`Always`&&o.expression.kind===`BoxAction`){r.push({expression:o.expression.action,scope:a.scope});return}if(o.kind===`Always`&&ry(o.expression,a.scope,t)<2)throw p(new _(`TLC cannot handle the temporal formula ${Qc(o.expression)}`),m.error);let s=ry(o,a.scope,t);if(s===3)i.push(a);else{if(s===2)throw new x(`TLC cannot handle the action-level conjunct of the specification ${e.specification}`);n.push(a)}}),r.length>1)throw new x(`The specification ${e.specification} must contain at most one [][Next]_vars`);let s=[...n,...r],c=e=>`$specification${e}`,l=s.reduce((e,t,n)=>t.scope===void 0?e:{name:c(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),u=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:c(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:n.length===0?void 0:{kind:`And`,operands:n.map(u),location:Rb},next:r.length===0?void 0:u(r[0],n.length),scope:l,temporals:i}},ex=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=Kb(`property`,e,t);if(!i)return;ry(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;oy(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(Qb(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`&&ry(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!z(e)?hl(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=ry(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2)throw new x(`The property ${e} is an action-level formula`);r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},tx=(e,t,n)=>t.flatMap(t=>Kb(e,t,n)?[{name:t,expression:Vb(t),scope:void 0}]:[]),nx=(e,t)=>{let n=hl(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},rx=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new x(`_POSSIBLE lists ${n} more than once`);Gb(`possible`,n,t);let i=Vb(n);if(ry(i,void 0,t)===3)throw new x(`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}}),ix=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||z(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},ax=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=hl(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},ox=(e,t)=>e.flatMap(e=>Zb(e.expression,t).map(n=>{let r=e.scope===void 0?jd(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:ix(n,r,t),predicate:ax(e.expression,t)}})),sx=(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},cx=/[\u0100-\uffff]/,lx=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),ux=e=>e.kind===`String`?cx.test(e.value):e.kind===`Set`&&e.elements.some(ux),dx=e=>e.kind===`String`&&cx.test(e.value)||e.kind===`Apply`&&lx.has(e.operator)||pi(e).some(dx),fx=(e,t)=>e.constants.some(e=>ux(e.value)||(e.args??[]).some(ux))||[...t.definitions.values()].some(e=>dx(e.body)||e.kind===`Function`&&e.bounds.some(e=>dx(e.set))),px=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),mx=(e,t,n)=>ml(U(e,t),n),hx=(e,t,n=gx)=>{let r=U(e,t);if(typeof r!=`boolean`)throw new _(n(e,t.environment));return r},gx=(e,t)=>{let n=e.kind===`Identifier`?hl(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`?Zc(i):$c(r)}`},_x=(e,t)=>hx(e.expression,t,(n,r)=>(hx(e.predicate,t),gx(n,r))),vx=()=>{},yx=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=mx(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),bx=(e,t,n)=>{try{return mx(e,px(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof _)return{message:e.message};throw e}},xx=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=bx(n.expression,t,`an assumption`);if(e)return{name:Qc(n.expression),trace:[],message:e.message}}},Sx=(e,t,n,r)=>{let i=Yb(e.invariants,t),a=$b(e,t),o=ex(e,t,r),c=ox([...i,...o.invariants],t),l=[...new Map(c.map(e=>[e.predicate,e])).values()],u=c.length>0||o.actionProperties.length>0||o.liveness.length>0;if(a.init===void 0&&(u||o.initialPredicates.length>0||t.variables.length>0))throw new x(t.runtime.version===`1.7.4`?ua:`The configuration file did not specify the initial state predicate.`);if(a.next===void 0&&u)throw new x(`The configuration file did not specify the next state predicate.`);let d=ox(tx(`constraint`,e.constraints,t),t),f=tx(`action constraint`,e.actionConstraints,t);e.rlReward!==void 0&&Ub(`rlreward`,e.rlReward,t),e.periodic!==void 0&&Ub(`periodic`,e.periodic,t);let h=rx(e.possible,t);if(t.variables.length===0)return;let g=e.symmetry===void 0?void 0:_b(e.symmetry,t,e.substitutions);e.view!==void 0&&Ub(`view function`,e.view,t);let v=e.view===void 0?void 0:{name:e.view,expression:Vb(e.view),scope:void 0},y=o.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Rb};return{...e,unchanged:t}}),b=e=>ry(e.expression,void 0,t)>=2,ee=h.filter(e=>!b(e)),S=h.filter(b),te=t.runtime,ne={indices:void 0},re=()=>{if(ne.indices)return ne.indices;let e=n(),r=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return ne.indices=t.variables.map((e,t)=>t).sort((e,t)=>r(e)-r(t)),ne.indices},ie=(e,n)=>U(e,px(t,n,void 0)),C=e=>{let t=re(),n=g===void 0?e:Db(e,g,t);return mm(v===void 0?t.map(e=>n[e]):[ie(v.expression,n)])},ae=fx(e,t);te.getFingerprint=C;let oe=()=>{let e=h.find(e=>!te.possibleCounts.get(e.name));if(!e)return;let n=nx(e.name,t),r=n?` at ${Zc(n)}`:``;return{name:e.name,code:oa.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:nt(R(Fm(te),!0))}};return{properties:o,spec:a,isSymmetric:g!==void 0,isConstrained:d.length>0||f.length>0,getTlcOrder:re,getStoredFingerprints:(e,t)=>{if(v!==void 0||ae)return BigInt64Array.from(e,C);let n=new BigInt64Array(t.length),r=_m(re(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ae)return[String(C(e))];let t=g===void 0?e:Db(e,g,re());return v===void 0?t:[ie(v.expression,t)]},findViolatedInvariant:(e,n)=>c.find(r=>{if(sx(r,e,n))return!1;try{let i=px(t,e,void 0,r.scope),a=r.membership;return n&&a?!Cr(e[a.variable],n[a.variable],U(a.set,i)):!_x(r,i)}catch(e){throw n?kx(p(e,m.safetyEvaluationFailure),oa.invariantEvaluationFailed,`Evaluating invariant ${r.name} failed.`):e}}),checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>hx(n,px(t,e,void 0,r));d.every(e=>r(e.predicate,e.scope))&&n();let i=l.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=o.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(d.every(e=>hx(e.predicate,px(n,t,void 0,e.scope)))&&f.every(r=>hx(r.expression,px(n,e,t,r.scope))))||r())||l.every(e=>hx(e.predicate,px(n,t,void 0,e.scope))))&&y.every(r=>hx(r.box,px(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>d.every(r=>sx(r,e,n)||_x(r,px(t,e,void 0))),findFailedInitialPredicate:e=>o.initialPredicates.find(n=>!hx(n.expression,px(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>y.find(r=>{try{return!hx(r.action,px(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Qc(r.box)}`)&&!mx(r.unchanged,px(t,e,n,r.scope),`a subscript`)}catch(e){throw kx(Cx(e),oa.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,n)=>f.every(r=>hx(r.expression,px(t,e,n),e=>`${s}${gx(e,t)}`)),trackStatePossible:ee.length===0?vx:e=>yx(ee,te,px(t,e,void 0)),trackActionPossible:S.length===0?vx:(e,n)=>yx(S,te,px(t,e,n)),findUnwitnessedPossible:oe,findPostconditionViolation:(n=!1)=>{let r=e.postconditions.find(e=>{let n=hl(e,t);return n!==void 0&&t.definitionValues.has(n)});if(r!==void 0){if(n)return;throw p(new _(`${s}The post condition ${r} cannot be a constant.`),m.error)}let i=oe();if(i)return i;for(let n of e.postconditions){let e=bx(Vb(n),t,`a postcondition`);if(!e)continue;let r=nx(n,t),i=r?` at ${Zc(r)}`:``;return e.message===void 0?{name:n,code:oa.postconditionFalse,message:`Postcondition ${n}${i} is false.`}:{name:n,code:oa.postconditionFailed,message:`Evaluating postcondition ${n}${i} failed.\n${e.message}`}}}}},Cx=e=>e instanceof f?p(e,e.exitCode):e,wx=/* @__PURE__ */ Error(`The replay stopped`),Tx=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),Ex=e=>{let t=ha(e.message);return t&&!t.isEvalException&&Tx.has(t.code)?m.configParseError:d(e)},Dx=e=>{let t=e.cause;return t instanceof _?Dx(t):e instanceof f?e.exitCode:m.specEvaluationFailure},Ox=/* @__PURE__ */ new WeakMap,kx=(e,t,n)=>{if(!(e instanceof _))return e;let r=p(new _(`${n}\n${e.message}`,e),d(e));return Ox.set(r,{code:t,headline:n,inner:e}),r},Ax=s.slice(0,s.indexOf(`
1778
+ `)),jx=`${s}tlc2.tool.EvalException: `,Mx=`${s}util.Assert$TLCRuntimeException: `,Nx=S(`tlc2.tool.EvalException`),Px=e=>ga(e)?jx:Mx,Fx=e=>{try{return e()}catch(e){throw e instanceof _?ga(e)?new _(`${Nx}${e.message}`):ha(e.message)?e:new _(`${s}${e.message}`):e}},Ix=[jx,Mx,s,Nx],Lx=(e,t)=>{let n=Ox.get(e);if(n)return`${n.headline}\n${Lx(n.inner,t)}`;let r=e.message,i=Ix.find(e=>r.startsWith(e))??``;return`${i}${ya(r.slice(i.length),t)}`},Rx=(e,t)=>{let n=Ox.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Lx(e,!0)};if(t&&ga(e))return{code:ha(r)?.code??oa.general,message:r,toolMessage:r};let i=t&&!r.startsWith(Ax)?s:``;return{code:oa.general,message:`${i}${r}`,toolMessage:`${i}${Lx(e,!0)}`}},zx=t=>{let n=t.dump&&ub(t.dump,t.writeFile,t.version);try{return Vx(t,n)}catch(t){throw e(t)?Bx():t}finally{n?.close()}},Bx=()=>p(new n,m.error),Vx=(t,r)=>{let a=typeof t.config==`string`?Xe(t.config,t.version):t.config,o=t.onPrint??console.log,c={lines:void 0},l=e=>{c.lines?c.lines.push(e):o(e)},u=e=>{let t=c.lines,n=[];c.lines=n;try{return{result:e(),lines:n}}finally{c.lines=t}};vt(Q_(t.source,a,t.loadModule)),bt(t.version);let v=fv(a,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:l,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});Jb(v,a,t.onProgress);let y=v.environment,b=y.runtime,S=b.version===`1.7.4`;b.pause=t.onPause??(()=>{}),b.getSpecification=()=>eb(a,y,v.variableLocations,v.instanceActions);let te={depth:0,initialStates:void 0},ne=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:b.generatedStates,distinctStates:b.distinctStates,queuedStates:b.queueSize,depth:b.generatedStates===0?0:Math.max(te.depth,1),initialStates:te.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),re=Array.from({length:32},()=>0),ie={newStates:0},C=()=>Math.min(ie.newStates,31),ae=()=>re.map((e,t)=>t===C()?e+1:e),oe=()=>S?[...re]:ae(),se=(e,t,n)=>S?[]:e.getViolatedProperties(t,n),ce=(e,t=[...re])=>({...e,violationOutDegrees:t}),w=()=>({...ne(`success`),outDegrees:[...re],fingerprintDistance:Fb(b.distinctStates,b.generatedStates,()=>T?T.getStoredFingerprints(A,Ee):BigInt64Array.from(A,b.getFingerprint))}),T=Sx(a,y,()=>Z_(t.source,t.loadModule),t.onProgress),E=()=>xx(v.assumptions,y);if(!T){b.isStarted=!0;let e=E();return e?ne(`assumption-violation`,e):(te.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:te.initialStates}),w())}let D=a.postconditions.length>0||a.possible.length>0,le=/* @__PURE__ */ new WeakMap,ue=e=>le.get(e)?.state??e.state,de=e=>{let t=le.get(e)?.action;return t?Ay(t):Uh(e.action)},fe=(e,t)=>{D&&(b.counterExample=Wh(e.map(ue),e.slice(1).map(de),t));let n=T.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:u(()=>T.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},pe=(e,t,n)=>{let r=t.loopStart,i=fe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return ne(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},me=T.spec,he=T.getFingerprintState,ge={value:void 0},_e=()=>ge.value??=Xy(a,y,v.instanceActions),O=t=>{let n=Vu(y),r=n.callStack;try{t(n);return}catch(t){return e(t)?{callStack:[],fingerprint:void 0}:!(t instanceof _)||!r?void 0:{callStack:r.expressions,fingerprint:r.fingerprint}}},ve=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=Gr(e).find(e=>Wr(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:ve(r,t)]},ye=(e,t)=>{for(let n of he(e)){let e=Wr(n);if(!e)continue;let r=t?ve(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(Gt)},be=()=>{let e=nt.fingerprint?[nt.fingerprint]:[];return(t,n)=>{ye(t,n);let r=he(t);return $e(Je(r),r)!==-1||e.some(e=>Ze(e,r))?!1:(e.push(r),b.distinctStates++,!0)}},xe=()=>{let e={count:0},t=[],n=be();return O(r=>{if(Ys(Yy(a,y,v.instanceActions),r,i=>{if(qb(e.count,e=>c.lines?.push(e)),e.count++,b.generatedStates=e.count,!(t.length>0))try{let e=T.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(b.queueSize++,k?.addInitialState(A.length,i,r))});if(e){let t=Ie([{action:void 0,state:i}],[]).trace[0].state;throw c.lines?.push({kind:`initial-state-violation`,...e,state:t}),wx}}catch(e){if(!(e instanceof _)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},Se=e=>O(t=>{let n=A[e],i=r&&it(n,ke[e]),a=be();Xs(_e(),n,t,(o,s)=>{if(!T.checkReplayedSuccessor(n,o,t,()=>{let n=a(o,t.callStack);return i&&r?.writeSuccessor(i,it(o,ke[e]+1),!n,ut?{name:s.name,signature:$y(s)}:void 0),n}))throw wx})}),Ce=a.view!==void 0||a.symmetry!==void 0,we=[];T.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:T.isSymmetric,isConstrained:T.isConstrained});let k=h(()=>Fx(()=>Ey(T.properties.liveness,me.temporals,y,{getFingerprint:({index:e,state:t})=>we[e]??=Number(BigInt.asIntN(32,b.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(me.next===void 0)return n;let r=N.livenessSource;return N.livenessSource=e,Wc(me.next,t,y,e=>{if(je(e.state),!(T.satisfiesConstraints(e.state,t)&&T.satisfiesActionConstraints(t,e.state)))return!1;let r=he(e.state),i=$e(Je(r),r);return n.push({index:i,state:e.state}),!1},me.scope),N.livenessSource=r,n}})));b.isStarted=!0;let Te=T.isSymmetric||k!==void 0,A=[],Ee=[],De=[],Oe=[],ke=[],Ae={slots:new Int32Array(1<<17),size:0,shift:16},je=fi(),Me=e=>Object.fromEntries(T.getTlcOrder().map(t=>[y.variables[t],e[t]])),Ne=(e,t,n,r)=>(b.getLevel=()=>n+1,b.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Pe(e,t[n].state,(t[n+1]??t[r??n]).state)),Pe=(e,n,r)=>{try{let t=Gb(`alias`,e,y).body,i=U(Vb(e),px(y,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return Xb(i,a)??Me(n)}catch(e){if(!(e instanceof x||e instanceof _))throw e;return{...Me(n),_ALIASEvalError:ya(e.message,t.isTool??!1)}}},Fe=(e,t,n,r)=>{let i=_e(),a={...N};Object.assign(N,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:he,s=o(n),c=i.find(e=>Gc(e.expression,t,y,e.scope).some(e=>Ze(o(e.state),s)));return Object.assign(N,a),c},Ie=(e,n,r={})=>{let i=a.alias,o=r.known??1,s=e.length>1?u(Le).lines:[],c=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:u(()=>Fe(n[r-1],e[r-1].state,t.state,o===2&&r===e.length-1))),l=c.map(e=>e.lines),d=r.loopStart,f=S&&d!==void 0?d+1:e.length-o,p=f>0?[s,...l.slice(1,f)].flat():[];return{trace:e.map((n,r)=>{let a=c[r].result,o={action:n.action,label:a&&Qy(a,t.version),state:i===void 0?Me(n.state):Ne(i,e,r,d),output:r===0?p:r<f?[]:l[r]};return(i!==void 0||a)&&le.set(o,{state:Me(n.state),action:a}),o}),traceOutput:o>0&&!S?[s,...l].flat():[]}},Le=()=>me.init===void 0?[]:Uc(me.init,y,me.scope),j=(e,t)=>u(()=>{for(let n of _e()){let r=Gc(n.expression,e,y,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Re=(e,t)=>Ze(he(e),Ee[t]),ze=(e,t)=>j(e,e=>Re(e.state,t)),Be=(e,t)=>{let n=u(()=>Ce||Tu(y)?Le().find(t=>Re(t,e[0])):A[e[0]]).result;if(!n)throw new _(zb);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=ze(i,e[n]);if(!a)throw new _(t);r.push(a)}return r},Ve=(e,t)=>{let n=[];for(let t=e;t!==-1;t=De[t])n.unshift(t);let r=Ce&&n.length>1?Be(n,zb):n.map(e=>({state:A[e],action:Oe[e]}));if(!t)return Ie(r,n);let i=Ce?j(A[e],e=>Ze(e.state,t.state))?.action:t.action;return Ie([...r,{state:t.state,action:i}],n,{known:2})},He=e=>De[e]===-1?{trace:[{action:void 0,label:void 0,state:Me(A[e])}],traceOutput:S?[]:u(Le).lines}:Ve(e),Ue=(e,t)=>({trace:Ve(e,t).trace}),We=(e,t)=>t.isInitial&&!t.callStack&&!t.fingerprint&&S?m.success:t.callStack?t.isCallStackFirst?d(e):t.isLiveCallStack?i(e)??(e instanceof f?e.exitCode:m.error):t.isInitial||t.fingerprint?m.specEvaluationFailure:Dx(e):t.isInitial?Ex(e):d(e),Ge=(t,r,i={})=>{let a=e(t)?new n:t;if(!(a instanceof _))throw a;let o=r.trace.length>0&&!i.traceFailure?fe(r.trace,void 0):void 0,s=o?.unwitnessed??o?.postcondition,c=[...r.traceOutput??[],...o?.lines??[]];return{...ne(`error`,void 0,{...Rx(a,i.isNextState??!1),...r,...c.length>0&&{traceOutput:c},...s&&{postcondition:s},initialState:i.initialState&&!(a instanceof f)?Me(i.initialState):void 0,exitCode:We(a,i),callStack:i.callStack,...i.isCallStackFirst&&{isCallStackFirst:!0},...i.fingerprint&&{fingerprint:i.fingerprint},...i.traceFailure&&{traceFailure:i.traceFailure}}),outDegrees:i.outDegrees}},Ke=(e,n)=>{b.generatedStates++;let r=_e(),i=r.length===1?r[0]:r.find(e=>e.name===n.action),a=n.variables,o=r.length===1?`the next-state action`:`action ${n.action} of the next-state relation`,s=S?`assigned`:`defined`,c=`Successor state is not completely specified by ${o}. The following variable${a.length>1?`s are`:` is`} not ${s}: ${a.join(`, `)}.\n`,l=Mt(`null`),u=n.state.map(e=>e??l),d=Ge(n,He(e));return ce({...d,failure:d.failure&&{...d.failure,code:oa.incompleteSuccessor,message:c,toolMessage:c,exitCode:m.specEvaluationFailure,trace:[...d.failure.trace,{action:n.action,label:i&&Qy(i,t.version),state:Me(u)}]}})},qe=(e,t)=>{let n=Be(e,Bb),r=n[n.length-1].state;if(Ce&&t!==void 0&&t!==e.length-1&&ze(r,e[t])===void 0)throw new _(Bb);return n},Je=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Lr(t,Kr(e[n]));return t&1073741823},Ye=e=>{for(let t of e){let e=Wr(t);if(e)throw e}},Ze=(e,t)=>{for(let n=0;n<t.length;n++)if(!Yt(e[n],t[n]))return!1;return!0},Qe=e=>Math.imul(e,2654435761)>>>Ae.shift<<1,$e=(e,t)=>{let n=Ae.slots.length-1;for(let r=Qe(e);;r=r+2&n){let n=Ae.slots[r+1];if(n===0)return-1;if(Ae.slots[r]===e&&Ze(Ee[n-1],t))return n-1}},et=(e,t)=>{let n=Ae.slots.length-1,r=Qe(e);for(;Ae.slots[r+1]!==0;)r=r+2&n;Ae.slots[r]=e,Ae.slots[r+1]=t},tt=(e,t)=>{if(Ae.size++,Ae.size*4>Ae.slots.length){let e=Ae.slots;Ae.slots=new Int32Array(e.length*2),Ae.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&et(e[t],e[t+1])}et(e,t+1)},nt={fingerprint:void 0},M=e=>{b.distinctStates=A.length+1,te.depth=Math.max(te.depth,e),b.diameter=Math.max(b.diameter,e)},rt=(e,t,n,r)=>{let i=n===-1?1:ke[n]+1;A.push(e),Ee.push(t),De.push(n),Oe.push(r),ke.push(i)},N={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},P=e=>e===-1?[]:[...P(De[e]),A[e]];b.isSeen=e=>{let t=he(e);return $e(Je(t),t)!==-1},b.getBehavior=e=>{let t=e===N.candidate?-1:A.indexOf(e);return t===-1?[...P(N.index),e]:P(t)},b.getCurrentState=()=>N.index===-1?void 0:A[N.index],b.setLivenessSource=e=>{N.livenessSource=e??-1},b.getLevel=e=>{let t=N.livenessSource;if(S){let e=t===-1?N.isExpanding?N.index:-1:t;return e===-1?0:ke[e]}return t===-1?e===N.candidate?N.candidateLevel:N.index===-1?0:e===A[N.index]?ke[N.index]:N.isExpanding?ke[N.index]+1:0:e===A[t]?ke[t]:ke[t]+1};let it=(e,t)=>({fingerprint:BigInt.asIntN(64,b.getFingerprint(e)),level:t,getLabel:()=>ui(a.alias===void 0?Me(e):Pe(a.alias,e,void 0)),getText:()=>ui(Me(e))}),at=e=>{je(e),b.generatedStates++,b.initialStates++,N.candidate=e,N.candidateLevel=1;let t=he(e),n=Je(t),i=T.satisfiesConstraints(e);if(i&&(T.trackStatePossible(e),Ye(t),e.forEach(Gt)),i&&$e(n,t)!==-1)return;nt.fingerprint=i?t:void 0,i&&(M(1),b.queueSize++,k?.addInitialState(A.length,e),r?.writeInitialState(it(e,1)));let a=T.findViolatedInvariant(e);if(a)return pe(`invariant-violation`,{name:a.name,...Ie([{action:void 0,state:e}],[])});let o=T.findFailedInitialPredicate(e);if(o)return pe(`liveness-violation`,{name:o.name,...Ie([{action:void 0,state:e}],[])});i&&(tt(n,A.length),rt(e,t,-1,void 0))},ot=(t,n,i,a,o)=>{let s=A[t];b.generatedStates++,N.candidate=n.state,N.candidateLevel=ke[t]+1,Te&&je(n.state);let c=he(n.state),l=Je(c),d=$e(l,c),f=T.satisfiesConstraints(n.state,s);f&&T.trackStatePossible(n.state);let p=f&&T.satisfiesActionConstraints(s,n.state);p&&(T.trackActionPossible(s,n.state),Ye(c),n.state.forEach(Gt));let m=p?d:-1;if(a&&p&&r?.writeSuccessor(a,it(n.state,ke[t]+1),m!==-1,o&&{name:o.name,signature:$y(o)}),m!==-1&&k){let e=A[m],t=e.every((e,t)=>e===n.state[t]);i.push({index:m,state:t?e:n.state})}let h=p&&m===-1;if(h&&k&&i.push({index:A.length,state:n.state}),nt.fingerprint=h?c:void 0,h&&(M(ke[t]+1),ie.newStates++),m===-1)try{let e=T.findViolatedInvariant(n.state,s);if(e)return ce(pe(`invariant-violation`,{name:e.name,...Ve(t,n)}))}catch(r){if(e(r))throw r;let i=u(()=>Se(t));return Ge(r,Lb(Ue(t,n),i.lines),i.result??{outDegrees:oe()})}let g=T.findViolatedActionProperty(s,n.state);if(g)return ce(pe(`liveness-violation`,{name:g.name,...Ve(t,n)}));h&&(Te||je(n.state),tt(l,A.length),rt(n.state,c,t,n.action),b.queueSize++)},st={result:void 0};k&&t.onProgress?.({kind:`liveness-prepared`,branches:k.branches});let ct=E();if(ct)return ne(`assumption-violation`,ct);if(t.onProgress?.({kind:`initial-states-started`}),me.init!==void 0)try{Hc(me.init,y,e=>{qb(b.initialStates,t.onProgress);try{st.result=at(e)}catch(t){let n=u(xe);st.result=Ge(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return st.result!==void 0},me.scope)}catch(e){if(e instanceof g){let t=Ge(e,{trace:[]},{initialState:e.state.map(e=>e??Mt(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=u(xe);return Ge(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(st.result)return st.result;te.initialStates={generated:b.initialStates,distinct:b.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:te.initialStates});let lt=me.next;if(lt===void 0){if(A.length>0)throw new _(`No next state actions defined to generate successor states from.`);return w()}let ut=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),dt=(e,t)=>{if(!ut)return Wc(lt,e,y,e=>t(e,void 0),me.scope);let n={isStopped:!1};return _e().reduce((r,i)=>n.isStopped?r:r+Wc(i.expression,e,y,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},ft=(e,t)=>{if(!k||S)return;let n=O(n=>k.addState(e,A[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},pt=(e,t)=>{try{k?.addState(e,A[e],t);return}catch(n){if(!(n instanceof _))throw n;return ft(e,t)}},mt=(e,t)=>{let n=u(()=>pt(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=u(()=>Se(e));return{result:r.result,lines:[...n.lines,...r.lines]}},ht=e=>Ge(Bx(),He(e)),gt=(t,n,r)=>{if(e(t))return ht(n);let i=mt(n,r);return Ge(Cx(t),Lb(He(n),i.lines),{isNextState:!0,...i.result})},_t=(t,n)=>{let i=A[t],o=r&&it(i,ke[t]),c=dt(i,(r,i)=>{try{st.result=ot(t,r,n,o,i)}catch(i){if(e(i))return st.result=ht(t),!0;let a=S?u(()=>Se(t)):mt(t,n);if(S&&i instanceof _&&!Ox.has(i))return st.result=Ge(new _(`${Px(i)}${i.message}`,i),Lb({trace:[]},a.lines),{isNextState:!0,...a.result}),!0;let o=he(r.state).some(e=>Wr(e)!==void 0)&&i instanceof _?Rx(ga(i)?new _(`${Nx}${i.message}`):i,!0):void 0;st.result=Ge(i,Lb(o?He(t):Ue(t,r),a.lines),{isNextState:!0,...a.result,traceFailure:o})}return st.result!==void 0});N.isExpanding=!1;let l=st.result;if(l?.violation&&!S){let e=u(()=>pt(t,n));return{...l,violation:Lb(l.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(l)return l;let d=()=>{k&&o&&S&&r?.writeStuttering(o);let e=k?.addState(t,i,n);if(!k||!e)return;let a=qe(e),s=se(k,a.map(e=>e.state),a.length-1);return pe(`property-violation`,{name:s[0],properties:s,...Ie(a,e,{known:0})})};if(c===0&&a.checkDeadlock){let e=pe(`deadlock`,{name:`deadlock`,...He(t)}),r=u(()=>{try{return{additional:d()?.violation}}catch(e){if(!(e instanceof _))throw e;return{isFailed:!0,callStack:ft(t,n)}}}),i=e.violation?{...e,violation:Lb(e.violation,r.lines)}:e,a=ce(i,r.result.isFailed?oe():ae());return r.result.additional?{...a,additionalViolation:r.result.additional}:r.result.callStack?{...a,liveCallStack:r.result.callStack}:a}try{return d()}catch(e){if(S&&e instanceof _){let t=new _(`${ga(e)?Nx:s}${e.message}`);return Ge(p(t,m.error),{trace:[]},{outDegrees:oe()})}let r=O(e=>k?.addState(t,i,n,e));return Ge(e,He(t),{outDegrees:oe(),callStack:r?.callStack.length?r.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},yt=()=>{let e=a.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:oa.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=hl(e,y)?.location.range;if(!(me.temporals.length>0||!n))return{code:oa.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${Zc(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},xt=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=qe(r,i),o=Ie(a,r,{loopStart:i,known:0}).trace,s=se(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],d=a[a.length-1].state,f=c===l?{result:void 0,lines:[]}:u(()=>Fe(l,d,A[c],!1)),p=c===l&&n.isCycleConstrained;return pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:f.lines,loopStart:i,loopLabel:f.result&&Qy(f.result,t.version),warning:p?yt():void 0},()=>c===l?de(o[o.length-1]):f.result?Ay(f.result):Uh(ze(d,c)?.action))},St=k!==void 0&&t.livenessCheck!==`final`,Ct=performance.now(),wt={at:Ct+3e3,size:1,time:0},Tt=e=>{let n=performance.now();if(!((e-wt.size)/wt.size>.1)||wt.time>(n-Ct)*.2||(wt.size=e,!k))return;t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!1,states:e,statistics:ne(`success`)});let r=k.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),wt.time+=performance.now()-n,r};for(let e=0;e<A.length&&!b.isStopped;e++){N.index=e,N.candidate=void 0,b.queueSize=A.length-e-1,N.isExpanding=!0;let n=[];try{st.result=_t(e,n)}catch(t){st.result=t instanceof ee?Ke(e,t):gt(t,e,n)}if(st.result)return st.result;if(re[C()]++,ie.newStates=0,(St||t.onProgress)&&performance.now()>=wt.at){wt.at=performance.now()+6e4;let n=St?Tt(e+1):void 0;if(k&&n)return xt(k,n);t.onProgress?.({kind:`progress`,statistics:ne(`success`)})}}N.index=-1,N.candidate=void 0,k&&t.onProgress?.({kind:`liveness-started`,branches:k.branches,isComplete:!0,states:b.distinctStates,statistics:ne(`success`)});let Et=k?.findViolation();if(k&&Et)return xt(k,Et);k&&t.onProgress?.({kind:`liveness-finished`});try{let e=T.findPostconditionViolation();if(e)return ne(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Ge(e,{trace:[]})}return w()},Hx=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},Ux=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Kr(e[t]),16777619),r=Math.imul(r^$r(e[t]),1540483477);t[0]=Hx(n)||1,t[1]=Hx(r)},Wx=()=>{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)}}},Gx=(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}},Kx=()=>({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 Gx(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},Jx=e=>Atomics.load(e.used,0)*2>=e.slots.length,Yx=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&Gx(t,n);return{slots:t,used:e.used}},Xx=[void 0,`lambda`,`tuple`,`record`],Zx=()=>{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=Mr(e.domain);return t?(r(7),r(Xx.indexOf(Lt(e))),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(Xx.indexOf(Lt(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})}},Qx=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 Mt(t.strings[n[r.index++]]);if(e===5)return Nt(i(n[r.index++]));let a=Xx[n[r.index++]];if(e===7){let e=n[r.index++],t=n[r.index++],o=Hn({kind:`Interval`,low:e,high:e+t-1});return It(Pt(o,i(t)),a)}let o=n[r.index++],s=i(o);return It(Pt(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{ze as $,Zp as A,va as B,zm as C,Jp as D,mm as E,Uc as F,pi as G,Sa as H,Gc as I,R as J,fi as K,oa as L,Jd as M,Qc as N,Xp as O,Tu as P,Xe as Q,sa as R,Z_ as S,Bm as T,xa as U,ya as V,ha as W,vt as X,St as Y,bt as Z,Ob as _,Yx as a,Y_ as b,Ux as c,xx as d,je as et,qb as f,Fb as g,Pb as h,Kx as i,Sp as j,Qp as k,zx as l,Mb as m,Zx as n,me as nt,qx as o,Jb as p,ui as q,Wx as r,Jx as s,Qx as t,fe as tt,Sx as u,Ib as v,Rm as w,Q_ as x,fv as y,la as z};