tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b

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