tla-ts 0.0.9 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1156 -888
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +330 -659
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +137 -22
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -322
  64. package/src/liveness.ts +230 -133
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +36 -60
  88. package/src/parallel.ts +64 -73
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +135 -40
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +299 -108
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,529 @@
1
+ import { isSameState } from "./fingerprints";
2
+ import { evaluateLive, type LiveAtoms } from "./liveness";
3
+ import { isFulfilling, type LiveExpression, type Solution } from "./tableau";
4
+ import type { Value } from "./values";
5
+
6
+ interface GraphNode {
7
+ fingerprint: bigint;
8
+ tableau: number;
9
+ position: number;
10
+ stateChecks: boolean[];
11
+ successors: GraphNode[];
12
+ actionChecks: boolean[][];
13
+ stepPositions: number[];
14
+ number: number;
15
+ }
16
+
17
+ interface TraceChecks {
18
+ getStates: (position: number) => boolean[];
19
+ getSteps: (position: number) => boolean[];
20
+ getStutters: (position: number) => boolean[];
21
+ isConsistent: (tableauNode: number, position: number) => boolean;
22
+ }
23
+
24
+ interface BehaviorGraph {
25
+ initial: GraphNode[];
26
+ isPartial: boolean;
27
+ }
28
+
29
+ export interface TraceLasso {
30
+ positions: number[];
31
+ cyclePosition: number;
32
+ backPosition: number | undefined;
33
+ }
34
+
35
+ const MAX_FIRST = 2 ** 50;
36
+ const MAX_SECOND = 2 ** 51;
37
+
38
+ const createNode = (
39
+ fingerprint: bigint,
40
+ tableau: number,
41
+ position: number,
42
+ stateChecks: boolean[],
43
+ ): GraphNode => ({
44
+ fingerprint,
45
+ tableau,
46
+ position,
47
+ stateChecks,
48
+ successors: [],
49
+ actionChecks: [],
50
+ stepPositions: [],
51
+ number: 0,
52
+ });
53
+
54
+ const addTransition = (
55
+ source: GraphNode,
56
+ target: GraphNode,
57
+ actionChecks: boolean[],
58
+ position: number,
59
+ ) => {
60
+ source.successors.push(target);
61
+ source.actionChecks.push(actionChecks);
62
+ source.stepPositions.push(position);
63
+ };
64
+
65
+ const getStepTo = (source: GraphNode, target: GraphNode) =>
66
+ source.stepPositions[source.successors.indexOf(target)];
67
+
68
+ const pop = (nodes: GraphNode[]) => {
69
+ const top = nodes[nodes.length - 1];
70
+ nodes.length -= 1;
71
+ return top;
72
+ };
73
+
74
+ const createGraph = (
75
+ fingerprints: bigint[],
76
+ solution: Solution,
77
+ checks: TraceChecks,
78
+ isComplete: boolean,
79
+ ): BehaviorGraph => {
80
+ const graph: BehaviorGraph = { initial: [], isPartial: false };
81
+ const tableau = solution.tableau;
82
+ if (!tableau) {
83
+ const nodes = new Map<bigint, GraphNode>();
84
+ let source = createNode(fingerprints[0], -1, 0, checks.getStates(0));
85
+ addTransition(source, source, checks.getStutters(0), 0);
86
+ nodes.set(fingerprints[0], source);
87
+ graph.initial.push(source);
88
+ for (let position = 1; position < fingerprints.length; position++) {
89
+ const existing = nodes.get(fingerprints[position]);
90
+ if (existing === undefined) {
91
+ const target = createNode(fingerprints[position], -1, position, checks.getStates(position));
92
+ addTransition(target, target, checks.getStutters(position), position);
93
+ addTransition(source, target, checks.getSteps(position), position);
94
+ nodes.set(fingerprints[position], target);
95
+ source = target;
96
+ continue;
97
+ }
98
+ if (!source.successors.includes(existing)) {
99
+ addTransition(source, existing, checks.getSteps(position), position);
100
+ }
101
+ source = existing;
102
+ }
103
+ return graph;
104
+ }
105
+ const rows = new Map<bigint, GraphNode[]>();
106
+ const getRow = (fingerprint: bigint) => {
107
+ const row = rows.get(fingerprint) ?? [];
108
+ rows.set(fingerprint, row);
109
+ return row;
110
+ };
111
+ const extend = (
112
+ sources: GraphNode[],
113
+ targets: GraphNode[],
114
+ row: GraphNode[],
115
+ position: number,
116
+ stateChecks: boolean[],
117
+ actionChecks: boolean[],
118
+ ) => {
119
+ for (let index = 0; index < sources.length; index++) {
120
+ const source = sources[index];
121
+ const successors = tableau.nodes[source.tableau].successors;
122
+ for (let successor = 0; successor < successors.length; successor++) {
123
+ const tableauNode = successors[successor];
124
+ const existing = row[tableauNode];
125
+ if (existing === undefined) {
126
+ if (!checks.isConsistent(tableauNode, position)) continue;
127
+ const target = createNode(fingerprints[position], tableauNode, position, stateChecks);
128
+ addTransition(source, target, actionChecks, position);
129
+ targets.push(target);
130
+ row[tableauNode] = target;
131
+ continue;
132
+ }
133
+ if (!source.successors.includes(existing)) {
134
+ addTransition(source, existing, actionChecks, position);
135
+ }
136
+ if (existing.position === position) continue;
137
+ graph.isPartial = true;
138
+ if (isComplete && !targets.includes(existing)) targets.push(existing);
139
+ }
140
+ }
141
+ };
142
+ const initialRow = getRow(fingerprints[0]);
143
+ const initialChecks = checks.getStates(0);
144
+ const initialStutters = checks.getStutters(0);
145
+ for (let tableauNode = 0; tableauNode < tableau.initialCount; tableauNode++) {
146
+ if (!checks.isConsistent(tableauNode, 0)) continue;
147
+ const node = createNode(fingerprints[0], tableauNode, 0, initialChecks);
148
+ graph.initial.push(node);
149
+ initialRow[tableauNode] = node;
150
+ }
151
+ for (const source of graph.initial) {
152
+ for (const tableauNode of tableau.nodes[source.tableau].successors) {
153
+ const target = initialRow[tableauNode];
154
+ if (!target) {
155
+ graph.isPartial = true;
156
+ continue;
157
+ }
158
+ addTransition(source, target, initialStutters, 0);
159
+ }
160
+ }
161
+ let sources = [...graph.initial];
162
+ if (isComplete) extend(sources, sources, initialRow, 0, initialChecks, initialStutters);
163
+ for (let position = 1; position < fingerprints.length; position++) {
164
+ const row = getRow(fingerprints[position]);
165
+ const stateChecks = checks.getStates(position);
166
+ const targets: GraphNode[] = [];
167
+ extend(sources, targets, row, position, stateChecks, checks.getSteps(position));
168
+ extend(targets, targets, row, position, stateChecks, checks.getStutters(position));
169
+ sources = targets;
170
+ }
171
+ return graph;
172
+ };
173
+
174
+ const findLasso = (
175
+ fingerprints: bigint[],
176
+ solution: Solution,
177
+ initial: GraphNode[],
178
+ ): TraceLasso | undefined => {
179
+ const promises = solution.promises;
180
+ const tableauNodes = solution.tableau?.nodes ?? [];
181
+ const stack: GraphNode[] = [];
182
+ let firstNumber = 1;
183
+ let secondNumber = MAX_FIRST + 1;
184
+ let thirdNumber = MAX_SECOND + 1;
185
+ let startSecondNumber = secondNumber;
186
+ let startThirdNumber = thirdNumber;
187
+ let firstComponentNumber = secondNumber;
188
+ let secondComponentNumber = thirdNumber;
189
+ let model = solution.models[0];
190
+ let lasso: TraceLasso | undefined;
191
+
192
+ const isEventuallyAlways = (node: GraphNode, transition: number) => {
193
+ const actionChecks = node.actionChecks[transition];
194
+ const checks = model.eventuallyAlways;
195
+ for (let index = 0; index < checks.length; index++) {
196
+ if (!actionChecks[checks[index]]) return false;
197
+ }
198
+ return true;
199
+ };
200
+ const getLasso = (node: GraphNode): TraceLasso => {
201
+ const cycle: GraphNode[] = [];
202
+ const lowNumber = thirdNumber - 1;
203
+ const states = model.infinitelyOftenStates;
204
+ const actions = model.infinitelyOftenActions;
205
+ const isStateFound = states.map(() => false);
206
+ const isActionFound = actions.map(() => false);
207
+ const isPromiseFound = promises.map(() => false);
208
+ let count = states.length + actions.length + promises.length;
209
+ let current = node;
210
+ while (count > 0) {
211
+ current.number = thirdNumber;
212
+ const countBefore = count;
213
+ search: while (true) {
214
+ for (let index = 0; index < states.length; index++) {
215
+ if (!isStateFound[index] && current.stateChecks[states[index]]) {
216
+ isStateFound[index] = true;
217
+ count--;
218
+ }
219
+ }
220
+ for (let index = 0; index < promises.length; index++) {
221
+ if (
222
+ !isPromiseFound[index] &&
223
+ isFulfilling(tableauNodes[current.tableau].particle, promises[index])
224
+ ) {
225
+ isPromiseFound[index] = true;
226
+ count--;
227
+ }
228
+ }
229
+ if (count <= 0) break;
230
+ let inComponent: GraphNode | undefined;
231
+ let unvisited: GraphNode | undefined;
232
+ const countBeforeActions = count;
233
+ for (let index = 0; index < current.successors.length; index++) {
234
+ const target = current.successors[index];
235
+ const targetNumber = target.number;
236
+ if (lowNumber <= targetNumber && targetNumber <= thirdNumber) {
237
+ inComponent = target;
238
+ for (let action = 0; action < actions.length; action++) {
239
+ if (!isActionFound[action] && current.actionChecks[index][actions[action]]) {
240
+ isActionFound[action] = true;
241
+ count--;
242
+ }
243
+ }
244
+ }
245
+ if (count < countBeforeActions) {
246
+ cycle.push(current);
247
+ current = target;
248
+ thirdNumber++;
249
+ break search;
250
+ }
251
+ if (lowNumber <= targetNumber && targetNumber < thirdNumber) unvisited = target;
252
+ }
253
+ if (count < countBefore && inComponent) {
254
+ cycle.push(current);
255
+ current = inComponent;
256
+ thirdNumber++;
257
+ break;
258
+ }
259
+ while (unvisited === undefined) {
260
+ current = pop(cycle);
261
+ for (let index = 0; index < current.successors.length; index++) {
262
+ const target = current.successors[index];
263
+ if (lowNumber <= target.number && target.number < thirdNumber) {
264
+ cycle.push(current);
265
+ unvisited = target;
266
+ break;
267
+ }
268
+ }
269
+ }
270
+ cycle.push(current);
271
+ current = unvisited;
272
+ current.number = thirdNumber;
273
+ }
274
+ }
275
+ thirdNumber++;
276
+ current.number = thirdNumber;
277
+ close: while (current !== node) {
278
+ let isFound = false;
279
+ for (let index = 0; index < current.successors.length; index++) {
280
+ const target = current.successors[index];
281
+ if (lowNumber <= target.number && target.number < thirdNumber) {
282
+ cycle.push(current);
283
+ if (target === node) break close;
284
+ isFound = true;
285
+ current = target;
286
+ current.number = thirdNumber;
287
+ break;
288
+ }
289
+ }
290
+ if (!isFound) current = pop(cycle);
291
+ }
292
+ if (cycle.length === 0) cycle.push(current);
293
+ // Deviation from TLC: LiveCheck1#printErrorTrace shows the behavior's states in order, not those of the lasso it found, which differ once the behavior revisits a state.
294
+ const positions: number[] = [];
295
+ for (let position = 0; position <= node.position; position++) {
296
+ if (position === 0 || fingerprints[position] !== fingerprints[position - 1]) {
297
+ positions.push(position);
298
+ }
299
+ }
300
+ const cyclePosition = positions.length;
301
+ for (let index = 1; index < cycle.length; index++) {
302
+ if (cycle[index].fingerprint !== cycle[index - 1].fingerprint) {
303
+ positions.push(getStepTo(cycle[index - 1], cycle[index]));
304
+ }
305
+ }
306
+ const last = cycle[cycle.length - 1];
307
+ return {
308
+ positions,
309
+ cyclePosition,
310
+ backPosition: last.fingerprint === node.fingerprint ? undefined : getStepTo(last, node),
311
+ };
312
+ };
313
+ const checkSubcomponent = (node: GraphNode) => {
314
+ const states = model.infinitelyOftenStates;
315
+ const actions = model.infinitelyOftenActions;
316
+ const isStateFound = states.map(() => false);
317
+ const isActionFound = actions.map(() => false);
318
+ const isPromiseFound = promises.map(() => false);
319
+ const pending = [node];
320
+ node.number++;
321
+ while (pending.length > 0) {
322
+ const current = pop(pending);
323
+ for (let index = 0; index < states.length; index++) {
324
+ if (!isStateFound[index]) isStateFound[index] = current.stateChecks[states[index]];
325
+ }
326
+ for (let index = 0; index < current.successors.length; index++) {
327
+ const target = current.successors[index];
328
+ const targetNumber = target.number;
329
+ if (targetNumber >= thirdNumber) {
330
+ for (let action = 0; action < actions.length; action++) {
331
+ if (!isActionFound[action]) {
332
+ isActionFound[action] = current.actionChecks[index][actions[action]];
333
+ }
334
+ }
335
+ }
336
+ if (targetNumber === thirdNumber) {
337
+ target.number++;
338
+ pending.push(target);
339
+ }
340
+ }
341
+ for (let index = 0; index < promises.length; index++) {
342
+ if (isFulfilling(tableauNodes[current.tableau].particle, promises[index])) {
343
+ isPromiseFound[index] = true;
344
+ }
345
+ }
346
+ }
347
+ thirdNumber += 2;
348
+ if (
349
+ lasso === undefined &&
350
+ !isStateFound.includes(false) &&
351
+ !isActionFound.includes(false) &&
352
+ !isPromiseFound.includes(false)
353
+ ) {
354
+ lasso = getLasso(node);
355
+ }
356
+ };
357
+ const canStutter = (node: GraphNode) => {
358
+ const stutter = node.successors.indexOf(node);
359
+ return (
360
+ stutter !== -1 && firstComponentNumber <= node.number && isEventuallyAlways(node, stutter)
361
+ );
362
+ };
363
+ const extractSubcomponent = (node: GraphNode) => {
364
+ let popped = pop(stack);
365
+ if (popped === node && !canStutter(node)) {
366
+ node.number = thirdNumber++;
367
+ return false;
368
+ }
369
+ popped.number = thirdNumber;
370
+ while (popped !== node) {
371
+ popped = pop(stack);
372
+ popped.number = thirdNumber;
373
+ }
374
+ return true;
375
+ };
376
+ const checkSubcomponents = (node: GraphNode): number => {
377
+ let lowlink = secondNumber++;
378
+ node.number = lowlink;
379
+ stack.push(node);
380
+ for (let index = 0; index < node.successors.length; index++) {
381
+ const target = node.successors[index];
382
+ let targetNumber = target.number;
383
+ if (firstComponentNumber <= targetNumber && isEventuallyAlways(node, index)) {
384
+ if (
385
+ targetNumber < startSecondNumber ||
386
+ (secondComponentNumber <= targetNumber && targetNumber < startThirdNumber)
387
+ ) {
388
+ targetNumber = checkSubcomponents(target);
389
+ }
390
+ if (targetNumber < lowlink) lowlink = targetNumber;
391
+ }
392
+ }
393
+ if (lowlink === node.number && extractSubcomponent(node)) checkSubcomponent(node);
394
+ return lowlink;
395
+ };
396
+ const extractComponent = (node: GraphNode) => {
397
+ let popped = pop(stack);
398
+ if (popped === node && !node.successors.includes(node)) {
399
+ node.number = MAX_FIRST;
400
+ return undefined;
401
+ }
402
+ const nodes: GraphNode[] = [];
403
+ firstComponentNumber = secondNumber++;
404
+ secondComponentNumber = thirdNumber;
405
+ popped.number = firstComponentNumber;
406
+ nodes.push(popped);
407
+ while (popped !== node) {
408
+ popped = pop(stack);
409
+ popped.number = firstComponentNumber;
410
+ nodes.push(popped);
411
+ }
412
+ return nodes;
413
+ };
414
+ const checkComponent = (node: GraphNode) => {
415
+ const nodes = extractComponent(node);
416
+ if (!nodes) return;
417
+ for (const errorModel of solution.models) {
418
+ model = errorModel;
419
+ startSecondNumber = secondNumber;
420
+ startThirdNumber = thirdNumber;
421
+ for (let index = nodes.length - 1; index >= 0; index--) {
422
+ if (nodes[index].number < startThirdNumber) checkSubcomponents(nodes[index]);
423
+ }
424
+ }
425
+ };
426
+ const checkComponents = (node: GraphNode): number => {
427
+ let lowlink = firstNumber++;
428
+ node.number = lowlink;
429
+ stack.push(node);
430
+ for (let index = 0; index < node.successors.length; index++) {
431
+ const target = node.successors[index];
432
+ const targetNumber = target.number === 0 ? checkComponents(target) : target.number;
433
+ if (targetNumber < lowlink) lowlink = targetNumber;
434
+ }
435
+ if (lowlink === node.number) checkComponent(node);
436
+ return lowlink;
437
+ };
438
+ for (const node of initial) {
439
+ if (node.number === 0) checkComponents(node);
440
+ if (lasso) return lasso;
441
+ }
442
+ return undefined;
443
+ };
444
+
445
+ export const findTraceLasso = (
446
+ trace: Value[][],
447
+ fingerprints: bigint[],
448
+ solutions: Solution[],
449
+ atoms: LiveAtoms<Value[]>,
450
+ isShared: boolean,
451
+ ): TraceLasso | undefined => {
452
+ const stateCache = new Map<LiveExpression, boolean>();
453
+ const holds = (check: LiveExpression, position: number, next: number | undefined) => {
454
+ stateCache.clear();
455
+ return evaluateLive(
456
+ check,
457
+ trace[position],
458
+ next === undefined ? undefined : trace[next],
459
+ atoms,
460
+ stateCache,
461
+ );
462
+ };
463
+ const statePositions = trace.map((_state, position) => position);
464
+ const stepPositions = trace.map((_state, position) => position);
465
+ if (isShared) {
466
+ const firstStates = new Map<bigint, number>();
467
+ const firstSteps = new Map<number, number>();
468
+ for (let position = 0; position < trace.length; position++) {
469
+ const first = firstStates.get(fingerprints[position]) ?? position;
470
+ firstStates.set(fingerprints[position], first);
471
+ if (isSameState(trace[first], trace[position])) statePositions[position] = first;
472
+ if (position === 0) continue;
473
+ const key = statePositions[position - 1] * trace.length + statePositions[position];
474
+ stepPositions[position] = firstSteps.get(key) ?? position;
475
+ firstSteps.set(key, stepPositions[position]);
476
+ }
477
+ }
478
+ const solutionChecks = solutions.map((solution): TraceChecks => {
479
+ const states: boolean[][] = [];
480
+ const steps: boolean[][] = [];
481
+ const stutters: boolean[][] = [];
482
+ const consistent: boolean[][] = [];
483
+ const statePredicates = solution.tableau?.nodes.map((node) => node.statePredicates) ?? [];
484
+ return {
485
+ getStates: (position) => {
486
+ const first = statePositions[position];
487
+ return (states[first] ??= solution.stateChecks.map((check) =>
488
+ holds(check, first, undefined),
489
+ ));
490
+ },
491
+ getSteps: (position) => {
492
+ const first = stepPositions[position];
493
+ return (steps[first] ??= solution.actionChecks.map((check) =>
494
+ holds(check, first - 1, first),
495
+ ));
496
+ },
497
+ getStutters: (position) => {
498
+ const first = statePositions[position];
499
+ return (stutters[first] ??= solution.actionChecks.map((check) =>
500
+ holds(check, first, first),
501
+ ));
502
+ },
503
+ isConsistent: (tableauNode, position) => {
504
+ const first = statePositions[position];
505
+ const row = (consistent[first] ??= []);
506
+ const known = isShared ? row[tableauNode] : undefined;
507
+ if (known !== undefined) return known;
508
+ row[tableauNode] = statePredicates[tableauNode].every((predicate) =>
509
+ holds(predicate, first, undefined),
510
+ );
511
+ return row[tableauNode];
512
+ },
513
+ };
514
+ });
515
+ const partial: number[] = [];
516
+ for (let index = 0; index < solutions.length; index++) {
517
+ const graph = createGraph(fingerprints, solutions[index], solutionChecks[index], false);
518
+ const lasso = findLasso(fingerprints, solutions[index], graph.initial);
519
+ if (lasso) return lasso;
520
+ if (graph.isPartial) partial.push(index);
521
+ }
522
+ // Deviation from TLC: LiveCheck1#constructBEGraph gives the initial state no stuttering step to a tableau node that isn't initial and goes on from no node a revisited state reaches, so it misses a violation past them.
523
+ for (const index of partial) {
524
+ const graph = createGraph(fingerprints, solutions[index], solutionChecks[index], true);
525
+ const lasso = findLasso(fingerprints, solutions[index], graph.initial);
526
+ if (lasso) return lasso;
527
+ }
528
+ return undefined;
529
+ };
package/src/transfer.ts CHANGED
@@ -19,7 +19,6 @@ const SET_TAG = 5;
19
19
  const FUNCTION_TAG = 6;
