tla-ts 0.0.10-dev.094b9b512 → 0.0.10-dev.1ebc153bd

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 (530) hide show
  1. package/dist/compile.cjs +3 -3
  2. package/dist/compile.js +1 -1
  3. package/dist/deciders.cjs +37 -36
  4. package/dist/deciders.js +38 -37
  5. package/dist/index.cjs +1 -1
  6. package/dist/index.d.cts +5 -1
  7. package/dist/index.d.ts +5 -1
  8. package/dist/index.js +1 -1
  9. package/dist/parallel-worker.cjs +1 -1
  10. package/dist/parallel-worker.js +1 -1
  11. package/dist/prove-worker.cjs +1 -1
  12. package/dist/prove-worker.js +1 -1
  13. package/dist/prove.cjs +146 -58
  14. package/dist/prove.js +145 -57
  15. package/dist/run.cjs +43 -43
  16. package/dist/run.js +45 -45
  17. package/dist/tlapm.cjs +1 -1
  18. package/dist/tlapm.js +2 -2
  19. package/dist/transfer.cjs +40 -37
  20. package/dist/transfer.js +38 -35
  21. package/dist/worker.cjs +6 -6
  22. package/dist/worker.js +6 -6
  23. package/package.json +1 -1
  24. package/src/ast.ts +4 -3
  25. package/src/bags.ts +46 -28
  26. package/src/check-trace.ts +2 -16
  27. package/src/check.ts +349 -91
  28. package/src/cli/runtime-invariants.ts +20 -56
  29. package/src/cli/tlapm.ts +268 -71
  30. package/src/cli/tlc-arguments.ts +2 -2
  31. package/src/cli/tlc-output.ts +4 -5
  32. package/src/cli/tlc-usage.ts +0 -1
  33. package/src/cli/tlc.ts +26 -7
  34. package/src/cli/xml-exporter.ts +1 -1
  35. package/src/codegen.ts +9 -5
  36. package/src/dependencies.ts +72 -11
  37. package/src/dfid.ts +9 -2
  38. package/src/environment.ts +65 -36
  39. package/src/errors.ts +8 -1
  40. package/src/evaluate.ts +92 -32
  41. package/src/exit-codes.ts +5 -2
  42. package/src/instances.ts +5 -5
  43. package/src/java-overrides.ts +2 -2
  44. package/src/levels.ts +138 -90
  45. package/src/liveness-checker.ts +572 -204
  46. package/src/liveness.ts +47 -32
  47. package/src/obligations/action.ts +0 -2
  48. package/src/obligations/anonymize.ts +2 -6
  49. package/src/obligations/equality.ts +0 -2
  50. package/src/obligations/expression.ts +0 -2
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +0 -2
  53. package/src/obligations/index.ts +9 -8
  54. package/src/obligations/levels.ts +0 -2
  55. package/src/obligations/module.ts +0 -2
  56. package/src/obligations/normalize.ts +1 -6
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +2 -2
  59. package/src/obligations/printer.ts +5 -7
  60. package/src/obligations/proof.ts +0 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +0 -2
  63. package/src/obligations/subexpression.ts +1 -4
  64. package/src/obligations/substitution.ts +0 -2
  65. package/src/obligations/temporal.ts +0 -2
  66. package/src/obligations/tuples.ts +0 -2
  67. package/src/parallel-worker.ts +8 -2
  68. package/src/parallel.ts +7 -2
  69. package/src/parser.ts +256 -185
  70. package/src/pretty-print.ts +1 -1
  71. package/src/prover/deciders.ts +1 -8
  72. package/src/prover/isabelle/encode.ts +0 -2
  73. package/src/prover/isabelle/isar/attrib.ts +86 -55
  74. package/src/prover/isabelle/isar/context.ts +25 -26
  75. package/src/prover/isabelle/isar/induct.ts +2 -12
  76. package/src/prover/isabelle/isar/method.ts +6 -10
  77. package/src/prover/isabelle/isar/proof.ts +40 -39
  78. package/src/prover/isabelle/isar/rule-cases.ts +14 -22
  79. package/src/prover/isabelle/isar/theory.ts +16 -17
  80. package/src/prover/isabelle/isar/toplevel.ts +46 -56
  81. package/src/prover/isabelle/isar/type-check.ts +0 -2
  82. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  83. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  84. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  85. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  88. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  89. package/src/prover/isabelle/provers/classical.ts +1 -3
  90. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  91. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  92. package/src/prover/isabelle/pure/consts.ts +0 -2
  93. package/src/prover/isabelle/pure/conv.ts +0 -2
  94. package/src/prover/isabelle/pure/drule.ts +0 -2
  95. package/src/prover/isabelle/pure/envir.ts +0 -2
  96. package/src/prover/isabelle/pure/goal.ts +0 -2
  97. package/src/prover/isabelle/pure/logic.ts +0 -2
  98. package/src/prover/isabelle/pure/name.ts +0 -2
  99. package/src/prover/isabelle/pure/net.ts +0 -2
  100. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  101. package/src/prover/isabelle/pure/pattern.ts +0 -2
  102. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  103. package/src/prover/isabelle/pure/rewriter.ts +3 -5
  104. package/src/prover/isabelle/pure/search.ts +0 -2
  105. package/src/prover/isabelle/pure/seq.ts +0 -2
  106. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  107. package/src/prover/isabelle/pure/table.ts +0 -2
  108. package/src/prover/isabelle/pure/tactic.ts +0 -2
  109. package/src/prover/isabelle/pure/tactical.ts +0 -2
  110. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  111. package/src/prover/isabelle/pure/term.ts +3 -5
  112. package/src/prover/isabelle/pure/thm.ts +0 -2
  113. package/src/prover/isabelle/pure/type.ts +0 -2
  114. package/src/prover/isabelle/pure/unify.ts +0 -2
  115. package/src/prover/isabelle/pure/variable.ts +0 -2
  116. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  117. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  118. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  119. package/src/prover/ocaml.ts +4 -1
  120. package/src/prover/prep/action.ts +1 -0
  121. package/src/prover/prep/md5.ts +26 -29
  122. package/src/prover/prep/methods.ts +55 -6
  123. package/src/prover/prep/normalize.ts +4 -1
  124. package/src/prover/prove.ts +58 -32
  125. package/src/prover/ptl/decide.ts +43 -63
  126. package/src/prover/smt/context.ts +10 -14
  127. package/src/prover/smt/data.ts +51 -45
  128. package/src/prover/smt/encode.ts +1 -2
  129. package/src/prover/smt/rewrite.ts +3 -7
  130. package/src/prover/smt/simplify.ts +1 -1
  131. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  132. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  133. package/src/prover/smt/solver/ackr-model-converter.ts +1 -8
  134. package/src/prover/smt/solver/act-cache.ts +0 -1
  135. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  136. package/src/prover/smt/solver/aig-tactic.ts +25 -16
  137. package/src/prover/smt/solver/aig.ts +2 -3
  138. package/src/prover/smt/solver/arith-rewriter.ts +4 -7
  139. package/src/prover/smt/solver/arith-terms.ts +0 -2
  140. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  141. package/src/prover/smt/solver/array-rewriter.ts +1 -4
  142. package/src/prover/smt/solver/asserted-formulas.ts +67 -3
  143. package/src/prover/smt/solver/ast-lt.ts +2 -3
  144. package/src/prover/smt/solver/ast-util.ts +4 -5
  145. package/src/prover/smt/solver/ast.ts +171 -168
  146. package/src/prover/smt/solver/auf-solver.ts +0 -1
  147. package/src/prover/smt/solver/bit-blast-tactic.ts +2 -11
  148. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  149. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  150. package/src/prover/smt/solver/bound-manager.ts +39 -29
  151. package/src/prover/smt/solver/bound-simplifier.ts +2 -5
  152. package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
  153. package/src/prover/smt/solver/bv-decl-plugin.ts +13 -11
  154. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  155. package/src/prover/smt/solver/bv-rewriter.ts +15 -19
  156. package/src/prover/smt/solver/bv1-blast.ts +1 -11
  157. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  158. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  159. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  160. package/src/prover/smt/solver/card2bv.ts +3 -7
  161. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  162. package/src/prover/smt/solver/cg-table.ts +19 -16
  163. package/src/prover/smt/solver/check-logic.ts +6 -2
  164. package/src/prover/smt/solver/clause.ts +0 -1
  165. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +2 -5
  166. package/src/prover/smt/solver/conflict-resolution.ts +8 -8
  167. package/src/prover/smt/solver/context.ts +45 -15
  168. package/src/prover/smt/solver/ctx-simplify.ts +1 -3
  169. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  170. package/src/prover/smt/solver/datatype-decl-plugin.ts +22 -17
  171. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  172. package/src/prover/smt/solver/demodulator.ts +2 -5
  173. package/src/prover/smt/solver/dependent-expr-state.ts +25 -7
  174. package/src/prover/smt/solver/der.ts +0 -1
  175. package/src/prover/smt/solver/diff-neq.ts +1 -3
  176. package/src/prover/smt/solver/distribute-forall.ts +1 -11
  177. package/src/prover/smt/solver/dom-simplify.ts +1 -3
  178. package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
  179. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  180. package/src/prover/smt/solver/e-matching.ts +6 -7
  181. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  182. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  183. package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
  184. package/src/prover/smt/solver/enode.ts +16 -10
  185. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  186. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  187. package/src/prover/smt/solver/euf/arith-internalize.ts +2 -8
  188. package/src/prover/smt/solver/euf/arith-solver.ts +0 -6
  189. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  190. package/src/prover/smt/solver/euf/array-internalize.ts +21 -12
  191. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  192. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  193. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
  194. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  195. package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
  196. package/src/prover/smt/solver/euf/egraph.ts +69 -53
  197. package/src/prover/smt/solver/euf/euf-solver.ts +38 -37
  198. package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
  199. package/src/prover/smt/solver/euf/mam.ts +7 -55
  200. package/src/prover/smt/solver/euf/q-ematch.ts +27 -98
  201. package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
  202. package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
  203. package/src/prover/smt/solver/euf/q-solver.ts +3 -3
  204. package/src/prover/smt/solver/euf/th-solver.ts +1 -16
  205. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  206. package/src/prover/smt/solver/expr-ref.ts +0 -1
  207. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  208. package/src/prover/smt/solver/expr2polynomial.ts +204 -80
  209. package/src/prover/smt/solver/factor.ts +37 -26
  210. package/src/prover/smt/solver/fd-solver.ts +3 -5
  211. package/src/prover/smt/solver/fingerprints.ts +0 -1
  212. package/src/prover/smt/solver/fix-dl-var.ts +2 -4
  213. package/src/prover/smt/solver/flat-literals.ts +0 -1
  214. package/src/prover/smt/solver/fm-tactic.ts +25 -14
  215. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  216. package/src/prover/smt/solver/fpa-rewriter.ts +12 -14
  217. package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
  218. package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -1
  219. package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -3
  220. package/src/prover/smt/solver/goal.ts +6 -4
  221. package/src/prover/smt/solver/goal2nlsat.ts +57 -32
  222. package/src/prover/smt/solver/guard-set.ts +0 -1
  223. package/src/prover/smt/solver/hash.ts +0 -1
  224. package/src/prover/smt/solver/hashtable.ts +4 -1
  225. package/src/prover/smt/solver/inf-eps.ts +1 -2
  226. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  227. package/src/prover/smt/solver/internalizer.ts +41 -3
  228. package/src/prover/smt/solver/lackr.ts +0 -2
  229. package/src/prover/smt/solver/lbool.ts +0 -1
  230. package/src/prover/smt/solver/lia2card.ts +1 -2
  231. package/src/prover/smt/solver/lia2pb.ts +18 -5
  232. package/src/prover/smt/solver/literal.ts +0 -1
  233. package/src/prover/smt/solver/logic-tactics.ts +9 -6
  234. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  235. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  236. package/src/prover/smt/solver/lp/containers.ts +7 -2
  237. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  238. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  239. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  240. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  241. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  242. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  243. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  244. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  245. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  246. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  247. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  248. package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
  249. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  250. package/src/prover/smt/solver/lp/lp-settings.ts +1 -2
  251. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  252. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  253. package/src/prover/smt/solver/lp/nex.ts +2 -2
  254. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  255. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  256. package/src/prover/smt/solver/lp/nla-core.ts +26 -7
  257. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  258. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  259. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  260. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
  261. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  262. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  263. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  264. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  265. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  266. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  267. package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
  268. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  269. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  270. package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
  271. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  273. package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
  274. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  275. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  276. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  277. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  278. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  279. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  280. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  281. package/src/prover/smt/solver/lp/union-find.ts +1 -2
  282. package/src/prover/smt/solver/macro-finder.ts +1 -4
  283. package/src/prover/smt/solver/mam-compiler.ts +14 -15
  284. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  285. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
  286. package/src/prover/smt/solver/max-cliques.ts +0 -2
  287. package/src/prover/smt/solver/maxcore.ts +6 -15
  288. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -2
  289. package/src/prover/smt/solver/maxlex.ts +0 -8
  290. package/src/prover/smt/solver/maxsmt-base.ts +7 -1
  291. package/src/prover/smt/solver/maxsmt.ts +0 -1
  292. package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
  293. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  294. package/src/prover/smt/solver/mbp/mbp-plugin.ts +10 -3
  295. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  296. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
  297. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +1 -19
  298. package/src/prover/smt/solver/model-based-opt.ts +1 -2
  299. package/src/prover/smt/solver/model-checker.ts +2 -3
  300. package/src/prover/smt/solver/model-evaluator.ts +9 -6
  301. package/src/prover/smt/solver/model-finder.ts +0 -1
  302. package/src/prover/smt/solver/model-generator.ts +3 -2
  303. package/src/prover/smt/solver/model-macro-solver.ts +3 -4
  304. package/src/prover/smt/solver/model-printer.ts +0 -1
  305. package/src/prover/smt/solver/mpf.ts +2 -5
  306. package/src/prover/smt/solver/mus.ts +2 -4
  307. package/src/prover/smt/solver/muz/dl-context.ts +67 -19
  308. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  309. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
  310. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
  311. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -6
  312. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
  313. package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
  314. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
  315. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -30
  316. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
  317. package/src/prover/smt/solver/muz/dl-rule.ts +93 -57
  318. package/src/prover/smt/solver/muz/hnf.ts +6 -6
  319. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  320. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
  321. package/src/prover/smt/solver/muz/rule-properties.ts +195 -37
  322. package/src/prover/smt/solver/muz/spacer-context.ts +111 -102
  323. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -4
  324. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  325. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -6
  326. package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
  327. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +4 -15
  328. package/src/prover/smt/solver/muz/spacer-util.ts +2 -29
  329. package/src/prover/smt/solver/muz/substitution.ts +88 -39
  330. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  331. package/src/prover/smt/solver/nlqsat.ts +5 -5
  332. package/src/prover/smt/solver/nlsat/algebraic.ts +197 -96
  333. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  334. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  335. package/src/prover/smt/solver/nlsat/explain.ts +379 -217
  336. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  337. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  338. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  339. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  340. package/src/prover/smt/solver/nlsat/solver.ts +118 -105
  341. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  342. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
  343. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  344. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  345. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  346. package/src/prover/smt/solver/nlsat-tactic.ts +1 -2
  347. package/src/prover/smt/solver/nnf.ts +6 -3
  348. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  349. package/src/prover/smt/solver/occf.ts +0 -1
  350. package/src/prover/smt/solver/opt-context.ts +19 -13
  351. package/src/prover/smt/solver/opt-nlsat.ts +97 -77
  352. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  353. package/src/prover/smt/solver/opt-preprocess.ts +1 -2
  354. package/src/prover/smt/solver/opt-solver.ts +22 -11
  355. package/src/prover/smt/solver/opt-value.ts +0 -1
  356. package/src/prover/smt/solver/optsmt.ts +13 -12
  357. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  358. package/src/prover/smt/solver/pattern-inference.ts +2 -3
  359. package/src/prover/smt/solver/pb-rewriter.ts +15 -30
  360. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  361. package/src/prover/smt/solver/poly-rewriter.ts +76 -21
  362. package/src/prover/smt/solver/probes.ts +91 -28
  363. package/src/prover/smt/solver/propagate-values.ts +4 -1
  364. package/src/prover/smt/solver/proto-model.ts +9 -12
  365. package/src/prover/smt/solver/pull-quant.ts +0 -1
  366. package/src/prover/smt/solver/purify-arith.ts +50 -16
  367. package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
  368. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  369. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  370. package/src/prover/smt/solver/qe-lite.ts +2 -3
  371. package/src/prover/smt/solver/qe-mbp.ts +13 -24
  372. package/src/prover/smt/solver/qe.ts +48 -57
  373. package/src/prover/smt/solver/qel.ts +0 -1
  374. package/src/prover/smt/solver/qi-queue.ts +0 -1
  375. package/src/prover/smt/solver/qsat.ts +71 -97
  376. package/src/prover/smt/solver/quant-hoist.ts +2 -1
  377. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  378. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  379. package/src/prover/smt/solver/quantifier-manager.ts +14 -10
  380. package/src/prover/smt/solver/quasi-macros.ts +9 -20
  381. package/src/prover/smt/solver/random-gen.ts +0 -1
  382. package/src/prover/smt/solver/rational.ts +17 -1
  383. package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
  384. package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
  385. package/src/prover/smt/solver/reduce-args.ts +0 -1
  386. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  387. package/src/prover/smt/solver/ref-vector.ts +0 -1
  388. package/src/prover/smt/solver/relevancy.ts +0 -1
  389. package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
  390. package/src/prover/smt/solver/rewriter.ts +1 -2
  391. package/src/prover/smt/solver/rlimit.ts +17 -1
  392. package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
  393. package/src/prover/smt/solver/sat/big.ts +0 -1
  394. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
  395. package/src/prover/smt/solver/sat/clause.ts +2 -20
  396. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  397. package/src/prover/smt/solver/sat/config.ts +6 -9
  398. package/src/prover/smt/solver/sat/consequences.ts +1 -2
  399. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  400. package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
  401. package/src/prover/smt/solver/sat/inc-sat-solver.ts +30 -15
  402. package/src/prover/smt/solver/sat/model-converter.ts +2 -22
  403. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  404. package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
  405. package/src/prover/smt/solver/sat/probing.ts +22 -21
  406. package/src/prover/smt/solver/sat/sat-tactic.ts +4 -4
  407. package/src/prover/smt/solver/sat/sat2goal.ts +9 -15
  408. package/src/prover/smt/solver/sat/scc.ts +1 -2
  409. package/src/prover/smt/solver/sat/simplifier.ts +16 -60
  410. package/src/prover/smt/solver/sat/solver.ts +47 -70
  411. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  412. package/src/prover/smt/solver/sat/watch-list.ts +7 -3
  413. package/src/prover/smt/solver/search-tree.ts +0 -1
  414. package/src/prover/smt/solver/seq-axioms.ts +21 -39
  415. package/src/prover/smt/solver/seq-decl-plugin.ts +10 -14
  416. package/src/prover/smt/solver/seq-derive.ts +11 -16
  417. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  418. package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
  419. package/src/prover/smt/solver/seq-factory.ts +2 -4
  420. package/src/prover/smt/solver/seq-monadic.ts +7 -7
  421. package/src/prover/smt/solver/seq-range-predicate.ts +18 -8
  422. package/src/prover/smt/solver/seq-re-rewriter.ts +5 -130
  423. package/src/prover/smt/solver/seq-re-util.ts +8 -27
  424. package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
  425. package/src/prover/smt/solver/seq-regex-live.ts +6 -8
  426. package/src/prover/smt/solver/seq-rewriter.ts +32 -35
  427. package/src/prover/smt/solver/seq-skolem.ts +0 -24
  428. package/src/prover/smt/solver/seq-subset.ts +0 -1
  429. package/src/prover/smt/solver/seq-view-witness.ts +4 -6
  430. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  431. package/src/prover/smt/solver/smt-kernel.ts +9 -5
  432. package/src/prover/smt/solver/smt-logics.ts +0 -1
  433. package/src/prover/smt/solver/smt-setup.ts +86 -20
  434. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  435. package/src/prover/smt/solver/smtlib-parser.ts +1681 -721
  436. package/src/prover/smt/solver/smtlib-script.ts +1273 -793
  437. package/src/prover/smt/solver/solve-eqs.ts +13 -23
  438. package/src/prover/smt/solver/solver.ts +1 -2
  439. package/src/prover/smt/solver/static-features.ts +0 -5
  440. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  441. package/src/prover/smt/solver/tactic.ts +269 -130
  442. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  443. package/src/prover/smt/solver/theory-array.ts +25 -60
  444. package/src/prover/smt/solver/theory-bv.ts +15 -54
  445. package/src/prover/smt/solver/theory-char.ts +0 -1
  446. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  447. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  448. package/src/prover/smt/solver/theory-fpa.ts +46 -79
  449. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  450. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  451. package/src/prover/smt/solver/theory-lra-final-check.ts +1 -2
  452. package/src/prover/smt/solver/theory-lra-internalize.ts +9 -1
  453. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  454. package/src/prover/smt/solver/theory-lra-propagate.ts +6 -5
  455. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  456. package/src/prover/smt/solver/theory-lra.ts +0 -7
  457. package/src/prover/smt/solver/theory-pb.ts +34 -15
  458. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  459. package/src/prover/smt/solver/theory-recfun.ts +2 -3
  460. package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
  461. package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
  462. package/src/prover/smt/solver/theory-seq-state.ts +8 -36
  463. package/src/prover/smt/solver/theory-seq.ts +32 -55
  464. package/src/prover/smt/solver/theory.ts +16 -2
  465. package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
  466. package/src/prover/smt/solver/var-subst.ts +6 -6
  467. package/src/prover/smt/table.ts +3 -2
  468. package/src/prover/tlapm/cache.ts +8 -8
  469. package/src/prover/zenon/decide.ts +9 -13
  470. package/src/prover/zenon/encode.ts +0 -2
  471. package/src/prover/zenon/eqrel.ts +0 -2
  472. package/src/prover/zenon/equality-rules.ts +24 -2
  473. package/src/prover/zenon/expr.ts +21 -2
  474. package/src/prover/zenon/index-table.ts +7 -4
  475. package/src/prover/zenon/isar-case.ts +1 -3
  476. package/src/prover/zenon/isar.ts +2 -4
  477. package/src/prover/zenon/llproof.ts +0 -2
  478. package/src/prover/zenon/mltoll.ts +0 -2
  479. package/src/prover/zenon/node.ts +12 -13
  480. package/src/prover/zenon/parse.ts +0 -2
  481. package/src/prover/zenon/phrase.ts +1 -3
  482. package/src/prover/zenon/proof.ts +0 -2
  483. package/src/prover/zenon/propositional-rules.ts +0 -2
  484. package/src/prover/zenon/rules.ts +2 -3
  485. package/src/prover/zenon/search.ts +0 -2
  486. package/src/prover/zenon/tla/functions.ts +0 -2
  487. package/src/prover/zenon/tla/llproof.ts +0 -2
  488. package/src/prover/zenon/tla/records.ts +0 -2
  489. package/src/prover/zenon/tla/rewrites.ts +0 -2
  490. package/src/prover/zenon/tla/sets.ts +1 -3
  491. package/src/prover/zenon/tla/terms.ts +0 -2
  492. package/src/prover/zenon/tla/tla.ts +0 -2
  493. package/src/resolve.ts +625 -189
  494. package/src/runtime.ts +7 -1
  495. package/src/sany/builtins.ts +10 -10
  496. package/src/sany/generation.ts +2 -13
  497. package/src/sany/generator-definitions.ts +3 -1
  498. package/src/sany/generator-expressions.ts +36 -30
  499. package/src/sany/generator-proofs.ts +5 -3
  500. package/src/sany/generator.ts +2 -1
  501. package/src/sany/levels.ts +0 -2
  502. package/src/sany/lexer.ts +3 -3
  503. package/src/sany/linter.ts +0 -2
  504. package/src/sany/modules.ts +4 -2
  505. package/src/sany/nodes.ts +1 -1
  506. package/src/sany/selectors.ts +11 -6
  507. package/src/sany/xml.ts +2 -3
  508. package/src/search.ts +209 -56
  509. package/src/simulate.ts +3 -0
  510. package/src/spec-description.ts +2 -2
  511. package/src/standard-definitions.ts +4 -0
  512. package/src/state-graph.ts +0 -2
  513. package/src/subexpressions.ts +265 -94
  514. package/src/successors.ts +2 -1
  515. package/src/symmetry.ts +3 -3
  516. package/src/tableau.ts +2 -2
  517. package/src/tlc/fingerprint.ts +81 -9
  518. package/src/tlc/jar-data.ts +10 -0
  519. package/src/tlc/messages.ts +3 -3
  520. package/src/tlc/order.ts +14 -3
  521. package/src/tlc/summary.ts +29 -14
  522. package/src/tlc/tlc-operators.ts +3 -1
  523. package/src/tlc/tlcext-operators.ts +61 -16
  524. package/src/tlc/trace-spec.ts +5 -5
  525. package/src/typed-tier.ts +6541 -0
  526. package/src/typescript/types.ts +2 -2
  527. package/src/values.ts +46 -27
  528. package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
  529. package/src/prover/smt/solver/z3-license.txt +0 -10
  530. package/src/prover/zenon/LICENSE +0 -32
