tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +8 -0
  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 +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,22 +1,14 @@
1
- // Ported from Z3 (src/math/polynomial/algebraic_numbers.cpp, src/util/basic_interval.h,
2
- // src/util/mpbq.cpp), MIT license, see z3-license.txt. Real algebraic numbers: a rational, or the
3
- // root of a square-free integer polynomial in an open isolating interval of binary rationals whose
4
- // ends the polynomial has opposite signs at. Comparing and evaluating refine these intervals in
5
- // place, and may find a number rational, as Z3 does, so later operations see Z3's intervals.
6
- import { SmtInvariantError } from "../../../../errors";
1
+ import { SmtCanceledError, SmtDefaultError, SmtInvariantError } from "../../../../errors";
7
2
  import { Rational } from "../rational";
3
+ import type { ResourceLimit } from "../rlimit";
8
4
  import { getLog2, Mpbq } from "./mpbq";
9
- import { PolynomialManager, type Polynomial, type ValueOps } from "./polynomial";
5
+ import { PolynomialManager, type Polynomial, PolynomialRef, type ValueOps } from "./polynomial";
10
6
  import { UpolynomialManager, type Upolynomial } from "./upolynomial";
11
7
  import { factorUpolynomial, type FactorParams } from "./upolynomial-factorization";
12
8
 
13
- // algebraic.factor_max_prime, factor_num_primes and factor_search_size.
14
9
  const FACTOR_PARAMS: FactorParams = { maxPrime: 31, primeTrials: 1, maxSearchSize: 5000 };
15
- // -algebraic.min_mag: a refined interval narrower than about 1/2^16 is not kept.
16
10
  const MIN_MAGNITUDE = -16;
17
- // DEFAULT_PRECISION: how far isolate_roots with signs refines each root first.
18
11
  const SIGN_PRECISION = 2;
19
- // The variables of the polynomials the binary operations build, m_x and m_y.
20
12
  const X = 0;
21
13
  const Y = 1;
22
14
 
@@ -28,7 +20,6 @@ class AlgebraicCell {
28
20
  public isMinimal: boolean,
29
21
  public isSignLowerNeg: boolean,
30
22
  public isNotRational: boolean,
31
- // m_i: which root of p the number is, from 1, or 0 when not yet computed.
32
23
  public rootIndex: number,
33
24
  ) {}
34
25
 
@@ -49,7 +40,6 @@ class AlgebraicCell {
49
40
  }
50
41
  }
51
42
 
52
- // anum: a mutable handle, since refining an algebraic number may turn it into a rational.
53
43
  export class Anum {
54
44
  constructor(public value: Rational | AlgebraicCell) {}
55
45
  }
@@ -59,14 +49,11 @@ interface BqInterval {
59
49
  upper: Mpbq;
60
50
  }
61
51
 
62
- // One end of the interval select_small picks from: a binary rational end is closed, a rational one
63
- // open.
64
52
  interface SelectEnd {
65
53
  value: Rational;
66
54
  isOpen: boolean;
67
55
  }
68
56
 