20
20
  const INTERVAL_FUNCTION_TAG = 7;
21
21
 
22
- // A function's TLC class follows its tag, so a worker words errors about it as TLC does.
23
22
  const FUNCTION_CLASSES: (FunctionClass | undefined)[] = [undefined, "lambda", "tuple", "record"];
24
23
 
25
24
  export interface EncodedStates {
@@ -34,16 +33,18 @@ interface StateEncoder {
34
33
  }
35
34
 
36
35
  export const createStateEncoder = (): StateEncoder => {
37
- const buffer = { words: new Int32Array(1024), length: 0, count: 0 };
36
+ let words = new Int32Array(1024);
37
+ let length = 0;
38
+ let count = 0;
38
39
  const strings: string[] = [];
39
40
  const stringIndexes = new Map<string, number>();
40
41
  const pushWord = (word: number) => {
41
- if (buffer.length === buffer.words.length) {
42
- const words = new Int32Array(buffer.words.length * 2);
43
- words.set(buffer.words);
44
- buffer.words = words;
42
+ if (length === words.length) {
43
+ const grown = new Int32Array(words.length * 2);
44
+ grown.set(words);
45
+ words = grown;
45
46
  }
46
- buffer.words[buffer.length++] = word;
47
+ words[length++] = word;
47
48
  };
48
49
  const pushString = (value: string) => {
49
50
  const known = stringIndexes.get(value);
@@ -96,19 +97,15 @@ export const createStateEncoder = (): StateEncoder => {
96
97
  };
97
98
  return {
98
99
  encode: (state) => {
99
- const start = buffer.length;
100
+ const start = length;
100
101
  if (state.every(encodeValue)) {
101
- buffer.count++;
102
+ count++;
102
103
  return true;
103
104
  }
104
- buffer.length = start;
105
+ length = start;
105
106
  return false;
106
107
  },
107
- finish: () => ({
108
- words: buffer.words.slice(0, buffer.length),
109
- strings,
110
- count: buffer.count,
111
- }),
108
+ finish: () => ({ words: words.slice(0, length), strings, count }),
112
109
  };
113
110
  };
114
111
 
@@ -116,27 +113,27 @@ export const createStateDecoder =
116
113
  (width: number) =>
117
114
  (encoded: EncodedStates): Value[][] => {
118
115
  const words = encoded.words;
119
- const cursor = { index: 0 };
116
+ let cursor = 0;
120
117
  const decodeElements = (length: number) => Array.from({ length }, () => decodeValue());
121
118
  const decodeValue = (): Value => {
122
- const tag = words[cursor.index++];
119
+ const tag = words[cursor++];
123
120
  if (tag === FALSE_TAG) return false;
124
121
  if (tag === TRUE_TAG) return true;
125
- if (tag === INTEGER_TAG) return words[cursor.index++];
126
- if (tag === STRING_TAG) return encoded.strings[words[cursor.index++]];
127
- if (tag === MODEL_VALUE_TAG) return createModelValue(encoded.strings[words[cursor.index++]]);
128
- if (tag === SET_TAG) return createSortedSet(decodeElements(words[cursor.index++]));
129
- const functionClass = FUNCTION_CLASSES[words[cursor.index++]];
122
+ if (tag === INTEGER_TAG) return words[cursor++];
123
+ if (tag === STRING_TAG) return encoded.strings[words[cursor++]];
124
+ if (tag === MODEL_VALUE_TAG) return createModelValue(encoded.strings[words[cursor++]]);
125
+ if (tag === SET_TAG) return createSortedSet(decodeElements(words[cursor++]));
126
+ const functionClass = FUNCTION_CLASSES[words[cursor++]];
130
127
  if (tag === INTERVAL_FUNCTION_TAG) {
131
- const low = words[cursor.index++];
132
- const length = words[cursor.index++];
128
+ const low = words[cursor++];
129
+ const length = words[cursor++];
133
130
  const domain = getFunctionDomain({ kind: "Interval", low, high: low + length - 1 });
134
131
  return setFunctionClass(
135
132
  createSortedFunction(domain, decodeElements(length)),
136
133
  functionClass,
137
134
  );
138
135
  }
139
- const length = words[cursor.index++];
136
+ const length = words[cursor++];
140
137
  const domain = decodeElements(length);
141
138
  return setFunctionClass(createSortedFunction(domain, decodeElements(length)), functionClass);
142
139
  };