@@ -20,35 +20,32 @@ export const getMd5 = (text: string): string => {
20
20
  const words = Array.from({ length: 16 }, (_value, index) =>
21
21
  view.getUint32(offset + index * 4, true),
22
22
  );
23
- const mixedState = Array.from({ length: 64 }).reduce<number[]>(
24
- ([innerA, innerB, innerC, innerD], _value, index) => {
25
- const round = Math.floor(index / 16);
26
- const mixed =
27
- round === 0
28
- ? (innerB & innerC) | (~innerB & innerD)
29
- : round === 1
30
- ? (innerD & innerB) | (~innerD & innerC)
31
- : round === 2
32
- ? innerB ^ innerC ^ innerD
33
- : innerC ^ (innerB | ~innerD);
34
- const word =
35
- round === 0
36
- ? index
37
- : round === 1
38
- ? (5 * index + 1) % 16
39
- : round === 2
40
- ? (3 * index + 5) % 16
41
- : (7 * index) % 16;
42
- const sum = (innerA + mixed + CONSTANTS[index] + words[word]) | 0;
43
- return [
44
- innerD,
45
- (innerB + rotate(sum, SHIFTS[round * 4 + (index % 4)])) | 0,
46
- innerB,
47
- innerC,
48
- ];
49
- },
50
- state,
51
- );
23
+ const mixedState = Array.from({ length: 64 }).reduce<number[]>((state, _value, index) => {
24
+ const round = Math.floor(index / 16);
25
+ const mixed =
26
+ round === 0
27
+ ? (state[1] & state[2]) | (~state[1] & state[3])
28
+ : round === 1
29
+ ? (state[3] & state[1]) | (~state[3] & state[2])
30
+ : round === 2
31
+ ? state[1] ^ state[2] ^ state[3]
32
+ : state[2] ^ (state[1] | ~state[3]);
33
+ const word =
34
+ round === 0
35
+ ? index
36
+ : round === 1
37
+ ? (5 * index + 1) % 16
38
+ : round === 2
39
+ ? (3 * index + 5) % 16
40
+ : (7 * index) % 16;
41
+ const sum = (state[0] + mixed + CONSTANTS[index] + words[word]) | 0;
42
+ return [
43
+ state[3],
44
+ (state[1] + rotate(sum, SHIFTS[round * 4 + (index % 4)])) | 0,
45
+ state[1],
46
+ state[2],
47
+ ];
48
+ }, state);
52
49
  state.splice(0, 4, ...state.map((word, index) => (word + mixedState[index]) | 0));
53
50
  }
