tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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 (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  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 +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  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 +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -1,7 +1,3 @@
1
- // Ported from Z3 (src/nlsat/levelwise.cpp, src/nlsat/nlsat_common.cpp), MIT license, see
2
- // z3-license.txt.
3
- // Deviation from Z3: ties between polynomials break by creation-order id, where Z3 recycles ids of
4
- // freed polynomials (id_gen in polynomial.cpp), so a cell bound can be another polynomial with the same root.
5
1
  import { NlsatUnsupportedError } from "../../../../errors";
6
2
  import { Rational } from "../rational";
7
3
  import { type AlgebraicManager, type Anum, mergeSortIndices } from "./algebraic";
@@ -10,14 +6,26 @@ import {
10
6
  type Polynomial,
11
7
  type PolynomialCache,
12
8
  type PolynomialManager,
9
+ PolynomialRef,
10
+ PolynomialRefVector,
13
11
  } from "./polynomial";
14
12
 
15
- interface CellInterval {
16
- isSection: boolean;
17
- lower: Polynomial | null;
18
- lowerIndex: number;
19
- upper: Polynomial | null;
20
- upperIndex: number;
13
+ export class CellInterval {
14
+ isSection = false;
15
+ readonly lower: PolynomialRef;
16
+ lowerIndex = 0;
17
+ readonly upper: PolynomialRef;
18
+ upperIndex = 0;
19
+
20
+ constructor(pm: PolynomialManager) {
21
+ this.lower = new PolynomialRef(pm);
22
+ this.upper = new PolynomialRef(pm);
23
+ }
24
+
25
+ release() {
26
+ this.upper.reset();
27
+ this.lower.reset();
28
+ }
21
29
  }
22
30
 
23
31
  interface RootFunction {
@@ -33,103 +41,119 @@ const UNSET = -1;
33
41
  const BOTH_SIDES = 3;
34
42
  const SPANNING_TREE_THRESHOLD = 4;
35
43
 
44
+ export const releaseIntervals = (intervals: readonly CellInterval[]) => {
45
+ for (let index = intervals.length; index-- > 0;) intervals[index].release();
46
+ };
47
+
36
48
  export class TodoSet {
37
- polynomials: Polynomial[] = [];
38
- private inSet = new Set<number>();
49
+ readonly set: PolynomialRefVector;
50
+ private inSet: boolean[] = [];
39
51
 
40
52
  constructor(
41
- private pm: PolynomialManager,
42
53
  private cache: PolynomialCache,
43
- ) {}
54
+ private isCanonicalizing: boolean,
55
+ ) {
56
+ this.set = new PolynomialRefVector(cache.pm);
57
+ }
44
58
 
45
59
  get isEmpty() {
46
- return this.polynomials.length === 0;
60
+ return this.set.size === 0;
47
61
  }
48
62
 
49
63
  reset() {
50
- this.polynomials = [];
51
- this.inSet.clear();
64
+ for (const polynomial of this.set.items) this.inSet[polynomial.id] = false;
65
+ this.set.reset();
52
66
  }
53
67
 
54
68
  insert(polynomial: Polynomial) {
55
- if (this.inSet.has(polynomial.id)) return polynomial;
69
+ const pm = this.cache.pm;
70
+ if (this.inSet[polynomial.id] === true) return polynomial;
56
71
  if (this.cache.contains(polynomial)) {
57
- this.inSet.add(polynomial.id);
58
- this.polynomials.push(polynomial);
72
+ this.inSet[polynomial.id] = true;
73
+ this.set.push(polynomial);
59
74
  return polynomial;
60
75
  }
61
- const primitive =
62
- this.pm.isZero(polynomial) || this.pm.isConst(polynomial)
63
- ? polynomial
64
- : this.pm.pp(polynomial, this.pm.maxVar(polynomial));
65
- const unique = this.cache.mkUnique(this.pm.flipSignIfLmNeg(primitive));
66
- if (!this.inSet.has(unique.id)) {
67
- this.inSet.add(unique.id);
68
- this.polynomials.push(unique);
76
+ const pinned = new PolynomialRef(pm);
77
+ let p = polynomial;
78
+ if (this.isCanonicalizing) {
79
+ if (!pm.isZero(p) && !pm.isConst(p)) {
80
+ pinned.move(pm.pp(p, pm.maxVar(p)));
81
+ p = pinned.get();
82
+ } else pinned.set(p);
83
+ p = pm.flipSignIfLmNeg(p);
84
+ pinned.set(p);
85
+ }
86
+ p = this.cache.mkUnique(p);
87
+ if (this.inSet[p.id] !== true) {
88
+ this.inSet[p.id] = true;
89
+ this.set.push(p);
69
90
  }
70
- return unique;
91
+ pinned.reset();
92
+ return p;
71
93
  }
72
94
 
73
95
  getMaxVar() {
74
- let result = NULL_VAR;
75
- for (const polynomial of this.polynomials) {
76
- const variable = this.pm.maxVar(polynomial);
77
- if (result === NULL_VAR || variable > result) result = variable;
78
- }
79
- return result;
96
+ return this.cache.pm.getMaxVarOfPolys(this.set.items);
80
97
  }
81
98
 
82
- extractMaxPolys(out: Polynomial[]) {
83
- out.length = 0;
99
+ extractMaxPolys(out: PolynomialRefVector) {
100
+ out.reset();
84
101
  const variable = this.getMaxVar();
85
102
  this.extractPolysAtLevel(variable, out);
86
103
  return variable;
87
104
  }
88
105
 
89
- extractPolysAtLevel(variable: number, out: Polynomial[]) {
90
- const kept: Polynomial[] = [];
91
- for (const polynomial of this.polynomials) {
92
- if (this.pm.maxVar(polynomial) !== variable) {
93
- kept.push(polynomial);
94
- continue;
95
- }
96
- out.push(polynomial);
97
- this.inSet.delete(polynomial.id);
106
+ extractPolysAtLevel(variable: number, out: PolynomialRefVector) {
107
+ const pm = this.cache.pm;
108
+ let kept = 0;
109
+ for (let index = 0; index < this.set.size; index++) {
110
+ const polynomial = this.set.get(index);
111
+ if (pm.maxVar(polynomial) === variable) {
112
+ out.push(polynomial);
113
+ this.inSet[polynomial.id] = false;
114
+ } else this.set.set(kept++, polynomial);
98
115
  }
99
- this.polynomials = kept;
116
+ this.set.shrink(kept);
100
117
  }
101
118
  }
102
119
 
103
- class Levelwise {
104
- private intervals: CellInterval[];
105
- private todo: TodoSet;
120
+ export class Levelwise {
121
+ readonly intervals: CellInterval[] = [];
106
122
  private level = 0;
107
- private levelPolys: Polynomial[] = [];
108
- private witnesses: (Polynomial | null)[] = [];
109
- private hasRoots: boolean[] = [];
110
- private rootFunctions: RootFunction[] = [];
111
- private pairs = new Map<string, [number, number]>();
112
- private sideMask: number[] = [];
113
- private isLcOmitted: boolean[] = [];
114
123
  private lowerRf = UNSET;
115
124
  private upperRf = UNSET;
125
+ private todo: TodoSet;
126
+ private levelPs: PolynomialRefVector;
127
+ private witnesses: PolynomialRef[] = [];
128
+ private polyHasRoots: boolean[] = [];
129
+ private pscTmp: PolynomialRefVector;
130
+ private sideMask: number[] = [];
131
+ private isLcOmitted: boolean[] = [];
132
+ private degInOrderGraph: number[] = [];
133
+ private rootFunctions: RootFunction[] = [];
134
+ private pairs = new Map<string, [number, number]>();
116
135
 
117
136
  constructor(
118
137
  private pm: PolynomialManager,
119
138
  private am: AlgebraicManager,
120
139
  private cache: PolynomialCache,
121
- private sample: readonly (Anum | undefined)[],
140
+ private polynomials: PolynomialRefVector,
122
141
  private maxVar: number,
142
+ private sample: readonly (Anum | undefined)[],
123
143
  private isLinear: boolean,
124
144
  ) {
125
- this.todo = new TodoSet(pm, cache);
126
- this.intervals = Array.from({ length: maxVar }, () => ({
127
- isSection: false,
128
- lower: null,
129
- lowerIndex: 0,
130
- upper: null,
131
- upperIndex: 0,
132
- }));
145
+ this.todo = new TodoSet(cache, true);
146
+ this.levelPs = new PolynomialRefVector(pm);
147
+ this.pscTmp = new PolynomialRefVector(pm);
148
+ for (let index = 0; index < maxVar; index++) this.intervals.push(new CellInterval(pm));
149
+ }
150
+
151
+ release() {
152
+ this.pscTmp.reset();
153
+ this.clearWitnesses();
154
+ this.levelPs.reset();
155
+ this.todo.set.reset();
156
+ releaseIntervals(this.intervals);
133
157
  }
134
158
 
135
159
  private getSign(polynomial: Polynomial) {
@@ -140,93 +164,200 @@ class Levelwise {
140
164
  return this.sample.map((value, index) => (index === variable ? undefined : value));
141
165
  }
142
166
 
143
- private requestFactorized(polynomial: Polynomial | null) {
144
- if (polynomial === null || this.pm.isConst(polynomial)) return;
145
- for (const factor of this.cache.factor(polynomial))
146
- if (!this.pm.isConst(factor)) this.todo.insert(factor);
147
- }
148
-
149
- private getFirstPsc(first: Polynomial, second: Polynomial, variable: number) {
150
- for (const element of this.cache.pscChain(first, second, variable)) {
151
- if (this.pm.isZero(element)) continue;
152
- return this.pm.isConst(element) ? null : element;
153
- }
154
- return null;
155
- }
156
-
157
- private getPscDiscriminant(polynomial: Polynomial, variable: number) {
158
- if (this.pm.isConst(polynomial) || this.pm.degree(polynomial, variable) < 2) return null;
159
- return this.getFirstPsc(polynomial, this.pm.derivative(polynomial, variable), variable);
160
- }
161
-
162
- private handleNullifiedPoly(polynomial: Polynomial) {
163
- const degree = this.pm.degree(polynomial, this.level);
164
- for (let power = 0; power <= degree; power++)
165
- this.requestFactorized(this.pm.coeff(polynomial, this.level, power));
166
- let current = [{ polynomial, minVar: 0 }];
167
- while (current.length > 0) {
168
- const next: { polynomial: Polynomial; minVar: number }[] = [];
169
- for (const entry of current) {
170
- const maxVar = this.pm.maxVar(entry.polynomial);
171
- if (maxVar === NULL_VAR) continue;
172
- for (let variable = entry.minVar; variable <= maxVar; variable++) {
173
- if (this.pm.degree(entry.polynomial, variable) === 0) continue;
174
- const derivative = this.pm.derivative(entry.polynomial, variable);
175
- if (this.pm.isConst(derivative)) continue;
176
- if (this.getSign(derivative) !== 0) {
177
- this.requestFactorized(derivative);
167
+ private clearWitnesses() {
168
+ for (let index = this.witnesses.length; index-- > 0;) this.witnesses[index].reset();
169
+ this.witnesses = [];
170
+ }
171
+
172
+ private handleNullifiedPoly(p: Polynomial) {
173
+ const pm = this.pm;
174
+ const degree = pm.degree(p, this.level);
175
+ for (let power = 0; power <= degree; power++) {
176
+ const coeff = new PolynomialRef(pm);
177
+ coeff.set(pm.coeff(p, this.level, power));
178
+ if (!pm.isZero(coeff.get()) && !pm.isConst(coeff.get())) this.requestFactorized(coeff.get());
179
+ coeff.reset();
180
+ }
181
+ let curPolys = new PolynomialRefVector(pm);
182
+ let curMinVar: number[] = [];
183
+ curPolys.push(p);
184
+ curMinVar.push(0);
185
+ while (curPolys.size > 0) {
186
+ const nextPolys = new PolynomialRefVector(pm);
187
+ const nextMinVar: number[] = [];
188
+ for (let index = 0; index < curPolys.size; index++) {
189
+ const q = new PolynomialRef(pm);
190
+ q.set(curPolys.get(index));
191
+ const maxVar = pm.maxVar(q.get());
192
+ if (maxVar === NULL_VAR) {
193
+ q.reset();
194
+ continue;
195
+ }
196
+ for (let x = curMinVar[index]; x <= maxVar; x++) {
197
+ if (pm.degree(q.get(), x) === 0) continue;
198
+ const dq = new PolynomialRef(pm);
199
+ dq.set(pm.derivative(q.get(), x));
200
+ if (pm.isZero(dq.get()) || pm.isConst(dq.get())) {
201
+ dq.reset();
202
+ continue;
203
+ }
204
+ if (this.getSign(dq.get()) !== 0) {
205
+ this.requestFactorized(dq.get());
206
+ dq.reset();
207
+ q.reset();
208
+ nextPolys.reset();
209
+ curPolys.reset();
178
210
  return;
179
211
  }
180
- next.push({ polynomial: derivative, minVar: variable });
212
+ nextPolys.push(dq.get());
213
+ nextMinVar.push(x);
214
+ dq.reset();
181
215
  }
216
+ q.reset();
217
+ }
218
+ for (let index = 0; index < nextPolys.size; index++) {
219
+ const dq = new PolynomialRef(pm);
220
+ dq.set(nextPolys.get(index));
221
+ this.requestFactorized(dq.get());
222
+ dq.reset();
223
+ }
224
+ curPolys.reset();
225
+ curPolys = nextPolys;
226
+ curMinVar = nextMinVar;
227
+ }
228
+ }
229
+
230
+ private resetInterval(interval: CellInterval) {
231
+ interval.isSection = false;
232
+ interval.lower.reset();
233
+ interval.upper.reset();
234
+ interval.lowerIndex = 0;
235
+ interval.upperIndex = 0;
236
+ }
237
+
238
+ private getFirstPsc(chain: PolynomialRefVector) {
239
+ const r = new PolynomialRef(this.pm);
240
+ for (let index = 0; index < chain.size; index++) {
241
+ r.set(chain.get(index));
242
+ if (this.pm.isZero(r.get())) continue;
243
+ if (this.pm.isConst(r.get())) {
244
+ r.reset();
245
+ return r;
182
246
  }
183
- for (const entry of next) this.requestFactorized(entry.polynomial);
184
- current = next;
247
+ return r;
248
+ }
249
+ r.reset();
250
+ return r;
251
+ }
252
+
253
+ private pscDiscriminant(pIn: Polynomial, x: number) {
254
+ const pm = this.pm;
255
+ if (pm.isZero(pIn) || pm.isConst(pIn) || pm.degree(pIn, x) < 2) return new PolynomialRef(pm);
256
+ const p = new PolynomialRef(pm);
257
+ p.set(pIn);
258
+ const d = new PolynomialRef(pm);
259
+ d.set(pm.derivative(p.get(), x));
260
+ const chain = this.pscTmp;
261
+ chain.reset();
262
+ this.cache.pscChain(p.get(), d.get(), x, chain);
263
+ const disc = this.getFirstPsc(chain);
264
+ d.reset();
265
+ p.reset();
266
+ return disc;
267
+ }
268
+
269
+ private pscResultant(a: Polynomial, b: Polynomial, x: number) {
270
+ const pa = new PolynomialRef(this.pm);
271
+ pa.set(a);
272
+ const pb = new PolynomialRef(this.pm);
273
+ pb.set(b);
274
+ const chain = this.pscTmp;
275
+ chain.reset();
276
+ this.cache.pscChain(pa.get(), pb.get(), x, chain);
277
+ const r = this.getFirstPsc(chain);
278
+ pb.reset();
279
+ pa.reset();
280
+ return r;
281
+ }
282
+
283
+ private requestFactorized(polynomial: Polynomial | null) {
284
+ const pm = this.pm;
285
+ if (polynomial === null || pm.isZero(polynomial) || pm.isConst(polynomial)) return;
286
+ const factors = new PolynomialRefVector(pm);
287
+ this.cache.factor(polynomial, factors);
288
+ for (let index = 0; index < factors.size; index++) {
289
+ const f = new PolynomialRef(pm);
290
+ f.set(factors.get(index));
291
+ if (!pm.isZero(f.get()) && !pm.isConst(f.get())) this.todo.insert(f.get());
292
+ f.reset();
185
293
  }
294
+ factors.reset();
186
295
  }
187
296
 
188
- private chooseNonzeroCoeff(polynomial: Polynomial, variable: number) {
189
- const degree = this.pm.degree(polynomial, variable);
297
+ private chooseNonzeroCoeff(p: Polynomial, x: number) {
298
+ const pm = this.pm;
299
+ const degree = pm.degree(p, x);
300
+ const coeff = new PolynomialRef(pm);
190
301
  for (let power = 0; power <= degree; power++) {
191
- const coeff = this.pm.coeff(polynomial, variable, power);
192
- if (!this.pm.isZero(coeff) && this.pm.isConst(coeff)) return coeff;
302
+ coeff.set(pm.coeff(p, x, power));
303
+ if (pm.isZero(coeff.get())) continue;
304
+ if (pm.isConst(coeff.get())) return coeff;
193
305
  }
194
- let best: Polynomial | null = null;
306
+ const best = new PolynomialRef(pm);
307
+ let bestTotalDegree = 0;
308
+ let bestSize = 0;
309
+ let bestMaxVar = NULL_VAR;
195
310
  for (let power = 0; power <= degree; power++) {
196
- const coeff = this.pm.coeff(polynomial, variable, power);
197
- if (this.pm.isZero(coeff) || this.getSign(coeff) === 0) continue;
198
- const totalDegree = this.pm.totalDegree(coeff);
199
- const bestDegree = best === null ? 0 : this.pm.totalDegree(best);
311
+ coeff.set(pm.coeff(p, x, power));
312
+ const current = coeff.get();
313
+ if (pm.isZero(current) || this.getSign(current) === 0) continue;
314
+ const totalDegree = pm.totalDegree(current);
315
+ const size = current.size;
316
+ const maxVar = pm.maxVar(current);
200
317
  if (
201
- best === null ||
202
- totalDegree < bestDegree ||
203
- (totalDegree === bestDegree &&
204
- (coeff.size < best.size ||
205
- (coeff.size === best.size && this.pm.maxVar(coeff) < this.pm.maxVar(best))))
206
- )
207
- best = coeff;
318
+ best.getOrNull() === null ||
319
+ totalDegree < bestTotalDegree ||
320
+ (totalDegree === bestTotalDegree &&
321
+ (size < bestSize ||
322
+ (size === bestSize && (bestMaxVar === NULL_VAR || maxVar < bestMaxVar))))
323
+ ) {
324
+ best.copy(coeff);
325
+ bestTotalDegree = totalDegree;
326
+ bestSize = size;
327
+ bestMaxVar = maxVar;
328
+ }
208
329
  }
330
+ coeff.reset();
209
331
  return best;
210
332
  }
211
333
 
212
334
  private addProjectionForPoly(
213
- polynomial: Polynomial,
214
- variable: number,
215
- witness: Polynomial | null,
335
+ p: Polynomial,
336
+ x: number,
337
+ nonzeroCoeff: Polynomial | null,
216
338
  isLcAdded: boolean,
339
+ isDiscAdded: boolean,
217
340
  ) {
218
- let isWitnessAdded = witness !== null && !this.pm.isConst(witness);
341
+ const pm = this.pm;
342
+ let isNonzeroCoeffAdded = nonzeroCoeff !== null && !pm.isConst(nonzeroCoeff);
219
343
  if (isLcAdded) {
220
- const leadingCoeff = this.pm.lc(polynomial, variable);
221
- this.requestFactorized(leadingCoeff);
222
- if (isWitnessAdded && this.getSign(leadingCoeff) !== 0) isWitnessAdded = false;
344
+ const lc = new PolynomialRef(pm);
345
+ lc.set(pm.coeff(p, x, pm.degree(p, x)));
346
+ this.requestFactorized(lc.get());
347
+ if (isNonzeroCoeffAdded && this.getSign(lc.get()) !== 0) isNonzeroCoeffAdded = false;
348
+ lc.reset();
223
349
  }
224
- const discriminant = this.getPscDiscriminant(polynomial, variable);
225
- if (discriminant !== null) {
226
- this.requestFactorized(discriminant);
227
- if (isWitnessAdded && this.getSign(discriminant) !== 0) isWitnessAdded = false;
350
+ if (isDiscAdded) {
351
+ const disc = new PolynomialRef(pm);
352
+ disc.move(this.pscDiscriminant(p, x));
353
+ const value = disc.getOrNull();
354
+ if (value !== null) {
355
+ this.requestFactorized(value);
356
+ if (isNonzeroCoeffAdded && this.getSign(value) !== 0) isNonzeroCoeffAdded = false;
357
+ }
358
+ disc.reset();
228
359
  }
229
- if (isWitnessAdded) this.requestFactorized(witness);
360
+ if (isNonzeroCoeffAdded) this.requestFactorized(nonzeroCoeff);
230
361
  }
231
362
 
232
363
  private addPair(first: number, second: number) {
@@ -248,7 +379,7 @@ class Levelwise {
248
379
 
249
380
  private computeSideMask() {
250
381
  if (this.lowerRf === UNSET) return;
251
- while (this.sideMask.length < this.levelPolys.length) this.sideMask.push(0);
382
+ while (this.sideMask.length < this.levelPs.size) this.sideMask.push(0);
252
383
  this.rootFunctions.forEach((rootFunction, index) => {
253
384
  this.sideMask[rootFunction.psIndex] |= index <= this.lowerRf ? 1 : 2;
254
385
  });
@@ -258,20 +389,24 @@ class Levelwise {
258
389
  return rootFunctionIndex === UNSET ? UNSET : this.rootFunctions[rootFunctionIndex].psIndex;
259
390
  }
260
391
 
392
+ private computeResultantGraphDegree() {
393
+ this.degInOrderGraph = Array.from({ length: this.levelPs.size }, () => 0);
394
+ for (const pair of this.pairs.values()) {
395
+ this.degInOrderGraph[pair[0]]++;
396
+ this.degInOrderGraph[pair[1]]++;
397
+ }
398
+ }
399
+
261
400
  private computeOmitLcBothSides(isLeafRequired: boolean) {
262
- this.isLcOmitted = this.levelPolys.map(() => false);
401
+ this.isLcOmitted = Array.from({ length: this.levelPs.size }, () => false);
263
402
  if (this.rootFunctions.length === 0 || this.pairs.size === 0 || this.sideMask.length === 0)
264
403
  return;
265
- const degrees = this.levelPolys.map(() => 0);
266
- for (const pair of this.pairs.values()) {
267
- degrees[pair[0]]++;
268
- degrees[pair[1]]++;
269
- }
404
+ if (isLeafRequired) this.computeResultantGraphDegree();
270
405
  const lowerBound = this.getBoundIndex(this.lowerRf);
271
406
  const upperBound = this.getBoundIndex(this.upperRf);
272
- for (let index = 0; index < this.levelPolys.length; index++) {
407
+ for (let index = 0; index < this.levelPs.size; index++) {
273
408
  if (this.sideMask[index] !== BOTH_SIDES) continue;
274
- if (isLeafRequired && degrees[index] !== 1) continue;
409
+ if (isLeafRequired && this.degInOrderGraph[index] !== 1) continue;
275
410
  if (index === lowerBound || index === upperBound) continue;
276
411
  this.isLcOmitted[index] = true;
277
412
  }
@@ -287,26 +422,24 @@ class Levelwise {
287
422
  }
288
423
 
289
424
  private fillRelationSection() {
425
+ if (this.rootFunctions.length === 0) return;
290
426
  for (let index = 0; index < this.lowerRf; index++) this.addPair(index, this.lowerRf);
291
427
  for (let index = this.lowerRf + 1; index < this.rootFunctions.length; index++)
292
428
  this.addPair(this.lowerRf, index);
293
429
  }
294
430
 
295
431
  private buildBothSideSpanningTree() {
296
- const lowerRfs = this.levelPolys.map(() => UNSET);
297
- const upperRfs = this.levelPolys.map(() => UNSET);
432
+ const lowerRfs = Array.from({ length: this.levelPs.size }, () => UNSET);
433
+ const upperRfs = Array.from({ length: this.levelPs.size }, () => UNSET);
298
434
  for (let index = 0; index <= this.lowerRf; index++)
299
435
  lowerRfs[this.rootFunctions[index].psIndex] = index;
300
436
  for (let index = this.upperRf; index < this.rootFunctions.length; index++)
301
437
  upperRfs[this.rootFunctions[index].psIndex] = index;
302
- const both = this.levelPolys
303
- .map((_polynomial, psIndex) => ({
304
- psIndex,
305
- lowerRf: lowerRfs[psIndex],
306
- upperRf: upperRfs[psIndex],
307
- }))
308
- .filter((info) => this.sideMask[info.psIndex] === BOTH_SIDES)
309
- .sort((first, second) => first.lowerRf - second.lowerRf);
438
+ const both: { psIndex: number; lowerRf: number; upperRf: number }[] = [];
439
+ for (let psIndex = 0; psIndex < this.levelPs.size; psIndex++)
440
+ if (this.sideMask[psIndex] === BOTH_SIDES)
441
+ both.push({ psIndex, lowerRf: lowerRfs[psIndex], upperRf: upperRfs[psIndex] });
442
+ both.sort((first, second) => first.lowerRf - second.lowerRf);
310
443
  for (let first = 0; first < both.length - 1; first++) {
311
444
  let closest = first + 1;
312
445
  for (let index = first + 2; index < both.length; index++)
@@ -337,21 +470,21 @@ class Levelwise {
337
470
  }
338
471
 
339
472
  private isolateRootsAroundSample(
473
+ p: Polynomial,
340
474
  psIndex: number,
341
475
  value: Anum,
342
476
  lower: RootFunction[],
343
477
  upper: RootFunction[],
344
478
  ) {
345
- const polynomial = this.levelPolys[psIndex];
346
479
  const values = this.getValuesWithout(this.level);
347
480
  const mkRootFunction = (root: Anum, index: number) => ({
348
481
  value: this.am.copy(root),
349
- polynomial,
482
+ polynomial: p,
350
483
  index,
351
484
  psIndex,
352
485
  });
353
486
  if (value.value instanceof Rational) {
354
- const closest = this.am.isolateRootsClosest(this.pm, polynomial, values, value.value);
487
+ const closest = this.am.isolateRootsClosest(this.pm, p, values, value.value);
355
488
  closest.roots.forEach((root, index) => {
356
489
  (this.am.compare(root, value) <= 0 ? lower : upper).push(
357
490
  mkRootFunction(root, closest.indices[index]),
@@ -359,7 +492,7 @@ class Levelwise {
359
492
  });
360
493
  return closest.roots.length > 0;
361
494
  }
362
- const roots = this.am.isolateRoots(this.pm, polynomial, values);
495
+ const roots = this.am.isolateRoots(this.pm, p, values);
363
496
  let lowerIndex = UNSET;
364
497
  let upperIndex = UNSET;
365
498
  let isSection = false;
@@ -406,95 +539,115 @@ class Levelwise {
406
539
  if (middle === 0) {
407
540
  this.lowerRf = UNSET;
408
541
  this.upperRf = 0;
409
- interval.upper = rootFunctions[0].polynomial;
542
+ interval.upper.set(rootFunctions[0].polynomial);
410
543
  interval.upperIndex = rootFunctions[0].index;
411
544
  return;
412
545
  }
413
546
  this.lowerRf = middle - 1;
414
547
  const lower = rootFunctions[middle - 1];
415
- interval.lower = lower.polynomial;
416
- interval.lowerIndex = lower.index;
417
548
  if (this.am.compare(lower.value, value) === 0) {
418
549
  interval.isSection = true;
550
+ interval.lower.set(lower.polynomial);
551
+ interval.lowerIndex = lower.index;
419
552
  this.upperRf = this.lowerRf;
420
553
  return;
421
554
  }
555
+ interval.lower.set(lower.polynomial);
556
+ interval.lowerIndex = lower.index;
422
557
  if (middle < rootFunctions.length) {
423
558
  this.upperRf = this.lowerRf + 1;
424
- interval.upper = rootFunctions[middle].polynomial;
559
+ interval.upper.set(rootFunctions[middle].polynomial);
425
560
  interval.upperIndex = rootFunctions[middle].index;
426
561
  }
427
562
  }
428
563
 
429
- private addLinearPolyFromRoot(root: Anum, isLower: boolean) {
430
- const value = root.value as Rational;
431
- const polynomial = this.pm.sub(
432
- this.pm.mul(this.pm.mkConst(value.den), this.pm.mkVar(this.level)),
433
- this.pm.mkConst(value.num),
434
- );
564
+ private addLinearPolyFromRoot(root: Anum, isLower: boolean, p: PolynomialRef) {
565
+ const pm = this.pm;
566
+ const value = this.am.toRational(root);
567
+ p.set(pm.mkVar(this.level));
568
+ const scaled = new PolynomialRef(pm);
569
+ scaled.set(pm.mulConst(value.den, p.get()));
570
+ const constant = new PolynomialRef(pm);
571
+ constant.set(pm.mkConst(value.num));
572
+ const difference = new PolynomialRef(pm);
573
+ difference.set(pm.sub(scaled.get(), constant.get()));
574
+ constant.reset();
575
+ p.move(difference);
576
+ scaled.reset();
435
577
  const interval = this.intervals[this.level];
436
578
  if (isLower) {
437
- interval.lower = polynomial;
579
+ interval.lower.copy(p);
438
580
  interval.lowerIndex = 1;
439
581
  } else {
440
- interval.upper = polynomial;
582
+ interval.upper.copy(p);
441
583
  interval.upperIndex = 1;
442
584
  }
443
- this.levelPolys.push(polynomial);
444
- this.hasRoots.push(true);
445
- this.witnesses.push(this.chooseNonzeroCoeff(polynomial, this.level));
446
- return polynomial;
585
+ this.levelPs.push(p.get());
586
+ this.polyHasRoots.push(true);
587
+ const witness = this.chooseNonzeroCoeff(p.get(), this.level);
588
+ const copy = new PolynomialRef(pm);
589
+ copy.copy(witness);
590
+ this.witnesses.push(copy);
591
+ witness.reset();
447
592
  }
448
593
 
449
594
  private addLinearApproximations(value: Anum) {
595
+ const pLower = new PolynomialRef(this.pm);
596
+ const pUpper = new PolynomialRef(this.pm);
450
597
  const interval = this.intervals[this.level];
451
598
  const mkRootFunction = (polynomial: Polynomial, root: Anum) => ({
452
599
  value: this.am.copy(root),
453
600
  polynomial,
454
601
  index: 1,
455
- psIndex: this.levelPolys.length - 1,
602
+ psIndex: this.levelPs.size - 1,
456
603
  });
457
604
  if (interval.isSection) {
458
605
  if (!this.am.isRational(value))
459
606
  throw new NlsatUnsupportedError("a linear cell around an irrational section");
460
- if (this.pm.totalDegree(interval.lower!) > 1) {
461
- const polynomial = this.addLinearPolyFromRoot(value, true);
462
- this.rootFunctions.splice(this.lowerRf, 0, mkRootFunction(polynomial, value));
607
+ if (this.pm.totalDegree(interval.lower.get()) > 1) {
608
+ this.addLinearPolyFromRoot(value, true, pLower);
609
+ this.rootFunctions.splice(this.lowerRf, 0, mkRootFunction(pLower.get(), value));
463
610
  }
611
+ pUpper.reset();
612
+ pLower.reset();
464
613
  return;
465
614
  }
466
- if (interval.lower !== null && this.pm.totalDegree(interval.lower) > 1) {
615
+ const lower = interval.lower.getOrNull();
616
+ if (lower !== null && this.pm.totalDegree(lower) > 1) {
467
617
  const between = this.am.select(this.rootFunctions[this.lowerRf].value, value);
468
- const polynomial = this.addLinearPolyFromRoot(between, true);
469
- this.rootFunctions.splice(this.lowerRf + 1, 0, mkRootFunction(polynomial, between));
618
+ this.addLinearPolyFromRoot(between, true, pLower);
619
+ this.rootFunctions.splice(this.lowerRf + 1, 0, mkRootFunction(pLower.get(), between));
470
620
  this.lowerRf++;
471
621
  if (this.upperRf !== UNSET) this.upperRf++;
472
622
  }
473
- if (interval.upper !== null && this.pm.totalDegree(interval.upper) > 1) {
623
+ const upper = interval.upper.getOrNull();
624
+ if (upper !== null && this.pm.totalDegree(upper) > 1) {
474
625
  const between = this.am.select(value, this.rootFunctions[this.upperRf].value);
475
- const polynomial = this.addLinearPolyFromRoot(between, false);
476
- this.rootFunctions.splice(this.upperRf, 0, mkRootFunction(polynomial, between));
626
+ this.addLinearPolyFromRoot(between, false, pUpper);
627
+ this.rootFunctions.splice(this.upperRf, 0, mkRootFunction(pUpper.get(), between));
477
628
  }
629
+ pUpper.reset();
630
+ pLower.reset();
478
631
  }
479
632
 
480
633
  private buildInterval() {
481
634
  this.rootFunctions = [];
482
635
  this.pairs.clear();
483
- Object.assign(this.intervals[this.level], {
484
- isSection: false,
485
- lower: null,
486
- lowerIndex: 0,
487
- upper: null,
488
- upperIndex: 0,
489
- });
636
+ this.resetInterval(this.intervals[this.level]);
490
637
  this.lowerRf = UNSET;
491
638
  this.upperRf = UNSET;
492
639
  const value = this.sample[this.level]!;
640
+ this.polyHasRoots = Array.from({ length: this.levelPs.size }, () => false);
493
641
  const lower: RootFunction[] = [];
494
642
  const upper: RootFunction[] = [];
495
- this.hasRoots = this.levelPolys.map((_polynomial, psIndex) =>
496
- this.isolateRootsAroundSample(psIndex, value, lower, upper),
497
- );
643
+ for (let index = 0; index < this.levelPs.size; index++)
644
+ this.polyHasRoots[index] = this.isolateRootsAroundSample(
645
+ this.levelPs.get(index),
646
+ index,
647
+ value,
648
+ lower,
649
+ upper,
650
+ );
498
651
  if (lower.length === 0 && upper.length === 0) return false;
499
652
  this.rootFunctions = [
500
653
  ...this.sortRootFunctions(lower, true),
@@ -507,20 +660,27 @@ class Levelwise {
507
660
  }
508
661
 
509
662
  private addRelationResultants() {
510
- for (const pair of this.getSortedPairs())
511
- this.requestFactorized(
512
- this.getFirstPsc(this.levelPolys[pair[0]], this.levelPolys[pair[1]], this.level),
663
+ for (const pair of this.getSortedPairs()) {
664
+ const res = this.pscResultant(
665
+ this.levelPs.get(pair[0]),
666
+ this.levelPs.get(pair[1]),
667
+ this.level,
513
668
  );
669
+ this.requestFactorized(res.getOrNull());
670
+ res.reset();
671
+ }
514
672
  }
515
673
 
516
674
  private addAdjacentRootResultants() {
675
+ this.polyHasRoots = Array.from({ length: this.levelPs.size }, () => false);
517
676
  const rootValues: { root: Anum; polynomial: Polynomial }[] = [];
518
677
  const values = this.getValuesWithout(this.maxVar);
519
- this.hasRoots = this.levelPolys.map((polynomial) => {
678
+ for (let index = 0; index < this.levelPs.size; index++) {
679
+ const polynomial = this.levelPs.get(index);
520
680
  const roots = this.am.isolateRoots(this.pm, polynomial, values);
681
+ this.polyHasRoots[index] = roots.length > 0;
521
682
  for (const root of roots) rootValues.push({ root: this.am.copy(root), polynomial });
522
- return roots.length > 0;
523
- });
683
+ }
524
684
  if (rootValues.length < 2) return;
525
685
  const order = mergeSortIndices(
526
686
  rootValues.length,
@@ -535,32 +695,51 @@ class Levelwise {
535
695
  const key = `${low.id},${high.id}`;
536
696
  if (added.has(key)) continue;
537
697
  added.add(key);
538
- this.requestFactorized(this.getFirstPsc(low, high, this.maxVar));
698
+ const res = this.pscResultant(low, high, this.maxVar);
699
+ this.requestFactorized(res.getOrNull());
700
+ res.reset();
539
701
  }
540
702
  }
541
703
 
542
704
  private addSectionProjections() {
543
- const sectionPolynomial = this.intervals[this.level].lower;
705
+ const sectionPolynomial = this.intervals[this.level].lower.get();
544
706
  const withRoots = new Set(this.rootFunctions.map((rootFunction) => rootFunction.psIndex));
545
- this.levelPolys.forEach((polynomial, index) => {
546
- const isFull = polynomial === sectionPolynomial || !withRoots.has(index);
547
- this.addProjectionForPoly(polynomial, this.level, this.witnesses[index], isFull);
548
- });
707
+ for (let index = 0; index < this.levelPs.size; index++) {
708
+ const p = new PolynomialRef(this.pm);
709
+ p.set(this.levelPs.get(index));
710
+ const witness = new PolynomialRef(this.pm);
711
+ witness.copy(this.witnesses[index]);
712
+ const isFull = this.levelPs.get(index) === sectionPolynomial || !withRoots.has(index);
713
+ this.addProjectionForPoly(p.get(), this.level, witness.getOrNull(), isFull, true);
714
+ witness.reset();
715
+ p.reset();
716
+ }
549
717
  }
550
718
 
551
719
  private addSectorProjections() {
552
- this.levelPolys.forEach((polynomial, index) => {
720
+ const pm = this.pm;
721
+ for (let index = 0; index < this.levelPs.size; index++) {
722
+ const p = new PolynomialRef(pm);
723
+ p.set(this.levelPs.get(index));
724
+ const lc = new PolynomialRef(pm);
725
+ lc.set(pm.coeff(p.get(), this.level, pm.degree(p.get(), this.level)));
553
726
  const isLcAdded = !(this.isLcOmitted[index] ?? false);
554
- let witness = this.witnesses[index];
727
+ const witness = new PolynomialRef(pm);
728
+ witness.copy(this.witnesses[index]);
729
+ const value = witness.getOrNull();
555
730
  if (
556
731
  isLcAdded &&
557
- witness !== null &&
558
- !this.pm.isConst(witness) &&
559
- this.getSign(this.pm.lc(polynomial, this.level)) !== 0
732
+ value !== null &&
733
+ !pm.isConst(value) &&
734
+ !pm.isZero(lc.get()) &&
735
+ this.getSign(lc.get()) !== 0
560
736
  )
561
- witness = null;
562
- this.addProjectionForPoly(polynomial, this.level, witness, isLcAdded);
563
- });
737
+ witness.reset();
738
+ this.addProjectionForPoly(p.get(), this.level, witness.getOrNull(), isLcAdded, true);
739
+ witness.reset();
740
+ lc.reset();
741
+ p.reset();
742
+ }
564
743
  }
565
744
 
566
745
  private shouldUseSpanningTree() {
@@ -568,12 +747,19 @@ class Levelwise {
568
747
  if (this.lowerRf === UNSET || this.upperRf === UNSET) return false;
569
748
  if (this.getBoundIndex(this.lowerRf) === this.getBoundIndex(this.upperRf)) return false;
570
749
  let bothCount = 0;
571
- for (let index = 0; index < this.levelPolys.length; index++)
750
+ for (let index = 0; index < this.levelPs.size; index++)
572
751
  if (this.sideMask[index] === BOTH_SIDES && ++bothCount >= SPANNING_TREE_THRESHOLD)
573
752
  return true;
574
753
  return false;
575
754
  }
576
755
 
756
+ private clearLevelState() {
757
+ this.isLcOmitted = [];
758
+ this.pairs.clear();
759
+ this.sideMask = [];
760
+ this.degInOrderGraph = [];
761
+ }
762
+
577
763
  private processLevelWithMode(mode: ProjectionMode, hasInterval: boolean) {
578
764
  if (hasInterval) {
579
765
  if (mode === "section") this.fillRelationSection();
@@ -590,21 +776,23 @@ class Levelwise {
590
776
  }
591
777
 
592
778
  private collectNonNullWitnesses() {
593
- this.witnesses = [];
594
- for (let index = 0; index < this.levelPolys.length; index++) {
595
- const polynomial = this.levelPolys[index];
596
- const witness = this.chooseNonzeroCoeff(polynomial, this.level);
597
- if (witness === null) this.handleNullifiedPoly(polynomial);
598
- this.witnesses.push(witness);
599
- if (index + 1 === this.levelPolys.length)
600
- this.todo.extractPolysAtLevel(this.level, this.levelPolys);
779
+ this.clearWitnesses();
780
+ for (let index = 0; index < this.levelPs.size; index++) {
781
+ const p = new PolynomialRef(this.pm);
782
+ p.set(this.levelPs.get(index));
783
+ const witness = this.chooseNonzeroCoeff(p.get(), this.level);
784
+ if (witness.getOrNull() === null) this.handleNullifiedPoly(p.get());
785
+ const copy = new PolynomialRef(this.pm);
786
+ copy.copy(witness);
787
+ this.witnesses.push(copy);
788
+ if (index + 1 === this.levelPs.size) this.todo.extractPolysAtLevel(this.level, this.levelPs);
789
+ witness.reset();
790
+ p.reset();
601
791
  }
602
792
  }
603
793
 
604
794
  private processLevel() {
605
- this.isLcOmitted = [];
606
- this.pairs.clear();
607
- this.sideMask = [];
795
+ this.clearLevelState();
608
796
  this.collectNonNullWitnesses();
609
797
  const hasInterval = this.buildInterval();
610
798
  this.processLevelWithMode(
@@ -618,39 +806,65 @@ class Levelwise {
618
806
  }
619
807
 
620
808
  private processTopLevel() {
809
+ const pm = this.pm;
621
810
  this.collectNonNullWitnesses();
622
811
  this.addAdjacentRootResultants();
623
- this.levelPolys.forEach((polynomial, index) => {
624
- const leadingCoeff = this.pm.lc(polynomial, this.maxVar);
625
- const isLcAdded =
626
- this.hasRoots[index] || this.pm.isZero(leadingCoeff) || this.getSign(leadingCoeff) === 0;
627
- if (!isLcAdded) this.witnesses[index] = null;
628
- this.addProjectionForPoly(polynomial, this.maxVar, this.witnesses[index], isLcAdded);
812
+ for (let index = 0; index < this.levelPs.size; index++) {
813
+ const p = new PolynomialRef(pm);
814
+ p.set(this.levelPs.get(index));
815
+ const lc = new PolynomialRef(pm);
816
+ lc.set(pm.coeff(p.get(), this.maxVar, pm.degree(p.get(), this.maxVar)));
817
+ let isLcAdded = true;
818
+ if (
819
+ !(this.polyHasRoots[index] ?? false) &&
820
+ !pm.isZero(lc.get()) &&
821
+ this.getSign(lc.get()) !== 0
822
+ ) {
823
+ isLcAdded = false;
824
+ this.witnesses[index].reset();
825
+ }
826
+ this.addProjectionForPoly(
827
+ p.get(),
828
+ this.maxVar,
829
+ this.witnesses[index].getOrNull(),
830
+ isLcAdded,
831
+ true,
832
+ );
833
+ lc.reset();
834
+ p.reset();
835
+ }
836
+ }
837
+
838
+ private copyIntervals() {
839
+ return this.intervals.map((interval) => {
840
+ const copy = new CellInterval(this.pm);
841
+ copy.isSection = interval.isSection;
842
+ copy.lower.copy(interval.lower);
843
+ copy.lowerIndex = interval.lowerIndex;
844
+ copy.upper.copy(interval.upper);
845
+ copy.upperIndex = interval.upperIndex;
846
+ return copy;
629
847
  });
630
848
  }
631
849
 
632
- computeSingleCell(polynomials: readonly Polynomial[]) {
633
- if (this.maxVar === 0) return this.intervals;
634
- for (const polynomial of polynomials) this.requestFactorized(polynomial);
635
- if (this.todo.isEmpty) return this.intervals;
850
+ singleCell() {
851
+ if (this.maxVar === 0) return this.copyIntervals();
852
+ this.todo.reset();
853
+ for (let index = 0; index < this.polynomials.size; index++) {
854
+ const p = new PolynomialRef(this.pm);
855
+ p.set(this.polynomials.get(index));
856
+ this.requestFactorized(p.get());
857
+ p.reset();
858
+ }
859
+ if (this.todo.isEmpty) return this.copyIntervals();
636
860
  if (this.todo.getMaxVar() === this.maxVar) {
637
- this.level = this.todo.extractMaxPolys(this.levelPolys);
861
+ this.level = this.todo.extractMaxPolys(this.levelPs);
638
862
  this.processTopLevel();
639
863
  }
640
864
  while (!this.todo.isEmpty) {
641
- this.level = this.todo.extractMaxPolys(this.levelPolys);
865
+ this.level = this.todo.extractMaxPolys(this.levelPs);
642
866
  this.processLevel();
643
867
  }
644
- return this.intervals;
868
+ return this.copyIntervals();
645
869
  }
646
870
  }
647
-
648
- export const getSingleCell = (
649
- pm: PolynomialManager,
650
- am: AlgebraicManager,
651
- cache: PolynomialCache,
652
- polynomials: readonly Polynomial[],
653
- maxVar: number,
654
- sample: readonly (Anum | undefined)[],
655
- isLinear: boolean,
656
- ) => new Levelwise(pm, am, cache, sample, maxVar, isLinear).computeSingleCell(polynomials);