69
- // save_intervals: an interval to restore when refining it made it too narrow to keep.
70
57
  interface SavedInterval {
71
58
  anum: Anum;
72
59
  lower: Mpbq;
@@ -74,7 +61,6 @@ interface SavedInterval {
74
61
  isRestored: boolean;
75
62
  }
76
63
 
77
- // The factor whose Sturm sequence counts the one root in an interval.
78
64
  interface IsolatingFactor {
79
65
  factor: Upolynomial;
80
66
  sequence: Upolynomial[];
@@ -91,10 +77,17 @@ interface SignedRoots {
91
77
  signs: number[];
92
78
  }
93
79
 
94
- const minBq = (first: Mpbq, second: Mpbq) => (second.compare(first) < 0 ? second : first);
95
- const maxBq = (first: Mpbq, second: Mpbq) => (second.compare(first) > 0 ? second : first);
80
+ const getMinBq = (first: Mpbq, second: Mpbq) => (second.compare(first) < 0 ? second : first);
81
+ const getMaxBq = (first: Mpbq, second: Mpbq) => (second.compare(first) > 0 ? second : first);
82
+
83
+ const getIntervalPower = (base: BqInterval, exponent: number): BqInterval => {
84
+ const lower = base.lower.power(exponent);
85
+ const upper = base.upper.power(exponent);
86
+ if (exponent % 2 === 1 || !base.lower.isNeg) return { lower, upper };
87
+ if (base.upper.isNeg) return { lower: upper, upper: lower };
88
+ return { lower: Mpbq.zero, upper: getMaxBq(lower, upper) };
89
+ };
96
90
 
97
- // mpbqi_manager over open intervals, as t_eval uses it.
98
91
  const INTERVAL_OPS: ValueOps<BqInterval> = {
99
92
  fromInteger: (value) => ({ lower: Mpbq.of(value), upper: Mpbq.of(value) }),
100
93
  add: (first, second) => ({
@@ -108,26 +101,16 @@ const INTERVAL_OPS: ValueOps<BqInterval> = {
108
101
  first.upper.mul(second.lower),
109
102
  first.upper.mul(second.upper),
110
103
  ];
111
- return { lower: products.reduce(minBq), upper: products.reduce(maxBq) };
104
+ return { lower: products.reduce(getMinBq), upper: products.reduce(getMaxBq) };
112
105
  },
113
- power: (base, exponent) => getIntervalPower(base, exponent),
114
- };
115
-
116
- const getIntervalPower = (base: BqInterval, exponent: number): BqInterval => {
117
- const lower = base.lower.power(exponent);
118
- const upper = base.upper.power(exponent);
119
- if (exponent % 2 === 1 || !base.lower.isNeg) return { lower, upper };
120
- if (base.upper.isNeg) return { lower: upper, upper: lower };
121
- return { lower: Mpbq.zero, upper: maxBq(lower, upper) };
106
+ power: getIntervalPower,
122
107
  };
123
108
 
124
109
  const containsZero = (interval: BqInterval) => interval.lower.isNeg && interval.upper.isPos;
125
110
 
126
- // mpz log2 and mlog2: 0 outside the sign they expect.
127
111
  const getPositiveLog2 = (value: bigint) => (value <= 0n ? 0 : getLog2(value));
128
112
  const getNegativeLog2 = (value: bigint) => (value >= 0n ? 0 : getLog2(value));
129
113
 
130
- // magnitude_ub
131
114
  const getMagnitudeUpperBound = (value: Mpbq) =>
132
115
  value.isZero
133
116
  ? 0
@@ -135,14 +118,12 @@ const getMagnitudeUpperBound = (value: Mpbq) =>
135
118
  ? getLog2(value.num) - value.k + 1
136
119
  : getNegativeLog2(value.num) - value.k;
137
120
 
138
- // magnitude: about log2 of the width of (l, u).
139
121
  const getMagnitude = (lower: Mpbq, upper: Mpbq) => {
140
122
  if (lower.k === upper.k) return getMagnitudeUpperBound(lower);
141
123
  const log2 = lower.isNeg ? getNegativeLog2 : getPositiveLog2;
142
124
  return log2(upper.num) - log2(lower.num) - upper.k + lower.k - upper.k;
143
125
  };
144
126
 
145
- // select_integer: the integer select_small takes from scaled ends, preferring a closed end.
146
127
  const selectInteger = (
147
128
  lower: SelectEnd,
148
129
  upper: SelectEnd,
@@ -158,8 +139,6 @@ const selectInteger = (
158
139
  return ceilLower <= floorUpper ? ceilLower : null;
159
140
  };
160
141
 
161
- // select_small_core: the binary rational between two ends with the smallest power of two as its
162
- // denominator.
163
142
  const selectSmall = (lower: SelectEnd, upper: SelectEnd) => {
164
143
  for (let k = 0; ; k++) {
165
144
  const scale = Rational.of(1n << BigInt(k));
@@ -189,12 +168,65 @@ const getExtended = (values: readonly (Anum | undefined)[], variable: number, an
189
168
  return extended;
190
169
  };
191
170
 
192
- const sameCoeffs = (first: Upolynomial, second: Upolynomial) =>
171
+ const getSmt2Numeral = (value: bigint) => (value < 0n ? `(- ${-value})` : `${value}`);
172
+
173
+ const getSmt2Monomial = (coeff: bigint, degree: number) => {
174
+ if (degree === 0) return getSmt2Numeral(coeff);
175
+ const power = degree === 1 ? "x" : `(^ x ${degree})`;
176
+ return coeff === 1n ? power : `(* ${getSmt2Numeral(coeff)} ${power})`;
177
+ };
178
+
179
+ const getUpolynomialSmt2 = (p: Upolynomial) => {
180
+ if (p.length === 0) return "0";
181
+ const nonzero = p.flatMap((coeff, degree) => (coeff === 0n ? [] : [degree]));
182
+ if (nonzero.length === 1) return getSmt2Monomial(p[nonzero[0]], nonzero[0]);
183
+ return `(+ ${nonzero
184
+ .reverse()
185
+ .map((degree) => getSmt2Monomial(p[degree], degree))
186
+ .join(" ")})`;
187
+ };
188
+
189
+ const getRationalDecimal = (value: Rational, precision: number) => {
190
+ const magnitude = value.num < 0n ? -value.num : value.num;
191
+ const sign = value.num < 0n ? "-" : "";
192
+ let remainder = magnitude % value.den;
193
+ if (remainder === 0n) return `${sign}${magnitude / value.den}`;
194
+ const digits: string[] = [];
195
+ for (let index = 0; index < precision && remainder !== 0n; index++) {
196
+ digits.push(`${(remainder * 10n) / value.den}`);
197
+ remainder = (remainder * 10n) % value.den;
198
+ }
199
+ return `${sign}${magnitude / value.den}.${digits.join("")}${remainder === 0n ? "" : "?"}`;
200
+ };
201
+
202
+ const hasSameCoeffs = (first: Upolynomial, second: Upolynomial) =>
193
203
  first.length === second.length && first.every((coeff, index) => coeff === second[index]);
194
204
 
205
+ export const mergeSortIndices = (
206
+ count: number,
207
+ isLess: (first: number, second: number) => boolean,
208
+ ) => {
209
+ let source = Array.from({ length: count }, (_unused, index) => index);
210
+ for (let width = 1; width < count; width *= 2) {
211
+ const target: number[] = [];
212
+ for (let low = 0; low < count; low += 2 * width) {
213
+ const middle = Math.min(low + width, count);
214
+ const high = Math.min(low + 2 * width, count);
215
+ let left = low;
216
+ let right = middle;
217
+ while (left < middle && right < high)
218
+ target.push(isLess(source[right], source[left]) ? source[right++] : source[left++]);
219
+ while (left < middle) target.push(source[left++]);
220
+ while (right < high) target.push(source[right++]);
221
+ }
222
+ source = target;
223
+ }
224
+ return source;
225
+ };
226
+
195
227
  export class AlgebraicManager {
196
- private um = new UpolynomialManager();
197
- private pm = new PolynomialManager();
228
+ private um: UpolynomialManager;
229
+ private pm: PolynomialManager;
198
230
  private anumOps: ValueOps<Anum> = {
199
231
  fromInteger: (value) => new Anum(Rational.of(value)),
200
232
  add: (first, second) => this.add(first, second),
@@ -202,7 +234,10 @@ export class AlgebraicManager {
202
234
  power: (base, exponent) => this.power(base, exponent),
203
235
  };
204
236
 
205
- // Queries.
237
+ constructor(private limit: ResourceLimit) {
238
+ this.um = new UpolynomialManager(limit);
239
+ this.pm = new PolynomialManager(limit);
240
+ }
206
241
 
207
242
  isZero(anum: Anum) {
208
243
  return anum.value instanceof Rational && anum.value.isZero();
@@ -213,11 +248,20 @@ export class AlgebraicManager {
213
248
  return anum.value instanceof Rational ? 1 : anum.value.p.length - 1;
214
249
  }
215
250
 
251
+ isNeg(anum: Anum) {
252
+ return anum.value instanceof Rational ? anum.value.isNegative() : !anum.value.upper.isPos;
253
+ }
254
+
255
+ toRational(anum: Anum) {
256
+ if (!this.isRational(anum) || !(anum.value instanceof Rational))
257
+ throw new SmtInvariantError("expected a rational algebraic number");
258
+ return anum.value;
259
+ }
260
+
216
261
  copy(anum: Anum) {
217
262
  return new Anum(anum.value instanceof Rational ? anum.value : anum.value.clone());
218
263
  }
219
264
 
220
- // is_int: refines the interval until it holds at most one integer, then tests it.
221
265
  isInt(anum: Anum): boolean {
222
266
  if (anum.value instanceof Rational) return anum.value.isInt();
223
267
  const cell = anum.value;
@@ -231,8 +275,6 @@ export class AlgebraicManager {
231
275
  return false;
232
276
  }
233
277
 
234
- // is_rational: by the rational root theorem, the only candidate in an interval narrower than
235
- // 1/|a_n| is floor(u*|a_n|)/|a_n|.
236
278
  isRational(anum: Anum) {
237
279
  if (anum.value instanceof Rational) return true;
238
280
  const cell = anum.value;
@@ -250,7 +292,6 @@ export class AlgebraicManager {
250
292
  return isRoot;
251
293
  }
252
294
 
253
- // get_i: which root of its polynomial the number is.
254
295
  getRootIndex(anum: Anum) {
255
296
  if (anum.value instanceof Rational) return this.isZero(anum) ? 0 : 1;
256
297
  const cell = anum.value;
@@ -258,9 +299,6 @@ export class AlgebraicManager {
258
299
  return cell.rootIndex;
259
300
  }
260
301
 
261
- // Cells.
262
-
263
- // mk_algebraic_cell: the coefficients made primitive with a positive leading coefficient.
264
302
  private mkCell(p: Upolynomial, lower: Mpbq, upper: Mpbq, isMinimal: boolean) {
265
303
  const cell = new AlgebraicCell(p, lower, upper, isMinimal, false, isMinimal, 0);
266
304
  this.updateSignLower(cell);
@@ -276,13 +314,11 @@ export class AlgebraicManager {
276
314
  cell.isSignLowerNeg = this.um.evalSignAtBq(cell.p, cell.lower) < 0;
277
315
  }
278
316
 
279
- // set(a, p, l, u, minimal): the root of p in (l, u), a rational when p is linear.
280
317
  private mkAnum(p: Upolynomial, lower: Mpbq, upper: Mpbq, isMinimal: boolean) {
281
318
  if (p.length === 2) return new Anum(Rational.of(p[0]).div(Rational.of(p[1])).neg());
282
319
  return new Anum(this.mkCell(p, lower, upper, isMinimal));
283
320
  }
284
321
 
285
- // normalize: an interval around zero shrunk to the side of zero holding the root.
286
322
  private normalize(anum: Anum) {
287
323
  if (anum.value instanceof Rational) return;
288
324
  const cell = anum.value;
@@ -295,9 +331,6 @@ export class AlgebraicManager {
295
331
  cell.upper = interval.upper;
296
332
  }
297
333
 
298
- // Refinement.
299
-
300
- // refine: halves the interval, or finds the number rational and returns false.
301
334
  private refine(anum: Anum) {
302
335
  if (anum.value instanceof Rational) return false;
303
336
  const cell = anum.value;
@@ -316,7 +349,6 @@ export class AlgebraicManager {
316
349
  return true;
317
350
  }
318
351
 
319
- // refine_until_prec: refines until the interval is narrower than 1/2^precision.
320
352
  private refineUntilPrecision(anum: Anum, precision: number) {
321
353
  if (anum.value instanceof Rational) return true;
322
354
  const cell = anum.value;
@@ -339,7 +371,6 @@ export class AlgebraicManager {
339
371
  return { anum, lower: cell.lower, upper: cell.upper, isRestored: false };
340
372
  }
341
373
 
342
- // restore_if_too_small: swaps the saved interval back in when the current one is too narrow.
343
374
  private restoreIfTooSmall(saved: SavedInterval) {
344
375
  saved.isRestored = true;
345
376
  if (saved.anum.value instanceof Rational) return;
@@ -353,24 +384,20 @@ export class AlgebraicManager {
353
384
  ];
354
385
  }
355
386
 
356
- // ~save_intervals
357
387
  private releaseInterval(saved: SavedInterval) {
358
388
  if (!saved.isRestored) this.restoreIfTooSmall(saved);
359
389
  }
360
390
 
361
- // Root isolation.
362
-
363
391
  private factor(p: Upolynomial) {
364
392
  return factorUpolynomial(this.um, p, FACTOR_PARAMS);
365
393
  }
366
394
 
367
- // isolate_roots(up): the real roots of a univariate polynomial, factor by factor, sorted.
368
- private isolateUnivariateRoots(up: Upolynomial) {
395
+ isolateUnivariateRoots(coeffs: Upolynomial) {
369
396
  const roots: Anum[] = [];
370
- if (up.length === 0) return roots;
371
- const hasZeroRoot = this.um.hasZeroRoots(up);
397
+ if (coeffs.length === 0) return roots;
398
+ const hasZeroRoot = this.um.hasZeroRoots(coeffs);
372
399
  if (hasZeroRoot) roots.push(new Anum(Rational.zero));
373
- const factored = this.factor(hasZeroRoot ? this.um.removeZeroRoots(up) : up);
400
+ const factored = this.factor(hasZeroRoot ? this.um.removeZeroRoots(coeffs) : coeffs);
374
401
  for (const factor of factored.factors.factors) {
375
402
  const degree = factor.length - 1;
376
403
  if (degree <= 0) continue;
@@ -399,32 +426,13 @@ export class AlgebraicManager {
399
426
  return roots;
400
427
  }
401
428
 
402
- // sort_roots: Z3's stable bottom-up merge sort, since each comparison may refine the roots.
403
429
  private sortRoots(roots: Anum[]) {
404
- const size = roots.length;
405
- if (size < 2) return;
406
- const isLess = (first: number, second: number) => {
407
- const sign = this.compare(roots[first], roots[second]);
408
- return sign !== 0 ? sign < 0 : first < second;
409
- };
410
- let source = roots.map((_root, index) => index);
411
- let target = [...source];
412
- for (let width = 1; width < size; width *= 2) {
413
- for (let low = 0; low < size; low += 2 * width) {
414
- const middle = Math.min(low + width, size);
415
- const high = Math.min(low + 2 * width, size);
416
- let left = low;
417
- let right = middle;
418
- let next = low;
419
- while (left < middle && right < high)
420
- target[next++] = isLess(source[right], source[left]) ? source[right++] : source[left++];
421
- while (left < middle) target[next++] = source[left++];
422
- while (right < high) target[next++] = source[right++];
423
- }
424
- [source, target] = [target, source];
425
- }
426
- const sorted = source.map((index) => roots[index]);
427
- for (let index = 0; index < size; index++) roots[index] = sorted[index];
430
+ if (!this.limit.inc() || roots.length < 2) return;
431
+ const sorted = mergeSortIndices(
432
+ roots.length,
433
+ (first, second) => this.compare(roots[first], roots[second]) < 0,
434
+ ).map((index) => roots[index]);
435
+ for (let index = 0; index < sorted.length; index++) roots[index] = sorted[index];
428
436
  }
429
437
 
430
438
  private getSignVariationsAtQ(sequence: Upolynomial[], value: Rational) {
@@ -440,7 +448,6 @@ export class AlgebraicManager {
440
448
  return count;
441
449
  }
442
450
 
443
- // isolate_kth_root: the i-th real root of a square-free p, by bisecting with its Sturm sequence.
444
451
  private isolateKthRoot(p: Upolynomial, sequence: Upolynomial[], rootIndex: number) {
445
452
  if (p.length === 2) return new Anum(Rational.of(p[0]).div(Rational.of(p[1])).neg());
446
453
  const minusInf = this.um.signVariationsAtMinusInf(sequence);
@@ -457,6 +464,7 @@ export class AlgebraicManager {
457
464
  let highVariations = isNonPositive ? atZero : this.um.signVariationsAtPlusInf(sequence);
458
465
  let target = isNonPositive ? rootIndex : rootIndex - nonPositiveCount;
459
466
  while (lowVariations > highVariations + 1) {
467
+ this.limit.checkpoint();
460
468
  const middle = low.add(high).div2();
461
469
  const middleVariations = this.um.signVariationsAt(sequence, middle);
462
470
  const leftCount = lowVariations - middleVariations;
@@ -478,8 +486,6 @@ export class AlgebraicManager {
478
486
  );
479
487
  }
480
488
 
481
- // rational_root_in_interval: the root of p in (l, u) when it is rational, else the interval
482
- // refined below 1/|a_n|.
483
489
  private getRationalRootIn(p: Upolynomial, lower: Mpbq, upper: Mpbq): Rational | BqInterval {
484
490
  const leading = p[p.length - 1];
485
491
  const absLeading = leading < 0n ? -leading : leading;
@@ -491,17 +497,16 @@ export class AlgebraicManager {
491
497
  return { lower: refined.lower, upper: refined.upper };
492
498
  }
493
499
 
494
- // isolate_roots_closest_univariate: the roots next to s, s itself when it is a root.
495
- private isolateUnivariateClosest(
500
+ private isolateRootsClosestUnivariate(
496
501
  pm: PolynomialManager,
497
502
  polynomial: Polynomial,
498
503
  sample: Rational,
499
504
  ): ClosestAnums {
500
505
  const result: ClosestAnums = { roots: [], indices: [] };
501
506
  if (pm.isConst(polynomial)) return result;
502
- const up = pm.toCoeffs(polynomial);
503
- if (up.length === 0) return result;
504
- const p = this.um.squareFree(up);
507
+ const coeffs = pm.toCoeffs(polynomial);
508
+ if (coeffs.length === 0) return result;
509
+ const p = this.um.squareFree(coeffs);
505
510
  if (p.length <= 1) return result;
506
511
  const sequence = this.um.sturmSeq(p);
507
512
  const minusInf = this.um.signVariationsAtMinusInf(sequence);
@@ -522,9 +527,6 @@ export class AlgebraicManager {
522
527
  return result;
523
528
  }
524
529
 
525
- // isolate_roots(p, x2v): the roots of p in its one unassigned variable at the values of the
526
- // others. Resultants eliminate the irrational values, and the roots of the result that are not
527
- // roots of p are filtered out.
528
530
  isolateRoots(
529
531
  pm: PolynomialManager,
530
532
  polynomial: Polynomial,
@@ -533,31 +535,45 @@ export class AlgebraicManager {
533
535
  ): Anum[] {
534
536
  if (pm.isConst(polynomial)) return [];
535
537
  if (pm.isUnivariate(polynomial)) return this.isolateUnivariateRoots(pm.toCoeffs(polynomial));
536
- const reduced = pm.substituteRational(polynomial, getRationalValues(values));
537
- if (pm.isConst(reduced)) return [];
538
- if (pm.isUnivariate(reduced)) {
539
- if (values[pm.maxVar(reduced)] !== undefined) return [];
540
- return this.isolateUnivariateRoots(pm.toCoeffs(reduced));
541
- }
542
- const xs = this.sortByDegree(pm.getVars(reduced), values);
543
- const x = xs[xs.length - 1];
544
- if (values[x] !== undefined) return [];
545
- let q = reduced;
546
- for (const y of xs.slice(0, -1)) {
547
- q = pm.resultant(q, pm.fromCoeffs(getCell(values[y]).p, y), y);
548
- if (q.size === 0) break;
549
- }
550
- if (q.size > 0) {
551
- if (pm.isConst(q)) return [];
552
- return this.filterRoots(pm, reduced, values, x, this.isolateUnivariateRoots(pm.toCoeffs(q)));
538
+ const pPrime = new PolynomialRef(pm);
539
+ const q = new PolynomialRef(pm);
540
+ const pY = new PolynomialRef(pm);
541
+ try {
542
+ pPrime.set(pm.substituteRational(polynomial, getRationalValues(values)));
543
+ const reduced = pPrime.get();
544
+ if (pm.isConst(reduced)) return [];
545
+ if (pm.isUnivariate(reduced)) {
546
+ if (values[pm.maxVar(reduced)] !== undefined) return [];
547
+ return this.isolateUnivariateRoots(pm.toCoeffs(reduced));
548
+ }
549
+ const xs = this.sortByDegree(pm.getVars(reduced), values);
550
+ const x = xs[xs.length - 1];
551
+ if (values[x] !== undefined) return [];
552
+ q.copy(pPrime);
553
+ for (let index = 0; index + 1 < xs.length; index++) {
554
+ this.limit.checkpoint();
555
+ const y = xs[index];
556
+ pY.set(pm.toPolynomial(getCell(values[y]).p, y));
557
+ pm.resultant(q.get(), pY.get(), y, q);
558
+ if (pm.isZero(q.get())) {
559
+ if (isNested)
560
+ throw new SmtInvariantError("resultant vanished during nested isolate_roots call");
561
+ break;
562
+ }
563
+ }
564
+ if (pm.isZero(q.get())) return this.isolateVanishedRoots(pm, reduced, values, xs, x);
565
+ if (pm.isConst(q.get())) return [];
566
+ return this.isolateUnivariateRoots(pm.toCoeffs(q.get())).filter((root) => {
567
+ this.limit.checkpoint();
568
+ return this.evalSignAt(pm, reduced, getExtended(values, x, root)) === 0;
569
+ });
570
+ } finally {
571
+ pY.reset();
572
+ q.reset();
573
+ pPrime.reset();
553
574
  }
554
- if (isNested)
555
- throw new SmtInvariantError("resultant vanished during nested isolate_roots call");
556
- return this.isolateVanishedRoots(pm, reduced, values, xs, x);
557
575
  }
558
576
 
559
- // The resultant vanished, perhaps at another root of a value's polynomial: p's leading
560
- // coefficient at the values decides.
561
577
  private isolateVanishedRoots(
562
578
  pm: PolynomialManager,
563
579
  reduced: Polynomial,
@@ -569,30 +585,52 @@ export class AlgebraicManager {
569
585
  pm.evaluateWith(polynomial, this.anumOps, (variable) => getAssigned(values, variable));
570
586
  const degree = pm.degree(reduced, x);
571
587
  if (degree === 1) {
572
- const constant = evaluate(pm.coeff(reduced, x, 0));
573
- const leading = evaluate(pm.coeff(reduced, x, 1));
588
+ const c0 = new PolynomialRef(pm);
589
+ const c1 = new PolynomialRef(pm);
590
+ c0.set(pm.coeff(reduced, x, 0));
591
+ c1.set(pm.coeff(reduced, x, 1));
592
+ const constant = evaluate(c0.get());
593
+ const leading = evaluate(c1.get());
594
+ c1.reset();
595
+ c0.reset();
574
596
  if (this.isZero(leading)) return [];
575
597
  const root = this.div(constant, leading);
576
598
  this.neg(root);
577
599
  return [root];
578
600
  }
601
+ const c = new PolynomialRef(pm);
579
602
  let power = degree;
580
603
  let leading = new Anum(Rational.zero);
581
604
  for (; power >= 1; power--) {
582
- leading = evaluate(pm.coeff(reduced, x, power));
605
+ c.set(pm.coeff(reduced, x, power));
606
+ leading = evaluate(c.get());
583
607
  if (!this.isZero(leading)) break;
584
608
  }
585
- if (power === 0) return [];
586
- // z*x^i + c_{i-1}*x^{i-1} + ... + c_0, with z the value of the leading coefficient.
609
+ if (power === 0) {
610
+ c.reset();
611
+ return [];
612
+ }
587
613
  const z = Math.max(...xs) + 1;
588
- const q = this.pm.add(
589
- this.pm.mul(this.pm.mkVar(z), this.pm.mkVar(x, power)),
590
- this.convert(pm, reduced, x, power - 1),
591
- );
592
- return this.isolateRoots(this.pm, q, getExtended(values, z, leading), true);
614
+ const q2 = new PolynomialRef(this.pm);
615
+ const zP = new PolynomialRef(this.pm);
616
+ const xiP = new PolynomialRef(this.pm);
617
+ const product = new PolynomialRef(this.pm);
618
+ q2.set(this.convert(pm, reduced, x, power - 1));
619
+ xiP.set(this.pm.mkVar(x, power));
620
+ zP.set(this.pm.mkVar(z));
621
+ product.set(this.pm.mul(zP.get(), xiP.get()));
622
+ q2.set(this.pm.add(product.get(), q2.get()));
623
+ product.reset();
624
+ try {
625
+ return this.isolateRoots(this.pm, q2.get(), getExtended(values, z, leading), true);
626
+ } finally {
627
+ xiP.reset();
628
+ zP.reset();
629
+ q2.reset();
630
+ c.reset();
631
+ }
593
632
  }
594
633
 
595
- // convert: p in the local manager, without its monomials of degree above maxDegree in x.
596
634
  private convert(pm: PolynomialManager, polynomial: Polynomial, x = -1, maxDegree = Infinity) {
597
635
  if (pm === this.pm) return polynomial;
598
636
  const as: bigint[] = [];
@@ -606,7 +644,6 @@ export class AlgebraicManager {
606
644
  return this.pm.mkPolynomial(as, ms);
607
645
  }
608
646
 
609
- // std::stable_sort with var_degree_lt: by the degree of each value, unassigned last.
610
647
  private sortByDegree(xs: number[], values: readonly (Anum | undefined)[]) {
611
648
  const getDegree = (variable: number) => {
612
649
  const value = values[variable];
@@ -615,20 +652,6 @@ export class AlgebraicManager {
615
652
  return [...xs].sort((first, second) => getDegree(first) - getDegree(second));
616
653
  }
617
654
 
618
- // filter_roots: the roots at which p vanishes.
619
- private filterRoots(
620
- pm: PolynomialManager,
621
- polynomial: Polynomial,
622
- values: readonly (Anum | undefined)[],
623
- x: number,
624
- roots: Anum[],
625
- ) {
626
- return roots.filter(
627
- (root) => this.evalSignAt(pm, polynomial, getExtended(values, x, root)) === 0,
628
- );
629
- }
630
-
631
- // isolate_roots_closest: the roots of p next to the rational s, with their indices from 1.
632
655
  isolateRootsClosest(
633
656
  pm: PolynomialManager,
634
657
  polynomial: Polynomial,
@@ -637,14 +660,22 @@ export class AlgebraicManager {
637
660
  ): ClosestAnums {
638
661
  const result: ClosestAnums = { roots: [], indices: [] };
639
662
  if (pm.isConst(polynomial)) return result;
640
- if (pm.isUnivariate(polynomial)) return this.isolateUnivariateClosest(pm, polynomial, sample);
641
- const reduced = pm.substituteRational(polynomial, getRationalValues(values));
642
- if (pm.isConst(reduced)) return result;
643
- if (pm.isUnivariate(reduced)) {
644
- if (values[pm.maxVar(reduced)] !== undefined) return result;
645
- return this.isolateUnivariateClosest(pm, reduced, sample);
663
+ if (pm.isUnivariate(polynomial))
664
+ return this.isolateRootsClosestUnivariate(pm, polynomial, sample);
665
+ const pPrime = new PolynomialRef(pm);
666
+ let all: Anum[];
667
+ try {
668
+ pPrime.set(pm.substituteRational(polynomial, getRationalValues(values)));
669
+ const reduced = pPrime.get();
670
+ if (pm.isConst(reduced)) return result;
671
+ if (pm.isUnivariate(reduced)) {
672
+ if (values[pm.maxVar(reduced)] !== undefined) return result;
673
+ return this.isolateRootsClosestUnivariate(pm, reduced, sample);
674
+ }
675
+ all = this.isolateRoots(pm, polynomial, values);
676
+ } finally {
677
+ pPrime.reset();
646
678
  }
647
- const all = this.isolateRoots(pm, polynomial, values);
648
679
  const sampleAnum = new Anum(sample);
649
680
  let lower = -1;
650
681
  let upper = -1;
@@ -668,8 +699,6 @@ export class AlgebraicManager {
668
699
  return result;
669
700
  }
670
701
 
671
- // isolate_roots(p, x2v, roots, signs): the roots, and the sign of p below, between and above
672
- // them, at a sample the unassigned variables share.
673
702
  isolateRootsWithSigns(
674
703
  pm: PolynomialManager,
675
704
  polynomial: Polynomial,
@@ -691,49 +720,53 @@ export class AlgebraicManager {
691
720
  return { roots, signs };
692
721
  }
693
722
 
694
- // Signs.
695
-
696
- // eval_sign_at: the sign of p at the values. Rational values are substituted, interval
697
- // arithmetic on the irrational ones decides most signs, and otherwise a lower bound on the
698
- // nonzero roots of the resultant with their polynomials tells zero apart.
699
723
  evalSignAt(pm: PolynomialManager, polynomial: Polynomial, values: readonly (Anum | undefined)[]) {
700
724
  while (true) {
701
725
  const rationalValues = getRationalValues(values);
702
- if (pm.getVars(polynomial).every((variable) => rationalValues[variable] !== undefined))
703
- return pm.getSign(polynomial, rationalValues);
704
- const reduced = pm.substituteRational(polynomial, rationalValues);
705
- if (reduced.size === 0) return 0;
706
- if (pm.isConst(reduced)) return reduced.as[0] > 0n ? 1 : -1;
707
- const xs = pm.getVars(reduced);
708
- const getInterval = (variable: number) => {
709
- const cell = getCell(values[variable]);
710
- return { lower: cell.lower, upper: cell.upper };
711
- };
712
- const evaluate = () => pm.evaluateWith(reduced, INTERVAL_OPS, getInterval);
713
- let interval = evaluate();
714
- let isRestarted = false;
715
- while (true) {
716
- if (!containsZero(interval)) return interval.lower.isNeg ? -1 : 1;
717
- let isRefined = false;
718
- for (const variable of xs) {
719
- const value = getAssigned(values, variable);
720
- if (this.getCellMagnitude(getCell(value)) <= MIN_MAGNITUDE) continue;
721
- if (!this.refine(value)) {
722
- isRestarted = true;
723
- break;
726
+ const rationalSign = pm.getRationalSign(polynomial, rationalValues);
727
+ if (rationalSign !== null) return rationalSign;
728
+ const pPrime = new PolynomialRef(pm);
729
+ try {
730
+ pPrime.set(pm.substituteRational(polynomial, rationalValues));
731
+ const reduced = pPrime.get();
732
+ if (reduced.size === 0) return 0;
733
+ if (pm.isConst(reduced)) return reduced.as[0] > 0n ? 1 : -1;
734
+ const xs = pm.getVars(reduced);
735
+ const getInterval = (variable: number) => {
736
+ const cell = getCell(values[variable]);
737
+ return { lower: cell.lower, upper: cell.upper };
738
+ };
739
+ const evaluate = () => pm.evaluateWith(reduced, INTERVAL_OPS, getInterval);
740
+ let interval: BqInterval;
741
+ let isRestarted = false;
742
+ while (true) {
743
+ this.limit.checkpoint();
744
+ interval = evaluate();
745
+ if (!containsZero(interval)) return interval.lower.isNeg ? -1 : 1;
746
+ let isRefined = false;
747
+ for (const variable of xs) {
748
+ const value = getAssigned(values, variable);
749
+ if (this.getCellMagnitude(getCell(value)) <= MIN_MAGNITUDE) continue;
750
+ if (!this.refine(value)) {
751
+ isRestarted = true;
752
+ break;
753
+ }
754
+ isRefined = true;
724
755
  }
725
- isRefined = true;
756
+ if (!isRefined || isRestarted) break;
757
+ }
758
+ if (isRestarted) {
759
+ this.limit.checkpoint();
760
+ continue;
726
761
  }
727
- if (!isRefined || isRestarted) break;
728
- interval = evaluate();
762
+ const sign = this.evalSignByResultant(pm, reduced, values, xs, interval, evaluate);
763
+ if (sign !== null) return sign;
764
+ } finally {
765
+ pPrime.reset();
729
766
  }
730
- if (isRestarted) continue;
731
- const sign = this.evalSignByResultant(pm, reduced, values, xs, interval, evaluate);
732
- if (sign !== null) return sign;
733
767
  }
734
768
  }
735
769
 
736
- // The resultant step of eval_sign_at, or null when a value turned rational and it restarts.
737
770
  private evalSignByResultant(
738
771
  pm: PolynomialManager,
739
772
  reduced: Polynomial,
@@ -743,14 +776,23 @@ export class AlgebraicManager {
743
776
  evaluate: () => BqInterval,
744
777
  ) {
745
778
  const sorted = this.sortByDegree(xs, values);
746
- let resultant = this.pm.sub(this.pm.mkVar(Math.max(...xs) + 1), this.convert(pm, reduced));
747
- for (const variable of sorted)
748
- resultant = this.pm.resultant(
749
- resultant,
750
- this.pm.fromCoeffs(getCell(values[variable]).p, variable),
751
- variable,
752
- );
753
- const k = this.um.nonzeroRootLowerBound(this.pm.toCoeffs(resultant));
779
+ const yp = new PolynomialRef(this.pm);
780
+ const pPrimeAux = new PolynomialRef(this.pm);
781
+ const r = new PolynomialRef(this.pm);
782
+ const qi = new PolynomialRef(this.pm);
783
+ yp.set(this.pm.mkVar(Math.max(...xs) + 1));
784
+ pPrimeAux.set(this.convert(pm, reduced));
785
+ r.set(this.pm.sub(yp.get(), pPrimeAux.get()));
786
+ for (const variable of sorted) {
787
+ this.limit.checkpoint();
788
+ qi.set(this.pm.toPolynomial(getCell(values[variable]).p, variable));
789
+ this.pm.resultant(r.get(), qi.get(), variable, r);
790
+ }
791
+ const k = this.um.nonzeroRootLowerBound(this.pm.toCoeffs(r.get()));
792
+ qi.reset();
793
+ r.reset();
794
+ pPrimeAux.reset();
795
+ yp.reset();
754
796
  const bound = Mpbq.of(1n, k);
755
797
  const isInsideBound = (interval: BqInterval) =>
756
798
  bound.neg().compare(interval.lower) < 0 && interval.upper.compare(bound) < 0;
@@ -758,6 +800,7 @@ export class AlgebraicManager {
758
800
  const saved = sorted.map((variable) => this.saveInterval(getAssigned(values, variable)));
759
801
  let sign: number | null = null;
760
802
  while (sign === null) {
803
+ this.limit.checkpoint();
761
804
  const interval = evaluate();
762
805
  if (!containsZero(interval)) sign = interval.lower.isNeg ? -1 : 1;
763
806
  else if (isInsideBound(interval)) sign = 0;
@@ -767,8 +810,6 @@ export class AlgebraicManager {
767
810
  return sign;
768
811
  }
769
812
 
770
- // Arithmetic.
771
-
772
813
  add(first: Anum, second: Anum): Anum {
773
814
  if (this.isZero(first)) return this.copy(second);
774
815
  if (this.isZero(second)) return this.copy(first);
@@ -780,7 +821,6 @@ export class AlgebraicManager {
780
821
  return this.mkBinary(first, second, true);
781
822
  }
782
823
 
783
- // add(cell, basic): p(x - b), with the interval shifted by b.
784
824
  private addRational(cell: AlgebraicCell, value: Rational) {
785
825
  const p = this.um.translateQ(cell.p, value.neg());
786
826
  const shift = Mpbq.fromRational(value);
@@ -806,7 +846,6 @@ export class AlgebraicManager {
806
846
  return this.mkBinary(first, second, false);
807
847
  }
808
848
 
809
- // mul(cell, basic): b^n * p(x/b), with the interval scaled by b.
810
849
  private mulRational(cell: AlgebraicCell, value: Rational) {
811
850
  const p = this.um.composePQX(cell.p, Rational.one.div(value));
812
851
  const scale = Mpbq.fromRational(value);
@@ -830,7 +869,6 @@ export class AlgebraicManager {
830
869
  return result;
831
870
  }
832
871
 
833
- // neg: p(-x) with the interval mirrored, in place.
834
872
  neg(anum: Anum) {
835
873
  if (anum.value instanceof Rational) {
836
874
  anum.value = anum.value.neg();
@@ -843,7 +881,6 @@ export class AlgebraicManager {
843
881
  this.updateSignLower(cell);
844
882
  }
845
883
 
846
- // refine_nz_bound: moves an interval end off zero, halving it until its sign is right.
847
884
  private refineNonzeroBound(anum: Anum) {
848
885
  if (anum.value instanceof Rational) return;
849
886
  const cell = anum.value;
@@ -864,7 +901,6 @@ export class AlgebraicManager {
864
901
  }
865
902
  }
866
903
 
867
- // inv: x^n * p(1/x), with the interval (1/u, 1/l), in place.
868
904
  inv(anum: Anum) {
869
905
  if (this.isZero(anum)) throw new SmtInvariantError("division by zero");
870
906
  this.refineNonzeroBound(anum);
@@ -894,7 +930,7 @@ export class AlgebraicManager {
894
930
 
895
931
  power(anum: Anum, exponent: number): Anum {
896
932
  if (exponent === 0) {
897
- if (this.isZero(anum)) throw new SmtInvariantError("0^0 is indeterminate");
933
+ if (this.isZero(anum)) throw new SmtDefaultError("0^0 is indeterminate");
898
934
  return new Anum(Rational.one);
899
935
  }
900
936
  if (exponent === 1) return this.copy(anum);
@@ -902,20 +938,120 @@ export class AlgebraicManager {
902
938
  return this.mkPower(anum, exponent);
903
939
  }
904
940
 
905
- // mk_add_polynomial: Res_y(pa(x - y), pb(y)), which has a + b as a root.
941
+ root(anum: Anum, k: number): Anum {
942
+ if (k === 0) throw new SmtDefaultError("0-th root is indeterminate");
943
+ if (k === 1 || this.isZero(anum)) return this.copy(anum);
944
+ if (this.isNeg(anum) && k % 2 === 0)
945
+ throw new SmtDefaultError("even root of negative number is not real");
946
+ if (anum.value instanceof Rational) return this.rootRational(anum.value, k);
947
+ return this.mkRoot(anum, k);
948
+ }
949
+
950
+ private rootRational(value: Rational, k: number) {
951
+ const exact = value.root(k);
952
+ if (exact !== undefined) return new Anum(exact);
953
+ const p = [-value.num, ...Array.from({ length: k - 1 }, () => 0n), value.den];
954
+ const converted = Mpbq.fromRational(value);
955
+ const bound = converted.isExact ? converted.value : converted.value.mul2k(1);
956
+ return value.isNegative()
957
+ ? this.mkAnum(p, bound.sub(Mpbq.one), Mpbq.zero, false)
958
+ : this.mkAnum(p, Mpbq.zero, bound.add(Mpbq.one), false);
959
+ }
960
+
961
+ // Res_y(x^k - y, p(y)) has a^(1/k) as a root.
962
+ private mkRoot(anum: Anum, k: number): Anum {
963
+ const cell = getCell(anum);
964
+ const factored = this.factor(this.getResultantCoeffs(this.getVarDifference(k, 1), cell.p));
965
+ const factors = factored.factors.factors;
966
+ const sequences: (Upolynomial[] | null)[] = factors.map((factor) => this.um.sturmSeq(factor));
967
+ const saved = this.saveInterval(anum);
968
+ while (true) {
969
+ this.limit.checkpoint();
970
+ const interval = { lower: cell.lower.rootLower(k), upper: cell.upper.rootUpper(k) };
971
+ const found = this.findIsolatingFactor(factors, sequences, interval);
972
+ if (found !== null) {
973
+ this.restoreIfTooSmall(saved);
974
+ return this.setCore(found, interval, factored.isComplete);
975
+ }
976
+ if (!this.refine(anum)) {
977
+ this.restoreIfTooSmall(saved);
978
+ return this.root(anum, k);
979
+ }
980
+ }
981
+ }
982
+
983
+ getPolynomial(anum: Anum) {
984
+ return anum.value instanceof Rational ? [-anum.value.num, anum.value.den] : [...anum.value.p];
985
+ }
986
+
987
+ getIsolatingInterval(anum: Anum): [Rational, Rational] {
988
+ if (anum.value instanceof Rational) return [anum.value, anum.value];
989
+ return [anum.value.lower.toRational(), anum.value.upper.toRational()];
990
+ }
991
+
992
+ getInterval(anum: Anum, precision: number): [Rational, Rational] {
993
+ if (anum.value instanceof Rational) return [anum.value, anum.value];
994
+ const cell = anum.value;
995
+ const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
996
+ return [refined.lower.toRational(), refined.upper.toRational()];
997
+ }
998
+
999
+ displayRootSmt2(anum: Anum) {
1000
+ if (this.isZero(anum)) return "(root-obj x 1)";
1001
+ if (anum.value instanceof Rational)
1002
+ return `(root-obj ${getUpolynomialSmt2([-anum.value.num, anum.value.den])} 1)`;
1003
+ return `(root-obj ${getUpolynomialSmt2(anum.value.p)} ${this.getRootIndex(anum)})`;
1004
+ }
1005
+
1006
+ displayDecimal(anum: Anum, precision: number) {
1007
+ if (anum.value instanceof Rational) return getRationalDecimal(anum.value, precision);
1008
+ const cell = anum.value;
1009
+ const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
1010
+ return (refined.isInterval ? refined.upper : refined.lower).toDecimal(precision);
1011
+ }
1012
+
1013
+ private getResultantCoeffs(first: PolynomialRef, p: Upolynomial) {
1014
+ const q = new PolynomialRef(this.pm);
1015
+ const r = new PolynomialRef(this.pm);
1016
+ q.set(this.pm.toPolynomial(p, Y));
1017
+ this.pm.resultant(first.get(), q.get(), Y, r);
1018
+ const coeffs = this.pm.toCoeffs(r.get());
1019
+ r.reset();
1020
+ q.reset();
1021
+ first.reset();
1022
+ return coeffs;
1023
+ }
1024
+
1025
+ private getVarDifference(xDegree: number, yDegree: number) {
1026
+ const x = new PolynomialRef(this.pm);
1027
+ const y = new PolynomialRef(this.pm);
1028
+ const difference = new PolynomialRef(this.pm);
1029
+ x.set(this.pm.mkVar(X, xDegree));
1030
+ y.set(this.pm.mkVar(Y, yDegree));
1031
+ difference.set(this.pm.sub(x.get(), y.get()));
1032
+ y.reset();
1033
+ x.reset();
1034
+ return difference;
1035
+ }
1036
+
906
1037
  private getSumPolynomial(first: AlgebraicCell, second: AlgebraicCell) {
907
- const pa = this.pm.composeXMinusY(this.pm.fromCoeffs(first.p, X), Y);
908
- return this.pm.toCoeffs(this.pm.resultant(pa, this.pm.fromCoeffs(second.p, Y), Y));
1038
+ const p = new PolynomialRef(this.pm);
1039
+ const composed = new PolynomialRef(this.pm);
1040
+ p.set(this.pm.toPolynomial(first.p, X));
1041
+ this.pm.composeXMinusY(p.get(), Y, composed);
1042
+ p.reset();
1043
+ return this.getResultantCoeffs(composed, second.p);
909
1044
  }
910
1045
 
911
- // mk_mul_polynomial: Res_y(y^n * pa(x/y), pb(y)), which has a*b as a root.
912
1046
  private getProductPolynomial(first: AlgebraicCell, second: AlgebraicCell) {
913
- const pa = this.pm.composeXDivY(this.pm.fromCoeffs(first.p, X), Y);
914
- return this.pm.toCoeffs(this.pm.resultant(pa, this.pm.fromCoeffs(second.p, Y), Y));
1047
+ const p = new PolynomialRef(this.pm);
1048
+ const composed = new PolynomialRef(this.pm);
1049
+ p.set(this.pm.toPolynomial(first.p, X));
1050
+ composed.set(this.pm.composeXDivY(p.get(), Y));
1051
+ p.reset();
1052
+ return this.getResultantCoeffs(composed, second.p);
915
1053
  }
916
1054
 
917
- // The factors of p whose Sturm sequence counts exactly one root in an interval, until only one
918
- // factor is left.
919
1055
  private findIsolatingFactor(
920
1056
  factors: bigint[][],
921
1057
  sequences: (Upolynomial[] | null)[],
@@ -945,8 +1081,6 @@ export class AlgebraicManager {
945
1081
  : null;
946
1082
  }
947
1083
 
948
- // mk_binary: a + b or a*b for irrational a and b, refining both until the interval of the result
949
- // isolates a root of one factor of the resultant.
950
1084
  private mkBinary(first: Anum, second: Anum, isAdd: boolean) {
951
1085
  const cellA = getCell(first);
952
1086
  const cellB = getCell(second);
@@ -958,6 +1092,7 @@ export class AlgebraicManager {
958
1092
  const savedA = this.saveInterval(first);
959
1093
  const savedB = this.saveInterval(second);
960
1094
  while (true) {
1095
+ this.limit.checkpoint();
961
1096
  const interval = isAdd ? INTERVAL_OPS.add(cellA, cellB) : INTERVAL_OPS.mul(cellA, cellB);
962
1097
  const found = this.findIsolatingFactor(factors, sequences, interval);
963
1098
  if (found !== null) {
@@ -976,13 +1111,10 @@ export class AlgebraicManager {
976
1111
  }
977
1112
  }
978
1113
 
979
- // mk_power_polynomial: Res_y(x - y^k, pa(y)), which has a^k as a root.
980
1114
  private getPowerPolynomial(cell: AlgebraicCell, exponent: number) {
981
- const x = this.pm.sub(this.pm.mkVar(X), this.pm.mkVar(Y, exponent));
982
- return this.pm.toCoeffs(this.pm.resultant(x, this.pm.fromCoeffs(cell.p, Y), Y));
1115
+ return this.getResultantCoeffs(this.getVarDifference(1, exponent), cell.p);
983
1116
  }
984
1117
 
985
- // mk_unary with mk_power_polynomial: a^k for an irrational a.
986
1118
  private mkPower(anum: Anum, exponent: number): Anum {
987
1119
  const cell = getCell(anum);
988
1120
  const factored = this.factor(this.getPowerPolynomial(cell, exponent));
@@ -990,6 +1122,7 @@ export class AlgebraicManager {
990
1122
  const sequences: (Upolynomial[] | null)[] = factors.map((factor) => this.um.sturmSeq(factor));
991
1123
  const saved = this.saveInterval(anum);
992
1124
  while (true) {
1125
+ this.limit.checkpoint();
993
1126
  const interval = getIntervalPower(cell, exponent);
994
1127
  const found = this.findIsolatingFactor(factors, sequences, interval);
995
1128
  if (found !== null) {
@@ -1003,7 +1136,6 @@ export class AlgebraicManager {
1003
1136
  }
1004
1137
  }
1005
1138
 
1006
- // set_core: the root of p in an isolating interval that may contain zero.
1007
1139
  private setCore(found: IsolatingFactor, interval: BqInterval, isMinimal: boolean) {
1008
1140
  const p = found.factor;
1009
1141
  let lower = interval.lower;
@@ -1019,9 +1151,6 @@ export class AlgebraicManager {
1019
1151
  return this.mkAnum(nonzero, refined.lower, refined.upper, isMinimal);
1020
1152
  }
1021
1153
 
1022
- // Comparison.
1023
-
1024
- // compare(cell, b): by the interval, or by the sign of p at b.
1025
1154
  private compareRational(cell: AlgebraicCell, value: Rational) {
1026
1155
  if (cell.upper.compareRational(value) <= 0) return -1;
1027
1156
  if (cell.lower.compareRational(value) >= 0) return 1;
@@ -1039,8 +1168,6 @@ export class AlgebraicManager {
1039
1168
  return this.compareCore(first, second);
1040
1169
  }
1041
1170
 
1042
- // compare_core: refines both intervals to a common magnitude, then tries a wider separation, and
1043
- // last the sign of pb at a by a Sturm-Tarski sequence.
1044
1171
  private compareCore(first: Anum, second: Anum): number {
1045
1172
  const cellA = getCell(first);
1046
1173
  const cellB = getCell(second);
@@ -1048,14 +1175,15 @@ export class AlgebraicManager {
1048
1175
  cellA.upper.compare(cellB.lower) <= 0 ? -1 : cellA.lower.compare(cellB.upper) >= 0 ? 1 : 0;
1049
1176
  let sign = compareIntervals();
1050
1177
  if (sign !== 0) return sign;
1051
- if (sameCoeffs(cellA.p, cellB.p)) return 0;
1178
+ if (hasSameCoeffs(cellA.p, cellB.p)) return 0;
1052
1179
  if (cellA.isMinimal && cellB.isMinimal)
1053
- while (true) {
1180
+ while (this.limit.inc()) {
1054
1181
  this.refine(first);
1055
1182
  this.refine(second);
1056
1183
  sign = compareIntervals();
1057
1184
  if (sign !== 0) return sign;
1058
1185
  }
1186
+ if (!this.limit.inc()) throw new SmtCanceledError();
1059
1187
  const magnitudeA = this.getCellMagnitude(cellA);
1060
1188
  const magnitudeB = this.getCellMagnitude(cellB);
1061
1189
  const target = Math.max(MIN_MAGNITUDE, Math.min(magnitudeA, magnitudeB));
@@ -1074,7 +1202,6 @@ export class AlgebraicManager {
1074
1202
  sign = compareIntervals();
1075
1203
  if (sign !== 0) return sign;
1076
1204
  }
1077
- // get_interval at precision 10: copies of the intervals refined below 1/2^40.
1078
1205
  const intervalA = this.um.refineToPrecision(cellA.p, cellA.lower, cellA.upper, 40);
1079
1206
  const intervalB = this.um.refineToPrecision(cellB.p, cellB.lower, cellB.upper, 40);
1080
1207
  if (intervalA.isInterval && intervalB.isInterval) {
@@ -1093,9 +1220,6 @@ export class AlgebraicManager {
1093
1220
  return variations < 0 === cellB.signLower < 0 ? -1 : 1;
1094
1221
  }
1095
1222
 
1096
- // Sample points.
1097
-
1098
- // int_lt: an integer below a.
1099
1223
  intLt(anum: Anum) {
1100
1224
  this.refineUntilPrecision(anum, 1);
1101
1225
  return new Anum(
@@ -1105,7 +1229,6 @@ export class AlgebraicManager {
1105
1229
  );
1106
1230
  }
1107
1231
 
1108
- // int_gt: an integer above a.
1109
1232
  intGt(anum: Anum) {
1110
1233
  this.refineUntilPrecision(anum, 1);
1111
1234
  return new Anum(
@@ -1115,7 +1238,6 @@ export class AlgebraicManager {
1115
1238
  );
1116
1239
  }
1117
1240
 
1118
- // separate: refines until the intervals of prev and curr do not touch.
1119
1241
  private separate(previous: Anum, current: Anum) {
1120
1242
  if (previous.value instanceof Rational) {
1121
1243
  const value = previous.value;
@@ -1145,14 +1267,13 @@ export class AlgebraicManager {
1145
1267
  }
1146
1268
  }
1147
1269
 
1148
- // select: a binary rational between prev < curr with the smallest denominator.
1149
1270
  select(previous: Anum, current: Anum) {
1150
1271
  this.separate(previous, current);
1151
- const lower: SelectEnd =
1272
+ const lower =
1152
1273
  previous.value instanceof Rational
1153
1274
  ? { value: previous.value, isOpen: true }
1154
1275
  : { value: previous.value.upper.toRational(), isOpen: false };
1155
- const upper: SelectEnd =
1276
+ const upper =
1156
1277
  current.value instanceof Rational
1157
1278
  ? { value: current.value, isOpen: true }
1158
1279
  : { value: current.value.lower.toRational(), isOpen: false };