54
51
  return state
@@ -77,17 +77,22 @@ const PROVERS: Record<string, { prover: Prover; seconds: number; isBudgeted?: bo
77
77
  ...Object.fromEntries([...FRONTENDS].map((name) => [name, { prover: name, seconds: 0 }])),
78
78
  };
79
79
 
80
+ const UNTIMED_PROVERS = new Set<Prover>(["cooper", "fail", "trivial", ...FRONTENDS]);
81
+
80
82
  const getProverMethod = (
81
83
  name: string,
82
84
  timeout: number | undefined,
83
85
  rlimit: number | undefined,
84
86
  tactic: string | undefined,
85
87
  ): Method => {
86
- const known = PROVERS[name];
88
+ const known = Object.hasOwn(PROVERS, name) ? PROVERS[name] : undefined;
87
89
  if (!known) throw new TlaProverError(`Unknown prover: ${name}`);
88
90
  return {
89
91
  prover: known.prover,
90
- timeLimitMs: rlimit === undefined ? (timeout ?? known.seconds) * 1000 : Infinity,
92
+ timeLimitMs:
93
+ rlimit !== undefined
94
+ ? Infinity
95
+ : ((UNTIMED_PROVERS.has(known.prover) ? undefined : timeout) ?? known.seconds) * 1000,
91
96
  ...(rlimit !== undefined && { rlimit }),
92
97
  ...(known.prover === "isabelle" && { tactic: tactic ?? "auto" }),
93
98
  };
@@ -96,9 +101,51 @@ const getProverMethod = (
96
101
  const BUDGET_FORMS =
97
102
  'a number of seconds (wall-clock timeout), or a deterministic Z3 rlimit budget of the form "rN" (e.g. "r5")';
98
103
 
104
+ const HEX_FLOAT =
105
+ /^[\t-\r ]*[+-]?0x(?=\.?[\da-f])([\da-f]*)\.?([\da-f]*)(?:p([\t-\r ]*[+-]?\d+))?$/i;
106
+ const DECIMAL_FLOAT = /^[\t-\r ]*[+-]?(?:\d+\.?\d*|\.\d+)(?:e[+-]?\d+)?$/i;
107
+ const SPECIAL_FLOAT = /^[\t-\r ]*[+-]?(?:(inf(?:inity)?)|nan(?:\([^)]*\))?)$/i;
108
+
109
+ // OCaml's float_of_string_opt: caml_float_of_string drops underscores, then reads a C99 float.
110
+ export const parseOcamlFloat = (text: string) => {
111
+ const digits = text.replaceAll("_", "");
112
+ const sign = digits.trimStart().startsWith("-") ? -1 : 1;
113
+ const hex = HEX_FLOAT.exec(digits);
114
+ if (hex) {
115
+ const mantissa = Number(BigInt(`0x${hex[1]}${hex[2]}`));
116
+ return mantissa === 0 ? 0 : sign * mantissa * 2 ** (Number(hex[3] ?? 0) - 4 * hex[2].length);
117
+ }
118
+ const special = SPECIAL_FLOAT.exec(digits);
119
+ if (special) return special[1] === undefined ? NaN : sign * Infinity;
120
+ return DECIMAL_FLOAT.test(digits) ? Number(digits) : undefined;
121
+ };
122
+
123
+ const OCAML_INT =
124
+ /^([+-]?)(?:0x([\da-f][\da-f_]*)|0o([0-7][0-7_]*)|0b([01][01_]*)|(0u)?(\d[\d_]*))$/i;
125
+
126
+ // OCaml's int_of_string_opt: only an unprefixed decimal is range-checked as a signed 63-bit integer.
127
+ export const parseOcamlInt = (text: string) => {
128
+ const match = OCAML_INT.exec(text);
129
+ if (!match) return undefined;
130
+ const isNegative = match[1] === "-";
131
+ const prefixed =
132
+ match[2] === undefined
133
+ ? match[3] === undefined
134
+ ? match[4] === undefined
135
+ ? match[6]
136
+ : `0b${match[4]}`
137
+ : `0o${match[3]}`
138
+ : `0x${match[2]}`;
139
+ const magnitude = BigInt(prefixed.replaceAll("_", ""));
140
+ const isSigned = prefixed === match[6] && match[5] === undefined;
141
+ if (magnitude > (isSigned ? 2n ** 62n - (isNegative ? 0n : 1n) : 2n ** 63n - 1n))
142
+ return undefined;
143
+ return Number(BigInt.asIntN(63, isNegative ? -magnitude : magnitude));
144
+ };
145
+
99
146
  const getRlimit = (budget: string, locus: Locus | undefined) => {
100
- const count = Number(budget.slice(1));
101
- if (!/^[rR]./.test(budget) || !Number.isFinite(count) || count <= 0)
147
+ const count = parseOcamlFloat(budget.slice(1));
148
+ if (!/^[rR]./s.test(budget) || count === undefined || !Number.isFinite(count) || count <= 0)
102
149
  throw new TlaMethodError(
103
150
  `Invalid SMT budget ${JSON.stringify(budget)}: expected ${BUDGET_FORMS}.`,
104
151
  locus,
@@ -169,7 +216,7 @@ const computeMethod = (settings: PragmaSetting[], args: Expr[], use: Locus | und
169
216
  if (values.args.length > 0) throw new TlaMethodError("Too many arguments", use);
170
217
  if (values.prover === undefined)
171
218
  throw new TlaMethodError("Missing prover name", settings[0].location);
172
- const known = PROVERS[values.prover];
219
+ const known = Object.hasOwn(PROVERS, values.prover) ? PROVERS[values.prover] : undefined;
173
220
  if (!known) throw new TlaMethodError(`Unknown prover: ${values.prover}`, values.proverLocus);
174
221
  if (values.rlimit !== undefined && !known.isBudgeted)
175
222
  throw new TlaMethodError(
@@ -268,7 +315,9 @@ export const parseDefaultMethods = (text: string) =>
268
315
  if (name === "auto" || name === "blast" || name === "force")
269
316
  return getProverMethod("isabelle", seconds, undefined, name);
270
317
  if (name === "fail") return { prover: "fail", timeLimitMs: Infinity };
271
- const known = DEFAULT_METHOD_NAMES[name];
318
+ const known = Object.hasOwn(DEFAULT_METHOD_NAMES, name)
319
+ ? DEFAULT_METHOD_NAMES[name]
320
+ : undefined;
272
321
  if (known === undefined)
273
322
  throw new TlaProverError(`--method: unknown method ${JSON.stringify(name)}`);
274
323
  return getProverMethod(known, seconds, undefined, undefined);
@@ -201,8 +201,11 @@ const expandEnabledCdot = (
201
201
  throw new TlaProverError("ENABLEDaxioms depends on assumptions of level > 1 \n\n");
202
202
  return implicationToEnabled(sequent, locus, onWarning);
203
203
  }
204
+ // An obligation has no proof step to label and no instance to expand.
204
205
  const anonymizer = createAnonymizer(
205
- { value: 0 },
206
+ () => {
207
+ throw new TlapmBugError();
208
+ },
206
209
  () => {
207
210
  throw new TlapmBugError();
208
211
  },
@@ -85,14 +85,10 @@ export type ProofAttempt =
85
85
  errorOutput?: string;
86
86
  }
87
87
  | { kind: "error"; method: Method }
88
- | {
89
- kind: "failed";
90
- method: Method;
91
- reason?: string;
92
- note?: string;
93
- warning?: string;
94
- shipped?: string;
95
- }
88
+ // A frontend whose soundness check failed, or a backend whose encoding failed.
89
+ | { kind: "refused" | "unencoded"; method: Method; reason: string }
90
+ // Cooper's method, which tlapm warns it no longer has.
91
+ | { kind: "unavailable"; method: Method; warning: string; shipped: string }
96
92
  | { kind: "skipped"; method: Method; reason: string }
97
93
  | {
98
94
  kind: "stored" | "reused";
@@ -292,6 +288,8 @@ export const getFailureReason = (attempt: ProofAttempt) => {
292
288
  : "false";
293
289
  case "error":
294
290
  return "false";
291
+ case "unavailable":
292
+ return undefined;
295
293
  default:
296
294
  return attempt.reason;
297
295
  }
@@ -315,6 +313,7 @@ export const encodeProofTheory = (
315
313
  name: string,
316
314
  reports: ProofReport[],
317
315
  obligations: PrintedObligation[],
316
+ isFlattened: boolean,
318
317
  ) =>
319
318
  encodeIsabelleTheory(
320
319
  name,
@@ -324,7 +323,7 @@ export const encodeProofTheory = (
324
323
  ? [
325
324
  {
326
325
  id: report.obligation.id,
327
- sequent: shipFirstOrder(normalizeExpand(obligations[index])),
326
+ sequent: shipFirstOrder(normalizeExpand(obligations[index]), isFlattened),
328
327
  proof: attempt.proof,
329
328
  },
330
329
  ]
@@ -404,13 +403,13 @@ const proveWithBackends = async (
404
403
  const prior = run.results.get(fingerprint)?.get(method.prover);
405
404
  return prior?.method.tactic === method.tactic ? prior : undefined;
406
405
  };
407
- const reuse = (prior: ProofAttempt) =>
406
+ const reuse = (prior: ProofAttempt, shipped = "shipped" in prior ? prior.shipped : undefined) =>
408
407
  attempts.push({
409
408
  kind: "reused",
410
409
  method: prior.method,
411
410
  isProved: isProvedAttempt(prior),
412
411
  reason: getFailureReason(prior),
413
- shipped: "shipped" in prior ? prior.shipped : undefined,
412
+ shipped,
414
413
  });
415
414
  const record = (attempt: ProofAttempt) => {
416
415
  attempts.push(attempt);
@@ -440,11 +439,31 @@ const proveWithBackends = async (
440
439
  const prover = FAILING_FRONTENDS.find((name) => methods.frontends.has(name));
441
440
  if (prover === undefined) throw expanded;
442
441
  record({
443
- kind: "failed",
442
+ kind: "refused",
444
443
  method: { prover, timeLimitMs: Infinity },
445
444
  reason: expanded.message,
446
- note: `${expanded.message}\nObligation:\n\n`,
447
445
  });
446
+ // Prep.ship goes on with the obligation normalize_expand left, whose goal is FALSE: it checks
447
+ // that for triviality, then each method still answers from the fingerprints file. A stored
448
+ // failure prints that obligation when ExpandENABLED is cited.
449
+ const falsified: Sequent = {
450
+ ...normalizeSequent(expandDefs(obligation.sequent)),
451
+ active: { kind: "Internal", builtin: "FALSE" },
452
+ };
453
+ if (obligation.kind.kind === "Support" && isTrivial(falsified))
454
+ return { obligation: { ...getObligationBase(obligation), status: "trivial" }, attempts };
455
+ for (const method of methods.provers) {
456
+ const prior = method === methods.provers[0] ? firstPrior : getPrior(method);
457
+ if (prior && isProvedAttempt(prior)) {
458
+ reuse(prior);
459
+ return getProvedReport(method.prover);
460
+ }
461
+ if (prior && getBudget(prior.method) >= getBudget(method))
462
+ reuse(
463
+ prior,
464
+ methods.frontends.has("expandenabled") ? `${formatObligation(falsified)}\n` : undefined,
465
+ );
466
+ }
448
467
  return getUnprovedReport(
449
468
  obligation,
450
469
  "failed",
@@ -482,10 +501,9 @@ const proveWithBackends = async (
482
501
  if (method.prover === "cooper") {
483
502
  const warning = "Cooper's method is not available any more.\n";
484
503
  record({
485
- kind: "failed",
504
+ kind: "unavailable",
486
505
  method,
487
506
  warning,
488
- note: `\n\\* ${warning}\n`,
489
507
  shipped: `${formatObligation(shipFirstOrder(sequent, run.settings.isFlattened))}\n`,
490
508
  });
491
509
  failures.push({ reason: warning.trim(), isDecided: true });
@@ -504,27 +522,35 @@ const proveWithBackends = async (
504
522
  const name = getTemporaryName();
505
523
  const file = `${name}${encoder.suffix}`;
506
524
  const chunks: string[] = [];
525
+ const encodingError = (() => {
526
+ try {
527
+ encoder.encode({
528
+ obligation,
529
+ sequent,
530
+ fingerprint,
531
+ method,
532
+ session,
533
+ name,
534
+ settings: run.settings,
535
+ write: (text) => chunks.push(text),
536
+ });
537
+ return undefined;
538
+ } catch (error: unknown) {
539
+ return error;
540
+ }
541
+ })();
542
+ const text = chunks.join("");
507
543
  // A failed encoding leaves the file as far as it got.
508
- try {
509
- encoder.encode({
510
- obligation,
511
- sequent,
512
- fingerprint,
513
- method,
514
- session,
515
- name,
516
- settings: run.settings,
517
- write: (text) => chunks.push(text),
544
+ run.settings.onInput?.(file, text);
545
+ if (encodingError instanceof TlaProverError) {
546
+ record({ kind: "unencoded", method, reason: encodingError.message });
547
+ failures.push({
548
+ reason: `${method.prover} failed: ${encodingError.message}`,
549
+ isDecided: true,
518
550
  });
519
- } catch (error) {
520
- if (!(error instanceof TlaProverError)) throw error;
521
- record({ kind: "failed", method, reason: error.message });
522
- failures.push({ reason: `${method.prover} failed: ${error.message}`, isDecided: true });
523
551
  continue;
524
- } finally {
525
- run.settings.onInput?.(file, chunks.join(""));
526
552
  }
527
- const text = chunks.join("");
553
+ if (encodingError !== undefined) throw encodingError;
528
554
  const timeLimitMs = Math.max(method.timeLimitMs, BACKEND_WAIT_MS);
529
555
  const decision =
530
556
  method.prover === "smt" && run.settings.solveSmt
@@ -1,4 +1,3 @@
1
- import { TlaSyntaxError } from "../../errors";
2
1
  import type { DecideOptions, Verdict } from "../verdict";
3
2
  import { getSatisfiability, type BinaryKind, type PtlFormula } from "./tableau";
4
3
 
@@ -39,90 +38,71 @@ const RESERVED = /^(skolem|hidden|constant|NV_V\w*|NVV\w*)$/;
39
38
 
40
39
  const MAX_LS4_IDENTIFIER = 31;
41
40
 
42
- const parseLs4 = (text: string): PtlFormula => {
41
+ // ptl_to_trp and LS4 reach no verdict on text that this reads as undefined.
42
+ const parseLs4 = (text: string): PtlFormula | undefined => {
43
43
  const tokens = text.replace(/;.*/g, "").match(/<=>|<->|=>|->|[A-Za-z]\w*|\S/g) ?? [];
44
44
  let position = 0;
45
- const reject = (reason: string): never => {
46
- throw new TlaSyntaxError(`LS4 reaches no verdict: ${reason}`);
47
- };
48
- const peek = () => tokens[position] ?? "";
49
- const take = (expected?: string) => {
50
- const token = tokens[position++];
51
- if (token === undefined || (expected !== undefined && token !== expected))
52
- return reject(`expected ${expected ?? "a formula"}, found ${token ?? "the end"}`);
53
- return token;
54
- };
55
- const checkIdentifier = (token: string) => {
56
- if (!/^[A-Za-z]/.test(token) || KEYWORDS.has(token))
57
- reject(`expected an identifier, found ${token}`);
58
- if (RESERVED.test(token)) reject(`${token} is reserved`);
59
- return token;
60
- };
61
- const takeIdentifier = () => checkIdentifier(take());
45
+ const isIdentifier = (token: string | undefined): token is string =>
46
+ token !== undefined && /^[A-Za-z]/.test(token) && !KEYWORDS.has(token) && !RESERVED.test(token);
62
47
  const takeList = () => {
63
- const items = [takeIdentifier()];
64
- while (peek() === ",") {
65
- take();
66
- items.push(takeIdentifier());
48
+ const items: string[] = [];
49
+ for (;;) {
50
+ const token = tokens[position++];
51
+ if (!isIdentifier(token)) return undefined;
52
+ items.push(token);
53
+ if (tokens[position] !== ",") return items;
54
+ position += 1;
67
55
  }
68
- return items;
69
56
  };
70
- const parsePrefix = (): PtlFormula => {
71
- const token = take();
57
+ const parsePrefix = (): PtlFormula | undefined => {
58
+ const token = tokens[position++];
59
+ if (token === undefined) return undefined;
72
60
  const prefix = PREFIX_OPERATORS.get(token);
73
61
  if (prefix !== undefined) {
74
62
  const body = parsePrefix();
75
- return prefix === "Past"
76
- ? reject(`ptl_to_trp does not translate ${token}`)
77
- : { kind: prefix, body };
63
+ // ptl_to_trp does not translate the past operators.
64
+ return body === undefined || prefix === "Past" ? undefined : { kind: prefix, body };
78
65
  }
79
66
  if (token === "!" || token === "?") {
80
- take("[");
81
- // foyacc.mly checks only that the last variable of the list is uppercase.
67
+ if (tokens[position++] !== "[") return undefined;
82
68
  const variables = takeList();
83
- if (!/^[A-Z]/.test(variables[variables.length - 1]))
84
- reject(`${variables[variables.length - 1]} is not uppercase`);
85
- take("]");
86
- return parsePrefix();
69
+ // foyacc.mly checks only that the last variable of the list is uppercase.
70
+ return variables !== undefined &&
71
+ /^[A-Z]/.test(variables[variables.length - 1]) &&
72
+ tokens[position++] === "]"
73
+ ? parsePrefix()
74
+ : undefined;
87
75
  }
88
76
  if (token === "(") {
89
77
  const inner = parseBinary(0);
90
- take(")");
91
- return inner;
78
+ return tokens[position++] === ")" ? inner : undefined;
92
79
  }
93
80
  if (token === "True" || token === "False") return { kind: "Constant", value: token === "True" };
94
- const name = checkIdentifier(token);
95
- if (peek() === "(") {
96
- take();
97
- takeList();
98
- take(")");
99
- reject(`LS4 does not read the predicate ${name} with arguments`);
100
- }
101
- if (name.length > MAX_LS4_IDENTIFIER) reject(`the identifier ${name} is too long`);
102
- return { kind: "Atom", name };
81
+ // LS4 reads no predicate with arguments and no identifier longer than 31 characters.
82
+ return isIdentifier(token) && tokens[position] !== "(" && token.length <= MAX_LS4_IDENTIFIER
83
+ ? { kind: "Atom", name: token }
84
+ : undefined;
103
85
  };
104
- const parseOperators = (level: number, left: PtlFormula): PtlFormula => {
105
- const kind = BINARY_LEVELS[level].get(peek());
106
- if (kind === undefined) return left;
107
- take();
108
- return parseOperators(level, { kind, left, right: parseBinary(level + 1) });
86
+ const parseOperators = (level: number, left: PtlFormula | undefined): PtlFormula | undefined => {
87
+ const kind = BINARY_LEVELS[level].get(tokens[position] ?? "");
88
+ if (left === undefined || kind === undefined) return left;
89
+ position += 1;
90
+ const right = parseBinary(level + 1);
91
+ return right === undefined ? undefined : parseOperators(level, { kind, left, right });
109
92
  };
110
- const parseBinary = (level: number): PtlFormula =>
93
+ const parseBinary = (level: number): PtlFormula | undefined =>
111
94
  level === BINARY_LEVELS.length ? parsePrefix() : parseOperators(level, parseBinary(level + 1));
112
95
  const formula = parseBinary(0);
113
- if (position < tokens.length) reject(`expected the end, found ${peek()}`);
114
- return formula;
96
+ return position < tokens.length ? undefined : formula;
115
97
  };
116
98
 
117
99
  export const decidePtl = (text: string, options: DecideOptions): Verdict => {
118
100
  const deadline = performance.now() + options.timeLimitMs;
119
- try {
120
- return getSatisfiability(
121
- parseLs4(text),
122
- () => options.signal?.aborted === true || performance.now() > deadline,
123
- );
124
- } catch (error) {
125
- if (error instanceof TlaSyntaxError) return "unknown";
126
- throw error;
127
- }
101
+ const formula = parseLs4(text);
102
+ return formula === undefined
103
+ ? "unknown"
104
+ : getSatisfiability(
105
+ formula,
106
+ () => options.signal?.aborted === true || performance.now() > deadline,
107
+ );
128
108
  };
@@ -73,6 +73,14 @@ export const createPrinter = (declared: Map<string, Identifier>) => {
73
73
  const renames = new Map<string, string[]>();
74
74
  const scopes: QuantifierScope[] = [];
75
75
  const lets = new Map<number, LetScope>();
76
+ const bindName = (index: number, scope: QuantifierScope) => {
77
+ const raw = tokens[index][0];
78
+ const identifier = context.adjoin(raw.replace(/(:\w+)?#\d+$/, ""));
79
+ const stack = renames.get(raw) ?? [];
80
+ renames.set(raw, [...stack, identifier.name]);
81
+ scope.exits.push(context.enter(identifier), () => renames.set(raw, stack));
82
+ replacements.set(index, identifier.name);
83
+ };
76
84
  let position = 0;
77
85
  let depth = 0;
78
86
  while (position < tokens.length) {
@@ -91,12 +99,7 @@ export const createPrinter = (declared: Map<string, Identifier>) => {
91
99
  scopes.push(scope);
92
100
  position += 3;
93
101
  while (tokens[position]?.[0] === "(") {
94
- const raw = tokens[position + 1][0];
95
- const identifier = context.adjoin(raw.replace(/(:\w+)?#\d+$/, ""));
96
- const stack = renames.get(raw) ?? [];
97
- renames.set(raw, [...stack, identifier.name]);
98
- scope.exits.push(context.enter(identifier), () => renames.set(raw, stack));
99
- replacements.set(position + 1, identifier.name);
102
+ bindName(position + 1, scope);
100
103
  position += 4;
101
104
  }
102
105
  position++;
@@ -118,14 +121,7 @@ export const createPrinter = (declared: Map<string, Identifier>) => {
118
121
  const letScope = lets.get(position);
119
122
  if (letScope !== undefined) {
120
123
  const scope: QuantifierScope = { depth: letScope.depth, exits: [] };
121
- letScope.names.toReversed().forEach((index) => {
122
- const raw = tokens[index][0];
123
- const identifier = context.adjoin(raw.replace(/(:\w+)?#\d+$/, ""));
124
- const stack = renames.get(raw) ?? [];
125
- renames.set(raw, [...stack, identifier.name]);
126
- scope.exits.push(context.enter(identifier), () => renames.set(raw, stack));
127
- replacements.set(index, identifier.name);
128
- });
124
+ letScope.names.toReversed().forEach((index) => bindName(index, scope));
129
125
  scopes.push(scope);
130
126
  }
131
127
  position++;