tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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 (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  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 +109 -10
  8. package/dist/index.d.ts +109 -10
  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 +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -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 +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  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 +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  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 +119 -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 +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  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 +224 -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 +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  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 +31 -74
  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 +1 -44
  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 +0 -2
  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 +1026 -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 +615 -53
  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 +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,15 +1,9 @@
1
- // Ported from Z3 (src/math/polynomial/upolynomial.{h,cpp}, src/util/mpzzp.h,
2
- // src/math/polynomial/polynomial_primes.h), MIT license, see z3-license.txt. Univariate
3
- // polynomials with integer coefficients, as coefficient arrays from the constant term up with no
4
- // leading zeros, over Z or over Z_p. Root isolation by Descartes' rule of signs, Sturm sequences
5
- // and refinement of isolating intervals with binary rational endpoints.
6
1
  import { SmtInvariantError } from "../../../../errors";
7
2
  import { getGcd, Rational } from "../rational";
8
3
  import { getLog2, Mpbq, refineLower, refineUpper } from "./mpbq";
9
4
 
10
5
  export type Upolynomial = readonly bigint[];
11
6
 
12
- // g_big_primes: the primes mod_gcd tries, in order.
13
7
  const BIG_PRIMES = [
14
8
  39103, 39107, 39113, 39119, 39133, 39139, 39157, 39161, 39163, 39181, 39191, 39199, 39209, 39217,
15
9
  39227, 39229, 39233, 39239, 39241, 39251, 39293, 39301, 39313, 39317, 39323, 39341, 39343, 39359,
@@ -30,15 +24,13 @@ const BIG_PRIMES = [
30
24
  41507, 41513, 41519, 41521, 41539, 41543, 41549,
31
25
  ].map(BigInt);
32
26
 
33
- const sign = (value: bigint) => (value > 0n ? 1 : value < 0n ? -1 : 0);
27
+ const getSign = (value: bigint) => (value > 0n ? 1 : value < 0n ? -1 : 0);
34
28
 
35
- // mpz div: rounds toward minus infinity.
36
- const floorDiv = (dividend: bigint, divisor: bigint) => {
29
+ export const floorDiv = (dividend: bigint, divisor: bigint) => {
37
30
  const quotient = dividend / divisor;
38
31
  return dividend % divisor !== 0n && dividend < 0n !== divisor < 0n ? quotient - 1n : quotient;
39
32
  };
40
33
 
41
- // mpz gcd(a, b, x, y, g): a*x + b*y = g.
42
34
  const getExtendedGcd = (first: bigint, second: bigint) => {
43
35
  let [oldR, r] = [first, second];
44
36
  let [oldS, s] = [1n, 0n];
@@ -65,7 +57,6 @@ interface IsolatedRoots {
65
57
  uppers: Mpbq[];
66
58
  }
67
59
 
68
- // An interval (a, b) refined around the root of a square-free polynomial, or the root itself.
69
60
  interface Refinement {
70
61
  isInterval: boolean;
71
62
  lower: Mpbq;
@@ -80,8 +71,6 @@ interface DrsFrame {
80
71
  }
81
72
 
82
73
  export class UpolynomialManager {
83
- // Z_p when set, else Z. Coefficients over Z_p lie in the symmetric range around zero. Hensel
84
- // lifting also sets a prime power.
85
74
  private isPrimeModulus = true;
86
75
 
87
76
  constructor(private modulus: bigint | null = null) {}
@@ -90,25 +79,21 @@ export class UpolynomialManager {
90
79
  return this.modulus;
91
80
  }
92
81
 
93
- // field: Z_p for a prime p. Over a prime power, division falls back to pseudo-division.
94
82
  private get isField() {
95
83
  return this.modulus !== null && this.isPrimeModulus;
96
84
  }
97
85
 
98
- // set_zp
99
86
  setZp(prime: bigint) {
100
87
  this.modulus = prime;
101
88
  this.isPrimeModulus = true;
102
89
  }
103
90
 
104
- // set_p_sq: from Z_m to Z_(m^2).
105
91
  squareModulus() {
106
92
  if (this.modulus === null) throw new SmtInvariantError("squaring the modulus of Z");
107
93
  this.modulus *= this.modulus;
108
94
  this.isPrimeModulus = false;
109
95
  }
110
96
 
111
- // scoped_set_zp
112
97
  withZp<T>(prime: bigint, body: () => T) {
113
98
  const savedModulus = this.modulus;
114
99
  const savedIsPrime = this.isPrimeModulus;
@@ -119,9 +104,6 @@ export class UpolynomialManager {
119
104
  return result;
120
105
  }
121
106
 
122
- // Numerals.
123
-
124
- // p_normalize
125
107
  normalizeNumeral(value: bigint) {
126
108
  const modulus = this.modulus;
127
109
  if (modulus === null) return value;
@@ -137,7 +119,6 @@ export class UpolynomialManager {
137
119
  return this.normalizeNumeral(getExtendedGcd(this.normalizeNumeral(value), modulus).x);
138
120
  }
139
121
 
140
- // mpzzp div: exact over Z (rounding toward minus infinity), multiplication by the inverse over Z_p.
141
122
  private divNumeral(dividend: bigint, divisor: bigint) {
142
123
  return this.modulus === null
143
124
  ? floorDiv(dividend, divisor)
@@ -149,13 +130,10 @@ export class UpolynomialManager {
149
130
  return divisor === 0n ? dividend === 0n : dividend % divisor === 0n;
150
131
  }
151
132
 
152
- // set: the coefficients reduced to the current ring.
153
133
  set(coeffs: Upolynomial) {
154
134
  return trim(coeffs.map((coeff) => this.normalizeNumeral(coeff)));
155
135
  }
156
136
 
157
- // Core operations.
158
-
159
137
  getContent(coeffs: Upolynomial) {
160
138
  let content = 0n;
161
139
  for (const coeff of coeffs) content = getGcd(content, coeff);
@@ -208,7 +186,6 @@ export class UpolynomialManager {
208
186
  return trim(coeffs.map((coeff) => this.normalizeNumeral(coeff * factor)));
209
187
  }
210
188
 
211
- // div(p, b): each coefficient divided by b, which divides it.
212
189
  divConst(coeffs: Upolynomial, divisor: bigint) {
213
190
  if (divisor === 1n) return [...coeffs];
214
191
  return trim(coeffs.map((coeff) => this.divNumeral(coeff, divisor)));
@@ -221,7 +198,6 @@ export class UpolynomialManager {
221
198
  );
222
199
  }
223
200
 
224
- // normalize: the coefficients divided by their gcd, or the sign of a constant.
225
201
  normalize(coeffs: Upolynomial) {
226
202
  if (coeffs.length === 0) return [];
227
203
  if (coeffs.length === 1) return [coeffs[0] > 0n ? 1n : this.normalizeNumeral(-1n)];
@@ -234,7 +210,6 @@ export class UpolynomialManager {
234
210
  return coeffs.length > 0 && coeffs[coeffs.length - 1] < 0n ? this.neg(coeffs) : [...coeffs];
235
211
  }
236
212
 
237
- // mk_monic: the polynomial divided by its leading coefficient, over Z_p.
238
213
  mkMonic(coeffs: Upolynomial) {
239
214
  if (coeffs.length === 0 || coeffs[coeffs.length - 1] === 1n) return [...coeffs];
240
215
  const inverse = this.inv(coeffs[coeffs.length - 1]);
@@ -243,7 +218,6 @@ export class UpolynomialManager {
243
218
  );
244
219
  }
245
220
 
246
- // div_rem: q and r with lc(p2)^d * p1 = q * p2 + r over Z, or p1 = q * p2 + r over a field.
247
221
  divRem(dividend: Upolynomial, divisor: Upolynomial) {
248
222
  const isField = this.isField;
249
223
  if (divisor.length === 1) {
@@ -290,7 +264,6 @@ export class UpolynomialManager {
290
264
  return this.divRem(dividend, divisor).quotient;
291
265
  }
292
266
 
293
- // rem: the pseudo-remainder, with the number of pseudo-division steps.
294
267
  remWithPower(dividend: Upolynomial, divisor: Upolynomial) {
295
268
  if (divisor.length === 1) return { remainder: [] as bigint[], power: 0 };
296
269
  const remainder = this.set(dividend);
@@ -327,8 +300,6 @@ export class UpolynomialManager {
327
300
  return this.remWithPower(dividend, divisor).remainder;
328
301
  }
329
302
 
330
- // srem: the signed pseudo-remainder, negated unless an odd number of steps by a negative leading
331
- // coefficient already flipped it.
332
303
  srem(dividend: Upolynomial, divisor: Upolynomial) {
333
304
  const result = this.remWithPower(dividend, divisor);
334
305
  return result.power % 2 === 0 || (divisor.length > 0 && divisor[divisor.length - 1] > 0n)
@@ -336,7 +307,6 @@ export class UpolynomialManager {
336
307
  : result.remainder;
337
308
  }
338
309
 
339
- // divides: whether divisor divides dividend, checking only the leading coefficients.
340
310
  divides(dividend: Upolynomial, divisor: Upolynomial) {
341
311
  if (divisor.length === 0) return false;
342
312
  if (dividend.length === 0) return true;
@@ -356,7 +326,6 @@ export class UpolynomialManager {
356
326
  return true;
357
327
  }
358
328
 
359
- // exact_div: dividend / divisor when the division is exact, else null.
360
329
  exactDiv(dividend: Upolynomial, divisor: Upolynomial): bigint[] | null {
361
330
  if (divisor.length === 0) return null;
362
331
  if (dividend.length === 0) return [];
@@ -383,8 +352,6 @@ export class UpolynomialManager {
383
352
  return trim(result);
384
353
  }
385
354
 
386
- // GCD.
387
-
388
355
  private euclidGcd(first: Upolynomial, second: Upolynomial) {
389
356
  if (first.length === 0) return this.flipSignIfLmNeg(this.set(second));
390
357
  if (second.length === 0) return this.flipSignIfLmNeg(this.set(first));
@@ -399,7 +366,6 @@ export class UpolynomialManager {
399
366
  return this.isField ? this.mkMonic(normalized) : this.flipSignIfLmNeg(normalized);
400
367
  }
401
368
 
402
- // CRA_combine_images: the image modulo bound * prime, in the symmetric range.
403
369
  private combineImages(image: Upolynomial, prime: bigint, combined: Upolynomial, bound: bigint) {
404
370
  const inverses = getExtendedGcd(prime, bound);
405
371
  const mod = (value: bigint, modulus: bigint) => ((value % modulus) + modulus) % modulus;
@@ -421,7 +387,6 @@ export class UpolynomialManager {
421
387
  return { coeffs: result, bound: newBound };
422
388
  }
423
389
 
424
- // mod_gcd: the gcd over Z from images modulo big primes, combined by the Chinese remainder theorem.
425
390
  private modGcd(first: Upolynomial, second: Upolynomial) {
426
391
  const contentU = this.getContent(first);
427
392
  const contentV = this.getContent(second);
@@ -442,8 +407,6 @@ export class UpolynomialManager {
442
407
  });
443
408
  if (image === null) continue;
444
409
  if (image.length <= 1) return [contentG];
445
- // The first image, or one of lower degree, replaces the accumulated image. Before the first
446
- // image the bound is zero, which is even.
447
410
  if (image.length < combined.length || bound % 2n === 0n) {
448
411
  combined = image;
449
412
  bound = prime;
@@ -469,7 +432,6 @@ export class UpolynomialManager {
469
432
  return this.modulus === null ? this.modGcd(first, second) : this.euclidGcd(first, second);
470
433
  }
471
434
 
472
- // square_free: p divided by gcd(p, p'), normalized.
473
435
  squareFree(coeffs: Upolynomial) {
474
436
  if (coeffs.length <= 1) return this.set(coeffs);
475
437
  const common = this.gcd(coeffs, this.derivative(coeffs));
@@ -487,7 +449,6 @@ export class UpolynomialManager {
487
449
  return result;
488
450
  }
489
451
 
490
- // ext_gcd over Z_p: u, v and the monic d with a*u + b*v = d.
491
452
  extGcd(first: Upolynomial, second: Upolynomial) {
492
453
  let u: bigint[] = [1n];
493
454
  let d = this.mkMonic(this.set(first));
@@ -511,8 +472,6 @@ export class UpolynomialManager {
511
472
  };
512
473
  }
513
474
 
514
- // Transformations.
515
-
516
475
  hasZeroRoots(coeffs: Upolynomial) {
517
476
  return coeffs.length > 0 && coeffs[0] === 0n;
518
477
  }
@@ -523,7 +482,6 @@ export class UpolynomialManager {
523
482
  return coeffs.slice(index);
524
483
  }
525
484
 
526
- // has_one_half_root: 2^n * p(1/2) = 0.
527
485
  private hasOneHalfRoot(coeffs: Upolynomial) {
528
486
  if (coeffs.length === 0) return true;
529
487
  if (coeffs.length === 1) return false;
@@ -533,7 +491,6 @@ export class UpolynomialManager {
533
491
  return result === 0n;
534
492
  }
535
493
 
536
- // descartes_bound_0_1: the sign changes of (x+1)^n p(1/(x+1)), stopping above 1.
537
494
  private descartesBound01(coeffs: Upolynomial) {
538
495
  if (coeffs.length <= 1) return 0;
539
496
  const work = [...coeffs];
@@ -542,7 +499,7 @@ export class UpolynomialManager {
542
499
  for (let index = 0; index < work.length; index++) {
543
500
  let position = 1;
544
501
  for (; position < work.length - index; position++) work[position] += work[position - 1];
545
- const current = sign(work[position - 1]);
502
+ const current = getSign(work[position - 1]);
546
503
  if (current === 0) continue;
547
504
  if (current !== previous && previous !== 0) {
548
505
  changes++;
@@ -553,7 +510,6 @@ export class UpolynomialManager {
553
510
  return changes;
554
511
  }
555
512
 
556
- // translate: p(x + 1).
557
513
  translate(coeffs: Upolynomial) {
558
514
  const result = [...coeffs];
559
515
  const degree = result.length - 1;
@@ -563,7 +519,6 @@ export class UpolynomialManager {
563
519
  return result;
564
520
  }
565
521
 
566
- // translate_q: den^n * p(x + q).
567
522
  translateQ(coeffs: Upolynomial, value: Rational) {
568
523
  if (coeffs.length <= 1) return [...coeffs];
569
524
  const result = this.composeAnPxDivA(coeffs, value.den);
@@ -577,28 +532,23 @@ export class UpolynomialManager {
577
532
  return result;
578
533
  }
579
534
 
580
- // compose_2n_p_x_div_2: 2^n * p(x/2).
581
535
  private compose2nPxDiv2(coeffs: Upolynomial) {
582
536
  const degree = coeffs.length - 1;
583
537
  return coeffs.map((coeff, index) => coeff << BigInt(degree - index));
584
538
  }
585
539
 
586
- // p_minus_x: p(-x).
587
540
  pMinusX(coeffs: Upolynomial) {
588
541
  return coeffs.map((coeff, index) => (index % 2 === 1 && coeff !== 0n ? -coeff : coeff));
589
542
  }
590
543
 
591
- // p_1_div_x: x^n * p(1/x).
592
544
  p1DivX(coeffs: Upolynomial) {
593
545
  return [...coeffs].reverse();
594
546
  }
595
547
 
596
- // compose_p_2k_x: p(2^k * x).
597
548
  private composeP2kX(coeffs: Upolynomial, k: number) {
598
549
  return coeffs.map((coeff, index) => coeff << BigInt(k * index));
599
550
  }
600
551
 
601
- // compose_an_p_x_div_a: a^n * p(x/a).
602
552
  private composeAnPxDivA(coeffs: Upolynomial, factor: bigint) {
603
553
  const degree = coeffs.length - 1;
604
554
  return coeffs.map((coeff, index) =>
@@ -606,7 +556,6 @@ export class UpolynomialManager {
606
556
  );
607
557
  }
608
558
 
609
- // compose_p_q_x: c^n * p(b*x/c) for q = b/c.
610
559
  composePQX(coeffs: Upolynomial, value: Rational) {
611
560
  const degree = coeffs.length - 1;
612
561
  return coeffs.map((coeff, index) =>
@@ -614,12 +563,9 @@ export class UpolynomialManager {
614
563
  );
615
564
  }
616
565
 
617
- // Signs.
618
-
619
- // eval_sign_at for a binary rational: the sign of (2^k)^n * p(b).
620
566
  evalSignAtBq(coeffs: Upolynomial, value: Mpbq) {
621
567
  if (coeffs.length === 0) return 0;
622
- if (coeffs.length === 1) return sign(coeffs[0]);
568
+ if (coeffs.length === 1) return getSign(coeffs[0]);
623
569
  let result = coeffs[coeffs.length - 1];
624
570
  let shift = value.k;
625
571
  for (let index = coeffs.length - 2; index >= 0; index--, shift += value.k)
@@ -627,12 +573,12 @@ export class UpolynomialManager {
627
573
  coeffs[index] === 0n
628
574
  ? result * value.num
629
575
  : (coeffs[index] << BigInt(shift)) + result * value.num;
630
- return sign(result);
576
+ return getSign(result);
631
577
  }
632
578
 
633
579
  evalSignAtQ(coeffs: Upolynomial, value: Rational) {
634
580
  if (coeffs.length === 0) return 0;
635
- if (coeffs.length === 1) return sign(coeffs[0]);
581
+ if (coeffs.length === 1) return getSign(coeffs[0]);
636
582
  let result = coeffs[coeffs.length - 1];
637
583
  let denominator = value.den;
638
584
  for (let index = coeffs.length - 2; index >= 0; index--, denominator *= value.den)
@@ -640,20 +586,20 @@ export class UpolynomialManager {
640
586
  coeffs[index] === 0n
641
587
  ? result * value.num
642
588
  : coeffs[index] * denominator + result * value.num;
643
- return sign(result);
589
+ return getSign(result);
644
590
  }
645
591
 
646
592
  evalSignAtZero(coeffs: Upolynomial) {
647
- return coeffs.length === 0 ? 0 : sign(coeffs[0]);
593
+ return coeffs.length === 0 ? 0 : getSign(coeffs[0]);
648
594
  }
649
595
 
650
596
  evalSignAtPlusInf(coeffs: Upolynomial) {
651
- return coeffs.length === 0 ? 0 : sign(coeffs[coeffs.length - 1]);
597
+ return coeffs.length === 0 ? 0 : getSign(coeffs[coeffs.length - 1]);
652
598
  }
653
599
 
654
600
  evalSignAtMinusInf(coeffs: Upolynomial) {
655
601
  if (coeffs.length === 0) return 0;
656
- const leading = sign(coeffs[coeffs.length - 1]);
602
+ const leading = getSign(coeffs[coeffs.length - 1]);
657
603
  return (coeffs.length - 1) % 2 === 0 ? leading : -leading;
658
604
  }
659
605
 
@@ -685,9 +631,6 @@ export class UpolynomialManager {
685
631
  return this.countSignVariations(sequence.map((coeffs) => this.evalSignAtBq(coeffs, value)));
686
632
  }
687
633
 
688
- // Root bounds.
689
-
690
- // knuth_positive_root_upper_bound: k with every positive root below 2^k.
691
634
  knuthPositiveRootUpperBound(coeffs: Upolynomial) {
692
635
  if (coeffs.length === 0) return 0;
693
636
  let max = 0;
@@ -710,7 +653,6 @@ export class UpolynomialManager {
710
653
  return this.knuthPositiveRootUpperBound(this.pMinusX(coeffs));
711
654
  }
712
655
 
713
- // nonzero_root_lower_bound: k with every nonzero root of absolute value above 1/2^k.
714
656
  nonzeroRootLowerBound(coeffs: Upolynomial) {
715
657
  const reversed = this.removeZeroRoots(coeffs).reverse();
716
658
  return Math.max(
@@ -719,9 +661,6 @@ export class UpolynomialManager {
719
661
  );
720
662
  }
721
663
 
722
- // Root isolation by Descartes' rule of signs.
723
-
724
- // push_child_frames: the halves (0, 1/2) and (1/2, 1), as 2^n p(x/2) and its translation.
725
664
  private pushChildFrames(coeffs: Upolynomial, frames: DrsFrame[]) {
726
665
  const parent = frames.length - 1;
727
666
  const left = this.normalize(this.compose2nPxDiv2(coeffs));
@@ -734,7 +673,6 @@ export class UpolynomialManager {
734
673
  });
735
674
  }
736
675
 
737
- // The interval (0, 1), or the point 1/2, of the top frame mapped back through its ancestors.
738
676
  private mapToRoot(frames: DrsFrame[], value: Mpbq) {
739
677
  let result = value;
740
678
  for (let index = frames.length - 1; index !== -1; index = frames[index].parent)
@@ -782,8 +720,6 @@ export class UpolynomialManager {
782
720
  }
783
721
  }
784
722
 
785
- // drs_isolate_roots: the positive roots in (0, 2^k) and the negative ones in (-2^k', 0), each
786
- // found as the roots in (0, 1) of p(2^k x) or p(-2^k' x) and scaled back.
787
723
  private drsIsolateRoots(coeffs: Upolynomial, result: IsolatedRoots) {
788
724
  const normalized = this.normalize(coeffs);
789
725
  const negativeK = this.knuthNegativeRootUpperBound(coeffs);
@@ -812,8 +748,6 @@ export class UpolynomialManager {
812
748
  }
813
749
  }
814
750
 
815
- // sqf_isolate_roots: the roots of a square-free polynomial, exact roots first when zero is one,
816
- // then the isolating intervals of the others.
817
751
  sqfIsolateRoots(coeffs: Upolynomial): IsolatedRoots {
818
752
  const result: IsolatedRoots = { roots: [], lowers: [], uppers: [] };
819
753
  if (this.hasZeroRoots(coeffs)) {
@@ -823,8 +757,6 @@ export class UpolynomialManager {
823
757
  return result;
824
758
  }
825
759
 
826
- // Sturm sequences.
827
-
828
760
  private sturmSeqCore(sequence: bigint[][]) {
829
761
  while (true) {
830
762
  const remainder = this.srem(sequence[sequence.length - 2], sequence[sequence.length - 1]);
@@ -841,10 +773,6 @@ export class UpolynomialManager {
841
773
  return this.sturmSeqCore([[...first], this.mul(this.derivative(first), second)]);
842
774
  }
843
775
 
844
- // Refinement.
845
-
846
- // isolating2refinable: an isolating interval of a square-free polynomial turned into one whose
847
- // endpoint signs differ, or the root it contains.
848
776
  isolating2refinable(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq): Refinement {
849
777
  const signLower = this.evalSignAtBq(coeffs, lower);
850
778
  const signUpper = this.evalSignAtBq(coeffs, upper);
@@ -897,7 +825,6 @@ export class UpolynomialManager {
897
825
  }
898
826
  }
899
827
 
900
- // refine_core: one bisection of a refinable interval, or the root at its midpoint.
901
828
  refineCore(coeffs: Upolynomial, signLower: number, lower: Mpbq, upper: Mpbq): Refinement {
902
829
  const middle = lower.add(upper).div2();
903
830
  const signMiddle = this.evalSignAtBq(coeffs, middle);
@@ -907,11 +834,6 @@ export class UpolynomialManager {
907
834
  : { isInterval: true, lower, upper: middle };
908
835
  }
909
836
 
910
- refine(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq) {
911
- return this.refineCore(coeffs, this.evalSignAtBq(coeffs, lower), lower, upper);
912
- }
913
-
914
- // refine_core with a precision: bisects until the interval is narrower than 1/2^k.
915
837
  refineToPrecision(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq, precision: number): Refinement {
916
838
  const signLower = this.evalSignAtBq(coeffs, lower);
917
839
  let current: Refinement = { isInterval: true, lower, upper };
@@ -922,8 +844,6 @@ export class UpolynomialManager {
922
844
  }
923
845
  }
924
846
 
925
- // convert_q2bq_interval: a rational isolating interval (a, b) as a binary rational one (c, d), or
926
- // the root itself in c.
927
847
  convertQ2bqInterval(coeffs: Upolynomial, a: Rational, b: Rational): Refinement {
928
848
  const signA = this.evalSignAtQ(coeffs, a);
929
849
  const signB = this.evalSignAtQ(coeffs, b);
@@ -978,8 +898,6 @@ export class UpolynomialManager {
978
898
  }
979
899
  }
980
900
 
981
- // normalize_interval_core: a refinable interval around zero shrunk to the side of zero holding
982
- // the root, given the sign at its lower end. Null when zero is the root.
983
901
  normalizeInterval(coeffs: Upolynomial, lower: Mpbq, upper: Mpbq, signLower: number) {
984
902
  if (!(lower.isNeg && upper.isPos)) return { lower, upper };
985
903
  if (this.hasZeroRoots(coeffs)) return null;
@@ -988,7 +906,6 @@ export class UpolynomialManager {
988
906
  : { lower, upper: Mpbq.zero };
989
907
  }
990
908
 
991
- // get_root_id: the number of roots up to l.
992
909
  getRootId(coeffs: Upolynomial, lower: Mpbq) {
993
910
  const sequence = this.sturmSeq(coeffs);
994
911
  return this.signVariationsAtMinusInf(sequence) - this.signVariationsAt(sequence, lower);
@@ -0,0 +1,82 @@
1
+ import { SmtTacticError, SmtUnsupportedError } from "../../../errors";
2
+ import { type AstManager, FAMILY_ARITH, KIND_APP, OP_ATAN2, OP_PI, SORT_INT } from "./ast";
3
+ import type { Goal } from "./goal";
4
+ import { goal2nlsat } from "./goal2nlsat";
5
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
6
+ import { NlsatSolver } from "./nlsat/solver";
7
+ import { TRANSCENDENTAL_OPS } from "./nlsat/transcendental-eval";
8
+ import { ProtoModel } from "./proto-model";
9
+
10
+ const isSupportedTranscendental = (manager: AstManager, term: number) =>
11
+ manager.kinds[term] === KIND_APP &&
12
+ manager.getFamily(term) === FAMILY_ARITH &&
13
+ (TRANSCENDENTAL_OPS.has(manager.getOp(term)) ||
14
+ manager.getOp(term) === OP_ATAN2 ||
15
+ manager.getOp(term) === OP_PI);
16
+
17
+ const containsUnsupported = (
18
+ manager: AstManager,
19
+ t2x: ReadonlyMap<number, number>,
20
+ a2b: ReadonlyMap<number, number>,
21
+ ) =>
22
+ [...t2x.keys()].some(
23
+ (term) => !manager.isUninterpretedConst(term) && !isSupportedTranscendental(manager, term),
24
+ ) || [...a2b.keys()].some((atom) => !manager.isUninterpretedConst(atom));
25
+
26
+ // Undefined when nlsat assigns a fraction to an integer variable.
27
+ const mkModel = (
28
+ manager: AstManager,
29
+ solver: NlsatSolver,
30
+ t2x: ReadonlyMap<number, number>,
31
+ a2b: ReadonlyMap<number, number>,
32
+ ) => {
33
+ const model = new ProtoModel(manager);
34
+ for (const [term, variable] of t2x) {
35
+ if (!manager.isUninterpretedConst(term)) continue;
36
+ const value = solver.getValue(variable);
37
+ if (manager.sorts[term] === SORT_INT && !solver.am.isInt(value)) return undefined;
38
+ model.registerConst(
39
+ manager.decls[term],
40
+ manager.mkAlgebraicNumeral(value, manager.sorts[term]),
41
+ );
42
+ }
43
+ for (const [atom, boolVar] of a2b) {
44
+ const value = solver.getBoolValue(boolVar);
45
+ if (value === L_UNDEF) continue;
46
+ model.registerConst(
47
+ manager.decls[atom],
48
+ value === L_TRUE ? manager.trueExpr : manager.falseExpr,
49
+ );
50
+ }
51
+ return model;
52
+ };
53
+
54
+ export interface NlsatOptions {
55
+ seed: number;
56
+ isFactoring: boolean;
57
+ isShufflingVars: boolean;
58
+ variableOrderingStrategy: number;
59
+ }
60
+
61
+ export const runNlsat = (manager: AstManager, options: NlsatOptions) => (goal: Goal) => {
62
+ if (goal.isDecided()) return [goal];
63
+ if (goal.isProofsEnabled) throw new SmtTacticError("nlsat does not support proof production");
64
+ const solver = new NlsatSolver(manager.limit);
65
+ solver.updtParams(options.seed, options.isFactoring);
66
+ const t2x = new Map<number, number>();
67
+ const a2b = new Map<number, number>();
68
+ goal2nlsat(manager, goal.forms.items, solver, t2x, a2b, null, options.isFactoring);
69
+ if (options.isShufflingVars || options.variableOrderingStrategy !== 0)
70
+ throw new SmtUnsupportedError("nlsat's shuffle_vars and variable_ordering_strategy");
71
+ const status = solver.check();
72
+ if (status === L_TRUE && !containsUnsupported(manager, t2x, a2b)) {
73
+ const model = mkModel(manager, solver, t2x, a2b);
74
+ if (model !== undefined) {
75
+ goal.reset();
76
+ goal.model = model;
77
+ }
78
+ }
79
+ if (status === L_FALSE) goal.assert(manager.falseExpr);
80
+ goal.depth++;
81
+ return [goal];
82
+ };