tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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 (538) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +58 -54
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  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 +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +336 -88
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
@@ -1,9 +1,8 @@
1
- // Ported from Z3 (src/math/polynomial/algebraic_numbers.cpp, src/util/basic_interval.h,
2
- // src/util/mpbq.cpp, src/util/index_sort_with_mutations.h), MIT license, see z3-license.txt.
3
- import { SmtInvariantError } from "../../../../errors";
1
+ import { SmtCanceledError, SmtInvariantError } from "../../../../errors";
4
2
  import { Rational } from "../rational";
3
+ import type { ResourceLimit } from "../rlimit";
5
4
  import { getLog2, Mpbq } from "./mpbq";
6
- import { PolynomialManager, type Polynomial, type ValueOps } from "./polynomial";
5
+ import { PolynomialManager, type Polynomial, PolynomialRef, type ValueOps } from "./polynomial";
7
6
  import { UpolynomialManager, type Upolynomial } from "./upolynomial";
8
7
  import { factorUpolynomial, type FactorParams } from "./upolynomial-factorization";
9
8
 
@@ -169,6 +168,37 @@ const getExtended = (values: readonly (Anum | undefined)[], variable: number, an
169
168
  return extended;
170
169
  };
171
170
 
171
+ const getSmt2Numeral = (value: bigint) => (value < 0n ? `(- ${-value})` : `${value}`);
172
+
173
+ const getSmt2Monomial = (coeff: bigint, degree: number) => {
174
+ if (degree === 0) return getSmt2Numeral(coeff);
175
+ const power = degree === 1 ? "x" : `(^ x ${degree})`;
176
+ return coeff === 1n ? power : `(* ${getSmt2Numeral(coeff)} ${power})`;
177
+ };
178
+
179
+ const getUpolynomialSmt2 = (p: Upolynomial) => {
180
+ if (p.length === 0) return "0";
181
+ const nonzero = p.flatMap((coeff, degree) => (coeff === 0n ? [] : [degree]));
182
+ if (nonzero.length === 1) return getSmt2Monomial(p[nonzero[0]], nonzero[0]);
183
+ return `(+ ${nonzero
184
+ .reverse()
185
+ .map((degree) => getSmt2Monomial(p[degree], degree))
186
+ .join(" ")})`;
187
+ };
188
+
189
+ const getRationalDecimal = (value: Rational, precision: number) => {
190
+ const magnitude = value.num < 0n ? -value.num : value.num;
191
+ const sign = value.num < 0n ? "-" : "";
192
+ let remainder = magnitude % value.den;
193
+ if (remainder === 0n) return `${sign}${magnitude / value.den}`;
194
+ const digits: string[] = [];
195
+ for (let index = 0; index < precision && remainder !== 0n; index++) {
196
+ digits.push(`${(remainder * 10n) / value.den}`);
197
+ remainder = (remainder * 10n) % value.den;
198
+ }
199
+ return `${sign}${magnitude / value.den}.${digits.join("")}${remainder === 0n ? "" : "?"}`;
200
+ };
201
+
172
202
  const hasSameCoeffs = (first: Upolynomial, second: Upolynomial) =>
173
203
  first.length === second.length && first.every((coeff, index) => coeff === second[index]);
174
204
 
@@ -195,8 +225,8 @@ export const mergeSortIndices = (
195
225
  };
196
226
 
