tla-ts 0.0.4-dev.a0009b7 → 0.0.4-dev.b254db0

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 (313) hide show
  1. package/README.md +33 -143
  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 +37 -1
  6. package/dist/index.d.ts +37 -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 +37 -47
  17. package/dist/run-cli.js +37 -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/check.ts +1 -0
  26. package/src/codegen.ts +26 -7
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +63 -20
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +265 -55
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +47 -37
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +38 -61
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +78 -45
  35. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  36. package/src/{obligation-generate.ts → obligations/generate.ts} +147 -74
  37. package/src/{obligations.ts → obligations/index.ts} +29 -13
  38. package/src/{obligation-levels.ts → obligations/levels.ts} +14 -5
  39. package/src/{obligation-module.ts → obligations/module.ts} +56 -33
  40. package/src/obligations/pickle.ts +98 -0
  41. package/src/obligations/pragma.ts +189 -0
  42. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  43. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  44. package/src/{obligation-source.ts → obligations/source.ts} +159 -97
  45. package/src/obligations/temporal.ts +319 -0
  46. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  47. package/src/ocaml-marshal.ts +166 -0
  48. package/src/parallel-worker.ts +2 -18
  49. package/src/parallel.ts +10 -43
  50. package/src/prove/decide-pool.ts +100 -0
  51. package/src/prove/deciders.ts +33 -0
  52. package/src/prove/isabelle/LICENSE +36 -0
  53. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  54. package/src/prove/isabelle/decide.ts +47 -0
  55. package/src/prove/isabelle/encode.ts +503 -0
  56. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  57. package/src/prove/isabelle/isar/method.ts +367 -0
  58. package/src/prove/isabelle/isar/proof.ts +28 -0
  59. package/src/prove/isabelle/isar/statement.ts +57 -0
  60. package/src/prove/isabelle/isar/theory.ts +192 -0
  61. package/src/prove/isabelle/isar/type-check.ts +278 -0
  62. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  63. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  64. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  65. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  66. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  67. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  68. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  69. package/src/prove/isabelle/provers/classical.ts +389 -0
  70. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  71. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  72. package/src/prove/isabelle/pure/consts.ts +32 -0
  73. package/src/prove/isabelle/pure/conv.ts +79 -0
  74. package/src/prove/isabelle/pure/drule.ts +264 -0
  75. package/src/prove/isabelle/pure/envir.ts +363 -0
  76. package/src/prove/isabelle/pure/goal.ts +53 -0
  77. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  78. package/src/prove/isabelle/pure/list.ts +12 -0
  79. package/src/prove/isabelle/pure/logic.ts +402 -0
  80. package/src/prove/isabelle/pure/name.ts +110 -0
  81. package/src/prove/isabelle/pure/net.ts +262 -0
  82. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  83. package/src/prove/isabelle/pure/pattern.ts +650 -0
  84. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  85. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  86. package/src/prove/isabelle/pure/search.ts +68 -0
  87. package/src/prove/isabelle/pure/seq.ts +156 -0
  88. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  89. package/src/prove/isabelle/pure/table.ts +208 -0
  90. package/src/prove/isabelle/pure/tactic.ts +276 -0
  91. package/src/prove/isabelle/pure/tactical.ts +347 -0
  92. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  93. package/src/prove/isabelle/pure/term.ts +808 -0
  94. package/src/prove/isabelle/pure/thm.ts +806 -0
  95. package/src/prove/isabelle/pure/type.ts +133 -0
  96. package/src/prove/isabelle/pure/unify.ts +753 -0
  97. package/src/prove/isabelle/pure/variable.ts +25 -0
  98. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  99. package/src/prove/isabelle/tla/context.ts +74 -0
  100. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  101. package/src/prove/isabelle/tla/logic.ts +215 -0
  102. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  103. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  104. package/src/prove/ocaml.ts +22 -0
  105. package/src/prove/prep/action.ts +521 -0
  106. package/src/prove/prep/defs.ts +33 -0
  107. package/src/prove/prep/elab.ts +156 -0
  108. package/src/prove/prep/enabled-axioms.ts +189 -0
  109. package/src/prove/prep/enabled.ts +43 -0
  110. package/src/prove/prep/fingerprint.ts +388 -0
  111. package/src/prove/prep/flatten.ts +70 -0
  112. package/src/prove/prep/level-comparison.ts +557 -0
  113. package/src/prove/prep/md5.ts +67 -0
  114. package/src/prove/prep/pragma.ts +221 -0
  115. package/src/prove/prep/trivial.ts +22 -0
  116. package/src/prove/prove-worker.ts +25 -0
  117. package/src/prove/prove.ts +505 -0
  118. package/src/prove/ptl/decide.ts +68 -0
  119. package/src/prove/ptl/encode.ts +256 -0
  120. package/src/prove/ptl/sat.ts +151 -0
  121. package/src/prove/ptl/tableau.ts +276 -0
  122. package/src/prove/smt/axiomatize.ts +69 -0
  123. package/src/prove/smt/axioms.ts +222 -0
  124. package/src/prove/smt/context.ts +108 -0
  125. package/src/prove/smt/data.ts +636 -0
  126. package/src/prove/smt/encode.ts +166 -0
  127. package/src/prove/smt/extensionality.ts +65 -0
  128. package/src/prove/smt/flatten.ts +112 -0
  129. package/src/prove/smt/format.ts +154 -0
  130. package/src/prove/smt/instances.ts +182 -0
  131. package/src/prove/smt/rewrite.ts +773 -0
  132. package/src/prove/smt/simplify.ts +57 -0
  133. package/src/prove/smt/solver/act-cache.ts +265 -0
  134. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  135. package/src/prove/smt/solver/array.ts +22 -0
  136. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  137. package/src/prove/smt/solver/ast-lt.ts +157 -0
  138. package/src/prove/smt/solver/ast-util.ts +147 -0
  139. package/src/prove/smt/solver/ast.ts +1315 -0
  140. package/src/prove/smt/solver/auf-solver.ts +572 -0
  141. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  142. package/src/prove/smt/solver/cg-table.ts +175 -0
  143. package/src/prove/smt/solver/clause.ts +276 -0
  144. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  145. package/src/prove/smt/solver/context.ts +1292 -0
  146. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  147. package/src/prove/smt/solver/der.ts +224 -0
  148. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  149. package/src/prove/smt/solver/e-matching.ts +659 -0
  150. package/src/prove/smt/solver/enode.ts +259 -0
  151. package/src/prove/smt/solver/expr-ref.ts +21 -0
  152. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  153. package/src/prove/smt/solver/fingerprints.ts +92 -0
  154. package/src/prove/smt/solver/flat-literals.ts +51 -0
  155. package/src/prove/smt/solver/goal.ts +138 -0
  156. package/src/prove/smt/solver/hash.ts +173 -0
  157. package/src/prove/smt/solver/hashtable.ts +166 -0
  158. package/src/prove/smt/solver/internalizer.ts +1381 -0
  159. package/src/prove/smt/solver/lbool.ts +5 -0
  160. package/src/prove/smt/solver/literal.ts +24 -0
  161. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  162. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  163. package/src/prove/smt/solver/lp/containers.ts +296 -0
  164. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  165. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  166. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  167. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  168. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  169. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  170. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  171. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  172. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  173. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  174. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  175. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  176. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  177. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  178. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  179. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  180. package/src/prove/smt/solver/lp/nex.ts +120 -0
  181. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  182. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  183. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  184. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  185. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  186. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  187. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  188. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  189. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  190. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  191. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  192. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  193. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  194. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  195. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  196. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  197. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  198. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  199. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  200. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  201. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  202. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  203. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  204. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  205. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  206. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  207. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  208. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  209. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  210. package/src/prove/smt/solver/model-checker.ts +347 -0
  211. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  212. package/src/prove/smt/solver/model-finder.ts +155 -0
  213. package/src/prove/smt/solver/model-generator.ts +97 -0
  214. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  215. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  216. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  217. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  218. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  219. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  220. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  221. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  222. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  223. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  224. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  225. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  226. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  227. package/src/prove/smt/solver/nnf.ts +469 -0
  228. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  229. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  230. package/src/prove/smt/solver/propagate-values.ts +83 -0
  231. package/src/prove/smt/solver/proto-model.ts +551 -0
  232. package/src/prove/smt/solver/pull-quant.ts +139 -0
  233. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  234. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  235. package/src/prove/smt/solver/qe-lite.ts +381 -0
  236. package/src/prove/smt/solver/qi-queue.ts +362 -0
  237. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  238. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  239. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  240. package/src/prove/smt/solver/random-gen.ts +10 -0
  241. package/src/prove/smt/solver/rational.ts +165 -0
  242. package/src/prove/smt/solver/ref-vector.ts +62 -0
  243. package/src/prove/smt/solver/relevancy.ts +247 -0
  244. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  245. package/src/prove/smt/solver/rewriter.ts +843 -0
  246. package/src/prove/smt/solver/rlimit.ts +79 -0
  247. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  248. package/src/prove/smt/solver/solver.ts +71 -0
  249. package/src/prove/smt/solver/sort.ts +35 -0
  250. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  251. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  252. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  253. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  254. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  255. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  256. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  257. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  258. package/src/prove/smt/solver/theory-lra.ts +56 -0
  259. package/src/prove/smt/solver/var-subst.ts +258 -0
  260. package/src/prove/smt/solver/z3-license.txt +10 -0
  261. package/src/prove/smt/table.ts +170 -0
  262. package/src/prove/tlapm/tlapm.ts +96 -0
  263. package/src/prove/tlaps-module.ts +510 -0
  264. package/src/prove/verdict.ts +18 -0
  265. package/src/prove/zenon/LICENSE +32 -0
  266. package/src/prove/zenon/check/check.ts +105 -0
  267. package/src/prove/zenon/check/definitions.ts +144 -0
  268. package/src/prove/zenon/check/equality.ts +182 -0
  269. package/src/prove/zenon/check/functions.ts +62 -0
  270. package/src/prove/zenon/check/keys.ts +125 -0
  271. package/src/prove/zenon/check/propositional.ts +104 -0
  272. package/src/prove/zenon/check/records.ts +188 -0
  273. package/src/prove/zenon/check/relations.ts +121 -0
  274. package/src/prove/zenon/check/rewrites.ts +224 -0
  275. package/src/prove/zenon/check/sets.ts +302 -0
  276. package/src/prove/zenon/check/terms.ts +127 -0
  277. package/src/prove/zenon/check/tla.ts +126 -0
  278. package/src/prove/zenon/decide.ts +113 -0
  279. package/src/prove/zenon/encode.ts +437 -0
  280. package/src/prove/zenon/eqrel.ts +300 -0
  281. package/src/prove/zenon/equality-rules.ts +435 -0
  282. package/src/prove/zenon/expr.ts +551 -0
  283. package/src/prove/zenon/index-table.ts +350 -0
  284. package/src/prove/zenon/isar-case.ts +513 -0
  285. package/src/prove/zenon/isar.ts +1249 -0
  286. package/src/prove/zenon/limits.ts +15 -0
  287. package/src/prove/zenon/llproof.ts +173 -0
  288. package/src/prove/zenon/mltoll.ts +1566 -0
  289. package/src/prove/zenon/node.ts +297 -0
  290. package/src/prove/zenon/ocaml.ts +169 -0
  291. package/src/prove/zenon/parse.ts +247 -0
  292. package/src/prove/zenon/phrase.ts +191 -0
  293. package/src/prove/zenon/proof.ts +198 -0
  294. package/src/prove/zenon/propositional-rules.ts +387 -0
  295. package/src/prove/zenon/rules.ts +94 -0
  296. package/src/prove/zenon/search.ts +288 -0
  297. package/src/prove/zenon/tla/functions.ts +151 -0
  298. package/src/prove/zenon/tla/llproof.ts +480 -0
  299. package/src/prove/zenon/tla/records.ts +225 -0
  300. package/src/prove/zenon/tla/rewrites.ts +447 -0
  301. package/src/prove/zenon/tla/sets.ts +304 -0
  302. package/src/prove/zenon/tla/terms.ts +181 -0
  303. package/src/prove/zenon/tla/tla.ts +506 -0
  304. package/src/run-cli.ts +334 -75
  305. package/src/standard-modules.ts +5 -2
  306. package/src/successors.ts +24 -5
  307. package/src/tlapm-cache.ts +236 -0
  308. package/src/tlc-random.ts +55 -32
  309. package/src/tlc-version.ts +8 -7
  310. package/src/values.ts +97 -47
  311. package/src/worker.ts +65 -0
  312. package/dist/parallel.cjs +0 -12
  313. package/dist/parallel.js +0 -12
package/dist/run-cli.js CHANGED
@@ -6,50 +6,40 @@
6
6
  * This source code is licensed under the MIT license found in the
7
7
  * LICENSE file in the root directory of this source tree.
8
8
  */
9
- import{$ as e,A as t,B as n,C as r,D as i,E as a,H as o,I as s,K as c,L as l,M as u,O as d,Q as f,R as p,T as m,U as h,V as g,W as _,Z as v,_ as y,_t as b,at as x,ct as S,dt as ee,et as C,ft as w,gt as T,h as E,ht as te,it as ne,j as D,k as re,lt as ie,m as ae,mt as O,nt as oe,ot as se,pt as ce,rt as k,st as A,tt as le,ut as j,v as ue,vt as de,w as fe,yt as pe,z as me}from"./transfer.js";import{t as he}from"./parallel.js";import{basename as ge,delimiter as _e,dirname as ve,isAbsolute as M,join as ye,resolve as be}from"node:path";import{existsSync as xe,globSync as Se,mkdirSync as Ce,readFileSync as we,readSync as Te,realpathSync as Ee,writeFileSync as De}from"node:fs";import{spawnSync as Oe}from"node:child_process";import{createHash as ke}from"node:crypto";import{arch as Ae,availableParallelism as je,release as Me,tmpdir as Ne,type as Pe}from"node:os";import{pathToFileURL as N}from"node:url";import{getHeapStatistics as Fe}from"node:v8";import{strFromU8 as Ie,unzipSync as Le}from"fflate";var Re=`0.0.4-dev.a0009b7`;const ze=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},Be=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(ze).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},Ve=e=>{let t=e.endColumn-1;return e.startLine===e.endLine?e.startColumn>=t?`line ${e.startLine}, character ${e.startColumn}`:`line ${e.startLine}, characters ${e.startColumn}-${t}`:`line ${e.startLine}, character ${e.startColumn} to line ${e.endLine}, character ${t}`},He=e=>`File ${JSON.stringify(e.file)}, ${Ve(e)}`,Ue=e=>`${e?He(e):`<unknown location>`}:\n`,P=(e,t)=>({text:`${Ue(e)}Error: ${t}`,channel:`stderr`}),We=e=>e?`${He(e)} :\n`:``,F=e=>({kind:`Shift`,amount:e}),Ge=(e,t)=>({kind:`Cons`,expression:e,rest:t}),Ke=(e,t)=>e.reduce((e,t)=>Ge(t,e),t),qe=(e,t)=>t.kind===`Bump`?{kind:`Bump`,amount:t.amount+e,rest:t.rest}:{kind:`Bump`,amount:e,rest:t},I=(e,t)=>{let n=t.location?{...e,location:t.location}:e;return t.isAtomic?{...n,isAtomic:!0}:n},Je=e=>{switch(e.kind){case`Fresh`:case`Flex`:return e.name;case`Defn`:return e.definition.name;case`Fact`:return}},Ye=(e,t,n)=>I({kind:`Apply`,operator:I({kind:`Internal`,builtin:e},n),args:t},n),Xe=e=>e.context.length===0?e.active:{kind:`Sequent`,sequent:e},Ze=(e,t)=>({hyp:t,rest:e,size:(e?.size??0)+1}),Qe=(e,t)=>t.reduce(Ze,e),$e=e=>{let t=[];for(let n=e;n;n=n.rest)t.push(n.hyp);return t.reverse()},et=(e,t)=>{let n=0;for(let r=e;r;r=r.rest){if(Je(r.hyp)===t)return{depth:n,hyp:r.hyp};n++}},tt=(e,t)=>{let n=e;for(let e=0;e<t&&n;e++)n=n.rest;return n},nt=(e,t,n)=>{let r=[];return[t.reduce((e,t)=>{let[i,a]=n(e,t);return r.push(a),i},e),r]},rt=(e,t,n=0)=>({kind:`Fresh`,name:e,shape:n,level:t,domain:void 0,domainVisibility:`Visible`}),it=(e,t)=>({kind:`Fresh`,name:e,shape:0,level:`Constant`,domain:t,domainVisibility:`Visible`}),at=(e,t,n)=>{switch(e.kind){case`Shift`:return I({kind:`Ix`,index:e.amount+t},n);case`Cons`:return t===1?I(ct(e.expression),n):at(e.rest,t-1,n);case`Compose`:return L(e.outer,at(e.inner,t,n));case`Bump`:return t<=e.amount?I({kind:`Ix`,index:t},n):L(F(e.amount),at(e.rest,t-e.amount,n))}},ot=(e,t)=>t.map(t=>L(e,t)),st=(e,t)=>{if(e.kind===`Lambda`){if(e.params.length!==t.length)throw new j(`Arity mismatch`);return ct(L(Ke(t,F(0)),e.body))}return e.kind===`Apply`?{kind:`Apply`,operator:e.operator,args:[...e.args,...t]}:t.length===0?ct(e):{kind:`Apply`,operator:e,args:t}},ct=e=>{if(!e.location&&!e.isAtomic)return e;let{location:t,isAtomic:n,...r}=e;return r},lt=(e,t)=>[qe(t.length,e),bt(t,t=>L(e,t))],ut=(e,t)=>{switch(t.kind){case`Recursive`:case`Operator`:case`Bpragma`:return Ct(t,t=>L(e,t));case`Instance`:{let n=qe(t.instance.args.length,e);return{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(e=>({name:e.name,expression:L(n,e.expression)}))}}}}},dt=(e,t)=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:L(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:ut(e,t.definition)};case`Fact`:return{...t,expression:L(e,t.expression)}}},ft=(e,t)=>{let[n,r]=nt(e,t.context,(e,t)=>[qe(1,e),dt(e,t)]);return{context:r,active:L(n,t.active)}},L=(e,t)=>{let n=t=>L(e,t);switch(t.kind){case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Ix`:return at(e,t.index,t);case`Apply`:return I(st(n(t.operator),ot(e,t.args)),t);case`Bang`:return{...t,expression:n(t.expression),selectors:t.selectors.map(e=>xt(e,n))};case`Lambda`:return{...t,body:L(qe(t.params.length,e),t.body)};case`Let`:{let[n,r]=nt(e,t.definitions,(e,t)=>[qe(1,e),ut(e,t)]);return{...t,definitions:r,body:L(n,t.body)}}case`Sequent`:return{...t,sequent:ft(e,t.sequent)};case`With`:return{...t,expression:n(t.expression)};case`If`:return{...t,condition:n(t.condition),consequent:n(t.consequent),alternative:n(t.alternative)};case`List`:return{...t,items:ot(e,t.items)};case`Quant`:{let[n,r]=lt(e,t.bounds);return{...t,bounds:r,body:L(n,t.body)}}case`Tquant`:return{...t,body:L(qe(t.names.length,e),t.body)};case`Choose`:return{...t,domain:t.domain&&n(t.domain),body:L(qe(1,e),t.body)};case`SetSt`:return{...t,domain:n(t.domain),body:L(qe(1,e),t.body)};case`SetOf`:{let[n,r]=lt(e,t.bounds);return{...t,bounds:r,element:L(n,t.element)}}case`SetEnum`:return{...t,elements:ot(e,t.elements)};case`Arrow`:return{...t,domain:n(t.domain),range:n(t.range)};case`Fcn`:{let[n,r]=lt(e,t.bounds);return{...t,bounds:r,body:L(n,t.body)}}case`FcnApp`:return{...t,function:n(t.function),args:ot(e,t.args)};case`Product`:return{...t,factors:ot(e,t.factors)};case`Tuple`:return{...t,elements:ot(e,t.elements)};case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:n(e.value)}))};case`Except`:return{...t,function:n(t.function),specs:St(t.specs,n)};case`Dot`:return{...t,expression:n(t.expression)};case`Sub`:case`Tsub`:return{...t,action:n(t.action),subscript:n(t.subscript)};case`Fair`:return{...t,subscript:n(t.subscript),action:n(t.action)};case`Case`:return{...t,arms:t.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:t.other&&n(t.other)};case`Parens`:return{...t,expression:n(t.expression)}}},R=(e,t)=>e===0?t:L(F(e),t),pt=(e,t,n)=>e.length===t.length&&e.every((e,r)=>n(e,t[r])),mt=(e,t)=>{let n=new Map(e.map(e=>[e.name,e.value])),r=new Map(t.map(e=>[e.name,e.value]));if(n.size!==r.size)return!1;for(let[e,t]of n){let n=r.get(e);if(!n||!z(t,n))return!1}return!0},ht=(e,t)=>e.level===t.level&&e.domain.kind===t.domain.kind&&(e.domain.kind!==`Domain`||t.domain.kind===`Domain`&&z(e.domain.expression,t.domain.expression)),gt=(e,t)=>{if(e.kind!==t.kind)return!1;switch(e.kind){case`Number`:return t.kind===`Number`&&e.value===t.value;case`Instance`:return t.kind===`Instance`&&pt(e.args,t.args,z);case`Label`:return t.kind===`Label`&&e.label===t.label&&pt(e.args,t.args,z);default:return!0}},_t=(e,t)=>{if(e.kind===`Operator`&&t.kind===`Operator`||e.kind===`Bpragma`&&t.kind===`Bpragma`)return z(e.body,t.body);if(e.kind===`Instance`&&t.kind===`Instance`){let n=e.instance.substitutions.map(e=>({name:e.name,value:e.expression})),r=t.instance.substitutions.map(e=>({name:e.name,value:e.expression}));return pt(e.instance.args,t.instance.args,(e,t)=>e===t)&&e.instance.module===t.instance.module&&mt(n,r)}return!1},vt=(e,t)=>e.kind===`Fresh`&&t.kind===`Fresh`?e.level!==t.level||e.shape!==t.shape?!1:!e.domain||!t.domain?!e.domain&&!t.domain:z(e.domain,t.domain):e.kind===`Flex`&&t.kind===`Flex`?!0:e.kind===`Defn`&&t.kind===`Defn`?_t(e.definition,t.definition)&&e.isLocal===t.isLocal:e.kind===`Fact`&&t.kind===`Fact`&&z(e.expression,t.expression),yt=(e,t)=>pt(e.context,t.context,vt)&&z(e.active,t.active),z=(e,t)=>{if(e.kind===`Parens`)return z(e.expression,t);if(t.kind===`Parens`)return z(e,t.expression);switch(e.kind){case`Ix`:return t.kind===`Ix`&&e.index===t.index;case`Opaque`:return t.kind===`Opaque`&&e.name===t.name;case`Internal`:return t.kind===`Internal`&&e.builtin===t.builtin;case`Lambda`:return t.kind===`Lambda`&&e.params.length===t.params.length&&z(e.body,t.body);case`Apply`:return t.kind===`Apply`&&z(e.operator,t.operator)&&pt(e.args,t.args,z);case`Sequent`:return t.kind===`Sequent`&&yt(e.sequent,t.sequent);case`Bang`:return t.kind===`Bang`&&z(e.expression,t.expression)&&pt(e.selectors,t.selectors,gt);case`With`:return t.kind===`With`&&z(e.expression,t.expression);case`Let`:return t.kind===`Let`&&pt(e.definitions,t.definitions,_t)&&z(e.body,t.body);case`If`:return t.kind===`If`&&z(e.condition,t.condition)&&z(e.consequent,t.consequent)&&z(e.alternative,t.alternative);case`List`:return t.kind===`List`&&e.bullet===t.bullet&&pt(e.items,t.items,z);case`Quant`:return t.kind===`Quant`&&e.quantifier===t.quantifier&&pt(e.bounds,t.bounds,ht)&&z(e.body,t.body);case`Tquant`:return t.kind===`Tquant`&&e.quantifier===t.quantifier&&pt(e.names,t.names,(e,t)=>e===t)&&z(e.body,t.body);case`Choose`:return t.kind===`Choose`?e.domain&&t.domain?z(e.domain,t.domain)&&z(e.body,t.body):!e.domain&&!t.domain&&z(e.body,t.body):!1;case`SetSt`:return t.kind===`SetSt`&&z(e.domain,t.domain)&&z(e.body,t.body);case`SetOf`:return t.kind===`SetOf`&&z(e.element,t.element)&&pt(e.bounds,t.bounds,ht);case`SetEnum`:return t.kind===`SetEnum`&&pt(e.elements,t.elements,z);case`Arrow`:return t.kind===`Arrow`&&z(e.domain,t.domain)&&z(e.range,t.range);case`Fcn`:return t.kind===`Fcn`&&pt(e.bounds,t.bounds,ht)&&z(e.body,t.body);case`FcnApp`:return t.kind===`FcnApp`&&pt([e.function,...e.args],[t.function,...t.args],z);case`Tuple`:return t.kind===`Tuple`&&pt(e.elements,t.elements,z);case`Product`:return t.kind===`Product`&&pt(e.factors,t.factors,z);case`Rect`:return t.kind===`Rect`&&mt(e.fields,t.fields);case`Record`:return t.kind===`Record`&&mt(e.fields,t.fields);case`Except`:return t.kind===`Except`&&z(e.function,t.function)&&pt(e.specs,t.specs,(e,t)=>pt(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&z(e.expression,t.expression))&&z(e.value,t.value));case`Dot`:return t.kind===`Dot`&&z(e.expression,t.expression)&&e.field===t.field;case`Sub`:case`Tsub`:return t.kind===e.kind&&e.modal===t.modal&&z(e.action,t.action)&&z(e.subscript,t.subscript);case`Fair`:return t.kind===`Fair`&&e.fairness===t.fairness&&z(e.subscript,t.subscript)&&z(e.action,t.action);case`Case`:return t.kind!==`Case`||!(e.arms.length===0||t.arms.length===0?e.arms.length===t.arms.length:z(e.arms[0].condition,t.arms[0].condition)&&z(e.arms[0].body,t.arms[0].body))?!1:e.other&&t.other?z(e.other,t.other):!e.other&&!t.other;case`String`:return t.kind===`String`&&e.value===t.value;case`Num`:return t.kind===`Num`&&e.integer===t.integer&&e.fraction===t.fraction;case`At`:return t.kind===`At`&&e.isExcept===t.isExcept}},bt=(e,t)=>e.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:t(e.domain.expression)}}:e),xt=(e,t)=>e.kind===`Instance`||e.kind===`Label`?{...e,args:e.args.map(t)}:e,St=(e,t)=>e.map(e=>{let n=t(e.value);return{trail:e.trail.map(e=>e.kind===`Apply`?{kind:`Apply`,expression:t(e.expression)}:e),value:n}}),Ct=(e,t)=>e.kind===`Operator`||e.kind===`Bpragma`?{...e,body:t(e.body)}:e,wt=(e,t,n)=>e.kind===`Fresh`?e.domain?{...e,domain:t(e.domain)}:e:e.kind===`Flex`||n===`visible`&&e.visibility===`Hidden`?e:e.kind===`Defn`?{...e,definition:Ct(e.definition,t)}:{...e,expression:t(e.expression)},Tt=(e,t,n,r,i=`visible`)=>{let a=t=>n(e,t),o=t=>t.reduce((e,t)=>r(e,rt(t.name,t.level)),e);switch(t.kind){case`Ix`:case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Lambda`:{let i=t.params.reduce((e,t)=>{let n=rt(t.name,`Unknown`,t.shape);return r(e,t.location?{...n,location:t.location}:n)},e);return{...t,body:n(i,t.body)}}case`Sequent`:{let[a,o]=nt(e,t.sequent.context,(e,t)=>{let a=wt(t,t=>n(e,t),i);return[r(e,a),a]});return{...t,sequent:{context:o,active:n(a,t.sequent.active)}}}case`Let`:{let[i,a]=nt(e,t.definitions,(e,t)=>{let i=Ct(t,t=>n(e,t));return[r(e,{kind:`Defn`,definition:i,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),i]});return{...t,definitions:a,body:n(i,t.body)}}case`Quant`:case`Fcn`:{let e=bt(t.bounds,a);return{...t,bounds:e,body:n(o(e),t.body)}}case`SetOf`:{let e=bt(t.bounds,a);return{...t,bounds:e,element:n(o(e),t.element)}}case`Tquant`:{let i=t.names.reduce((e,t)=>r(e,{kind:`Flex`,name:t}),e);return{...t,body:n(i,t.body)}}case`Choose`:{let i=t.domain&&a(t.domain),o=i?it(t.name,i):rt(t.name,`Constant`);return{...t,domain:i,body:n(r(e,o),t.body)}}case`SetSt`:{let i=a(t.domain),o=it(t.name,i);return{...t,domain:i,body:n(r(e,o),t.body)}}case`Bang`:{let e=t.selectors.map(e=>xt(e,a));return{...t,expression:a(t.expression),selectors:e}}case`Apply`:{let e=t.args.map(a);return{...t,operator:a(t.operator),args:e}}case`With`:case`Dot`:case`Parens`:return{...t,expression:a(t.expression)};case`If`:{let e=a(t.alternative),n=a(t.consequent);return{...t,condition:a(t.condition),consequent:n,alternative:e}}case`List`:return{...t,items:t.items.map(a)};case`SetEnum`:case`Tuple`:return{...t,elements:t.elements.map(a)};case`Product`:return{...t,factors:t.factors.map(a)};case`FcnApp`:{let e=t.args.map(a);return{...t,function:a(t.function),args:e}}case`Arrow`:{let e=a(t.range);return{...t,domain:a(t.domain),range:e}}case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:a(e.value)}))};case`Except`:{let e=St(t.specs,a);return{...t,function:a(t.function),specs:e}}case`Sub`:case`Tsub`:case`Fair`:return{...t,subscript:a(t.subscript),action:a(t.action)};case`Case`:{let e=t.other&&a(t.other),n=t.arms.map(e=>{let t=a(e.body);return{condition:a(e.condition),body:t}});return{...t,arms:n,other:e}}}},Et=(e,t)=>Tt(void 0,e,(e,n)=>t(n),()=>void 0,`all`),Dt=e=>{let t=[];return Et(e,e=>(t.push(e),e)),t},Ot={kind:`Opaque`,name:`$Bad`},kt=e=>e.kind===`Opaque`&&e.name===Ot.name,At=e=>{let t=e.kind===`Parens`?At(e.expression):Et(e,At);if(!t.isAtomic)return t;let{isAtomic:n,...r}=t;return r},jt=e=>e.kind===`Let`?I({kind:`Let`,definitions:e.definitions,body:jt(e.body)},e.body):e.kind===`Parens`?jt(e.expression):Et(e,jt),Mt=e=>e.kind===`Ix`?e.index<=0:Dt(e).some(Mt),Nt=(e,t,n)=>{let r=(e,r=n)=>Nt(e,t,r),i=(e,t)=>e.reduce((e,t)=>e??(t.domain.kind===`Domain`?r(t.domain.expression):void 0),void 0)??r(t,[...n,...e.map(e=>rt(e.name,e.level))]);switch(e.kind){case`Parens`:return e.form.kind===`Xlabel`?e.form.label===t?{context:n,expression:e.expression,indices:e.form.indices}:void 0:r(e.expression);case`Lambda`:return r(e.body,[...n,...e.params.map(e=>rt(e.name,`Unknown`,e.shape))]);case`Let`:{let t=[...n];for(let n of e.definitions){let e=n.kind===`Operator`||n.kind===`Bpragma`?r(n.body,[...t]):void 0;if(e)return e;t.push({kind:`Defn`,definition:n,whereDefined:`Builtin`,visibility:`Visible`,isLocal:!0})}return r(e.body,t)}case`Quant`:case`Fcn`:return i(e.bounds,e.body);case`SetOf`:return i(e.bounds,e.element);case`Tquant`:return r(e.body,[...n,...e.names.map(e=>({kind:`Flex`,name:e}))]);case`Choose`:case`SetSt`:return(e.domain&&r(e.domain))??r(e.body,[...n,rt(e.name,`Constant`)]);case`Sequent`:{let t=[...n];for(let n of e.sequent.context){if(n.kind!==`Fact`)return;let e=r(n.expression,[...t]);if(e)return e;t.push(n)}return r(e.sequent.active,t)}default:for(let t of Dt(e)){let e=r(t);if(e)return e}return}},Pt=(e,t)=>Ke(Array.from({length:e},(e,t)=>({kind:`Ix`,index:t+1})),F(e+t)),Ft=e=>Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n})),It=(e,t,n)=>{switch(t.kind){case`Quant`:case`Fcn`:case`SetOf`:{if(t.bounds.length!==n.length){let r=t.bounds.length,i=`Arity mismatch in subexpression instance.\nExpected ${r} argument${r===1?``:`s`}, but found${n.length<r?` only`:``} ${n.length}.`;throw e(P(t.location,i)),new j(i,{failure:`Expr.Deref.deref_inst`})}let r=t.kind===`SetOf`?t.element:t.body;return L(Ke(n,F(0)),r)}case`Tquant`:return It(e,I({kind:`Quant`,quantifier:t.quantifier,bounds:t.names.map(e=>({name:e,level:`State`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`Lambda`:return It(e,I({kind:`Quant`,quantifier:`Forall`,bounds:t.params.map(e=>({name:e.name,level:`Unknown`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`SetSt`:case`Choose`:if(n.length!==1){let r=`Arity mismatch in subexpression instance.\nExpected 1 argument, but found ${n.length}.`;throw e(P(t.location,r)),new j(r,{failure:`Expr.Deref.deref_inst`})}return L(Ke(n,F(0)),t.body);default:{let n=`Cannot instantiate non-binding expression`;throw e(P(t.location,n)),new j(n,{failure:`Expr.Deref.deref_inst`})}}},Lt=(e,t,n)=>{let r=(()=>{switch(n.kind){case`Quant`:case`Fcn`:case`SetOf`:return n.bounds.map(e=>({name:e.name,shape:0}));case`Tquant`:return n.names.map(e=>({name:e,shape:0}));case`Lambda`:return n.params;case`SetSt`:case`Choose`:return[{name:n.name,shape:0}];default:{let t=`Cannot abstract over bound variables in a non-binding expression`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_at`})}}})(),i=L(Pt(t,r.length),n);return[r,It(e,i,Ft(r.length))]},Rt=(e,t,n,r,i,a)=>{let o=t=>{if(!(r<=t))throw e(P(i.location,a)),new j(a,{failure:`Expr.Deref.deref_num`})},s=e=>(o(e.length),e[r-1]),c=(()=>{switch(n.kind){case`Sequent`:{let i=n.sequent;o(i.context.length+1);let a=i.context[r-1];if(a&&a.kind!==`Fact`){let t=`subexpression reference does not resolve to an expression`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_num`})}let s=L(F(-(r-1)),a?a.expression:i.active);if(Mt(s))throw e(P(n.location,`subexpression of ASSUME/PROVE uses identifiers declared therein
10
- Tlapm does not handle yet such subexpression namings.`)),new j(`Subexpression of ASSUME/PROVE uses identifiers declared therein
11
-
12
- Tlapm does not handle yet such subexpression namings.`,{failure:`Expr.Deref.deref_num`});return[t,s]}case`Apply`:return[t,s(n.args)];case`With`:return Rt(e,t,n.expression,r,i,a);case`If`:return[t,s([n.condition,n.consequent,n.alternative])];case`List`:return[t,s(n.items)];case`SetEnum`:case`Tuple`:return[t,s(n.elements)];case`Product`:return[t,s(n.factors)];case`Let`:return o(1),[[...t,...n.definitions],n.body];case`Quant`:case`SetOf`:case`Fcn`:return[t,s(n.bounds.flatMap(e=>e.domain.kind===`Domain`?[e.domain.expression]:[]))];case`Choose`:case`SetSt`:if(!n.domain)break;return[t,s([n.domain])];case`Arrow`:return[t,s([n.domain,n.range])];case`FcnApp`:{let e=n.args.length===1?n.args[0]:I({kind:`Tuple`,elements:n.args},n);return[t,s([n.function,e])]}case`Rect`:case`Record`:return[t,s(n.fields.map(e=>e.value))];case`Dot`:return[t,s([n.expression,I({kind:`String`,value:n.field},n)])];case`Except`:return[t,s([n.function,...n.specs.map(e=>e.value)])];case`Sub`:case`Tsub`:return[t,s([n.action,n.subscript])];case`Fair`:return[t,s([n.subscript,n.action])];case`Case`:return[t,s([...n.arms.map(e=>I({kind:`Tuple`,elements:[e.condition,e.body]},e.body)),...n.other?[I({kind:`Tuple`,elements:[Ot,n.other]},n.other)]:[]])]}let c=`Expression has no subexpressions`;throw e(P(n.location,c)),new j(c,{failure:`Expr.Deref.deref_num`})})();if(kt(c[1])){let t=`Cannot resolve subexpression reference !${r}`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_num`})}return c},zt=(e,t)=>{let n=e.length,r=e;for(let e=n-1;e>=0;e--)r.includes(n-e)||(r=r.map(t=>t+e<n?t:t-1));return r.map(e=>t[n-e])},Bt=(e,t,n,r,i)=>{let a=Nt(n,r,[]);if(!a)return e(P(n.location,`Could not find label ${r}`)),{params:[],definitions:[],expression:Ot};let o=a.indices;if(o.length!==i.length&&i.length>0){let t=o.length===1?``:`s`,n=`Expected ${o.length} argument${t} for labelled reference !${r}, but found ${i.length}`;throw e(P(a.expression.location,n)),new j(n,{failure:`Expr.Deref.deref_lsub`})}let s=i.length===0?o.map(e=>({name:e.name,shape:0})):[],c=i.length===0?Ft(o.length):i,l=a.context.reduceRight((e,t)=>t.kind===`Defn`?I({kind:`Let`,definitions:[t.definition],body:e},e):t.kind===`Fresh`?I({kind:`Quant`,quantifier:`Forall`,bounds:[{name:t.name,level:`Constant`,domain:{kind:`NoDomain`}}],body:e},e):L(F(-1),e),a.expression),u=L(Pt(t,s.length),l),d=[],f=u,p=zt(o.map(e=>e.index),c);for(;p.length>0;)if(f.kind===`Let`&&f.definitions.length===1)d.push(f.definitions[0]),f=f.body,p=p.map(e=>L(F(1),e));else{if(f.kind!==`Quant`||f.bounds.length!==1)throw new O(`File "src/expr/e_deref.ml", line 477, characters 21-33: Assertion failed`);f=L(Ge(p[0],F(0)),f.body),p=p.slice(1)}return{params:s,definitions:d,expression:f}},Vt=(e,t,n,r,i)=>{if(n.kind!==`Let`)throw e(P(n.location,`not a LET expression`)),new j(`not a LET expression`,{failure:`Expr.Deref.deref_letop`});let a=n.definitions.findIndex(e=>e.kind===`Operator`&&e.name===r),o=n.definitions[a];if(!o||o.kind!==`Operator`){let t=`no definition of operator ${r}`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_letop`})}let s=o.body,c=s.kind===`Lambda`?I({...s,body:I({kind:`Parens`,expression:s.body,form:{kind:`Xlabel`,label:r,indices:s.params.map((e,t)=>({name:e.name,index:s.params.length-t}))}},s.body)},s):I({kind:`Parens`,expression:s,form:{kind:`Xlabel`,label:r,indices:[]}},s);return Bt(e,t,I({kind:`Let`,definitions:n.definitions.slice(0,a),body:c},s),r,i)},Ht=(e,t,n,r)=>{let[i,...a]=r;if(!i){let e=n.definitions.length===0?n.expression:I({kind:`Let`,definitions:n.definitions,body:n.expression},n.expression),t=n.params.length===0?e:I({kind:`Lambda`,params:n.params,body:e},e);return{...At(t),isAtomic:!0}}if(n.expression.isAtomic)return e(P(n.expression.location,`Expression has no subexpressions`)),Ot;let o=t?n.expression:jt(n.expression),s=n.definitions.length,c=(()=>{let r=(t,r)=>{let[i,s]=Rt(e,[],o,t,n.expression,r);return{params:[],definitions:i,expression:s,rest:a,isLabel:!1}};switch(i.kind){case`Down`:{let[n,...r]=a;if(o.kind===`Let`&&n?.kind===`Label`&&t)return{...Vt(e,s,o,n.label,n.args),rest:r,isLabel:!0};if(t)return{params:[],definitions:[],expression:o,rest:a,isLabel:!1};throw new j(`!: is forbidden for this expression.
13
- `,{failure:`Expr.Deref.deref: !:`})}case`Number`:return r(i.value,`Cannot resolve !${i.value}`);case`Left`:return r(1,`Cannot resolve !<<`);case`Right`:return r(2,`Cannot resolve !>>`);case`Instance`:return{params:[],definitions:[],expression:It(e,o,i.args),rest:a,isLabel:!1};case`Label`:return{...o.kind===`Let`&&!t?Vt(e,s,o,i.label,i.args):Bt(e,s,o,i.label,i.args),rest:a,isLabel:!0};case`At`:{let[t,n]=Lt(e,s,o);return{params:t,definitions:[],expression:n,rest:a,isLabel:!1}}}})();return Ht(e,c.isLabel,{params:[...n.params,...c.params],definitions:[...n.definitions,...c.definitions],expression:c.expression},c.rest.map(e=>xt(e,e=>L(F(c.definitions.length),e))))},Ut=(e,t,n)=>{if(n.length>0)return{params:[],definitions:[],expression:It(e,t,n)};if(t.kind!==`Lambda`)return{params:[],definitions:[],expression:t};let[r,i]=Lt(e,0,t);return{params:r,definitions:[],expression:i}},Wt=(e,t,n,r)=>{let i=Ht(e,!0,Ut(e,t,n),r);if(kt(i)){let n=`Could not resolve subexpression reference`;throw e(P(t.location,n)),new j(n,{failure:`Expr.Anon: 2`})}return i},Gt=e=>e.kind===`Named`?`<${e.level}>${e.label}`:`<${e.level}>`,Kt=e=>++e.value,qt={kind:`Fact`,expression:{kind:`At`,isExcept:!1},visibility:`Visible`},Jt={Number:`1NUM`,Down:`1DOWN`,At:`1AT`,Instance:`1INST`,Left:`1`,Right:`1`},Yt={kind:`Opaque`,name:`$badexp`},Xt=(e,t,n)=>{let r,i=e=>e.scope?.size??0,a=(e,t)=>{if(t.kind===`At`&&t.isExcept)return r?R(i(e)-r.size,r.expression):t;if(t.kind!==`Except`)return u(e,t);let n=a(e,t.function);return t.specs.reduce((n,o)=>{let[s,c]=nt(n,o.trail,(t,n)=>{if(n.kind===`Dot`)return[I({kind:`Dot`,expression:t,field:n.field},t),n];let r=a(e,n.expression);return[I({kind:`FcnApp`,function:t,args:[r]},t),{kind:`Apply`,expression:r}]}),l=r;r={expression:s,size:i(e)};let u=a(e,o.value);return r=l,I({kind:`Except`,function:n,specs:[{trail:c,value:u}]},t)},n)},o=(e,t,n)=>{let r=I({kind:`Ix`,index:e},n);return t.length===0?r:I({kind:`Apply`,operator:r,args:t},n)},s=(e,t,n,r,i)=>{if(t!==`Builtin`)return o(e,r,i);let a=R(e,n);return I(r.length===0?a:st(a,r),i)},c=(e,t,r,i)=>{let a=et(e.scope,t);if(!a){let e=`Operator "${t}" not found`;throw n(P(i.location,e)),new j(e,{failure:`Expr.Anon: 4`})}let c=a.depth+1,l=a.hyp;switch(l.kind){case`Defn`:{let e=l.definition;if(e.kind===`Operator`)return s(c,l.whereDefined,e.body,r,i);if(e.kind===`Recursive`)throw new j(`Recursive operators not supported by TLAPS`,{failure:`Expr.Anon: Recursive`});return o(c,r,i)}case`Fresh`:return o(c,r,i);case`Flex`:return I({kind:`Ix`,index:c},i);case`Fact`:throw new O(`File "src/expr/e_anon.ml", line 230, characters 24-36: Assertion failed`)}},l=(e,t,r,i,o,c)=>{let u=et(e.scope,t);if(!u){let[o,...s]=i;if(o?.kind===`Label`){let n=o.args.map(t=>a(e,t));return l(e,`${t}!${o.label}`,[...r,...n],s,!0,c)}let u=`Operator "${t}" not found`;throw o&&n(P(c.location,u)),new j(u,{failure:`Expr.Anon: ${o?Jt[o.kind]:`1EMPTY`}`})}let d=u.hyp;if(d.kind!==`Defn`||d.definition.kind!==`Operator`&&d.definition.kind!==`Bpragma`)throw new j(`invalid subexpression reference`);let f=u.depth+1;if(i.length===0&&o)return r.length===0?I({kind:`Ix`,index:f},c):s(f,d.whereDefined,d.definition.body,r,c);let p=Zt(R(f,d.definition.body),c);return Zt(Wt(n,p,r,i),c)},u=(e,t)=>{switch(t.kind){case`Bang`:{let n=t.expression;if(n.kind===`Apply`&&n.operator.kind===`Opaque`){let r=t.selectors.map(t=>xt(t,t=>a(e,t))),i=n.args.map(t=>a(e,t)),o={warnedSteps:[],scope:e.scope};return l(o,n.operator.name,i,r,!1,t)}return a(e,{...t,expression:I({kind:`Apply`,operator:n,args:[]},n)})}case`Apply`:{if(t.operator.kind!==`Opaque`)return h(e,t);let r=t.operator.name;if(e.warnedSteps.includes(r))return n({text:`${We(t.location)}Warning: ${r} does not introduce any assumptions. It does not make sense to use it here.\n`,channel:`toolbox`}),I({kind:`Internal`,builtin:`TRUE`},t);let i=t.args.map(t=>a(e,t));return c(e,r,i,t)}case`Opaque`:return a(e,I({kind:`Apply`,operator:t,args:[]},t));case`Parens`:return t.form.kind===`Syntax`?a(e,t.expression):{...t,expression:a(e,t.expression),form:d(e,t.form)};default:return h(e,t)}},d=(e,t)=>t.kind===`Nlabel`?{kind:`Xlabel`,label:t.label,indices:t.names.map(t=>{let n=et(e.scope,t);if(!n)throw new j(`Identifier "${t}" in label parameters not found`);return{name:t,index:n.depth+1}})}:t,f=(e,t)=>({warnedSteps:e.warnedSteps,scope:t}),p=(e,t)=>f(e,Ze(e.scope,t)),m=(e,t)=>{let n=bt(t,t=>a(e,t));return[n.reduce((e,t)=>p(e,rt(t.name,t.level)),e),n]},h=(e,t)=>{if(t.kind===`Sequent`)return{...t,sequent:y(e,t.sequent)[1]};if(t.kind===`Let`){let[n,r]=_(e,t.definitions);return{...t,definitions:r,body:a(n,t.body)}}return Tt(e,t,a,p)},g=(e,t)=>{if(t.kind!==`Operator`)return t;let n=t.body;if(n.kind!==`Fcn`)return{...t,body:a(e,n)};let r=a(p(e,rt(t.name,`Constant`)),n);if(z(L(Ge({kind:`Opaque`,name:`%%%`},F(1)),r),r))return{...t,body:R(-1,r)};let i=Ye(`Eq`,[I({kind:`Ix`,index:1},r),r],r);return{...t,body:I({kind:`Choose`,name:t.name,domain:void 0,body:i},r)}},_=(e,n)=>{let r=e,i=[...n],a=[];for(let e=0;e<i.length;e++){let n=i[e];if(n.kind===`Instance`){i.splice(e+1,0,...t(r.scope,n));continue}let o=g(r,n);r=p(r,{kind:`Defn`,definition:o,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),a.push(o)}return[r,a]},v=(e,t)=>{let n=(()=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:a(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:g(e,t.definition)};case`Fact`:return{...t,expression:a(e,t.expression)}}})();return[p(e,n),n]},y=(e,t)=>{let[n,r]=nt(e,t.context,v);return[n,{context:r,active:a(n,t.active)}]},b=(e,t)=>({warnedSteps:[Gt(t),...e.warnedSteps],scope:e.scope}),x=(e,t,n,r)=>p(e,{kind:`Defn`,definition:{kind:`Operator`,name:Gt(t),body:n,location:r.location},whereDefined:`Proof`,visibility:`Visible`,isLocal:!0,location:r.location}),S=(e,t)=>f(e,Qe(e.scope,Array.from({length:t},()=>qt))),ee=e=>{let t=[...e.context.map((t,n)=>{let r=e.context.length-n+1;if(t.kind===`Fact`)return R(r,t.expression);if(t.kind!==`Fresh`||!t.domain)return Yt;let i=Ye(`Mem`,[I({kind:`Ix`,index:0},t.domain),t.domain],t.domain);return R(r,i)}),R(1,e.active)];return t.length===1?t[0]:{kind:`Tuple`,elements:t}},C=e=>e.kind!==`Use`&&e.kind!==`Hide`&&e.kind!==`Define`,w=(e,t)=>({facts:t.facts.map(t=>a(e,t)),defs:t.defs.flatMap(t=>{if(t.kind===`Dx`)return[t];let r=a(e,I({kind:`Opaque`,name:t.name},t));return r.kind===`Ix`?tt(e.scope,r.index-1)?.hyp.kind===`Defn`?[{kind:`Dx`,index:r.index,location:t.location}]:(n({text:`${We(t.location)}${JSON.stringify(t.name)} is not a definition and cannot be used in a DEF clause.`,channel:`toolbox`}),[]):(n({text:`${We(t.location)}Ignored unexpandable identifier ${JSON.stringify(t.name)} in BY DEF.`,channel:`stderr`}),[])})}),T=(e,t)=>{switch(t.kind){case`Steps`:{let[n,r]=nt(e,t.steps,E),i=T(t.step?b(n,t.step):n,t.qed.proof);return{...t,steps:r,qed:{...t.qed,proof:i}}}case`By`:return{...t,usable:w(e,t.usable)};default:return t}},E=(t,n)=>{let r=n.step?.kind===`Unnamed`&&C(n)?{kind:`Named`,level:n.step.level,label:`_a${Kt(e)}`,isAnonymous:!0}:n.step;if(!r)throw new O;let i={...n,step:r};switch(i.kind){case`Assert`:{let[,e]=y(t,i.sequent),n=e.context.reduce(p,t),a=S(x(S(n,1),r,I(ee(e),i),i),1),o=e.context.length===0?b(a,r):a,s={...i,sequent:e,proof:T(o,i.proof)};return[S(x(t,r,I(Xe(e),i),i),1),s]}case`Pcase`:{let e=a(t,i.expression),n=I({kind:`Tuple`,elements:[R(2,e)]},i),o=S(x(S(t,2),r,n,i),1),s={...i,expression:e,proof:T(o,i.proof)},c=x(t,r,I({kind:`Tuple`,elements:[e]},i),i);return[S(c,1),s]}case`Suffices`:{let[,e]=y(t,i.sequent),n=I({kind:`Tuple`,elements:[I(Xe(e),i)]},i),a=S(x(t,r,n,i),1),o={...i,sequent:e,proof:T(a,i.proof)},s=e.context.reduce(p,t),c=I({kind:`Tuple`,elements:[I(ee(e),i)]},i);return[S(x(S(s,1),r,c,i),1),o]}case`Have`:{let e=a(t,i.expression),n=I({kind:`Tuple`,elements:[R(2,e)]},i);return[S(x(S(t,2),r,n,i),1),{...i,expression:e}]}case`Take`:{let[e,n]=m(t,i.bounds),a=I({kind:`Quant`,quantifier:`Forall`,bounds:n,body:Yt},i);return[S(x(S(e,1),r,a,i),1),{...i,bounds:n}]}case`Witness`:{let e=i.expressions.map(e=>a(t,e)),n=I({kind:`Tuple`,elements:e},i);return[S(x(S(t,1),r,n,i),1),{...i,expressions:e}]}case`Pick`:{let[e,n]=m(t,i.bounds),o=a(e,i.expression),s=I({kind:`Quant`,quantifier:`Exists`,bounds:n,body:o},i),c=b(S(x(S(t,1),r,s,i),1),r),l={...i,bounds:n,expression:o,proof:T(c,i.proof)},u=n.reduce((e,t)=>p(e,rt(t.name,t.level)),S(t,2)),d=R(4+n.length,s);return[S(x(S(u,2),r,d,i),1),l]}case`Use`:{let e=w(t,i.usable);return[S(t,e.facts.length),{...i,usable:e}]}case`Hide`:return[t,{...i,usable:w(t,i.usable)}];case`Define`:{let[e,n]=_(t,i.definitions);return[e,{...i,definitions:n}]}case`Forget`:return[t,i]}};return{expr:(e,t)=>a({warnedSteps:[],scope:e},t),defn:(e,t)=>g({warnedSteps:[],scope:e},t),sequent:(e,t)=>y({warnedSteps:[],scope:e},t)[1],usable:(e,t)=>w({warnedSteps:[],scope:e},t),proof:(e,t)=>T({warnedSteps:[],scope:e},t)}},Zt=(e,t)=>t.location?{...e,location:t.location}:e,Qt=1000000010,$t=new TextEncoder,en=e=>{for(let t=0;t<e.length;t++)if(e.charCodeAt(t)>127)return $t.encode(e).length;return e.length},tn=()=>({leftTotal:-1,element:{size:-1,token:{kind:`Text`,text:``},length:0}}),nn=()=>{let e={size:-1,token:{kind:`Begin`,indent:0,box:`hov`},length:0};return{queue:[e],queueStart:0,scanStack:[tn(),{leftTotal:1,element:e}],formatStack:[],margin:78,maxIndent:68,spaceLeft:78,currentIndent:0,isNewLine:!0,leftTotal:1,rightTotal:1,depth:1,output:[]}},rn=(e,t)=>{e.rightTotal+=t.length,e.queue.push(t)},an=(e,t,n)=>{e.output.push(`
14
- `),e.isNewLine=!0,e.currentIndent=Math.min(e.maxIndent,e.margin-n+t),e.spaceLeft=e.margin-e.currentIndent,e.output.push(` `.repeat(e.currentIndent))},on=(e,t)=>{e.spaceLeft-=t,e.output.push(` `.repeat(t))},sn=e=>{let t=e.formatStack.at(-1);t?t.width>e.spaceLeft&&t.box!==`fits`&&t.box!==`h`&&an(e,0,t.width):e.output.push(`
15
- `)},cn=(e,t,n)=>{switch(n.kind){case`Text`:e.spaceLeft-=t,e.output.push(n.text),e.isNewLine=!1;return;case`Begin`:{e.margin-e.spaceLeft>e.maxIndent&&sn(e);let r=e.spaceLeft-n.indent,i=n.box===`v`||t>e.spaceLeft?n.box:`fits`;e.formatStack.push({box:i,width:r});return}case`End`:e.formatStack.pop();return;case`Newline`:{let t=e.formatStack.at(-1);t?an(e,0,t.width):e.output.push(`
16
- `);return}case`Break`:{let r=e.formatStack.at(-1);if(!r)return;let i=r.width;switch(r.box){case`hov`:t>e.spaceLeft?an(e,n.offset,i):on(e,n.width);return;case`b`:e.isNewLine?on(e,n.width):t>e.spaceLeft||e.currentIndent>e.margin-i+n.offset?an(e,n.offset,i):on(e,n.width);return;case`hv`:case`v`:an(e,n.offset,i);return;case`fits`:case`h`:on(e,n.width);return}}}},ln=e=>{for(;e.queueStart<e.queue.length;){let t=e.queue[e.queueStart],n=t.size>=0;if(!n&&e.rightTotal-e.leftTotal<e.spaceLeft)return;e.queueStart++,cn(e,n?t.size:Qt,t.token),e.leftTotal+=t.length}e.queue.length=0,e.queueStart=0},un=(e,t)=>{rn(e,t),ln(e)},dn=(e,t)=>{let n=e.scanStack.at(-1);n&&(n.leftTotal<e.leftTotal?e.scanStack=[tn()]:n.element.token.kind===(t?`Break`:`Begin`)&&(n.element.size=e.rightTotal+n.element.size,e.scanStack.pop()))},fn=(e,t,n)=>{rn(e,n),t&&dn(e,!0),e.scanStack.push({leftTotal:e.rightTotal,element:n})},pn=(e,t,n)=>{e.depth++,fn(e,!1,{size:-e.rightTotal,token:{kind:`Begin`,indent:n,box:t},length:0})},mn=e=>{e.depth<=1||(rn(e,{size:0,token:{kind:`End`},length:0}),dn(e,!0),dn(e,!1),e.depth--)},hn=(e,t,n)=>un(e,{size:t,token:{kind:`Text`,text:n},length:t}),gn=(e,t,n)=>fn(e,!0,{size:-e.rightTotal,token:{kind:`Break`,width:t,offset:n},length:t}),_n=e=>un(e,{size:0,token:{kind:`Newline`},length:0}),vn=e=>{for(;e.depth>1;)mn(e);return e.rightTotal=Qt,ln(e),e.output.join(``)},yn=e=>{vn(e);let t=[...e.output,`
17
- `];Object.assign(e,nn()),e.output=t},bn={h:`h`,v:`v`,hv:`hv`,hov:`hov`,b:`b`},xn=e=>({kind:`Text`,text:e,size:en(e)}),Sn=e=>e===``?[]:[xn(e)],Cn={kind:`Break`,width:1,offset:0},wn={kind:`Break`,width:0,offset:0},Tn=e=>{let t=e.search(/\d|$/);return{kind:`Open`,box:bn[e.slice(0,t)],indent:Number(e.slice(t)||0)}},B=(e,...t)=>{let n=[],r=0,i=``,a=()=>{i!==``&&(n.push(xn(i)),i=``)};for(let o=0;o<e.length;o++){let s=e[o];if(s===`%`){a();let e=t[r++];typeof e==`string`?e!==``&&n.push(xn(e)):n.push(e),o++}else if(s!==`@`)i+=s;else switch(a(),e[o+1]){case`[`:{if(e[o+2]!==`<`){n.push({kind:`Open`,box:`b`,indent:0}),o++;break}let t=e.indexOf(`>`,o);n.push(Tn(e.slice(o+3,t))),o=t;break}case`]`:n.push({kind:`Close`}),o++;break;case` `:n.push(Cn),o++;break;case`,`:n.push(wn),o++;break;case`
18
- `:n.push({kind:`Newline`}),o++;break;case`.`:n.push({kind:`Flush`}),o++;break;case`;`:{let t=e.indexOf(`>`,o),r=e.slice(o+3,t).split(` `);n.push({kind:`Break`,width:Number(r[0]),offset:Number(r[1])}),o=t;break}case`<`:{let i=e.indexOf(`>`,o);n.push({kind:`Text`,text:String(t[r++]),size:Number(e.slice(o+2,i))}),o=i+2;break}}}return a(),n},V=(e,t,n=[xn(`,`),Cn])=>e.flatMap((e,r)=>r===0?[t(e)]:[n,t(e)]),En=(e,t)=>{for(let n of t)if(Array.isArray(n))En(e,n);else switch(n.kind){case`Open`:pn(e,n.box,n.indent);break;case`Close`:mn(e);break;case`Text`:hn(e,n.size,n.text);break;case`Break`:gn(e,n.width,n.offset);break;case`Newline`:_n(e);break;case`Flush`:yn(e)}},Dn=e=>{let t=nn();return En(t,e),vn(t)},On=[[`=>`,1,1,`InfixNon`,[]],[`<=>`,2,2,`InfixNon`,[`\\equiv`]],[`/\\`,3,3,`InfixLeft`,[`\\land`]],[`\\/`,3,3,`InfixLeft`,[`\\lor`]],[`~`,4,4,`Prefix`,[`\\neg`,`\\lnot`]],[`=`,5,5,`InfixNon`,[]],[`#`,5,5,`InfixNon`,[`/=`]],[`SUBSET`,8,8,`Prefix`,[]],[`UNION`,8,8,`Prefix`,[]],[`DOMAIN`,9,9,`Prefix`,[]],[`\\subseteq`,5,5,`InfixNon`,[]],[`\\in`,5,5,`InfixNon`,[]],[`\\notin`,5,5,`InfixNon`,[]],[`\\`,8,8,`InfixNon`,[]],[`\\cap`,8,8,`InfixLeft`,[`\\intersect`]],[`\\cup`,8,8,`InfixLeft`,[`\\union`]],[`\\X`,10,13,`Prefix`,[`\\times`]],[`'`,15,15,`Postfix`,[]],[`~>`,2,2,`InfixNon`,[`\\leadsto`]],[`ENABLED`,4,15,`Prefix`,[]],[`UNCHANGED`,4,15,`Prefix`,[]],[`\\cdot`,5,14,`InfixLeft`,[]],[`-+->`,2,2,`InfixNon`,[]],[`[]`,4,15,`Prefix`,[]],[`<>`,4,15,`Prefix`,[]],[`^`,14,14,`InfixNon`,[]],[`/`,13,13,`InfixNon`,[]],[`*`,13,13,`InfixLeft`,[]],[`-.`,12,12,`Prefix`,[`-`]],[`-`,11,11,`InfixLeft`,[]],[`+`,10,10,`InfixLeft`,[]],[`^+`,15,15,`Postfix`,[]],[`^*`,15,15,`Postfix`,[]],[`^#`,15,15,`Postfix`,[]],[`<`,5,5,`InfixNon`,[]],[`=<`,5,5,`InfixNon`,[`<=`,`\\leq`]],[`>`,5,5,`InfixNon`,[]],[`>=`,5,5,`InfixNon`,[`\\geq`]],[`...`,9,9,`InfixNon`,[]],[`..`,9,9,`InfixNon`,[]],[`|`,10,11,`InfixLeft`,[]],[`||`,10,11,`InfixLeft`,[]],[`&&`,13,13,`InfixLeft`,[]],[`&`,13,13,`InfixLeft`,[]],[`$$`,9,13,`InfixLeft`,[]],[`$`,9,13,`InfixLeft`,[]],[`??`,9,13,`InfixLeft`,[]],[`%%`,10,11,`InfixLeft`,[]],[`%`,10,11,`InfixLeft`,[`\\mod`]],[`##`,9,13,`InfixLeft`,[]],[`++`,10,10,`InfixLeft`,[]],[`--`,11,11,`InfixLeft`,[]],[`**`,13,13,`InfixLeft`,[]],[`//`,13,13,`InfixNon`,[]],[`^^`,14,14,`InfixNon`,[]],[`@@`,6,6,`InfixLeft`,[]],[`!!`,9,13,`InfixNon`,[]],[`|-`,5,5,`InfixNon`,[]],[`|=`,5,5,`InfixNon`,[]],[`-|`,5,5,`InfixNon`,[]],[`=|`,5,5,`InfixNon`,[]],[`<:`,7,7,`InfixNon`,[]],[`:>`,7,7,`InfixNon`,[]],[`:=`,5,5,`InfixNon`,[]],[`::=`,5,5,`InfixNon`,[]],[`(+)`,10,10,`InfixLeft`,[`\\oplus`]],[`(-)`,11,11,`InfixLeft`,[`\\ominus`]],[`(.)`,13,13,`InfixLeft`,[`\\odot`]],[`(/)`,13,13,`InfixNon`,[`\\oslash`]],[`(\\X)`,13,13,`InfixLeft`,[`\\otimes`]],[`\\uplus`,9,13,`InfixLeft`,[]],[`\\sqcap`,9,13,`InfixLeft`,[]],[`\\sqcup`,9,13,`InfixLeft`,[]],[`\\div`,13,13,`InfixNon`,[]],[`\\wr`,9,14,`InfixNon`,[]],[`\\star`,13,13,`InfixLeft`,[]],[`\\o`,13,13,`InfixLeft`,[`\\circ`]],[`\\bigcirc`,13,13,`InfixLeft`,[]],[`\\bullet`,13,13,`InfixLeft`,[]],[`\\prec`,5,5,`InfixNon`,[]],[`\\succ`,5,5,`InfixNon`,[]],[`\\preceq`,5,5,`InfixNon`,[]],[`\\succeq`,5,5,`InfixNon`,[]],[`\\sim`,5,5,`InfixNon`,[]],[`\\simeq`,5,5,`InfixNon`,[]],[`\\ll`,5,5,`InfixNon`,[]],[`\\gg`,5,5,`InfixNon`,[]],[`\\asymp`,5,5,`InfixNon`,[]],[`\\subset`,5,5,`InfixNon`,[]],[`\\supset`,5,5,`InfixNon`,[]],[`\\supseteq`,5,5,`InfixNon`,[]],[`\\approx`,5,5,`InfixNon`,[]],[`\\cong`,5,5,`InfixNon`,[]],[`\\sqsubset`,5,5,`InfixNon`,[]],[`\\sqsubseteq`,5,5,`InfixNon`,[]],[`\\sqsupset`,5,5,`InfixNon`,[]],[`\\sqsupseteq`,5,5,`InfixNon`,[]],[`\\doteq`,5,5,`InfixNon`,[]],[`\\propto`,5,5,`InfixNon`,[]]],kn=/* @__PURE__ */ new Map;for(let[e,t,n,r,i]of On){let a={name:e,low:t,high:n,fixity:r};for(let t of[e,...i])kn.set(t,a)}const An=e=>({name:e,low:-1,high:-1,fixity:`Nonfix`}),jn=e=>kn.get(e)??An(e),Mn={Implies:`=>`,Equiv:`<=>`,Conj:`/\\`,Disj:`\\/`,Neg:`~`,Eq:`=`,Neq:`#`,SUBSET:`SUBSET`,UNION:`UNION`,DOMAIN:`DOMAIN`,Subseteq:`\\subseteq`,Mem:`\\in`,Notmem:`\\notin`,Setminus:`\\`,Cap:`\\cap`,Cup:`\\cup`,Prime:`'`,StrongPrime:`'`,Leadsto:`~>`,ENABLED:`ENABLED`,UNCHANGED:`UNCHANGED`,Cdot:`\\cdot`,Actplus:`-+->`,BoxTrue:`[]`,BoxFalse:`[]`,Diamond:`<>`,Plus:`+`,Minus:`-`,Times:`*`,Ratio:`/`,Quotient:`\\div`,Remainder:`%`,Exp:`^`,Lteq:`=<`,Lt:`<`,Gteq:`>=`,Gt:`>`,Range:`..`,Cat:`\\o`,OneArg:`:>`,Extend:`@@`},Nn=e=>{if(e===`Divides`)return{name:`?|`,low:10,high:11,fixity:`InfixNon`};if(e===`Uminus`)return{...jn(`-.`),name:`-`};let t=Mn[e];return t?jn(t):An(e)},Pn=e=>e.salt===0?e.rep:`${e.rep}_${e.salt}`,Fn=()=>({stack:[],idents:/* @__PURE__ */ new Map,defined:/* @__PURE__ */ new Map}),In=(e,t)=>{let n=e.idents.get(t)?.at(-1),r=n?{rep:t,salt:n.salt+1}:{rep:t,salt:0};for(;e.defined.has(Pn(r));)r={rep:t,salt:r.salt+1};e.stack.push(r);let i=e.idents.get(t);i?i.push(r):e.idents.set(t,[r]);let a=Pn(r);return e.defined.set(a,(e.defined.get(a)??0)+1),a},Ln=(e,t)=>{for(let n=0;n<t;n++){let t=e.stack.pop();if(!t)return;e.idents.get(t.rep)?.pop();let n=Pn(t),r=(e.defined.get(n)??1)-1;r===0?e.defined.delete(n):e.defined.set(n,r)}},Rn=(e,t,n)=>{let r=n(t.map(t=>In(e,t)));return Ln(e,t.length),r},zn=(e,t)=>t.kind===`Atm`||t.kind===`Op`&&e<t.low,Bn=e=>[B(`(`),e,B(`)`)],Vn=(e,t)=>t?Hn(e):Bn(Hn(e)),Hn=e=>{if(e.kind!==`Op`)return e.doc;let t=e.skeleton,n=t=>zn(e.high,t);switch(t.kind){case`Prefix`:case`Postfix`:{let r=t.operand,i=Vn(r,n(r)||r.kind===`Op`&&r.skeleton.kind===t.kind),a=t.kind===`Prefix`?[e.doc,i]:[i,e.doc];return[B(`@[<h>`),...a,B(`@]`)]}case`Infix`:{let r=t.left,i=t.right,a=n(r)||r.kind===`Op`&&r.name===e.name&&t.assoc===`Left`,o=n(i)||t.assoc===`Right`&&i.kind===`Op`&&i.skeleton.kind===`Infix`&&i.skeleton.assoc===`Right`;return[B(`@[<b0>`),Vn(r,a),e.doc,Vn(i,o),B(`@]`)]}}},H=e=>({kind:`Atm`,doc:e}),Un=e=>({kind:`Big`,doc:e}),Wn=e=>e.kind===`Lambda`?Wn(e.body):e.kind===`Sequent`?Wn(e.sequent.active):e.kind===`With`,Gn=e=>{if(e.kind===`Defn`){let t=e.definition,n=t.kind===`Operator`&&Wn(t.body);return e.visibility===`Hidden`||n||e.whereDefined!==`User`}return e.kind===`Fact`?e.visibility===`Hidden`||Wn(e.expression):!1},Kn=e=>e===0?[]:B(`@[<hov1>(%a)@]`,V(Array.from({length:e},()=>`_`),Sn)),qn=e=>B(`%s%a`,e.name,Kn(e.shape)),Jn={Constant:`CONSTANT`,State:`STATE`,Action:`ACTION`,Temporal:`TEMPORAL`,Unknown:`UNKNOWN`},Yn=(e=[])=>{let t=Fn(),n=e=>Hn(l(e)),r=(e,r)=>Rn(t,e.map(e=>e.name),()=>B(`@[<b2>LAMBDA @[<hv0>%a@] :@ %a@]`,V(e,qn),n(r))),i=(e,r)=>{let i=e.map(e=>e.domain.kind===`Domain`?n(e.domain.expression):void 0);return Rn(t,e.map(e=>e.name),t=>{let n=[];return e.forEach((e,r)=>{r>0&&e.domain.kind===`Ditto`?n.at(-1)?.names.push(t[r]):n.push({names:[t[r]],index:r})}),r(V(n,t=>{let n=V(t.names,Sn),r=e[t.index].domain;return r.kind===`NoDomain`?n:r.kind===`Ditto`?B(`@[<hov0>%a@ \\in ??????@]`,n):B(`@[<hov0>%a@ \\in %a@]`,n,i[t.index]??[])}))})},a=e=>{switch(e.kind){case`Down`:return B(`:`);case`Left`:return B(`<<`);case`Right`:return B(`>>`);case`At`:return Sn(`@`);case`Number`:return Sn(String(e.value));case`Instance`:return B(`@[<b1>(%a)@]`,V(e.args,n));case`Label`:return e.args.length===0?Sn(e.label):B(`@[<b2>%s@,@[<b1>(%a)@]@]`,e.label,V(e.args,n))}},o=e=>e.length===0?[]:[B(`!`),V(e,a,B(`!`))],s=n=>{if(n<0)return`#$$${Math.abs(n)}`;if(n===0)return`#$0`;if(n<=t.stack.length)return Pn(t.stack[t.stack.length-n]);let r=e[e.length-(n-t.stack.length)];return r?Je(r)??`??? FACT ???`:`#$${n}`},c=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Op`,name:` `,doc:B(`@ `),low:20,high:20,skeleton:{kind:`Infix`,assoc:`Left`,left:Un(r(e.params,e.body)),right:H(B(`(%a)`,V(t,n)))}};if(e.kind===`Bang`)return t.length===0?l(e):H(B(`@[<b2>%a@[<b1>(%a)@]@]`,n(e),V(t,n)));if(e.kind===`Internal`&&t.length===1){if(e.builtin===`BoxFalse`||e.builtin===`Unprimable`)return l(t[0]);if(e.builtin===`Irregular`)return H(B(`@[<h>@<1>%s%a@<1>%s@]`,`<[`,n(t[0]),`]>`))}let i=(()=>{switch(e.kind){case`Ix`:return jn(s(e.index));case`Opaque`:{let t=jn(e.name);return{...t,name:`?${t.name}`}}case`Internal`:return Nn(e.builtin);default:throw new j(`Cannot print this operator`)}})(),a=(e,t)=>({kind:`Op`,name:i.name,doc:e,low:i.low,high:i.high,skeleton:t});if(t.length===0)return H(Sn(i.name));if(i.fixity===`Nonfix`)return H(B(`@[<b2>%s@[<b1>(%a)@]@]`,i.name,V(t,n)));if(i.fixity===`Prefix`&&t.length===1)return a(/[A-Za-z]$/.test(i.name)?B(`%s@ `,i.name):Sn(i.name),{kind:`Prefix`,operand:l(t[0])});if(i.fixity===`Postfix`&&t.length===1)return a(Sn(i.name),{kind:`Postfix`,operand:l(t[0])});if(i.fixity.startsWith(`Infix`)&&t.length===2){let e=i.fixity===`InfixLeft`?`Left`:i.fixity===`InfixRight`?`Right`:`Non`;return a(i.name===`..`?Sn(i.name):B(`@ %s `,i.name),{kind:`Infix`,assoc:e,left:l(t[0]),right:l(t[1])})}throw new j(`Arity mismatch for operator ${i.name}`)},l=e=>{switch(e.kind){case`Ix`:case`Opaque`:case`Internal`:return c(e,[]);case`Lambda`:return Un(r(e.params,e.body));case`Bang`:return H([n(e.expression),o(e.selectors)]);case`Apply`:return c(e.operator,e.args);case`Sequent`:return Un(f(e.sequent));case`With`:return l(e.expression);case`If`:return Un(B(`@[<hv2>@[<b2>IF@ %a@]@ @[<b2>THEN %a@]@ @[<b2>ELSE %a@]@]`,n(e.condition),n(e.consequent),n(e.alternative)));case`List`:{if(e.bullet===`Refs`&&e.items.length===0)return H(B(`TRUE`));if(e.bullet===`Refs`&&e.items.length===1)return l(e.items[0]);let t=e.bullet===`Or`?`\\/`:`/\\`;return Un(B(`@[<v0>%a@]`,V(e.items,e=>B(`@[<h>%s %a@]`,t,n(e)),B(`@,`))))}case`Let`:{let r=V(e.definitions,u,B(`@,`)),i=n(e.body);return Ln(t,e.definitions.length),Un([B(`@[<hv0>LET @[<v0>`),r,B(`@]@
19
- IN %a@]`,i)])}case`Quant`:return i(e.bounds,t=>Un(B(`@[<b3>%s @[<b0>%a@] :@ %a@]`,e.quantifier===`Forall`?`\\A`:`\\E`,t,n(e.body))));case`Tquant`:return Rn(t,e.names,t=>Un(B(`@[<b4>%s @[<b0>%a@] : %a@]`,e.quantifier===`Forall`?`\\AA`:`\\EE`,V(t,Sn),n(e.body))));case`Choose`:{let r=e.domain&&n(e.domain);return Rn(t,[e.name],([t])=>Un(r?B(`@[<b2>CHOOSE @[<b2>%s \\in@ %a@] :@ %a@]`,t,r,n(e.body)):B(`@[<b2>CHOOSE %s :@ %a@]`,t,n(e.body))))}case`SetSt`:{let r=n(e.domain);return Rn(t,[e.name],([t])=>H(B(`@[<b3>{@[<b2>%s \\in@ %a@] :@ %a}@]`,t,r,n(e.body))))}case`SetOf`:return i(e.bounds,t=>H(B(`@[<b3>{%a :@ %a}@]`,n(e.element),t)));case`SetEnum`:return H(B(`@[<h>{@[<b0>%a@]}@]`,V(e.elements,n)));case`Arrow`:return H(B(`@[<b3>[%a ->@ %a]@]`,n(e.domain),n(e.range)));case`Fcn`:return i(e.bounds,t=>H(B(`@[<b3>[%a |->@ %a]@]`,t,n(e.body))));case`FcnApp`:{let t=l(e.function),r=t.kind===`Atm`;return H(B(`@[<h>%s%a%s@[<b1>[%a]@]@]`,r?``:`(`,Hn(t),r?``:`)`,V(e.args,n)))}case`Product`:if(e.factors.length===1)return l(e.factors[0]);if(e.factors.length===0)throw new j(`Expr.Fmt.fmt_expr: PRODUCT []`);return{kind:`Op`,name:`\\X`,doc:B(`@ \\X `),low:10,high:13,skeleton:{kind:`Infix`,assoc:`Right`,left:l(e.factors[0]),right:l({...e,factors:e.factors.slice(1)})}};case`Tuple`:return H(B(`@[<b2><<%a>>@]`,V(e.elements,n)));case`Rect`:return H(B(`@[<b1>[%a]@]`,V(e.fields,e=>B(`@[<h>%s : %a@]`,e.name,n(e.value)))));case`Record`:return H(B(`@[<b1>[%a]@]`,V(e.fields,e=>B(`@[<h>%s |-> %a@]`,e.name,n(e.value)))));case`Except`:return H(B(`@[<b3>[%a EXCEPT@ @[<v0>%a@]]@]`,n(e.function),V(e.specs,e=>B(`!@[<h>%a = %a@]`,e.trail.map(e=>e.kind===`Dot`?B(`.%s`,e.field):B(`[%a]`,n(e.expression))),n(e.value)))));case`Dot`:return{kind:`Op`,name:`.`,doc:B(`.`),low:16,high:16,skeleton:{kind:`Infix`,assoc:`Left`,left:l(e.expression),right:H(Sn(e.field))}};case`Sub`:case`Tsub`:{let t=e.modal===`Box`,r=e.kind===`Sub`?t?`[`:`<<`:t?`[][`:`<><<`;return H(B(`@[<h>%s@[<b2>%a@]%s%a@]`,r,n(e.action),t?`]_`:`>>_`,n(e.subscript)))}case`Fair`:return Un(B(`@[<h>%s_%a (%a)@]`,e.fairness===`Weak`?`WF`:`SF`,Bn(n(e.subscript)),n(e.action)));case`Case`:return Un(B(`@[<v2>CASE %a%a@]`,V(e.arms,e=>B(`@[<b2>%a ->@ %a@]`,n(e.condition),n(e.body)),B(`@,[] `)),e.other?B(`@,[] @[<b2>OTHER ->@ %a@]`,n(e.other)):[]));case`String`:return H(B(`"%s"`,e.value));case`Num`:return H(Sn(e.fraction===``?e.integer:`${e.integer}.${e.fraction}`));case`At`:return H(Sn(`@`));case`Parens`:{let n=e.form;if(n.kind===`Syntax`)return l(e.expression);let r=n.kind===`Nlabel`?n.names:n.indices.map(e=>e.index>=1&&e.index<=t.stack.length?s(e.index):`¶${e.index}`),i=l(e.expression);if(r.length===0){let e=i.kind===`Op`?`%s::(%a)`:`%s::%a`;return H(B(e,n.label,Hn(i)))}let a=V(r,Sn);return i.kind===`Atm`?H(B(`%s(%a)::%a`,n.label,a,Hn(i))):i.kind===`Big`?H(B(`%s(%a)::(%a)`,n.label,a,Hn(i))):H(B(`(%s(%a):: %a)`,n.label,a,Hn(i)))}}},u=e=>{switch(e.kind){case`Operator`:case`Bpragma`:{let r=e.body;if(r.kind===`Lambda`){let i=Rn(t,r.params.map(e=>e.name),()=>n(r.body)),a=In(t,e.name);return B(`@[<b2>%s@[<b1>(%a)@] ==@ %a@]`,a,V(r.params,qn),i)}let i=n(r);return B(`@[<b2>%s ==@ %a@]`,In(t,e.name),i)}case`Instance`:{let r=e.instance,i=Rn(t,r.args,e=>({doc:B(`@[<b2>INSTANCE %s%a@]`,r.module,r.substitutions.length===0?[]:B(`@ WITH@ %a`,V(r.substitutions,e=>B(`@[<b2>%s <- %a@]`,e.name,n(e.expression))))),args:e})),a=In(t,e.name),o=r.args.length===0?Sn(a):B(`%s (@[<b0>%a@])`,a,V(i.args,Sn));return B(`@[<b2>%a == %a@]`,o,i.doc)}case`Recursive`:{let n=In(t,e.name);return B(`@[<b2>NEW CONSTANT %s%a@]`,n,Kn(e.shape))}}},d=e=>{switch(e.kind){case`Fresh`:{let r=e.domain&&e.domainVisibility===`Visible`?n(e.domain):void 0,i=In(t,e.name);return[B(`NEW %s %s%a`,Jn[e.level],i,Kn(e.shape)),r?B(` \\in %a`,r):[]]}case`Flex`:return B(`NEW VARIABLE %s`,In(t,e.name));case`Defn`:return u(e.definition);case`Fact`:{let r=B(`@[<h>%a @]`,n(e.expression));return In(t,``),r}}},f=e=>{if(e.context.length===0)return n(e.active);let r=[];for(let n of e.context)Gn(n)?In(t,Je(n)??``):r.push(d(n));let i=n(e.active);return Ln(t,e.context.length),r.length===0?i:[B(`@[<v0>ASSUME @[<v0>`),V(r,e=>e),B(`@]@
20
- PROVE %a@]`,i)]};return{printSequent:f,printExpr:n}},Xn=(e,t)=>Yn(e).printExpr(t),Zn=e=>{let t=Yn();return Dn(B(`@[<b0>%a@]`,t.printSequent(e))).trimEnd()},Qn={kind:`At`,isExcept:!1},$n=e=>({location:e.location,step:e.step,isSuppressed:e.isSuppressed}),er=e=>e?.kind===`Named`&&e.isAnonymous,tr=e=>e?.level??0,nr=e=>I({kind:`Internal`,builtin:`TRUE`},e),rr=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===t&&e.args.length===2,ir=(e,...t)=>Dn(B(e,...t)),ar=e=>or(e).map((e,t)=>{let n=e.domain.kind===`Domain`?R(t,e.domain.expression):void 0;return{kind:`Fresh`,name:e.name,shape:0,level:n?`Constant`:e.level,domain:n,domainVisibility:`Visible`}}),or=e=>{let t={kind:`NoDomain`};return e.map(e=>e.domain.kind===`Ditto`?{...e,domain:t}:(t=e.domain,e))},sr=(e,t)=>t.context.flatMap((n,r)=>n.kind===`Fact`&&n.visibility===`Visible`?[R(e+t.context.length-1-r,n.expression)]:[]),cr=(e,t)=>{if(!e.step)throw new O;return{kind:`Defn`,definition:{kind:`Operator`,name:Gt(e.step),body:t,location:e.location},whereDefined:`Proof`,visibility:`Visible`,isLocal:!0,location:e.location}},lr=(e,t,n)=>{let r=er(n.step)?`Visible`:`Hidden`,i=t.context.map(e=>e.kind===`Fact`?{...e,visibility:r}:e),a=I({kind:`List`,bullet:`Refs`,items:sr(2,t)},n);return{context:[...e,...i,{kind:`Fact`,expression:nr(n),visibility:`Hidden`,location:n.location},cr(n,a),{kind:`Fact`,expression:I({kind:`Ix`,index:1},n),visibility:`Hidden`,location:n.location}],active:R(3,t.active)}},ur=(e,t,n,r,i)=>{let a=e||er(i.step)?`Visible`:`Hidden`;return{context:[...t,cr(i,I(Xe(r),i)),{kind:`Fact`,expression:I({kind:`Ix`,index:1},i),visibility:a,location:i.location}],active:R(2,n)}},dr=(e,t,n)=>{if(n.kind!==`Dx`)throw new j(`Unknown definition ${n.name}`);let r=t.length-n.index,i=t[r];if(!i)return t;if(i.kind!==`Defn`)throw new j(`Indicated point is not a definition`);return t.map((t,n)=>n===r?{...i,visibility:e}:t)},fr=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===`Mem`&&e.args[0]?.kind===`Ix`&&e.args[0].index===0&&z(t,e.args[1]),pr=(e,t,n,r)=>{let i=!1,a=n,o=[...r];for(let e=r.length-1;e>=0;e--){a=R(-1,a);let n=r[e];n.kind===`Fact`&&z(n.expression,a)?(i=!0,o[e]={...n,visibility:t}):n.kind===`Fresh`&&n.domain&&fr(a,n.domain)&&(i=!0,o[e]={...n,domainVisibility:t})}if(!i){let t=`This expression does not appear in the context and cannot be hidden.`;throw e(P(n.location,`${t}\n`)),new j(t,{failure:`proof.Gen.set_expr`})}return o},mr=(e,t)=>{let n=lt(F(1),t)[1];return n[0].domain.kind===`Ditto`&&e.domain.kind===`Domain`?[{...n[0],domain:{kind:`Domain`,expression:R(1,e.domain.expression)}},...n.slice(1)]:n},hr=(e,t)=>{if(e.isSuppressed||t.length===0)return{kind:`Obvious`,...$n(e)};let n=t.map((e,t)=>{let n=R(2*t+2,e);return{kind:`Assert`,sequent:{context:[],active:n},proof:{kind:`By`,usable:{facts:[R(3,n)],defs:[]},isOnly:!1,location:e.location},location:e.location}}),r={kind:`By`,usable:{facts:[I({kind:`Ix`,index:2*t.length+2},e),...t.map((n,r)=>I({kind:`Ix`,index:2*(t.length-r)},e))],defs:[]},isOnly:!0,...$n(e)};return{kind:`Steps`,steps:n,qed:{proof:r,location:r.location},...$n(e)}},gr=(e,t,n)=>({sequent:e,location:t.location,kind:n}),_r={total:0,absent:[],omitted:[]},vr=(e,t)=>({total:e.total+t.total,absent:[...e.absent,...t.absent],omitted:[...e.omitted,...t.omitted]}),yr=e=>{switch(e.kind){case`Use`:return{..._r,total:e.obligations?.length??0};case`Assert`:case`Suffices`:case`Pcase`:case`Pick`:return br(e.proof);default:return _r}},br=e=>e.kind===`Steps`?[...e.steps.map(yr),br(e.qed.proof)].reduce(vr):e.kind!==`Omitted`||!e.obligations||!e.location?{..._r,total:e.obligations?.length??0}:{total:e.obligations.length,absent:e.omission===`Implicit`?[e.location]:[],omitted:e.omission===`Explicit`?[e.location]:[]},xr=(e,t)=>e.kind===`At`&&!e.isExcept?I(ct(t),e):Et(e,e=>xr(e,t)),Sr=(e,t,n,r)=>{let i=(e,r)=>{let o=r.location;if(!o||!t.has(o.file)||o.endLine<n.start||o.startLine>n.end)return r;switch(r.kind){case`Obvious`:return{...r,obligations:[gr(e,r,{kind:`Main`})]};case`Omitted`:return{...r,obligations:[gr(e,r,{kind:`Omitted`,omission:r.omission})]};case`Error`:return{...r,obligations:[gr(e,r,{kind:`Error`,message:r.message})]};case`By`:throw new j(`Proof.Gen.generate`);case`Steps`:{let[t,n]=nt(e,r.steps,a),o=i(t,r.qed.proof);return{...r,steps:n,qed:{...r.qed,proof:o}}}}},a=(e,t)=>{switch(t.kind){case`Forget`:{let n=e.context.length,r=e.context.map((e,r)=>e.kind===`Fact`&&e.visibility===`Visible`&&t.count+r<n?{...e,visibility:`Hidden`}:e);return[{...e,context:r},t]}case`Use`:{let n=t.usable;if(n.defs.length===0&&n.facts.length===1){let r=n.facts[0],i=gr({...e,active:r},t,{kind:`Support`});return[{context:[...e.context,{kind:`Fact`,expression:r,visibility:`Visible`,location:r.location}],active:R(1,e.active)},{...t,obligations:[i]}]}if(n.facts.length>0)throw new j(`Proof.Gen.gen_step: USE with facts and definitions`);let r=n.defs.reduce((e,t)=>dr(`Visible`,e,t),e.context);return[{...e,context:r},t]}case`Hide`:{let n=t.usable.defs.reduce((e,t)=>dr(`Hidden`,e,t),e.context),i=t.usable.facts.reduceRight((e,t)=>pr(r,`Hidden`,t,e),n);return[{...e,context:i},t]}case`Define`:return[{context:[...e.context,...t.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:`User`,visibility:`Visible`,isLocal:!0,location:e.location}))],active:R(t.definitions.length,e.active)},t];case`Assert`:{let n=i(lr(e.context,t.sequent,t),t.proof),r={...t,proof:n};return[ur(!1,e.context,e.active,t.sequent,r),r]}case`Suffices`:{let n=i(ur(!0,e.context,e.active,t.sequent,t),t.proof),r={...t,proof:n};return[lr(e.context,t.sequent,r),r]}default:throw new j(`Proof.Gen.gen_step`)}},o=(e,t,n,r)=>{let i={kind:`Unnamed`,level:0,id:0},[o,s]=a({context:e,active:{...Qn,location:r}},t===`Use`?{kind:`Use`,usable:n,isOnly:!1,location:r,step:i}:{kind:`Hide`,usable:n,location:r,step:i});return[o.context,s.obligations??[]]},s=(e,t,n,r)=>{if(n.defs.length===0&&n.facts.length===0)return[e,[]];let i=n.defs.length>0,[a,...c]=n.facts,[l,u]=o(e,t,i?{defs:n.defs,facts:[]}:{defs:[],facts:[a]},r),d=i?n.facts:c.map(e=>R(1,e)),[f,p]=s(l,t,{defs:[],facts:d},r);return[f,[...u,...p]]},c=e=>{let t=[],n=e=>{e.kind===`Steps`?(n(e.qed.proof),e.steps.forEach(r)):e.obligations&&!e.isSuppressed&&t.push(...e.obligations)},r=e=>{e.kind===`Use`&&e.obligations&&!e.isSuppressed&&t.push(...e.obligations),(e.kind===`Assert`||e.kind===`Suffices`||e.kind===`Pcase`||e.kind===`Pick`)&&n(e.proof)};return n(e),t},l=t=>({kind:`Named`,level:t,label:`_a${Kt(e)}`,isAnonymous:!0}),u=(e,t)=>t?.kind===`Named`?{...t,level:e}:l(e),d=(e,t)=>{let n={...t,step:u(e,t.step)};if(n.kind!==`Steps`)return n;let r=n.steps.map(t=>f(e,t));return{...n,steps:r,qed:{...n.qed,proof:d(e+1,n.qed.proof)}}},f=(e,t)=>{let n={...t,step:u(e,t.step)};switch(n.kind){case`Assert`:case`Suffices`:case`Pcase`:case`Pick`:return{...n,proof:d(e+1,n.proof)};default:return n}},p=(e,t)=>{let n=t.kind===`Apply`?t.operator:t;if(n.kind===`Ix`){let r=e[e.length-n.index];if(!r)throw new j(`expose_connective`);if(r.kind!==`Defn`||r.definition.kind!==`Operator`)return t;let i=R(n.index,r.definition.body);if(t.kind!==`Apply`)return p(e,i);let a={...i,location:t.location};return p(e,I(st(a,t.args),a))}if(t.kind===`Apply`&&t.operator.kind===`Internal`&&t.operator.builtin===`Prime`){let n=p(e,t.args[0]),r=e=>Ye(`Prime`,[e],e);return n.kind===`Quant`?I({kind:`Quant`,quantifier:n.quantifier,bounds:n.bounds.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:r(e.domain.expression)}}:e),body:r(n.body)},t):rr(n,`Implies`)||rr(n,`Mem`)?I({kind:`Apply`,operator:n.operator,args:[r(n.args[0]),r(n.args[1])]},t):r(n)}return t.kind===`Parens`?p(e,t.expression):t},m=e=>{if(e.kind!==`Assert`)return;let t=e.sequent.active;return t.kind===`Apply`&&t.args.length===2?t.args[1]:void 0},h=e=>{if(e.kind!==`Steps`)return e;let t=[];return e.steps.forEach(e=>{let n=t.at(-1),r=n&&m(n);if(e.kind!==`Assert`||!r){t.push(e);return}let i=xr(e.sequent.active,R(2,r));t.push({...e,sequent:{...e.sequent,active:i}})}),{...e,steps:t}},g=(e,t,n)=>{let r=h(n);switch(r.kind){case`Obvious`:case`Omitted`:case`Error`:return r;case`By`:{let e=r.usable,t=e.defs.length===0?[]:[{kind:`Use`,usable:{facts:[],defs:e.defs},isOnly:!1,location:r.location}],n=e.facts.map((e,t)=>({kind:`Use`,usable:{facts:[R(t,e)],defs:[]},isOnly:!1,location:e.location,isSuppressed:r.isSuppressed})),i=r.isOnly?[{kind:`Forget`,count:e.facts.length,location:r.location}]:[],a=tr(r.step),o=[...t,...n,...i].map(e=>({...e,step:l(a)})),s={kind:`Obvious`,location:r.location,step:l(a),isSuppressed:r.isSuppressed};return{kind:`Steps`,steps:o,qed:{proof:s,location:s.location,step:s.step},location:r.location,step:r.step,isSuppressed:r.isSuppressed}}case`Steps`:{let n=e,i=t,a=r.steps.flatMap(e=>{let[t,r,a]=_(n,i,e);return n=t,i=r,a}),o=g(n,i,r.qed.proof);return{...r,steps:a,qed:{...r.qed,proof:o}}}}},_=(e,t,n)=>{let r=tr(n.step);switch(n.kind){case`Forget`:return[e,t,[n]];case`Assert`:{let r=lr(e,n.sequent,n),i={...n,proof:g(r.context,r.active,n.proof)},a=ur(!1,e,t,n.sequent,i);return[a.context,a.active,[i]]}case`Suffices`:{let r=ur(!0,e,t,n.sequent,n),i={...n,proof:g(r.context,r.active,n.proof)},a=lr(e,n.sequent,i);return[a.context,a.active,[i]]}case`Use`:{let r={kind:`By`,usable:n.usable,isOnly:n.isOnly,location:n.location,step:n.step,isSuppressed:n.isSuppressed},i=g(e,t,r);if(i.kind!==`Steps`)throw new j(`simplifying BY does not produce a non-leaf proof!`);let a=n.usable.facts.map(()=>({kind:`Fact`,expression:Qn,visibility:`Visible`,location:n.location}));return[[...e,...a],R(n.usable.facts.length,t),i.steps]}case`Hide`:return[n.usable.defs.reduce((e,t)=>{if(t.kind!==`Dx`)throw new j(`set_vis`);let r=e.length-t.index,i=e[r];if(i?.kind!==`Defn`){let e=i?i.kind===`Fact`?`??? FACT ???`:i.name:``;throw new j(`USE DEF ${e} invalid because ${e} is not a defined operator`)}return e.map((e,t)=>t===r?{...i,visibility:`Hidden`,location:n.location}:e)},e),t,[n]];case`Define`:return[[...e,...n.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:`Proof`,visibility:`Visible`,isLocal:!0,location:n.location}))],R(n.definitions.length,t),[n]];case`Have`:{let i=p(e,t),a={kind:`Fact`,expression:n.expression,visibility:`Visible`,location:n.location},o=rr(i,`Implies`),s={context:[a],active:o?R(1,i.args[1]):i},c=o?{kind:`By`,usable:{facts:[I({kind:`Ix`,index:2},n)],defs:[]},isOnly:!0,...$n(n)}:{kind:`Error`,message:ir(`@.@[<v2>@[%s@ %s@]@,%a@]@.`,`Error: this HAVE step is applied to the following goal,`,`which is not an implication:`,Xn(e,t)),...$n(n)},l=f(r,{kind:`Suffices`,sequent:s,proof:c,location:n.location,step:n.step});return _(e,t,l)}case`Take`:return _(e,t,f(r,y(e,t,n)));case`Witness`:return _(e,t,f(r,b(e,t,n)));case`Pcase`:{let i={kind:`Assert`,sequent:{context:[{kind:`Fact`,expression:n.expression,visibility:`Visible`,location:n.location}],active:R(1,t)},proof:n.proof,...$n(n)};return _(e,t,f(r,i))}case`Pick`:{let r=I({kind:`Quant`,quantifier:`Exists`,bounds:n.bounds,body:n.expression},n),i=v(n.step,`ex`),[a,o,s]=_(e,t,{kind:`Assert`,sequent:{context:[],active:r},proof:n.proof,...$n(n),step:i}),c=R(2,r);if(c.kind!==`Quant`)throw new j(`Proof.Simplify.simplify_step/PICK`);let l=[...ar(c.bounds),{kind:`Fact`,expression:c.body,visibility:`Visible`,location:c.body.location}],[u,d,f]=_(a,o,{kind:`Suffices`,sequent:{context:l,active:R(l.length,o)},proof:{kind:`Omitted`,omission:`Elsewhere`,...$n(n)},...$n(n)});return[u,d,[...s,...f]]}}},v=(t,n)=>({kind:`Named`,level:tr(t),label:`${t?.kind===`Named`?t.label:`_a`}${n}${Kt(e)}`,isAnonymous:!1}),y=(e,t,n)=>{let r=or(n.bounds),i=(t,n,r,a)=>{let o=a[0];if(!o)return{aux:n,goal:r};let s=p(e,r);if(s.kind!==`Quant`||s.quantifier!==`Forall`||s.bounds.length===0)return ir(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this TAKE step is applied to the following goal,`,`which is not a universal formula:`,Xn(e,r));let c=s.bounds[0],l=or(s.bounds).slice(1),u=o.domain,d=c.domain;if(u.kind===`NoDomain`&&d.kind===`Domain`)return ir(`@.@[<b0>%s (%s)@ %s (%s \\in %a)@]@.`,`Error: the TAKE argument`,o.name,`does not match the pattern`,c.name,Xn(e,d.expression));if(u.kind===`Domain`&&d.kind===`NoDomain`)return ir(`@.@[<b0>%s (%s \\in %a)@ %s (%s)@]@.`,`Error: the TAKE argument`,o.name,Xn(e,u.expression),`does not match the pattern`,c.name);let f=u.kind===`Domain`&&d.kind===`Domain`&&!z(u.expression,d.expression)?[{kind:`Apply`,operator:{kind:`Internal`,builtin:`Subseteq`},args:[d.expression,u.expression]},...n]:n;if(l.length===0)return i(1,f,s.body,a.slice(1));let m=a.length===1?l.map(e=>lt(F(t),[e])[1][0]):l;return i(t+1,f,I({kind:`Quant`,quantifier:`Forall`,bounds:m,body:s.body},s),a.slice(1))},a=i(1,[],t,r);if(typeof a==`string`)return{kind:`Suffices`,sequent:{context:[{kind:`Fact`,expression:nr(t),visibility:`Visible`,location:n.location}],active:t},proof:{kind:`Error`,message:a,...$n(n)},...$n(n)};let o=a.aux.filter((e,t)=>a.aux.findIndex(t=>z(e,t))===t),s=[I({kind:`Ix`,index:2},n),...o.map(e=>R(2,e))];return{kind:`Suffices`,sequent:{context:ar(r),active:a.goal},proof:{kind:`By`,usable:{facts:s,defs:[]},isOnly:!0,...$n(n)},...$n(n)}},b=(e,t,n)=>{let r=[],i=``,a=t;for(let t of n.expressions){let n=p(e,a);if(n.kind!==`Quant`||n.quantifier!==`Exists`||n.bounds.length===0){i||=ir(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this WITNESS step is applied to the following goal,`,`which is not an existential formula:`,Xn(e,n)),a=n;break}let[o,...s]=n.bounds,c=s.length===0?n.body:I({kind:`Quant`,quantifier:`Exists`,bounds:mr(o,s),body:n.body},n),l=t;if(o.domain.kind===`Domain`){let n=o.domain.expression,a=p(e,t);if(rr(a,`Mem`)){let[e,t]=a.args,i=z(t,n)?[]:[Ye(`Subseteq`,[t,n],t)];r.push(...i,a),l=e}else i||=ir(`@.@[<b0>%s (%a)@ %s (%s \\in %a)@]@.`,`Error: the WITNESS argument`,Xn(e,a),`does not match the pattern`,o.name,Xn(e,n)),l=a}let u=Ye(`Unprimable`,[l],l);a=L(Ge(u,F(0)),c)}let o=i===``?hr(n,r):{kind:`Error`,message:i,...$n(n)};return{kind:`Suffices`,sequent:{context:[],active:a},proof:o,...$n(n)}};return{generate:i,collect:c,mutate:s,simplify:g}},Cr=(e,t=0)=>({level:e,weights:Array.from({length:t},()=>!0),params:/* @__PURE__ */ new Set}),wr={TRUE:[0,0],FALSE:[0,0],Implies:[0,2],Equiv:[0,2],Conj:[0,2],Disj:[0,2],Neg:[0,1],Eq:[0,2],Neq:[0,2],STRING:[0,0],BOOLEAN:[0,0],SUBSET:[0,1],UNION:[0,1],DOMAIN:[0,1],Subseteq:[0,2],Mem:[0,2],Notmem:[0,2],Setminus:[0,2],Cap:[0,2],Cup:[0,2],Actplus:[3,2],BoxTrue:[3,1],BoxFalse:[3,1],Diamond:[3,1],Prime:[2,1],StrongPrime:[2,1],ENABLED:[1,1],UNCHANGED:[2,1],Leadsto:[3,2],Cdot:[2,2],Nat:[0,0],Int:[0,0],Real:[0,0],Infinity:[0,0],Plus:[0,2],Minus:[0,2],Times:[0,2],Ratio:[0,2],Quotient:[0,2],Remainder:[0,2],Exp:[0,2],Divides:[0,2],Lteq:[0,2],Lt:[0,2],Gteq:[0,2],Gt:[0,2],Range:[0,2],Uminus:[0,1],Seq:[0,1],Len:[0,1],BSeq:[0,2],Cat:[0,2],Append:[0,2],Head:[0,1],Tail:[0,1],SubSeq:[0,3],SelectSeq:[0,2],OneArg:[0,2],Extend:[0,2],Print:[0,2],PrintT:[0,1],Assert:[0,2],JavaTime:[0,0],TLCGet:[0,1],TLCSet:[0,2],Permutations:[0,1],SortSeq:[0,2],RandomElement:[0,1],Any:[0,0],ToString:[0,1],Unprimable:[0,1]},Tr={Constant:0,State:1,Action:2,Temporal:3,Unknown:0},Er=e=>new Set(e.flatMap(e=>[...e])),Dr=e=>({level:Math.max(0,...e.map(e=>e.level)),weights:[],params:Er(e.map(e=>e.params))}),Or=/* @__PURE__ */ new WeakMap,kr=e=>{let t=e.hyp;switch(t.kind){case`Flex`:return Cr(1);case`Fresh`:return{...Cr(Tr[t.level],t.shape),params:/* @__PURE__ */ new Set([t.name])};case`Defn`:{let n=t.definition;if(n.kind!==`Operator`&&n.kind!==`Bpragma`)throw new O;return Nr(e.rest,n.body)}case`Fact`:return Nr(e.rest,t.expression)}},Ar=e=>{let t=Or.get(e);if(t)return t;let n=kr(e);return Or.set(e,n),n},jr=(e,t,n)=>{let r=t.flatMap(t=>t.domain.kind===`Domain`?[Nr(e,t.domain.expression)]:[]),i=t.reduce((e,t)=>Ze(e,rt(t.name,t.level)),e);return Dr([Nr(i,n),...r])},Mr=(e,t)=>{if(e.weights.length!==t.length)throw new j(`Invalid number of arguments`);let n=t.filter((t,n)=>e.weights[n]);return{level:Math.max(e.level,...n.map(e=>e.level)),weights:[],params:Er([e.params,...n.map(e=>e.params)])}},Nr=(e,t)=>{let n=t=>Nr(e,t);switch(t.kind){case`Ix`:{let n=tt(e,t.index-1);if(!n)throw new O;return Ar(n)}case`Internal`:{let e=wr[t.builtin];if(!e)throw new O;return Cr(e[0],e[1])}case`Opaque`:case`String`:case`Num`:return Cr(0);case`Lambda`:{let n=t.params.reduce((e,t)=>Ze(e,rt(t.name,`Unknown`,t.shape)),e),r=Nr(n,t.body),i=new Set(t.params.map(e=>e.name));return{level:r.level,weights:t.params.map(e=>r.params.has(e.name)),params:new Set([...r.params].filter(e=>!i.has(e)))}}case`Apply`:{let e=t.operator;if(e.kind===`Opaque`)return Mr(Cr(0,t.args.length),t.args.map(n));if(e.kind===`Internal`&&t.args.length===1){let r=t.args[0];switch(e.builtin){case`Prime`:case`StrongPrime`:if(n(r).level>1)throw new O;return Cr(2,1);case`ENABLED`:{let e=n(r);if(e.level>2)throw new O;return{level:1,weights:[],params:e.params}}case`UNCHANGED`:{let e=n(r);if(e.level>1)throw new O;return{level:2,weights:[],params:e.params}}}}return e.kind===`Internal`&&e.builtin===`Cdot`?(t.args.forEach(n),Cr(2)):e.kind===`Internal`&&e.builtin===`Leadsto`?(t.args.forEach(n),Cr(3,2)):Mr(n(e),t.args.map(n))}case`Sequent`:{let[n,r]=nt(e,t.sequent.context,(e,t)=>{let n=Ze(e,t);return[n,Ar(n).level]});return Cr(Math.max(0,...r,Nr(n,t.sequent.active).level))}case`With`:case`Dot`:case`Parens`:return n(t.expression);case`Let`:{let n=t.definitions.reduce((e,t)=>Ze(e,{kind:`Defn`,definition:t,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),e);return Nr(n,t.body)}case`If`:return Dr([t.condition,t.consequent,t.alternative].map(n));case`List`:return Dr(t.items.map(n));case`Quant`:case`Fcn`:return jr(e,t.bounds,t.body);case`SetOf`:return jr(e,t.bounds,t.element);case`Tquant`:return Nr(t.names.reduce((e,t)=>Ze(e,{kind:`Flex`,name:t}),e),t.body),Cr(3);case`Choose`:case`SetSt`:{let r=t.domain&&n(t.domain),i=t.domain?it(t.name,t.domain):rt(t.name,`Constant`);return Dr([Nr(Ze(e,i),t.body),...r?[r]:[]])}case`SetEnum`:case`Tuple`:return Dr(t.elements.map(n));case`Product`:return Dr(t.factors.map(n));case`FcnApp`:return Dr([t.function,...t.args].map(n));case`Arrow`:return Dr([n(t.domain),n(t.range)]);case`Rect`:case`Record`:return Dr(t.fields.map(e=>n(e.value)));case`Except`:return Dr([n(t.function),...t.specs.flatMap(e=>[...e.trail.flatMap(e=>e.kind===`Apply`?[n(e.expression)]:[]),n(e.value)])]);case`Sub`:return{...Dr([n(t.action),n(t.subscript)]),level:2};case`Tsub`:case`Fair`:return n(t.action),n(t.subscript),Cr(3);case`Case`:return Dr([...t.arms.flatMap(e=>[n(e.condition),n(e.body)]),...t.other?[n(t.other)]:[]]);case`Bang`:case`At`:throw new O}},Pr=(e,t)=>{let n=tt(e,t-1)?.hyp;if(!n)throw new O;return n},Fr=e=>e.kind===`Internal`&&(e.builtin===`ENABLED`||e.builtin===`Cdot`),Ir=e=>e.kind===`Apply`&&e.args.length===1&&e.args[0].kind===`Lambda`&&(Fr(e.operator)||e.operator.kind===`Opaque`&&(e.operator.name===`EnabledWrapper`||e.operator.name===`CdotWrapper`)),Lr=e=>e===void 0?2:Math.min(2,e),Rr=e=>e===void 0?void 0:Math.max(1,e-1),zr=(e,t,n,r)=>{let i=(n,i=r)=>zr(e,t,n,i);if(Ir(n))return n;if(n.kind===`Sub`)return{...n,action:i(n.action),subscript:i(n.subscript,Rr(r))};if(n.kind===`Apply`&&n.operator.kind===`Internal`){let e=n.operator.builtin,[t,a]=n.args;if(e===`Cdot`&&n.args.length===2)return{...n,args:[i(t,Lr(r)),i(a,1)]};if(e===`ENABLED`&&n.args.length===1)return{...n,args:[i(t,Lr(r))]};if((e===`Prime`||e===`UNCHANGED`)&&n.args.length===1)return{...n,args:[i(t,Rr(r))]}}let a=n.kind===`Apply`&&n.operator.kind===`Ix`?n.operator:n;if(a.kind!==`Ix`)return Tt(t,n,(t,n)=>zr(e,t,n,r),Ze);if(r===void 0)return n;let o=Nr(t,n).level,s=Pr(t,a.index),c=e=>`The operator \`${e}\` is declared at:\n${s.location?He(s.location):`<unknown location>`}`;if(s.kind===`Fresh`&&s.level===`Unknown`)throw e(P(n.location,`Declared operator \`${s.name}\` has unknown level and occurs within the scope of \`ENABLED\` or \`\\cdot\` where soundness requires expanding expressions of level >= ${r}.\nIf a constant operator is substituted for this operator, then the expression that results from applying this declared operator has expression level ${o}.\n May need expansion. A declared operator cannot be expanded.\n${c(s.name)}\n and has arity: ${s.shape}`)),new O(`File "src/expr/e_action.ml", line 367, characters 20-26: Assertion failed`);if(o<r)return n;if(o>2||s.kind===`Fact`)throw new O;if(s.kind===`Flex`){if(n.kind!==`Ix`)throw new O;return n}if(s.kind===`Fresh`){let t=`The expression that results from applying the declared operator \`${s.name}\` has expression level ${o} within the scope of \`ENABLED\` or \`\\cdot\` where soundness requires expanding expressions of level >= ${r}. A declared operator cannot be expanded.\n${c(s.name)}\n and has level: ${Tr[s.level]}\n and arity: ${s.shape}`;throw e(P(n.location,t)),new j(t)}let l=s.definition;if(l.kind!==`Operator`&&l.kind!==`Bpragma`)throw new O;e({text:`${Ue(n.location)}[INFO]: Auto-expanding the definition of operator: ${l.name}\n`,channel:`stdout`});let u=L(F(a.index),l.body);return i(ct(n.kind===`Apply`?st(u,n.args):u))},Br=e=>Ye(`Eq`,[Ye(`Prime`,[e],e),e],e),Vr=e=>{let t=e=>e.kind===`Tuple`?e.elements.flatMap(t):[e],n=t(e);return n.length===0?I({kind:`Internal`,builtin:`TRUE`},e):n.length===1?Br(n[0]):I({kind:`List`,bullet:`And`,items:n.map(Br)},e)},Hr=e=>{if(e.kind===`Apply`&&e.args.length===1)return Vr(e.args[0]);if(e.kind!==`Sub`)throw new O;let t=Vr(e.subscript),n=e.modal===`Box`?t:Ye(`Neg`,[t],e);return Ye(e.modal===`Box`?`Disj`:`Conj`,[e.action,n],e)},Ur=e=>{let t=(e,t)=>e<<t|e>>>32-t,n=(e,n)=>{let r=Math.imul(t(Math.imul(n,3432918353),15),461845907);return Math.imul(t(e^r,13),5)+3864292196|0},r=new TextEncoder().encode(e),i=r.length-r.length%4,a=0;for(let e=0;e<i;e+=4)a=n(a,r[e]|r[e+1]<<8|r[e+2]<<16|r[e+3]<<24);let o=r.subarray(i).reduceRight((e,t)=>e<<8|t,0);return r.length>i&&(a=n(a,o)),a^=r.length,a=Math.imul(a^a>>>16,2246822507),a=Math.imul(a^a>>>13,3266489909),(a^a>>>16)&1073741823},Wr=e=>{let t=Array.from({length:16},()=>[]);return e.forEach((e,n)=>{if(t[Ur(e)&t.length-1].unshift(e),n+1<=t.length*2)return;let r=Array.from({length:t.length*2},()=>[]);t.flat().forEach(e=>r[Ur(e)&r.length-1].push(e)),t=r}),t.flat()},Gr=(e,t,n,r,i)=>{let a=i=>Gr(e,t,n,r,i),o=t!==void 0||n!==void 0,s=(a,o)=>{let s={names:[],depth:Math.max(t?.depth??0,n?.depth??0)+1},[c,l]=o,u=[Gr(e,t,s,r,c),...l?[Gr(e,s,n,r,l)]:[]],d=s.names.length===0?[`r#0`]:Wr(s.names);return I({kind:`Apply`,operator:a,args:[{kind:`Lambda`,params:[`_`,...d].map(e=>({name:e,shape:0})),body:u.length===1?u[0]:{kind:`List`,bullet:`And`,items:u}}]},i)};if(Ir(i))return i;if(i.kind===`Apply`&&i.operator.kind===`Internal`){let t=i.operator.builtin;if(t===`ENABLED`&&i.args.length===1||t===`Cdot`&&i.args.length===2)return s(i.operator,i.args);if(t===`Prime`&&i.args.length===1){let t=Gr(e,n,void 0,r,i.args[0]);return n?t:{...i,args:[t]}}if(t===`UNCHANGED`&&o)return a(Hr(i))}if(i.kind===`Sub`&&o)return a(Hr(i));if(i.kind===`Ix`){if(!t)return i;let e=Pr(r,i.index);if(e.kind===`Fact`)throw new O;if(e.kind!==`Flex`)return i;let n=`${e.name}#enabled#prime${t.depth}`;return t.names.includes(n)||t.names.push(n),I({kind:`Opaque`,name:n},i)}if(i.kind===`Apply`&&i.operator.kind===`Opaque`)throw e(P(i.location,`Named operator \`${i.operator.name}\` unexpected after anonymization.`)),new O(`File "src/expr/e_action.ml", line 1048, characters 12-18: Assertion failed`);return Tt(r,i,(r,i)=>Gr(e,t,n,r,i),Ze)},Kr=(e,t)=>{if(t.kind===`Apply`&&Fr(t.operator)){let[n]=t.args;if(t.args.length!==1||n.kind!==`Lambda`)throw new O;let[r,...i]=n.params;if(r.name!==`_`)return t;let a=Kr({kind:`Compose`,outer:e,inner:F(i.length)},n.body);return{kind:`Apply`,operator:t.operator,args:[{kind:`Lambda`,params:i,body:a}]}}return t.kind===`Ix`?L(e,t):t.kind===`Apply`?I(st(Kr(e,t.operator),t.args.map(t=>Kr(e,t))),t):Tt(e,t,Kr,e=>qe(1,e))},qr=e=>{if(e.kind===`Apply`&&Fr(e.operator)){let[t]=e.args;if(e.args.length!==1||t.kind!==`Lambda`||t.params[0].name===`_`)throw new O;let n=e.operator.builtin===`Cdot`?`CdotWrapper`:`EnabledWrapper`;return{kind:`Apply`,operator:I({kind:`Opaque`,name:n},e.operator),args:[{kind:`Lambda`,params:t.params.map((e,t)=>({name:`r#${t}`,shape:0})),body:qr(t.body)}]}}return Tt(void 0,e,(e,t)=>qr(t),()=>void 0)},Jr=e=>{if(e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===`Cdot`&&e.args.length===1&&e.args[0].kind!==`Lambda`)throw new O;return Tt(void 0,e,(e,t)=>Jr(t),()=>void 0)},Yr=(e,t,n,r)=>{let i=zr(t,n,r,void 0),a=Kr(F(0),Gr(t,void 0,void 0,n,i));return Jr(qr(e.expr(n,a)))},Xr=(e,t)=>({kind:`Definition`,definition:{kind:`Operator`,name:e,body:{kind:`Internal`,builtin:t}},whereDefined:`Builtin`,visibility:`Visible`,isLocal:!1}),U=(e,t,n)=>({kind:`Definition`,definition:{kind:`Operator`,name:t,body:{kind:`Lambda`,params:Array.from({length:e},(e,t)=>({name:`x${t+1}`,shape:0})),body:{kind:`Apply`,operator:{kind:`Internal`,builtin:n},args:Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n}))}}},whereDefined:`Builtin`,visibility:`Visible`,isLocal:!1}),Zr=[Xr(`Nat`,`Nat`),U(2,`+`,`Plus`),U(2,`-`,`Minus`),U(2,`*`,`Times`),U(2,`^`,`Exp`),U(2,`<`,`Lt`),U(2,`>`,`Gt`),U(2,`=<`,`Lteq`),U(2,`>=`,`Gteq`),U(2,`%`,`Remainder`),U(2,`\\div`,`Quotient`),U(2,`..`,`Range`)],Qr=[...Zr,Xr(`Int`,`Int`),U(1,`-.`,`Uminus`)],$r=[...Qr,Xr(`Real`,`Real`),U(2,`/`,`Ratio`),Xr(`Infinity`,`Infinity`)],ei=[U(1,`Seq`,`Seq`),U(1,`Len`,`Len`),U(2,`BSeq`,`BSeq`),U(2,`\\o`,`Cat`),U(2,`Append`,`Append`),U(1,`Head`,`Head`),U(1,`Tail`,`Tail`),U(3,`SubSeq`,`SubSeq`),U(2,`SelectSeq`,`SelectSeq`)],ti=[U(2,`Print`,`Print`),U(1,`PrintT`,`PrintT`),U(2,`Assert`,`Assert`),Xr(`JavaTime`,`JavaTime`),U(1,`TLCGet`,`TLCGet`),U(2,`TLCSet`,`TLCSet`),U(2,`:>`,`OneArg`),U(2,`@@`,`Extend`),U(1,`Permutations`,`Permutations`),U(2,`SortSeq`,`SortSeq`),U(1,`RandomElement`,`RandomElement`),Xr(`Any`,`Any`),U(1,`ToString`,`ToString`)],ni=(e,t)=>({name:e,extendees:[],body:t,isImportant:!1,isStandard:!0}),ri=new Map([ni(`Naturals`,Zr),ni(`Integers`,Qr),ni(`Reals`,$r),ni(`Sequences`,ei),ni(`TLC`,ti)].map(e=>[e.name,e])),ii=e=>{let t=e.location;switch(e.kind){case`Constants`:return e.declarations.map(e=>({kind:`Fresh`,name:e.name,shape:e.shape,level:`Constant`,domain:void 0,domainVisibility:`Visible`,location:t}));case`Recursives`:return e.declarations.map(e=>({kind:`Defn`,definition:{kind:`Recursive`,name:e.name,shape:e.shape,location:t},whereDefined:`User`,visibility:`Hidden`,isLocal:!1,location:t}));case`Variables`:return e.names.map(e=>({kind:`Flex`,name:e,location:t}));case`Definition`:return[{kind:`Defn`,definition:e.definition,whereDefined:e.whereDefined,visibility:e.visibility,isLocal:e.isLocal,location:t}];case`Axiom`:return e.name===void 0?[{kind:`Fact`,expression:e.expression,visibility:`Hidden`,location:t}]:oi(e.name,e.expression,t);case`Theorem`:{let n=ft(F(-e.axiomCount),{...e.sequent,context:e.sequent.context.slice(e.axiomCount)}),r=I(Xe(n),e);return e.name===void 0?[{kind:`Fact`,expression:r,visibility:`Hidden`,location:t}]:oi(e.name,r,t)}case`Mutate`:return e.mode===`Use`?e.usable.facts.map((e,n)=>({kind:`Fact`,expression:R(n,e),visibility:`Visible`,location:t})):[];case`Submod`:case`Anoninst`:return[]}},ai=e=>e.kind===`Axiom`||e.kind===`Theorem`?e.name===void 0?1:2:ii(e).length,oi=(e,t,n)=>[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:t,location:n},whereDefined:`User`,visibility:`Visible`,isLocal:!1,location:n},{kind:`Fact`,expression:{kind:`Ix`,index:1,location:n},visibility:`Hidden`,location:n}],si=e=>e.body.flatMap(e=>{switch(e.kind){case`Definition`:return[{...e,whereDefined:e.isLocal?`Builtin`:e.whereDefined}];case`Mutate`:return[];case`Theorem`:return[{...e,proof:{kind:`Omitted`,omission:`Elsewhere`,location:e.location}}];case`Submod`:return[{...e,module:{...e.module,body:si(e.module)}}];default:return[e]}}),ci=(e,t,n,r=/* @__PURE__ */ new Set([t.name]))=>{let i=[];for(let a of t.extendees){if(n.has(a))continue;if(r.has(a))throw new O(`Stack overflow`);let t=e.get(a);if(!t)throw new j(`Module "${a}" unknown`);i.push(...si(ci(e,t,n,/* @__PURE__ */ new Set([...r,a])))),n.add(a)}return{...t,body:[...i,...t.body].map(t=>t.kind===`Submod`?{...t,module:ci(e,t.module,/* @__PURE__ */ new Set)}:t)}},li=e=>{let t=/* @__PURE__ */ new Map,n=(e,n)=>{t.has(e)||t.set(e,n)},r=e=>e.extendees.forEach((t,r)=>n(t,e.extendeeLocations?.[r])),i=/* @__PURE__ */ new Set,a=/* @__PURE__ */ new Map,o=e=>{typeof e==`object`&&e&&(`instance`in e&&ui(e.instance)&&n(e.instance.module,e.instance.location),Object.values(e).forEach(o))},s=e=>{e.kind===`Theorem`?o(e.sequent):e.kind!==`Submod`&&o(e),e.kind===`Submod`&&(i.add(e.module.name),a.set(e.module.name,e.module),r(e.module),e.module.body.forEach(s))};return e.body.forEach(s),i.forEach(e=>t.delete(e)),r(e),{dependencies:[...t.keys()].sort(di),locations:t,submodules:a}},ui=e=>typeof e==`object`&&!!e&&`module`in e&&typeof e.module==`string`&&`substitutions`in e,di=(e,t)=>e<t?-1:+(e>t),fi=(e,t)=>({facts:ot(e,t.facts),defs:t.defs.map(t=>{if(t.kind===`Dvar`)return t;let n=L(e,{kind:`Ix`,index:t.index});if(n.kind!==`Ix`)throw new j(`substitution produced bad definition`);return{...t,index:n.index}})}),pi=(e,t)=>{switch(t.kind){case`Constants`:case`Recursives`:return[qe(t.declarations.length,e),t];case`Variables`:return[qe(t.names.length,e),t];case`Definition`:return[qe(1,e),{...t,definition:ut(e,t.definition)}];case`Axiom`:return[qe(ai(t),e),{...t,expression:L(e,t.expression)}];case`Theorem`:return[qe(ai(t),e),{...t,sequent:ft(e,t.sequent)}];case`Submod`:return[e,{...t,module:{...t.module,body:mi(e,t.module.body)}}];case`Mutate`:return[t.mode===`Hide`?e:qe(t.usable.facts.length,e),{...t,usable:fi(e,t.usable)}];case`Anoninst`:return[e,{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(t=>({name:t.name,expression:L(e,t.expression)}))}}]}},mi=(e,t)=>nt(e,t,pi)[1],hi=(e,t,n,r)=>{try{let n=Yr(e.anonymizer,e.onWarning,t,{kind:`Sequent`,sequent:r});if(n.kind!==`Sequent`)throw new O;return n.sequent}catch(t){if(!(t instanceof j)||t.failure===void 0)throw t;let i=r.active.location,a=`${t.failure}\nCould not instantiate the theorem ${n===void 0?``:`named: ${n}, `}at: ${i?He(i):`<unknown location>`}`;return e.onWarning({text:`${Ue(i)}[ERROR]${a}`,channel:`stdout`}),e.onWarning({text:a,channel:`toolboxOnly`}),{context:[],active:I({kind:`Internal`,builtin:`TRUE`},r.active)}}},gi=(e,t,n)=>{if(n.kind===`Theorem`)return{...n,sequent:hi(e,t,n.name,n.sequent)};if(n.kind!==`Definition`)return n;let r=n.definition;if(r.kind!==`Operator`&&r.kind!==`Bpragma`)return n;let i=Yr(e.anonymizer,e.onWarning,t,r.body);return{...n,definition:{...r,body:i}}},_i=(e,t,n)=>nt(t,n,(t,n)=>{if(n.kind===`Submod`){let[r,i]=_i(e,t,n.module.body);return[r,{...n,module:{...n.module,body:i}}]}let r=gi(e,t,n);return[Qe(t,ii(r)),r]}),vi=(e,t)=>{let n=[],r=0,i=e;for(;i.length>0;){let[e,...a]=i,o=e.kind===`Constants`?{name:e.declarations[0].name,remaining:{...e,declarations:e.declarations.slice(1)}}:e.kind===`Variables`?{name:e.names[0],remaining:{...e,names:e.names.slice(1)}}:void 0;if(o){let e=t.get(o.name);if(!e)throw new j(`Parameter ${o.name} has no substitute`);let n=ai(o.remaining)===0;i=mi(Ge(R(r,e),F(0)),n?a:[o.remaining,...a])}else n.push(e),r+=ai(e),i=a}return n},yi=(e,t,n)=>{let r=Array.from({length:t},(e,r)=>I({kind:`Ix`,index:t-r},{location:n})),i=Array.from({length:t},(e,t)=>I({kind:`Ix`,index:t+1},{location:n})),a=Array.from({length:e},(e,i)=>{let a=I({kind:`Ix`,index:i+t+1},{location:n});return t>0?I({kind:`Apply`,operator:a,args:r},{location:n}):a});return Ke([...a,...i].reverse(),F(e+t))},bi=(e,t)=>{let n=t.map(e=>({name:e,shape:0}));return e.kind===`Lambda`?{...e,params:[...n,...e.params]}:t.length===0?e:I({kind:`Lambda`,params:n,body:e},e)},xi=(e,t,n,r,i,a)=>{let o=e=>n===``?e:`${n}!${e}`,s=r.args.length,c=[],l=0,u=t,d=s===0,f=t=>{d||(d=!0,e.onWarning({text:t,channel:`stderr`}))};for(;u.length>0;){let[t,...n]=u;u=n;let d=e=>bi(L(yi(l,s,a),e),r.args);switch(t.kind){case`Definition`:{let n=t.definition;if(n.kind!==`Operator`&&n.kind!==`Bpragma`)throw new j(`Module.Elab.localize`);let r=t.isLocal?`${n.name}$${Kt(e.salts)}`:n.name;c.push({...t,definition:{...n,name:o(r),body:d(n.body)},whereDefined:t.isLocal?`Builtin`:t.whereDefined,isLocal:t.isLocal||i}),l+=1;continue}case`Axiom`:{f(`${We(a)}Instancing produces parametric axioms.\nSuch axioms will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`);let e={...t,name:t.name===void 0?void 0:o(t.name),expression:d(t.expression)};c.push(e),l+=ai(e);continue}case`Theorem`:{f(`${Ue(a)}Warning: Instancing produces parametric theorems.\nSuch theorems will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`);let e=d(I(Xe(t.sequent),t));c.push({...t,name:t.name===void 0?void 0:o(t.name),sequent:e.kind===`Sequent`?e.sequent:{context:[],active:e},proof:{kind:`Omitted`,omission:`Elsewhere`,location:t.location}}),l+=1;continue}case`Mutate`:t.mode===`Use`&&(u=mi(F(-t.usable.facts.length),u));continue;case`Submod`:continue;default:throw new j(`Module.Elab.localize`)}}return c},Si=e=>{let t=[],n=e;for(;n.length>0;){let[e,...r]=n;if(e.kind!==`Axiom`){t.push(e),n=r;continue}let i=e.location;e.name!==void 0&&t.push({kind:`Definition`,definition:{kind:`Operator`,name:e.name,body:e.expression,location:i},whereDefined:`Proof`,visibility:`Visible`,isLocal:!1,location:i});let a={kind:`Fact`,expression:e.name===void 0?R(1,e.expression):I({kind:`Ix`,index:2},e),visibility:`Visible`,location:i},o=0,s=r.map(e=>{let t=o;if(o+=ai(e),e.kind!==`Theorem`)return e;let n=ft(F(1),e.sequent);return{...e,sequent:{...n,context:[dt(F(t),a),...n.context]},axiomCount:e.axiomCount+1}});n=mi(F(-1),s)}return t},Ci=e=>new Set(e.body.flatMap(e=>e.kind===`Constants`?e.declarations.map(e=>e.name):e.kind===`Variables`?e.names:[])),wi=(e,t,n,r,i,a,o)=>{let s=t.get(r.module);if(!s)throw new j(`Module "${r.module}" unknown`);let c=Ci(s);for(let e of r.substitutions)if(!c.has(e.name))throw new j(`Parameter ${e.name} occurs in the statement \`INSTANCE ${r.module} WITH\`, and is not declared in the module ${r.module}`);let l=Qe(n,r.args.map(e=>rt(e,`Unknown`))),u=new Map(r.substitutions.map(e=>[e.name,e.expression]));for(let e of[...c].sort(di))if(!u.has(e)){if(!et(l,e))throw new j(`Required parameter ${e} for module ${r.module} could not be inferred.`);u.set(e,I({kind:`Opaque`,name:e},{location:o}))}let d=new Map([...u].map(([t,n])=>[t,e.anonymizer.expr(l,n)])),f=mi(F((l?.size??0)-(s.depth??0)),s.body.map(e=>e.kind===`Theorem`?{...e,proof:{kind:`Omitted`,omission:`Implicit`,location:e.proof.location}}:e)),[,p]=_i(e,l,f);return Si(xi(e,vi(p,d),a,r,i,o))},Ti=(e,t,n)=>e===void 0?{hyps:[],sequent:t}:{hyps:[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:I(Xe(t),{location:n}),location:n},whereDefined:`Proof`,visibility:`Visible`,isLocal:!1,location:n}],sequent:ft(F(1),t)},Ei=(e,t,n)=>{let r=n.instance.module;if(!e.latestModules.has(r))throw e.onWarning({text:`${We(n.instance.location)}Module ${JSON.stringify(r)} unknown\n`,channel:`toolbox`}),new j(`Module ${JSON.stringify(r)} unknown`,{failure:`Module.Elab.anon#defns`});let i=wi(e,e.latestModules,t,n.instance,!0,n.name,n.location),a=[],o=i;for(;o.length>0;){let[e,...t]=o;e.kind===`Definition`?(a.push(e.definition),o=t):o=mi(F(-ai(e)),t)}return a},Di=(e,t,n,r)=>{let i=[],a=n,o=e=>{i.push(e),a=Qe(a,ii(e))},s=e=>e!==void 0&&et(a,e)!==void 0,c=r.body.map(e=>({unit:e,isAnonymized:!1}));for(let n=0;n<c.length;n++){let i=c[n].unit,l=(r,o,s)=>{let l=wi(e,t,a,r,o,s,i.location);c.splice(n+1,0,...l.map(e=>({unit:e,isAnonymized:!0})))};switch(i.kind){case`Anoninst`:l(i.instance,i.isLocal,``);continue;case`Definition`:{let t=i.definition;if(t.kind===`Instance`){l(t.instance,i.isLocal,t.name);continue}let r=t.kind===`Recursive`||c[n].isAnonymized?t:e.anonymizer.defn(a,t),s={...i,definition:r};if(t.kind===`Recursive`){o(s);continue}let u=ii(s)[0],d=et(a,t.name);if(d?.hyp.kind===`Defn`&&(d.hyp.definition.kind===`Recursive`||vt(dt(F(d.depth+1),d.hyp),u))){let e=c.slice(n+1),t=mi(Ge(I({kind:`Ix`,index:d.depth+1},i),F(0)),e.map(e=>e.unit));c.splice(n+1,e.length,...e.map((e,n)=>({...e,unit:t[n]})));continue}o(s);continue}case`Recursives`:case`Constants`:case`Variables`:o(i);continue;case`Axiom`:if(s(i.name))continue;e.latestModules=new Map(t),o({...i,expression:e.anonymizer.expr(a,i.expression)});continue;case`Theorem`:{let n=s(i.name),c=n?`(redundant)${i.name}`:i.name,l=n?{kind:`Obvious`,location:i.proof.location}:i.proof;e.latestModules=new Map(t);let u=e.anonymizer.sequent(a,i.sequent),d=Ti(c,u,i.location),f=Qe(Qe(a,d.hyps),d.sequent.context),p=e.anonymizer.proof(f,l),m=r.isImportant?e.generator.simplify($e(f),d.sequent.active,p):p;o({...i,name:c,sequent:u,proof:m});continue}case`Mutate`:e.latestModules=new Map(t),o({...i,usable:e.anonymizer.usable(a,i.usable)});continue;case`Submod`:o({...i,module:Di(e,t,a,i.module)});continue}}let l={...r,body:i,depth:n?.size??0};return t.set(r.name,l),l},Oi=(e,t,n)=>{let r=[],i=[],a=_r,o=t;for(let t of n.body)switch(t.kind){case`Theorem`:{let n=Ti(t.name,t.sequent,t.location),s=[...o,...n.hyps],c=e.generator.generate({context:[...s,...n.sequent.context],active:n.sequent.active},t.proof);r.push(...e.generator.collect(c));let l=br(c);i.push({...l,location:t.location}),a=vr(a,l);let u=t.name===void 0?I(Xe(t.sequent),t):{kind:`Ix`,index:1,location:t.location};o=[...s,{kind:`Fact`,expression:u,visibility:`Hidden`,location:t.location}];continue}case`Submod`:{let n=Oi(e,o,t.module);r.push(...n.obligations),a=vr(a,n.summary);continue}case`Mutate`:{let[n,i]=e.generator.mutate(o,t.mode,t.usable,t.location);r.push(...i),o=n;continue}default:o=[...o,...ii(t)]}return{obligations:r,summary:{...a,theorems:i}}},ki=e=>({kind:`Opaque`,name:e}),Ai=e=>({kind:`Tuple`,elements:e.map(ki)}),ji=(e,t)=>({kind:`Apply`,operator:{kind:`Internal`,builtin:`Eq`},args:[e,t]}),Mi=e=>e.map(e=>({name:e,level:`Constant`,domain:{kind:`NoDomain`}})),Ni=(e,t)=>e?.kind===`Product`&&e.factors.length===t.length?e.factors:void 0,Pi=(e,t)=>t.map((t,n)=>({kind:`Operator`,name:t,body:{kind:`FcnApp`,function:ki(e),args:[{kind:`Num`,integer:String(n+1),fraction:``}]}})),Fi=(e,t)=>e.map((e,n)=>({name:e,level:`Constant`,domain:{kind:`Domain`,expression:t[n]}})),Ii=e=>({name:e.name,level:`Constant`,domain:e.domain}),Li=(e,t,n)=>{let r=[];return t.forEach(e=>{e.kind===`Name`&&e.domain.kind===`Ditto`?r.at(-1)?.push(e):r.push([e])}),r.reduceRight((t,n)=>{let r=n[0];if(r.kind===`Name`)return{kind:`Quant`,quantifier:e,bounds:n.flatMap(e=>e.kind===`Name`?[Ii(e)]:[]),body:t,location:t.location};let i=Ni(r.domain,r.names);if(i)return{kind:`Quant`,quantifier:e,bounds:Fi(r.names,i),body:t,location:t.location};let a={kind:`Apply`,operator:{kind:`Internal`,builtin:e===`Exists`?`Mem`:`Notmem`},args:[Ai(r.names),r.domain]};return{kind:`Quant`,quantifier:e,bounds:Mi(r.names),body:{kind:`List`,bullet:e===`Exists`?`And`:`Or`,items:[a,t]},location:t.location}},n)},Ri=(e,t,n,r)=>Ni(n,t)?{kind:`Let`,definitions:Pi(e,t),body:r}:{kind:`Quant`,quantifier:`Exists`,bounds:Mi(t),body:{kind:`List`,bullet:`And`,items:[ji(ki(e),Ai(t)),r]}},zi=(e,t,n)=>{let r=`choose#${e[0]}`;return{kind:`Choose`,name:r,domain:t,body:Ri(r,e,t,n)}},Bi=(e,t,n)=>{let r=`setst#${e[0]}`;return{kind:`SetSt`,name:r,domain:t,body:Ri(r,e,t,n)}},Vi=(e,t,n)=>{let r=e.map(e=>{if(e.kind===`Name`)return{bounds:[Ii(e)],definitions:[]};let t=Ni(e.domain,e.names);if(t&&n)return{bounds:Fi(e.names,t),definitions:[]};let r=`fcn#${e.names[0]}`,i={name:r,level:`Constant`,domain:{kind:`Domain`,expression:e.domain}};if(t)return{bounds:[i],definitions:Pi(r,e.names)};let a=`choose#${r}`;return{bounds:[i],definitions:[{kind:`Operator`,name:a,body:zi(e.names,void 0,ji(ki(r),Ai(e.names)))},...Pi(a,e.names)]}}),i=r.flatMap(e=>e.definitions);return{bounds:r.flatMap(e=>e.bounds),value:i.length===0?t:{kind:`Let`,definitions:i,body:t}}},Hi=(e,t)=>{let n=Vi(t,e,!0);return{kind:`SetOf`,element:n.value,bounds:n.bounds}},Ui=(e,t)=>{let n=Vi(e,t,!1);return{kind:`Fcn`,bounds:n.bounds,body:n.value}},Wi={"=>":`Implies`,"<=>":`Equiv`,"/\\":`Conj`,"\\/":`Disj`,"~":`Neg`,"=":`Eq`,"#":`Neq`,SUBSET:`SUBSET`,UNION:`UNION`,DOMAIN:`DOMAIN`,"\\subseteq":`Subseteq`,"\\in":`Mem`,"\\notin":`Notmem`,"\\":`Setminus`,"\\cap":`Cap`,"\\cup":`Cup`,"'":`Prime`,"~>":`Leadsto`,ENABLED:`ENABLED`,UNCHANGED:`UNCHANGED`,"\\cdot":`Cdot`,"-+->":`Actplus`,"[]":`BoxTrue`,"<>":`Diamond`,TRUE:`TRUE`,FALSE:`FALSE`,BOOLEAN:`BOOLEAN`,STRING:`STRING`},Gi=(e,t=!1)=>t&&e===`-`?`-.`:jn(e).name,Ki=/^<(\d+|\*|\+)>([A-Za-z0-9_]*)\.*$/,qi=(e,t)=>{if(!e||!t)return e??t;let n=e.startLine<t.startLine||e.startLine===t.startLine&&e.startColumn<=t.startColumn,r=e.endLine>t.endLine||e.endLine===t.endLine&&e.endColumn>=t.endColumn;return{file:e.file,startLine:n?e.startLine:t.startLine,startColumn:n?e.startColumn:t.startColumn,endLine:r?e.endLine:t.endLine,endColumn:r?e.endColumn:t.endColumn}},Ji={Always:`[]`,Eventually:`<>`,Enabled:`ENABLED`,Unchanged:`UNCHANGED`},Yi=(e,t)=>e!==void 0&&t!==void 0&&e.line===t.line&&e.column===t.column,Xi=e=>e.location.range?.start,Zi=e=>e.location.range?.end,Qi=(e,t)=>{let n=e.location.range;return n&&t?{...e,location:{...e.location,range:{...n,end:t}}}:e},$i=e=>{if(e.kind===`Apply`){let t=jn(e.operator),n=e.args.length===2&&t.fixity.startsWith(`Infix`),r=e.args.length===1&&t.fixity===`Prefix`;if(!n&&!r)return;let i=e.args.length-1;return{operator:t,isInfix:n,operand:e.args[i],replace:t=>({...e,args:[...e.args.slice(0,i),t]})}}let t=Ji[e.kind];if(t!==void 0&&`expression`in e)return{operator:jn(t),isInfix:!1,operand:e.expression,replace:t=>({...e,expression:t})}},ea=(e,t)=>e.high<t.low,ta=e=>{let t=jn(e.operator),[n,r]=e.args,i=Zi(e),a=t=>{let n=e.location.range,i=Xi(t);return{...e,args:[t,r],location:n&&i?{...e.location,range:{...n,start:i}}:e.location}},o=(e,n)=>{let r=n?$i(e):void 0;if(!r)return{kind:`Reduced`,isFinal:!1};let s=o(r.operand,Yi(Zi(r.operand),Zi(e)));return s.kind===`Attached`?{kind:`Attached`,expression:Qi(r.replace(s.expression),i)}:!s.isFinal&&(ea(t,r.operator)||r.isInfix&&t.fixity===`InfixLeft`&&r.operator.fixity===`InfixLeft`&&!ea(r.operator,t))?{kind:`Reduced`,isFinal:!ea(t,r.operator)}:{kind:`Attached`,expression:Qi(r.replace(a(r.operand)),i)}},s=o(n,Yi(Xi(n),Xi(e)));return s.kind===`Attached`?s.expression:e},na="use instead the class`E_visit.iter_concrete`",ra=(e,t,n,r)=>{let i=t.split(`
21
- `),a=t=>({file:e,startLine:t.start.line,startColumn:t.start.column,endLine:t.end.line,endColumn:t.end.column+1}),o=e=>{let t={line:e.endLine-1,column:e.endColumn-1},n=e=>e===` `||e===`\r`;for(;t.line<i.length;){let e=i[t.line];for(;n(e[t.column]);)t.column++;if(t.column<e.length)break;t.line++,t.column=0}if(!(i[t.line]??``).startsWith(`(*{`,t.column))return e;for(let n=t.line;n<i.length;n++){let r=i[n].indexOf(`}*)`,n===t.line?t.column:0);if(r!==-1)return{...e,endLine:n+1,endColumn:r+4}}return e},s=(t,n)=>({file:e,startLine:n.line,startColumn:n.column,endLine:n.line,endColumn:n.column+t.length}),c=t=>t.range?a(t.range):{file:e,startLine:t.line,startColumn:t.column,endLine:t.line,endColumn:t.column+1},l=(e,t)=>{let n=Gi(e),r=Wi[n];return I(r?{kind:`Internal`,builtin:r}:{kind:`Opaque`,name:n},{location:t})},u=(e,t,n,r)=>{if(e.startsWith(`<`)){let t=I({kind:`Opaque`,name:e},{location:n});return I({kind:`Bang`,expression:t,selectors:[]},{location:n})}let i=Wi[e];if(i&&t.length===0)return I({kind:`Internal`,builtin:i},{location:n});let a=e.split(`!`);if(a.length===1){let r=I({kind:`Opaque`,name:e},{location:n});return t.length===0?r:I({kind:`Apply`,operator:r,args:t},{location:n})}let o=r??a.map((e,n)=>n===a.length-1?t.length:0),s=o.map((e,t)=>o.slice(0,t).reduce((e,t)=>e+t,0)),c=e=>t.slice(s[e],s[e]+o[e]),l=I({kind:`Opaque`,name:a[0]},{location:n});return I({kind:`Bang`,expression:o[0]===0?l:I({kind:`Apply`,operator:l,args:c(0)},{location:n}),selectors:a.slice(1).map((e,t)=>({kind:`Label`,label:Gi(e),args:c(t+1)}))},{location:n})},d=(e,t)=>e.map((n,r)=>{if(n.pattern.kind===`Tuple`)throw new j(`Unexpected tuple declaration`,{failure:na});let i=r>0&&e[r-1].set===n.set;return{name:n.pattern.name,level:`Constant`,domain:i?{kind:`Ditto`}:{kind:`Domain`,expression:h(n.set,t)}}}),f=(e,t)=>e.map((n,r)=>{let i=h(n.set,t);if(n.pattern.kind===`Tuple`)return{kind:`Tuple`,names:n.pattern.names,domain:i};let a=r>0&&e[r-1].set===n.set;return{kind:`Name`,name:n.pattern.name,domain:a?{kind:`Ditto`}:{kind:`Domain`,expression:i}}}),p=(e,t)=>{if(!r)throw new j(`Unexpected tuple declaration`,{failure:na});return I(e(),{location:t})},m=e=>e.some(e=>e.pattern.kind===`Tuple`),h=(e,t)=>{let n=c(e.location),r=e=>h(e,t),i=(e,t)=>e.length===2?qi(e[0].location,e[1].location):e.length!==1||!e[0].location?n:t===`Prefix`?qi({...n,endLine:n.startLine,endColumn:n.startColumn+1},e[0].location):t===`Postfix`?qi({...n,startLine:n.endLine,startColumn:n.endColumn-1},e[0].location):n,a=(e,t)=>I({kind:`Apply`,operator:{kind:`Internal`,builtin:e},args:[t]},{location:i([t],`Prefix`)});switch(e.kind){case`Number`:return I({kind:`Num`,integer:e.text??String(e.value),fraction:``},{location:n});case`Decimal`:{let[t,r]=e.text.split(`.`);return I({kind:`Num`,integer:t,fraction:r},{location:n})}case`String`:return I({kind:`String`,value:e.value},{location:n});case`Identifier`:return u(e.name,[],n);case`Apply`:{if(e.args.length===2){let t=ta(e);if(t!==e)return r(t)}let t=e.args.map(r),a=jn(e.operator);return a.fixity===`Nonfix`?u(e.operator,t,n,e.argumentCounts):I({kind:`Apply`,operator:l(e.operator,void 0),args:t},{location:i(t,a.fixity)})}case`OperatorReference`:return l(e.operator,n);case`Lambda`:return I({kind:`Lambda`,params:e.params.map(e=>({name:e,shape:0})),body:r(e.body)},{location:n});case`And`:case`Or`:{let t=e.operands.map(r);if(e.isBulleted)return I({kind:`List`,bullet:e.kind,items:t},{location:n});let i=e.kind===`And`?`Conj`:`Disj`;return t.reduce((e,t)=>I({kind:`Apply`,operator:{kind:`Internal`,builtin:i},args:[e,t]},{location:qi(e.location,t.location)}))}case`Prime`:{let t=r(e.expression);return I({kind:`Apply`,operator:{kind:`Internal`,builtin:`Prime`},args:[t]},{location:i([t],`Postfix`)})}case`Unchanged`:return a(`UNCHANGED`,r(e.expression));case`Enabled`:return a(`ENABLED`,r(e.expression));case`If`:return I({kind:`If`,condition:r(e.condition),consequent:r(e.consequent),alternative:r(e.alternative)},{location:n});case`Case`:return I({kind:`Case`,arms:e.arms.map(e=>({condition:r(e.condition),body:r(e.body)})),other:e.other&&r(e.other)},{location:n});case`Let`:return I({kind:`Let`,definitions:[...e.definitions,...e.instances??[]].sort((e,t)=>e.location.line-t.location.line||e.location.column-t.location.column).map(e=>_(e,t)),body:r(e.body)},{location:n});case`Forall`:case`Exists`:if(m(e.bounds)){let i=f(e.bounds,t),a=r(e.body);return p(()=>Li(e.kind,i,a),n)}return I({kind:`Quant`,quantifier:e.kind,bounds:d(e.bounds,t),body:r(e.body)},{location:n});case`UnboundedQuantifier`:{let t=r(e.body),i=e.quantifier;return e.isTemporal?I({kind:`Tquant`,quantifier:i,names:e.names,body:t},{location:n}):I({kind:`Quant`,quantifier:i,bounds:Mi(e.names),body:t},{location:n})}case`Choose`:if(e.pattern.kind===`Tuple`){let t=e.pattern.names,i=e.set&&r(e.set),a=r(e.body);return p(()=>zi(t,i,a),n)}return I({kind:`Choose`,name:e.pattern.name,domain:e.set&&r(e.set),body:r(e.body)},{location:n});case`SetEnumeration`:return I({kind:`SetEnum`,elements:e.elements.map(r)},{location:n});case`SetFilter`:if(e.bound.pattern.kind===`Tuple`){let t=e.bound.pattern.names,i=r(e.bound.set),a=r(e.predicate);return p(()=>Bi(t,i,a),n)}return I({kind:`SetSt`,name:e.bound.pattern.name,domain:r(e.bound.set),body:r(e.predicate)},{location:n});case`SetMap`:if(m(e.bounds)){let i=r(e.expression),a=f(e.bounds,t);return p(()=>Hi(i,a),n)}return I({kind:`SetOf`,element:r(e.expression),bounds:d(e.bounds,t)},{location:n});case`Tuple`:return I({kind:`Tuple`,elements:e.elements.map(r)},{location:{...n,startLine:n.endLine,startColumn:n.endColumn-2}});case`FunctionConstruction`:if(m(e.bounds)){let i=f(e.bounds,t),a=r(e.body);return p(()=>Ui(i,a),n)}return I({kind:`Fcn`,bounds:d(e.bounds,t),body:r(e.body)},{location:n});case`FunctionSet`:return I({kind:`Arrow`,domain:r(e.domain),range:r(e.range)},{location:n});case`Record`:case`RecordSet`:return I({kind:e.kind===`Record`?`Record`:`Rect`,fields:e.fields.map(e=>({name:e.name,value:r(e.value)}))},{location:n});case`Except`:return I({kind:`Except`,function:r(e.function),specs:e.updates.map(e=>({trail:e.path.map(e=>e.kind===`Field`?{kind:`Dot`,field:e.name}:{kind:`Apply`,expression:e.args.length===1?r(e.args[0]):{kind:`Tuple`,elements:e.args.map(r)}}),value:h(e.value,!0)}))},{location:n});case`ExceptAt`:return I({kind:`At`,isExcept:t},{location:n});case`Bracket`:throw new j(`Unexpected [ without a function or subscript`);case`FunctionApplication`:return I({kind:`FcnApp`,function:r(e.function),args:e.args.map(r)},{location:n});case`FieldAccess`:return I({kind:`Dot`,expression:r(e.record),field:e.field},{location:n});case`Product`:return I({kind:`Product`,factors:e.factors.map(r)},{location:n});case`Always`:case`Eventually`:{let t=e.expression;return e.kind===`Always`&&t.kind===`BoxAction`?I({kind:`Tsub`,modal:`Box`,action:r(t.action),subscript:r(t.subscript)},{location:n}):e.kind===`Eventually`&&t.kind===`AngleAction`?I({kind:`Tsub`,modal:`Dia`,action:r(t.action),subscript:r(t.subscript)},{location:n}):a(e.kind===`Always`?`BoxTrue`:`Diamond`,r(t))}case`BoxAction`:case`AngleAction`:return I({kind:`Sub`,modal:e.kind===`BoxAction`?`Box`:`Dia`,action:r(e.action),subscript:r(e.subscript)},{location:n});case`WeakFairness`:case`StrongFairness`:return I({kind:`Fair`,fairness:e.kind===`WeakFairness`?`Weak`:`Strong`,subscript:r(e.subscript),action:r(e.action)},{location:n});case`Label`:return I({kind:`Parens`,expression:r(e.body),form:{kind:`Nlabel`,label:e.name,names:e.params}},{location:n});case`Subexpression`:{let[t,...i]=e.selectors;if(t.kind!==`Name`)throw new j(`Unexpected subexpression reference`);let a=I({kind:`Opaque`,name:t.name},{location:n}),o=t.args.length===0?a:I({kind:`Apply`,operator:a,args:t.args.map(r)},{location:n});return I({kind:`Bang`,expression:o,selectors:i.map(e=>{switch(e.kind){case`Name`:return{kind:`Label`,label:Gi(e.name),args:e.args.map(r)};case`Operand`:return e.operand===`<<`?{kind:`Left`}:e.operand===`>>`?{kind:`Right`}:{kind:`Number`,value:e.operand};case`Bound`:return{kind:`Instance`,args:e.args.map(r)};case`At`:return{kind:`At`};case`Colon`:return{kind:`Down`}}})},{location:n})}}},g=e=>({location:a(e.definitionRange??e.instanceRange),args:e.params.map(e=>e.name),module:e.module,substitutions:e.substitutions.map(e=>({name:Gi(e.name),expression:h(e.expression,!1)}))}),_=(e,t=!1)=>{let n=c(e.location);if(e.kind===`Instance`){if(e.name===void 0)throw new j(`Unexpected keyword INSTANCE`);return{kind:`Instance`,name:e.name,instance:g(e),location:n}}let r=Gi(e.name,e.kind===`Operator`&&e.params.length===1&&e.name===`-`),i=h(e.body,t);if(e.kind===`Function`&&m(e.bounds)){let a=f(e.bounds,t);return{kind:`Operator`,name:r,body:p(()=>Ui(a,i),n),location:n}}if(e.kind===`Function`){let a=d(e.bounds,t);return{kind:`Operator`,name:r,body:I({kind:`Fcn`,bounds:a,body:i},{location:n}),location:n}}return e.params.length===0?{kind:`Operator`,name:r,body:i,location:n}:{kind:`Operator`,name:r,body:I({kind:`Lambda`,params:e.params.map(e=>({name:Gi(e.name),shape:e.arity,...e.location&&{location:s(e.name,e.location)}})),body:i},{location:n}),location:n}},v=e=>{let t=c(e.location);return e.level===`Variable`?{kind:`Flex`,name:e.name,location:t}:{kind:`Fresh`,name:e.name,shape:e.arity,level:e.level,domain:e.set&&h(e.set,!1),domainVisibility:`Visible`,location:t}},y=e=>e.kind===`AssumeProve`?{context:e.assumptions.map(e=>{if(e.kind===`NewSymbol`)return v(e);if(e.kind===`AssumeProve`){let t=c(e.location);return{kind:`Fact`,expression:I({kind:`Sequent`,sequent:y(e)},{location:t}),visibility:`Visible`,location:t}}let t=b(e);return{kind:`Fact`,expression:t,visibility:`Visible`,location:t.location}}),active:h(e.conclusion,!1)}:{context:[],active:h(e,!1)},b=e=>{if(e.kind!==`Label`||e.params.length>0)return h(e,!1);let t=c(e.location);return I({kind:`Parens`,expression:h(e.body,!1),form:{kind:`Xlabel`,label:e.name,indices:[]}},{location:t})},x=e=>{if(e.kind===`ModuleFact`)throw new ce(`MODULE facts in proof obligations are not supported`);let t=h(e,!1);return t.kind===`Bang`&&t.selectors.length===0?t.expression:t},S=e=>{let t=c(e.location);if(e.kind===`ModuleFact`)return{kind:`Dvar`,name:e.name,location:t};if(e.kind===`Identifier`)return{kind:`Dvar`,name:Gi(e.name),location:t};if(e.kind===`OperatorReference`)return{kind:`Dvar`,name:Gi(e.operator),location:t};throw new ce(`This DEF clause in proof obligations is not supported`)},ee=e=>({facts:e.facts.map(x),defs:e.defs.map(S)}),C=(e,t)=>{let r=e?e[2]:``;return r===``?{kind:`Unnamed`,level:t,id:Kt(n)}:{kind:`Named`,level:t,label:r,isAnonymous:!1}},w=(e,t,n)=>{if(!e)return{kind:`Omitted`,omission:`Implicit`,location:n};switch(e.kind){case`Obvious`:return{kind:`Obvious`,location:o(a(e.keyword))};case`Omitted`:return{kind:`Omitted`,omission:`Explicit`,location:a(e.keyword)};case`By`:return{kind:`By`,usable:ee(e),isOnly:e.isOnly,location:a(e.keyword),step:{kind:`Unnamed`,level:t,id:0}};case`Steps`:{let n=e.steps.map(e=>Ki.exec(e.token)),r=n[0],i=r&&r[1]!==`*`&&r[1]!==`+`?Number(r[1]):t,o=e.steps.slice(0,-1).map((e,t)=>E(e,C(n[t],i),i)),s=e.steps[e.steps.length-1],c=C(n[n.length-1],i),l=a(s.head),u=w(s.proof,i+1,l),d={proof:u,location:qi(l,u.location),step:c};return{kind:`Steps`,steps:o,qed:d,location:o.reduce((e,t)=>qi(e,t.location),d.location),step:d.step}}}},T=e=>qi(a(e.keyword),e.defs.length>0?c(e.defs[e.defs.length-1].location):void 0),E=(e,t,n)=>{let r=a(e.head),i=e.body,o=i=>{let a=w(e.proof,n+1,r);return{...i(a),location:qi(r,a.location),step:t}},s=e=>({...e,location:r,step:t});switch(i.kind){case`Use`:case`Hide`:{let n=qi(a({...e.head,end:e.head.start}),T(i)),r=ee(i);return i.kind===`Use`?{kind:`Use`,usable:r,isOnly:i.isOnly,location:n,step:t}:{kind:`Hide`,usable:r,location:n,step:t}}case`Instance`:throw new j(`Unexpected keyword INSTANCE`);case`Define`:return s({kind:`Define`,definitions:i.definitions.map(e=>_(e))});case`Have`:return s({kind:`Have`,expression:h(i.expression,!1)});case`Take`:return s({kind:`Take`,bounds:i.names.length>0?Mi(i.names):d(i.bounds,!1)});case`Witness`:return s({kind:`Witness`,expressions:i.expressions.map(e=>h(e,!1))});case`Pick`:{let e=i.names.length>0?Mi(i.names):d(i.bounds,!1),t=h(i.body,!1);return o(n=>({kind:`Pick`,bounds:e,expression:t,proof:n}))}case`Case`:{let e=h(i.expression,!1);return o(t=>({kind:`Pcase`,expression:e,proof:t}))}case`Assert`:{let e=y(i.statement);return o(t=>i.isSuffices?{kind:`Suffices`,sequent:e,proof:t}:{kind:`Assert`,sequent:e,proof:t})}case`Qed`:throw new ce(`QED in the middle of a proof`)}},te=e=>({name:e.name,extendees:e.extends,extendeeLocations:e.extendsRanges.map(a),isImportant:!1,location:c(e.location),body:e.units.map(e=>{switch(e.kind){case`Constants`:case`Recursive`:return{kind:e.kind===`Constants`?`Constants`:`Recursives`,declarations:e.declarations.map(e=>({name:Gi(e.name),shape:e.arity})),location:c(e.declarations[0].location)};case`Variables`:return{kind:`Variables`,names:e.declarations.map(e=>e.name),location:c(e.declarations[0].location)};case`Definition`:return{kind:`Definition`,definition:_(e.definition),whereDefined:`User`,visibility:`Hidden`,isLocal:e.definition.isLocal,location:c(e.definition.location)};case`Instance`:{let t=e.instance,n=c(t.location);return t.name===void 0?{kind:`Anoninst`,instance:g(t),isLocal:t.isLocal,location:n}:{kind:`Definition`,definition:_(t),whereDefined:`User`,visibility:`Hidden`,isLocal:t.isLocal,location:a(t.instanceRange)}}case`Assumption`:return{kind:`Axiom`,name:e.assumption.name,expression:h(e.assumption.expression,!1),location:c(e.assumption.location)};case`Theorem`:{let t=e.theorem,n=c(t.location),r=o(n);return{kind:`Theorem`,name:t.name,sequent:y(t.statement),axiomCount:0,proof:w(t.proof,0,{...r,startLine:r.endLine,startColumn:r.endColumn}),location:n}}case`Use`:return{kind:`Mutate`,mode:e.use.kind,isSuppressed:!1,usable:ee(e.use),location:T(e.use)};case`Module`:return{kind:`Submod`,module:{...te(e.module),isImportant:!0}}}})});return{convertModule:te}},ia={start:0,end:1/0},aa=/-{4,} *MODULE/,oa=`Unexpected EOF`,sa=e=>e?`${e.startLine}:${e.startColumn}:${e.endLine}:${e.endColumn}`:``,ca=e=>{let t=le(e),n=e.split(`
22
- `),r=t.at(-1)?.line??n.length,i=n.slice(0,r-1).reduce((e,t)=>e+t.length+1,0)+n[r-1].indexOf(`====`),a=e.indexOf(` `,e.search(aa));if(a===-1||a>=i)return;let o=e.slice(0,a).split(`
23
- `).length,s=a-e.lastIndexOf(`
24
- `,a-1),c=t.findLast(e=>e.kind!==`End`&&(e.line<o||e.line===o&&e.column<s));return{offset:a,line:o,column:s,end:{reason:oa,line:c?.line??o,column:c?c.endColumn+1:s,isEnd:!0}}},la=e=>{try{return e()}catch(e){if(!(e instanceof w)||!e.failure)throw e;return e.failure}},ua=e=>typeof e==`object`&&!!e&&`reason`in e,da=e=>{let t=la(()=>ca(e));if(ua(t))return[t];let n=la(()=>re(t?e.slice(0,t.offset):e));return t&&(!ua(n)||n.isEnd)?[{reason:`Unexpected TAB character. TLAPS does not handle TAB characters in source files.`,line:t.line,column:t.column,isEnd:!1},ua(n)&&n.reason===oa?n:t.end]:ua(n)?[n]:n},fa=(e,t,n,r,i)=>{if(!aa.test(e.source))throw new j(`No tokens in file`);let a=da(e.source);if(Array.isArray(a)){a.forEach(t=>{let n=`File ${JSON.stringify(e.file)}, line ${t.line}, character ${t.column}\n${t.reason}`;r({text:n,channel:`stderr`}),r({text:`${n}\n`,channel:`toolboxOnly`})});let t=`Could not parse ${JSON.stringify(e.file)} successfully.`;throw r({text:`${i}Error: ${t}`,channel:`stderr`}),new j(t,{failure:`Module.Parser.parse_file`})}let o=ra(e.file,e.source,t,n).convertModule(a),s=e.file.slice(e.file.lastIndexOf(`/`)+1),c=s.replace(/\.tla$/,``);return o.name===c?o:(r({text:`${We(o.location)}Warning: module name ${JSON.stringify(o.name)} does not match file name ${JSON.stringify(s)}.`,channel:`toolbox`}),{...o,name:c})},pa=e=>{let t=new Map([...e].map(([e,t])=>[e,li(t).dependencies])),n=/* @__PURE__ */ new Set,r=[],i=a=>{if(n.has(a))return;n.add(a);let o=e.get(a);if(!o)throw new j(`Module "${a}" not found`);(t.get(a)??[]).forEach(i),r.push(o)};return[...e.keys()].sort(di).forEach(i),r},ma=(e,t,n)=>t.length===0?[]:[` ${e}_proofs_count = ${t.length}`,...t.map((t,r)=>` ${e}_proof_${n+r+1} at ${Ve(t)}`)],ha=(e,t,n)=>{let r=e.location;return[` ---- incomplete proof of theorem at ${r?Ve({...r,endLine:r.startLine,endColumn:r.startColumn}):`<unknown location>`} ----`,...ma(`missing`,e.absent,t),...ma(`omitted`,e.omitted,n),` ====`]},ga=e=>{let t=e.summary,n=t.theorems.reduce((e,t)=>t.absent.length+t.omitted.length===0?e:{lines:[...e.lines,...ha(t,e.missing,e.omitted)],missing:e.missing+t.absent.length,omitted:e.omitted+t.omitted.length},{lines:[],missing:0,omitted:0});return[`---- summary of module ${JSON.stringify(e.name)} ----`,` obligations_count = ${t.total}`,...t.absent.length>0?[` missing_proofs_count = ${t.absent.length}`]:[],...t.omitted.length>0?[` omitted_proofs_count = ${t.omitted.length}`]:[],...n.lines,`====`].join(`
25
- `)},_a=(e,t,n={})=>{let r=n.lines??ia,i=n.onWarning??(()=>{}),a={value:0},o=new Map(ri);e.forEach(e=>{let t={...fa(e,a,!0,i,`File "<unknown>":
26
- `),isImportant:!0};o.set(t.name,t)});let s=[...o.values()].sort((e,t)=>di(e.name,t.name)),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set;for(let e=0;e<s.length;e++){let n=li(s[e]);n.submodules.forEach((e,t)=>{l.add(t),o.has(t)||o.set(t,e)});for(let e of n.dependencies){if(o.has(e)&&!ri.has(e))continue;let r=t(e);if(!r){!o.has(e)&&!c.has(e)&&c.set(e,n.locations.get(e));continue}let l=fa(r,a,!1,i,Ue(n.locations.get(e)));o.set(e,l),s.push(l)}}let u=[...c.keys()].filter(e=>!l.has(e)).sort(di);if(u.forEach(e=>i(P(c.get(e),`Unknown module ${JSON.stringify(e)}`))),u.length>0)throw new j(`Unknown module ${JSON.stringify(u[0])}`,{failure:`Module.Parser.load_module`});let d={anonymizer:Xt(a,(e,t)=>Ei(d,e,t),i),generator:Sr(a,new Set(e.map(e=>e.file)),r,i),salts:{value:0},latestModules:/* @__PURE__ */ new Map,onWarning:i},f=pa(o).map(e=>e.isStandard?e:ci(o,e,/* @__PURE__ */ new Set)),p=new Map(f.map(e=>[e.name,e]));return f.flatMap(e=>{if(e.isStandard)return[];let t=Di(d,p,void 0,e);if(!e.isImportant)return[];let n=Oi(d,[],t),i=n.obligations.flatMap((e,t)=>{let n=e.location;if(e.kind.kind===`Omitted`||n&&(n.startLine<r.start||n.endLine>r.end))return[];let i=e.kind.kind===`Error`?e.kind.message:`${Zn(e.sequent)}\n`;return[{id:t+1,location:sa(n),text:i}]});return[{name:e.name,location:e.location,obligations:i,summary:n.summary}]})},va={builtin:1,number:2,string:3,ident:4,added:5},ya=()=>({labelFlag:!1,reportLabelsFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,fairAlgorithm:!1,checkTermination:!1,noOld:!1,nocfg:!1,noDoneDisjunct:!1,specOption:!1,myspecOption:!1,specFile:``,optionsInFile:!1,inputVersionNumber:1903}),ba=e=>{let t={result:0,digitsAfterDecimal:0,isAfterDecimal:!1};for(let n of e)if(n===`.`)t.isAfterDecimal=!0;else if(n<`0`||n>`9`||(t.result=10*t.result+Number(n),t.isAfterDecimal&&(t.digitsAfterDecimal+=1),t.digitsAfterDecimal>3))return-1;return t.result*10**Math.max(0,3-t.digitsAfterDecimal)},xa=[`unfair`,`wf`,`sf`],W=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),Sa=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,Ca=e=>{if(e.kind!==`LabeledStmt`)throw new ne(`ClassCastException: ${e.kind}`);return e},wa=(e,t)=>{if(t<0||t>=e.length)throw new ne(`ArrayIndexOutOfBoundsException: ${t}`);return e[t]},Ta=(e,t,n)=>({string:e,column:t,type:n}),Ea=e=>e.type===va.string?e.string.length+2:e.string.length,Da=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),Oa=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},ka=e=>{let t=Da(e);return Oa(t),t},Aa=e=>{let t=e.anchorTokens,n=e.anchorTokCol;if(t===void 0||n===void 0)throw new ne(`NullPointerException: TLAExpr.renormalize`);e.tokens.forEach((e,r)=>{let i=t[r];if(i===void 0)return;let a=i.column-n[r];if(n[r]=i.column,a<0)throw new k(`TLAExpr.renormalize() found anchor has moved to left.`);e.forEach(e=>{e.column+=a})})},ja=e=>ka(e.tokens.map(e=>e.map(e=>({...e})))),Ma=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+Ea(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,Aa(e)},Na=e=>e.tokens.length===1&&e.tokens[0].length===1,Pa=(e,t)=>wa(wa(e.tokens,t.line),t.item),Fa=(e,t,n)=>{if(e.tokens.length<=t.line)throw new oe(`TLAExpr.StepCoord called with line too big`);if(e.tokens[t.line].length<=t.item)throw new oe(`TLAExpr.StepCoord called with col too big`);let r={line:t.line,item:t.item};for(let t=0;t<n;t++)if(r.item+=1,e.tokens[r.line].length===r.item){for(r.item=0,r.line+=1;r.line<e.tokens.length&&e.tokens[r.line].length===0;)r.line+=1;if(r.line===e.tokens.length)return}return r},Ia=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=Pa(e,r),i=n.type===va.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?Fa(e,r,2):void 0,o=a===void 0?void 0:Pa(e,a),s=o!==void 0&&o.type!==va.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=Fa(e,r,c)}},La=(e,t,n,r)=>{let i=Pa(e,n);if(Na(e)){let n=ja(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+Ea(i)):0,s=a.splice(n.item+1),c={lineIndex:n.line,indent:+!!r+i.column,isInserting:!r},l=()=>e.tokens[c.lineIndex];if(Na(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=va.builtin);let n=ja(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=c.indent,c.isInserting?(i.string=e.string,i.type=e.type,c.isInserting=!1):l().push(e)}),r+1>=n.tokens.length)return;c.indent=0,c.lineIndex+=1;let a=c.lineIndex;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=l()[l().length-1];l().push(Ta(`)`,e.column+Ea(e),va.builtin))}}let u=l(),d={line:c.lineIndex,item:u.length-1};if(s.length>0){let e=u[u.length-1],t=e.column+Ea(e)+o-s[0].column;s.forEach(e=>{e.column+=t,u.push(e)})}return Aa(e),Fa(e,d,1)},Ra=(e,t,n,r=!0)=>{let i=n.map(t=>Ia(e,t,{line:0,item:0}));for(;;){let a=i.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(a===void 0)return;let o=Fa(e,a.position,1),s=La(e,t[a.index],a.position,r);i[a.index]=s===void 0?void 0:Ia(e,n[a.index],s),i.forEach((e,t)=>{if(t!==a.index&&e!==void 0&&s!==void 0){if(o===void 0)throw new ne(`NullPointerException: TLAExpr.substituteForAll`);e.line===a.position.line&&(e.item+=s.item-o.item),e.line+=s.line-o.line}})}},za=(e,t,n)=>{let r=ja(e);return Ra(r,t,n),r},Ba=(e,t,n)=>e.map(e=>za(e,t,n)),Va=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===va.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
27
- `)} >>`},Ha=(e,t,n)=>{let r=e=>Va(e,n),i=[0],a={value:0},o=e=>(i[a.value+1]=i[a.value]+e.length,a.value+=1,e),s=()=>(--a.value,``),c=()=>`\n${` `.repeat(i[a.value])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${xa[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},Ua=(e,t,n,r,i)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).reduce((e,t)=>t===` `?(Math.floor(e/8)+1)*8:e+1,0):0,lastLine:r,lastColumn:i,isTabToSpaces:!1}),Wa=e=>{if(e.currentLine===void 0)return` `;if(e.isTabToSpaces)return e.vcolumn+=1,e.vcolumn%8==0&&(e.isTabToSpaces=!1),` `;if(e.line>e.lastLine||e.line===e.lastLine&&e.column>=e.lastColumn)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
28
- `;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t===` `?(e.vcolumn%8!=0&&(e.isTabToSpaces=!0),` `):t},Ga=e=>{if(e.column>0){--e.column,--e.vcolumn;return}if(e.line===0)throw new oe(`PcalCharReader.backspace trying to move past beginning of reader`);--e.line;let t=Array.from(e.lines[e.line]);for(e.currentLine=t,e.column=0,e.vcolumn=0;e.column<t.length-1;)Wa(e)},Ka=e=>{for(;;){let t=Wa(e);if(t===` `)return` `;if(t!==` `&&t!==`
29
- `)break}return Ga(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},qa=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),Ja=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),Ya=/* @__PURE__ */ new Set([...qa,...Ja,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),Xa=e=>/^[A-Za-z_]$/.test(e),Za=e=>/^[0-9]$/.test(e),Qa=e=>e===` `||e===`\f`||e===`\r`,$a=new Set([...Ya].filter(e=>!Xa(e[0])&&!(e[0]===`\\`&&Xa(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),eo=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),to=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),no={...va,dashes:6,endModule:7},ro=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),io=(e,t,n,r)=>{let i={lines:[],line:[],token:``,state:`start`,column:t.vcolumn,nextColumn:t.vcolumn,nextChar:Wa(t),parenDepth:0,isInQuantifier:!1,isExprEnd:!1,previousToken:` `},a=()=>{i.nextColumn=t.vcolumn,i.nextChar=Wa(t)},o=()=>{i.token+=i.nextChar,a()},s=()=>{i.state=`start`,i.column=i.nextColumn},c=()=>{i.lines.push(i.line),i.line=[],i.column=0},l=e=>{throw new k(`${e} \`${i.token}' found at\n line ${t.line+1}, column ${i.column+1}`)},u=()=>{i.isExprEnd=!0,e.delimiter=i.token,e.delimiterCol=i.column,e.delimiterLine=t.line-+(i.nextChar===`
30
- `)},d=e=>{if(!n){u(),i.token=``;return}e>no.ident&&l(`Illegal token in an expression`);let t=i.token;e!==no.string&&(to.has(t)&&!(e===no.ident&&[`.`,`[`,`,`].includes(i.previousToken))||(t===`,`&&!i.isInQuantifier&&!r||t===`)`||t===`}`)&&i.parenDepth===0)?(i.parenDepth!==0&&l(`Expression with an unmatched (, [, {, or << followed by`),i.isInQuantifier&&l("Expression with \\A or \\E but no following `:` followed by"),u(),i.line.length>0&&c()):(e===no.builtin&&qa.has(t)&&(i.parenDepth+=1),e===no.builtin&&Ja.has(t)&&(--i.parenDepth,i.parenDepth<0&&l(`Extra (unmatching)`)),i.previousToken=e===no.string?` `:t,[`\\A`,`∀`,`\\E`,`∃`].includes(t)&&i.parenDepth===0&&(i.isInQuantifier=!0),i.isInQuantifier&&t===`:`&&i.parenDepth===0&&(i.isInQuantifier=!1),(t!==``||e===no.string)&&i.line.push(Ta(t,i.column,e)),i.token=``)},f=e=>{d(e),s()},p=e=>{o(),i.state=e},m=e=>{a(),i.state=e},h=n=>{switch(i.state){case`start`:if(Qa(n))return a(),s();if(Xa(n))return p(`id`);if(n===`ℕ`||n===`ℤ`||n===`ℝ`)return o(),f(no.ident);if(Za(n))return p(`numOrId`);if(n===`\\`)return p(`bs`);if(n===`-`)return p(`dash1`);if(n===`=`)return p(`eq1`);if(n===`(`)return m(`leftParen`);if(n===`"`)return m(`string`);if(n===`
31
- `)return a(),c(),s();if($a.has(n))return p(`builtIn`);if(n===` `){i.state=`done`;return}return o(),l(`Illegal lexeme`);case`id`:return i.token===`WF_`||i.token===`SF_`?f(no.builtin):Xa(n)||Za(n)?o():f(Ya.has(i.token)?no.builtin:no.ident);case`numOrId`:return Za(n)?o():Xa(n)?p(`id`):f(no.number);case`bs`:if([`b`,`B`,`o`,`O`,`h`,`H`].includes(n))return p(`numOrBi`);if(Xa(n)){i.state=`bsBuiltIn`;return}if(n===`*`){a(),i.token=``,i.state=`lineComment`;return}i.state=`builtIn`;return;case`numOrBi`:i.state=Za(n)?`num`:`bsBuiltIn`;return;case`num`:if(Za(n))return o();if(!Xa(n))return f(no.number);o(),i.token.startsWith(`\\`)&&l(`Illegal lexeme`),i.state=`id`;return;case`bsBuiltIn`:return Xa(n)&&n!==`_`?o():Ya.has(i.token)?f(no.builtin):l(`Illegal lexeme `);case`builtIn`:if($a.has(i.token+n))return o();if(!Ya.has(i.token)){for(Ga(t);!Ya.has(i.token);)Ga(t),i.token.length===0&&l(`Illegal lexeme`),i.token=Array.from(i.token).slice(0,-1).join(``);a()}return f(no.builtin);case`dash1`:case`dash2`:if(n===`-`)return p(i.state===`dash1`?`dash2`:`dash3`);i.state=`builtIn`;return;case`dash3`:return n!==`-`&&l(`Illegal lexeme`),p(`dashes`);case`dashes`:return n===`-`?o():f(no.dashes);case`eq1`:case`eq2`:if(n===`=`)return p(i.state===`eq1`?`eq2`:`eq3`);i.state=`builtIn`;return;case`eq3`:return n!==`=`&&l(`Illegal lexeme`),p(`eqs`);case`eqs`:return n===`=`?o():f(no.endModule);case`leftParen`:if(n===`*`)return e.commentDepth=1,m(`comment`);i.token=`(`,i.state=`builtIn`;return;case`string`:if(n===`\\`)return p(`escString`);if(n===`"`)return a(),f(no.string);o(),eo.has(n)||l(`Illegal character in string`);return;case`escString`:o(),[`"`,`\\`,`t`,`n`,`f`,`r`].includes(n)||l(`Illegal character following \\ in string`),i.state=`string`;return;case`lineComment`:return n===`(`?m(`lineComParen`):n===`*`&&e.commentDepth>0?m(`lineComStar`):n===`
32
- `||n===` `?(i.token=``,e.commentDepth=0,s()):e.commentDepth===0?o():a();case`lineComParen`:if(n===`*`)return e.commentDepth+=1,m(`lineComment`);e.commentDepth===0&&(i.token+=`(`),i.state=`lineComment`;return;case`lineComStar`:if(n===`)`){if(--e.commentDepth,e.commentDepth<0)throw new oe(`Failure of assertion: case LINE_COM_STAR`);return m(`lineComment`)}e.commentDepth===0&&(i.token+=`*`),i.state=`lineComment`;return;case`comment`:case`orComment`:{let t=i.state===`comment`;if(n===`*`)return m(t?`commentStar`:`orCommentStar`);if(n===`(`)return m(t?`commentParen`:`orCommentParen`);if(n===`
33
- `){i.token=``,a(),c(),i.state=`orComment`;return}if(n===` `)throw new k(t?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return e.commentDepth===1?o():a()}case`commentStar`:case`orCommentStar`:{let t=i.state===`commentStar`?`comment`:`orComment`;if(n!==`)`){e.commentDepth===1&&(i.token+=`*`),i.state=t;return}if(a(),--e.commentDepth,t===`orComment`&&e.commentDepth<0)throw new oe(`Assertion failure`);if(e.commentDepth!==0){i.state=t;return}return i.token=``,s()}case`commentParen`:case`orCommentParen`:{let t=i.state===`commentParen`?`comment`:`orComment`;if(n===`*`)return e.commentDepth+=1,m(t);e.commentDepth===1&&(i.token+=`(`),i.state=t;return}}};for(;i.state!==`done`&&!i.isExprEnd;)h(i.nextChar);return i.nextChar!==`
34
- `&&Ga(t),ka(i.lines)},ao=(e,t,n)=>io(e,t,!0,n),oo=(e,t)=>(io(e,t,!1,!1),e.delimiter),so=(e,t)=>({params:e,tokenizer:ro(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),co=()=>ka([[Ta(`defaultInitValue`,0,0)]]),lo=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],uo=(e,t)=>!t.some(t=>e.includes(t)),fo=(e,t)=>{t.splice(0,t.length,...e)},po=(e,t,n)=>{let r=e.params,i=e.lookahead,a=e.lastToken,o={lookaheadSize:0,addedLabels:[],addedLabelsLocs:[],nextLabelNum:1,allLabels:/* @__PURE__ */ new Set,hasLabel:!1,hasDefaultInitialization:!1,currentProcedure:void 0,procedures:[],pSyntax:!1,cSyntax:!1,plusLabels:[],minusLabels:[],proceduresCalled:[],gotoUsed:!1,gotoDoneUsed:!1,omitPC:r.inputVersionNumber>=1500,omitStutteringWhenDone:r.inputVersionNumber>=1500},s=e=>{throw new k(`${e}\n line ${a.line}, column ${a.column}`)},c=()=>{if(o.lookaheadSize===0)return Ka(t),a.column=t.vcolumn+1,a.line=t.line+1,a.text=oo(e.tokenizer,t),a.text;a.column=i.columns[0]+1,a.line=i.lines[0]+1;let n=i.tokens[0];for(let e=1;e<o.lookaheadSize;e++)i.tokens[e-1]=i.tokens[e],i.columns[e-1]=i.columns[e],i.lines[e-1]=i.lines[e];return--o.lookaheadSize,a.text=n,n},l=n=>{for(;o.lookaheadSize<n;){let n=o.lookaheadSize;if(Ka(t)===` `)throw new k(`Premature end of file, perhaps because of unclosed comment, near\n line ${i.lines[n]+1}, column ${i.columns[n]+1}`);i.columns[n]=t.vcolumn,i.lines[n]=t.line,i.tokens[n]=oo(e.tokenizer,t),o.lookaheadSize+=1}return i.tokens[n-1]},u=n=>{if(n<o.lookaheadSize)throw new oe(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
35
- it has already peeked at`);for(;n>o.lookaheadSize;)i.tokens[o.lookaheadSize]=oo(e.tokenizer,t),o.lookaheadSize+=1;return Ka(t)},d=(n=!1)=>{if(o.lookaheadSize!==0)throw new oe(`ParseAlgorithm: GetExpr called after lookahead`);let r=ao(e.tokenizer,t,n);return i.tokens[0]=e.tokenizer.delimiter,i.columns[0]=e.tokenizer.delimiterCol,i.lines[0]=e.tokenizer.delimiterLine,o.lookaheadSize=1,r},f=(e,t)=>{if(e===`;`){let e=l(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new k(`Missing \`;' before line ${i.lines[0]+1}, column ${i.columns[0]+1}`)}let n=c();n!==e&&n!==t&&s(`Expected "${e}" but found "${n}"`)},p=e=>{let t=c();t!==e&&s(`Expected "${e}" but found "${t}"`)},m=()=>{let e=c();return e===`=`?!0:e===`\\in`||e===`∈`?!1:s(`Expected "=" or "\\in" but found "${e}"`)},h=()=>f(l(1)===`,`?`,`:`;`),g=()=>f(o.pSyntax?`begin`:`{`),_=e=>{o.cSyntax?f(`}`):(f(`end`),f(e))},v=()=>{l(1)===`variables`?p(`variables`):f(`variable`)},y=()=>{let e={...W(),kind:`VarDecl`,var:c(),col:a.column,line:a.line,isEq:!0,val:co()};if(![`=`,`\\in`,`∈`].includes(l(1)))return o.hasDefaultInitialization=!0,e;if(e.isEq=m(),e.val=d(),e.val.tokens.length===0)throw new ne(`NullPointerException`);return e},b=()=>{v();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(l(1));)e.push(y()),h();return e},x=()=>{let e={...W(),kind:`PVarDecl`,var:c(),col:a.column,line:a.line,val:co()};if(l(1)!==`=`)return o.hasDefaultInitialization=!0,e;if(f(`=`),e.val=d(),e.val.tokens.length===0)throw new ne(`NullPointerException`);return e},S=()=>{v();let e=[];for(;l(1)!==`begin`&&l(1)!==`{`;)e.push(x()),h();return e},ee=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(l(1)))return!1;let e=Ka(t);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},C=()=>{if(!ee())return``;let t=c();e.isInMacro&&s(`A label may not appear in a macro.`),t===`Done`&&s("Cannot use `Done' as a label."),t===`Error`&&s("Cannot use `Error' as a label."),f(`:`),o.hasLabel=!0,o.allLabels.add(t);let n=l(1);return n!==`+`&&n!==`-`||(f(n),(n===`+`?o.plusLabels:o.minusLabels).push(t),o.omitPC=!1),t},w=()=>{let e=[],t=e=>o.pSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||o.cSyntax&&e===`}`;for(;!t(l(1));)e.push(...E());return o.cSyntax&&e.length===0&&s(`Empty statement list`),e},T=e=>{p(`{`);let t=w();if(f(`}`),f(`;`),e!==``){if(t[0].lbl!==``)throw new k(`Duplicate labeling of statement`,t[0]);t[0].lbl=e}return t},E=()=>{let e=C();if(o.cSyntax&&l(1)===`{`)return T(e);let t=te();return t.lbl=e,[t]},te=()=>{let e=l(1);if(e===`if`)return re(0);if(e===`either`)return ie();if(e===`with`)return ae(0);if(e===`when`||e===`await`){p(e);let t=a.column,n=a.line,r=d();if(r.tokens.length===0)throw new ne(`NullPointerException`);return f(`;`),{...W(),kind:`When`,col:t,line:n,exp:r}}if(e===`print`||e===`assert`){p(e);let t=a.column,n=a.line,r=d();return r.tokens.length===0&&s(`Empty expression in ${e} statement at `),f(`;`),{...W(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){p(`skip`);let e={...W(),kind:`Skip`,col:a.column,line:a.line};return f(`;`),e}if(e===`call`)return le();if(e===`return`){p(`return`);let e={...W(),kind:`Return`,col:a.column,line:a.line,from:o.currentProcedure};return f(`;`),e}if(e===`goto`){p(`goto`);let e=a.column,t=a.line,n=c();return o.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(o.gotoDoneUsed=!0),f(`;`),{...W(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?D():u(1)[0]===`(`?j():se()},D=()=>{p(`while`);let e=a.column,t=a.line;o.cSyntax&&f(`(`);let n=d();o.cSyntax&&f(`)`),n.tokens.length===0&&s(`Empty while test at `),o.pSyntax&&f(`do`);let r=o.pSyntax?w():E();return o.pSyntax&&(f(`end`),f(`while`),f(`;`)),r.length===0&&s(`Missing body of while statement at`),{...W(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},re=e=>{p(e===0?`if`:`elsif`);let t={...W(),kind:`LabelIf`,col:a.column,line:a.line,test:Da(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};o.cSyntax&&f(`(`),t.test=d(),o.cSyntax&&f(`)`),t.test.tokens.length===0&&s(`Empty if test at `),o.pSyntax&&f(`then`),t.unlabThen=o.pSyntax?w():E();let n=l(1);return n===`else`&&(p(`else`),t.unlabElse=o.pSyntax?w():E()),o.pSyntax&&n===`elsif`&&(t.unlabElse=[re(e+1)]),o.pSyntax&&![`else`,`elsif`,`end`].includes(n)&&s(`Expecting "else", "elsif", or "end"`),o.pSyntax&&e===0&&(f(`end`),f(`if`),f(`;`)),t.unlabElse.length===0&&wa(t.unlabThen,t.unlabThen.length-1),t},ie=()=>{p(`either`);let e={...W(),kind:`LabelEither`,col:a.column,line:a.line,clauses:[]};for(;;){let t={...W(),kind:`Clause`,unlabOr:o.pSyntax?w():E(),labOr:[]};if(t.unlabOr.length===0)throw new k("`either' statement with empty `or' clause",e);if(e.clauses.push(t),l(1)!==`or`)break;p(`or`)}if(o.pSyntax&&(p(`end`),f(`either`),f(`;`)),e.clauses.length===1)throw new k("`either' statement has no `or'",e);return e},ae=e=>{e===0&&(f(`with`),o.cSyntax&&f(`(`));let t={...W(),kind:`With`,col:a.column,line:a.line,var:c(),isEq:!0,exp:Da(),Do:[]};t.isEq=m(),t.exp=d(),(o.pSyntax||l(1)!==`)`)&&h(),t.exp.tokens.length===0&&s(`Empty with expression at `);let n=o.pSyntax&&l(1)===`do`,r=o.cSyntax&&l(1)===`)`;if(n&&f(`do`),r&&p(`)`),t.Do=n?w():r?E():[ae(e+1)],n&&(f(`end`),f(`with`),f(`;`)),t.Do.length===0)throw new k(`Missing body of with statement`,t);return t},O=()=>{let e=i.columns[0]+1,t=i.lines[0]+1,n={...W(),kind:`Lhs`,col:e,line:t,var:c(),sub:d()};f(`:=`,`≔`);let r=d();return r.tokens.length===0&&s(`Empty right-hand side of assignment at `),{...W(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},se=()=>{let e={...W(),kind:`Assign`,col:i.columns[0]+1,line:i.lines[0]+1,ass:[O()]};for(;l(1)===`||`||l(1)===`‖`;){c();try{e.ass.push(O())}catch(e){if(!(e instanceof k))throw e;s(`Bad assignment statement at `)}}return f(`;`),e},ce=()=>{let e=[];if(u(0)[0]!==`)`)for(;;){let t=d();if(e.push(t),t.tokens.length===0&&s(`Empty argument in call statement at `),l(1)===`)`)break;f(`,`)}return f(`)`),f(`;`),e},A=()=>{p(`call`);let e={...W(),kind:`Call`,col:a.column,line:a.line,returnTo:``,to:c(),args:[]};return f(`(`),e.args=ce(),o.proceduresCalled.includes(e.to)||o.proceduresCalled.push(e.to),e},le=()=>{let e=A();if(l(1)===`return`)return p(`return`),f(`;`),{...W(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:o.currentProcedure,args:e.args};if(l(1)!==`goto`)return e;p(`goto`);let t={...W(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:c(),args:e.args};return o.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(o.gotoDoneUsed=!0),f(`;`),t},j=()=>{let e={...W(),kind:`MacroCall`,name:c(),col:a.column,line:a.line,args:[]};return p(`(`),e.args=ce(),e},ue=t=>{e.isInMacro=!0,p(`macro`);let n={...W(),kind:`Macro`,col:a.column,line:a.line,name:c(),params:[],body:[]};for(f(`(`);l(1)!==`)`;)n.params.length>0&&f(`,`),n.params.push(c());return p(`)`),g(),n.body=w(),_(`macro`),l(1)===`;`&&c(),Se(n.body,t),e.isInMacro=!1,n},de=()=>{f(`procedure`);let e={...W(),kind:`Procedure`,col:a.column,line:a.line,name:c(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(o.currentProcedure=e.name,o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],f(`(`);l(1)!==`)`;)e.params.length>0&&f(`,`),e.params.push(x());return p(`)`),l(1)!==`begin`&&l(1)!==`{`&&(e.decls=S()),g(),e.body=w(),_(`procedure`),l(1)===`;`&&c(),o.currentProcedure=void 0,e.plusLabels=o.plusLabels,e.minusLabels=o.minusLabels,e.proceduresCalled=o.proceduresCalled,e},fe=()=>{f(`process`);let e=a.column,t=a.line;o.cSyntax&&f(`(`);let n=c(),r=m(),i=d();o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],o.cSyntax&&f(`)`),i.tokens.length===0&&s(`Empty process id at `);let u=l(1)===`begin`||l(1)===`{`?[]:b();g();let p=w();return _(`process`),l(1)===`;`&&c(),{...W(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:o.minusLabels,plusLabels:o.plusLabels,proceduresCalled:o.proceduresCalled,isEq:r,id:i,decls:u,body:p}},pe=()=>{let e=`${r.labelRoot}${o.nextLabelNum}`;return o.nextLabelNum+=1,o.allLabels.has(e)?pe():e},me=e=>{e.lbl===``&&(e.lbl=pe(),o.addedLabels.push(e.lbl),o.addedLabelsLocs.push(Sa(e)))},he=(e,t,n,r,i)=>{fo(r,i);let a={isNextLabeled:t,hasLabel:!1},s=e=>{me(e),a.hasLabel=!0,i.length=0};return e.forEach(e=>{if(e.lbl!==``&&(a.hasLabel=!0,i.length=0,n))throw new k("Label in `with' statement",e);if(a.isNextLabeled){if(n)throw new k("Statement follows `call' or `return' inside a `with' statement.",e);s(e),a.isNextLabeled=!1}switch(e.kind){case`LabelIf`:{let t=[],r=[],o=he(e.unlabThen,!1,n,i,t);a.isNextLabeled=he(e.unlabElse,!1,n,i,r)||o,fo(lo(t,r),i);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let r=[];a.isNextLabeled=he(e.unlabOr,!1,n,i,r)||a.isNextLabeled,fo(lo(r,t),t)}),fo(t,i);return}case`While`:if(n)throw new k("`while' inside a `with' statement",e);s(e),he(e.unlabDo,!1,!1,i,[]),a.isNextLabeled=!1;return;case`With`:{let t=[];a.isNextLabeled=he(e.Do,!1,!0,n?[...r]:[],t),fo(t,i),!n&&!uo(r,i)&&s(e);return}}let t=e.kind===`Call`||e.kind===`CallGoto`,c=e.kind===`Return`||e.kind===`CallReturn`,l=e.kind===`Assign`?lo([],e.ass.map(e=>e.lhs.var)):t||c?[`stack`,...c||e.to===o.currentProcedure?o.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(a.isNextLabeled=t||c||e.kind===`Goto`,uo(i,l))fo(lo(i,l),i);else{if(n)throw new k(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);s(e),fo(l,i)}}),a.hasLabel||a.isNextLabeled},ge=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return ge(n),{unlabeled:n,labeled:_e(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},_e=e=>{let t=[];return e.forEach(e=>{if(e.lbl===``&&t.length>0)t[t.length-1].stmts.push(e);else{if(e.lbl===``)throw new oe(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);t.push({...W(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),t.forEach(e=>ge(e.stmts)),t},ve=(e,t)=>{let n=e[t];switch(n.kind){case`LabelIf`:{let r=M(n.unlabThen);n.labThen.forEach(e=>M(e.stmts));let i=M(n.unlabElse);return n.labElse.forEach(e=>M(e.stmts)),n.labThen.length>0||n.labElse.length>0||r===2||i===2?2:(e[t]={...W(),kind:`If`,test:n.test,Then:n.unlabThen,Else:n.unlabElse},+(r+i>0))}case`LabelEither`:{let r=n.clauses.reduce((e,t)=>{let n=Math.max(e,M(t.unlabOr));return t.labOr.forEach(e=>M(e.stmts)),t.labOr.length>0?2:n},0);return r===2?2:(e[t]={...W(),kind:`Either`,ors:n.clauses.map(e=>e.unlabOr)},r)}case`With`:{let e=M(n.Do);if(e===2)throw new k(`with statement at ${Sa(n)} contains a labeled statement`);return e}case`While`:if(t!==0)throw new oe("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return M(n.unlabDo),n.labDo.forEach(e=>M(e.stmts)),0;case`Call`:return e[t+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(o.currentProcedure===void 0)throw new k(`return statement not in a procedure at ${Sa(n)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new oe(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${n.kind}`)}},M=e=>{for(let t=0;t<e.length;t++){let n=ve(e,t);if(n!==0){if(t===e.length-1)return n;throw new oe(`Translator discovered later than it should have that\n Statement at ${Sa(e[t+1])} must have a label`)}}return 0},ye=e=>{he(e,!0,!1,[],[]);let t=_e(e);return t.forEach(e=>M(e.stmts)),t},be=(e,t,n,r,i)=>{let a=e=>za(e,t,n),o=e=>e.map(e=>be(e,t,n,r,i)),s=e=>e.map(e=>({...W(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>be(e,t,n,-1,0))})),c={...W(),col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine};switch(e.kind){case`Assign`:return{...c,kind:`Assign`,ass:e.ass.map(e=>xe(e,t,n,r,i))};case`If`:return{...c,kind:`If`,test:a(e.test),Then:o(e.Then),Else:o(e.Else)};case`Either`:return{...c,kind:`Either`,ors:e.ors.map(o)};case`With`:return{...c,kind:`With`,var:e.var,isEq:e.isEq,exp:a(e.exp),Do:o(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...c,kind:e.kind,exp:a(e.exp)};case`Skip`:return{...c,kind:`Skip`,macroCol:r>0?i:0,macroLine:r>0?r:-1};case`While`:return{...c,kind:`While`,test:a(e.test),unlabDo:o(e.unlabDo),labDo:s(e.labDo)};case`LabelIf`:return{...c,kind:`LabelIf`,test:a(e.test),unlabThen:o(e.unlabThen),labThen:s(e.labThen),unlabElse:o(e.unlabElse),labElse:s(e.labElse)};case`LabelEither`:return{...c,kind:`LabelEither`,clauses:e.clauses.map(e=>({...W(),kind:`Clause`,labOr:s(e.labOr),unlabOr:o(e.unlabOr)}))};case`Call`:return{...c,kind:`Call`,to:e.to,returnTo:e.returnTo,args:Ba(e.args,t,n)};case`Return`:return{...c,kind:`Return`,from:e.from};case`CallReturn`:return{...c,kind:`CallReturn`,to:e.to,from:e.from,args:Ba(e.args,t,n)};case`CallGoto`:return{...c,kind:`CallGoto`,to:e.to,after:e.after,args:Ba(e.args,t,n)};case`Goto`:return{...c,kind:`Goto`,to:e.to};default:throw new oe(`Found unexpected statement type in macro at${Sa(e)}`)}},xe=(e,t,n,r,i)=>{let a=za(e.rhs,t,n),o={...W(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:za(e.lhs.sub,t,n)},s={...W(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine,lhs:o,rhs:a},c=n.indexOf(o.var);if(c===-1)return s;let l=t[c],u=Pa(l,{line:0,item:0});if(u.type!==va.ident)throw new k(`Macro expansion substitutes \`${u.string}' for assignment variable\n at ${Sa(s)}`);if(o.var=u.string,Fa(l,{line:0,item:0},1)===void 0)return s;let d=ja(l);return d.tokens[0].splice(0,1),Oa(d),o.sub.tokens.length===0?o.sub=d:Ma(o.sub,d,0),s},Se=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return Se(e.unlabThen,t),Se(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>Se(e.unlabOr,t)),[e];case`With`:return Se(e.Do,t),[e];case`While`:return Se(e.unlabDo,t),[e];case`MacroCall`:return Ce(e,t);default:return[e]}});e.splice(0,e.length,...n)},Ce=(e,t)=>{let n=t.findLast(t=>t.name===e.name);if(n===void 0)throw new k(`Macro ${e.name} undefined,\n at ${Sa(e)}`);if(n.params.length!==e.args.length)throw new k(`Macro ${e.name} called with wrong number of arguments at \n ${Sa(e)}`);let r=n.body.map(t=>be(t,e.args,n.params,e.line,e.col));return r.length>0&&(r[0].lbl=e.lbl),r},we=e=>{e.forEach((t,n)=>{if(e.slice(n+1).some(e=>e.name===t.name))throw new k(`Multiple definitions of macro name \`${t.name}'`)})},Te=e=>{if(e.length===0)return;let t=()=>{o.omitPC=!1,o.omitStutteringWhenDone=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!Na(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(o.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(o.omitPC=!1)},Ee=()=>{let e=o.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new k([e,...o.addedLabelsLocs].join(`
36
- `))},De=()=>{r.reportLabelsFlag?(e.log(o.addedLabels.length>1?`The following labels were added:`:`The following label was added:`),o.addedLabels.forEach((t,n)=>e.log(` ${t} at ${o.addedLabelsLocs[n]}`))):e.log(`Labels added.`)},Oe=e=>o.procedures.forEach(t=>{o.currentProcedure=t.name,Se(t.body,e),t.body=ye(t.body)}),ke=()=>{n&&(c()!==`algorithm`&&s("`--fair' not followed by `algorithm'"),r.fairAlgorithm=!0);let t=c();o.cSyntax=l(1)===`{`,o.pSyntax=!o.cSyntax,o.cSyntax&&p(`{`);let i=l(1)===`variable`||l(1)===`variables`?b():[],a={value:Da()};l(1)===`define`&&(p(`define`),o.cSyntax&&f(`{`),a.value=d(!0),_(`define`),f(`;`));let u=[];for(;l(1)===`macro`;)u.push(ue(u));for(;l(1)===`procedure`;)o.procedures.push(de()),o.omitPC=!1;if(l(1)===`fair`&&(l(2)===`process`||l(2)===`+`&&l(3)===`process`)||l(1)===`process`){let e=[];for(;l(1)===`fair`||l(1)===`process`;){let t=l(1)===`fair`;t&&p(`fair`);let n=t&&l(1)===`+`;n&&p(`+`);let i=n||!t&&r.fairnessOption===`sf`?2:t||r.fairnessOption===`wf`?1:0;e.push({...fe(),fairness:i})}_(`algorithm`),we(u);let n=e.map(e=>(Se(e.body,u),e.body=ye(e.body),o.omitStutteringWhenDone=!0,Te(e.body),o.omitStutteringWhenDone));return o.omitStutteringWhenDone=n.includes(!0),Oe(u),o.addedLabels.length>0&&(r.labelFlag||Ee(),De()),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),o.gotoUsed&&(o.omitPC=!1),{...W(),kind:`Multiprocess`,name:t,decls:i,defs:a.value,macros:u,prcds:o.procedures,procs:e}}r.inputVersionNumber===1500&&l(1)===`fair`&&(f(`fair`),l(1)===`+`&&f(`+`),r.fairnessOption=`wf`),n&&([``,`wf`,`wfNext`].includes(r.fairnessOption)||e.log(`Warning: Option \`${r.fairnessOption}' specified for --fair algorithm.`),r.fairnessOption=`wf`),g();let m=w();we(u),Se(m,u),Oe(u),o.cSyntax&&f(`}`),_(`algorithm`);let h=ye(m);return o.addedLabels.length>0&&(o.hasLabel&&!r.labelFlag&&Ee(),De()),o.gotoUsed&&(o.omitPC=!1),o.gotoDoneUsed||Te(h),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),{...W(),kind:`Uniprocess`,name:t,decls:i,defs:a.value,macros:u,prcds:o.procedures,body:h}};try{return{ast:ke(),omitPC:o.omitPC,omitStutteringWhenDone:o.omitStutteringWhenDone,hasDefaultInitialization:o.hasDefaultInitialization}}catch(e){if(!(e instanceof ne))throw e;return s(`Unknown error at or before`)}},G={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},mo=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],ho=/* @__PURE__ */ new Set([G.global,G.processVar,G.procedureVar,G.parameter]),go=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),_o=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),vo=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},yo=(e,t)=>{let n=e.processes.findIndex(e=>e.name===t);return n===-1?e.processes.length:n},bo=(e,t,n,r,i,a,o)=>!(t===G.procedureVar||t===G.processVar||t===G.parameter?go(e,G.global,n,``)!==void 0||_o(e,n,r)!==void 0:go(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,contextType:i,line:a,col:o,useThis:n}),!0),xo=(e,t,n,r)=>go(e,t,n,r)?.useThis??n,So=(e,t,n)=>{let r=_o(e,t,n);return r===void 0?t:ho.has(r.type)?r.useThis:t},Co=e=>{let t={symbols:[],procedures:[],processes:[],disambiguateReport:[],errorReport:``,initialPC:void 0},n=(e,n,i)=>{bo(t,G.label,e.label,n,i,e.line,e.col)||(t.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>r(e,n,i))},r=(e,t,i)=>{let a=e=>e.forEach(e=>r(e,t,i)),o=e=>e.forEach(e=>n(e,t,i));switch(e.kind){case`While`:a(e.unlabDo),o(e.labDo);return;case`If`:a(e.Then),a(e.Else);return;case`With`:a(e.Do);return;case`LabelIf`:a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new oe(`Unexpected AST type ${e.kind}`)}},i=(e,n,r=`process`,i=n===``?G.global:G.processVar)=>{bo(t,i,e.var,n,r,e.line,e.col)||(t.errorReport+=`\n${mo[i]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(bo(t,G.global,`pc`,``,``,0,0),e.prcds.length>0&&bo(t,G.global,`stack`,``,``,0,0),e.decls.forEach(e=>i(e,``)),e.prcds.forEach(e=>{let r=vo(t,e.name)<t.procedures.length;r&&(t.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:Ca(e.body[0]).label}),bo(t,G.procedure,e.name,``,`procedure`,e.line,e.col),e.decls.forEach(t=>i(t,e.name,`procedure`,G.procedureVar)),e.params.forEach(t=>i(t,e.name,`procedure`,G.parameter)),e.body.forEach(t=>n(Ca(t),e.name,`procedure`))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let r=yo(t,e.name)<t.processes.length;r&&(t.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.processes.push({name:e.name,initialPC:e.body.length===0?void 0:Ca(e.body[0]).label}),bo(t,G.process,e.name,``,`process`,e.line,e.col),e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>n(Ca(t),e.name,`process`))}),e.kind===`Uniprocess`&&(e.body.length>0&&(t.initialPC=Ca(e.body[0]).label),e.body.forEach(e=>n(Ca(e),``,``))),t.errorReport.length>0)throw new k(t.errorReport);return t},wo=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1;for(let n=0;n<=7;n+=1)e.symbols.forEach(r=>{if(r.type!==n)return;r.useThis=r.id;for(let e=1;n>0&&t(r.useThis);e+=1)r.useThis+=e===1?`_`:r.context[e-2]??String(n);if(r.id===r.useThis)return;let i=r.context.length===0?``:` of ${r.contextType} ${r.context}`;e.disambiguateReport.push(`\\* ${mo[r.type]} ${r.id}${i} at line ${r.line} col ${r.col} changed to ${r.useThis}`)})},To=e=>{let t=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${mo[e.type]} name`);if(t.length>0)throw new k(`Cannot use \`defaultInitValue' as ${t.join(` or `)}`)},Eo=(e,t,n)=>{let r=(e,n)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==va.ident)return;let a=So(t,e.string,n);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(ka([[Ao(a)]])))})),i.length>0&&Ra(e,i,r,!1)},i=(e,n)=>{e.var=So(t,e.var,n),r(e.val,n)},a=(e,n)=>e.forEach((r,i)=>{e[i]=xo(t,G.label,r,n)}),o=(e,n)=>e===void 0?void 0:xo(t,G.procedure,e,n),s=(e,n)=>{e.label=xo(t,G.label,e.label,n),e.stmts.forEach(e=>c(e,n))},c=(e,n)=>{let i=e=>e.forEach(e=>c(e,n)),a=e=>e.forEach(e=>s(e,n)),l=e=>e.forEach(e=>r(e,n));switch(e.kind){case`LabeledStmt`:s(e,n);return;case`While`:i(e.unlabDo),a(e.labDo),r(e.test,n);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=So(t,e.lhs.var,n),r(e.lhs.sub,n),r(e.rhs,n)});return;case`If`:i(e.Then),i(e.Else),r(e.test,n);return;case`With`:r(e.exp,n),i(e.Do);return;case`When`:case`PrintS`:case`Assert`:r(e.exp,n);return;case`Skip`:return;case`LabelIf`:r(e.test,n),i(e.unlabThen),a(e.labThen),i(e.unlabElse),a(e.labElse);return;case`Call`:e.returnTo=xo(t,G.procedure,e.returnTo,n),e.to=xo(t,G.procedure,e.to,n),l(e.args);return;case`Return`:e.from=o(e.from,n);return;case`CallReturn`:e.from=o(e.from,n),e.to=xo(t,G.procedure,e.to,n),l(e.args);return;case`CallGoto`:e.after=xo(t,G.procedure,e.after,n),e.to=xo(t,G.procedure,e.to,n),l(e.args);return;case`Goto`:if(go(t,G.label,e.to,n)===void 0&&e.to!==`Done`)throw new k(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=xo(t,G.label,e.to,n);return;case`Either`:e.ors.forEach(i);return;case`LabelEither`:e.clauses.forEach(e=>{i(e.unlabOr),a(e.labOr)});return;default:throw new oe(`Unexpected AST type${e.kind}`)}},l=e=>{e.decls.forEach(t=>i(t,e.name)),e.params.forEach(t=>i(t,e.name)),e.body.forEach(t=>s(Ca(t),e.name));let n=wa(t.procedures,vo(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=xo(t,G.label,n.initialPC,e.name)),e.name=xo(t,G.procedure,e.name,``),n.name=e.name},u=e=>{e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>s(Ca(t),e.name));let n=wa(t.processes,yo(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=xo(t,G.label,n.initialPC,e.name)),e.name=xo(t,G.process,e.name,``),n.name=e.name};e.decls.forEach(e=>i(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(l);let r=e.map(e=>e.name),i=e.map(e=>r.map(t=>e.proceduresCalled.includes(t)));r.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=r.filter((e,n)=>i[t][n])});for(let e of t){u(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=r.indexOf(t[e]);if(a===-1){n(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}r.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(l),e.body.forEach(e=>s(Ca(e),``))),t.initialPC!==void 0&&(t.initialPC=xo(t,G.label,t.initialPC,``))},Do=e=>Ta(e,0,va.string),Oo=e=>Ta(e,0,va.added),ko=e=>Ta(e,0,va.builtin),Ao=e=>Ta(e,0,va.ident),jo=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+Ea(r)+t;n.push(Ta(e.string,i,e.type))}),ka([n])},Mo=e=>e.tokens.forEach((t,n)=>{let r={column:n===0||n===e.tokens.length-1?1:6};t.forEach(e=>{if(e.column=r.column,r.column+=Ea(e),e.type===va.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r.column=e.column+5;return;case`[`:case`<<`:r.column+=1;return;case`]`:case`>>`:e.column+=1,r.column+=1;return;case`\\o`:e.column+=1,r.column+=2}})}),No=(e,t,n,r=0,i=0)=>({...W(),kind:`SingleAssign`,line:r,col:i,lhs:{...W(),kind:`Lhs`,var:e,sub:t},rhs:n}),Po=(e,t=0,n=0)=>({...W(),kind:`Assign`,line:t,col:n,ass:e}),Fo=(e,t,n=0,r=0)=>Po([No(e,ka([]),t,n,r)],n,r),Io=e=>{if(e.tokens.length>1)return!1;let t=wa(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},Lo=e=>({...W(),kind:`When`,exp:jo([Oo(`pc`),ko(`=`),Do(e)],1)}),Ro=e=>Fo(`pc`,ka([[Do(e??`null`)]])),zo=e=>[Ao(`Head`),ko(`(`),Oo(`stack`),ko(`)`),ko(`.`),Ao(e)],Bo=()=>[Ao(`Tail`),ko(`(`),Oo(`stack`),ko(`)`)],Vo=e=>ka([zo(e)]),Ho=(e,t,n,r)=>{let i=[[ko(`<<`),ko(`[`),Ao(`procedure`),ko(`|->`),Do(e),ko(`,`)],[Ao(`pc`),ko(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(ko(`,`)),i.push([Ao(e.var),ko(`|->`),Ao(e.var)])}),i[i.length-1].push(ko(`]`),ko(`>>`)),i.push(r);let a=Da(i);return Mo(a),Oa(a),a},Uo=(e,t,n)=>{if(t.params.length!==n.args.length)throw new k(`Procedure ${n.to} called with wrong number of arguments`,n);return t.params.forEach((t,r)=>e.ass.push(No(t.var,ka([]),n.args[r],n.line,n.col))),[e,...t.decls.map(e=>Fo(e.var,e.val,n.line,n.col)),Ro(t.initialPC)]},Wo=(e,t,n)=>{let r={procedure:void 0},i=(e,n)=>{let r=vo(t,e.to);if(r===t.procedures.length)throw new k(`Call of non-existent procedure ${e.to}`,e);let i=t.procedures[r],a=Ho(e.to,[Do(n)],[...i.decls,...i.params],[ko(`\\o`),Oo(`stack`)]);return Uo(Fo(`stack`,a,e.line,e.col),i,e)},a=e=>{e.from??=r.procedure;let n=e.from;if(n===void 0)throw new k("`return' statement not in procedure",e);let i=vo(t,n);if(i>=t.procedures.length)throw new k(`Error in procedure (perhaps name used elsewhere)`,e);let a=t.procedures[i],o=(t,n)=>Po([No(t,Da(),n,e.line,e.col)],e.line,e.col);return[o(`pc`,Vo(`pc`)),...a.decls.map(e=>o(e.var,Vo(e.var))),...a.params.map(e=>o(e.var,Vo(e.var))),o(`stack`,ka([Bo()]))]},o=e=>{let n=e.from;if(n===void 0)throw new k(`\`return' statement following \`call' at ${Sa(e)} not in a procedure`);let r=wa(t.procedures,vo(t,n)),i=vo(t,e.to);if(i===t.procedures.length)throw new k(`Call of non-existent procedure ${e.to}`,e);let a=t.procedures[i],o=Po([],e.line,e.col);if(n!==e.to){r.decls.forEach(t=>o.ass.push(No(t.var,Da(),Vo(t.var),e.line,e.col)));let t=Ho(e.to,zo(`pc`),[...a.decls,...a.params],[ko(`\\o`),...Bo()]);o.ass.push(No(`stack`,ka([]),t,e.line,e.col))}return Uo(o,a,e)},s=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!n};let r={stmts:e,labeledStmts:[],needsGoto:!1},c=e[e.length-1];switch(c.kind){case`LabelIf`:case`LabelEither`:{let n=c.kind===`LabelIf`?f(c,t):p(c,t);e.pop(),e.push(n.stmt),r.labeledStmts=n.labeledStmts;break}case`Goto`:e.pop(),e.push(Ro(c.to));break;case`Call`:e.pop(),e.push(...i(c,t));break;case`Return`:e.pop(),e.push(...a(c));break;case`CallReturn`:e.pop(),e.push(...o(c));break;case`CallGoto`:e.pop(),e.push(...i({...W(),kind:`Call`,returnTo:``,to:c.to,args:c.args,line:c.line,col:c.col},c.after));break;case`If`:{let e=s(c.Then,t),i=s(c.Else,t);r.labeledStmts.push(...e.labeledStmts,...i.labeledStmts),c.Then=e.stmts,c.Else=i.stmts,n||(r.needsGoto=e.needsGoto&&i.needsGoto,r.needsGoto||(e.needsGoto&&c.Then.push(Ro(t)),i.needsGoto&&c.Else.push(Ro(t))));break}case`Either`:{let e=c.ors.map((e,n)=>{let i=s(e,t);return c.ors[n]=i.stmts,r.labeledStmts.push(...i.labeledStmts),i});r.needsGoto=e.every(e=>e.needsGoto),!n&&!r.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&c.ors[n].push(Ro(t))});break}case`With`:{let e=s(c.Do,t);c.Do=e.stmts,r.labeledStmts.push(...e.labeledStmts),r.needsGoto=e.needsGoto;break}default:r.needsGoto=!0}return n&&(r.needsGoto=!1),r},c=(e,t)=>{let n=s(e,t);return n.needsGoto&&n.stmts.push(Ro(t)),n},l=(e,t)=>{let r=e.stmts.at(0);if(r?.kind===`While`)return d(e,r,t);let i=c([...e.stmts],t),a=[];return n||(i.stmts.unshift(Lo(e.label)),a.push({...W(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},u=(e,t)=>e.flatMap((n,r)=>l(n,r<e.length-1?e[r+1].label:t)),d=(e,t,r)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=c([...t.unlabDo],i),o=c(e.stmts.slice(1),r),s=Io(t.test),l=s?a.stmts:[{...W(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...W(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...n?[]:[Lo(e.label)],...l]},...u(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},f=(e,t)=>{let n=c(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=c(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=u(e.labThen,t);return i.push(...u(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...W(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},p=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=c(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...u(e.labOr,t))}),{stmt:{...W(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},m=(e,t)=>u(e.map(Ca),t),h=e=>{r.procedure=e.name;let n=m(e.body,xo(t,G.label,`Error`,``));return r.procedure=void 0,{...W(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:n}},g=e=>({...W(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:m(e.body,`Done`)}),_=e.prcds.map(h);return e.kind===`Uniprocess`?{...W(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:_,body:m(e.body,`Done`)}:{...W(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:_,procs:e.procs.map(g)}},Go=(e,t)=>{let n=t?[]:[`pc`];if(n.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&n.push(`stack`),e.prcds.forEach(e=>{n.push(...e.params.map(e=>e.var)),n.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>n.push(...e.decls.map(e=>e.var))),n.length===0)throw new k(`The algorithm has no variables.`);let r=(e,t)=>{let r=n.indexOf(t);return r===-1?0:(e[r]+=1,e[r])},i=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),a=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),o=(e,t)=>{let o=[...t];e.ass=a(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(t=>{let i=e.ass.filter(e=>e.lhs.var===t);if(!n.includes(t))throw new k(`Assignment to undeclared variable ${t}`,i[0]);let a=i.some(e=>e.lhs.sub.tokens.length===0);if(r(o,t)>1||i.length>1&&a)throw new k(`Multiple assignment to ${t}`,e)}),i(t,o)},s=(e,t)=>{switch(e.kind){case`Assign`:o(e,t);return;case`If`:{let n=[...t],r=[...t];e.Then.forEach(e=>s(e,n)),e.Else.forEach(e=>s(e,r)),i(t,n),i(t,r);return}case`Either`:{let n=[...t];e.ors.forEach(e=>{let r=[...t];e.forEach(e=>s(e,r)),i(n,r)}),i(t,n);return}case`With`:e.Do.forEach(e=>s(e,t));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new oe(`Unexpected AST type ${e.kind}`)}},c=e=>e.forEach(e=>{let t=n.map(()=>0);Ca(e).stmts.forEach(e=>s(e,t))});e.prcds.forEach(e=>c(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(c)},Ko=(e,t,n,r)=>{let i=Co(e);wo(i),i.disambiguateReport.length>0&&r(`Warning: symbols were renamed.`),Eo(e,i,r),Go(Wo(e,i,t),t),n&&To(i)},qo=`[ \\t\\n\\x0B\\f\\r]`,Jo=RegExp(`\\\\\\* BEGIN TRANSLATION${qo}+\\(${qo}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${qo}*(=${qo}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${qo}*STRING)${qo}*\\/\\\\${qo}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${qo}*(=${qo}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${qo}*STRING)${qo}*\\)`),Yo=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),Xo=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),Zo=(e,t)=>Xo(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${Sa(t.node)}`),Qo=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),$o=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},es=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},ts=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},ns=e=>/^[\p{L}\p{Nd}_]$/u.test(e),rs=(e,t,n)=>{for(;t.line<e.length;){let r=es(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=ts(r,e,` `),!0}t.column=ts(r,t.column,` `)}return!1},is=(e,t)=>Xo(e,`Command-line error: ${t}`),as=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(is(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let a=0;a<t.length;a++){let o=t[a],s=t[a+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){is(e,`
37
- Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){is(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}n.specFile=s,a+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:n.noOld=!0;continue;case`-nocfg`:n.nocfg=!0;continue;case`-noDoneDisjunct`:case`noDoneDisjunct`:n.noDoneDisjunct=!0;continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!i(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(r.isExplicitNof=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){is(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){is(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,a+=1;continue;case`-version`:case`version`:{if(s===void 0){is(e,"Version number must follow `-version' option");return}let t=ba(s);if(t<0||t>1903){Xo(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),is(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){is(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:is(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},os=(e,t,n)=>{if(es(t,n),n.column+=7,!es(t,n).slice(n.column).startsWith(`(`)){Xo(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=es(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=ts(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?Xo(e,`No closing ')' found in options statement`):as(e,r)},ss=(e,t,n)=>{let r={depth:0,isDone:!1,isInString:!1};for(let i=t;!r.isDone&&i<e.length;i++){let a=e[i],o=i===t?n:0,s=[a.slice(0,o)];r.isInString=!1;for(let e=o;!r.isDone&&e<a.length;e++){let t=a[e],n=a.slice(e,e+2);if(n===`(*`&&!r.isInString)r.depth+=1,s.push(` `),e+=1;else if(n===`*)`&&!r.isInString&&r.depth===0)s.push(n),r.isDone=!0;else if(n===`*)`&&!r.isInString)--r.depth,s.push(` `),e+=1;else if(r.depth>0)s.push(` `);else if(r.isInString&&t===`\\`&&n.length===2)s.push(n),e+=1;else{if(!r.isInString&&n===`\\*`){s.push(` `);break}t===`"`&&(r.isInString=!r.isInString),s.push(t)}}if(r.isInString)return new k(`Unterminated string in line ${i+1}`);e[i]=s.join(``)}},cs=(e,t)=>{let n=10*2**Math.max(0,Math.ceil(Math.log2(t/10)));throw new ne(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${n}`)},ls=(e,t,n)=>{if(!t.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let r=Qo(t),i={line:0,column:0};for(;rs(r,i,`PlusCal`);){let t=es(r,i).slice(i.column),n=Array.from(t).findIndex(e=>!ns(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){e.params.optionsInFile=!0,os(e,r,i);break}}let a={line:0,column:-1,isFound:!1,isFair:!1};for(;a.line<r.length;a.line++){let e=r[a.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){a.column=t+11,a.isFound=!0;break}if(n!==-1){a.column=n+6,a.isFound=!0,a.isFair=!0;break}}let o=/* @__PURE__ */ new Set,s=$o(r,0,`BEGIN`,`TRANSLATION`);s===-1&&o.add(`NO_TRANSLATION_EXISTS`);let c=$o(r,s+1,`END`,`TRANSLATION`);if(c===-1&&o.add(`NO_TRANSLATION_EXISTS`),s===-1&&c===-1)return o;if(!a.isFound)return o.add(`NO_PLUSCAL_EXISTS`),o;let l=ss(r,a.line,a.column);if(l!==void 0)return Zo(e,l),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let u={ast:void 0};try{let n=Ua(r,a.line,a.column,t.length,0),i=po(e,n,a.isFair);u.ast=i.ast,Ko(i.ast,i.omitPC,i.hasDefaultInitialization,e.log)}catch(t){if(!(t instanceof k))throw t;Zo(e,t)}s===-1&&cs(-1,r.length);let d=Jo.exec(r[s]);if(d===null)return o.add(`NO_PCAL_CHECKSUMS_EXIST`),o;let f=d.groups?.pcal,p=a.isFair&&n!==`1.7.4`?`fair`:u.ast===void 0?void 0:Ha(u.ast,e.params.inputVersionNumber,n);f!==void 0&&(p===void 0||f!==Yo(p))&&o.add(`PCAL_DIVERGENCE_EXISTS`);let m=d.groups?.tla;if(m!==void 0){if(c===-1)throw new ne(`java.lang.IllegalArgumentException: fromIndex(${s+1}) > toIndex(-1)`);let e=t.slice(s+1,c).join(``);m!==Yo(e)&&o.add(`TLA_DIVERGENCE_EXISTS`)}return o.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):o},us=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],ds={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},K=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),fs=e=>us.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...K(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...K(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:ds,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),ps=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},ms=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,hs=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,gs=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},_s=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),vs=(e,t)=>(e&2147483647)%t,ys=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[vs(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},bs=(e,t,n=t)=>e.buckets[vs(gs(n),e.buckets.length)].find(e=>e.key===t)?.value,xs=(e,t,n,r=t)=>{let i=gs(r),a=e.buckets[vs(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&ys(e),e.buckets[vs(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},Ss=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),Cs=`\0module `,ws=()=>({table:_s(),symbols:[]}),Ts=e=>e.kind===`Module`?Cs+e.name:e.name,Es=(e,t)=>{xs(e.table,Ts(t),t,t.name),e.symbols.push(t)},Ds=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Os=(e,t)=>bs(e.table,t),ks=(e,t)=>bs(e.table,Cs+t,t),As=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),js=(e,t)=>Ss(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),Ms=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Ns=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),Ps=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},Fs=e=>{switch(e.kind){case`Identifier`:return Ps(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=Ps(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r={value:0};return t.map((t,i)=>{let a=e.args.slice(r.value,r.value+n[i]);return r.value+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},Is=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Ls=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Rs=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,zs=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Bs=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,Vs=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],Hs=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},Us=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l=e=>t[e].location??a,u={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},d=e=>e.args??[];for(;u.index<t.length;){let f=t[u.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(l(u.index),`Selector \`${f.name}' should not have argument(s).`);switch(u.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&u.index<t.length;){let n=t[u.index];if(p=n.op===`Name`?u.name===void 0?e.resolveSynonym(n.name):`${u.name}!${e.resolveSynonym(n.name)}`:void 0,u.name===void 0&&n.op!==`Name`)return e.addError(l(u.index),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=u.letInContext===void 0?e.resolveSymbol(p):Os(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=Hs(u.nameLocation,l(u.index))),m.push(...d(n)),u.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(l(n),`Unknown operator: \`${Ls(t[n])}'.`)}if(f===void 0)return e.addError(u.nameLocation??a,`Unknown operator: \`${u.name}'.`);if(f.kind===`Module`)return e.addError(l(u.index),`Module name (${t[u.index].name}) not allowed here.`);if(u.node=f,u.nameLocation=Hs(u.nameLocation,l(u.index)),u.name=p,zs(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=Ds(f);if(n===0){if(m.push(...d(t[u.index])),u.definitionArityFound+m.length!==h)return e.addError(t[u.index].argsLocation??a,`The operator ${u.name} requires ${h-u.definitionArityFound} arguments.`);m.forEach((t,n)=>u.definitionArgs.push(e.generateArgument(f,n+u.definitionArityFound,t,l(u.index))))}if(u.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(u.index===t.length-1&&!(i||r))return e.addError(l(u.index),`Operator name ${u.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(l(u.index),`Subexpression of \`${u.name}' used inside the operator's definition.`);if(u.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),u.name=void 0,u.nameLocation=void 0,u.mode=t[u.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...u.definitionArgs),u.definitionArityFound=0,u.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;u.mode===`FindingSubExpr`&&(u.node=e)}}u.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=u.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(l(u.index),`Cannot find label \`${f.name}'.`);if(u.node=i,e.isOutOfLabelScope(i))return e.addError(l(u.index),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(l(u.index),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),u.index<t.length-1&&t[u.index+1].op!==`Name`&&(u.mode=`FindingSubExpr`),u.mode===`FindingSubExpr`&&(u.node=i.body),u.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=u.node,r=()=>e.addError(l(u.index),`Nonexistent operand specified by \`${Ls(f)}'.`);if(f.op===`:`){if(!(u.previousMode!==`FindingSubExpr`&&(u.index===t.length-1&&u.previousMode===`FindingOpName`||u.index<t.length-1&&t[u.index+1].op===`Name`)))return e.addError(l(u.index),`\`!:' can be used only after a name and either at the end after an
38
- operator name or before an operator name.`)}else if(n===void 0)return e.addError(l(u.index),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(Rs(f.op,1)!==1)return e.addError(l(u.index),`A LET/IN expression has only one operand.`);u.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(l(u.index),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=Rs(f.op,a.length);if(o){let e=Rs(f.op,i.arity);if(e===-1)return r();u.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();u.node=e.operands[1]}else if(i.name===`$Case`){if(u.index===t.length-1)return e.addError(l(u.index),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();u.index++;let i=Rs(t[u.index].op,2);if(i===-1)return e.addError(l(u.index),`Second selector for CASE subexpression must specify one of two operands.`);if(u.node=n.operands[i-1],u.node===void 0)return e.addError(l(u.index),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(l(u.index),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();u.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();u.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=Vs(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(l(u.index),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}u.node=a[0]}else{let e=Rs(f.op,n.ranges.length);if(e===-1)return r();u.node=n.ranges[e-1]}}else return e.addError(l(u.index),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!u.isInSuffices){if(Rs(f.op,1)!==1)return e.addError(l(u.index),`Accessing non-existent subexpression of a SUFFICES`);u.isInSuffices=!0}else{u.isInSuffices=!1;let i=Rs(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(l(u.index),`Accessing ASSUME/PROVE clause within the scope of a declaration
39
- from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?Ds(f.op):u.previousMode===`FindingOpName`&&Bs(f)?Ds(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:Ds(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=Ns.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},Ws=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Gs=(e,t)=>`${e}:${t}`,Ks=(e,t)=>{let n=le(t).filter(e=>e.kind!==`End`).map(C),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
40
- `&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[Gs(e.line,e.column),t]))}},qs=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Js=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},Ys=(e,t)=>e.tokenIndexes.get(Gs(t.line,t.column))??Math.min(Js(e,t,!1),e.tokens.length-1),Xs=(e,t)=>Math.max(Js(e,t,!0)-1,0),Zs=(e,t)=>{let n=e.tokens[t].text,r=Ws.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(qs(e,a,n))i++;else if(qs(e,a,r)&&(i--,i===0))return a;return t},Qs=(e,t)=>({start:Ys(e,t.start),end:Xs(e,t.end)}),q=(e,t)=>{let n=t.location.range;if(n)return Qs(e,n);let r=Ys(e,t.location);return{start:r,end:Zs(e,r)}},$s=(e,t)=>{let n=t.start-1,r=t.end+1;return qs(e,n,`(`)&&qs(e,r,`)`)&&Zs(e,n)===r?$s(e,{start:n,end:r}):t},ec=(e,t)=>{let n=t.start-1,r=t.end+1;return qs(e,n,`(`)&&Zs(e,n)===r&&(qs(e,n-1,`(`)||qs(e,n-1,`,`))?ec(e,{start:n,end:r}):t},J=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),tc=(e,t)=>J(e,{start:t,end:t}),nc=(t,n,r)=>{let i=0,a=t.lineOffsets[n];for(;a<t.source.length;){if(i=t.source[a]===` `?e(i):i+1,i>=r)return a;a++}return a},rc=(e,t)=>{let n=e.tokens[t],r=nc(e,n.line,n.column);return e.source.slice(r,nc(e,n.line,n.endColumn)+1)},ic=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},ac=e=>{let n=Ks(``,e),r=n.tokens.reduce((e,t,r)=>{if(!ic(n,r))return e;let i=nc(n,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(r!==e&&t(e)!==void 0)throw new w(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return r},oc=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:nc(e,n.line,n.endColumn)+1,a=e.source.slice(i,nc(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
41
- `,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},sc=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},cc=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(qs(e,i,r))return i;return-1},lc=new Map(D.flatMap(([e,...t])=>t.map(t=>[t,e]))),uc=e=>e.split(`!`).map(e=>lc.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),dc={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},fc=e=>/^[A-Za-z0-9_]+$/.test(e),pc=e=>e!==`!!`&&e.includes(`!`),mc=e=>e.contexts[e.contexts.length-1],hc=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Os(e.contexts[n],t);if(r)return r}},gc=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,_c=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,vc=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||yc(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&yc(n.module)}return!1},yc=e=>js(e,2).length===0&&js(e,3).length===0,bc=e=>[...e.kind===`Let`?e.instances??[]:[],..._(e).flatMap(bc)],xc=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:xc(e)):bc(e),Sc=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},Cc=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?bc(e.definition.body):e.kind===`Theorem`&&s?xc(e.theorem.statement):e.kind===`Assumption`&&s?bc(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!Sc(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},wc=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Tc=e=>{let t=e.kind===`Apply`?Fs(e):void 0;return wc.has(e.kind)||t!==void 0&&Is(t)},Ec=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Dc=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Oc=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),kc=(e,t)=>Oc.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Ac=(e,n,r={})=>{let i=[],a=(e,t)=>ps(i,{location:e,text:t,isWarning:!1}),o=(e,t)=>ps(i,{location:e,text:t,isWarning:!0}),s={value:r.version===`1.7.4`?-1:0},c=()=>++s.value,l={id:0},u=(e,t)=>{let n=hc(e,t.name);if(n===t)return;if(n===void 0){Es(mc(e),t);return}let i=t.kind===`FormalParam`||gc(n)!==gc(t)||Ds(n)!==Ds(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(i&&r.version===`1.7.4`)?a(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):i?a(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${ms(n.location)}.`):vc(t,n)||o(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${ms(n.location)}.`)};r.version!==`1.7.4`&&fs(c);let p=fs(c);c();let m=new Map(p.map(e=>[e.name,e])),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Map,_=(e,n)=>{let i=e===r.rootFileName&&r.rootFilePath||`${e}.tla`,a=t=>new ee(`Could not parse module ${e} from file ${i}`,e,t),o=r.version===`1.7.4`?f(n):void 0;if(o!==void 0)throw a(o);try{return d(ac(n))}catch(e){throw e instanceof w?a(t(n)??`***Parse Error***\n${e.message}`):e}},v=(e,t,n)=>{let i=g.get(e);if(i)return i;if(t===void 0)throw new ie(e,n,r.version!==`1.7.4`);r.onParse?.(e);let a=_(e,t);if(a.name!==e)throw new ee(`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`,void 0);let o={file:Ks(a.name,t),module:a};return g.set(e,o),o},y=[],b=/* @__PURE__ */ new Set,x=[],S=(e,t,r)=>{let i=x.indexOf(e);if(i!==-1)throw new ee(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...x.slice(i),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(b.has(e))return;b.add(e),x.push(e);let a=D(e,v(e,t,r).module);[...a.extendees,...a.instancees].forEach(t=>S(t,n(t),e)),x.pop(),y.push(e)},C=/* @__PURE__ */ new Set,T=(e,t)=>C.has(`${e} ${t}`),E=(e,t,n)=>{let r=g.get(e);if(!r||n.has(e))return;n.add(e);let i=D(e,r.module),a=i[t].find(t=>!T(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=T(e,r)?E(r,t,n):void 0;if(i)return i}},te=t=>{v(t,e);let r=()=>E(t,`extendees`,/* @__PURE__ */ new Set)??E(t,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())g.has(e.name)||v(e.name,n(e.name),e.namingModule),C.add(`${e.importer} ${e.name}`)},ne=r.rootFileName??_(``,e).name,D=(e,t)=>{let n=Cc(t);return e!==ne||r.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...r.rootExtendees),r.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};te(ne),S(ne,e);let re=(e,t,n,i)=>{let s={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},d=[],f=[],p=[],g=[],_=/* @__PURE__ */ new WeakSet,v=()=>g.push({labels:/* @__PURE__ */ new Map,params:[]}),y=()=>g.pop()?.labels??/* @__PURE__ */ new Map,b={depth:0,isDeclared:[],goal:void 0,goalClause:0},x=/* @__PURE__ */ new WeakMap,S=/* @__PURE__ */ new WeakMap,ee=e=>{let t=e.kind===`AssumeProve`?x.get(e):void 0;t&&(t.isInProof=!1)},C=e=>J(t,q(t,e)),T=e=>e.range?Qs(t,e.range):{start:Ys(t,e),end:Ys(t,e)},E={kind:`Module`,id:c(),name:e.name,location:J(t,T(e.location)),extendees:[],context:mc(i),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};n&&n.definitions.push(E);let te=e=>{for(let t=i.contexts.length-1;t>=0;t--){let n=ks(i.contexts[t],e);if(n?.kind===`Module`)return n}return h.get(e)},ne=e=>{let t=te(e);if(t===void 0)throw new w(`Could not find module ${e}`);return t},D=(e,t)=>{i.contexts.push(e);let n=t();return i.contexts.pop(),n},ie=(e,t,n,r)=>{let a={...K(c()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&u(i,a),a},ae=e=>({...K(c()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:E,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),O=e=>{e.letInLevel=s.curLevel,s.unresolvedSum>0&&(e.recursiveSection=s.recursiveSectionCount,e.inRecursiveSection=s.unresolvedCount[s.curLevel]>0,E.opDefsInRecursiveSection.push(e))},oe=(e,t,n,r={},i=c())=>({...K(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),se=()=>({...oe(k(`$Nop`),[],ds,{},l.id),isNull:!0}),k=e=>{let t=m.get(e);if(!t)throw new ce(`SANY has no builtin operator ${e}`);return t},A=(e,t,n,r={})=>oe(k(e),t,n,r),le=(e,t)=>({...K(c()),kind:`String`,value:e,location:t}),j=(e,t)=>({...K(c()),kind:`OpArg`,op:e,location:t}),ue=(e,t)=>{let n=hc(i,uc(e));if(n===void 0||n.kind===`Module`)throw new w(`Unknown operator: \`${e}' at line ${t.beginLine}, column ${t.beginColumn} of module ${t.file}`);return n},de=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let o=t[i];r.arity===0&&o.kind===`OpArg`&&a(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=o.kind===`OpArg`&&Ds(o.op)===r.arity&&!(o.op.kind===`OpDef`&&(o.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&a(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):a(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},fe=Us({version:r.version,resolveSymbol:e=>hc(i,e),resolveSynonym:uc,generateExpression:e=>N(e),generateArgument:(e,t,n,r)=>Se(e,t,n,r),createOpAppl:(e,t,n)=>{let r=oe(e,t,n);return de(e,t,n),r},createOpArg:j,createFormalParam:(e,t,n)=>ie(e,t,n,!1),createLambda:(e,n,r)=>ae({name:`LAMBDA`,params:e,body:n,location:r,preComments:oc(t,Ys(t,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>F(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:k,addError:(e,t)=>(a(e,t),se()),isOutOfLabelScope:e=>{let t=S.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=x.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),pe=(e,n)=>{let r={value:n.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=cc(t,r.value,n.end,i);if(a===-1)return e;if(e.op===`Null`){let n=Zs(t,a);return r.value=n+1,{...e,location:J(t,{start:a,end:n})}}r.value=a+1;let o=tc(t,a);if(e.args===void 0||!qs(t,a+1,`(`))return{...e,location:o};let s=Zs(t,a+1);return r.value=s+1,{...e,location:o,argsLocation:J(t,{start:a+1,end:s})}})},me=(e,n,r,i)=>{let a=Fs(e);if(a===void 0)throw new w(`Expected a name, found ${e.kind}`);return fe(pe(a,q(t,e)),n,r,i,C(e))},he=e=>{let t=me(e,0,!1,!1);if(t.kind!==`OpAppl`)throw new w(`Expected an expression`);return t},ge=e=>{if(e.kind!==`OpAppl`)return;let t=d.find(t=>t.name===e.operator.name);t&&(t.node.operator=k(`$RecursiveFcnSpec`))},_e=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),ve=(e,t)=>Fe(e,t,_e(e).map(e=>N(e[0].set))),M=(e,t)=>{let n=g.at(-1);n?.params.push(e);let r=N(t);return n?.params.pop(),r},ye=e=>{let n=q(t,e),r=sc(t,n.start,n.end,e.params);return D(ws(),()=>{let i=e.params.map((e,n)=>ie(e,0,tc(t,r[n]),!0)),a=M(i,e.body);return ae({name:`LAMBDA`,params:i,body:a,location:J(t,n),preComments:oc(t,n.start)})})},be=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:t.tokens[Ys(t,e.location)].text,xe=(e,t)=>{let n=C(e);if(e.kind===`Lambda`)return e.location.range===void 0?j(ue(be(e),n),n):j(ye(e),n);if(!Tc(e))return a(n,`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${t.name}'.`),se();if(e.kind===`OperatorReference`)return j(ue(e.operator,n),n);let r=me(e,t.arity,!1,!1);if(r.kind===`OpArg`||r.kind===`OpAppl`&&r.isNull===!0)return r;throw new w(`Expected an operator argument at line ${n.beginLine}, column ${n.beginColumn}`)},Se=(e,n,r,o)=>{let s=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[n]?.arity??0:0;if(s===0)return N(r);let c=q(t,r),l=J(t,c),u=`${n+1} (counting from 1)`,d=ec(t,c);if(d!==c||!Tc(r))return a(J(t,d),`An expression appears as argument number ${u} to operator '${e.name}', in a position an operator is required.`),se();if(r.kind===`Identifier`||r.kind===`Subexpression`||r.kind===`Apply`){let e=me(r,s,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new w(`Expected an operator argument at ${ms(l)}`)}if(r.kind===`Lambda`&&r.location.range!==void 0){let t=ye(r),i=Ds(t);return i===s?j(t,l):(a(o,`Lambda expression with arity ${i} used as argument ${n+1} of operator \`${e.name}', \nbut an operator of arity ${s} is required.`),se())}let f=be(r),p=hc(i,uc(f));if(p===void 0)return a(l,`Could not find declaration or definition of symbol '${f}'.`),se();let m=Ds(p);return m===s?j(p,l):(a(o,`Operator with incorrect arity passed as argument. \nOperator '${p.name}' of arity ${m} is argument number ${u} to operator \`${ms(e.location)}', \nbut an operator of arity ${s} was expected.`),se())},Ce=e=>{let n=C(e);if(e.isBulleted)return A(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(N),n);let r=q(t,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,n,a)=>{let s=$s(t,q(t,n)),c=a===o.length-1?r.end:s.end;return A(i,[e,N(n)],J(t,{start:r.start,end:c}))},N(a))},we=e=>{let n=q(t,e),r=e.arms.map((r,i)=>{let a=$s(t,q(t,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=$s(t,q(t,r.body)),c=[N(r.condition),N(r.body)];return A(`$Pair`,c,J(t,{start:a.start,end:o?n.end:s.end}))}),i=e.other;if(i){let e=$s(t,q(t,i)),a=Te(e.start,`OTHER`);r.push(A(`$Pair`,[void 0,N(i)],J(t,{start:a,end:n.end})))}return A(`$Case`,r,J(t,n))},Te=(e,n)=>{for(let r=e;r>=0;r--)if(qs(t,r,n))return r;return e},Ee=e=>{let n=q(t,e),r=J(t,n),i=[N(e.function)],a=A(`$Except`,i,r),o=q(t,e.function),s={value:cc(t,o.end+1,n.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=cc(t,s.value,n.end,`!`),o=$s(t,q(t,e.value)),c=J(t,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let n=De(l.value,e.name);return l.value=n+1,le(e.name,tc(t,n))}let r=cc(t,l.value,n.end,`[`),i=Zs(t,r);return l.value=i+1,e.args.length===1?N(e.args[0]):A(`$Tuple`,e.args.map(N),J(t,{start:r,end:i}))}),d=A(`$Seq`,u,c),m=A(`$Pair`,[d],c);p.push(m),f.push(a),m.operands.push(N(e.value)),p.pop(),f.pop(),i.push(m),s.value=o.end+1}),a},De=(e,n)=>{for(let r=e;r<t.tokens.length;r++)if(t.tokens[r].text===n&&t.tokens[r].kind!==`String`)return r;return e},Oe=(e,n)=>{let r=q(t,n),i={value:r.start+1},o=n.fields.map((e,r)=>{let o=De(i.value,e.name),s=$s(t,q(t,e.value));return i.value=s.end+1,n.fields.slice(0,r).some(t=>t.name===e.name)&&a(tc(t,o),`Non-unique fields in constructor.`),A(`$Pair`,[le(e.name,tc(t,o)),N(e.value)],J(t,{start:o,end:s.end}))}),s=A(e,o,J(t,r));return E.records.push(s),s},ke=e=>({line:t.tokens[e].line,column:t.tokens[e].column}),Ae=e=>{let n=[],r=e;for(;t.tokens[r]?.kind===`Identifier`;){let e=qs(t,r+1,`(`)?Zs(t,r+1):r,i=t.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(n.push({name:t.tokens[r].text,arity:i,location:{...ke(r),range:{module:t.name,start:ke(r),end:ke(e)}}}),!qs(t,e+1,`,`))break;r=e+2}return n},je=e=>{let n=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Re(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Re(e)}))],r=q(t,e).start,i=$s(t,q(t,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=n.some(t=>t.span.start<=e&&e<=t.span.end);qs(t,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:Ae(e+1)},span:{start:e,end:e}})}return[...n,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Me=e=>{let t=ws();return D(t,()=>{s.curLevel++,s.unresolvedCount[s.curLevel]=0;let n=[],r=[];je(e).forEach(e=>{e.kind===`Recursive`?Ue(e.declarations):e.kind===`Instance`?Ge(e.instance,n,r):e.definition.kind===`Function`?Ve(e.definition,n):ze(e.definition,n)}),P(),s.curLevel=Math.max(s.curLevel-1,0);let i=N(e.body);return{...K(c()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:C(e)}})},Ne=e=>{let n=q(t,e),r=J(t,n);return D(ws(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=sc(t,n.start,n.end,a),s=a.map((e,r)=>ie(e,0,tc(t,i.kind===`Name`?n.start:o[r]),!0)),c=M(s,e.body);return A(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=N(e.set),s=q(t,e.set),c=sc(t,n.start,s.start,a),l=a.map((e,n)=>ie(e,0,tc(t,c[n]),!0)),u=M(l,e.body);return A(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},Pe=e=>{if(fc(e.operator)||pc(e.operator)||e.args.length>2||hc(i,uc(e.operator))!==void 0)return;let n=q(t,e);if(t.tokens[n.start].text===e.operator&&qs(t,n.start+1,`(`))return;let r=$s(t,q(t,e.args[0])),a=e.args.length===1&&r.start!==n.start,o=a?n.start:r.end+1,s=rc(t,o);return{index:o,name:a&&s===`-`?`-.`:s,fixity:a?`prefix`:e.args.length===2?`infix`:`postfix`}},N=e=>{let n=C(e);switch(e.kind){case`Number`:return{...K(c()),kind:`Numeral`,value:jc(e.text??String(e.value)),location:n};case`Decimal`:{let[t,r]=e.text.split(`.`),i=BigInt(t+r),a=i<=9223372036854775807n;return{...K(c()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:t,fractionalPart:r,location:n}}case`String`:return le(e.value,n);case`Identifier`:{let t=he(e);return ge(t),t}case`Apply`:{let r=Pe(e);if(r!==void 0)return a(tc(t,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),a(n,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...se(),isAbsent:!0};let i=he(e);return(pc(e.operator)||fc(e.operator))&&ge(i),i}case`Bracket`:return a(tc(t,q(t,e).start),"Unsupported expression type `['."),{...se(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=t.tokens[q(t,e).start].text;return a(n,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${kc(e,r)}'.`),{...se(),isAbsent:!0}}case`And`:case`Or`:return Ce(e);case`Prime`:return A(`'`,[N(e.expression)],n);case`Unchanged`:return A(`UNCHANGED`,[N(e.expression)],n);case`Enabled`:return A(`ENABLED`,[N(e.expression)],n);case`Always`:return A(`[]`,[N(e.expression)],n);case`Eventually`:return A(`<>`,[N(e.expression)],n);case`If`:return A(`$IfThenElse`,[N(e.condition),N(e.consequent),N(e.alternative)],n);case`Case`:return we(e);case`Let`:return Me(e);case`Forall`:case`Exists`:{let r=q(t,e);return D(ws(),()=>{let t=ve(e.bounds,r.start),i=M(t.bounded.flat(),e.body);return A(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],n,t)})}case`UnboundedQuantifier`:{let r=q(t,e),i=q(t,e.body),a=sc(t,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return D(ws(),()=>{let r=e.names.map((e,n)=>ie(e,0,tc(t,a[n]),!0)),i=M(r,e.body);return A(o,[i],n,{unbounded:r})})}case`Choose`:return Ne(e);case`SetEnumeration`:return A(`$SetEnumerate`,e.elements.map(N),n);case`Tuple`:return A(`$Tuple`,e.elements.map(N),n);case`SetFilter`:{let r=N(e.bound.set),i=q(t,e);return D(ws(),()=>{let t=Fe([e.bound],i.start,[r]),a=M(t.bounded.flat(),e.predicate);return A(`$SubsetOf`,[a],n,t)})}case`SetMap`:{let r=q(t,e.expression);return D(ws(),()=>{let t=ve(e.bounds,r.end+1),i=M(t.bounded.flat(),e.expression);return A(`$SetOfAll`,[i],n,t)})}case`FunctionConstruction`:{let r=q(t,e);return D(ws(),()=>{let t=ve(e.bounds,r.start),i=M(t.bounded.flat(),e.body);return A(`$FcnConstructor`,[i],n,t)})}case`FunctionSet`:return A(`$SetOfFcns`,[N(e.domain),N(e.range)],n);case`Record`:return Oe(`$RcdConstructor`,e);case`RecordSet`:return Oe(`$SetOfRcds`,e);case`Except`:return Ee(e);case`ExceptAt`:{let e=f[f.length-1],t=p[p.length-1];return e===void 0||t===void 0?(a(n,`@ used where its meaning is not defined.`),se()):{...K(c()),kind:`At`,except:e,component:t,location:t.location}}case`FunctionApplication`:{let t=N(e.function);if(hs(t))return t;ge(t);let r=e.args.length===1?N(e.args[0]):A(`$Tuple`,e.args.map(N),n);return A(`$FcnApply`,[t,r],n)}case`FieldAccess`:{let r=N(e.record),i=q(t,e);return A(`$RcdSelect`,[r,le(e.field,tc(t,i.end))],n)}case`Product`:return A(`$CartesianProd`,e.factors.map(N),n);case`BoxAction`:case`AngleAction`:return A(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[N(e.action),N(e.subscript)],n);case`WeakFairness`:case`StrongFairness`:return A(e.kind===`WeakFairness`?`$WF`:`$SF`,[N(e.subscript),N(e.action)],n);case`Label`:return Ie(e);case`Subexpression`:return he(e)}},Fe=(e,n,r)=>{let i=_e(e),a={value:n};return{bounded:i.map(e=>{let n=q(t,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=sc(t,a.value,n.start,r);return a.value=n.end+1,r.map((e,n)=>ie(e,0,tc(t,i[n]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ie=e=>{let n=C(e),r=g.at(-1);if(r===void 0)return a(n,`Label not in definition or proof step.`),se();if(b.isDeclared.slice(2,b.depth+1).some(Boolean))return a(n,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),se();if(f.length>0&&p.length>0)return a(n,`Labels inside EXCEPT clauses are not yet implemented.`),se();v();let o=N(e.body),s=y(),l=sc(t,q(t,e).start,q(t,e.body).start,e.params),u=e.params.map((n,r)=>{let o=hc(i,n);if(o?.kind===`FormalParam`)return o;let s=tc(t,l[r]);return a(s,`Illegal parameter ${n} of label \`${e.name}'.`),ie(n,0,s,!1)}),d={...K(c()),kind:`Label`,name:e.name,params:u,body:o,labels:s,isAssumeProve:!1,location:n},m=/* @__PURE__ */ new Set;if(u.forEach(e=>{m.has(e)&&a(n,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),m.add(e)}),r.params.flat().forEach(e=>{m.delete(e)||a(n,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),m.size>0){let e=[...m].map(e=>`${e.name} `).join(``);a(n,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?a(n,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let h=b.goal;return h&&S.set(d,{scope:h,clause:b.goalClause}),d},Le=(e,n,r)=>{let i={value:n.start};return e.params.map(e=>{let n=e.location?Ys(t,e.location):De(i.value,e.name),a=L(n,e.arity);return i.value=a.end+1,ie(uc(e.name),e.arity,J(t,a),r)})},Re=e=>{let n=T(e.location);return e.isLocal&&!qs(t,n.start,`LOCAL`)&&qs(t,n.start-1,`LOCAL`)?{start:n.start-1,end:n.end}:n},ze=(e,n)=>{let r=Re(e),o=J(t,r),c=uc(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},d=D(ws(),()=>{let t=Le(e,l,!0),n=hc(i,c);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===s.curLevel?e||a(o,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):a(o,`Recursive operator ${c} defined at wrong LET/IN level.`)}else n!==void 0&&a(o,`Operator ${c} already defined or declared.`);return v(),{params:t,body:N(e.body),existing:n}}),f=y(),p=d.existing,m=d.params,h=oc(t,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===s.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Be(p,d.body,o,h),E.definitions.push(p),n?.push(p);return}let g=ae({name:c,params:m,body:d.body,isLocal:e.isLocal,location:o,preComments:h,labels:f});u(i,g),O(g),E.definitions.push(g),n?.push(g)},Be=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(s.unresolvedCount[s.curLevel]--,s.unresolvedSum--)},Ve=(e,n)=>{let r=Re(e),o=J(t,r),c=ws(),l=e.isLocal?r.start+1:r.start,f=D(c,()=>ve(e.bounds,l+1)),p=hc(i,e.name),m=D(c,()=>ie(e.name,0,o,p===void 0)),h=A(`$NonRecursiveFcnSpec`,[],o,{unbounded:[m],...f}),g=p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined,_=g&&p.letInLevel===s.curLevel;_?p.arity!==0&&a(o,`Function ${p.name} has operator arguments in its RECURSIVE declaration.`):g?a(o,`Recursive function ${e.name} defined at wrong LET/IN level.`):p!==void 0&&a(o,`Function name \`${e.name}' already defined or declared.`);let b=oc(t,r.start),x=p===void 0?ae({name:e.name,params:[],body:h,isLocal:e.isLocal,location:o,preComments:b}):p.kind===`OpDef`&&(_||!g)?p:void 0;_?p.arity===0&&Be(p,h,o,b):p===void 0&&x!==void 0&&(u(i,x),O(x)),x!==void 0&&(E.definitions.push(x),n?.push(x)),d.unshift({name:e.name,node:h}),v();let S=()=>M(f.bounded.flat(),e.body),ee=x===void 0?S():D(c,S),C=y();x!==void 0&&(x.labels=C),d.shift(),h.operands=[ee],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},He=[],Ue=e=>{s.unresolvedSum===0&&s.recursiveSectionCount++,s.unresolvedCount[s.curLevel]+=e.length,s.unresolvedSum+=e.length,e.forEach(e=>{let n=R(e);c();let r=Array.from({length:e.arity},()=>ie(``,0,void 0,!1)),a=ae({name:uc(e.name),params:r,location:J(t,n),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:s.recursiveSectionCount,letInLevel:s.curLevel});u(i,a),He.push(a),E.opDefsInRecursiveSection.push(a)})},P=()=>{s.unresolvedCount[s.curLevel]!==0&&(He.filter(e=>e.letInLevel===s.curLevel&&!e.isDefined).forEach(e=>a(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),s.unresolvedSum-=s.unresolvedCount[s.curLevel])},We=(e,n,o)=>{c();let s=Ss(n.table).filter(e=>e.kind===`OpDecl`),l=s.flatMap(e=>{let t=hc(i,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?oe(t,[],o):j(t,o),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?Ds(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&a(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Re(e),f={value:cc(t,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let r=cc(t,f.value,d.end,e.name);r!==-1&&(f.value=q(t,e.expression).end+1);let i=Os(n,uc(e.name));if(i?.kind!==`OpDecl`){a(r===-1?o:tc(t,r),`Identifier '${r===-1?e.name:rc(t,r)}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`);return}let s=i.arity===0?N(e.expression):xe(e.expression,i);u(i,s);let c=l.find(e=>e.op.name===i.name);c&&!c.isImplicit?a(C(e.expression),`Multiple substitutions for symbol '${i.name}' in substitution.`):c?(c.expr=s,c.isImplicit=!1):l.push({op:i,expr:s,isImplicit:!1})}),l.filter(e=>e.isImplicit&&r.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!l.some(t=>t.op.name===e.name)).forEach(e=>a(o,`Substitution missing for symbol ${e.name} declared at ${ms(e.location)} \nand instantiated in module ${E.name}.`)),l},F=(e,t,n,r,i,o=E)=>(hs(n)&&a(i,e===`SubstIn`?`Substitution error, probably due to error
42
- in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...K(c()),kind:e,substs:t,body:n,instantiatingModule:o,instantiatedModule:r,location:i}),Ge=(e,n,a)=>{let o=Re(e),s=J(t,o),l=oc(t,o.start),d=e.name??``,f=ws(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&i.contexts.push(f);let m=Le(e,{start:p,end:o.end},e.params.length>0),h=ne(e.module),g=h.context,_=We(e,g,s);e.params.length>0&&i.contexts.pop(),Ss(g.table).forEach(t=>{if(t.kind!==`OpDef`||t.isLocal||t.defKind!==`UserDefined`&&t.defKind!==`ModuleInstance`)return;let r=[...m,...t.params??[]],a=`${d}!${t.name}`,o=t.defKind===`UserDefined`?ae({name:a,params:r,body:_.length>0&&t.body?F(`SubstIn`,_,t.body,h,s):t.body,isLocal:e.isLocal,location:s,source:t.source??t,preComments:l,labels:t.labels}):ae({defKind:`ModuleInstance`,name:a,params:r,isLocal:e.isLocal,location:s,module:t.module,source:t.source??t,preComments:l});u(i,o),t.defKind===`UserDefined`&&O(o),(n??E.definitions).push(o)}),Ss(g.table).forEach(t=>{if(t.kind!==`ThmOrAssumpDef`||t.isLocal)return;let r=_.length>0?F(`APSubstIn`,_,t.body,h,s):t.body,a={...K(c()),kind:`ThmOrAssumpDef`,name:`${d}!${t.name}`,isTheorem:t.isTheorem,body:r,params:[...m,...t.params],isLocal:e.isLocal,location:s,module:E,source:t.source??t,labels:t.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};u(i,a),(n??E.definitions).push(a)});let v={...K(c()),kind:`Instance`,name:d,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(a??E.topLevel).push(v);let y=ae({defKind:`ModuleInstance`,name:d,params:m,isLocal:e.isLocal,location:s,preComments:l});u(i,y),r.version!==`1.7.4`&&n?.push(y)},Ke=(e,n=!0,r)=>{let a=Re(e),o=r??J(t,a),s=oc(t,a.start),l=ne(e.module),d=l.context,f=We(e,d,o),p=e.isLocal,m=yc(l);Ss(d.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=ae({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return u(i,r),r},n=()=>(u(i,e),e),r=e.module===void 0||yc(e.module),a=m||r?p?t(e.module,e.body):n():t(E,e.body&&F(`SubstIn`,f,e.body,l,o));E.definitions.push(a),O(a)}),Ss(d.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let t=(t,n)=>{let r={...e,...K(c()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return u(i,r),r},r=m?p?t(e.module,e.body):(u(i,e),e):yc(e.module)?p?t(E,e.body):e:t(E,F(`APSubstIn`,f,e.body,l,o));n&&E.definitions.push(r)});let h={...K(c()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:l,substs:f,location:o};return n&&E.topLevel.push(h),h},qe=e=>{let n=te(e.name)??(e.name===E.name?E:void 0);return n===void 0?(a(tc(t,Ys(t,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[n]},I=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return qe(e);let t=Fs(e);if(t===void 0||!Is(t))return[N(e)];let n=me(e,0,!0,!1);if(n.kind===`ThmOrAssumpDef`)throw new w(`Expected a fact`);return[n]}),Je=e=>qs(t,e.start,`(`)&&Zs(t,e.start)===e.end,Ye=e=>$s(t,q(t,e)),Xe=(e,n)=>Ye(e.args[0]).start===n.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:t.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Ze=(e,n)=>Je(n)?`N_ParenExpr`:e.kind===`String`?rc(t,n.start):e.kind===`Apply`?Xe(e,n):Ec.get(e.kind),Qe=(e,t)=>{if(e.kind===`String`&&!Je(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Ze(e,t);return n===void 0||Dc.has(n)?void 0:!0},$e=(e,n)=>{let r=(e,t=Ye(e))=>({last:t,lastKind:Ze(e,t)});if(Je(n))return{hasChildlessFirstChild:!1,...r(e,{start:n.start+1,end:n.end-1})};switch(e.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(e.kind===`If`?e.condition:e.action)};case`Tuple`:case`SetEnumeration`:{let i=e.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:n.end,end:n.end},lastKind:t.tokens[n.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:Qe(e.expression,Ye(e.expression)),last:{start:n.end,end:n.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=e.kind===`FunctionApplication`?e.function:e.record,r=Ye(n),i=r.end+1;return{hasChildlessFirstChild:Qe(n,r),last:{start:i,end:i},lastKind:t.tokens[i].text}}case`Apply`:{let t=Xe(e,n);if(t===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:n.start+1,end:n.end},lastKind:`N_OpArgs`};if(t===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:n.start+1,end:n.end})};let i=Ye(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:Qe(e.args[0],i),last:{start:a,end:a},lastKind:t===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},et=e=>{let n=$s(t,q(t,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Je(n))return!1;let r=$e(e,n);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=J(t,r.last);return r.hasChildlessFirstChild&&a(J(t,n),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?a(i,"Selector `!(...)' should not have argument(s)."):(a(i,`Unexpected token found.`),a(i,`Need name or step number here, not \`${r.lastKind}'.`)),a(J(t,n),`DEF clause entry should describe a defined operator.`),!0},tt=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return qe(e);if(et(e))return[];let t=me(e.kind===`OperatorReference`?{kind:`Identifier`,name:e.operator,location:e.location}:e,-1,!1,!0);return t.kind===`OpDef`||t.kind===`ThmOrAssumpDef`&&!t.name.startsWith(`<`)?[t]:(a(C(e),`DEF clause entry should describe a defined operator.`),[])}),nt=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||a(t,`Empty BY, USE, or HIDE`)},rt=e=>{let n=J(t,T(e.location));nt(e,n);let r=I(e.facts),i=tt(e.defs);return r.length+i.length===0&&a(n,`Empty USE or HIDE statement.`),e.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(e=>a(e.location,`The only expression allowed as a fact in a HIDE is
43
- the name of a theorem, assumption, or step.`)),{...K(c()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:n}},it=e=>{let n=T(e.location),r=e.set&&N(e.set),a=De(n.start,e.name),o=dc[e.level],s={...K(c()),levelChecked:1,level:o.level,kind:`OpDecl`,name:uc(e.name),arity:e.arity,declKind:o.declKind,location:J(t,L(a,e.arity)),module:E};return u(i,s),{...K(c()),kind:`NewSymb`,declaration:s,set:r,location:J(t,n)}},at=(e,n,r)=>{let o=T(e.location),s=ic(t,o.start-1),l=q(t,e.conclusion).start,u=t.tokens.findLastIndex((e,t)=>t<l&&e.kind===`Keyword`&&e.text===`PROVE`),d=J(t,{start:s?o.start-1:o.start,end:o.start});s!==ic(t,u-1)&&a(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=c();n>1&&i.contexts.push(ws()),s&&i.contexts.some(e=>_.has(e))&&a(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||_.add(mc(i));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};b.depth=n,b.isDeclared[n]=!1,n===1&&(b.goal=r&&p,b.goalClause=0);let m=e.assumptions.map((e,t)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?at(e,n+1):r?it(e):N(e);return b.depth=n,r&&(b.isDeclared[n]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[t]||r),n===1&&b.goalClause++,i}),h=N(e.conclusion);n>1&&i.contexts.pop(),b.depth=n-1,n===1&&(b.goal=void 0);let g={...K(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:J(t,{start:s?o.start-1:o.start,end:o.end})};return x.set(g,p),g},ot=(e,t,n,r,i,a=!0)=>({...K(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:E,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),st=e=>{let n=J(t,T(e.location));e.kind===`By`&&nt(e,n);let r=e.kind===`By`?I(e.facts):[],i=e.kind===`By`?tt(e.defs):[];return e.kind===`By`&&c(),e.kind===`By`&&r.length+i.length===0&&a(n,`Empty BY`),{...K(c()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:n}},ct=(e,n)=>{let r=e.body,a=J(t,n);switch(r.kind){case`Have`:return{node:A(`$Have`,[N(r.expression)],a),isPick:!1};case`Case`:return{node:A(`$Pfcase`,[N(r.expression)],a),isPick:!1};case`Witness`:return{node:A(`$Witness`,r.expressions.map(N),a),isPick:!1};case`Qed`:return{node:A(`$Qed`,[],a),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&i.contexts.push(ws());let s=e=>r.kind===`Pick`?[M(e,r.body)]:[];if(r.bounds.length>0){let t=ve(r.bounds,n.start),i=s(t.bounded.flat());return{node:A(o,i,a,t),isPick:e}}let c=sc(t,n.start,n.end+1,r.names),l=r.names.map((e,n)=>ie(e,0,tc(t,c[n]),!0)),u=s(l);return{node:A(o,u,a,{unbounded:l}),isPick:e}}}},lt=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let n=$s(t,q(t,e.args[0])),r=q(t,e).start;return n.start===r&&!qs(t,n.end+1,`(`)},ut=e=>{if(e.kind!==`Steps`)return st(e);let n=ws();i.contexts.push(n);let r=[],a=[],o={previousRight:void 0},s=(e,n,i)=>{if(e.kind===`Define`){let n=e.definitions.map(e=>{let t=[];e.kind===`Instance`?Ge(e,t,r):e.kind===`Function`?Ve(e,t):ze(e,t);let n=t[e.kind===`Instance`?t.length-1:0];if(n?.kind!==`OpDef`)throw new w(`A DEFINE step defines no operator`);return n});return{...K(c()),kind:`DefStep`,defs:n,location:J(t,i)}}if(e.kind===`Use`||e.kind===`Hide`)return{...rt(e),location:J(t,n)};if(e.kind===`Instance`)return Ke(e,!1,J(t,i))},l=e.steps.map(e=>{let n=T(e.location),r=Qs(t,e.head),l={start:r.start+1,end:r.end},d=e.body;e.name!==void 0&&v();let f=e.name===void 0?void 0:c();d.kind!==`Assert`&&(o.previousRight=void 0);let p=s(d,n,l);if(p!==void 0)return e.name!==void 0&&u(i,ae({defKind:`NumberedProofStep`,name:e.name,location:J(t,n),labels:y(),step:p})),p;let m=d.kind===`Assert`&&d.statement.kind===`AssumeProve`;m&&(o.previousRight=void 0);let h=d.kind===`Assert`&&d.isSuffices,g=ws(),_=d.kind===`Assert`?{node:(n=>{if(n.kind===`AssumeProve`){let t=D(g,()=>at(n,1,e.name===void 0?void 0:{isSuffices:h}));return t.isSuffices=h,t}if(h){let e=N(n);return A(`$Suffices`,[e],J(t,l))}let r=o.previousRight,i=r!==void 0&&n.kind===`Apply`&&lt(n)&&n.args[0].kind===`ExceptAt`,a=i?N(n.args[1]):void 0,s=i?oe(ue(n.operator,C(n)),[A(`$Nop`,[r],C(n.args[0])),a],C(n)):N(n),c=s.kind===`OpAppl`?s.operands[1]:void 0;return o.previousRight=lt(n)?c:void 0,s})(d.statement),isPick:!1}:ct(e,l);if(_===void 0)throw new w(`Unexpected proof step ${d.kind}`);let b=_.isPick?i.contexts.pop():void 0,x=e.name===void 0||f===void 0?void 0:ot(f,e.name,_.node,tc(t,Ys(t,e.location)),y());x&&u(i,x);let S=m&&!h;S&&i.contexts.push(g);let E=e.proof&&ut(e.proof);return S&&i.contexts.pop(),ee(_.node),m&&h&&(a.push(g),i.contexts.push(g)),b?.symbols.forEach(e=>u(i,e)),{...K(c()),kind:`Theorem`,definition:x,body:_.node,proof:E,isSuffices:h,location:J(t,n)}});return a.forEach(()=>{i.contexts.pop()?.symbols.forEach(e=>Es(n,e))}),i.contexts.pop(),{...K(c()),kind:`NonLeafProof`,steps:l,instances:r,proofLevel:e.level,location:J(t,T(e.location))}},dt=e=>{let n=J(t,T(e.location)),r=e.statement,a=ws();e.name!==void 0&&v();let o=e.name===void 0?void 0:c();r.kind===`AssumeProve`&&i.contexts.push(a);let s=r.kind===`AssumeProve`?at(r,1,e.name===void 0?void 0:{isSuffices:!1}):N(r),l=e.name===void 0||o===void 0?void 0:ot(o,e.name,s,n,y());l&&(r.kind===`AssumeProve`&&i.contexts.pop(),u(i,l),E.definitions.push(l),r.kind===`AssumeProve`&&i.contexts.push(a));let d=e.proof&&ut(e.proof);r.kind===`AssumeProve`&&i.contexts.pop(),ee(s);let f={...K(c()),kind:`Theorem`,definition:l,body:s,proof:d,isSuffices:!1,location:n};E.topLevel.push(f)},ft=e=>{let n=T(e.location),r=J(t,n);e.name!==void 0&&v();let a=N(e.expression),o=e.name===void 0?void 0:ot(c(),e.name,a,r,y(),!1);o&&(u(i,o),E.definitions.push(o));let s={...K(c()),kind:`Assume`,definition:o,body:a,location:r};E.topLevel.push(s)},L=(e,n)=>n===0?{start:e,end:e}:qs(t,e,`_`)?{start:e,end:qs(t,e+2,`_`)?e+2:e+1}:qs(t,e+1,`(`)?{start:e,end:Zs(t,e+1)}:{start:e,end:qs(t,e+1,`_`)?e+1:e},R=e=>L(T(e.location).start,e.arity),pt=(e,n)=>{let r=R(e);e.name===`@`&&n===3&&a(J(t,r),`Attempted to declare '@' as a variable.`);let o={...K(c()),levelChecked:1,level:+(n===3),kind:`OpDecl`,name:uc(e.name),arity:e.arity,declKind:n,location:J(t,r),module:E};return n===2&&(o.levelParams.add(o),o.allParams.add(o)),u(i,o),o};e.extends.forEach(e=>{let t=ne(e);E.extendees.push(t);let n=mc(i);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?ks(n,e.name):Os(n,e.name);t===void 0?Es(n,e):t!==e&&t.kind!==e.kind?a(e.location,`The ${_c(e)} of '${e.name}' conflicts with \nits ${_c(t)} at ${ms(t.location)}.`):t!==e&&!vc(t,e)&&o(e.location,`Warning: the ${_c(t)} of '${e.name}' conflicts with \nits ${_c(t)} at ${ms(t.location)}.`)}),E.topLevel.push(...t.topLevel)});let mt=(e,n)=>{s.unresolvedSum!==0&&a(J(t,T(e)),`${n} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:mt(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>pt(e,3));break;case`Constants`:mt(e.location,`A declaration`),e.declarations.forEach(e=>pt(e,2));break;case`Recursive`:Ue(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Ve(e.definition,void 0):ze(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?Ke(e.instance):Ge(e.instance,void 0,void 0);break;case`Assumption`:mt(e.assumption.location,`An ASSUME`),ft(e.assumption);break;case`Theorem`:mt(e.theorem.location,`A THEOREM`),dt(e.theorem);break;case`Use`:mt(e.use.location,`A USE or HIDE`),E.topLevel.push(rt(e.use));break;case`Module`:{mt(e.module.location,`A MODULE `);let n={contexts:[...i.contexts,ws()]},r=re(e.module,t,E,n),o=te(r.name);o===void 0?Es(mc(i),r):o!==r&&a(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${ms(o.location)}.`);break}}}),P(),E},ae=y.map(e=>{r.onAnalyze?.(e),l.id=Array.from({length:4},c)[1];let t=v(e,void 0),n=ws();p.toReversed().forEach(e=>Es(n,e));let a=re(t.module,t.file,void 0,{contexts:[n]});return h.set(e,a),r.onModule?.(a,i),a});return{root:ae[ae.length-1],modules:ae,messages:i}},jc=e=>{let t=e.toLowerCase(),n=t.startsWith(`\\b`)?2:t.startsWith(`\\o`)?8:t.startsWith(`\\h`)?16:10;return[...n===10?t:t.slice(2)].reduce((e,t)=>e*BigInt(n)+BigInt(parseInt(t,n)),0n).toString()},Mc=(e,t,n,r)=>ps(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},Nc=(e,t,n)=>`${e.id}:${t}:${n.id}`,Pc=(e,t,n,r)=>{e.set(Nc(t,n,r),{op:t,index:n,param:r})},Fc=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Ic=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Lc=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Ic(e,r,t)})},Rc=(e,t)=>`${e.id}:${t}`,zc=(e,t,n,r)=>{let i=Rc(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Bc=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&zc(e,t.param,t.position,t.level)})},Vc=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Hc=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Lc(e.levelConstraints,t.levelConstraints),Bc(e.argLevelConstraints,t.argLevelConstraints),Fc(e.argLevelParams,t.argLevelParams)},Uc=(e,t)=>t.includes(e.op)||t.includes(e.param),Wc=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Gc=e=>e.kind!==`Module`,Kc=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,qc=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Jc=(e,t)=>e.kind===`OpDef`?e.weights[qc(e,t)]??0:0,Yc=(e,t)=>e.maxLevels[qc(e,t)]??3,Xc=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,Zc=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[qc(e,t)]??!0:e.isLeibnizArg[t]??!0,Qc=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,$c=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],el=(e,t)=>t.find(t=>t.op===e)?.expr,tl=(e,t,n)=>{let r=el(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},nl=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=el(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Wc(i.op))return;let a=i.op;tl(e.param,t,!1).forEach(t=>Pc(n,a,e.index,t))}),n},rl=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;tl(r,t,!1).forEach(e=>Ic(a,e,i))}),e.argLevelParams.forEach(e=>{let n=el(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=Yc(n.op,e.index);tl(e.param,t,!1).forEach(e=>Ic(a,e,o))}),a},il=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=el(e.param,t);n===void 0?zc(i,e.param,e.position,e.level):n.kind===`OpArg`&&Wc(n.op)&&zc(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=el(e.param,t);if(a===void 0)return;let o=el(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Wc(s)&&(X(a,n,r),zc(i,s,e.index,a.level))}),i},al=(e,t)=>js(e,3).length>0||(ml(e,t),As(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),ol=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(Rc(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(Nc(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(Rc(t,n))}),Fc(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},sl=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>Yc(t,o)&&(n&&X(a,r,i)&&Mc(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!Kc(a.op)))return;let s=a.op;X(s,r,i);let c=Ds(s);for(let l=0;l<c;l++){let c=Xc(t,o,l);Yc(s,l)>=c||(n&&X(a,r,i)&&Mc(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!Qc(t,o,l,u)||n.level<=Yc(s,u)||(X(a,r,i)&&X(n,r,i)&&Mc(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&Mc(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${ms(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},cl=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Lc(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Lc(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Lc(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=Yc(t,r);n?.levelParams.forEach(t=>Ic(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!Kc(n.op))return;let o=n.op;X(o,r,i);let s=Ds(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!Qc(t,a,r,i))continue;let s=Yc(o,i);n?.levelParams.forEach(t=>Ic(e.levelConstraints,t,s)),!o.isLeibniz&&!Zc(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&Kc(n.op)&&(X(n.op,r,i),Ic(e.levelConstraints,t.param,Yc(n.op,t.index)))}),Bc(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Bc(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Bc(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Wc(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)zc(e.argLevelConstraints,i,n,Xc(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Qc(t,r,a,o)&&zc(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),zc(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&Fc(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>Fc(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>Pc(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Wc(a.op)&&Pc(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Wc(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Qc(t,r,a,o)&&n.levelParams.forEach(t=>Pc(e.argLevelParams,i,o,t))})})},ll=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),ul=(e,t)=>{let n=(n,r)=>{Mc(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=ll.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},dl=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(Kc(i)){let r=X(i,t,n);sl(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Jc(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(Jc(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Zc(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set($c(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),cl(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Lc(e.levelConstraints,t.levelConstraints),zc(e.argLevelConstraints,i,n,t.level),Bc(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Pc(e.argLevelParams,i,n,t)),Fc(e.argLevelParams,t.argLevelParams)});return ul(e,n),e.levelCorrect},fl=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),ol(e,i,r),e.levelCorrect},pl=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),ol(e,e.params,e.body)),e.levelCorrect),ml=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),fl(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||Mc(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),fl(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(ml(e,t)));let a=As(e);return a.forEach(e=>i(fl(e,1,t))),Ms(e).forEach(e=>i(pl(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),al(e,t)||js(e,2).forEach(t=>Ic(e.levelConstraints,t,0)),a.forEach(t=>{Lc(e.levelConstraints,t.levelConstraints),Bc(e.argLevelConstraints,t.argLevelConstraints),Fc(e.argLevelParams,t.argLevelParams,e=>!Uc(e,t.params??[]))}),e.topLevel.forEach(t=>{Lc(e.levelConstraints,t.levelConstraints),Bc(e.argLevelConstraints,t.argLevelConstraints),Fc(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},hl=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Gc(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Hc(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),gl=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&Mc(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&Mc(t,e.body.location,`Non-constant CASE for temporal goal.`),gl(e.proof,t)):n===`$Qed`&&gl(e.proof,t)})},_l=(e,t,n,r,i,a)=>{e.levelConstraints=rl(t,n,r,i,a),e.argLevelConstraints=il(t,n,i,a),e.argLevelParams=nl(t.argLevelParams,n)},vl=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;ml(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=al(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&Mc(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||Mc(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&Mc(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(Rc(i.op,t))?.level;a===void 0||Yc(o,t)>=a||(s&&Mc(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=Yc(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&Mc(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return Lc(e.levelConstraints,rl(r,e.substs,i,t,n),a),e.substs.forEach(t=>Lc(e.levelConstraints,t.expr.levelConstraints,a)),Bc(e.argLevelConstraints,il(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Bc(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),Fc(e.argLevelParams,nl(r.argLevelParams,e.substs),t=>!Uc(t,e.params)),e.substs.forEach(t=>Fc(e.argLevelParams,t.expr.argLevelParams,t=>!Uc(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Gc(e))return ml(e,n);switch(e.kind){case`OpAppl`:return dl(e,t,n);case`OpDef`:return fl(e,t,n);case`ThmOrAssumpDef`:return pl(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,Vc(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),Lc(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Lc(e.levelConstraints,t.levelConstraints)),Bc(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Bc(e.argLevelConstraints,t.argLevelConstraints)),Fc(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];Fc(e.argLevelParams,t.argLevelParams,e=>!Uc(e,n))}),e.instances.forEach(t=>Fc(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,Vc(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>Hc(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,tl(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,tl(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=al(e.instantiatedModule,n);return _l(e,r,e.substs,i,t,n),e.levelCorrect}case`Instance`:return vl(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,Vc(e,e.body),e.level!==0&&Mc(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=hl(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&Mc(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&gl(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return hl(e,e.facts,t,n);case`NonLeafProof`:return hl(e,[...e.steps,...e.instances],t,n);case`DefStep`:return hl(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,Mc(n,e.location,`Level error:
44
- Temporal formula used as set.`)),Vc(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Hc(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Ic(e.levelConstraints,t,2)})),e.levelCorrect}},yl=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},bl=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),xl=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&bl.get(e)===t.name||n(t))return!0}}return yl(e).some(n)};return n(e)},Sl=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Cl=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},wl=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(Sl(t).map(e=>Cl(e)?.value));return Sl(e).every(e=>n.has(Cl(e)?.value))},Tl=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),Tl(e,t))}),t),El=e=>{let t=[...[...Tl(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>wl(e,n)).flatMap(Sl).some(xl)?[]:Sl(n).flatMap(t=>{let n=Cl(t),r=n&&Os(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${ms(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},Dl=e=>`${ms(e.location)}\n\n${e.text}`,Ol=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${Dl(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Dl(e)}\n\n\n`)].join(``)},kl=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Al=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},jl=e=>{try{return d(ac(e))}catch(e){if(e instanceof w)return;throw e}},Ml=(e,t)=>t===`1.7.4`&&f(e)!==void 0?void 0:jl(e)?.name,Nl=(e,t=()=>void 0,n={})=>{let r=ge(e,`.tla`),i=m(n.version),o=n.fileName??r,s=xe(e)?we(e,`utf8`):i.get(r),c=[],l=e=>{c.push(e),n.onPrint?.(e)},u=e=>l(`${e}\n`),d=n.version===`1.7.4`,f=d&&n.isXmlExport,p=e=>{n.isXmlExport||u(e)},h=n.describeFile,g=/* @__PURE__ */ new Map([[r,xe(e)?`file`:`standard`]]),_={value:!1},v=[],y={isReported:!1,isAborted:!1},b=so(ya(),u),x=/* @__PURE__ */ new Map,S=[],C=()=>S.splice(0).forEach(e=>e.isError?n.onPrintError?.(`${e.text}\n`):u(e.text)),w=e=>{let t=x.get(e),r=t?.module.location.range;if(t===void 0||r===void 0)return;let i=t.text.split(/\r\n|\r|\n/),a=ls(b,i.slice(r.start.line-1,r.end.line),n.version),o=a.has(`TLA_DIVERGENCE_EXISTS`),s=a.has(`PCAL_DIVERGENCE_EXISTS`),c=o===s?void 0:`The ${o?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(d){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?a.has(`ERROR_ENCOUNTERED`)&&S.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):S.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=o&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(a.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!a.has(`ERROR_ENCOUNTERED`)||o||s;v.some(e=>e.text===l)||v.push({location:e,text:l,isWarning:u})},T=(e,t)=>{if(n.isXmlExport||x.has(e))return;let r=jl(t);if(r===void 0||r.name!==e)return;let i=[...x.values()].filter(t=>Al(t.module).includes(e));x.set(e,{text:t,module:r}),i.forEach(()=>w(e)),Al(r).filter(t=>t!==e&&x.has(t)).forEach(w)},E=()=>{if(C(),y.isReported)return;y.isReported=!0;let e=v.filter(e=>e.isWarning);e.length>0&&(p(`Warnings (${e.length}) during syntax parsing of ${o}:\n\n`),e.forEach(e=>p(`${Dl(e)}\n\n\n`))),e.length!==v.length&&(u(Ol(v)),_.value=!0,y.isAborted=!0)},te=e=>{let n=i.get(e),r=t(e),o=r===void 0&&n===void 0&&s!==void 0&&!d?a(s,e):void 0,c=r??o;return g.set(e,r===void 0?o===void 0?`standard`:`root file`:`file`),c!==void 0&&T(e,c),c??n},D=(()=>{try{if(s===void 0)throw new ee(`Cannot find source file for module ${o}`,void 0);return T(r,s),Ac(s,te,{rootFileName:r,rootFilePath:n.isXmlExport?`${o.replace(/\.tla$/,``)}.tla`:void 0,version:n.version,rootExtendees:n.rootExtendees,onParse:e=>{h&&u(`Parsing file ${h(e,g.get(e)??`file`)}`),e===r&&w(r),C()},onAnalyze:e=>{E(),(h||f)&&!y.isAborted&&u(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(y.isAborted||(t.every(e=>e.isWarning)&&ml(e,{messages:t,isTlc174:d}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(_.value=!0),d)return u(`Semantic errors:\n\n${Ol(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(p(`*** Warnings: ${n.length}\n`),n.forEach(e=>p(`${Dl(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(u(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>u(`${Dl(e)}\n\n`)))}})}catch(e){if(_.value=!0,e instanceof ne){u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),u(e.message),u(Ol(v));return}if(!(e instanceof ee))throw e;let t={location:e.location,text:e.message,isWarning:!1},n=d&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!n&&!f&&u(e.parseError),u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),n){u(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(d){u(`tla2sany.semantic.AbortException`),l(`*** Abort messages: 1\n\n${Dl(t)}\n\n\n`);return}u(Dl(t)),u(Ol(y.isReported?[t]:[...v,t]))}})();if(D!==void 0&&E(),D!==void 0&&!_.value&&!n.isXmlExport&&!d){let e=D.modules.filter(e=>!kl.has(e.name));h&&e.forEach(e=>u(`Linting of module ${e.name}`)),e.flatMap(El).forEach(e=>u(`${Dl(e)}\n\n\n`))}return{text:c.join(``),isFailed:_.value,specification:y.isAborted?void 0:D}},Pl={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},Fl=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),Il={"&":`&amp;`,"<":`&lt;`,">":`&gt;`,"\r":`&#13;`},Ll=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Il[e]),Rl=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,zl=e=>{let t=(e.cdata??e.text)?.match(Rl)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=zl(t);if(e)return e}},Bl=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${Ll(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)Bl(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Vl=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Hl=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},Ul={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Wl={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Gl=ms(`--TLA+ BUILTINS--`),Kl=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},ql=(e,t=16)=>e>t*.75?ql(e,t*2):t,Jl=(e,t)=>(e^e>>>16)&t-1,Yl=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Xl=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Zl=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Ql=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Yl(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(Zl,``)}).join(`
45
- `)},$l=e=>{let t=Yl(e),n=e=>Xl(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
46
- `)},eu=(e,t,n)=>{let r=n.version===`1.7.4`,i=/* @__PURE__ */ new Set,a=/* @__PURE__ */ new Map,o={isSet:!1},s=[],c=(e,t)=>{if(!r)return t();s.push(...e);let n=t();return s.length-=e.length,n},l=(e,t)=>{let n=[...s,...t].reverse(),r=[e,...n.map(e=>`\tat tla2sany.${e.at}`)].join(`
47
- `),i=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${r}\n`).join(``);return pe(new S(r,i),Pl.uncaughtException)},u=e=>l(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),d=(e,t)=>(i.has(e.id)||(i.add(e.id),a.set(e.id,c([...t?[t]:[],...Kl(e.kind,ms(e.location))],()=>h(e)))),Z(Hl(e),[Q(`UID`,e.id)])),f=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[Vl(n),...r]:r;return{...e,children:[...i,...e.children]}},p=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[d(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),m=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
48
- `),r=n.isUncommented?$l(Ql(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:r,children:[]}]:[]},h=e=>{switch(e.kind){case`FormalParam`:return f(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e,e.location);case`OpDecl`:return f(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e,e.location);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw r?l(Fl(37),[Wl]):pe(new ce(Fl(37)),Pl.uncaughtException);if(e.defKind===`ModuleInstance`)return f(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!r?[Z(`local`)]:[]]),e,e.location);let t=e.params??[];if(e.defKind===`BuiltIn`)return f(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[p(t,e.isLeibnizArg,$.builtInParam)]:[]]),e,e.location);let n=e.body,i=e.module;if(n===void 0&&r)throw u($.body);if(n===void 0||i===void 0)throw Error(`The definition of ${e.name} has no body`);return f(r?Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`body`,[b(n,$.body)]),...e.params?[p(t,e.isLeibnizArg,$.param)]:[],...e.inRecursive?[Z(`recursive`)]:[]]):Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`originalOperator`,[d(e.source??e)]),Z(`originallyDefinedInModule`,[d(i)]),Z(`body`,[b(n,$.body)]),p(t,e.isLeibnizArg,$.param),...m(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal?[Z(`local`)]:[]]),e,e.location)}case`ThmOrAssumpDef`:return f(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),b(e.body,$.theoremDefinitionBody)]),e,e.location);case`Module`:return Z(`ModuleNode`,[Vl(e.location),...g(e)]);case`Theorem`:return f(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[d(e.definition,$.theoremDefinition)])]:[],Z(`body`,[b(e.body,$.theorem)]),...e.proof?[b(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e,e.location);case`Assume`:return Z(`AssumeNode`,[Vl(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[d(e.definition,$.assumeDefinition)])]:[],Z(`body`,[b(e.body,$.assume)])])}},g=e=>{let t=t=>!n.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...r?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...js(e,2).filter(t).map(e=>d(e,$.constant)),...js(e,3).filter(t).map(e=>d(e,$.variable)),...As(e).filter(t).map(e=>d(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?b(e,$.topLevel):d(e,$.topLevel)),...e.definitions.filter(e=>!r&&e.kind===`Module`).map(e=>d(e))]},_=(e,t)=>c([t],()=>Z(`Subst`,[d(e.op,$.substOperator),b(e.expr,$.substExpression)])),v=e=>{if(e.isNull&&r)throw l(Fl(0),[$.operator,...Kl(`OpDef`,Gl),Wl]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(o.isSet=!0);let n=d(e.operator,$.operator),i=e.operands.map((e,t)=>e===void 0||t===0&&o.isSet&&hs(e)?r?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):b(e,$.operand)),a=e.tupleOrs,s=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[d(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>d(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],b(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,i),...s])},y=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?d(e,t):b(e,t),b=(e,t)=>{if(!r)return x(e);if(e.kind===`OpAppl`&&e.isAbsent&&`nullType`in t)throw u(t);let n=[t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:ms(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}];return c(n,()=>x(e))},x=e=>{switch(e.kind){case`OpAppl`:return f(v(e),e,e.location);case`Numeral`:return f(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e,e.location);case`String`:return f(Z(`StringNode`,[Q(`StringValue`,e.value)]),e,e.location);case`Decimal`:return f(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...r?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e,e.location);case`LetIn`:{let t=b(e.body,$.letBody);return f(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>d(e,$.letDefinition)))]),e,e.location)}case`Label`:return f(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[b(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>d(e,$.labelParam)))]),e,e.location);case`OpArg`:return f(Z(`OpArgNode`,[Z(`argument`,[d(e.op,$.argument)])]),e,e.location);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return f(Z(`AtNode`,[b(t,$.exceptObject),b(n,$.exceptComponents)]),e,e.location)}case`SubstIn`:case`APSubstIn`:{let t=Ul[e.kind],n=e.substs.map(e=>_(e,t.subst)),r=b(e.body,t.body);return f(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[d(e.instantiatingModule,t.from)]),Z(`instTo`,[d(e.instantiatedModule,t.to)])]),e,e.location)}case`Instance`:{let t=e.substs.map(e=>_(e,$.instanceSubst)),n=e.params.map(e=>d(e,$.instanceParam));return Z(`InstanceNode`,[Vl(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!r?[Z(`local`)]:[]])}case`UseOrHide`:return f(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>y(e,$.useFact))),Z(`defs`,e.defs.map(e=>d(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e,e.location);case`NewSymb`:return f(Z(`NewSymbNode`,[d(e.declaration,$.newDeclaration),...e.set&&!(r&&hs(e.set))?[b(e.set,$.newSet)]:[]]),e,e.location);case`AssumeProve`:return f(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>b(e,$.assumption))),Z(`prove`,[b(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e,e.location);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>y(e,$.byFact))),Z(`defs`,e.defs.map(e=>d(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return f(n,e,e.location)}case`NonLeafProof`:return f(Z(`steps`,[...r?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?d(e,$.step):b(e,$.step))]),e,e.location);case`DefStep`:return f(Z(`DefStepNode`,e.defs.map(e=>d(e,$.defStep))),e,e.location)}},ee=(n.isRestricted?[t]:e).map(e=>d(e,$.main)),C=ql(a.size),w=Z(`context`,[...a.entries()].toSorted(([e],[t])=>Jl(e,C)-Jl(t,C)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,t.name),w,...ee])},tu=(e,t={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let n=eu(e.modules,e.root,t),r=zl(n);if(r){let e=r.character.codePointAt(0)??0;throw pe(new ce(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${r.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),Pl.unrepresentableCharacter)}let i=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return Bl(n,0,t.isTerse?0:2,i),t.isTerse?i.join(``):`${i.join(`
49
- `)}\n`},nu=`META-INF/MANIFEST.MF`,ru=e=>{if(e===void 0||!xe(e))return`master`;let t=Le(we(e),{filter:e=>e.name===nu})[nu];return(t&&/^X-Git-Tag: *(\S*)/m.exec(Ie(t))?.[1])===`v1.7.4`?`1.7.4`:`master`},iu={success:de.success,"assumption-violation":de.assumptionViolation,deadlock:de.deadlock,"invariant-violation":de.safetyViolation,"property-violation":de.safetyViolation,"liveness-violation":de.livenessViolation,"postcondition-violation":de.assumptionViolation,error:de.error},au=Be(`tla-ts <Spec.tla|Spec.cfg|glob>... {options}`,[{flag:`-config <Spec.cfg>`},{flag:`-deadlock`},{flag:`-dump [<format>] <file>`,getArity:e=>e.length>1&&e[0].startsWith(`dot`)?2:1},{flag:`-fp <num>`},{flag:`-lncheck <final|default>`},{flag:`-metadir <directory>`},{flag:`-nowarning`},{flag:`-seed <num>`},{flag:`-tool`},{flag:`-workers <count|auto>`}]),ou=Be(`tla-ts prove {options} <Module.tla|glob>...`,[{flag:`-N`,isRequired:!0},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--summary`},{flag:`--strict`},{flag:`-I <directory>`,isRepeatable:!0}]),su=/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]),cu=/* @__PURE__ */ new Set([`-o`]),lu=(()=>{let e=e=>`\x1b[1m${e}\x1b[0m`,t=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],n=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,e(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,e(`SYNOPSIS`),``,`\t${e(`tla2sany.xml.XMLExporter`)} [${e(`-Iortu`)}] [${e(`-help`)}] FILE`,``,e(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,e(`OPTIONS`),``,...t.map(([t,n])=>`\t${e(t)}\n\t\t${n}`),``,e(`TIPS`),``,...n.flatMap(e=>[`\t${e}`,``]),``].join(`
50
- `)})(),uu=[`Usage: ${au.usage}`,` ${ou.usage}`,` tla-ts prove [<tlapm option>]... <Module.tla|glob>...`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
51
- `),du=/[*?[{]/,fu=e=>e.flatMap(e=>du.test(e)?Se(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),pu=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),mu=e=>e?e[0]===`auto`?je():Math.max(1,Number.parseInt(e[0],10)||1):1,hu=[`constrained`,`stuttering`,`strict`],gu=(e,t)=>e.endsWith(t)?e:`${e}${t}`,_u=e=>{if(e.length===1)return{path:gu(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:gu(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`)}},vu=(e,t)=>e.print(s.computingInitProgress,l.none,`Computed ${t} initial states...`),yu=(e,t)=>e===`invariant-violation`?{code:s.invariantViolatedInitial,text:`Invariant ${t} is violated by the initial state:`}:{code:s.propertyViolatedInitial,text:`Property ${t} is violated by the initial state:`},bu=(e,t)=>t?.forEach(t=>{if(typeof t==`string`)return console.log(t);if(t.kind===`initial-states-progress`)return vu(e,t.count);let n=yu(t.status,t.name);e.print(n.code,l.error,`${n.text}\n${c(t.state)}`)}),xu=(e,t,n={code:s.behaviorUpToThisPoint,text:`The behavior up to this point is:`},r=!1)=>{t.length>0&&e.print(n.code,l.error,n.text),t.forEach((t,n)=>{(n>0||r)&&bu(e,t.output),e.print(s.statePrint2,l.state,`${n+1}: <${t.label??t.action??`Initial predicate`}>\n${c(t.state)}`)})},Su={code:s.counterExample,text:`The following behavior constitutes a counter-example:
52
- `},Cu=(e,t)=>t===`1.7.4`||e.length===0?`Temporal properties were violated.
53
- `:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,wu=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${u(e)}\n`).toReversed().join(``),Tu=e=>{if(e.length===0)return` The error call stack is empty.
54
- `;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},Eu=(e,t)=>{let n=t.generated,r=t.distinct,i=g(/* @__PURE__ */ new Date);n===r?e.print(s.initGenerated1,l.none,`Finished computing initial states: ${r} distinct state${r===1?``:`s`} generated at ${i}.`):e.print(s.initGenerated2,l.none,`Finished computing initial states: ${n} state${n===1?``:`s`} generated, with ${r} of them distinct at ${i}.`)},Du=(e,t,n)=>{let r=Math.max(Date.now()-(n??0),1)/6e4,i=e=>e.toLocaleString(`en-US`),a=(e,t)=>n===void 0?``:` (${i(Math.floor(e/r))} ${t}/min)`;e.print(s.progress,l.none,`Progress(${Math.max(t.depth,1)}) at ${g(/* @__PURE__ */ new Date)}: ${i(t.generatedStates)} states generated${a(t.generatedStates,`s`)}, ${i(t.distinctStates)} distinct states found${a(t.distinctStates,`ds`)}, ${i(t.queuedStates)} states left on queue.`)},Ou=(e,t)=>ye(e,`${t}.class`),ku=(e,t,n,r)=>{let i=e.print;switch(t.kind){case`parsed`:n.isParsed=!0,e.isTool&&i(s.sanyFinished,l.none,`SANY finished.`),i(s.starting,l.none,`Starting... (${g(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;i(s.constantLevelInvariant,l.warning,`The invariant ${t.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;i(s.stateLevelProperty,l.warning,`The formula ${t.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${t.name} holds in all states of every behavior, use INVARIANT ${t.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${t.name} changes it into a temporal formula, asserting that ${t.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:t.isSymmetric&&i(s.livenessSymmetry,l.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),t.isConstrained&&e.version===`1.7.4`&&i(s.livenessConstraints,l.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:i(s.temporalBranches,l.none,`Implied-temporal checking--satisfiability problem has ${t.branches} branches.`);return;case`java-override`:{let e=N(be(Ou(r,t.module))).href;i(t.isMatched?s.javaOverrideLoaded:s.javaOverrideMismatch,t.isMatched?l.none:l.warning,`${t.isMatched?`Loading`:`Failed to match`} ${t.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${t.signature}>.`);return}case`initial-states-started`:i(s.computingInit,l.none,`Computing initial states...`);return;case`initial-states-progress`:vu(e,t.count);return;case`initial-states-computed`:Eu(e,t.initialStates);return;case`progress`:Du(e,t.statistics,n.start);return;case`liveness-started`:{n.liveness=Date.now(),t.isComplete&&Du(e,t.statistics);let r=t.branches>1?`${t.branches} branches of `:``,a=t.branches*t.states;i(s.checkingTemporal,l.none,`Checking ${r}temporal properties for the ${t.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${g(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Au(e,n);return;case`warning`:i(t.code,l.warning,t.text)}},Au=(e,t)=>{t.liveness!==void 0&&(e.print(s.checkingTemporalEnd,l.none,`Finished checking temporal properties in ${o(Date.now()-t.liveness)} at ${g(/* @__PURE__ */ new Date)}`),t.liveness=void 0)},ju=(e,t,n)=>{let r=n.print,i=t.name,a=t.loopStart,o=a===void 0&&t.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),u={code:s.temporalPropertyViolated,text:Cu(t.properties??[i],n.version)},d={success:void 0,error:void 0,"assumption-violation":t.message?{code:s.assumptionEvaluationError,text:me(s.assumptionEvaluationError,`Evaluating assumption ${i} failed.\n${t.message}`,n.isTool)}:{code:s.assumptionFalse,text:`Assumption ${i} is false.`},deadlock:{code:s.deadlockReached,text:`Deadlock reached.`},"invariant-violation":o?yu(`invariant-violation`,i):{code:s.invariantViolatedBehavior,text:`Invariant ${i} is violated.`},"property-violation":u,"liveness-violation":a===void 0?o?yu(`liveness-violation`,i):{code:s.actionPropertyViolatedBehavior,text:`Action property ${i} is violated.`}:u,"postcondition-violation":{code:t.postcondition?.code??s.general,text:t.message??`Postcondition ${i} is false.`}}[e],f=e===`property-violation`,p=a!==void 0&&!f,m=f||p,h=m&&n.version!==`1.7.4`;if(h&&bu(n,t.trace[0]?.output),t.counts&&console.log(t.counts),d){let e=o?`${d.text}\n${c(t.trace[0].state)}`:d.text;r(d.code,l.error,e)}if(o||(m||bu(n,t.trace[0]?.output),xu(n,t.trace,m?Su:void 0,m&&!h),bu(n,t.traceOutput)),p){let e=t.loopLabel;a===t.trace.length-1?r(s.statePrint3,l.state,`${a+2}: Stuttering`):n.isTool?r(s.backToState,l.state,`${a+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${a+1}${e?`: <${e}>\n`:``}`)}t.warning&&n.version!==`1.7.4`&&r(t.warning.code,l.warning,t.warning.text);let g=t.unwitnessed??(e===`postcondition-violation`?void 0:t.postcondition);return g?.counts&&console.log(g.counts),g&&r(g.code,l.error,g.message),!o&&e!==`assumption-violation`},Mu=(e,t)=>e.print(s.nestedExpression,l.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${Tu(t)}`),Nu=(e,t,r)=>{let i=t.print;if(e.failure){let r=e.failure,a=t.isTool?r.toolMessage:r.message,o=()=>{let e=r.fingerprint;if(e){let a=r.callStack?.length&&t.version!==`1.7.4`?Tu(r.callStack):wu(e.sources);i(s.fingerprintFailed,l.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${a}\nReason:\n${n(e.reason,t.isTool)}`)}else r.callStack&&Mu(t,r.callStack)};r.isCallStackFirst&&o();let u=r.initialState&&(()=>{try{return`While working on the initial state:\n${c(r.initialState)}`}catch(e){throw e instanceof A?pe(new A(`${te}${e.message}`),de.error):e}})();i(u?s.initialState:r.code,l.error,u?`${a}\n${u}`:a),bu(t,r.trace[0]?.output),xu(t,r.trace);let d=r.traceFailure;d&&i(d.code,l.error,t.isTool?d.toolMessage:d.message),bu(t,r.traceOutput);let f=r.postcondition;f?.counts&&console.log(f.counts),f&&i(f.code,l.error,f.message),r.isCallStackFirst||o()}else if(e.violation){if(!ju(e.status,e.violation,t))return;let n=e.additionalViolation;n&&ju(`property-violation`,n,t),e.liveCallStack&&Mu(t,e.liveCallStack)}else{Au(t,r);let n=y(e.distinctStates,e.generatedStates),a=e.fingerprintDistance===void 0?[]:[` based on the actual fingerprints: val = ${ae(E(e.fingerprintDistance))}`];i(s.success,l.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${ae(n)}`,...a].join(`
55
- `))}if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&Au(t,r),t.isTool&&Du(t,e,r.start),i(s.stats,l.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let a=t.version===`1.7.4`,o=a?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!a||o)&&i(s.searchDepth,l.none,`The depth of the complete state graph search is ${a?Math.max(e.depth,1):e.depth}.`);let u=o&&ue(o);u&&i(s.stateGraphOutdegree,l.none,u)},Pu=(e,t)=>e.map(e=>ye(e,`${t}.tla`)).find(xe),Fu=e=>t=>{let n=Pu(e,t);return n===void 0?void 0:we(n,`utf8`)},Iu=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),Lu=e=>`jar:file:${N(be(e)).pathname}!/tla2sany/StandardModules/`,Ru=e=>ke(`sha256`).update(e).digest().readBigUInt64BE().toString(),zu=(e,t,n,r,i)=>{let a=n.temporaryDirectory??Ne(),o=xe(a)?Ee(a):be(a),s=ye(o,`tlc-${Ru(be(e))}`),c=yd(n);return(n,a)=>{let l=`${n}.tla`;if(a===`file`)return Ee(Pu(t,n)??e);if(i===`1.7.4`)return ye(o,l);if(a===`root file`){let t=r===void 0?o:be(r),i=Ee(e);return`${ye(t,Ru(`${i} ${n}`),l)} (${i})`}let u=ye(s,l);return c===void 0?u:`${u} (${Lu(c)}${l})`}},Bu=e=>e.print(s.version,l.none,`TLC2 Version ${Re} (rev: tla-ts)`),Vu=(e,t)=>(Bu(e),e.print(s.commandLineError,l.error,`${t}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),Hu=(e,t,n)=>e.print(s.modelChecking,l.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(t)} with ${n} worker${n===1?``:`s`} on ${je()} cores with ${Math.floor(Fe().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${Pe()} ${Me()} ${Ae()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),Uu=(e,t)=>{let n=[...e.unknown,...e.options.map(e=>e.name)],r=(e,t=e)=>n.some(n=>n===e||n.toLowerCase()===t.toLowerCase()),i=r(`-generateSpecTE`)||!r(`-noGenerateSpecTE`,`-noTE`)&&!r(`-tool`)&&!r(`-continue`);return t!==`1.7.4`&&i&&!r(`-noGenerateSpecTEBin`,`-noTEBin`)},Wu=async(e,t,a,c)=>{let u=t.has(`-seed`)?t.get(`-seed`)?.[0]:`0`;if(u===void 0)return Vu(c,`Error: seed required.`);if(!pu(u))return Vu(c,`Error: An integer for seed required. But encountered ${u}`);let d=t.has(`-lncheck`)?t.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(d===void 0)return Vu(c,`Error: expect a strategy such as final for -lncheck option.`);let f=t.get(`-dump`);if(f?.length===0)return Vu(c,`Error: A file name for dumping states required.`);let p=f?.length===2&&hu.find(e=>f[0].toLowerCase().includes(e));if(p)return console.error(`Error: tla-ts does not support the -dump format ${p}.`),1;let m=t.get(`-fp`)?.[0];if(m!==void 0&&Number(m)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${m}.`),1;let h=mu(t.get(`-workers`)),_=c.version;Bu(c),Hu(c,u,h);let y=t.get(`-config`)?.[0]??(t.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!y||!xe(y))return c.print(s.configFileError,l.error,`TLC encountered the following error when trying to read the configuration file ${y??``}:\nFile not found.`),de.configParseError;let S=ge(e,`.tla`),C={start:Date.now(),liveness:void 0,isParsed:!1},E=()=>{let e=Date.now()-C.start;c.print(s.finished,l.none,`Finished in ${c.isTool?`${e}ms`:o(e)} at (${g(/* @__PURE__ */ new Date)})`)},te=()=>c.print(s.parsingFailed,l.error,`Parsing or semantic analysis failed.`),ne=e=>(e instanceof w?te():Ku(e,c),E(),T(e)),D=(()=>{try{return v(we(y,`utf8`),_)}catch(e){if(!(e instanceof x))throw e;return e}})();if(D instanceof x&&_===`1.7.4`)return c.print(s.general,l.error,`${b(`tlc2.tool.ConfigFileException`)}${n(D.message,c.isTool)}`),E(),de.error;if(D instanceof x)return ne(D);t.has(`-deadlock`)&&(D.checkDeadlock=!1);let re=ve(e),ie=[re,...a.libraries],ae=Fu(ie),O=Uu(t,_),oe=async()=>{let n=we(e,`utf8`),r=i(n).name;if(r!==S)throw new ee(`File name '${S}' does not match the name '${r}' of the top level module it contains.`,void 0);let a=await he({workers:h,livenessCheck:[`final`,`seqfinal`,`off`].includes(d)?`final`:`default`,seed:BigInt(u),dump:f&&_u(f),isTool:c.isTool,isTraceRecorded:O,isSanyReported:!0,isWarningEnabled:!t.has(`-nowarning`),version:_,onProgress:e=>ku(c,e,C,re),source:n,config:D,onPause:()=>Te(0,Buffer.alloc(1)),loadModule:ae,loadClass:e=>{let t=Ou(re,e);return xe(t)?we(t):void 0},readFile:e=>xe(e)?we(e,`utf8`):void 0,writeFile:(e,t)=>{Ce(ve(be(e)),{recursive:!0}),De(e,t)}});return Nu(a,c,C),E(),a.failure?.exitCode??iu[a.status]};c.isTool&&c.print(s.startingSany,l.none,`Starting SANY...`);let ce=M(e),k=ce?S:e.replace(/\.tla$/,``),A=yd(a),le=_===`1.7.4`?md(e,a,A):void 0;if(le?!xe(e)&&!r.has(S)&&le(`${S}.tla`):!xe(e)&&!fe.has(S)&&Iu(ce?re:process.cwd(),ce?`${S}.tla`:`./${k}.tla`,[...ce||re===`.`?[]:[re],...a.libraries]),Nl(e,le?hd(ae,le):ae,{fileName:k,describeFile:zu(e,ie,a,t.get(`-metadir`)?.[0],_),version:_,rootExtendees:O?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return ku(c,{kind:`parsed`},C,re),te(),E(),de.specParseError;try{return await oe()}catch(e){if(!(e instanceof se))throw e;return e instanceof w&&console.log(Gu(e,S)),C.isParsed||ku(c,{kind:`parsed`},C,re),ne(e)}},Gu=(e,t)=>{let n=e instanceof ee;if(!n&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let r=n?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${t}\n\nCould not parse module ${t} from file ${t}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${t}\n\n${r}\n*** Errors: 1\n\n${r}\n\n\n`},Ku=(e,t)=>{if(e instanceof x||e instanceof A){let n=h(e.message),r=n&&!n.isEvalException?n.code:s.general;return t.print(r,l.error,me(r,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},qu=async(e,t=p(!1))=>{try{return await e()}catch(e){if(!(e instanceof se))throw e;return Ku(e,t),T(e)}},Ju=async(e,t,n)=>{let r=[];for(let[i,a]of e.entries()){i>0&&console.log(``);let e=n();r.push(await qu(()=>t(a,e),e))}return r.find(e=>e!==de.success)??de.success},Yu=()=>(process.env.PATH??``).split(_e).map(e=>ye(e,`tlapm`)).filter(e=>xe(e)),Xu=()=>Yu().map(e=>ye(ve(ve(Ee(e))),`lib/tlapm/stdlib`)).find(e=>xe(e)),Zu=e=>e.flatMap(e=>du.test(e)?Se(e).sort():[e]),Qu=e=>{let t=Yu()[0];return t===void 0?(console.error(`Error: tla-ts prove runs tlapm to prove obligations, but tlapm isn't on your PATH. Install tlapm, or pass -N to only generate the obligations.`),1):Oe(t,Zu(e),{stdio:`inherit`}).status??1},$u=e=>xe(e)?{file:e,source:we(e,`utf8`)}:void 0,ed=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),td=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,nd=e=>console.log(`\n\\* TLAPM version 5f5037f\n\\* launched at ${g(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`prove`,...e].map(td).join(` `)}\n`),rd={incomplete:11,emptyTarget:12},id=(e,t,n)=>{let r=e.summary;n||(r.absent.forEach(e=>console.error(`Missing proof at ${He(e)}`)),r.omitted.forEach(e=>console.error(`Omitted proof at ${He(e)}`)));let i=r.absent.length+r.omitted.length>0;i&&console.error(`${Ue(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${r.absent.length} missing, ${r.omitted.length} omitted proof step(s).`);let a=t&&e.obligations.length===0;return a&&console.error(`${Ue(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...i?[rd.incomplete]:[],...a?[rd.emptyTarget]:[]]},ad=e=>{try{return e()}catch(e){if(!(e instanceof j))throw e;console.error(` tlapm ending abnormally with ${e.exception}\n`);return}},od=e=>{if(!e.includes(`-N`)&&!e.includes(`--summary`))return Qu(e);let t=ou.parse(e),n=t.unknown[0];if(n!==void 0)return console.error(`Error: tla-ts prove does not support the tlapm option ${n}.`),1;if(t.incomplete)return console.error(`Error: option '${t.incomplete.name}' needs an argument.`),1;let r=t.options.find(e=>e.name!==`-I`&&e.values.some(e=>!/^-?\d+$/.test(e)));if(r)return console.error(`Error: option '${r.name}' expects an integer.`),1;let i=Zu(t.positionals),a=i.map(e=>e.endsWith(`.tla`)?e:`${e}.tla`);if(a.length===0)return console.error(uu),1;let o=t.has(`--toolbox`)||t.has(`--line`);o&&nd(e);let s=t.options.reduce((e,t)=>{let[n,r]=t.values.map(Number);return t.name===`--toolbox`?{start:n,end:r===0?1/0:r}:t.name===`--line`?n===0?ia:{start:n,end:n}:e},ia),c=Xu(),l=t.options.flatMap(e=>e.name===`-I`?e.values:[]),u=a.reduce((e,t)=>e.includes(ve(t))?e:[ve(t),...e],[`.`,...c?[c]:[],...l.toReversed()]),d=ad(()=>{let e=a.findIndex(e=>!xe(e));if(e!==-1){let t=i[e];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(t)} not found`),new j(`File ${t} not found`,{failure:`Module.Parser.parse_file`})}return _a(a.map(e=>({file:`./${e}`,source:we(e,`utf8`)})),e=>u.map(t=>$u(`${t}/${e}.tla`)).find(Boolean),{lines:s,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(o&&t)return ed([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!d)return 3;let f=d.flatMap(e=>(t.has(`--summary`)&&console.log(ga(e)),o&&(e.obligations.forEach(e=>ed([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:to be proved`,...t.has(`--printallobs`)?[`obl:${e.text}`]:[]])),ed([`type:obligationsnumber`,`count:${e.obligations.length}`])),t.has(`--strict`)?id(e,s.start>0||s.end<1/0,t.has(`--summary`)):[]));return f.includes(rd.incomplete)?rd.incomplete:f[0]??de.success},sd=async(e,t)=>{let n=au.parse(e),r=fu(n.positionals),i=n.has(`-config`),a=r.map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||i||xe(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(a.length===0)return console.error(uu),1;if(i&&a.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let o=[...new Set(a.map(e=>xe(e)||M(e)?e:t.libraries.map(t=>ye(t,e)).find(xe)??e))],s=bd(t);return Ju(o,(e,r)=>(o.length>1&&console.log(`Checking ${ge(e)} with ${ge(e,`.tla`)}.cfg`),Wu(e,n,t,r)),()=>p(n.has(`-tool`),!n.has(`-nowarning`),s))},cd=e=>(process.stderr.write(`ERROR: ${e}\n${lu}`),Pl.argsParsingFailure),ld=(e,t)=>{try{return process.stdout.write(tu(e,t)),de.success}catch(e){if(!(e instanceof ce))throw e;let t=T(e),n=e instanceof S?e.unwound:``;return console.error(t===Pl.uncaughtException?`${n}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),t}},ud=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0},r={flag:-1};for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r.flag=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r.flag=i}return r.flag===e.length-2?n:{...n,error:`several-files`}},dd=e=>{if(e.length===0)return cd(`at least one .tla file must be given`);let t=ud(e,su);if(t.error===`missing-include`)return cd(`the -I flag must be followed by a directory and at least one .tla file`);if(t.error===`several-files`)return cd(`Only one TLA file to check allowed!`);let n=e[e.length-1];if(n===`-help`)return process.stdout.write(lu),de.success;let r=n.endsWith(`.tla`)?n:`${n}.tla`,i=[`.`,...t.includes],a=i.map(e=>be(e,r)).find(xe);a===void 0&&!fe.has(r.slice(0,-4))&&Iu(process.cwd(),`./${r}`,t.includes);let o=Nl(a??r,Fu(i),{fileName:n,isXmlExport:!0});return process.stderr.write(o.text),o.isFailed||o.specification===void 0?(console.error(`ERROR: Failed to parse module.`),Pl.specParsingFailure):ld(o.specification,{version:`master`,isRestricted:t.flags.has(`-r`),isUncommented:t.flags.has(`-u`),isTerse:t.flags.has(`-t`)})},fd=(e,t,n)=>console.error(`File does not exist: ${M(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[Lu(n)]].join(`, `)}`),pd=e=>e.endsWith(`/`)?e:`${e}/`,md=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),i=(!M(e)&&r!==``?[r]:t.libraries).map(pd),a=i.length>0?i[i.length-1]:M(e)?r:``;return e=>fd(`${a}${e}`,i,n)},hd=(e,t)=>n=>{let i=e(n);return i===void 0&&!r.has(n)&&t(`${n}.tla`),i},gd=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),Pl.uncaughtException),_d=(e,t)=>{if(e.length===0)return gd(`java.lang.IllegalArgumentException: at least one .tla file must be given`,59);let n=ud(e,cu);if(n.error===`missing-include`)return gd(`java.lang.IllegalArgumentException: the -I flag must be followed by a directory and at least one .tla file`,71);if(n.error===`several-files`)return gd(`java.lang.IllegalArgumentException: Only one TLA file to check allowed!`,83);let i=e[e.length-1],a=`${i.replace(/\.tla$/i,``)}.tla`,o=(n.includes.length===0?[`/`]:n.includes).map(pd),s=[`.`,...o],c=e=>fd(`${o[o.length-1]}${e}`,o,t),l=s.map(e=>be(e,a)).find(xe);if(l===void 0&&!r.has(ge(a,`.tla`)))return c(a),de.success;let u=Nl(l??a,hd(Fu(s),c),{fileName:i,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(u.text),u.specification===void 0?gd(`tla2sany.xml.XMLExportingException: spec ${(l&&Ml(we(l,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):ld(u.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},vd=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],yd=e=>e.classPath?.split(_e).find(e=>e.endsWith(`.jar`)),bd=e=>e.tlcVersion??ru(yd(e)),xd=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(_e));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||vd.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},Sd=e=>e.mainClass===`tlc2.TLC`?sd(e.args,e.java):e.mainClass===`tla2sany.xml.XMLExporter`?qu(()=>bd(e.java)===`1.7.4`?_d(e.args,yd(e.java)):dd(e.args)):(console.error(`Error: tla-ts runs the Java classes ${vd.join(` and `)}, not ${e.mainClass}.`),1),Cd=async e=>{if(e[0]===`prove`)return qu(()=>od(e.slice(1)));let t=xd(e);return t?Sd(t):sd(e,{libraries:[]})},wd=async()=>{process.exitCode=await Cd(process.argv.slice(2))};export{wd as runCli};
9
+ import{C as e,D as t,M as n,R as r,T as i,U as a,V as o,a as s,b as c,g as l,h as u,k as d,m as f,o as p,s as m,x as h,z as g}from"./worker.js";import{$ as _,B as v,C as y,D as b,E as x,G as S,H as C,L as w,M as ee,N as T,O as E,Q as D,R as O,T as k,U as te,V as A,W as j,_ as ne,et as re,h as ie,j as M,k as ae,m as N,nt as oe,q as se,tt as ce,v as le,w as ue,z as de}from"./transfer.js";import{a as fe,c as pe,d as me,f as he,g as ge,h as P,i as _e,l as ve,m as ye,n as be,o as xe,p as Se,r as Ce,s as we,t as Te,u as Ee}from"./prove.js";import{getTlapmPaths as De}from"./tlapm.js";import{basename as Oe,delimiter as ke,dirname as Ae,isAbsolute as je,join as Me,resolve as F}from"node:path";import{cpSync as Ne,existsSync as I,globSync as Pe,mkdirSync as Fe,readFileSync as Ie,readSync as Le,readdirSync as Re,realpathSync as ze,renameSync as Be,rmSync as Ve,statSync as He,writeFileSync as Ue}from"node:fs";import{arch as We,availableParallelism as Ge,release as Ke,tmpdir as qe,type as Je}from"node:os";import{pathToFileURL as Ye}from"node:url";import{getHeapStatistics as Xe}from"node:v8";var Ze=`0.0.4-dev.b254db0`;const Qe=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},$e=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(Qe).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},et=2224400062,L={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},tt={smallInt:64,smallString:32,smallBlock:128},R=(e,...t)=>({tag:e,fields:t}),nt=e=>typeof e==`object`&&`tag`in e,rt=(t,n)=>{let r=new DataView(t.buffer,t.byteOffset,t.byteLength);if(t.length<n+20||r.getUint32(n)!==et)throw new e(`corrupted fingerprint file`);let i=n+20+r.getUint32(n+4),a=[],o={position:n+20},s=t=>{let n=o.position;if(o.position+=t,o.position>i)throw new e(`corrupted fingerprint file`);return n},c=new TextDecoder,l=e=>{let n=s(e),r=c.decode(t.subarray(n,n+e));return a.push(r),r},u=(e,t)=>{let n=R(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let n=t[s(1)];if(n>=tt.smallBlock)return u(n&15,n>>4&7);if(n>=tt.smallInt)return n&63;if(n>=tt.smallString)return l(n&31);switch(n){case L.int8:return r.getInt8(s(1));case L.int16:return r.getInt16(s(2));case L.int32:return r.getInt32(s(4));case L.shared8:return d(r.getUint8(s(1)));case L.shared16:return d(r.getUint16(s(2)));case L.shared32:return d(r.getUint32(s(4)));case L.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case L.string8:return l(r.getUint8(s(1)));case L.string32:return l(r.getUint32(s(4)));case L.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new e(`corrupted fingerprint file`)};return{value:f(),next:i}},it=e=>{let t=[],n={objects:0,words32:0,words64:0},r=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},i=new TextEncoder,a=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(tt.smallInt+e):e>=-128&&e<128?t.push(L.int8,e&255):e>=-32768&&e<32768?(t.push(L.int16),r(e,2)):(t.push(L.int32),r(e,4));if(n.objects++,typeof e==`string`){let a=i.encode(e);a.length<32?t.push(tt.smallString+a.length):a.length<256?t.push(L.string8,a.length):(t.push(L.string32),r(a.length,4)),t.push(...a),n.words32+=1+Math.floor((a.length+4)/4),n.words64+=1+Math.floor((a.length+8)/8);return}if(!nt(e)){let r=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));r.setFloat64(0,e.float,!0),t.push(L.doubleLittle,...new Uint8Array(r.buffer)),n.words32+=3,n.words64+=2;return}let o=e.fields.length;o===0?n.objects--:(n.words32+=1+o,n.words64+=1+o),e.tag<16&&o<8?t.push(tt.smallBlock+e.tag+(o<<4)):(t.push(L.block32),r(o*1024+e.tag,4)),e.fields.forEach(a)};a(e);let o=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[et,t.length,n.objects,n.words32,n.words64].forEach((e,t)=>o.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(o.buffer),...t])},at=20210223,ot={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16}},st=[`false`,`timeout`],ct=`tla-ts ${Ze}`,lt=/* @__PURE__ */ new Map([[ot.zenon.field,3],[ot.isabelle.field,4]]),ut=(e,t)=>e!==void 0&&nt(e)?e.fields[t]:void 0,dt=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,ft=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},pt=e=>e!==void 0&&nt(e)?[[e.fields[0],e.fields[1]],...pt(e.fields[2])]:[],mt=(t,n,r)=>{let i=Ie(n),a=rt(i,0),o=rt(i,a.next).value;if(a.value!==at||!nt(o)||o.tag!==0)throw new e(`corrupted fingerprint file`);let s=ut(ut(o,0),1),c=(e,t)=>{let n=lt.get(t);return!r||n===void 0||ut(ut(e,0),n)===ct};t.clear(),(s!==void 0&&nt(s)?s.fields:[]).flatMap(e=>pt(e).toReversed()).forEach(([n,r])=>{if(typeof n!=`string`||!nt(r))throw new e(`corrupted fingerprint file`);t.set(n,r.fields.map((e,t)=>c(e,t)?e:0))})},ht=(e,t)=>{let n=ut(t,0),r=ut(n,0),i=ut(ut(n,1),0);if(r===void 0||r===1)return;let a=dt(ut(e===`isabelle`?ut(i,0):i,0)),o=e===`isabelle`?ut(i,1):void 0,s=ut(ut(r,0),0);return{method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,isReused:!1,...s!==void 0&&{reason:typeof s==`number`?st[s]:String(ut(s,0))}}},gt=e=>{let t=/* @__PURE__ */ new Date,n=e.method,r={float:n.rlimit??n.timeLimitMs/1e3},i=n.prover===`zenon`?R(0,r,5):n.prover===`isabelle`?R(0,R(0,r),n.tactic??`auto`):R(0,r),a=st.indexOf(e.reason??``),o=e.reason===void 0?0:R(0,a===-1?R(0,e.reason):a);return R(0,R(0,R(0,e.isProved?0:R(0,o),R(ot[n.prover].tag,i)),R(0,t.getFullYear(),t.getMonth(),t.getDate(),t.getHours(),t.getMinutes(),t.getSeconds()),ct,ct,ct))},_t=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=ft(r)&t-1;n[i]=R(0,r,R(0,...e),n[i])}),R(0,R(0,e.size,R(0,...n),0,512))},vt=e=>String(e).padStart(2,`0`),yt=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,i=Me(r,`${n.getFullYear()}-${vt(n.getMonth()+1)}-${vt(n.getDate())}_${vt(n.getHours())}_${vt(n.getMinutes())}_${vt(n.getSeconds())}`);Fe(i,{recursive:!0}),[e,...t].filter(e=>I(e)).forEach(e=>Ne(e,Me(i,Oe(e)),{preserveTimestamps:!0})),Re(r).map(e=>Me(r,e)).sort((e,t)=>He(t).mtimeMs-He(e).mtimeMs).slice(10).forEach(e=>Ve(e,{recursive:!0,force:!0}))},bt=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(Object.entries(ot).flatMap(([e,n])=>{let i=ht(e,ut(r[n.field],0));return i?(t.set(i,r[n.field]),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];r.forEach((e,n)=>{a[ot[n].field]=t.get(e)??gt(e)}),e.set(i,a)}),Ue(`${i}.tmp`,Buffer.concat([it(at),it(_t(e))])),Be(`${i}.tmp`,i)}}},xt={builtin:1,number:2,string:3,ident:4,added:5},St=()=>({labelFlag:!1,reportLabelsFlag:!1,labelRoot:`Lbl_`,fairnessOption:``,fairAlgorithm:!1,checkTermination:!1,noOld:!1,nocfg:!1,noDoneDisjunct:!1,specOption:!1,myspecOption:!1,specFile:``,optionsInFile:!1,inputVersionNumber:1903}),Ct=e=>{let t={result:0,digitsAfterDecimal:0,isAfterDecimal:!1};for(let n of e)if(n===`.`)t.isAfterDecimal=!0;else if(n<`0`||n>`9`||(t.result=10*t.result+Number(n),t.isAfterDecimal&&(t.digitsAfterDecimal+=1),t.digitsAfterDecimal>3))return-1;return t.result*10**Math.max(0,3-t.digitsAfterDecimal)},wt=[`unfair`,`wf`,`sf`],z=()=>({col:0,line:0,macroCol:0,macroLine:-1,lbl:``}),Tt=e=>e.macroLine<0?`line ${e.line}, column ${e.col}`:`line ${e.line}, column ${e.col} of macro called at line ${e.macroLine}, column ${e.macroCol}`,Et=e=>{if(e.kind!==`LabeledStmt`)throw new m(`ClassCastException: ${e.kind}`);return e},Dt=(e,t)=>{if(t<0||t>=e.length)throw new m(`ArrayIndexOutOfBoundsException: ${t}`);return e[t]},Ot=(e,t,n)=>({string:e,column:t,type:n}),kt=e=>e.type===xt.string?e.string.length+2:e.string.length,At=(e=[])=>({tokens:e,anchorTokens:void 0,anchorTokCol:void 0}),jt=e=>{for(;e.tokens.length>0&&e.tokens[0].length===0;)e.tokens.shift();for(;e.tokens.length>0&&e.tokens[e.tokens.length-1].length===0;)e.tokens.pop();let t=Math.min(999999,...e.tokens.filter(e=>e.length>0).map(e=>e[0].column));e.tokens.forEach(e=>e.forEach(e=>{e.column-=t}));let n=[],r=[];e.tokens.forEach((t,i)=>{if(r.push(0),n.push(void 0),t.length===0)return;let a=t[0].column,o=e.tokens.slice(0,i).findLast(e=>e.length>0&&e[0].column<=a);if(o===void 0)return;let s=o.findIndex((e,t)=>t>0&&e.column>a),c=o[(s===-1?o.length:s)-1];n[i]=c,r[i]=c.column}),e.anchorTokens=n,e.anchorTokCol=r},Mt=e=>{let t=At(e);return jt(t),t},Nt=e=>{let t=e.anchorTokens,n=e.anchorTokCol;if(t===void 0||n===void 0)throw new m(`NullPointerException: TLAExpr.renormalize`);e.tokens.forEach((e,r)=>{let i=t[r];if(i===void 0)return;let a=i.column-n[r];if(n[r]=i.column,a<0)throw new p(`TLAExpr.renormalize() found anchor has moved to left.`);e.forEach(e=>{e.column+=a})})},Pt=e=>Mt(e.tokens.map(e=>e.map(e=>({...e})))),Ft=(e,t,n)=>{let r=t.tokens.length;e.tokens.splice(0,0,...t.tokens.slice(0,r-1));let i=t.tokens[r-1],a=e.tokens[r-1],o=i[i.length-1],s=o.column+kt(o)+n;a.forEach(e=>{e.column+=s}),a.splice(0,0,...i);let c=[...t.anchorTokens??[]],l=[...t.anchorTokCol??[]];for(let t=r;t<e.tokens.length;t++)c.push(e.anchorTokens?.[t-r+1]),l.push(e.anchorTokCol?.[t-r+1]??0);e.anchorTokens=c,e.anchorTokCol=l,Nt(e)},It=e=>e.tokens.length===1&&e.tokens[0].length===1,Lt=(e,t)=>Dt(Dt(e.tokens,t.line),t.item),Rt=(e,t,n)=>{if(e.tokens.length<=t.line)throw new s(`TLAExpr.StepCoord called with line too big`);if(e.tokens[t.line].length<=t.item)throw new s(`TLAExpr.StepCoord called with col too big`);let r={line:t.line,item:t.item};for(let t=0;t<n;t++)if(r.item+=1,e.tokens[r.line].length===r.item){for(r.item=0,r.line+=1;r.line<e.tokens.length&&e.tokens[r.line].length===0;)r.line+=1;if(r.line===e.tokens.length)return}return r},zt=(e,t,n)=>{for(let r=e.tokens.length===0?void 0:{...n};r!==void 0;){let n=Lt(e,r),i=n.type===xt.string;if(!i&&n.string===t)return r;let a=!i&&(n.string===`[`||n.string===`,`)?Rt(e,r,2):void 0,o=a===void 0?void 0:Lt(e,a),s=o!==void 0&&o.type!==xt.string&&[`:`,`|->`,`↦`].includes(o.string),c=i?1:n.string===`.`?2:s?3:1;r=Rt(e,r,c)}},Bt=(e,t,n,r)=>{let i=Lt(e,n);if(It(e)){let n=Pt(t);e.tokens=n.tokens,e.anchorTokens=n.anchorTokens,e.anchorTokCol=n.anchorTokCol;return}let a=e.tokens[n.line],o=n.item+1<a.length?a[n.item+1].column-(i.column+kt(i)):0,s=a.splice(n.item+1),c={lineIndex:n.line,indent:+!!r+i.column,isInserting:!r},l=()=>e.tokens[c.lineIndex];if(It(t)){let e=t.tokens[0][0];i.string=e.string,i.type=e.type}else{r&&(i.string=`(`,i.type=xt.builtin);let n=Pt(t);if(n.tokens.forEach((t,r)=>{if(t.forEach(e=>{e.column+=c.indent,c.isInserting?(i.string=e.string,i.type=e.type,c.isInserting=!1):l().push(e)}),r+1>=n.tokens.length)return;c.indent=0,c.lineIndex+=1;let a=c.lineIndex;e.tokens.splice(a,0,[]);let o=e.anchorTokens??[],s=e.anchorTokCol??[];e.anchorTokens=e.tokens.map((e,t)=>t<a?o[t]:t===a?n.anchorTokens?.[r+1]:o[t-1]),e.anchorTokCol=e.tokens.map((e,t)=>t<a?s[t]:t===a?n.anchorTokCol?.[r+1]??0:s[t-1])}),r){let e=l()[l().length-1];l().push(Ot(`)`,e.column+kt(e),xt.builtin))}}let u=l(),d={line:c.lineIndex,item:u.length-1};if(s.length>0){let e=u[u.length-1],t=e.column+kt(e)+o-s[0].column;s.forEach(e=>{e.column+=t,u.push(e)})}return Nt(e),Rt(e,d,1)},Vt=(e,t,n,r=!0)=>{let i=n.map(t=>zt(e,t,{line:0,item:0}));for(;;){let a=i.reduce((e,t,n)=>t!==void 0&&(e===void 0||t.line<e.position.line||t.line===e.position.line&&t.item<e.position.item)?{index:n,position:t}:e,void 0);if(a===void 0)return;let o=Rt(e,a.position,1),s=Bt(e,t[a.index],a.position,r);i[a.index]=s===void 0?void 0:zt(e,n[a.index],s),i.forEach((e,t)=>{if(t!==a.index&&e!==void 0&&s!==void 0){if(o===void 0)throw new m(`NullPointerException: TLAExpr.substituteForAll`);e.line===a.position.line&&(e.item+=s.item-o.item),e.line+=s.line-o.line}})}},Ht=(e,t,n)=>{let r=Pt(e);return Vt(r,t,n),r},Ut=(e,t,n)=>e.map(e=>Ht(e,t,n)),Wt=(e,t)=>{let n=e=>t===`1.7.4`?``:`(col${e.column}) `,r=e.tokens.map(e=>e.map(e=>e.type===xt.string?`"\\"", "${e.string}", "\\""`:e.string===`\\/`?`"${n(e)}\\\\/"`:e.string.startsWith(`\\`)?`"\\${e.string}"`:e.string===`/\\`?`"${n(e)}/\\\\"`:`"${e.string}"`)),i=r.findIndex(e=>e.length>0);return`<< ${r.map((e,t)=>{let n=i!==-1&&t>i;return e.map((e,t)=>n||t>0?`, ${e}`:e).join(``)}).join(`
10
+ `)} >>`},Gt=(e,t,n)=>{let r=e=>Wt(e,n),i=[0],a={value:0},o=e=>(i[a.value+1]=i[a.value]+e.length,a.value+=1,e),s=()=>(--a.value,``),c=()=>`\n${` `.repeat(i[a.value])}`,l=t<1500,u=e=>`${o(`<<`)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${`kind`in e?m(e):r(e)}`).join(``)}>>${s()}`,d=e=>`${o(`<<`)}${e.map(e=>`"${e}"`).join(`, `)}>>${s()}`,f=e=>`${o(`<< `)}${e.map((e,t)=>`${t>0?`, ${c()}`:``}${u(e)}`).join(``)} >>${s()}`,p=e=>e?`"="`:`"\\\\in"`,m=e=>{switch(e.kind){case`Uniprocess`:return`${o(``)}[type |-> "uniprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Multiprocess`:return`${o(``)}[type |-> "multiprocess", ${c()} name |-> "${e.name}", ${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` defs |-> `)}${r(e.defs)},${s()}${c()}${o(` prcds |-> `)}${u(e.prcds)},${s()}${c()}${o(` procs |-> `)}${u(e.procs)}]${s()}${s()}`;case`Procedure`:return l?`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}", ${c()}minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()}${o(` params |-> `)}${u(e.params)},${s()}${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`Process`:return l?`${o(``)}[name |-> "${e.name}", ${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`:`${o(``)}[name |-> "${e.name}",${c()} fairness |-> "${wt[e.fairness]}", minusLabels |-> ${d(e.minusLabels)}, plusLabels |->${d(e.plusLabels)}, proceduresCalled |->${d(e.proceduresCalled)},${c()} eqOrIn |-> ${p(e.isEq)},${c()} id |-> ${r(e.id)},${c()}${o(` decls |-> `)}${u(e.decls)},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`VarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> ${p(e.isEq)}, val |-> ${r(e.val)}]${s()}`;case`PVarDecl`:return`${o(``)}[var |-> "${e.var}", eqOrIn |-> "=", val |-> ${r(e.val)}]${s()}`;case`LabeledStmt`:return`${o(``)}[label |-> "${e.label}",${c()}${o(` stmts |-> `)}${u(e.stmts)}]${s()}${s()}`;case`While`:return`${o(``)}[type |-> "while", ${c()} test |-> ${r(e.test)},${c()}${o(` labDo |-> `)}${u(e.labDo)},${s()}${c()}${o(` unlabDo |-> `)}${u(e.unlabDo)}]${s()}${s()}`;case`Assign`:return`${o(``)}[type |-> "assignment",${c()}${o(` ass |-> `)}${u(e.ass)}]${s()}${s()}`;case`SingleAssign`:return`${o(``)}[lhs |-> ${m(e.lhs)},${c()} rhs |-> ${r(e.rhs)}]${s()}`;case`Lhs`:return`[var |-> "${e.var}", sub |-> ${r(e.sub)}]`;case`If`:return`${o(``)}[type |-> "if", ${c()} test |-> ${r(e.test)},${c()}${o(` then |-> `)}${u(e.Then)},${s()}${c()}${o(` else |-> `)}${u(e.Else)}]${s()}${s()}`;case`Either`:return`${o(``)}[type |-> "either", ${c()}${o(` ors |-> `)}${f(e.ors)}]${s()}${s()}`;case`With`:return`${o(``)}[type |-> "with", ${c()} var |-> "${e.var}",${c()} eqOrIn |-> ${p(e.isEq)},${c()} exp |-> ${r(e.exp)},${c()}${o(` do |-> `)}${u(e.Do)}]${s()}${s()}`;case`When`:return`${o(``)}[type |-> "when", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`PrintS`:return`${o(``)}[type |-> "print", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Assert`:return`${o(``)}[type |-> "assert", ${c()} exp |-> ${r(e.exp)}]${s()}`;case`Skip`:return`[type |-> "skip"]`;case`LabelIf`:return`${o(``)}[type |-> "labelIf",${c()} test |-> ${r(e.test)},${c()}${o(` unlabThen |-> `)}${u(e.unlabThen)},${s()}${c()}${o(` labThen |-> `)}${u(e.labThen)},${s()}${c()}${o(` unlabElse |-> `)}${u(e.unlabElse)},${s()}${c()}${o(` labElse |-> `)}${u(e.labElse)}]${s()}${c()}${s()}`;case`LabelEither`:return`${o(``)}[type |-> "labelEither",${c()}${o(` clauses |-> `)}${u(e.clauses)}]${s()}${c()}${s()}`;case`Clause`:return`${o(``)}${o(`[unlabOr |-> `)}${u(e.unlabOr)},${s()}${c()}${o(` labOr |-> `)}${u(e.labOr)}]${s()}${c()}${s()}`;case`Call`:return`${o(``)}[type |-> "call",${c()} returnTo |-> "${e.returnTo}",${c()} to |-> "${e.to}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`;case`Return`:return`[type |-> "return", from |-> "${e.from??`null`}"]`;case`CallReturn`:return`${o(``)}[type |-> "callReturn",${c()} from |-> "${e.from??`null`}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`CallGoto`:return`${o(``)}[type |-> "callGoto",${c()} after |-> "${e.after}",${c()} to |-> "${e.to}",${c()}${o(`args |-> `)}${u(e.args)}]${c()}${s()}${s()}`;case`Goto`:return`[type |-> "goto", to |-> "${e.to}"]`;case`Macro`:return`${o(``)}[name |-> "${e.name}", ${c()}${o(` params |-> `)}${o(`<<`)}${e.params.join(`, ${c()}`)}>>${s()},${s()}${c()}${o(` body |-> `)}${u(e.body)}]${s()}${s()}`;case`MacroCall`:return`${o(``)}[type |-> "macrocall",${c()} name |-> "${e.name}",${c()}${o(` args |-> `)}${u(e.args)}]${s()}${s()}`}};return m(e)},Kt=(e,t,n,r,i)=>({lines:e,currentLine:t<e.length?Array.from(e[t]):void 0,line:t,column:n,vcolumn:t<e.length?Array.from(e[t].slice(0,n)).reduce((e,t)=>t===` `?(Math.floor(e/8)+1)*8:e+1,0):0,lastLine:r,lastColumn:i,isTabToSpaces:!1}),qt=e=>{if(e.currentLine===void 0)return` `;if(e.isTabToSpaces)return e.vcolumn+=1,e.vcolumn%8==0&&(e.isTabToSpaces=!1),` `;if(e.line>e.lastLine||e.line===e.lastLine&&e.column>=e.lastColumn)return` `;if(e.currentLine.length===e.column)return e.line+=1,e.column=0,e.vcolumn=0,e.currentLine=e.line>=e.lines.length?void 0:Array.from(e.lines[e.line]),`
11
+ `;let t=e.currentLine[e.column];return e.column+=1,e.vcolumn+=1,t===` `?(e.vcolumn%8!=0&&(e.isTabToSpaces=!0),` `):t},Jt=e=>{if(e.column>0){--e.column,--e.vcolumn;return}if(e.line===0)throw new s(`PcalCharReader.backspace trying to move past beginning of reader`);--e.line;let t=Array.from(e.lines[e.line]);for(e.currentLine=t,e.column=0,e.vcolumn=0;e.column<t.length-1;)qt(e)},Yt=e=>{for(;;){let t=qt(e);if(t===` `)return` `;if(t!==` `&&t!==`
12
+ `)break}return Jt(e),`${(e.currentLine??[]).slice(e.column).join(``)}\n`},Xt=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`⟨`]),Zt=/* @__PURE__ */ new Set([`>>_`,`⟩_`,`]_`,`)`,`}`,`]`,`>>`,`⟩`]),Qt=/* @__PURE__ */ new Set([...Xt,...Zt,...`_ ASSUME ASSUMPTION AXIOM BOOLEAN CASE CONSTANT CONSTANTS EXCEPT EXTENDS FALSE IF INSTANCE LOCAL MODULE OTHER STRING THEOREM TRUE VARIABLE VARIABLES WITH WF_ SF_`.split(` `),...`\\A ∀ \\forall \\E ∃ \\exists \\AA \\EE ~ ¬ \\lnot \\neg <> ◇ CHOOSE ENABLED UNCHANGED SUBSET UNION DOMAIN ' ^+ ⁺ ^* ^#`.split(` `),...`=> ⇒ \\cdot ⋅ <=> ⇔ \\equiv ≡ ~> ↝ -+-> ⇸ \\subseteq ⊆ \\subset ⊂ \\supset ⊃ \\supseteq ⊇ \\ll ≪ \\gg ≫ \\ \\cap \\intersect ∩ \\cup \\union ∪ /\\ ∧ \\/ ∨ \\land \\lor \\X × - + * / ^ | || ‖ & && ++ -- ** // ^^ |- ⊢ |= ⊨ -| ⊣ =| ⫤ <: :> := ≔ ::= ⩴`.split(` `),...`(+) ⊕ (-) ⊖ \\oplus \\ominus (.) ⊙ \\odot (/) ⊘ \\oslash (\\X) ⊗ \\otimes \\uplus ⊎ \\sqcap ⊓ \\sqcup ⊔ \\div ÷ \\star ⋆ \\o ∘ \\circ \\bigcirc ◯ \\bullet ●`.split(` `),...`\\in ∈ \\notin ∉ = # /= ≠ < > =< <= ≤ >= ≥ \\prec ≺ \\succ ≻ \\preceq ⪯ \\succeq ⪰ \\sim ∼ \\simeq ≃ \\approx ≈ \\doteq ≐ \\asymp ≍ \\sqsubset ⊏ \\sqsupset ⊐ \\sqsubseteq ⊑ \\sqsupseteq ⊒ \\propto ∝`.split(` `),...`: -> → |-> ↦ <- ← == ≜ ELSE THEN LET IN [] □ .. ‥ ... … $ $$ ? ?? ⁇ % %% ## @@ !! ‼ \\times \\leq \\geq \\mod \\wr ≀ ≅ ! ; , . -. @`.split(` `)]),$t=e=>/^[A-Za-z_]$/.test(e),en=e=>/^[0-9]$/.test(e),tn=e=>e===` `||e===`\f`||e===`\r`,nn=new Set([...Qt].filter(e=>!$t(e[0])&&!(e[0]===`\\`&&$t(e[1]??``))).flatMap(e=>Array.from(e,(t,n)=>e.slice(0,e.length-n)))),rn=/* @__PURE__ */ new Set("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ ~!@#$%^&*()_-+={}[]|:;<,>.?/`'0123456789"),an=new Set(`; do then := ≔ begin variable variables || ‖ end else elsif if either or while with call return goto print assert skip procedure define process fair`.split(` `)),B={...xt,dashes:6,endModule:7},on=()=>({delimiter:``,delimiterLine:0,delimiterCol:0,commentDepth:0}),sn=(e,t,n,r)=>{let i={lines:[],line:[],token:``,state:`start`,column:t.vcolumn,nextColumn:t.vcolumn,nextChar:qt(t),parenDepth:0,isInQuantifier:!1,isExprEnd:!1,previousToken:` `},a=()=>{i.nextColumn=t.vcolumn,i.nextChar=qt(t)},o=()=>{i.token+=i.nextChar,a()},c=()=>{i.state=`start`,i.column=i.nextColumn},l=()=>{i.lines.push(i.line),i.line=[],i.column=0},u=e=>{throw new p(`${e} \`${i.token}' found at\n line ${t.line+1}, column ${i.column+1}`)},d=()=>{i.isExprEnd=!0,e.delimiter=i.token,e.delimiterCol=i.column,e.delimiterLine=t.line-+(i.nextChar===`
13
+ `)},f=e=>{if(!n){d(),i.token=``;return}e>B.ident&&u(`Illegal token in an expression`);let t=i.token;e!==B.string&&(an.has(t)&&!(e===B.ident&&[`.`,`[`,`,`].includes(i.previousToken))||(t===`,`&&!i.isInQuantifier&&!r||t===`)`||t===`}`)&&i.parenDepth===0)?(i.parenDepth!==0&&u(`Expression with an unmatched (, [, {, or << followed by`),i.isInQuantifier&&u("Expression with \\A or \\E but no following `:` followed by"),d(),i.line.length>0&&l()):(e===B.builtin&&Xt.has(t)&&(i.parenDepth+=1),e===B.builtin&&Zt.has(t)&&(--i.parenDepth,i.parenDepth<0&&u(`Extra (unmatching)`)),i.previousToken=e===B.string?` `:t,[`\\A`,`∀`,`\\E`,`∃`].includes(t)&&i.parenDepth===0&&(i.isInQuantifier=!0),i.isInQuantifier&&t===`:`&&i.parenDepth===0&&(i.isInQuantifier=!1),(t!==``||e===B.string)&&i.line.push(Ot(t,i.column,e)),i.token=``)},m=e=>{f(e),c()},h=e=>{o(),i.state=e},g=e=>{a(),i.state=e},_=n=>{switch(i.state){case`start`:if(tn(n))return a(),c();if($t(n))return h(`id`);if(n===`ℕ`||n===`ℤ`||n===`ℝ`)return o(),m(B.ident);if(en(n))return h(`numOrId`);if(n===`\\`)return h(`bs`);if(n===`-`)return h(`dash1`);if(n===`=`)return h(`eq1`);if(n===`(`)return g(`leftParen`);if(n===`"`)return g(`string`);if(n===`
14
+ `)return a(),l(),c();if(nn.has(n))return h(`builtIn`);if(n===` `){i.state=`done`;return}return o(),u(`Illegal lexeme`);case`id`:return i.token===`WF_`||i.token===`SF_`?m(B.builtin):$t(n)||en(n)?o():m(Qt.has(i.token)?B.builtin:B.ident);case`numOrId`:return en(n)?o():$t(n)?h(`id`):m(B.number);case`bs`:if([`b`,`B`,`o`,`O`,`h`,`H`].includes(n))return h(`numOrBi`);if($t(n)){i.state=`bsBuiltIn`;return}if(n===`*`){a(),i.token=``,i.state=`lineComment`;return}i.state=`builtIn`;return;case`numOrBi`:i.state=en(n)?`num`:`bsBuiltIn`;return;case`num`:if(en(n))return o();if(!$t(n))return m(B.number);o(),i.token.startsWith(`\\`)&&u(`Illegal lexeme`),i.state=`id`;return;case`bsBuiltIn`:return $t(n)&&n!==`_`?o():Qt.has(i.token)?m(B.builtin):u(`Illegal lexeme `);case`builtIn`:if(nn.has(i.token+n))return o();if(!Qt.has(i.token)){for(Jt(t);!Qt.has(i.token);)Jt(t),i.token.length===0&&u(`Illegal lexeme`),i.token=Array.from(i.token).slice(0,-1).join(``);a()}return m(B.builtin);case`dash1`:case`dash2`:if(n===`-`)return h(i.state===`dash1`?`dash2`:`dash3`);i.state=`builtIn`;return;case`dash3`:return n!==`-`&&u(`Illegal lexeme`),h(`dashes`);case`dashes`:return n===`-`?o():m(B.dashes);case`eq1`:case`eq2`:if(n===`=`)return h(i.state===`eq1`?`eq2`:`eq3`);i.state=`builtIn`;return;case`eq3`:return n!==`=`&&u(`Illegal lexeme`),h(`eqs`);case`eqs`:return n===`=`?o():m(B.endModule);case`leftParen`:if(n===`*`)return e.commentDepth=1,g(`comment`);i.token=`(`,i.state=`builtIn`;return;case`string`:if(n===`\\`)return h(`escString`);if(n===`"`)return a(),m(B.string);o(),rn.has(n)||u(`Illegal character in string`);return;case`escString`:o(),[`"`,`\\`,`t`,`n`,`f`,`r`].includes(n)||u(`Illegal character following \\ in string`),i.state=`string`;return;case`lineComment`:return n===`(`?g(`lineComParen`):n===`*`&&e.commentDepth>0?g(`lineComStar`):n===`
15
+ `||n===` `?(i.token=``,e.commentDepth=0,c()):e.commentDepth===0?o():a();case`lineComParen`:if(n===`*`)return e.commentDepth+=1,g(`lineComment`);e.commentDepth===0&&(i.token+=`(`),i.state=`lineComment`;return;case`lineComStar`:if(n===`)`){if(--e.commentDepth,e.commentDepth<0)throw new s(`Failure of assertion: case LINE_COM_STAR`);return g(`lineComment`)}e.commentDepth===0&&(i.token+=`*`),i.state=`lineComment`;return;case`comment`:case`orComment`:{let t=i.state===`comment`;if(n===`*`)return g(t?`commentStar`:`orCommentStar`);if(n===`(`)return g(t?`commentParen`:`orCommentParen`);if(n===`
16
+ `){i.token=``,a(),l(),i.state=`orComment`;return}if(n===` `)throw new p(t?`Input ended in the middle of a comment`:`Input ended in the middle of a multi-line comment`);return e.commentDepth===1?o():a()}case`commentStar`:case`orCommentStar`:{let t=i.state===`commentStar`?`comment`:`orComment`;if(n!==`)`){e.commentDepth===1&&(i.token+=`*`),i.state=t;return}if(a(),--e.commentDepth,t===`orComment`&&e.commentDepth<0)throw new s(`Assertion failure`);if(e.commentDepth!==0){i.state=t;return}return i.token=``,c()}case`commentParen`:case`orCommentParen`:{let t=i.state===`commentParen`?`comment`:`orComment`;if(n===`*`)return e.commentDepth+=1,g(t);e.commentDepth===1&&(i.token+=`(`),i.state=t;return}}};for(;i.state!==`done`&&!i.isExprEnd;)_(i.nextChar);return i.nextChar!==`
17
+ `&&Jt(t),Mt(i.lines)},cn=(e,t,n)=>sn(e,t,!0,n),ln=(e,t)=>(sn(e,t,!1,!1),e.delimiter),un=(e,t)=>({params:e,tokenizer:on(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),dn=()=>Mt([[Ot(`defaultInitValue`,0,0)]]),fn=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],pn=(e,t)=>!t.some(t=>e.includes(t)),mn=(e,t)=>{t.splice(0,t.length,...e)},hn=(e,t,n)=>{let r=e.params,i=e.lookahead,a=e.lastToken,o={lookaheadSize:0,addedLabels:[],addedLabelsLocs:[],nextLabelNum:1,allLabels:/* @__PURE__ */ new Set,hasLabel:!1,hasDefaultInitialization:!1,currentProcedure:void 0,procedures:[],pSyntax:!1,cSyntax:!1,plusLabels:[],minusLabels:[],proceduresCalled:[],gotoUsed:!1,gotoDoneUsed:!1,omitPC:r.inputVersionNumber>=1500,omitStutteringWhenDone:r.inputVersionNumber>=1500},c=e=>{throw new p(`${e}\n line ${a.line}, column ${a.column}`)},l=()=>{if(o.lookaheadSize===0)return Yt(t),a.column=t.vcolumn+1,a.line=t.line+1,a.text=ln(e.tokenizer,t),a.text;a.column=i.columns[0]+1,a.line=i.lines[0]+1;let n=i.tokens[0];for(let e=1;e<o.lookaheadSize;e++)i.tokens[e-1]=i.tokens[e],i.columns[e-1]=i.columns[e],i.lines[e-1]=i.lines[e];return--o.lookaheadSize,a.text=n,n},u=n=>{for(;o.lookaheadSize<n;){let n=o.lookaheadSize;if(Yt(t)===` `)throw new p(`Premature end of file, perhaps because of unclosed comment, near\n line ${i.lines[n]+1}, column ${i.columns[n]+1}`);i.columns[n]=t.vcolumn,i.lines[n]=t.line,i.tokens[n]=ln(e.tokenizer,t),o.lookaheadSize+=1}return i.tokens[n-1]},d=n=>{if(n<o.lookaheadSize)throw new s(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
18
+ it has already peeked at`);for(;n>o.lookaheadSize;)i.tokens[o.lookaheadSize]=ln(e.tokenizer,t),o.lookaheadSize+=1;return Yt(t)},f=(n=!1)=>{if(o.lookaheadSize!==0)throw new s(`ParseAlgorithm: GetExpr called after lookahead`);let r=cn(e.tokenizer,t,n);return i.tokens[0]=e.tokenizer.delimiter,i.columns[0]=e.tokenizer.delimiterCol,i.lines[0]=e.tokenizer.delimiterLine,o.lookaheadSize=1,r},h=(e,t)=>{if(e===`;`){let e=u(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new p(`Missing \`;' before line ${i.lines[0]+1}, column ${i.columns[0]+1}`)}let n=l();n!==e&&n!==t&&c(`Expected "${e}" but found "${n}"`)},g=e=>{let t=l();t!==e&&c(`Expected "${e}" but found "${t}"`)},_=()=>{let e=l();return e===`=`?!0:e===`\\in`||e===`∈`?!1:c(`Expected "=" or "\\in" but found "${e}"`)},v=()=>h(u(1)===`,`?`,`:`;`),y=()=>h(o.pSyntax?`begin`:`{`),b=e=>{o.cSyntax?h(`}`):(h(`end`),h(e))},x=()=>{u(1)===`variables`?g(`variables`):h(`variable`)},S=()=>{let e={...z(),kind:`VarDecl`,var:l(),col:a.column,line:a.line,isEq:!0,val:dn()};if(![`=`,`\\in`,`∈`].includes(u(1)))return o.hasDefaultInitialization=!0,e;if(e.isEq=_(),e.val=f(),e.val.tokens.length===0)throw new m(`NullPointerException`);return e},C=()=>{x();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(u(1));)e.push(S()),v();return e},w=()=>{let e={...z(),kind:`PVarDecl`,var:l(),col:a.column,line:a.line,val:dn()};if(u(1)!==`=`)return o.hasDefaultInitialization=!0,e;if(h(`=`),e.val=f(),e.val.tokens.length===0)throw new m(`NullPointerException`);return e},ee=()=>{x();let e=[];for(;u(1)!==`begin`&&u(1)!==`{`;)e.push(w()),v();return e},T=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(u(1)))return!1;let e=Yt(t);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},E=()=>{if(!T())return``;let t=l();e.isInMacro&&c(`A label may not appear in a macro.`),t===`Done`&&c("Cannot use `Done' as a label."),t===`Error`&&c("Cannot use `Error' as a label."),h(`:`),o.hasLabel=!0,o.allLabels.add(t);let n=u(1);return n!==`+`&&n!==`-`||(h(n),(n===`+`?o.plusLabels:o.minusLabels).push(t),o.omitPC=!1),t},D=()=>{let e=[],t=e=>o.pSyntax&&[`end`,`else`,`elsif`,`or`].includes(e)||o.cSyntax&&e===`}`;for(;!t(u(1));)e.push(...k());return o.cSyntax&&e.length===0&&c(`Empty statement list`),e},O=e=>{g(`{`);let t=D();if(h(`}`),h(`;`),e!==``){if(t[0].lbl!==``)throw new p(`Duplicate labeling of statement`,t[0]);t[0].lbl=e}return t},k=()=>{let e=E();if(o.cSyntax&&u(1)===`{`)return O(e);let t=te();return t.lbl=e,[t]},te=()=>{let e=u(1);if(e===`if`)return j(0);if(e===`either`)return ne();if(e===`with`)return re(0);if(e===`when`||e===`await`){g(e);let t=a.column,n=a.line,r=f();if(r.tokens.length===0)throw new m(`NullPointerException`);return h(`;`),{...z(),kind:`When`,col:t,line:n,exp:r}}if(e===`print`||e===`assert`){g(e);let t=a.column,n=a.line,r=f();return r.tokens.length===0&&c(`Empty expression in ${e} statement at `),h(`;`),{...z(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){g(`skip`);let e={...z(),kind:`Skip`,col:a.column,line:a.line};return h(`;`),e}if(e===`call`)return oe();if(e===`return`){g(`return`);let e={...z(),kind:`Return`,col:a.column,line:a.line,from:o.currentProcedure};return h(`;`),e}if(e===`goto`){g(`goto`);let e=a.column,t=a.line,n=l();return o.gotoUsed=!0,(n===`Done`||n===`"Done"`)&&(o.gotoDoneUsed=!0),h(`;`),{...z(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?A():d(1)[0]===`(`?se():M()},A=()=>{g(`while`);let e=a.column,t=a.line;o.cSyntax&&h(`(`);let n=f();o.cSyntax&&h(`)`),n.tokens.length===0&&c(`Empty while test at `),o.pSyntax&&h(`do`);let r=o.pSyntax?D():k();return o.pSyntax&&(h(`end`),h(`while`),h(`;`)),r.length===0&&c(`Missing body of while statement at`),{...z(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},j=e=>{g(e===0?`if`:`elsif`);let t={...z(),kind:`LabelIf`,col:a.column,line:a.line,test:At(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};o.cSyntax&&h(`(`),t.test=f(),o.cSyntax&&h(`)`),t.test.tokens.length===0&&c(`Empty if test at `),o.pSyntax&&h(`then`),t.unlabThen=o.pSyntax?D():k();let n=u(1);return n===`else`&&(g(`else`),t.unlabElse=o.pSyntax?D():k()),o.pSyntax&&n===`elsif`&&(t.unlabElse=[j(e+1)]),o.pSyntax&&![`else`,`elsif`,`end`].includes(n)&&c(`Expecting "else", "elsif", or "end"`),o.pSyntax&&e===0&&(h(`end`),h(`if`),h(`;`)),t.unlabElse.length===0&&Dt(t.unlabThen,t.unlabThen.length-1),t},ne=()=>{g(`either`);let e={...z(),kind:`LabelEither`,col:a.column,line:a.line,clauses:[]};for(;;){let t={...z(),kind:`Clause`,unlabOr:o.pSyntax?D():k(),labOr:[]};if(t.unlabOr.length===0)throw new p("`either' statement with empty `or' clause",e);if(e.clauses.push(t),u(1)!==`or`)break;g(`or`)}if(o.pSyntax&&(g(`end`),h(`either`),h(`;`)),e.clauses.length===1)throw new p("`either' statement has no `or'",e);return e},re=e=>{e===0&&(h(`with`),o.cSyntax&&h(`(`));let t={...z(),kind:`With`,col:a.column,line:a.line,var:l(),isEq:!0,exp:At(),Do:[]};t.isEq=_(),t.exp=f(),(o.pSyntax||u(1)!==`)`)&&v(),t.exp.tokens.length===0&&c(`Empty with expression at `);let n=o.pSyntax&&u(1)===`do`,r=o.cSyntax&&u(1)===`)`;if(n&&h(`do`),r&&g(`)`),t.Do=n?D():r?k():[re(e+1)],n&&(h(`end`),h(`with`),h(`;`)),t.Do.length===0)throw new p(`Missing body of with statement`,t);return t},ie=()=>{let e=i.columns[0]+1,t=i.lines[0]+1,n={...z(),kind:`Lhs`,col:e,line:t,var:l(),sub:f()};h(`:=`,`≔`);let r=f();return r.tokens.length===0&&c(`Empty right-hand side of assignment at `),{...z(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},M=()=>{let e={...z(),kind:`Assign`,col:i.columns[0]+1,line:i.lines[0]+1,ass:[ie()]};for(;u(1)===`||`||u(1)===`‖`;){l();try{e.ass.push(ie())}catch(e){if(!(e instanceof p))throw e;c(`Bad assignment statement at `)}}return h(`;`),e},ae=()=>{let e=[];if(d(0)[0]!==`)`)for(;;){let t=f();if(e.push(t),t.tokens.length===0&&c(`Empty argument in call statement at `),u(1)===`)`)break;h(`,`)}return h(`)`),h(`;`),e},N=()=>{g(`call`);let e={...z(),kind:`Call`,col:a.column,line:a.line,returnTo:``,to:l(),args:[]};return h(`(`),e.args=ae(),o.proceduresCalled.includes(e.to)||o.proceduresCalled.push(e.to),e},oe=()=>{let e=N();if(u(1)===`return`)return g(`return`),h(`;`),{...z(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:o.currentProcedure,args:e.args};if(u(1)!==`goto`)return e;g(`goto`);let t={...z(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:l(),args:e.args};return o.gotoUsed=!0,(t.to===`Done`||t.to===`"Done"`)&&(o.gotoDoneUsed=!0),h(`;`),t},se=()=>{let e={...z(),kind:`MacroCall`,name:l(),col:a.column,line:a.line,args:[]};return g(`(`),e.args=ae(),e},ce=t=>{e.isInMacro=!0,g(`macro`);let n={...z(),kind:`Macro`,col:a.column,line:a.line,name:l(),params:[],body:[]};for(h(`(`);u(1)!==`)`;)n.params.length>0&&h(`,`),n.params.push(l());return g(`)`),y(),n.body=D(),b(`macro`),u(1)===`;`&&l(),be(n.body,t),e.isInMacro=!1,n},le=()=>{h(`procedure`);let e={...z(),kind:`Procedure`,col:a.column,line:a.line,name:l(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(o.currentProcedure=e.name,o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],h(`(`);u(1)!==`)`;)e.params.length>0&&h(`,`),e.params.push(w());return g(`)`),u(1)!==`begin`&&u(1)!==`{`&&(e.decls=ee()),y(),e.body=D(),b(`procedure`),u(1)===`;`&&l(),o.currentProcedure=void 0,e.plusLabels=o.plusLabels,e.minusLabels=o.minusLabels,e.proceduresCalled=o.proceduresCalled,e},ue=()=>{h(`process`);let e=a.column,t=a.line;o.cSyntax&&h(`(`);let n=l(),r=_(),i=f();o.plusLabels=[],o.minusLabels=[],o.proceduresCalled=[],o.cSyntax&&h(`)`),i.tokens.length===0&&c(`Empty process id at `);let s=u(1)===`begin`||u(1)===`{`?[]:C();y();let d=D();return b(`process`),u(1)===`;`&&l(),{...z(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:o.minusLabels,plusLabels:o.plusLabels,proceduresCalled:o.proceduresCalled,isEq:r,id:i,decls:s,body:d}},de=()=>{let e=`${r.labelRoot}${o.nextLabelNum}`;return o.nextLabelNum+=1,o.allLabels.has(e)?de():e},fe=e=>{e.lbl===``&&(e.lbl=de(),o.addedLabels.push(e.lbl),o.addedLabelsLocs.push(Tt(e)))},pe=(e,t,n,r,i)=>{mn(r,i);let a={isNextLabeled:t,hasLabel:!1},s=e=>{fe(e),a.hasLabel=!0,i.length=0};return e.forEach(e=>{if(e.lbl!==``&&(a.hasLabel=!0,i.length=0,n))throw new p("Label in `with' statement",e);if(a.isNextLabeled){if(n)throw new p("Statement follows `call' or `return' inside a `with' statement.",e);s(e),a.isNextLabeled=!1}switch(e.kind){case`LabelIf`:{let t=[],r=[],o=pe(e.unlabThen,!1,n,i,t);a.isNextLabeled=pe(e.unlabElse,!1,n,i,r)||o,mn(fn(t,r),i);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let r=[];a.isNextLabeled=pe(e.unlabOr,!1,n,i,r)||a.isNextLabeled,mn(fn(r,t),t)}),mn(t,i);return}case`While`:if(n)throw new p("`while' inside a `with' statement",e);s(e),pe(e.unlabDo,!1,!1,i,[]),a.isNextLabeled=!1;return;case`With`:{let t=[];a.isNextLabeled=pe(e.Do,!1,!0,n?[...r]:[],t),mn(t,i),!n&&!pn(r,i)&&s(e);return}}let t=e.kind===`Call`||e.kind===`CallGoto`,c=e.kind===`Return`||e.kind===`CallReturn`,l=e.kind===`Assign`?fn([],e.ass.map(e=>e.lhs.var)):t||c?[`stack`,...c||e.to===o.currentProcedure?o.procedures.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(a.isNextLabeled=t||c||e.kind===`Goto`,pn(i,l))mn(fn(i,l),i);else{if(n)throw new p(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);s(e),mn(l,i)}}),a.hasLabel||a.isNextLabeled},me=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return me(n),{unlabeled:n,labeled:he(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},he=e=>{let t=[];return e.forEach(e=>{if(e.lbl===``&&t.length>0)t[t.length-1].stmts.push(e);else{if(e.lbl===``)throw new s(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);t.push({...z(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),t.forEach(e=>me(e.stmts)),t},ge=(e,t)=>{let n=e[t];switch(n.kind){case`LabelIf`:{let r=P(n.unlabThen);n.labThen.forEach(e=>P(e.stmts));let i=P(n.unlabElse);return n.labElse.forEach(e=>P(e.stmts)),n.labThen.length>0||n.labElse.length>0||r===2||i===2?2:(e[t]={...z(),kind:`If`,test:n.test,Then:n.unlabThen,Else:n.unlabElse},+(r+i>0))}case`LabelEither`:{let r=n.clauses.reduce((e,t)=>{let n=Math.max(e,P(t.unlabOr));return t.labOr.forEach(e=>P(e.stmts)),t.labOr.length>0?2:n},0);return r===2?2:(e[t]={...z(),kind:`Either`,ors:n.clauses.map(e=>e.unlabOr)},r)}case`With`:{let e=P(n.Do);if(e===2)throw new p(`with statement at ${Tt(n)} contains a labeled statement`);return e}case`While`:if(t!==0)throw new s("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return P(n.unlabDo),n.labDo.forEach(e=>P(e.stmts)),0;case`Call`:return e[t+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(o.currentProcedure===void 0)throw new p(`return statement not in a procedure at ${Tt(n)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new s(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${n.kind}`)}},P=e=>{for(let t=0;t<e.length;t++){let n=ge(e,t);if(n!==0){if(t===e.length-1)return n;throw new s(`Translator discovered later than it should have that\n Statement at ${Tt(e[t+1])} must have a label`)}}return 0},_e=e=>{pe(e,!0,!1,[],[]);let t=he(e);return t.forEach(e=>P(e.stmts)),t},ve=(e,t,n,r,i)=>{let a=e=>Ht(e,t,n),o=e=>e.map(e=>ve(e,t,n,r,i)),c=e=>e.map(e=>({...z(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>ve(e,t,n,-1,0))})),l={...z(),col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine};switch(e.kind){case`Assign`:return{...l,kind:`Assign`,ass:e.ass.map(e=>ye(e,t,n,r,i))};case`If`:return{...l,kind:`If`,test:a(e.test),Then:o(e.Then),Else:o(e.Else)};case`Either`:return{...l,kind:`Either`,ors:e.ors.map(o)};case`With`:return{...l,kind:`With`,var:e.var,isEq:e.isEq,exp:a(e.exp),Do:o(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...l,kind:e.kind,exp:a(e.exp)};case`Skip`:return{...l,kind:`Skip`,macroCol:r>0?i:0,macroLine:r>0?r:-1};case`While`:return{...l,kind:`While`,test:a(e.test),unlabDo:o(e.unlabDo),labDo:c(e.labDo)};case`LabelIf`:return{...l,kind:`LabelIf`,test:a(e.test),unlabThen:o(e.unlabThen),labThen:c(e.labThen),unlabElse:o(e.unlabElse),labElse:c(e.labElse)};case`LabelEither`:return{...l,kind:`LabelEither`,clauses:e.clauses.map(e=>({...z(),kind:`Clause`,labOr:c(e.labOr),unlabOr:o(e.unlabOr)}))};case`Call`:return{...l,kind:`Call`,to:e.to,returnTo:e.returnTo,args:Ut(e.args,t,n)};case`Return`:return{...l,kind:`Return`,from:e.from};case`CallReturn`:return{...l,kind:`CallReturn`,to:e.to,from:e.from,args:Ut(e.args,t,n)};case`CallGoto`:return{...l,kind:`CallGoto`,to:e.to,after:e.after,args:Ut(e.args,t,n)};case`Goto`:return{...l,kind:`Goto`,to:e.to};default:throw new s(`Found unexpected statement type in macro at${Tt(e)}`)}},ye=(e,t,n,r,i)=>{let a=Ht(e.rhs,t,n),o={...z(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:Ht(e.lhs.sub,t,n)},s={...z(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine,lhs:o,rhs:a},c=n.indexOf(o.var);if(c===-1)return s;let l=t[c],u=Lt(l,{line:0,item:0});if(u.type!==xt.ident)throw new p(`Macro expansion substitutes \`${u.string}' for assignment variable\n at ${Tt(s)}`);if(o.var=u.string,Rt(l,{line:0,item:0},1)===void 0)return s;let d=Pt(l);return d.tokens[0].splice(0,1),jt(d),o.sub.tokens.length===0?o.sub=d:Ft(o.sub,d,0),s},be=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return be(e.unlabThen,t),be(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>be(e.unlabOr,t)),[e];case`With`:return be(e.Do,t),[e];case`While`:return be(e.unlabDo,t),[e];case`MacroCall`:return xe(e,t);default:return[e]}});e.splice(0,e.length,...n)},xe=(e,t)=>{let n=t.findLast(t=>t.name===e.name);if(n===void 0)throw new p(`Macro ${e.name} undefined,\n at ${Tt(e)}`);if(n.params.length!==e.args.length)throw new p(`Macro ${e.name} called with wrong number of arguments at \n ${Tt(e)}`);let r=n.body.map(t=>ve(t,e.args,n.params,e.line,e.col));return r.length>0&&(r[0].lbl=e.lbl),r},Se=e=>{e.forEach((t,n)=>{if(e.slice(n+1).some(e=>e.name===t.name))throw new p(`Multiple definitions of macro name \`${t.name}'`)})},Ce=e=>{if(e.length===0)return;let t=()=>{o.omitPC=!1,o.omitStutteringWhenDone=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!It(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(o.omitPC=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(o.omitPC=!1)},we=()=>{let e=o.addedLabels.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new p([e,...o.addedLabelsLocs].join(`
19
+ `))},Te=()=>{r.reportLabelsFlag?(e.log(o.addedLabels.length>1?`The following labels were added:`:`The following label was added:`),o.addedLabels.forEach((t,n)=>e.log(` ${t} at ${o.addedLabelsLocs[n]}`))):e.log(`Labels added.`)},Ee=e=>o.procedures.forEach(t=>{o.currentProcedure=t.name,be(t.body,e),t.body=_e(t.body)}),De=()=>{n&&(l()!==`algorithm`&&c("`--fair' not followed by `algorithm'"),r.fairAlgorithm=!0);let t=l();o.cSyntax=u(1)===`{`,o.pSyntax=!o.cSyntax,o.cSyntax&&g(`{`);let i=u(1)===`variable`||u(1)===`variables`?C():[],a={value:At()};u(1)===`define`&&(g(`define`),o.cSyntax&&h(`{`),a.value=f(!0),b(`define`),h(`;`));let s=[];for(;u(1)===`macro`;)s.push(ce(s));for(;u(1)===`procedure`;)o.procedures.push(le()),o.omitPC=!1;if(u(1)===`fair`&&(u(2)===`process`||u(2)===`+`&&u(3)===`process`)||u(1)===`process`){let e=[];for(;u(1)===`fair`||u(1)===`process`;){let t=u(1)===`fair`;t&&g(`fair`);let n=t&&u(1)===`+`;n&&g(`+`);let i=n||!t&&r.fairnessOption===`sf`?2:t||r.fairnessOption===`wf`?1:0;e.push({...ue(),fairness:i})}b(`algorithm`),Se(s);let n=e.map(e=>(be(e.body,s),e.body=_e(e.body),o.omitStutteringWhenDone=!0,Ce(e.body),o.omitStutteringWhenDone));return o.omitStutteringWhenDone=n.includes(!0),Ee(s),o.addedLabels.length>0&&(r.labelFlag||we(),Te()),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),o.gotoUsed&&(o.omitPC=!1),{...z(),kind:`Multiprocess`,name:t,decls:i,defs:a.value,macros:s,prcds:o.procedures,procs:e}}r.inputVersionNumber===1500&&u(1)===`fair`&&(h(`fair`),u(1)===`+`&&h(`+`),r.fairnessOption=`wf`),n&&([``,`wf`,`wfNext`].includes(r.fairnessOption)||e.log(`Warning: Option \`${r.fairnessOption}' specified for --fair algorithm.`),r.fairnessOption=`wf`),y();let d=D();Se(s),be(d,s),Ee(s),o.cSyntax&&h(`}`),b(`algorithm`);let p=_e(d);return o.addedLabels.length>0&&(o.hasLabel&&!r.labelFlag&&we(),Te()),o.gotoUsed&&(o.omitPC=!1),o.gotoDoneUsed||Ce(p),o.gotoDoneUsed&&(o.omitPC=!1,o.omitStutteringWhenDone=!1),{...z(),kind:`Uniprocess`,name:t,decls:i,defs:a.value,macros:s,prcds:o.procedures,body:p}};try{return{ast:De(),omitPC:o.omitPC,omitStutteringWhenDone:o.omitStutteringWhenDone,hasDefaultInitialization:o.hasDefaultInitialization}}catch(e){if(!(e instanceof m))throw e;return c(`Unknown error at or before`)}},V={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},gn=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],_n=/* @__PURE__ */ new Set([V.global,V.processVar,V.procedureVar,V.parameter]),vn=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),yn=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),bn=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},xn=(e,t)=>{let n=e.processes.findIndex(e=>e.name===t);return n===-1?e.processes.length:n},Sn=(e,t,n,r,i,a,o)=>!(t===V.procedureVar||t===V.processVar||t===V.parameter?vn(e,V.global,n,``)!==void 0||yn(e,n,r)!==void 0:vn(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,contextType:i,line:a,col:o,useThis:n}),!0),Cn=(e,t,n,r)=>vn(e,t,n,r)?.useThis??n,wn=(e,t,n)=>{let r=yn(e,t,n);return r===void 0?t:_n.has(r.type)?r.useThis:t},Tn=e=>{let t={symbols:[],procedures:[],processes:[],disambiguateReport:[],errorReport:``,initialPC:void 0},n=(e,n,i)=>{Sn(t,V.label,e.label,n,i,e.line,e.col)||(t.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>r(e,n,i))},r=(e,t,i)=>{let a=e=>e.forEach(e=>r(e,t,i)),o=e=>e.forEach(e=>n(e,t,i));switch(e.kind){case`While`:a(e.unlabDo),o(e.labDo);return;case`If`:a(e.Then),a(e.Else);return;case`With`:a(e.Do);return;case`LabelIf`:a(e.unlabThen),o(e.labThen),a(e.unlabElse),o(e.labElse);return;case`Either`:e.ors.forEach(a);return;case`LabelEither`:e.clauses.forEach(e=>{a(e.unlabOr),o(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new s(`Unexpected AST type ${e.kind}`)}},i=(e,n,r=`process`,i=n===``?V.global:V.processVar)=>{Sn(t,i,e.var,n,r,e.line,e.col)||(t.errorReport+=`\n${gn[i]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(Sn(t,V.global,`pc`,``,``,0,0),e.prcds.length>0&&Sn(t,V.global,`stack`,``,``,0,0),e.decls.forEach(e=>i(e,``)),e.prcds.forEach(e=>{let r=bn(t,e.name)<t.procedures.length;r&&(t.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:Et(e.body[0]).label}),Sn(t,V.procedure,e.name,``,`procedure`,e.line,e.col),e.decls.forEach(t=>i(t,e.name,`procedure`,V.procedureVar)),e.params.forEach(t=>i(t,e.name,`procedure`,V.parameter)),e.body.forEach(t=>n(Et(t),e.name,`procedure`))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let r=xn(t,e.name)<t.processes.length;r&&(t.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.processes.push({name:e.name,initialPC:e.body.length===0?void 0:Et(e.body[0]).label}),Sn(t,V.process,e.name,``,`process`,e.line,e.col),e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>n(Et(t),e.name,`process`))}),e.kind===`Uniprocess`&&(e.body.length>0&&(t.initialPC=Et(e.body[0]).label),e.body.forEach(e=>n(Et(e),``,``))),t.errorReport.length>0)throw new p(t.errorReport);return t},En=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1;for(let n=0;n<=7;n+=1)e.symbols.forEach(r=>{if(r.type!==n)return;r.useThis=r.id;for(let e=1;n>0&&t(r.useThis);e+=1)r.useThis+=e===1?`_`:r.context[e-2]??String(n);if(r.id===r.useThis)return;let i=r.context.length===0?``:` of ${r.contextType} ${r.context}`;e.disambiguateReport.push(`\\* ${gn[r.type]} ${r.id}${i} at line ${r.line} col ${r.col} changed to ${r.useThis}`)})},Dn=e=>{let t=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${gn[e.type]} name`);if(t.length>0)throw new p(`Cannot use \`defaultInitValue' as ${t.join(` or `)}`)},On=(e,t,n)=>{let r=(e,n)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==xt.ident)return;let a=wn(t,e.string,n);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(Mt([[jn(a)]])))})),i.length>0&&Vt(e,i,r,!1)},i=(e,n)=>{e.var=wn(t,e.var,n),r(e.val,n)},a=(e,n)=>e.forEach((r,i)=>{e[i]=Cn(t,V.label,r,n)}),o=(e,n)=>e===void 0?void 0:Cn(t,V.procedure,e,n),c=(e,n)=>{e.label=Cn(t,V.label,e.label,n),e.stmts.forEach(e=>l(e,n))},l=(e,n)=>{let i=e=>e.forEach(e=>l(e,n)),a=e=>e.forEach(e=>c(e,n)),u=e=>e.forEach(e=>r(e,n));switch(e.kind){case`LabeledStmt`:c(e,n);return;case`While`:i(e.unlabDo),a(e.labDo),r(e.test,n);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=wn(t,e.lhs.var,n),r(e.lhs.sub,n),r(e.rhs,n)});return;case`If`:i(e.Then),i(e.Else),r(e.test,n);return;case`With`:r(e.exp,n),i(e.Do);return;case`When`:case`PrintS`:case`Assert`:r(e.exp,n);return;case`Skip`:return;case`LabelIf`:r(e.test,n),i(e.unlabThen),a(e.labThen),i(e.unlabElse),a(e.labElse);return;case`Call`:e.returnTo=Cn(t,V.procedure,e.returnTo,n),e.to=Cn(t,V.procedure,e.to,n),u(e.args);return;case`Return`:e.from=o(e.from,n);return;case`CallReturn`:e.from=o(e.from,n),e.to=Cn(t,V.procedure,e.to,n),u(e.args);return;case`CallGoto`:e.after=Cn(t,V.procedure,e.after,n),e.to=Cn(t,V.procedure,e.to,n),u(e.args);return;case`Goto`:if(vn(t,V.label,e.to,n)===void 0&&e.to!==`Done`)throw new p(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=Cn(t,V.label,e.to,n);return;case`Either`:e.ors.forEach(i);return;case`LabelEither`:e.clauses.forEach(e=>{i(e.unlabOr),a(e.labOr)});return;default:throw new s(`Unexpected AST type${e.kind}`)}},u=e=>{e.decls.forEach(t=>i(t,e.name)),e.params.forEach(t=>i(t,e.name)),e.body.forEach(t=>c(Et(t),e.name));let n=Dt(t.procedures,bn(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=Cn(t,V.label,n.initialPC,e.name)),e.name=Cn(t,V.procedure,e.name,``),n.name=e.name},d=e=>{e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>c(Et(t),e.name));let n=Dt(t.processes,xn(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=Cn(t,V.label,n.initialPC,e.name)),e.name=Cn(t,V.process,e.name,``),n.name=e.name};e.decls.forEach(e=>i(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(u);let r=e.map(e=>e.name),i=e.map(e=>r.map(t=>e.proceduresCalled.includes(t)));r.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=r.filter((e,n)=>i[t][n])});for(let e of t){d(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=r.indexOf(t[e]);if(a===-1){n(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}r.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(u),e.body.forEach(e=>c(Et(e),``))),t.initialPC!==void 0&&(t.initialPC=Cn(t,V.label,t.initialPC,``))},kn=e=>Ot(e,0,xt.string),An=e=>Ot(e,0,xt.added),H=e=>Ot(e,0,xt.builtin),jn=e=>Ot(e,0,xt.ident),Mn=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+kt(r)+t;n.push(Ot(e.string,i,e.type))}),Mt([n])},Nn=e=>e.tokens.forEach((t,n)=>{let r={column:n===0||n===e.tokens.length-1?1:6};t.forEach(e=>{if(e.column=r.column,r.column+=kt(e),e.type===xt.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r.column=e.column+5;return;case`[`:case`<<`:r.column+=1;return;case`]`:case`>>`:e.column+=1,r.column+=1;return;case`\\o`:e.column+=1,r.column+=2}})}),Pn=(e,t,n,r=0,i=0)=>({...z(),kind:`SingleAssign`,line:r,col:i,lhs:{...z(),kind:`Lhs`,var:e,sub:t},rhs:n}),Fn=(e,t=0,n=0)=>({...z(),kind:`Assign`,line:t,col:n,ass:e}),In=(e,t,n=0,r=0)=>Fn([Pn(e,Mt([]),t,n,r)],n,r),Ln=e=>{if(e.tokens.length>1)return!1;let t=Dt(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},Rn=e=>({...z(),kind:`When`,exp:Mn([An(`pc`),H(`=`),kn(e)],1)}),zn=e=>In(`pc`,Mt([[kn(e??`null`)]])),Bn=e=>[jn(`Head`),H(`(`),An(`stack`),H(`)`),H(`.`),jn(e)],Vn=()=>[jn(`Tail`),H(`(`),An(`stack`),H(`)`)],Hn=e=>Mt([Bn(e)]),Un=(e,t,n,r)=>{let i=[[H(`<<`),H(`[`),jn(`procedure`),H(`|->`),kn(e),H(`,`)],[jn(`pc`),H(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(H(`,`)),i.push([jn(e.var),H(`|->`),jn(e.var)])}),i[i.length-1].push(H(`]`),H(`>>`)),i.push(r);let a=At(i);return Nn(a),jt(a),a},Wn=(e,t,n)=>{if(t.params.length!==n.args.length)throw new p(`Procedure ${n.to} called with wrong number of arguments`,n);return t.params.forEach((t,r)=>e.ass.push(Pn(t.var,Mt([]),n.args[r],n.line,n.col))),[e,...t.decls.map(e=>In(e.var,e.val,n.line,n.col)),zn(t.initialPC)]},Gn=(e,t,n)=>{let r={procedure:void 0},i=(e,n)=>{let r=bn(t,e.to);if(r===t.procedures.length)throw new p(`Call of non-existent procedure ${e.to}`,e);let i=t.procedures[r],a=Un(e.to,[kn(n)],[...i.decls,...i.params],[H(`\\o`),An(`stack`)]);return Wn(In(`stack`,a,e.line,e.col),i,e)},a=e=>{e.from??=r.procedure;let n=e.from;if(n===void 0)throw new p("`return' statement not in procedure",e);let i=bn(t,n);if(i>=t.procedures.length)throw new p(`Error in procedure (perhaps name used elsewhere)`,e);let a=t.procedures[i],o=(t,n)=>Fn([Pn(t,At(),n,e.line,e.col)],e.line,e.col);return[o(`pc`,Hn(`pc`)),...a.decls.map(e=>o(e.var,Hn(e.var))),...a.params.map(e=>o(e.var,Hn(e.var))),o(`stack`,Mt([Vn()]))]},o=e=>{let n=e.from;if(n===void 0)throw new p(`\`return' statement following \`call' at ${Tt(e)} not in a procedure`);let r=Dt(t.procedures,bn(t,n)),i=bn(t,e.to);if(i===t.procedures.length)throw new p(`Call of non-existent procedure ${e.to}`,e);let a=t.procedures[i],o=Fn([],e.line,e.col);if(n!==e.to){r.decls.forEach(t=>o.ass.push(Pn(t.var,At(),Hn(t.var),e.line,e.col)));let t=Un(e.to,Bn(`pc`),[...a.decls,...a.params],[H(`\\o`),...Vn()]);o.ass.push(Pn(`stack`,Mt([]),t,e.line,e.col))}return Wn(o,a,e)},s=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!n};let r={stmts:e,labeledStmts:[],needsGoto:!1},c=e[e.length-1];switch(c.kind){case`LabelIf`:case`LabelEither`:{let n=c.kind===`LabelIf`?f(c,t):m(c,t);e.pop(),e.push(n.stmt),r.labeledStmts=n.labeledStmts;break}case`Goto`:e.pop(),e.push(zn(c.to));break;case`Call`:e.pop(),e.push(...i(c,t));break;case`Return`:e.pop(),e.push(...a(c));break;case`CallReturn`:e.pop(),e.push(...o(c));break;case`CallGoto`:e.pop(),e.push(...i({...z(),kind:`Call`,returnTo:``,to:c.to,args:c.args,line:c.line,col:c.col},c.after));break;case`If`:{let e=s(c.Then,t),i=s(c.Else,t);r.labeledStmts.push(...e.labeledStmts,...i.labeledStmts),c.Then=e.stmts,c.Else=i.stmts,n||(r.needsGoto=e.needsGoto&&i.needsGoto,r.needsGoto||(e.needsGoto&&c.Then.push(zn(t)),i.needsGoto&&c.Else.push(zn(t))));break}case`Either`:{let e=c.ors.map((e,n)=>{let i=s(e,t);return c.ors[n]=i.stmts,r.labeledStmts.push(...i.labeledStmts),i});r.needsGoto=e.every(e=>e.needsGoto),!n&&!r.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&c.ors[n].push(zn(t))});break}case`With`:{let e=s(c.Do,t);c.Do=e.stmts,r.labeledStmts.push(...e.labeledStmts),r.needsGoto=e.needsGoto;break}default:r.needsGoto=!0}return n&&(r.needsGoto=!1),r},c=(e,t)=>{let n=s(e,t);return n.needsGoto&&n.stmts.push(zn(t)),n},l=(e,t)=>{let r=e.stmts.at(0);if(r?.kind===`While`)return d(e,r,t);let i=c([...e.stmts],t),a=[];return n||(i.stmts.unshift(Rn(e.label)),a.push({...z(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},u=(e,t)=>e.flatMap((n,r)=>l(n,r<e.length-1?e[r+1].label:t)),d=(e,t,r)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=c([...t.unlabDo],i),o=c(e.stmts.slice(1),r),s=Ln(t.test),l=s?a.stmts:[{...z(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...z(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...n?[]:[Rn(e.label)],...l]},...u(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},f=(e,t)=>{let n=c(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=c(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=u(e.labThen,t);return i.push(...u(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...z(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},m=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=c(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...u(e.labOr,t))}),{stmt:{...z(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},h=(e,t)=>u(e.map(Et),t),g=e=>{r.procedure=e.name;let n=h(e.body,Cn(t,V.label,`Error`,``));return r.procedure=void 0,{...z(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:n}},_=e=>({...z(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:h(e.body,`Done`)}),v=e.prcds.map(g);return e.kind===`Uniprocess`?{...z(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,body:h(e.body,`Done`)}:{...z(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:v,procs:e.procs.map(_)}},Kn=(e,t)=>{let n=t?[]:[`pc`];if(n.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&n.push(`stack`),e.prcds.forEach(e=>{n.push(...e.params.map(e=>e.var)),n.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>n.push(...e.decls.map(e=>e.var))),n.length===0)throw new p(`The algorithm has no variables.`);let r=(e,t)=>{let r=n.indexOf(t);return r===-1?0:(e[r]+=1,e[r])},i=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),a=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),o=(e,t)=>{let o=[...t];e.ass=a(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(t=>{let i=e.ass.filter(e=>e.lhs.var===t);if(!n.includes(t))throw new p(`Assignment to undeclared variable ${t}`,i[0]);let a=i.some(e=>e.lhs.sub.tokens.length===0);if(r(o,t)>1||i.length>1&&a)throw new p(`Multiple assignment to ${t}`,e)}),i(t,o)},c=(e,t)=>{switch(e.kind){case`Assign`:o(e,t);return;case`If`:{let n=[...t],r=[...t];e.Then.forEach(e=>c(e,n)),e.Else.forEach(e=>c(e,r)),i(t,n),i(t,r);return}case`Either`:{let n=[...t];e.ors.forEach(e=>{let r=[...t];e.forEach(e=>c(e,r)),i(n,r)}),i(t,n);return}case`With`:e.Do.forEach(e=>c(e,t));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new s(`Unexpected AST type ${e.kind}`)}},l=e=>e.forEach(e=>{let t=n.map(()=>0);Et(e).stmts.forEach(e=>c(e,t))});e.prcds.forEach(e=>l(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(l)},qn=(e,t,n,r)=>{let i=Tn(e);En(i),i.disambiguateReport.length>0&&r(`Warning: symbols were renamed.`),On(e,i,r),Kn(Gn(e,i,t),t),n&&Dn(i)},Jn=`[ \\t\\n\\x0B\\f\\r]`,Yn=RegExp(`\\\\\\* BEGIN TRANSLATION${Jn}+\\(${Jn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${Jn}*(=${Jn}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${Jn}*STRING)${Jn}*\\/\\\\${Jn}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${Jn}*(=${Jn}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${Jn}*STRING)${Jn}*\\)`),Xn=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),Zn=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),Qn=(e,t)=>Zn(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${Tt(t.node)}`),$n=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),er=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},tr=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},nr=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},rr=e=>/^[\p{L}\p{Nd}_]$/u.test(e),ir=(e,t,n)=>{for(;t.line<e.length;){let r=tr(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=nr(r,e,` `),!0}t.column=nr(r,t.column,` `)}return!1},ar=(e,t)=>Zn(e,`Command-line error: ${t}`),or=(e,t)=>{let n=e.params,r={isFirst:!0,isExplicitNof:!1},i=t=>(r.isFirst&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(ar(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let a=0;a<t.length;a++){let o=t[a],s=t[a+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){ar(e,`
20
+ Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){ar(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}n.specFile=s,a+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:n.noOld=!0;continue;case`-nocfg`:n.nocfg=!0;continue;case`-noDoneDisjunct`:case`noDoneDisjunct`:n.noDoneDisjunct=!0;continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!i(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(r.isExplicitNof=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){ar(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){ar(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,a+=1;continue;case`-version`:case`version`:{if(s===void 0){ar(e,"Version number must follow `-version' option");return}let t=Ct(s);if(t<0||t>1903){Zn(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),ar(e,`Bad version number`);return}n.inputVersionNumber=t,a+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){ar(e,"Integer value at least 60 must follow `-lineWidth' option");return}a+=1;continue;default:ar(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!r.isExplicitNof&&(n.fairnessOption=`wf`)},sr=(e,t,n)=>{if(tr(t,n),n.column+=7,!tr(t,n).slice(n.column).startsWith(`(`)){Zn(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=tr(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=nr(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?Zn(e,`No closing ')' found in options statement`):or(e,r)},cr=(e,t,n)=>{let r={depth:0,isDone:!1,isInString:!1};for(let i=t;!r.isDone&&i<e.length;i++){let a=e[i],o=i===t?n:0,s=[a.slice(0,o)];r.isInString=!1;for(let e=o;!r.isDone&&e<a.length;e++){let t=a[e],n=a.slice(e,e+2);if(n===`(*`&&!r.isInString)r.depth+=1,s.push(` `),e+=1;else if(n===`*)`&&!r.isInString&&r.depth===0)s.push(n),r.isDone=!0;else if(n===`*)`&&!r.isInString)--r.depth,s.push(` `),e+=1;else if(r.depth>0)s.push(` `);else if(r.isInString&&t===`\\`&&n.length===2)s.push(n),e+=1;else{if(!r.isInString&&n===`\\*`){s.push(` `);break}t===`"`&&(r.isInString=!r.isInString),s.push(t)}}if(r.isInString)return new p(`Unterminated string in line ${i+1}`);e[i]=s.join(``)}},lr=(e,t)=>{let n=10*2**Math.max(0,Math.ceil(Math.log2(t/10)));throw new m(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${n}`)},ur=(e,t,n)=>{if(!t.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let r=$n(t),i={line:0,column:0};for(;ir(r,i,`PlusCal`);){let t=tr(r,i).slice(i.column),n=Array.from(t).findIndex(e=>!rr(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){e.params.optionsInFile=!0,sr(e,r,i);break}}let a={line:0,column:-1,isFound:!1,isFair:!1};for(;a.line<r.length;a.line++){let e=r[a.line];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){a.column=t+11,a.isFound=!0;break}if(n!==-1){a.column=n+6,a.isFound=!0,a.isFair=!0;break}}let o=/* @__PURE__ */ new Set,s=er(r,0,`BEGIN`,`TRANSLATION`);s===-1&&o.add(`NO_TRANSLATION_EXISTS`);let c=er(r,s+1,`END`,`TRANSLATION`);if(c===-1&&o.add(`NO_TRANSLATION_EXISTS`),s===-1&&c===-1)return o;if(!a.isFound)return o.add(`NO_PLUSCAL_EXISTS`),o;let l=cr(r,a.line,a.column);if(l!==void 0)return Qn(e,l),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let u={ast:void 0};try{let n=Kt(r,a.line,a.column,t.length,0),i=hn(e,n,a.isFair);u.ast=i.ast,qn(i.ast,i.omitPC,i.hasDefaultInitialization,e.log)}catch(t){if(!(t instanceof p))throw t;Qn(e,t)}s===-1&&lr(-1,r.length);let d=Yn.exec(r[s]);if(d===null)return o.add(`NO_PCAL_CHECKSUMS_EXIST`),o;let f=d.groups?.pcal,h=a.isFair&&n!==`1.7.4`?`fair`:u.ast===void 0?void 0:Gt(u.ast,e.params.inputVersionNumber,n);f!==void 0&&(h===void 0||f!==Xn(h))&&o.add(`PCAL_DIVERGENCE_EXISTS`);let g=d.groups?.tla;if(g!==void 0){if(c===-1)throw new m(`java.lang.IllegalArgumentException: fromIndex(${s+1}) > toIndex(-1)`);let e=t.slice(s+1,c).join(``);g!==Xn(e)&&o.add(`TLA_DIVERGENCE_EXISTS`)}return o.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):o},dr=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],fr={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},U=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),pr=e=>dr.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...U(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...U(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:fr,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),mr=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},hr=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,gr=e=>e?.kind===`OpAppl`&&e.isAbsent===!0,_r=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},vr=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),yr=(e,t)=>(e&2147483647)%t,br=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[yr(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},xr=(e,t,n=t)=>e.buckets[yr(_r(n),e.buckets.length)].find(e=>e.key===t)?.value,Sr=(e,t,n,r=t)=>{let i=_r(r),a=e.buckets[yr(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&br(e),e.buckets[yr(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},Cr=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),wr=`\0module `,W=()=>({table:vr(),symbols:[]}),Tr=e=>e.kind===`Module`?wr+e.name:e.name,Er=(e,t)=>{Sr(e.table,Tr(t),t,t.name),e.symbols.push(t)},Dr=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Or=(e,t)=>xr(e.table,t),kr=(e,t)=>xr(e.table,wr+t,t),Ar=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),jr=(e,t)=>Cr(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),Mr=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Nr=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),Pr=e=>{let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},Fr=e=>{switch(e.kind){case`Identifier`:return Pr(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=Pr(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r={value:0};return t.map((t,i)=>{let a=e.args.slice(r.value,r.value+n[i]);return r.value+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},Ir=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Lr=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Rr=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,zr=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Br=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,Vr=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],Hr=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},Ur=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l=e=>t[e].location??a,u={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},d=e=>e.args??[];for(;u.index<t.length;){let f=t[u.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(l(u.index),`Selector \`${f.name}' should not have argument(s).`);switch(u.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&u.index<t.length;){let n=t[u.index];if(p=n.op===`Name`?u.name===void 0?e.resolveSynonym(n.name):`${u.name}!${e.resolveSynonym(n.name)}`:void 0,u.name===void 0&&n.op!==`Name`)return e.addError(l(u.index),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=u.letInContext===void 0?e.resolveSymbol(p):Or(u.letInContext,p)),f===void 0&&(p!==void 0&&(u.name=p,u.nameLocation=Hr(u.nameLocation,l(u.index))),m.push(...d(n)),u.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(l(n),`Unknown operator: \`${Lr(t[n])}'.`)}if(f===void 0)return e.addError(u.nameLocation??a,`Unknown operator: \`${u.name}'.`);if(f.kind===`Module`)return e.addError(l(u.index),`Module name (${t[u.index].name}) not allowed here.`);if(u.node=f,u.nameLocation=Hr(u.nameLocation,l(u.index)),u.name=p,zr(f)&&t.length!==1)return e.addError(l(u.index),`Cannot take subexpression of \`${u.name}'.`);let h=Dr(f);if(n===0){if(m.push(...d(t[u.index])),u.definitionArityFound+m.length!==h)return e.addError(t[u.index].argsLocation??a,`The operator ${u.name} requires ${h-u.definitionArityFound} arguments.`);m.forEach((t,n)=>u.definitionArgs.push(e.generateArgument(f,n+u.definitionArityFound,t,l(u.index))))}if(u.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(u.index===t.length-1&&!(i||r))return e.addError(l(u.index),`Operator name ${u.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(l(u.index),`Subexpression of \`${u.name}' used inside the operator's definition.`);if(u.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),u.name=void 0,u.nameLocation=void 0,u.mode=t[u.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...u.definitionArgs),u.definitionArityFound=0,u.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;u.mode===`FindingSubExpr`&&(u.node=e)}}u.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=u.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(l(u.index),`Cannot find label \`${f.name}'.`);if(u.node=i,e.isOutOfLabelScope(i))return e.addError(l(u.index),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(l(u.index),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),u.index<t.length-1&&t[u.index+1].op!==`Name`&&(u.mode=`FindingSubExpr`),u.mode===`FindingSubExpr`&&(u.node=i.body),u.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=u.node,r=()=>e.addError(l(u.index),`Nonexistent operand specified by \`${Lr(f)}'.`);if(f.op===`:`){if(!(u.previousMode!==`FindingSubExpr`&&(u.index===t.length-1&&u.previousMode===`FindingOpName`||u.index<t.length-1&&t[u.index+1].op===`Name`)))return e.addError(l(u.index),`\`!:' can be used only after a name and either at the end after an
21
+ operator name or before an operator name.`)}else if(n===void 0)return e.addError(l(u.index),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(Rr(f.op,1)!==1)return e.addError(l(u.index),`A LET/IN expression has only one operand.`);u.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(l(u.index),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=Rr(f.op,a.length);if(o){let e=Rr(f.op,i.arity);if(e===-1)return r();u.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();u.node=e.operands[1]}else if(i.name===`$Case`){if(u.index===t.length-1)return e.addError(l(u.index),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();u.index++;let i=Rr(t[u.index].op,2);if(i===-1)return e.addError(l(u.index),`Second selector for CASE subexpression must specify one of two operands.`);if(u.node=n.operands[i-1],u.node===void 0)return e.addError(l(u.index),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(l(u.index),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();u.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();u.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=Vr(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(l(u.index),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}u.node=a[0]}else{let e=Rr(f.op,n.ranges.length);if(e===-1)return r();u.node=n.ranges[e-1]}}else return e.addError(l(u.index),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!u.isInSuffices){if(Rr(f.op,1)!==1)return e.addError(l(u.index),`Accessing non-existent subexpression of a SUFFICES`);u.isInSuffices=!0}else{u.isInSuffices=!1;let i=Rr(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(l(u.index),`Accessing ASSUME/PROVE clause within the scope of a declaration
22
+ from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?Dr(f.op):u.previousMode===`FindingOpName`&&Br(f)?Dr(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:Dr(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=Nr.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},Wr=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Gr=(e,t)=>`${e}:${t}`,Kr=(e,t)=>{let n=oe(t).filter(e=>e.kind!==`End`).map(ce),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
23
+ `&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[Gr(e.line,e.column),t]))}},G=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,qr=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},Jr=(e,t)=>e.tokenIndexes.get(Gr(t.line,t.column))??Math.min(qr(e,t,!1),e.tokens.length-1),Yr=(e,t)=>Math.max(qr(e,t,!0)-1,0),Xr=(e,t)=>{let n=e.tokens[t].text,r=Wr.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(G(e,a,n))i++;else if(G(e,a,r)&&(i--,i===0))return a;return t},Zr=(e,t)=>({start:Jr(e,t.start),end:Yr(e,t.end)}),K=(e,t)=>{let n=t.location.range;if(n)return Zr(e,n);let r=Jr(e,t.location);return{start:r,end:Xr(e,r)}},Qr=(e,t)=>{let n=t.start-1,r=t.end+1;return G(e,n,`(`)&&G(e,r,`)`)&&Xr(e,n)===r?Qr(e,{start:n,end:r}):t},$r=(e,t)=>{let n=t.start-1,r=t.end+1;return G(e,n,`(`)&&Xr(e,n)===r&&(G(e,n-1,`(`)||G(e,n-1,`,`))?$r(e,{start:n,end:r}):t},q=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),J=(e,t)=>q(e,{start:t,end:t}),ei=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?re(r):r+1,r>=n)return i;i++}return i},ti=(e,t)=>{let n=e.tokens[t],r=ei(e,n.line,n.column);return e.source.slice(r,ei(e,n.line,n.endColumn)+1)},ni=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},ri=e=>{let n=Kr(``,e),r=n.tokens.reduce((e,t,r)=>{if(!ni(n,r))return e;let i=ei(n,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(r!==e&&M(e)!==void 0)throw new t(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return r},ii=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:ei(e,n.line,n.endColumn)+1,a=e.source.slice(i,ei(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
24
+ `,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},ai=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},oi=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(G(e,i,r))return i;return-1},si=new Map(ee.flatMap(([e,...t])=>t.map(t=>[t,e]))),ci=e=>e.split(`!`).map(e=>si.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),li={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},ui=e=>/^[A-Za-z0-9_]+$/.test(e),di=e=>e!==`!!`&&e.includes(`!`),fi=e=>e.contexts[e.contexts.length-1],pi=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Or(e.contexts[n],t);if(r)return r}},mi=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,hi=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,gi=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||_i(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&_i(n.module)}return!1},_i=e=>jr(e,2).length===0&&jr(e,3).length===0,vi=e=>[...e.kind===`Let`?e.instances??[]:[],...S(e).flatMap(vi)],yi=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:yi(e)):vi(e),bi=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},xi=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?vi(e.definition.body):e.kind===`Theorem`&&s?yi(e.theorem.statement):e.kind===`Assumption`&&s?vi(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!bi(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},Si=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Ci=e=>{let t=e.kind===`Apply`?Fr(e):void 0;return Si.has(e.kind)||t!==void 0&&Ir(t)},wi=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),Ti=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Ei=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Di=(e,t)=>Ei.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Oi=(e,n,r={})=>{let a=[],o=(e,t)=>mr(a,{location:e,text:t,isWarning:!1}),s=(e,t)=>mr(a,{location:e,text:t,isWarning:!0}),c={value:r.version===`1.7.4`?-1:0},l=()=>++c.value,u={id:0},f=(e,t)=>{let n=pi(e,t.name);if(n===t)return;if(n===void 0){Er(fi(e),t);return}let i=t.kind===`FormalParam`||mi(n)!==mi(t)||Dr(n)!==Dr(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(i&&r.version===`1.7.4`)?o(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):i?o(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${hr(n.location)}.`):gi(t,n)||s(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${hr(n.location)}.`)};r.version!==`1.7.4`&&pr(l);let p=pr(l);l();let m=new Map(p.map(e=>[e.name,e])),g=/* @__PURE__ */ new Map,v=/* @__PURE__ */ new Map,y=(e,n)=>{let a=e===r.rootFileName&&r.rootFilePath||`${e}.tla`,o=t=>new i(`Could not parse module ${e} from file ${a}`,e,t),s=r.version===`1.7.4`?_(n):void 0;if(s!==void 0)throw o(s);try{return ae(ri(n))}catch(e){throw e instanceof t?o(M(n)??`***Parse Error***\n${e.message}`):e}},b=(e,t,n)=>{let a=v.get(e);if(a)return a;if(t===void 0)throw new h(e,n,r.version!==`1.7.4`);r.onParse?.(e);let o=y(e,t);if(o.name!==e)throw new i(`File name '${e}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:Kr(o.name,t),module:o};return v.set(e,s),s},x=[],S=/* @__PURE__ */ new Set,C=[],w=(e,t,r)=>{let a=C.indexOf(e);if(a!==-1)throw new i(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...C.slice(a),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(S.has(e))return;S.add(e),C.push(e);let o=k(e,b(e,t,r).module);[...o.extendees,...o.instancees].forEach(t=>w(t,n(t),e)),C.pop(),x.push(e)},ee=/* @__PURE__ */ new Set,T=(e,t)=>ee.has(`${e} ${t}`),E=(e,t,n)=>{let r=v.get(e);if(!r||n.has(e))return;n.add(e);let i=k(e,r.module),a=i[t].find(t=>!T(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=T(e,r)?E(r,t,n):void 0;if(i)return i}},D=t=>{b(t,e);let r=()=>E(t,`extendees`,/* @__PURE__ */ new Set)??E(t,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())v.has(e.name)||b(e.name,n(e.name),e.namingModule),ee.add(`${e.importer} ${e.name}`)},O=r.rootFileName??y(``,e).name,k=(e,t)=>{let n=xi(t);return e!==O||r.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...r.rootExtendees),r.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};D(O),w(O,e);let te=(e,n,i,a)=>{let c={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},p=[],h=[],_=[],v=[],y=/* @__PURE__ */ new WeakSet,b=()=>v.push({labels:/* @__PURE__ */ new Map,params:[]}),x=()=>v.pop()?.labels??/* @__PURE__ */ new Map,S={depth:0,isDeclared:[],goal:void 0,goalClause:0},C=/* @__PURE__ */ new WeakMap,w=/* @__PURE__ */ new WeakMap,ee=e=>{let t=e.kind===`AssumeProve`?C.get(e):void 0;t&&(t.isInProof=!1)},T=e=>q(n,K(n,e)),E=e=>e.range?Zr(n,e.range):{start:Jr(n,e),end:Jr(n,e)},D={kind:`Module`,id:l(),name:e.name,location:q(n,E(e.location)),extendees:[],context:fi(a),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};i&&i.definitions.push(D);let O=e=>{for(let t=a.contexts.length-1;t>=0;t--){let n=kr(a.contexts[t],e);if(n?.kind===`Module`)return n}return g.get(e)},k=e=>{let n=O(e);if(n===void 0)throw new t(`Could not find module ${e}`);return n},A=(e,t)=>{a.contexts.push(e);let n=t();return a.contexts.pop(),n},j=(e,t,n,r)=>{let i={...U(l()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&f(a,i),i},ne=e=>({...U(l()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:D,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),re=e=>{e.letInLevel=c.curLevel,c.unresolvedSum>0&&(e.recursiveSection=c.recursiveSectionCount,e.inRecursiveSection=c.unresolvedCount[c.curLevel]>0,D.opDefsInRecursiveSection.push(e))},ie=(e,t,n,r={},i=l())=>({...U(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),M=()=>({...ie(ae(`$Nop`),[],fr,{},u.id),isNull:!0}),ae=e=>{let t=m.get(e);if(!t)throw new d(`SANY has no builtin operator ${e}`);return t},N=(e,t,n,r={})=>ie(ae(e),t,n,r),oe=(e,t)=>({...U(l()),kind:`String`,value:e,location:t}),se=(e,t)=>({...U(l()),kind:`OpArg`,op:e,location:t}),ce=(e,n)=>{let r=pi(a,ci(e));if(r===void 0||r.kind===`Module`)throw new t(`Unknown operator: \`${e}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},le=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let a=t[i];r.arity===0&&a.kind===`OpArg`&&o(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=a.kind===`OpArg`&&Dr(a.op)===r.arity&&!(a.op.kind===`OpDef`&&(a.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&o(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):o(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},ue=Ur({version:r.version,resolveSymbol:e=>pi(a,e),resolveSynonym:ci,generateExpression:e=>F(e),generateArgument:(e,t,n,r)=>be(e,t,n,r),createOpAppl:(e,t,n)=>{let r=ie(e,t,n);return le(e,t,n),r},createOpArg:se,createFormalParam:(e,t,n)=>j(e,t,n,!1),createLambda:(e,t,r)=>ne({name:`LAMBDA`,params:e,body:t,location:r,preComments:ii(n,Jr(n,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>Ue(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:ae,addError:(e,t)=>(o(e,t),M()),isOutOfLabelScope:e=>{let t=w.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=C.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),de=(e,t)=>{let r={value:t.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=oi(n,r.value,t.end,i);if(a===-1)return e;if(e.op===`Null`){let t=Xr(n,a);return r.value=t+1,{...e,location:q(n,{start:a,end:t})}}r.value=a+1;let o=J(n,a);if(e.args===void 0||!G(n,a+1,`(`))return{...e,location:o};let s=Xr(n,a+1);return r.value=s+1,{...e,location:o,argsLocation:q(n,{start:a+1,end:s})}})},fe=(e,r,i,a)=>{let o=Fr(e);if(o===void 0)throw new t(`Expected a name, found ${e.kind}`);return ue(de(o,K(n,e)),r,i,a,T(e))},pe=e=>{let n=fe(e,0,!1,!1);if(n.kind!==`OpAppl`)throw new t(`Expected an expression`);return n},me=e=>{if(e.kind!==`OpAppl`)return;let t=p.find(t=>t.name===e.operator.name);t&&(t.node.operator=ae(`$RecursiveFcnSpec`))},he=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),ge=(e,t)=>Ne(e,t,he(e).map(e=>F(e[0].set))),P=(e,t)=>{let n=v.at(-1);n?.params.push(e);let r=F(t);return n?.params.pop(),r},_e=e=>{let t=K(n,e),r=ai(n,t.start,t.end,e.params);return A(W(),()=>{let i=e.params.map((e,t)=>j(e,0,J(n,r[t]),!0)),a=P(i,e.body);return ne({name:`LAMBDA`,params:i,body:a,location:q(n,t),preComments:ii(n,t.start)})})},ve=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:n.tokens[Jr(n,e.location)].text,ye=(e,n)=>{let r=T(e);if(e.kind===`Lambda`)return e.location.range===void 0?se(ce(ve(e),r),r):se(_e(e),r);if(!Ci(e))return o(r,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),M();if(e.kind===`OperatorReference`)return se(ce(e.operator,r),r);let i=fe(e,n.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new t(`Expected an operator argument at line ${r.beginLine}, column ${r.beginColumn}`)},be=(e,r,i,s)=>{let c=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[r]?.arity??0:0;if(c===0)return F(i);let l=K(n,i),u=q(n,l),d=`${r+1} (counting from 1)`,f=$r(n,l);if(f!==l||!Ci(i))return o(q(n,f),`An expression appears as argument number ${d} to operator '${e.name}', in a position an operator is required.`),M();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let e=fe(i,c,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new t(`Expected an operator argument at ${hr(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let t=_e(i),n=Dr(t);return n===c?se(t,u):(o(s,`Lambda expression with arity ${n} used as argument ${r+1} of operator \`${e.name}', \nbut an operator of arity ${c} is required.`),M())}let p=ve(i),m=pi(a,ci(p));if(m===void 0)return o(u,`Could not find declaration or definition of symbol '${p}'.`),M();let h=Dr(m);return h===c?se(m,u):(o(s,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${hr(e.location)}', \nbut an operator of arity ${c} was expected.`),M())},xe=e=>{let t=T(e);if(e.isBulleted)return N(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(F),t);let r=K(n,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,t,a)=>{let s=Qr(n,K(n,t)),c=a===o.length-1?r.end:s.end;return N(i,[e,F(t)],q(n,{start:r.start,end:c}))},F(a))},Se=e=>{let t=K(n,e),r=e.arms.map((r,i)=>{let a=Qr(n,K(n,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=Qr(n,K(n,r.body)),c=[F(r.condition),F(r.body)];return N(`$Pair`,c,q(n,{start:a.start,end:o?t.end:s.end}))}),i=e.other;if(i){let e=Qr(n,K(n,i)),a=Ce(e.start,`OTHER`);r.push(N(`$Pair`,[void 0,F(i)],q(n,{start:a,end:t.end})))}return N(`$Case`,r,q(n,t))},Ce=(e,t)=>{for(let r=e;r>=0;r--)if(G(n,r,t))return r;return e},we=e=>{let t=K(n,e),r=q(n,t),i=[F(e.function)],a=N(`$Except`,i,r),o=K(n,e.function),s={value:oi(n,o.end+1,t.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=oi(n,s.value,t.end,`!`),o=Qr(n,K(n,e.value)),c=q(n,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let t=Te(l.value,e.name);return l.value=t+1,oe(e.name,J(n,t))}let r=oi(n,l.value,t.end,`[`),i=Xr(n,r);return l.value=i+1,e.args.length===1?F(e.args[0]):N(`$Tuple`,e.args.map(F),q(n,{start:r,end:i}))}),d=N(`$Seq`,u,c),f=N(`$Pair`,[d],c);_.push(f),h.push(a),f.operands.push(F(e.value)),_.pop(),h.pop(),i.push(f),s.value=o.end+1}),a},Te=(e,t)=>{for(let r=e;r<n.tokens.length;r++)if(n.tokens[r].text===t&&n.tokens[r].kind!==`String`)return r;return e},Ee=(e,t)=>{let r=K(n,t),i={value:r.start+1},a=t.fields.map((e,r)=>{let a=Te(i.value,e.name),s=Qr(n,K(n,e.value));return i.value=s.end+1,t.fields.slice(0,r).some(t=>t.name===e.name)&&o(J(n,a),`Non-unique fields in constructor.`),N(`$Pair`,[oe(e.name,J(n,a)),F(e.value)],q(n,{start:a,end:s.end}))}),s=N(e,a,q(n,r));return D.records.push(s),s},De=e=>({line:n.tokens[e].line,column:n.tokens[e].column}),Oe=e=>{let t=[],r=e;for(;n.tokens[r]?.kind===`Identifier`;){let e=G(n,r+1,`(`)?Xr(n,r+1):r,i=n.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(t.push({name:n.tokens[r].text,arity:i,location:{...De(r),range:{module:n.name,start:De(r),end:De(e)}}}),!G(n,e+1,`,`))break;r=e+2}return t},ke=e=>{let t=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Fe(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Fe(e)}))],r=K(n,e).start,i=Qr(n,K(n,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=t.some(t=>t.span.start<=e&&e<=t.span.end);G(n,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:Oe(e+1)},span:{start:e,end:e}})}return[...t,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Ae=e=>{let t=W();return A(t,()=>{c.curLevel++,c.unresolvedCount[c.curLevel]=0;let n=[],r=[];ke(e).forEach(e=>{e.kind===`Recursive`?Be(e.declarations):e.kind===`Instance`?We(e.instance,n,r):e.definition.kind===`Function`?Re(e.definition,n):Ie(e.definition,n)}),Ve(),c.curLevel=Math.max(c.curLevel-1,0);let i=F(e.body);return{...U(l()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},je=e=>{let t=K(n,e),r=q(n,t);return A(W(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=ai(n,t.start,t.end,a),s=a.map((e,r)=>j(e,0,J(n,i.kind===`Name`?t.start:o[r]),!0)),c=P(s,e.body);return N(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=F(e.set),s=K(n,e.set),c=ai(n,t.start,s.start,a),l=a.map((e,t)=>j(e,0,J(n,c[t]),!0)),u=P(l,e.body);return N(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},Me=e=>{if(ui(e.operator)||di(e.operator)||e.args.length>2||pi(a,ci(e.operator))!==void 0)return;let t=K(n,e);if(n.tokens[t.start].text===e.operator&&G(n,t.start+1,`(`))return;let r=Qr(n,K(n,e.args[0])),i=e.args.length===1&&r.start!==t.start,o=i?t.start:r.end+1,s=ti(n,o);return{index:o,name:i&&s===`-`?`-.`:s,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},F=e=>{let t=T(e);switch(e.kind){case`Number`:return{...U(l()),kind:`Numeral`,value:ki(e.text??String(e.value)),location:t};case`Decimal`:{let[n,r]=e.text.split(`.`),i=BigInt(n+r),a=i<=9223372036854775807n;return{...U(l()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:n,fractionalPart:r,location:t}}case`String`:return oe(e.value,t);case`Identifier`:{let t=pe(e);return me(t),t}case`Apply`:{let r=Me(e);if(r!==void 0)return o(J(n,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),o(t,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...M(),isAbsent:!0};let i=pe(e);return(di(e.operator)||ui(e.operator))&&me(i),i}case`Bracket`:return o(J(n,K(n,e).start),"Unsupported expression type `['."),{...M(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=n.tokens[K(n,e).start].text;return o(t,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Di(e,r)}'.`),{...M(),isAbsent:!0}}case`And`:case`Or`:return xe(e);case`Prime`:return N(`'`,[F(e.expression)],t);case`Unchanged`:return N(`UNCHANGED`,[F(e.expression)],t);case`Enabled`:return N(`ENABLED`,[F(e.expression)],t);case`Always`:return N(`[]`,[F(e.expression)],t);case`Eventually`:return N(`<>`,[F(e.expression)],t);case`If`:return N(`$IfThenElse`,[F(e.condition),F(e.consequent),F(e.alternative)],t);case`Case`:return Se(e);case`Let`:return Ae(e);case`Forall`:case`Exists`:{let r=K(n,e);return A(W(),()=>{let n=ge(e.bounds,r.start),i=P(n.bounded.flat(),e.body);return N(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],t,n)})}case`UnboundedQuantifier`:{let r=K(n,e),i=K(n,e.body),a=ai(n,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return A(W(),()=>{let r=e.names.map((e,t)=>j(e,0,J(n,a[t]),!0)),i=P(r,e.body);return N(o,[i],t,{unbounded:r})})}case`Choose`:return je(e);case`SetEnumeration`:return N(`$SetEnumerate`,e.elements.map(F),t);case`Tuple`:return N(`$Tuple`,e.elements.map(F),t);case`SetFilter`:{let r=F(e.bound.set),i=K(n,e);return A(W(),()=>{let n=Ne([e.bound],i.start,[r]),a=P(n.bounded.flat(),e.predicate);return N(`$SubsetOf`,[a],t,n)})}case`SetMap`:{let r=K(n,e.expression);return A(W(),()=>{let n=ge(e.bounds,r.end+1),i=P(n.bounded.flat(),e.expression);return N(`$SetOfAll`,[i],t,n)})}case`FunctionConstruction`:{let r=K(n,e);return A(W(),()=>{let n=ge(e.bounds,r.start),i=P(n.bounded.flat(),e.body);return N(`$FcnConstructor`,[i],t,n)})}case`FunctionSet`:return N(`$SetOfFcns`,[F(e.domain),F(e.range)],t);case`Record`:return Ee(`$RcdConstructor`,e);case`RecordSet`:return Ee(`$SetOfRcds`,e);case`Except`:return we(e);case`ExceptAt`:{let e=h[h.length-1],n=_[_.length-1];return e===void 0||n===void 0?(o(t,`@ used where its meaning is not defined.`),M()):{...U(l()),kind:`At`,except:e,component:n,location:n.location}}case`FunctionApplication`:{let n=F(e.function);if(gr(n))return n;me(n);let r=e.args.length===1?F(e.args[0]):N(`$Tuple`,e.args.map(F),t);return N(`$FcnApply`,[n,r],t)}case`FieldAccess`:{let r=F(e.record),i=K(n,e);return N(`$RcdSelect`,[r,oe(e.field,J(n,i.end))],t)}case`Product`:return N(`$CartesianProd`,e.factors.map(F),t);case`BoxAction`:case`AngleAction`:return N(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[F(e.action),F(e.subscript)],t);case`WeakFairness`:case`StrongFairness`:return N(e.kind===`WeakFairness`?`$WF`:`$SF`,[F(e.subscript),F(e.action)],t);case`Label`:return I(e);case`Subexpression`:return pe(e)}},Ne=(e,t,r)=>{let i=he(e),a={value:t};return{bounded:i.map(e=>{let t=K(n,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=ai(n,a.value,t.start,r);return a.value=t.end+1,r.map((e,t)=>j(e,0,J(n,i[t]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},I=e=>{let t=T(e),r=v.at(-1);if(r===void 0)return o(t,`Label not in definition or proof step.`),M();if(S.isDeclared.slice(2,S.depth+1).some(Boolean))return o(t,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),M();if(h.length>0&&_.length>0)return o(t,`Labels inside EXCEPT clauses are not yet implemented.`),M();b();let i=F(e.body),s=x(),c=ai(n,K(n,e).start,K(n,e.body).start,e.params),u=e.params.map((t,r)=>{let i=pi(a,t);if(i?.kind===`FormalParam`)return i;let s=J(n,c[r]);return o(s,`Illegal parameter ${t} of label \`${e.name}'.`),j(t,0,s,!1)}),d={...U(l()),kind:`Label`,name:e.name,params:u,body:i,labels:s,isAssumeProve:!1,location:t},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&o(t,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||o(t,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);o(t,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?o(t,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=S.goal;return p&&w.set(d,{scope:p,clause:S.goalClause}),d},Pe=(e,t,r)=>{let i={value:t.start};return e.params.map(e=>{let t=e.location?Jr(n,e.location):Te(i.value,e.name),a=dt(t,e.arity);return i.value=a.end+1,j(ci(e.name),e.arity,q(n,a),r)})},Fe=e=>{let t=E(e.location);return e.isLocal&&!G(n,t.start,`LOCAL`)&&G(n,t.start-1,`LOCAL`)?{start:t.start-1,end:t.end}:t},Ie=(e,t)=>{let r=Fe(e),i=q(n,r),s=ci(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},u=A(W(),()=>{let t=Pe(e,l,!0),n=pi(a,s);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===c.curLevel?e||o(i,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):o(i,`Recursive operator ${s} defined at wrong LET/IN level.`)}else n!==void 0&&o(i,`Operator ${s} already defined or declared.`);return b(),{params:t,body:F(e.body),existing:n}}),d=x(),p=u.existing,m=u.params,h=ii(n,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===c.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=d,Le(p,u.body,i,h),D.definitions.push(p),t?.push(p);return}let g=ne({name:s,params:m,body:u.body,isLocal:e.isLocal,location:i,preComments:h,labels:d});f(a,g),re(g),D.definitions.push(g),t?.push(g)},Le=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(c.unresolvedCount[c.curLevel]--,c.unresolvedSum--)},Re=(e,t)=>{let r=Fe(e),i=q(n,r),s=W(),l=e.isLocal?r.start+1:r.start,u=A(s,()=>ge(e.bounds,l+1)),d=pi(a,e.name),m=A(s,()=>j(e.name,0,i,d===void 0)),h=N(`$NonRecursiveFcnSpec`,[],i,{unbounded:[m],...u}),g=d?.kind===`OpDef`&&d.inRecursive&&!d.isDefined,_=g&&d.letInLevel===c.curLevel;_?d.arity!==0&&o(i,`Function ${d.name} has operator arguments in its RECURSIVE declaration.`):g?o(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):d!==void 0&&o(i,`Function name \`${e.name}' already defined or declared.`);let v=ii(n,r.start),y=d===void 0?ne({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):d.kind===`OpDef`&&(_||!g)?d:void 0;_?d.arity===0&&Le(d,h,i,v):d===void 0&&y!==void 0&&(f(a,y),re(y)),y!==void 0&&(D.definitions.push(y),t?.push(y)),p.unshift({name:e.name,node:h}),b();let S=()=>P(u.bounded.flat(),e.body),C=y===void 0?S():A(s,S),w=x();y!==void 0&&(y.labels=w),p.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},ze=[],Be=e=>{c.unresolvedSum===0&&c.recursiveSectionCount++,c.unresolvedCount[c.curLevel]+=e.length,c.unresolvedSum+=e.length,e.forEach(e=>{let t=ft(e);l();let r=Array.from({length:e.arity},()=>j(``,0,void 0,!1)),i=ne({name:ci(e.name),params:r,location:q(n,t),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:c.recursiveSectionCount,letInLevel:c.curLevel});f(a,i),ze.push(i),D.opDefsInRecursiveSection.push(i)})},Ve=()=>{c.unresolvedCount[c.curLevel]!==0&&(ze.filter(e=>e.letInLevel===c.curLevel&&!e.isDefined).forEach(e=>o(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),c.unresolvedSum-=c.unresolvedCount[c.curLevel])},He=(e,t,i)=>{l();let s=Cr(t.table).filter(e=>e.kind===`OpDecl`),c=s.flatMap(e=>{let t=pi(a,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?ie(t,[],i):se(t,i),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?Dr(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&o(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Fe(e),f={value:oi(n,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let r=oi(n,f.value,d.end,e.name);r!==-1&&(f.value=K(n,e.expression).end+1);let a=Or(t,ci(e.name));if(a?.kind!==`OpDecl`){o(r===-1?i:J(n,r),`Identifier '${r===-1?e.name:ti(n,r)}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`);return}let s=a.arity===0?F(e.expression):ye(e.expression,a);u(a,s);let l=c.find(e=>e.op.name===a.name);l&&!l.isImplicit?o(T(e.expression),`Multiple substitutions for symbol '${a.name}' in substitution.`):l?(l.expr=s,l.isImplicit=!1):c.push({op:a,expr:s,isImplicit:!1})}),c.filter(e=>e.isImplicit&&r.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!c.some(t=>t.op.name===e.name)).forEach(e=>o(i,`Substitution missing for symbol ${e.name} declared at ${hr(e.location)} \nand instantiated in module ${D.name}.`)),c},Ue=(e,t,n,r,i,a=D)=>(gr(n)&&o(i,e===`SubstIn`?`Substitution error, probably due to error
25
+ in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...U(l()),kind:e,substs:t,body:n,instantiatingModule:a,instantiatedModule:r,location:i}),We=(e,t,i)=>{let o=Fe(e),s=q(n,o),c=ii(n,o.start),u=e.name??``,d=W(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&a.contexts.push(d);let m=Pe(e,{start:p,end:o.end},e.params.length>0),h=k(e.module),g=h.context,_=He(e,g,s);e.params.length>0&&a.contexts.pop(),Cr(g.table).forEach(n=>{if(n.kind!==`OpDef`||n.isLocal||n.defKind!==`UserDefined`&&n.defKind!==`ModuleInstance`)return;let r=[...m,...n.params??[]],i=`${u}!${n.name}`,o=n.defKind===`UserDefined`?ne({name:i,params:r,body:_.length>0&&n.body?Ue(`SubstIn`,_,n.body,h,s):n.body,isLocal:e.isLocal,location:s,source:n.source??n,preComments:c,labels:n.labels}):ne({defKind:`ModuleInstance`,name:i,params:r,isLocal:e.isLocal,location:s,module:n.module,source:n.source??n,preComments:c});f(a,o),n.defKind===`UserDefined`&&re(o),(t??D.definitions).push(o)}),Cr(g.table).forEach(n=>{if(n.kind!==`ThmOrAssumpDef`||n.isLocal)return;let r=_.length>0?Ue(`APSubstIn`,_,n.body,h,s):n.body,i={...U(l()),kind:`ThmOrAssumpDef`,name:`${u}!${n.name}`,isTheorem:n.isTheorem,body:r,params:[...m,...n.params],isLocal:e.isLocal,location:s,module:D,source:n.source??n,labels:n.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};f(a,i),(t??D.definitions).push(i)});let v={...U(l()),kind:`Instance`,name:u,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(i??D.topLevel).push(v);let y=ne({defKind:`ModuleInstance`,name:u,params:m,isLocal:e.isLocal,location:s,preComments:c});f(a,y),r.version!==`1.7.4`&&t?.push(y)},Ge=(e,t=!0,r)=>{let i=Fe(e),o=r??q(n,i),s=ii(n,i.start),c=k(e.module),u=c.context,d=He(e,u,o),p=e.isLocal,m=_i(c);Cr(u.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=ne({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return f(a,r),r},n=()=>(f(a,e),e),r=e.module===void 0||_i(e.module),i=m||r?p?t(e.module,e.body):n():t(D,e.body&&Ue(`SubstIn`,d,e.body,c,o));D.definitions.push(i),re(i)}),Cr(u.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let n=(t,n)=>{let r={...e,...U(l()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return f(a,r),r},r=m?p?n(e.module,e.body):(f(a,e),e):_i(e.module)?p?n(D,e.body):e:n(D,Ue(`APSubstIn`,d,e.body,c,o));t&&D.definitions.push(r)});let h={...U(l()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:c,substs:d,location:o};return t&&D.topLevel.push(h),h},Ke=e=>{let t=O(e.name)??(e.name===D.name?D:void 0);return t===void 0?(o(J(n,Jr(n,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[t]},qe=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ke(e);let n=Fr(e);if(n===void 0||!Ir(n))return[F(e)];let r=fe(e,0,!0,!1);if(r.kind===`ThmOrAssumpDef`)throw new t(`Expected a fact`);return[r]}),Je=e=>G(n,e.start,`(`)&&Xr(n,e.start)===e.end,Ye=e=>Qr(n,K(n,e)),Xe=(e,t)=>Ye(e.args[0]).start===t.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:n.tokens[t.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Ze=(e,t)=>Je(t)?`N_ParenExpr`:e.kind===`String`?ti(n,t.start):e.kind===`Apply`?Xe(e,t):wi.get(e.kind),Qe=(e,t)=>{if(e.kind===`String`&&!Je(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Ze(e,t);return n===void 0||Ti.has(n)?void 0:!0},$e=(e,t)=>{let r=(e,t=Ye(e))=>({last:t,lastKind:Ze(e,t)});if(Je(t))return{hasChildlessFirstChild:!1,...r(e,{start:t.start+1,end:t.end-1})};switch(e.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(e.kind===`If`?e.condition:e.action)};case`Tuple`:case`SetEnumeration`:{let i=e.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:t.end,end:t.end},lastKind:n.tokens[t.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:t.start+1,end:t.end})};case`Prime`:return{hasChildlessFirstChild:Qe(e.expression,Ye(e.expression)),last:{start:t.end,end:t.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let t=e.kind===`FunctionApplication`?e.function:e.record,r=Ye(t),i=r.end+1;return{hasChildlessFirstChild:Qe(t,r),last:{start:i,end:i},lastKind:n.tokens[i].text}}case`Apply`:{let n=Xe(e,t);if(n===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:t.start+1,end:t.end},lastKind:`N_OpArgs`};if(n===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:t.start+1,end:t.end})};let i=Ye(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:Qe(e.args[0],i),last:{start:a,end:a},lastKind:n===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},et=e=>{let t=Qr(n,K(n,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Je(t))return!1;let r=$e(e,t);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=q(n,r.last);return r.hasChildlessFirstChild&&o(q(n,t),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?o(i,"Selector `!(...)' should not have argument(s)."):(o(i,`Unexpected token found.`),o(i,`Need name or step number here, not \`${r.lastKind}'.`)),o(q(n,t),`DEF clause entry should describe a defined operator.`),!0},L=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ke(e);if(et(e))return[];let t=fe(e.kind===`OperatorReference`?{kind:`Identifier`,name:e.operator,location:e.location}:e,-1,!1,!0);return t.kind===`OpDef`||t.kind===`ThmOrAssumpDef`&&!t.name.startsWith(`<`)?[t]:(o(T(e),`DEF clause entry should describe a defined operator.`),[])}),tt=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||o(t,`Empty BY, USE, or HIDE`)},R=e=>{let t=q(n,E(e.location));tt(e,t);let r=qe(e.facts),i=L(e.defs);return r.length+i.length===0&&o(t,`Empty USE or HIDE statement.`),e.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(e=>o(e.location,`The only expression allowed as a fact in a HIDE is
26
+ the name of a theorem, assumption, or step.`)),{...U(l()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:t}},nt=e=>{let t=E(e.location),r=e.set&&F(e.set),i=Te(t.start,e.name),o=li[e.level],s={...U(l()),levelChecked:1,level:o.level,kind:`OpDecl`,name:ci(e.name),arity:e.arity,declKind:o.declKind,location:q(n,dt(i,e.arity)),module:D};return f(a,s),{...U(l()),kind:`NewSymb`,declaration:s,set:r,location:q(n,t)}},rt=(e,t,r)=>{let i=E(e.location),s=ni(n,i.start-1),c=K(n,e.conclusion).start,u=n.tokens.findLastIndex((e,t)=>t<c&&e.kind===`Keyword`&&e.text===`PROVE`),d=q(n,{start:s?i.start-1:i.start,end:i.start});s!==ni(n,u-1)&&o(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=l();t>1&&a.contexts.push(W()),s&&a.contexts.some(e=>y.has(e))&&o(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||y.add(fi(a));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};S.depth=t,S.isDeclared[t]=!1,t===1&&(S.goal=r&&p,S.goalClause=0);let m=e.assumptions.map((e,n)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?rt(e,t+1):r?nt(e):F(e);return S.depth=t,r&&(S.isDeclared[t]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[n]||r),t===1&&S.goalClause++,i}),h=F(e.conclusion);t>1&&a.contexts.pop(),S.depth=t-1,t===1&&(S.goal=void 0);let g={...U(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:q(n,{start:s?i.start-1:i.start,end:i.end})};return C.set(g,p),g},it=(e,t,n,r,i,a=!0)=>({...U(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:D,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),at=e=>{let t=q(n,E(e.location));e.kind===`By`&&tt(e,t);let r=e.kind===`By`?qe(e.facts):[],i=e.kind===`By`?L(e.defs):[];return e.kind===`By`&&l(),e.kind===`By`&&r.length+i.length===0&&o(t,`Empty BY`),{...U(l()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:t}},ot=(e,t)=>{let r=e.body,i=q(n,t);switch(r.kind){case`Have`:return{node:N(`$Have`,[F(r.expression)],i),isPick:!1};case`Case`:return{node:N(`$Pfcase`,[F(r.expression)],i),isPick:!1};case`Witness`:return{node:N(`$Witness`,r.expressions.map(F),i),isPick:!1};case`Qed`:return{node:N(`$Qed`,[],i),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&a.contexts.push(W());let s=e=>r.kind===`Pick`?[P(e,r.body)]:[];if(r.bounds.length>0){let n=ge(r.bounds,t.start),a=s(n.bounded.flat());return{node:N(o,a,i,n),isPick:e}}let c=ai(n,t.start,t.end+1,r.names),l=r.names.map((e,t)=>j(e,0,J(n,c[t]),!0)),u=s(l);return{node:N(o,u,i,{unbounded:l}),isPick:e}}}},st=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let t=Qr(n,K(n,e.args[0])),r=K(n,e).start;return t.start===r&&!G(n,t.end+1,`(`)},ct=e=>{if(e.kind!==`Steps`)return at(e);let r=W();a.contexts.push(r);let i=[],o=[],s={previousRight:void 0},c=(e,r,a)=>{if(e.kind===`Define`){let r=e.definitions.map(e=>{let n=[];e.kind===`Instance`?We(e,n,i):e.kind===`Function`?Re(e,n):Ie(e,n);let r=n[e.kind===`Instance`?n.length-1:0];if(r?.kind!==`OpDef`)throw new t(`A DEFINE step defines no operator`);return r});return{...U(l()),kind:`DefStep`,defs:r,location:q(n,a)}}if(e.kind===`Use`||e.kind===`Hide`)return{...R(e),location:q(n,r)};if(e.kind===`Instance`)return Ge(e,!1,q(n,a))},u=e.steps.map(e=>{let r=E(e.location),i=Zr(n,e.head),u={start:i.start+1,end:i.end},d=e.body;e.name!==void 0&&b();let p=e.name===void 0?void 0:l();d.kind!==`Assert`&&(s.previousRight=void 0);let m=c(d,r,u);if(m!==void 0)return e.name!==void 0&&f(a,ne({defKind:`NumberedProofStep`,name:e.name,location:q(n,r),labels:x(),step:m})),m;let h=d.kind===`Assert`&&d.statement.kind===`AssumeProve`;h&&(s.previousRight=void 0);let g=d.kind===`Assert`&&d.isSuffices,_=W(),v=d.kind===`Assert`?{node:(t=>{if(t.kind===`AssumeProve`){let n=A(_,()=>rt(t,1,e.name===void 0?void 0:{isSuffices:g}));return n.isSuffices=g,n}if(g){let e=F(t);return N(`$Suffices`,[e],q(n,u))}let r=s.previousRight,i=r!==void 0&&t.kind===`Apply`&&st(t)&&t.args[0].kind===`ExceptAt`,a=i?F(t.args[1]):void 0,o=i?ie(ce(t.operator,T(t)),[N(`$Nop`,[r],T(t.args[0])),a],T(t)):F(t),c=o.kind===`OpAppl`?o.operands[1]:void 0;return s.previousRight=st(t)?c:void 0,o})(d.statement),isPick:!1}:ot(e,u);if(v===void 0)throw new t(`Unexpected proof step ${d.kind}`);let y=v.isPick?a.contexts.pop():void 0,S=e.name===void 0||p===void 0?void 0:it(p,e.name,v.node,J(n,Jr(n,e.location)),x());S&&f(a,S);let C=h&&!g;C&&a.contexts.push(_);let w=e.proof&&ct(e.proof);return C&&a.contexts.pop(),ee(v.node),h&&g&&(o.push(_),a.contexts.push(_)),y?.symbols.forEach(e=>f(a,e)),{...U(l()),kind:`Theorem`,definition:S,body:v.node,proof:w,isSuffices:g,location:q(n,r)}});return o.forEach(()=>{a.contexts.pop()?.symbols.forEach(e=>Er(r,e))}),a.contexts.pop(),{...U(l()),kind:`NonLeafProof`,steps:u,instances:i,proofLevel:e.level,location:q(n,E(e.location))}},lt=e=>{let t=q(n,E(e.location)),r=e.statement,i=W();e.name!==void 0&&b();let o=e.name===void 0?void 0:l();r.kind===`AssumeProve`&&a.contexts.push(i);let s=r.kind===`AssumeProve`?rt(r,1,e.name===void 0?void 0:{isSuffices:!1}):F(r),c=e.name===void 0||o===void 0?void 0:it(o,e.name,s,t,x());c&&(r.kind===`AssumeProve`&&a.contexts.pop(),f(a,c),D.definitions.push(c),r.kind===`AssumeProve`&&a.contexts.push(i));let u=e.proof&&ct(e.proof);r.kind===`AssumeProve`&&a.contexts.pop(),ee(s);let d={...U(l()),kind:`Theorem`,definition:c,body:s,proof:u,isSuffices:!1,location:t};D.topLevel.push(d)},ut=e=>{let t=E(e.location),r=q(n,t);e.name!==void 0&&b();let i=F(e.expression),o=e.name===void 0?void 0:it(l(),e.name,i,r,x(),!1);o&&(f(a,o),D.definitions.push(o));let s={...U(l()),kind:`Assume`,definition:o,body:i,location:r};D.topLevel.push(s)},dt=(e,t)=>t===0?{start:e,end:e}:G(n,e,`_`)?{start:e,end:G(n,e+2,`_`)?e+2:e+1}:G(n,e+1,`(`)?{start:e,end:Xr(n,e+1)}:{start:e,end:G(n,e+1,`_`)?e+1:e},ft=e=>dt(E(e.location).start,e.arity),pt=(e,t)=>{let r=ft(e);e.name===`@`&&t===3&&o(q(n,r),`Attempted to declare '@' as a variable.`);let i={...U(l()),levelChecked:1,level:+(t===3),kind:`OpDecl`,name:ci(e.name),arity:e.arity,declKind:t,location:q(n,r),module:D};return t===2&&(i.levelParams.add(i),i.allParams.add(i)),f(a,i),i};e.extends.forEach(e=>{let t=k(e);D.extendees.push(t);let n=fi(a);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?kr(n,e.name):Or(n,e.name);t===void 0?Er(n,e):t!==e&&t.kind!==e.kind?o(e.location,`The ${hi(e)} of '${e.name}' conflicts with \nits ${hi(t)} at ${hr(t.location)}.`):t!==e&&!gi(t,e)&&s(e.location,`Warning: the ${hi(t)} of '${e.name}' conflicts with \nits ${hi(t)} at ${hr(t.location)}.`)}),D.topLevel.push(...t.topLevel)});let mt=(e,t)=>{c.unresolvedSum!==0&&o(q(n,E(e)),`${t} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:mt(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>pt(e,3));break;case`Constants`:mt(e.location,`A declaration`),e.declarations.forEach(e=>pt(e,2));break;case`Recursive`:Be(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Re(e.definition,void 0):Ie(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?Ge(e.instance):We(e.instance,void 0,void 0);break;case`Assumption`:mt(e.assumption.location,`An ASSUME`),ut(e.assumption);break;case`Theorem`:mt(e.theorem.location,`A THEOREM`),lt(e.theorem);break;case`Use`:mt(e.use.location,`A USE or HIDE`),D.topLevel.push(R(e.use));break;case`Module`:{mt(e.module.location,`A MODULE `);let t={contexts:[...a.contexts,W()]},r=te(e.module,n,D,t),i=O(r.name);i===void 0?Er(fi(a),r):i!==r&&o(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${hr(i.location)}.`);break}}}),Ve(),D},A=x.map(e=>{r.onAnalyze?.(e),u.id=Array.from({length:4},l)[1];let t=b(e,void 0),n=W();p.toReversed().forEach(e=>Er(n,e));let i=te(t.module,t.file,void 0,{contexts:[n]});return g.set(e,i),r.onModule?.(i,a),i});return{root:A[A.length-1],modules:A,messages:a}},ki=e=>{let t=e.toLowerCase(),n=t.startsWith(`\\b`)?2:t.startsWith(`\\o`)?8:t.startsWith(`\\h`)?16:10;return[...n===10?t:t.slice(2)].reduce((e,t)=>e*BigInt(n)+BigInt(parseInt(t,n)),0n).toString()},Ai=(e,t,n,r)=>mr(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},ji=(e,t,n)=>`${e.id}:${t}:${n.id}`,Mi=(e,t,n,r)=>{e.set(ji(t,n,r),{op:t,index:n,param:r})},Ni=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Pi=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Fi=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Pi(e,r,t)})},Ii=(e,t)=>`${e.id}:${t}`,Li=(e,t,n,r)=>{let i=Ii(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Ri=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&Li(e,t.param,t.position,t.level)})},zi=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Bi=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Fi(e.levelConstraints,t.levelConstraints),Ri(e.argLevelConstraints,t.argLevelConstraints),Ni(e.argLevelParams,t.argLevelParams)},Vi=(e,t)=>t.includes(e.op)||t.includes(e.param),Hi=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Ui=e=>e.kind!==`Module`,Wi=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Gi=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Ki=(e,t)=>e.kind===`OpDef`?e.weights[Gi(e,t)]??0:0,qi=(e,t)=>e.maxLevels[Gi(e,t)]??3,Ji=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,Yi=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Gi(e,t)]??!0:e.isLeibnizArg[t]??!0,Xi=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,Zi=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],Qi=(e,t)=>t.find(t=>t.op===e)?.expr,$i=(e,t,n)=>{let r=Qi(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},ea=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=Qi(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Hi(i.op))return;let a=i.op;$i(e.param,t,!1).forEach(t=>Mi(n,a,e.index,t))}),n},ta=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;$i(r,t,!1).forEach(e=>Pi(a,e,i))}),e.argLevelParams.forEach(e=>{let n=Qi(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=qi(n.op,e.index);$i(e.param,t,!1).forEach(e=>Pi(a,e,o))}),a},na=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=Qi(e.param,t);n===void 0?Li(i,e.param,e.position,e.level):n.kind===`OpArg`&&Hi(n.op)&&Li(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=Qi(e.param,t);if(a===void 0)return;let o=Qi(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Hi(s)&&(X(a,n,r),Li(i,s,e.index,a.level))}),i},ra=(e,t)=>jr(e,3).length>0||(fa(e,t),Ar(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),ia=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(Ii(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(ji(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(Ii(t,n))}),Ni(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},aa=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>qi(t,o)&&(n&&X(a,r,i)&&Ai(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!Wi(a.op)))return;let s=a.op;X(s,r,i);let c=Dr(s);for(let l=0;l<c;l++){let c=Ji(t,o,l);qi(s,l)>=c||(n&&X(a,r,i)&&Ai(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!Xi(t,o,l,u)||n.level<=qi(s,u)||(X(a,r,i)&&X(n,r,i)&&Ai(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&Ai(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${hr(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},oa=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Fi(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Fi(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Fi(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=qi(t,r);n?.levelParams.forEach(t=>Pi(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!Wi(n.op))return;let o=n.op;X(o,r,i);let s=Dr(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!Xi(t,a,r,i))continue;let s=qi(o,i);n?.levelParams.forEach(t=>Pi(e.levelConstraints,t,s)),!o.isLeibniz&&!Yi(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&Wi(n.op)&&(X(n.op,r,i),Pi(e.levelConstraints,t.param,qi(n.op,t.index)))}),Ri(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Ri(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Ri(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Hi(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)Li(e.argLevelConstraints,i,n,Ji(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Xi(t,r,a,o)&&Li(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),Li(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&Ni(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>Ni(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>Mi(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Hi(a.op)&&Mi(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Hi(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Xi(t,r,a,o)&&n.levelParams.forEach(t=>Mi(e.argLevelParams,i,o,t))})})},sa=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),ca=(e,t)=>{let n=(n,r)=>{Ai(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=sa.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},la=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(Wi(i)){let r=X(i,t,n);aa(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Ki(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(Ki(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Yi(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(Zi(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),oa(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Fi(e.levelConstraints,t.levelConstraints),Li(e.argLevelConstraints,i,n,t.level),Ri(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Mi(e.argLevelParams,i,n,t)),Ni(e.argLevelParams,t.argLevelParams)});return ca(e,n),e.levelCorrect},ua=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),ia(e,i,r),e.levelCorrect},da=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),ia(e,e.params,e.body)),e.levelCorrect),fa=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),ua(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||Ai(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),ua(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(fa(e,t)));let a=Ar(e);return a.forEach(e=>i(ua(e,1,t))),Mr(e).forEach(e=>i(da(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),ra(e,t)||jr(e,2).forEach(t=>Pi(e.levelConstraints,t,0)),a.forEach(t=>{Fi(e.levelConstraints,t.levelConstraints),Ri(e.argLevelConstraints,t.argLevelConstraints),Ni(e.argLevelParams,t.argLevelParams,e=>!Vi(e,t.params??[]))}),e.topLevel.forEach(t=>{Fi(e.levelConstraints,t.levelConstraints),Ri(e.argLevelConstraints,t.argLevelConstraints),Ni(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},pa=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Ui(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Bi(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),ma=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&Ai(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&Ai(t,e.body.location,`Non-constant CASE for temporal goal.`),ma(e.proof,t)):n===`$Qed`&&ma(e.proof,t)})},ha=(e,t,n,r,i,a)=>{e.levelConstraints=ta(t,n,r,i,a),e.argLevelConstraints=na(t,n,i,a),e.argLevelParams=ea(t.argLevelParams,n)},ga=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;fa(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=ra(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&Ai(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||Ai(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&Ai(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(Ii(i.op,t))?.level;a===void 0||qi(o,t)>=a||(s&&Ai(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=qi(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&Ai(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return Fi(e.levelConstraints,ta(r,e.substs,i,t,n),a),e.substs.forEach(t=>Fi(e.levelConstraints,t.expr.levelConstraints,a)),Ri(e.argLevelConstraints,na(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Ri(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),Ni(e.argLevelParams,ea(r.argLevelParams,e.substs),t=>!Vi(t,e.params)),e.substs.forEach(t=>Ni(e.argLevelParams,t.expr.argLevelParams,t=>!Vi(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Ui(e))return fa(e,n);switch(e.kind){case`OpAppl`:return la(e,t,n);case`OpDef`:return ua(e,t,n);case`ThmOrAssumpDef`:return da(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,zi(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),Fi(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Fi(e.levelConstraints,t.levelConstraints)),Ri(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Ri(e.argLevelConstraints,t.argLevelConstraints)),Ni(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];Ni(e.argLevelParams,t.argLevelParams,e=>!Vi(e,n))}),e.instances.forEach(t=>Ni(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,zi(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>Bi(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,$i(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,$i(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=ra(e.instantiatedModule,n);return ha(e,r,e.substs,i,t,n),e.levelCorrect}case`Instance`:return ga(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,zi(e,e.body),e.level!==0&&Ai(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=pa(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&Ai(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&ma(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return pa(e,e.facts,t,n);case`NonLeafProof`:return pa(e,[...e.steps,...e.instances],t,n);case`DefStep`:return pa(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,Ai(n,e.location,`Level error:
27
+ Temporal formula used as set.`)),zi(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Bi(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Pi(e.levelConstraints,t,2)})),e.levelCorrect}},_a=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},va=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),ya=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&va.get(e)===t.name||n(t))return!0}}return _a(e).some(n)};return n(e)},ba=e=>e.operands.filter(e=>e?.kind===`OpAppl`),xa=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},Sa=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(ba(t).map(e=>xa(e)?.value));return ba(e).every(e=>n.has(xa(e)?.value))},Ca=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),Ca(e,t))}),t),wa=e=>{let t=[...[...Ca(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>Sa(e,n)).flatMap(ba).some(ya)?[]:ba(n).flatMap(t=>{let n=xa(t),r=n&&Or(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${hr(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},Ta=e=>`${hr(e.location)}\n\n${e.text}`,Ea=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${Ta(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Ta(e)}\n\n\n`)].join(``)},Da=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Oa=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},ka=e=>{try{return ae(ri(e))}catch(e){if(e instanceof t)return;throw e}},Aa=(e,t)=>t===`1.7.4`&&_(e)!==void 0?void 0:ka(e)?.name,ja=(e,t=()=>void 0,n={})=>{let r=Oe(e,`.tla`),a=k(n.version),o=n.fileName??r,s=I(e)?Ie(e,`utf8`):a.get(r),c=[],l=e=>{c.push(e),n.onPrint?.(e)},u=e=>l(`${e}\n`),d=n.version===`1.7.4`,f=d&&n.isXmlExport,p=e=>{n.isXmlExport||u(e)},h=n.describeFile,g=/* @__PURE__ */ new Map([[r,I(e)?`file`:`standard`]]),_={value:!1},v=[],y={isReported:!1,isAborted:!1},x=un(St(),u),S=/* @__PURE__ */ new Map,C=[],w=()=>C.splice(0).forEach(e=>e.isError?n.onPrintError?.(`${e.text}\n`):u(e.text)),ee=e=>{let t=S.get(e),r=t?.module.location.range;if(t===void 0||r===void 0)return;let i=t.text.split(/\r\n|\r|\n/),a=ur(x,i.slice(r.start.line-1,r.end.line),n.version),o=a.has(`TLA_DIVERGENCE_EXISTS`),s=a.has(`PCAL_DIVERGENCE_EXISTS`),c=o===s?void 0:`The ${o?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(d){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?a.has(`ERROR_ENCOUNTERED`)&&C.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):C.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=o&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(a.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!a.has(`ERROR_ENCOUNTERED`)||o||s;v.some(e=>e.text===l)||v.push({location:e,text:l,isWarning:u})},T=(e,t)=>{if(n.isXmlExport||S.has(e))return;let r=ka(t);if(r===void 0||r.name!==e)return;let i=[...S.values()].filter(t=>Oa(t.module).includes(e));S.set(e,{text:t,module:r}),i.forEach(()=>ee(e)),Oa(r).filter(t=>t!==e&&S.has(t)).forEach(ee)},E=()=>{if(w(),y.isReported)return;y.isReported=!0;let e=v.filter(e=>e.isWarning);e.length>0&&(p(`Warnings (${e.length}) during syntax parsing of ${o}:\n\n`),e.forEach(e=>p(`${Ta(e)}\n\n\n`))),e.length!==v.length&&(u(Ea(v)),_.value=!0,y.isAborted=!0)},D=e=>{let n=a.get(e),r=t(e),i=r===void 0&&n===void 0&&s!==void 0&&!d?b(s,e):void 0,o=r??i;return g.set(e,r===void 0?i===void 0?`standard`:`root file`:`file`),o!==void 0&&T(e,o),o??n},O=(()=>{try{if(s===void 0)throw new i(`Cannot find source file for module ${o}`,void 0);return T(r,s),Oi(s,D,{rootFileName:r,rootFilePath:n.isXmlExport?`${o.replace(/\.tla$/,``)}.tla`:void 0,version:n.version,rootExtendees:n.rootExtendees,onParse:e=>{h&&u(`Parsing file ${h(e,g.get(e)??`file`)}`),e===r&&ee(r),w()},onAnalyze:e=>{E(),(h||f)&&!y.isAborted&&u(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(y.isAborted||(t.every(e=>e.isWarning)&&fa(e,{messages:t,isTlc174:d}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(_.value=!0),d)return u(`Semantic errors:\n\n${Ea(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(p(`*** Warnings: ${n.length}\n`),n.forEach(e=>p(`${Ta(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(u(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>u(`${Ta(e)}\n\n`)))}})}catch(e){if(_.value=!0,e instanceof m){u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),u(e.message),u(Ea(v));return}if(!(e instanceof i))throw e;let t={location:e.location,text:e.message,isWarning:!1},n=d&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!n&&!f&&u(e.parseError),u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),n){u(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(d){u(`tla2sany.semantic.AbortException`),l(`*** Abort messages: 1\n\n${Ta(t)}\n\n\n`);return}u(Ta(t)),u(Ea(y.isReported?[t]:[...v,t]))}})();if(O!==void 0&&E(),O!==void 0&&!_.value&&!n.isXmlExport&&!d){let e=O.modules.filter(e=>!Da.has(e.name));h&&e.forEach(e=>u(`Linting of module ${e.name}`)),e.flatMap(wa).forEach(e=>u(`${Ta(e)}\n\n\n`))}return{text:c.join(``),isFailed:_.value,specification:y.isAborted?void 0:O}},Ma={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},Na=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),Pa={"&":`&amp;`,"<":`&lt;`,">":`&gt;`,"\r":`&#13;`},Fa=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Pa[e]),Ia=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,La=e=>{let t=(e.cdata??e.text)?.match(Ia)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=La(t);if(e)return e}},Ra=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${Fa(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)Ra(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},za=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Ba=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},Va={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Ha={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Ua=hr(`--TLA+ BUILTINS--`),Wa=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Ga=(e,t=16)=>e>t*.75?Ga(e,t*2):t,Ka=(e,t)=>(e^e>>>16)&t-1,qa=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Ja=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Ya=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Xa=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=qa(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(Ya,``)}).join(`
28
+ `)},Za=e=>{let t=qa(e),n=e=>Ja(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
29
+ `)},Qa=(e,t,n)=>{let r=n.version===`1.7.4`,i=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s={isSet:!1},l=[],u=(e,t)=>{if(!r)return t();l.push(...e);let n=t();return l.length-=e.length,n},f=(e,t)=>{let n=[...l,...t].reverse(),r=[e,...n.map(e=>`\tat tla2sany.${e.at}`)].join(`
30
+ `),i=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${r}\n`).join(``);return a(new c(r,i),Ma.uncaughtException)},p=e=>f(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),m=(e,t)=>(i.has(e.id)||(i.add(e.id),o.set(e.id,u([...t?[t]:[],...Wa(e.kind,hr(e.location))],()=>v(e)))),Z(Ba(e),[Q(`UID`,e.id)])),h=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[za(n),...r]:r;return{...e,children:[...i,...e.children]}},g=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[m(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),_=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
31
+ `),r=n.isUncommented?Za(Xa(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:r,children:[]}]:[]},v=e=>{switch(e.kind){case`FormalParam`:return h(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e,e.location);case`OpDecl`:return h(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e,e.location);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw r?f(Na(37),[Ha]):a(new d(Na(37)),Ma.uncaughtException);if(e.defKind===`ModuleInstance`)return h(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!r?[Z(`local`)]:[]]),e,e.location);let t=e.params??[];if(e.defKind===`BuiltIn`)return h(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[g(t,e.isLeibnizArg,$.builtInParam)]:[]]),e,e.location);let n=e.body,i=e.module;if(n===void 0&&r)throw p($.body);if(n===void 0||i===void 0)throw Error(`The definition of ${e.name} has no body`);return h(r?Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`body`,[C(n,$.body)]),...e.params?[g(t,e.isLeibnizArg,$.param)]:[],...e.inRecursive?[Z(`recursive`)]:[]]):Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Z(`originalOperator`,[m(e.source??e)]),Z(`originallyDefinedInModule`,[m(i)]),Z(`body`,[C(n,$.body)]),g(t,e.isLeibnizArg,$.param),..._(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal?[Z(`local`)]:[]]),e,e.location)}case`ThmOrAssumpDef`:return h(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),C(e.body,$.theoremDefinitionBody)]),e,e.location);case`Module`:return Z(`ModuleNode`,[za(e.location),...y(e)]);case`Theorem`:return h(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[m(e.definition,$.theoremDefinition)])]:[],Z(`body`,[C(e.body,$.theorem)]),...e.proof?[C(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e,e.location);case`Assume`:return Z(`AssumeNode`,[za(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[m(e.definition,$.assumeDefinition)])]:[],Z(`body`,[C(e.body,$.assume)])])}},y=e=>{let t=t=>!n.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...r?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...jr(e,2).filter(t).map(e=>m(e,$.constant)),...jr(e,3).filter(t).map(e=>m(e,$.variable)),...Ar(e).filter(t).map(e=>m(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?C(e,$.topLevel):m(e,$.topLevel)),...e.definitions.filter(e=>!r&&e.kind===`Module`).map(e=>m(e))]},b=(e,t)=>u([t],()=>Z(`Subst`,[m(e.op,$.substOperator),C(e.expr,$.substExpression)])),x=e=>{if(e.isNull&&r)throw f(Na(0),[$.operator,...Wa(`OpDef`,Ua),Ha]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s.isSet=!0);let n=m(e.operator,$.operator),i=e.operands.map((e,t)=>e===void 0||t===0&&s.isSet&&gr(e)?r?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):C(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[m(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>m(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],C(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,i),...o])},S=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?m(e,t):C(e,t),C=(e,t)=>{if(!r)return w(e);if(e.kind===`OpAppl`&&e.isAbsent&&`nullType`in t)throw p(t);let n=[t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:hr(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}];return u(n,()=>w(e))},w=e=>{switch(e.kind){case`OpAppl`:return h(x(e),e,e.location);case`Numeral`:return h(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e,e.location);case`String`:return h(Z(`StringNode`,[Q(`StringValue`,e.value)]),e,e.location);case`Decimal`:return h(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...r?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e,e.location);case`LetIn`:{let t=C(e.body,$.letBody);return h(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>m(e,$.letDefinition)))]),e,e.location)}case`Label`:return h(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[C(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>m(e,$.labelParam)))]),e,e.location);case`OpArg`:return h(Z(`OpArgNode`,[Z(`argument`,[m(e.op,$.argument)])]),e,e.location);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return h(Z(`AtNode`,[C(t,$.exceptObject),C(n,$.exceptComponents)]),e,e.location)}case`SubstIn`:case`APSubstIn`:{let t=Va[e.kind],n=e.substs.map(e=>b(e,t.subst)),r=C(e.body,t.body);return h(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[m(e.instantiatingModule,t.from)]),Z(`instTo`,[m(e.instantiatedModule,t.to)])]),e,e.location)}case`Instance`:{let t=e.substs.map(e=>b(e,$.instanceSubst)),n=e.params.map(e=>m(e,$.instanceParam));return Z(`InstanceNode`,[za(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!r?[Z(`local`)]:[]])}case`UseOrHide`:return h(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>S(e,$.useFact))),Z(`defs`,e.defs.map(e=>m(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e,e.location);case`NewSymb`:return h(Z(`NewSymbNode`,[m(e.declaration,$.newDeclaration),...e.set&&!(r&&gr(e.set))?[C(e.set,$.newSet)]:[]]),e,e.location);case`AssumeProve`:return h(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>C(e,$.assumption))),Z(`prove`,[C(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e,e.location);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>S(e,$.byFact))),Z(`defs`,e.defs.map(e=>m(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return h(n,e,e.location)}case`NonLeafProof`:return h(Z(`steps`,[...r?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?m(e,$.step):C(e,$.step))]),e,e.location);case`DefStep`:return h(Z(`DefStepNode`,e.defs.map(e=>m(e,$.defStep))),e,e.location)}},ee=(n.isRestricted?[t]:e).map(e=>m(e,$.main)),T=Ga(o.size),E=Z(`context`,[...o.entries()].toSorted(([e],[t])=>Ka(e,T)-Ka(t,T)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,t.name),E,...ee])},$a=(e,t={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let n=Qa(e.modules,e.root,t),r=La(n);if(r){let e=r.character.codePointAt(0)??0;throw a(new d(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${r.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),Ma.unrepresentableCharacter)}let i=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return Ra(n,0,t.isTerse?0:2,i),t.isTerse?i.join(``):`${i.join(`
32
+ `)}\n`},eo=`META-INF/MANIFEST.MF`,to=async e=>{if(e===void 0||!I(e))return`master`;let t=await import(`fflate`),n=t.unzipSync(Ie(e),{filter:e=>e.name===eo})[eo];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},no={success:o.success,"assumption-violation":o.assumptionViolation,deadlock:o.deadlock,"invariant-violation":o.safetyViolation,"property-violation":o.safetyViolation,"liveness-violation":o.livenessViolation,"postcondition-violation":o.assumptionViolation,error:o.error},ro=$e(`tla-ts <Spec.tla|Spec.cfg|glob>... {options}`,[{flag:`-config <Spec.cfg>`},{flag:`-deadlock`},{flag:`-dump [<format>] <file>`,getArity:e=>e.length>1&&e[0].startsWith(`dot`)?2:1},{flag:`-fp <num>`},{flag:`-lncheck <final|default>`},{flag:`-metadir <directory>`},{flag:`-nowarning`},{flag:`-seed <num>`},{flag:`-tool`},{flag:`-workers <count|auto>`}]),io=$e(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`}]),ao=/* @__PURE__ */ new Set([`--toolbox`,`--line`,`--threads`,`--nofpl`]),oo=$e(`tla-ts prove {options} <Module.tla|glob>...`,[{flag:`--backend <${Te.join(`|`)}>`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-workers <count|auto>`}]),so=/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]),co=/* @__PURE__ */ new Set([`-o`]),lo=(()=>{let e=e=>`\x1b[1m${e}\x1b[0m`,t=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],n=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,e(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,e(`SYNOPSIS`),``,`\t${e(`tla2sany.xml.XMLExporter`)} [${e(`-Iortu`)}] [${e(`-help`)}] FILE`,``,e(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,e(`OPTIONS`),``,...t.map(([t,n])=>`\t${e(t)}\n\t\t${n}`),``,e(`TIPS`),``,...n.flatMap(e=>[`\t${e}`,``]),``].join(`
33
+ `)})(),uo=[`Usage: ${ro.usage}`,` ${oo.usage}`,` ${io.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
34
+ `),fo=/[*?[{]/,po=e=>e.flatMap(e=>fo.test(e)?Pe(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),mo=e=>/^[+-]?\d+$/.test(e)&&BigInt.asIntN(64,BigInt(e))===BigInt(e),ho=e=>e?e[0]===`auto`?Ge():Math.max(1,Number.parseInt(e[0],10)||1):1,go=[`constrained`,`stuttering`,`strict`],_o=(e,t)=>e.endsWith(t)?e:`${e}${t}`,vo=e=>{if(e.length===1)return{path:_o(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:_o(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`)}},yo=(e,t)=>e.print(w.computingInitProgress,O.none,`Computed ${t} initial states...`),bo=(e,t)=>e===`invariant-violation`?{code:w.invariantViolatedInitial,text:`Invariant ${t} is violated by the initial state:`}:{code:w.propertyViolatedInitial,text:`Property ${t} is violated by the initial state:`},xo=(e,t)=>t?.forEach(t=>{if(typeof t==`string`)return console.log(t);if(t.kind===`initial-states-progress`)return yo(e,t.count);let n=bo(t.status,t.name);e.print(n.code,O.error,`${n.text}\n${se(t.state)}`)}),So=(e,t,n={code:w.behaviorUpToThisPoint,text:`The behavior up to this point is:`},r=!1)=>{t.length>0&&e.print(n.code,O.error,n.text),t.forEach((t,n)=>{(n>0||r)&&xo(e,t.output),e.print(w.statePrint2,O.state,`${n+1}: <${t.label??t.action??`Initial predicate`}>\n${se(t.state)}`)})},Co={code:w.counterExample,text:`The following behavior constitutes a counter-example:
35
+ `},wo=(e,t)=>t===`1.7.4`||e.length===0?`Temporal properties were violated.
36
+ `:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,To=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${T(e)}\n`).toReversed().join(``),Eo=e=>{if(e.length===0)return` The error call stack is empty.
37
+ `;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},Do=(e,t)=>{let n=t.generated,r=t.distinct,i=C(/* @__PURE__ */ new Date);n===r?e.print(w.initGenerated1,O.none,`Finished computing initial states: ${r} distinct state${r===1?``:`s`} generated at ${i}.`):e.print(w.initGenerated2,O.none,`Finished computing initial states: ${n} state${n===1?``:`s`} generated, with ${r} of them distinct at ${i}.`)},Oo=(e,t,n)=>{let r=Math.max(Date.now()-(n??0),1)/6e4,i=e=>e.toLocaleString(`en-US`),a=(e,t)=>n===void 0?``:` (${i(Math.floor(e/r))} ${t}/min)`;e.print(w.progress,O.none,`Progress(${Math.max(t.depth,1)}) at ${C(/* @__PURE__ */ new Date)}: ${i(t.generatedStates)} states generated${a(t.generatedStates,`s`)}, ${i(t.distinctStates)} distinct states found${a(t.distinctStates,`ds`)}, ${i(t.queuedStates)} states left on queue.`)},ko=(e,t)=>Me(e,`${t}.class`),Ao=(e,t,n,r)=>{let i=e.print;switch(t.kind){case`parsed`:n.isParsed=!0,e.isTool&&i(w.sanyFinished,O.none,`SANY finished.`),i(w.starting,O.none,`Starting... (${C(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;i(w.constantLevelInvariant,O.warning,`The invariant ${t.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;i(w.stateLevelProperty,O.warning,`The formula ${t.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${t.name} holds in all states of every behavior, use INVARIANT ${t.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${t.name} changes it into a temporal formula, asserting that ${t.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:t.isSymmetric&&i(w.livenessSymmetry,O.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),t.isConstrained&&e.version===`1.7.4`&&i(w.livenessConstraints,O.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:i(w.temporalBranches,O.none,`Implied-temporal checking--satisfiability problem has ${t.branches} branches.`);return;case`java-override`:{let e=Ye(F(ko(r,t.module))).href;i(t.isMatched?w.javaOverrideLoaded:w.javaOverrideMismatch,t.isMatched?O.none:O.warning,`${t.isMatched?`Loading`:`Failed to match`} ${t.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${t.signature}>.`);return}case`initial-states-started`:i(w.computingInit,O.none,`Computing initial states...`);return;case`initial-states-progress`:yo(e,t.count);return;case`initial-states-computed`:Do(e,t.initialStates);return;case`progress`:Oo(e,t.statistics,n.start);return;case`liveness-started`:{n.liveness=Date.now(),t.isComplete&&Oo(e,t.statistics);let r=t.branches>1?`${t.branches} branches of `:``,a=t.branches*t.states;i(w.checkingTemporal,O.none,`Checking ${r}temporal properties for the ${t.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${C(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:jo(e,n);return;case`warning`:i(t.code,O.warning,t.text)}},jo=(e,t)=>{t.liveness!==void 0&&(e.print(w.checkingTemporalEnd,O.none,`Finished checking temporal properties in ${te(Date.now()-t.liveness)} at ${C(/* @__PURE__ */ new Date)}`),t.liveness=void 0)},Mo=(e,t,n)=>{let r=n.print,i=t.name,a=t.loopStart,o=a===void 0&&t.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),s={code:w.temporalPropertyViolated,text:wo(t.properties??[i],n.version)},c={success:void 0,error:void 0,"assumption-violation":t.message?{code:w.assumptionEvaluationError,text:v(w.assumptionEvaluationError,`Evaluating assumption ${i} failed.\n${t.message}`,n.isTool)}:{code:w.assumptionFalse,text:`Assumption ${i} is false.`},deadlock:{code:w.deadlockReached,text:`Deadlock reached.`},"invariant-violation":o?bo(`invariant-violation`,i):{code:w.invariantViolatedBehavior,text:`Invariant ${i} is violated.`},"property-violation":s,"liveness-violation":a===void 0?o?bo(`liveness-violation`,i):{code:w.actionPropertyViolatedBehavior,text:`Action property ${i} is violated.`}:s,"postcondition-violation":{code:t.postcondition?.code??w.general,text:t.message??`Postcondition ${i} is false.`}}[e],l=e===`property-violation`,u=a!==void 0&&!l,d=l||u,f=d&&n.version!==`1.7.4`;if(f&&xo(n,t.trace[0]?.output),t.counts&&console.log(t.counts),c){let e=o?`${c.text}\n${se(t.trace[0].state)}`:c.text;r(c.code,O.error,e)}if(o||(d||xo(n,t.trace[0]?.output),So(n,t.trace,d?Co:void 0,d&&!f),xo(n,t.traceOutput)),u){let e=t.loopLabel;a===t.trace.length-1?r(w.statePrint3,O.state,`${a+2}: Stuttering`):n.isTool?r(w.backToState,O.state,`${a+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${a+1}${e?`: <${e}>\n`:``}`)}t.warning&&n.version!==`1.7.4`&&r(t.warning.code,O.warning,t.warning.text);let p=t.unwitnessed??(e===`postcondition-violation`?void 0:t.postcondition);return p?.counts&&console.log(p.counts),p&&r(p.code,O.error,p.message),!o&&e!==`assumption-violation`},No=(e,t)=>e.print(w.nestedExpression,O.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${Eo(t)}`),Po=(e,t,r)=>{let i=t.print;if(e.failure){let r=e.failure,s=t.isTool?r.toolMessage:r.message,c=()=>{let e=r.fingerprint;if(e){let n=r.callStack?.length&&t.version!==`1.7.4`?Eo(r.callStack):To(e.sources);i(w.fingerprintFailed,O.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${n}\nReason:\n${A(e.reason,t.isTool)}`)}else r.callStack&&No(t,r.callStack)};r.isCallStackFirst&&c();let u=r.initialState&&(()=>{try{return`While working on the initial state:\n${se(r.initialState)}`}catch(e){throw e instanceof l?a(new l(`${n}${e.message}`),o.error):e}})();i(u?w.initialState:r.code,O.error,u?`${s}\n${u}`:s),xo(t,r.trace[0]?.output),So(t,r.trace);let d=r.traceFailure;d&&i(d.code,O.error,t.isTool?d.toolMessage:d.message),xo(t,r.traceOutput);let f=r.postcondition;f?.counts&&console.log(f.counts),f&&i(f.code,O.error,f.message),r.isCallStackFirst||c()}else if(e.violation){if(!Mo(e.status,e.violation,t))return;let n=e.additionalViolation;n&&Mo(`property-violation`,n,t),e.liveCallStack&&No(t,e.liveCallStack)}else{jo(t,r);let n=ne(e.distinctStates,e.generatedStates),a=e.fingerprintDistance===void 0?[]:[` based on the actual fingerprints: val = ${N(ie(e.fingerprintDistance))}`];i(w.success,O.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${N(n)}`,...a].join(`
38
+ `))}if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&jo(t,r),t.isTool&&Oo(t,e,r.start),i(w.stats,O.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let s=t.version===`1.7.4`,c=s?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!s||c)&&i(w.searchDepth,O.none,`The depth of the complete state graph search is ${s?Math.max(e.depth,1):e.depth}.`);let u=c&&le(c);u&&i(w.stateGraphOutdegree,O.none,u)},Fo=(e,t)=>e.map(e=>Me(e,`${t}.tla`)).find(I),Io=e=>t=>{let n=Fo(e,t);return n===void 0?void 0:Ie(n,`utf8`)},Lo=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),Ro=e=>`jar:file:${Ye(F(e)).pathname}!/tla2sany/StandardModules/`,zo=e=>x([e]).toString(),Bo=(e,t,n,r,i)=>{let a=n.temporaryDirectory??qe(),o=I(a)?ze(a):F(a),s=Me(o,`tlc-${zo(F(e))}`),c=ws(n);return(n,a)=>{let l=`${n}.tla`;if(a===`file`)return ze(Fo(t,n)??e);if(i===`1.7.4`)return Me(o,l);if(a===`root file`){let t=r===void 0?o:F(r),i=ze(e);return`${Me(t,zo(`${i} ${n}`),l)} (${i})`}let u=Me(s,l);return c===void 0?u:`${u} (${Ro(c)}${l})`}},Vo=e=>e.print(w.version,O.none,`TLC2 Version ${Ze} (rev: tla-ts)`),Ho=(e,t)=>(Vo(e),e.print(w.commandLineError,O.error,`${t}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1),Uo=(e,t,n)=>e.print(w.modelChecking,O.none,`Running breadth-first search Model-Checking with fp 0 and seed ${BigInt(t)} with ${n} worker${n===1?``:`s`} on ${Ge()} cores with ${Math.floor(Xe().heap_size_limit/1024/1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${Je()} ${Ke()} ${We()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit, MemFPSet, MemStateQueue).`),Wo=(e,t)=>{let n=[...e.unknown,...e.options.map(e=>e.name)],r=(e,t=e)=>n.some(n=>n===e||n.toLowerCase()===t.toLowerCase()),i=r(`-generateSpecTE`)||!r(`-noGenerateSpecTE`,`-noTE`)&&!r(`-tool`)&&!r(`-continue`);return t!==`1.7.4`&&i&&!r(`-noGenerateSpecTEBin`,`-noTEBin`)},Go=async(e,n,a,s)=>{let c=n.has(`-seed`)?n.get(`-seed`)?.[0]:`0`;if(c===void 0)return Ho(s,`Error: seed required.`);if(!mo(c))return Ho(s,`Error: An integer for seed required. But encountered ${c}`);let l=n.has(`-lncheck`)?n.get(`-lncheck`)?.[0]?.toLowerCase():`default`;if(l===void 0)return Ho(s,`Error: expect a strategy such as final for -lncheck option.`);let d=n.get(`-dump`);if(d?.length===0)return Ho(s,`Error: A file name for dumping states required.`);let p=d?.length===2&&go.find(e=>d[0].toLowerCase().includes(e));if(p)return console.error(`Error: tla-ts does not support the -dump format ${p}.`),1;let m=n.get(`-fp`)?.[0];if(m!==void 0&&Number(m)!==0)return console.error(`Error: tla-ts fingerprints states as TLC does with -fp 0, not -fp ${m}.`),1;let h=ho(n.get(`-workers`)),_=s.version;Vo(s),Uo(s,c,h);let v=n.get(`-config`)?.[0]??(n.has(`-config`)?void 0:e.replace(/\.tla$/,`.cfg`));if(!v||!I(v))return s.print(w.configFileError,O.error,`TLC encountered the following error when trying to read the configuration file ${v??``}:\nFile not found.`),o.configParseError;let b=Oe(e,`.tla`),x={start:Date.now(),liveness:void 0,isParsed:!1},S=()=>{let e=Date.now()-x.start;s.print(w.finished,O.none,`Finished in ${s.isTool?`${e}ms`:te(e)} at (${C(/* @__PURE__ */ new Date)})`)},ee=()=>s.print(w.parsingFailed,O.error,`Parsing or semantic analysis failed.`),T=e=>(e instanceof t?ee():qo(e,s),S(),r(e)),k=(()=>{try{return D(Ie(v,`utf8`),_)}catch(e){if(!(e instanceof f))throw e;return e}})();if(k instanceof f&&_===`1.7.4`)return s.print(w.general,O.error,`${g(`tlc2.tool.ConfigFileException`)}${A(k.message,s.isTool)}`),S(),o.error;if(k instanceof f)return T(k);n.has(`-deadlock`)&&(k.checkDeadlock=!1);let j=Ae(e),ne=[j,...a.libraries],re=Io(ne),ie=Wo(n,_),M=async()=>{let t=Ie(e,`utf8`),r=E(t).name;if(r!==b)throw new i(`File name '${b}' does not match the name '${r}' of the top level module it contains.`,void 0);let a=await ge({workers:h,livenessCheck:[`final`,`seqfinal`,`off`].includes(l)?`final`:`default`,seed:BigInt(c),dump:d&&vo(d),isTool:s.isTool,isTraceRecorded:ie,isSanyReported:!0,isWarningEnabled:!n.has(`-nowarning`),version:_,onProgress:e=>Ao(s,e,x,j),source:t,config:k,onPause:()=>Le(0,Buffer.alloc(1)),loadModule:re,loadClass:e=>{let t=ko(j,e);return I(t)?Ie(t):void 0},readFile:e=>I(e)?Ie(e,`utf8`):void 0,writeFile:(e,t)=>{Fe(Ae(F(e)),{recursive:!0}),Ue(e,t)}});return Po(a,s,x),S(),a.failure?.exitCode??no[a.status]};s.isTool&&s.print(w.startingSany,O.none,`Starting SANY...`);let ae=je(e),N=ae?b:e.replace(/\.tla$/,``),oe=ws(a),se=_===`1.7.4`?ys(e,a,oe):void 0;if(se?!I(e)&&!y.has(b)&&se(`${b}.tla`):!I(e)&&!ue.has(b)&&Lo(ae?j:process.cwd(),ae?`${b}.tla`:`./${N}.tla`,[...ae||j===`.`?[]:[j],...a.libraries]),ja(e,se?bs(re,se):re,{fileName:N,describeFile:Bo(e,ne,a,n.get(`-metadir`)?.[0],_),version:_,rootExtendees:ie?[`_TLCTrace`]:void 0,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}).isFailed)return Ao(s,{kind:`parsed`},x,j),ee(),S(),o.specParseError;try{return await M()}catch(e){if(!(e instanceof u))throw e;return e instanceof t&&console.log(Ko(e,b)),x.isParsed||Ao(s,{kind:`parsed`},x,j),T(e)}},Ko=(e,t)=>{let n=e instanceof i;if(!n&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let r=n?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${t}\n\nCould not parse module ${t} from file ${t}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${t}\n\n${r}\n*** Errors: 1\n\n${r}\n\n\n`},qo=(e,t)=>{if(e instanceof f||e instanceof l){let n=j(e.message),r=n&&!n.isEvalException?n.code:w.general;return t.print(r,O.error,v(r,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},Jo=async(e,t=de(!1))=>{try{return await e()}catch(e){if(!(e instanceof u))throw e;return qo(e,t),r(e)}},Yo=async(e,t,n)=>{let r=[];for(let[i,a]of e.entries()){i>0&&console.log(``);let e=n();r.push(await Jo(()=>t(a,e),e))}return r.find(e=>e!==o.success)??o.success},Xo=e=>[`.`,...De().map(e=>Me(Ae(Ae(ze(e))),`lib/tlapm/stdlib`)).filter(e=>I(e)).slice(0,1),...e.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],Zo=e=>e.flatMap(e=>fo.test(e)?Pe(e).sort():[e]),Qo=e=>e.endsWith(`.tla`)?e:`${e}.tla`,$o=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),es=(e,t,n)=>$o([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),ts=`9ed0376`,ns=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,rs=e=>console.log(`\n\\* TLAPM version ${ts}\n\\* launched at ${C(/* @__PURE__ */ new Date)} with command line:\n\\* ${[`tla-ts`,`tlapm`,...e].map(ns).join(` `)}\n`),is={failed:10,incomplete:11,emptyTarget:12},as=(e,t,n)=>{let r=e.summary;n||(r.absent.forEach(e=>console.error(`Missing proof at ${P(e)}`)),r.omitted.forEach(e=>console.error(`Omitted proof at ${P(e)}`)));let i=r.absent.length+r.omitted.length>0;i&&console.error(`${ye(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${r.absent.length} missing, ${r.omitted.length} omitted proof step(s).`);let a=t&&e.obligations.length===0;return a&&console.error(`${ye(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...i?[is.incomplete]:[],...a?[is.emptyTarget]:[]]},os=t=>{try{return t()}catch(t){if(!(t instanceof e))throw t;console.error(` tlapm ending abnormally with ${t.exception}\n`);return}},ss=e=>{let t=oo.parse(e),n=t.get(`--backend`)?.[0],r=Zo(t.positionals).map(Qo);if(t.unknown[0]!==void 0||t.incomplete||n!==void 0&&!_e(n)||r.length===0)return console.error(`Usage: ${oo.usage}`),1;let i=Xo(t);return Yo(r,async e=>{let r=await fe({source:Ie(e,`utf8`),loadModule:Io([Ae(e),...i]),backend:n,workers:ho(t.get(`-workers`)),onObligation:t=>console.log(`${e}:${t.location}: ${t.status}${t.status===`proved`?` by ${t.prover}`:``}${t.status===`failed`||t.status===`unsupported`?` (${t.reason})`:``}`)}),a=Map.groupBy(r.obligations,e=>e.status),s=e=>a.get(e)?.length??0;return console.log(`${r.obligations.length} obligations: ${s(`proved`)} proved, ${s(`trivial`)} trivial, ${s(`failed`)} failed, ${s(`unsupported`)} unsupported`),s(`failed`)+s(`unsupported`)===0?o.success:1},()=>de(!1))},cs=(e,t)=>{let n=t.method.timeLimitMs,r=t.timeUsedMs===void 0?``:`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/n)}%)`,i=n===0?``:`time-limit: ${n===1/0?`inf`:Number((n/1e3).toPrecision(6))}${r}`,a=[t.method.tactic,i].filter(Boolean).join(`; `),o=(t.method.prover===`smt`||t.method.prover===`z3`)&&t.reason===`false`&&t.verdict?`(* SMT failed with status = ${t.verdict}\n *)\n`:``;es(e,t.isProved?`proved`:`failed`,[`prover:${t.method.prover}`,...a===``?[]:[`meth:${a}`],...t.reason===void 0?[]:[`reason:${t.reason}`],`already:${t.isReused}`,...t.isProved?[]:[`obl:${t.isReused?``:`\n${o}`}${Ce(e,t.isReused)}`]])},ls=(e,t)=>es(e,`failed`,[`prover:fail`,`meth:time-limit: inf`,`reason:${t}`,`already:false`,`obl:${e.text}`]),us=async(e,t,n,r,i)=>{yt(n,r);let a=bt(i.fingerprints),o=await xe(e.obligations,{workers:i.workers,results:a.results,isFingerprinted:i.isFingerprinted,isProving:i.isProving,onReport:(e,t)=>{if(i.isToolbox){if(e.obligation.status===`trivial`)return es(t,`trivial`,[`prover:tlapm`,`already:false`]);if(t.kind.kind===`Error`)return ls(t,`user error`);e.attempts.forEach(e=>cs(t,e))}}});if(Ue(t,be(e.name,o,e.obligations)),console.log(`(* created new ${JSON.stringify(t)} *)`),a.save(n),console.log(`(* fingerprints written in ${JSON.stringify(n)} *)`),!i.isProving)return!1;let s=o.flatMap((t,n)=>`reason`in t.obligation?[{report:t,obligation:e.obligations[n]}]:[]);i.isToolbox&&s.filter(e=>e.report.attempts.length===0&&e.obligation.kind.kind!==`Error`).forEach(e=>ls(e.obligation,`unexpected error`)),s.toReversed().forEach(e=>console.error(`${ye(e.obligation.locus)}${Se(he(`[ERROR]: @[<v2>Could not prove or check:@,%a@]`,me(e.obligation.sequent)),35)}`));let c=`${e.obligations.length} obligation${e.obligations.length>1?`s`:``}`;return console.error(s.length===0?`${ye(e.location)}[INFO]: All ${c} proved.`:`${ye(e.location)}[ERROR]: ${s.length}/${c} failed.\nThere were backend errors processing module \`${JSON.stringify(e.name)}\`.`),s.length>0},ds=async t=>{let n=io.parse(t),r=!n.has(`-N`)&&!n.has(`--summary`),i=n.unknown[0]??(r&&n.has(`--printallobs`)?`--printallobs`:void 0);if(i!==void 0)return console.error(`Error: tla-ts tlapm does not support the tlapm option ${i}.`),1;if(n.incomplete)return console.error(`Error: option '${n.incomplete.name}' needs an argument.`),1;let a=n.options.find(e=>ao.has(e.name)&&e.values.some(e=>!/^-?\d+$/.test(e)));if(a)return console.error(`Error: option '${a.name}' expects an integer.`),1;if(n.has(`--version`))return console.log(ts),o.success;let s=Zo(n.positionals),c=s.map(Qo);if(c.length===0)return console.error(uo),1;let l=n.has(`--toolbox`)||n.has(`--line`);l&&rs(t);let u=n.options.reduce((e,t)=>{let[n,r]=t.values.map(Number);return t.name===`--toolbox`?{start:n,end:r===0?1/0:r}:t.name===`--line`?n===0?pe:{start:n,end:n}:e},pe),d=c.reduce((e,t)=>e.includes(Ae(t))?e:[Ae(t),...e],Xo(n)),f=/* @__PURE__ */ new Set,p=os(()=>{let t=c.findIndex(e=>!I(e));if(t!==-1){let n=s[t];throw console.error(`File "<unknown>":\nError: File ${JSON.stringify(n)} not found`),new e(`File ${n} not found`,{failure:`Module.Parser.parse_file`})}return Ee(c.map(e=>({file:`./${e}`,source:Ie(e,`utf8`)})),e=>{f.add(e);let t=d.map(t=>`${t}/${e}.tla`).find(e=>I(e));return t===void 0?e===`TLAPS`?{file:`TLAPS.tla`,source:we}:void 0:{file:t,source:Ie(t,`utf8`)}},{lines:u,onWarning:e=>{if(e.channel===`stdout`)return console.log(e.text);let t=e.channel===`toolbox`||e.channel===`toolboxOnly`;if(l&&t)return $o([`type:warning`,`msg:${e.text}`]);e.channel!==`toolboxOnly`&&console.error(e.text)}})});if(!p)return 3;let m=n.get(`--cache-dir`)?.[0]??process.env.TLAPM_CACHE_DIR??`.tlacache`,h=n.get(`--nofpl`)?.map(Number)??[0,0],g={isToolbox:l,isProving:!n.has(`--noproving`),workers:Math.max(1,Number(n.get(`--threads`)?.[0]??Ge())),isFingerprinted:e=>!n.has(`--nofp`)&&!(e.locus&&e.locus.startLine>=h[0]&&e.locus.endLine<=h[1]),fingerprints:/* @__PURE__ */ new Map},_=[];for(let[e,t]of p.entries()){let i=`${m}/${t.name}.tlaps`,a=`${i}/fingerprints`,o=n.get(`--usefp`)?.[0]??a;if(Fe(i,{recursive:!0}),n.has(`--cleanfp`)&&I(a)&&(Ve(a),console.log(`(* fingerprints file ${JSON.stringify(a)} removed *)`)),!n.has(`--cleanfp`)&&I(o)&&t.summary.total!==0&&(console.log(n.has(`--nofp`)?`(* will not use fingerprints (because of option \`--nofp\`), but will now load fingerprints from the file \`${o}\`, in order to overwrite with the new fingerprints, and then save the results at the end. *)`:`(* loading fingerprints in ${JSON.stringify(o)} *)`),mt(g.fingerprints,o,n.has(`--safefp`))),n.has(`--summary`)&&console.log(ve(t)),l&&(t.obligations.forEach(e=>es(e,`to be proved`,n.has(`--printallobs`)?[`obl:${e.text}`]:[])),$o([`type:obligationsnumber`,`count:${t.obligations.length}`])),n.has(`--strict`)&&_.push(...as(t,u.start>0||u.end<1/0,n.has(`--summary`))),!r)continue;let s=[...f,...p.slice(0,e+1).map(e=>e.name)].map(e=>`${e}.tla`),c=await us(t,`${i}/${t.name}.thy`,a,s,g);if(c&&n.has(`--strict`)&&_.push(is.failed),c&&!n.has(`--strict`)&&!l)return console.error(` tlapm ending abnormally with Failure("backend errors: there are unproved obligations")
39
+ Raised at Stdlib.failwith in file "stdlib.ml", line 29, characters 17-33
40
+ Called from Tlapm_lib.process_module in file "src/tlapm_lib.ml", lines 492-493, characters 12-37
41
+ Called from Tlapm_lib.main.f in file "src/tlapm_lib.ml", line 640, characters 23-43
42
+ Called from Stdlib__List.fold_left in file "list.ml", line 125, characters 24-34
43
+ Called from Tlapm_lib.main in file "src/tlapm_lib.ml", line 643, characters 13-40
44
+ Called from Tlapm_lib.init in file "src/tlapm_lib.ml", line 659, characters 8-59
45
+ `),3}return Object.values(is).find(e=>_.includes(e))??o.success},fs=async(e,t)=>{let n=ro.parse(e),r=po(n.positionals),i=n.has(`-config`),a=r.map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.tla`)&&(!e.isGlobbed||i||I(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(a.length===0)return console.error(uo),1;if(i&&a.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let o=[...new Set(a.map(e=>I(e)||je(e)?e:t.libraries.map(t=>Me(t,e)).find(I)??e))],s=t.tlcVersion??`master`;return Yo(o,(e,r)=>(o.length>1&&console.log(`Checking ${Oe(e)} with ${Oe(e,`.tla`)}.cfg`),Go(e,n,t,r)),()=>de(n.has(`-tool`),!n.has(`-nowarning`),s))},ps=e=>(process.stderr.write(`ERROR: ${e}\n${lo}`),Ma.argsParsingFailure),ms=(e,t)=>{try{return process.stdout.write($a(e,t)),o.success}catch(e){if(!(e instanceof d))throw e;let t=r(e),n=e instanceof c?e.unwound:``;return console.error(t===Ma.uncaughtException?`${n}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),t}},hs=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0},r={flag:-1};for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r.flag=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r.flag=i}return r.flag===e.length-2?n:{...n,error:`several-files`}},gs=e=>{if(e.length===0)return ps(`at least one .tla file must be given`);let t=hs(e,so);if(t.error===`missing-include`)return ps(`the -I flag must be followed by a directory and at least one .tla file`);if(t.error===`several-files`)return ps(`Only one TLA file to check allowed!`);let n=e[e.length-1];if(n===`-help`)return process.stdout.write(lo),o.success;let r=n.endsWith(`.tla`)?n:`${n}.tla`,i=[`.`,...t.includes],a=i.map(e=>F(e,r)).find(I);a===void 0&&!ue.has(r.slice(0,-4))&&Lo(process.cwd(),`./${r}`,t.includes);let s=ja(a??r,Io(i),{fileName:n,isXmlExport:!0});return process.stderr.write(s.text),s.isFailed||s.specification===void 0?(console.error(`ERROR: Failed to parse module.`),Ma.specParsingFailure):ms(s.specification,{version:`master`,isRestricted:t.flags.has(`-r`),isUncommented:t.flags.has(`-u`),isTerse:t.flags.has(`-t`)})},_s=(e,t,n)=>console.error(`File does not exist: ${je(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[Ro(n)]].join(`, `)}`),vs=e=>e.endsWith(`/`)?e:`${e}/`,ys=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),i=(!je(e)&&r!==``?[r]:t.libraries).map(vs),a=i.length>0?i[i.length-1]:je(e)?r:``;return e=>_s(`${a}${e}`,i,n)},bs=(e,t)=>n=>{let r=e(n);return r===void 0&&!y.has(n)&&t(`${n}.tla`),r},xs=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),Ma.uncaughtException),Ss=(e,t)=>{if(e.length===0)return xs(`java.lang.IllegalArgumentException: at least one .tla file must be given`,59);let n=hs(e,co);if(n.error===`missing-include`)return xs(`java.lang.IllegalArgumentException: the -I flag must be followed by a directory and at least one .tla file`,71);if(n.error===`several-files`)return xs(`java.lang.IllegalArgumentException: Only one TLA file to check allowed!`,83);let r=e[e.length-1],i=`${r.replace(/\.tla$/i,``)}.tla`,a=(n.includes.length===0?[`/`]:n.includes).map(vs),s=[`.`,...a],c=e=>_s(`${a[a.length-1]}${e}`,a,t),l=s.map(e=>F(e,i)).find(I);if(l===void 0&&!y.has(Oe(i,`.tla`)))return c(i),o.success;let u=ja(l??i,bs(Io(s),c),{fileName:r,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(u.text),u.specification===void 0?xs(`tla2sany.xml.XMLExportingException: spec ${(l&&Aa(Ie(l,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):ms(u.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},Cs=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],ws=e=>e.classPath?.split(ke).find(e=>e.endsWith(`.jar`)),Ts=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(ke));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||Cs.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},Es=e=>e.mainClass===`tlc2.TLC`?fs(e.args,e.java):e.mainClass===`tla2sany.xml.XMLExporter`?Jo(()=>e.java.tlcVersion===`1.7.4`?Ss(e.args,ws(e.java)):gs(e.args)):(console.error(`Error: tla-ts runs the Java classes ${Cs.join(` and `)}, not ${e.mainClass}.`),1),Ds=async e=>{if(e[0]===`prove`)return Jo(()=>ss(e.slice(1)));if(e[0]===`tlapm`)return Jo(()=>ds(e.slice(1)));let t=Ts(e);return t===void 0?fs(e,{libraries:[]}):(t.java.tlcVersion??=await to(ws(t.java)),Es(t))},Os=async()=>{process.exitCode=await Ds(process.argv.slice(2))};export{Os as runCli};