197
227
  export class AlgebraicManager {
198
- private um = new UpolynomialManager();
199
- private pm = new PolynomialManager();
228
+ private um: UpolynomialManager;
229
+ private pm: PolynomialManager;
200
230
  private anumOps: ValueOps<Anum> = {
201
231
  fromInteger: (value) => new Anum(Rational.of(value)),
202
232
  add: (first, second) => this.add(first, second),
@@ -204,6 +234,11 @@ export class AlgebraicManager {
204
234
  power: (base, exponent) => this.power(base, exponent),
205
235
  };
206
236
 
237
+ constructor(private limit: ResourceLimit) {
238
+ this.um = new UpolynomialManager(limit);
239
+ this.pm = new PolynomialManager(limit);
240
+ }
241
+
207
242
  isZero(anum: Anum) {
208
243
  return anum.value instanceof Rational && anum.value.isZero();
209
244
  }
@@ -213,6 +248,16 @@ export class AlgebraicManager {
213
248
  return anum.value instanceof Rational ? 1 : anum.value.p.length - 1;
214
249
  }
215
250
 
251
+ isNeg(anum: Anum) {
252
+ return anum.value instanceof Rational ? anum.value.isNegative() : !anum.value.upper.isPos;
253
+ }
254
+
255
+ toRational(anum: Anum) {
256
+ if (!this.isRational(anum) || !(anum.value instanceof Rational))
257
+ throw new SmtInvariantError("expected a rational algebraic number");
258
+ return anum.value;
259
+ }
260
+
216
261
  copy(anum: Anum) {
217
262
  return new Anum(anum.value instanceof Rational ? anum.value : anum.value.clone());
218
263
  }
@@ -347,7 +392,7 @@ export class AlgebraicManager {
347
392
  return factorUpolynomial(this.um, p, FACTOR_PARAMS);
348
393
  }
349
394
 
350
- private isolateUnivariateRoots(coeffs: Upolynomial) {
395
+ isolateUnivariateRoots(coeffs: Upolynomial) {
351
396
  const roots: Anum[] = [];
352
397
  if (coeffs.length === 0) return roots;
353
398
  const hasZeroRoot = this.um.hasZeroRoots(coeffs);
@@ -382,7 +427,7 @@ export class AlgebraicManager {
382
427
  }
383
428
 
384
429
  private sortRoots(roots: Anum[]) {
385
- if (roots.length < 2) return;
430
+ if (!this.limit.inc() || roots.length < 2) return;
386
431
  const sorted = mergeSortIndices(
387
432
  roots.length,
388
433
  (first, second) => this.compare(roots[first], roots[second]) < 0,
@@ -419,6 +464,7 @@ export class AlgebraicManager {
419
464
  let highVariations = isNonPositive ? atZero : this.um.signVariationsAtPlusInf(sequence);
420
465
  let target = isNonPositive ? rootIndex : rootIndex - nonPositiveCount;
421
466
  while (lowVariations > highVariations + 1) {
467
+ this.limit.checkpoint();
422
468
  const middle = low.add(high).div2();
423
469
  const middleVariations = this.um.signVariationsAt(sequence, middle);
424
470
  const leftCount = lowVariations - middleVariations;
@@ -489,29 +535,43 @@ export class AlgebraicManager {
489
535
  ): Anum[] {
490
536
  if (pm.isConst(polynomial)) return [];
491
537
  if (pm.isUnivariate(polynomial)) return this.isolateUnivariateRoots(pm.toCoeffs(polynomial));
492
- const reduced = pm.substituteRational(polynomial, getRationalValues(values));
493
- if (pm.isConst(reduced)) return [];
494
- if (pm.isUnivariate(reduced)) {
495
- if (values[pm.maxVar(reduced)] !== undefined) return [];
496
- return this.isolateUnivariateRoots(pm.toCoeffs(reduced));
497
- }
498
- const xs = this.sortByDegree(pm.getVars(reduced), values);
499
- const x = xs[xs.length - 1];
500
- if (values[x] !== undefined) return [];
501
- let q = reduced;
502
- for (const y of xs.slice(0, -1)) {
503
- q = pm.resultant(q, pm.fromCoeffs(getCell(values[y]).p, y), y);
504
- if (q.size === 0) break;
505
- }
506
- if (q.size > 0) {
507
- if (pm.isConst(q)) return [];
508
- return this.isolateUnivariateRoots(pm.toCoeffs(q)).filter(
509
- (root) => this.evalSignAt(pm, reduced, getExtended(values, x, root)) === 0,
510
- );
538
+ const pPrime = new PolynomialRef(pm);
539
+ const q = new PolynomialRef(pm);
540
+ const pY = new PolynomialRef(pm);
541
+ try {
542
+ pPrime.set(pm.substituteRational(polynomial, getRationalValues(values)));
543
+ const reduced = pPrime.get();
544
+ if (pm.isConst(reduced)) return [];
545
+ if (pm.isUnivariate(reduced)) {
546
+ if (values[pm.maxVar(reduced)] !== undefined) return [];
547
+ return this.isolateUnivariateRoots(pm.toCoeffs(reduced));
548
+ }
549
+ const xs = this.sortByDegree(pm.getVars(reduced), values);
550
+ const x = xs[xs.length - 1];
551
+ if (values[x] !== undefined) return [];
552
+ q.copy(pPrime);
553
+ for (let index = 0; index + 1 < xs.length; index++) {
554
+ this.limit.checkpoint();
555
+ const y = xs[index];
556
+ pY.set(pm.toPolynomial(getCell(values[y]).p, y));
557
+ pm.resultant(q.get(), pY.get(), y, q);
558
+ if (pm.isZero(q.get())) {
559
+ if (isNested)
560
+ throw new SmtInvariantError("resultant vanished during nested isolate_roots call");
561
+ break;
562
+ }
563
+ }
564
+ if (pm.isZero(q.get())) return this.isolateVanishedRoots(pm, reduced, values, xs, x);
565
+ if (pm.isConst(q.get())) return [];
566
+ return this.isolateUnivariateRoots(pm.toCoeffs(q.get())).filter((root) => {
567
+ this.limit.checkpoint();
568
+ return this.evalSignAt(pm, reduced, getExtended(values, x, root)) === 0;
569
+ });
570
+ } finally {
571
+ pY.reset();
572
+ q.reset();
573
+ pPrime.reset();
511
574
  }
512
- if (isNested)
513
- throw new SmtInvariantError("resultant vanished during nested isolate_roots call");
514
- return this.isolateVanishedRoots(pm, reduced, values, xs, x);
515
575
  }
516
576
 
517
577
  private isolateVanishedRoots(
@@ -525,26 +585,50 @@ export class AlgebraicManager {
525
585
  pm.evaluateWith(polynomial, this.anumOps, (variable) => getAssigned(values, variable));
526
586
  const degree = pm.degree(reduced, x);
527
587
  if (degree === 1) {
528
- const constant = evaluate(pm.coeff(reduced, x, 0));
529
- const leading = evaluate(pm.coeff(reduced, x, 1));
588
+ const c0 = new PolynomialRef(pm);
589
+ const c1 = new PolynomialRef(pm);
590
+ c0.set(pm.coeff(reduced, x, 0));
591
+ c1.set(pm.coeff(reduced, x, 1));
592
+ const constant = evaluate(c0.get());
593
+ const leading = evaluate(c1.get());
594
+ c1.reset();
595
+ c0.reset();
530
596
  if (this.isZero(leading)) return [];
531
597
  const root = this.div(constant, leading);
532
598
  this.neg(root);
533
599
  return [root];
534
600
  }
601
+ const c = new PolynomialRef(pm);
535
602
  let power = degree;
536
603
  let leading = new Anum(Rational.zero);
537
604
  for (; power >= 1; power--) {
538
- leading = evaluate(pm.coeff(reduced, x, power));
605
+ c.set(pm.coeff(reduced, x, power));
606
+ leading = evaluate(c.get());
539
607
  if (!this.isZero(leading)) break;
540
608
  }
541
- if (power === 0) return [];
609
+ if (power === 0) {
610
+ c.reset();
611
+ return [];
612
+ }
542
613
  const z = Math.max(...xs) + 1;
543
- const q = this.pm.add(
544
- this.pm.mul(this.pm.mkVar(z), this.pm.mkVar(x, power)),
545
- this.convert(pm, reduced, x, power - 1),
546
- );
547
- return this.isolateRoots(this.pm, q, getExtended(values, z, leading), true);
614
+ const q2 = new PolynomialRef(this.pm);
615
+ const zP = new PolynomialRef(this.pm);
616
+ const xiP = new PolynomialRef(this.pm);
617
+ const product = new PolynomialRef(this.pm);
618
+ q2.set(this.convert(pm, reduced, x, power - 1));
619
+ xiP.set(this.pm.mkVar(x, power));
620
+ zP.set(this.pm.mkVar(z));
621
+ product.set(this.pm.mul(zP.get(), xiP.get()));
622
+ q2.set(this.pm.add(product.get(), q2.get()));
623
+ product.reset();
624
+ try {
625
+ return this.isolateRoots(this.pm, q2.get(), getExtended(values, z, leading), true);
626
+ } finally {
627
+ xiP.reset();
628
+ zP.reset();
629
+ q2.reset();
630
+ c.reset();
631
+ }
548
632
  }
549
633
 
550
634
  private convert(pm: PolynomialManager, polynomial: Polynomial, x = -1, maxDegree = Infinity) {
@@ -578,13 +662,20 @@ export class AlgebraicManager {
578
662
  if (pm.isConst(polynomial)) return result;
579
663
  if (pm.isUnivariate(polynomial))
580
664
  return this.isolateRootsClosestUnivariate(pm, polynomial, sample);
581
- const reduced = pm.substituteRational(polynomial, getRationalValues(values));
582
- if (pm.isConst(reduced)) return result;
583
- if (pm.isUnivariate(reduced)) {
584
- if (values[pm.maxVar(reduced)] !== undefined) return result;
585
- return this.isolateRootsClosestUnivariate(pm, reduced, sample);
665
+ const pPrime = new PolynomialRef(pm);
666
+ let all: Anum[];
667
+ try {
668
+ pPrime.set(pm.substituteRational(polynomial, getRationalValues(values)));
669
+ const reduced = pPrime.get();
670
+ if (pm.isConst(reduced)) return result;
671
+ if (pm.isUnivariate(reduced)) {
672
+ if (values[pm.maxVar(reduced)] !== undefined) return result;
673
+ return this.isolateRootsClosestUnivariate(pm, reduced, sample);
674
+ }
675
+ all = this.isolateRoots(pm, polynomial, values);
676
+ } finally {
677
+ pPrime.reset();
586
678
  }
587
- const all = this.isolateRoots(pm, polynomial, values);
588
679
  const sampleAnum = new Anum(sample);
589
680
  let lower = -1;
590
681
  let upper = -1;
@@ -632,37 +723,47 @@ export class AlgebraicManager {
632
723
  evalSignAt(pm: PolynomialManager, polynomial: Polynomial, values: readonly (Anum | undefined)[]) {
633
724
  while (true) {
634
725
  const rationalValues = getRationalValues(values);
635
- if (pm.getVars(polynomial).every((variable) => rationalValues[variable] !== undefined))
636
- return pm.getSign(polynomial, rationalValues);
637
- const reduced = pm.substituteRational(polynomial, rationalValues);
638
- if (reduced.size === 0) return 0;
639
- if (pm.isConst(reduced)) return reduced.as[0] > 0n ? 1 : -1;
640
- const xs = pm.getVars(reduced);
641
- const getInterval = (variable: number) => {
642
- const cell = getCell(values[variable]);
643
- return { lower: cell.lower, upper: cell.upper };
644
- };
645
- const evaluate = () => pm.evaluateWith(reduced, INTERVAL_OPS, getInterval);
646
- let interval = evaluate();
647
- let isRestarted = false;
648
- while (true) {
649
- if (!containsZero(interval)) return interval.lower.isNeg ? -1 : 1;
650
- let isRefined = false;
651
- for (const variable of xs) {
652
- const value = getAssigned(values, variable);
653
- if (this.getCellMagnitude(getCell(value)) <= MIN_MAGNITUDE) continue;
654
- if (!this.refine(value)) {
655
- isRestarted = true;
656
- break;
726
+ const rationalSign = pm.getRationalSign(polynomial, rationalValues);
727
+ if (rationalSign !== null) return rationalSign;
728
+ const pPrime = new PolynomialRef(pm);
729
+ try {
730
+ pPrime.set(pm.substituteRational(polynomial, rationalValues));
731
+ const reduced = pPrime.get();
732
+ if (reduced.size === 0) return 0;
733
+ if (pm.isConst(reduced)) return reduced.as[0] > 0n ? 1 : -1;
734
+ const xs = pm.getVars(reduced);
735
+ const getInterval = (variable: number) => {
736
+ const cell = getCell(values[variable]);
737
+ return { lower: cell.lower, upper: cell.upper };
738
+ };
739
+ const evaluate = () => pm.evaluateWith(reduced, INTERVAL_OPS, getInterval);
740
+ let interval: BqInterval;
741
+ let isRestarted = false;
742
+ while (true) {
743
+ this.limit.checkpoint();
744
+ interval = evaluate();
745
+ if (!containsZero(interval)) return interval.lower.isNeg ? -1 : 1;
746
+ let isRefined = false;
747
+ for (const variable of xs) {
748
+ const value = getAssigned(values, variable);
749
+ if (this.getCellMagnitude(getCell(value)) <= MIN_MAGNITUDE) continue;
750
+ if (!this.refine(value)) {
751
+ isRestarted = true;
752
+ break;
753
+ }
754
+ isRefined = true;
657
755
  }
658
- isRefined = true;
756
+ if (!isRefined || isRestarted) break;
757
+ }
758
+ if (isRestarted) {
759
+ this.limit.checkpoint();
760
+ continue;
659
761
  }
660
- if (!isRefined || isRestarted) break;
661
- interval = evaluate();
762
+ const sign = this.evalSignByResultant(pm, reduced, values, xs, interval, evaluate);
763
+ if (sign !== null) return sign;
764
+ } finally {
765
+ pPrime.reset();
662
766
  }
663
- if (isRestarted) continue;
664
- const sign = this.evalSignByResultant(pm, reduced, values, xs, interval, evaluate);
665
- if (sign !== null) return sign;
666
767
  }
667
768
  }
668
769
 
@@ -675,14 +776,23 @@ export class AlgebraicManager {
675
776
  evaluate: () => BqInterval,
676
777
  ) {
677
778
  const sorted = this.sortByDegree(xs, values);
678
- let resultant = this.pm.sub(this.pm.mkVar(Math.max(...xs) + 1), this.convert(pm, reduced));
679
- for (const variable of sorted)
680
- resultant = this.pm.resultant(
681
- resultant,
682
- this.pm.fromCoeffs(getCell(values[variable]).p, variable),
683
- variable,
684
- );
685
- const k = this.um.nonzeroRootLowerBound(this.pm.toCoeffs(resultant));
779
+ const yp = new PolynomialRef(this.pm);
780
+ const pPrimeAux = new PolynomialRef(this.pm);
781
+ const r = new PolynomialRef(this.pm);
782
+ const qi = new PolynomialRef(this.pm);
783
+ yp.set(this.pm.mkVar(Math.max(...xs) + 1));
784
+ pPrimeAux.set(this.convert(pm, reduced));
785
+ r.set(this.pm.sub(yp.get(), pPrimeAux.get()));
786
+ for (const variable of sorted) {
787
+ this.limit.checkpoint();
788
+ qi.set(this.pm.toPolynomial(getCell(values[variable]).p, variable));
789
+ this.pm.resultant(r.get(), qi.get(), variable, r);
790
+ }
791
+ const k = this.um.nonzeroRootLowerBound(this.pm.toCoeffs(r.get()));
792
+ qi.reset();
793
+ r.reset();
794
+ pPrimeAux.reset();
795
+ yp.reset();
686
796
  const bound = Mpbq.of(1n, k);
687
797
  const isInsideBound = (interval: BqInterval) =>
688
798
  bound.neg().compare(interval.lower) < 0 && interval.upper.compare(bound) < 0;
@@ -690,6 +800,7 @@ export class AlgebraicManager {
690
800
  const saved = sorted.map((variable) => this.saveInterval(getAssigned(values, variable)));
691
801
  let sign: number | null = null;
692
802
  while (sign === null) {
803
+ this.limit.checkpoint();
693
804
  const interval = evaluate();
694
805
  if (!containsZero(interval)) sign = interval.lower.isNeg ? -1 : 1;
695
806
  else if (isInsideBound(interval)) sign = 0;
@@ -827,14 +938,118 @@ export class AlgebraicManager {
827
938
  return this.mkPower(anum, exponent);
828
939
  }
829
940
 
941
+ root(anum: Anum, k: number): Anum {
942
+ if (k === 0) throw new SmtInvariantError("0-th root is indeterminate");
943
+ if (k === 1 || this.isZero(anum)) return this.copy(anum);
944
+ if (this.isNeg(anum) && k % 2 === 0)
945
+ throw new SmtInvariantError("even root of negative number is not real");
946
+ if (anum.value instanceof Rational) return this.rootRational(anum.value, k);
947
+ return this.mkRoot(anum, k);
948
+ }
949
+
950
+ private rootRational(value: Rational, k: number) {
951
+ const exact = value.root(k);
952
+ if (exact !== undefined) return new Anum(exact);
953
+ const p = [-value.num, ...Array.from({ length: k - 1 }, () => 0n), value.den];
954
+ const converted = Mpbq.fromRational(value);
955
+ const bound = converted.isExact ? converted.value : converted.value.mul2k(1);
956
+ return value.isNegative()
957
+ ? this.mkAnum(p, bound.sub(Mpbq.one), Mpbq.zero, false)
958
+ : this.mkAnum(p, Mpbq.zero, bound.add(Mpbq.one), false);
959
+ }
960
+
961
+ // Res_y(x^k - y, p(y)) has a^(1/k) as a root.
962
+ private mkRoot(anum: Anum, k: number): Anum {
963
+ const cell = getCell(anum);
964
+ const factored = this.factor(this.getResultantCoeffs(this.getVarDifference(k, 1), cell.p));
965
+ const factors = factored.factors.factors;
966
+ const sequences: (Upolynomial[] | null)[] = factors.map((factor) => this.um.sturmSeq(factor));
967
+ const saved = this.saveInterval(anum);
968
+ while (true) {
969
+ this.limit.checkpoint();
970
+ const interval = { lower: cell.lower.rootLower(k), upper: cell.upper.rootUpper(k) };
971
+ const found = this.findIsolatingFactor(factors, sequences, interval);
972
+ if (found !== null) {
973
+ this.restoreIfTooSmall(saved);
974
+ return this.setCore(found, interval, factored.isComplete);
975
+ }
976
+ if (!this.refine(anum)) {
977
+ this.restoreIfTooSmall(saved);
978
+ return this.root(anum, k);
979
+ }
980
+ }
981
+ }
982
+
983
+ getPolynomial(anum: Anum) {
984
+ return anum.value instanceof Rational ? [-anum.value.num, anum.value.den] : [...anum.value.p];
985
+ }
986
+
987
+ getIsolatingInterval(anum: Anum): [Rational, Rational] {
988
+ if (anum.value instanceof Rational) return [anum.value, anum.value];
989
+ return [anum.value.lower.toRational(), anum.value.upper.toRational()];
990
+ }
991
+
992
+ getInterval(anum: Anum, precision: number): [Rational, Rational] {
993
+ if (anum.value instanceof Rational) return [anum.value, anum.value];
994
+ const cell = anum.value;
995
+ const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
996
+ return [refined.lower.toRational(), refined.upper.toRational()];
997
+ }
998
+
999
+ displayRootSmt2(anum: Anum) {
1000
+ if (this.isZero(anum)) return "(root-obj x 1)";
1001
+ if (anum.value instanceof Rational)
1002
+ return `(root-obj ${getUpolynomialSmt2([-anum.value.num, anum.value.den])} 1)`;
1003
+ return `(root-obj ${getUpolynomialSmt2(anum.value.p)} ${this.getRootIndex(anum)})`;
1004
+ }
1005
+
1006
+ displayDecimal(anum: Anum, precision: number) {
1007
+ if (anum.value instanceof Rational) return getRationalDecimal(anum.value, precision);
1008
+ const cell = anum.value;
1009
+ const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
1010
+ return (refined.isInterval ? refined.upper : refined.lower).toDecimal(precision);
1011
+ }
1012
+
1013
+ private getResultantCoeffs(first: PolynomialRef, p: Upolynomial) {
1014
+ const q = new PolynomialRef(this.pm);
1015
+ const r = new PolynomialRef(this.pm);
1016
+ q.set(this.pm.toPolynomial(p, Y));
1017
+ this.pm.resultant(first.get(), q.get(), Y, r);
1018
+ const coeffs = this.pm.toCoeffs(r.get());
1019
+ r.reset();
1020
+ q.reset();
1021
+ first.reset();
1022
+ return coeffs;
1023
+ }
1024
+
1025
+ private getVarDifference(xDegree: number, yDegree: number) {
1026
+ const x = new PolynomialRef(this.pm);
1027
+ const y = new PolynomialRef(this.pm);
1028
+ const difference = new PolynomialRef(this.pm);
1029
+ x.set(this.pm.mkVar(X, xDegree));
1030
+ y.set(this.pm.mkVar(Y, yDegree));
1031
+ difference.set(this.pm.sub(x.get(), y.get()));
1032
+ y.reset();
1033
+ x.reset();
1034
+ return difference;
1035
+ }
1036
+
830
1037
  private getSumPolynomial(first: AlgebraicCell, second: AlgebraicCell) {
831
- const composed = this.pm.composeXMinusY(this.pm.fromCoeffs(first.p, X), Y);
832
- return this.pm.toCoeffs(this.pm.resultant(composed, this.pm.fromCoeffs(second.p, Y), Y));
1038
+ const p = new PolynomialRef(this.pm);
1039
+ const composed = new PolynomialRef(this.pm);
1040
+ p.set(this.pm.toPolynomial(first.p, X));
1041
+ this.pm.composeXMinusY(p.get(), Y, composed);
1042
+ p.reset();
1043
+ return this.getResultantCoeffs(composed, second.p);
833
1044
  }
834
1045
 
835
1046
  private getProductPolynomial(first: AlgebraicCell, second: AlgebraicCell) {
836
- const composed = this.pm.composeXDivY(this.pm.fromCoeffs(first.p, X), Y);
837
- return this.pm.toCoeffs(this.pm.resultant(composed, this.pm.fromCoeffs(second.p, Y), Y));
1047
+ const p = new PolynomialRef(this.pm);
1048
+ const composed = new PolynomialRef(this.pm);
1049
+ p.set(this.pm.toPolynomial(first.p, X));
1050
+ composed.set(this.pm.composeXDivY(p.get(), Y));
1051
+ p.reset();
1052
+ return this.getResultantCoeffs(composed, second.p);
838
1053
  }
839
1054
 
840
1055
  private findIsolatingFactor(
@@ -877,6 +1092,7 @@ export class AlgebraicManager {
877
1092
  const savedA = this.saveInterval(first);
878
1093
  const savedB = this.saveInterval(second);
879
1094
  while (true) {
1095
+ this.limit.checkpoint();
880
1096
  const interval = isAdd ? INTERVAL_OPS.add(cellA, cellB) : INTERVAL_OPS.mul(cellA, cellB);
881
1097
  const found = this.findIsolatingFactor(factors, sequences, interval);
882
1098
  if (found !== null) {
@@ -896,8 +1112,7 @@ export class AlgebraicManager {
896
1112
  }
897
1113
 
898
1114
  private getPowerPolynomial(cell: AlgebraicCell, exponent: number) {
899
- const x = this.pm.sub(this.pm.mkVar(X), this.pm.mkVar(Y, exponent));
900
- return this.pm.toCoeffs(this.pm.resultant(x, this.pm.fromCoeffs(cell.p, Y), Y));
1115
+ return this.getResultantCoeffs(this.getVarDifference(1, exponent), cell.p);
901
1116
  }
902
1117
 
903
1118
  private mkPower(anum: Anum, exponent: number): Anum {
@@ -907,6 +1122,7 @@ export class AlgebraicManager {
907
1122
  const sequences: (Upolynomial[] | null)[] = factors.map((factor) => this.um.sturmSeq(factor));
908
1123
  const saved = this.saveInterval(anum);
909
1124
  while (true) {
1125
+ this.limit.checkpoint();
910
1126
  const interval = getIntervalPower(cell, exponent);
911
1127
  const found = this.findIsolatingFactor(factors, sequences, interval);
912
1128
  if (found !== null) {
@@ -961,12 +1177,13 @@ export class AlgebraicManager {
961
1177
  if (sign !== 0) return sign;
962
1178
  if (hasSameCoeffs(cellA.p, cellB.p)) return 0;
963
1179
  if (cellA.isMinimal && cellB.isMinimal)
964
- while (true) {
1180
+ while (this.limit.inc()) {
965
1181
  this.refine(first);
966
1182
  this.refine(second);
967
1183
  sign = compareIntervals();
968
1184
  if (sign !== 0) return sign;
969
1185
  }
1186
+ if (!this.limit.inc()) throw new SmtCanceledError();
970
1187
  const magnitudeA = this.getCellMagnitude(cellA);
971
1188
  const magnitudeB = this.getCellMagnitude(cellB);
972
1189
  const target = Math.max(MIN_MAGNITUDE, Math.min(magnitudeA, magnitudeB));