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,23 +1,26 @@
1
- // Ported from Z3 (src/smt/smt_context.h, src/smt/smt_internalizer.cpp), MIT license, see
2
- // z3-license.txt. The state of the SMT kernel and the translation of formulas into it: Boolean
3
- // variables, enodes, clauses and relevancy watches. The search lives in context.ts.
4
- import { SmtInvariantError } from "../../../errors";
1
+ import { SmtInvariantError, SmtUnsupportedError } from "../../../errors";
5
2
  import {
6
3
  AstManager,
7
- FAMILY_ARITH,
8
4
  FAMILY_BASIC,
9
5
  FAMILY_USER,
10
6
  KIND_APP,
11
7
  KIND_QUANTIFIER,
8
+ OP_ADD,
12
9
  OP_AND,
10
+ OP_BADD,
11
+ OP_BAND,
12
+ OP_BMUL,
13
+ OP_BOR,
14
+ OP_BXNOR,
15
+ OP_BXOR,
13
16
  OP_EQ,
14
17
  OP_IMPLIES,
15
18
  OP_ITE,
19
+ OP_MUL,
16
20
  OP_NOT,
17
21
  OP_OR,
18
22
  OP_XOR,
19
23
  SORT_BOOL,
20
- isArithSort,
21
24
  } from "./ast";
22
25
  import { CaseSplitQueue } from "./case-split-queue";
23
26
  import { CgTable, getCongruenceJustification, isCongruent } from "./cg-table";
@@ -40,6 +43,7 @@ import {
40
43
  NO_ENODES,
41
44
  UnitResolutionJustification,
42
45
  } from "./enode";
46
+ import { isCommutativeDecl } from "./euf/egraph";
43
47
  import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
44
48
  import {
45
49
  BoolVar,
@@ -57,19 +61,16 @@ import type { DefaultQuantifierManager } from "./quantifier-manager";
57
61
  import { RelevancyPropagator } from "./relevancy";
58
62
  import { KERNEL_REWRITER_OPTIONS, Rewriter } from "./rewriter";
59
63
  import { sortNumbers } from "./sort";
60
- import type { TheoryLra } from "./theory-lra";
64
+ import type { Theory } from "./theory";
61
65
  import { setAt, shrink } from "./array";
66
+ import { DEFAULT_CONFIG, IA_RANDOM, IA_RANDOM_WHEN_SEARCHING } from "./smt-setup";
62
67
  import { StickyGenerations } from "./sticky-generations";
63
68
 
64
- // DEEP_EXPR_THRESHOLD: the depth above which internalize_deep sorts an expression's subterms.
65
69
  const DEEP_EXPR_THRESHOLD = 1024;
66
70
  const WHITE = 0;
67
71
  const GREY = 1;
68
72
  const BLACK = 2;
69
73
 
70
- // The kinds of undo trail entries. Z3 allocates its trail objects in a region. Here an entry is its
71
- // kind on trailKinds, with its operands on trailNodes and trailInts, so recording one allocates
72
- // nothing. pushTrail's closures are one more kind.
73
74
  const UNDO_CLOSURE = 0;
74
75
  const UNDO_MK_BOOL_VAR = 1;
75
76
  const UNDO_MK_ENODE = 2;
@@ -79,9 +80,6 @@ const UNDO_CGC_GENERATIONS = 5;
79
80
  const UNDO_MERGE_TF = 6;
80
81
  const UNDO_ENODE_FLAG = 7;
81
82
 
82
- // The first word of bool_var_data: the level of the assignment in the low 24 bits, then m_mark,
83
- // m_phase_available, m_phase, m_eq, m_true_first, m_enode, m_quantifier and whether a theory is
84
- // notified.
85
83
  const LEVEL_MASK = 0xffffff;
86
84
  const BV_MARK = 1 << 24;
87
85
  export const BV_PHASE_AVAILABLE = 1 << 25;
@@ -94,13 +92,32 @@ export const BV_THEORY = 1 << 31;
94
92
  export const UNDO_ADD_EQ = 8;
95
93
  export const UNDO_TH_VAR = 9;
96
94
 
95
+ // func_decl_info::is_flat_associative of a commutative declaration. cg_table::mk_table_for gives
96
+ // such a declaration the n-ary table, not the binary commutative one.
97
+ const isFlatAssociativeDecl = (manager: AstManager, decl: number) => {
98
+ switch (manager.funcDecls[decl].op) {
99
+ case OP_AND:
100
+ case OP_OR:
101
+ case OP_ADD:
102
+ case OP_MUL:
103
+ case OP_BADD:
104
+ case OP_BMUL:
105
+ case OP_BAND:
106
+ case OP_BOR:
107
+ case OP_BXOR:
108
+ case OP_BXNOR:
109
+ return true;
110
+ default:
111
+ return false;
112
+ }
113
+ };
114
+
97
115
  interface NewEq {
98
116
  lhs: Enode;
99
117
  rhs: Enode;
100
118
  justification: EqJustification;
101
119
  }
102
120
 
103
- // m_conflict and m_not_l: the justification of the conflict, and the literal it falsifies, if any.
104
121
  interface Conflict {
105
122
  justification: BJustification;
106
123
  notLiteral: Literal | null;
@@ -114,42 +131,24 @@ export abstract class Internalizer {
114
131
  readonly caseSplitQueue: CaseSplitQueue;
115
132
  readonly cgTable = new CgTable();
116
133
  private stickyGenerations = new StickyGenerations();
117
- abstract readonly theory: TheoryLra;
134
+ abstract getTheory(family: number): Theory | undefined;
118
135
  abstract readonly qmanager: DefaultQuantifierManager;
119
136
 
120
- // Per Boolean variable. Like Z3's vectors, the arrays keep their size when a variable is deleted,
121
- // since V8 shrinks an array's storage when it pops and copies it again when it grows. Only the
122
- // first numBoolVars entries are live.
123
137
  numBoolVars = 0;
124
138
  boolVar2Expr: number[] = [];
125
- // bool_var_data: two words per variable. The first holds the level of its assignment and the BV_
126
- // flags, the second the level of its internalization.
127
139
  private boolVarData = new Int32Array(2048);
140
+ private boolVarTheories: number[] = [];
128
141
  justifications: BJustification[] = [];
129
142
  activity: number[] = [];
130
- // Per literal.
131
143
  protected assignment: number[] = [];
132
144
  readonly clauses = new ClauseStore();
133
- // Like Z3's watch lists, a literal's lists are created when the first clause is added.
134
145
  protected watches: (Clause[] | undefined)[] = [];
135
- // del_clauses' uint_set of the watch lists to filter, by literal, all 0 between calls.
136
146
  private watchMarks = new Uint8Array(1024);
137
- // The false literals that simplify_aux_clause_literals removes from the clause mkClause makes.
138
147
  private removedLiterals: Literal[] = [];
139
- // The literal_buffer of mk_and_cnstr and mk_or_cnstr, and the array that mk_gate_clause keeps on
140
- // the stack. mkClause neither keeps them nor makes a gate, so the gates reuse them.
141
148
  private gateBuffer: Literal[] = [];
142
149
  private gateLiterals: Literal[] = [];
143
- // The binary clauses of the binary clause optimization: the literals each literal propagates when it
144
- // becomes true, which Z3 visits newest first and before the clauses.
145
150
  protected binaryWatches: (Literal[] | undefined)[] = [];
146
- // A binary justification holds only its literal, so undoMkBoolVar keeps it for the next variable
147
- // with that literal. Clearing it would write past the end of this sparse array, which V8 then
148
- // turns into a dictionary.
149
151
  private binJustifications: (BinJustification | undefined)[] = [];
150
- // Per expression.
151
- // The Boolean variable of each expression, or -1. A typed array keeps the element loads of every
152
- // context monomorphic, where the holes of a growing array give each its own elements kind.
153
152
  private exprToBoolVar = new Int32Array(1024).fill(-1);
154
153
  protected exprToEnode: (Enode | undefined)[] = [];
155
154
 
@@ -173,13 +172,13 @@ export abstract class Internalizer {
173
172
  falseEnode: Enode;
174
173
  protected generation = 0;
175
174
  protected cachedGeneration = new Map<number, number>();
176
- private randomSeed = 0;
175
+ protected randomSeed = 0;
177
176
  isSearching = false;
177
+ config = DEFAULT_CONFIG;
178
178
 
179
179
  constructor(
180
180
  readonly manager: AstManager,
181
181
  isRelevancyEnabled: boolean,
182
- isDelayingNewCaseSplits: boolean,
183
182
  ) {
184
183
  this.rewriter = new Rewriter(manager, KERNEL_REWRITER_OPTIONS);
185
184
  this.relevancy = new RelevancyPropagator(
@@ -199,7 +198,7 @@ export abstract class Internalizer {
199
198
  getNumBoolVars: () => this.numBoolVars,
200
199
  isUnassigned: (boolVar) => this.assignment[mkLiteral(boolVar)] === L_UNDEF,
201
200
  },
202
- isDelayingNewCaseSplits,
201
+ isRelevancyEnabled,
203
202
  );
204
203
  this.mkBoolVar(manager.trueExpr);
205
204
  this.assignment[0] = L_TRUE;
@@ -225,7 +224,6 @@ export abstract class Internalizer {
225
224
  this.eqPropagationQueue.push({ lhs, rhs, justification });
226
225
  }
227
226
 
228
- // random_gen from Z3's util/util.h with the default seed 0.
229
227
  getRandomValue() {
230
228
  this.randomSeed = (Math.imul(this.randomSeed, 214013) + 2531011) >>> 0;
231
229
  return (this.randomSeed >>> 16) & 0x7fff;
@@ -289,8 +287,6 @@ export abstract class Internalizer {
289
287
  }
290
288
  }
291
289
 
292
- // Assignment queries.
293
-
294
290
  getAssignment(literal: Literal) {
295
291
  return this.assignment[literal];
296
292
  }
@@ -338,15 +334,18 @@ export abstract class Internalizer {
338
334
  }
339
335
 
340
336
  findCongruent(decl: number, args: Enode[]) {
341
- return this.cgTable.findFor(decl, args, decl === OP_EQ);
337
+ return this.cgTable.findFor(
338
+ decl,
339
+ args,
340
+ args.length === 2 &&
341
+ isCommutativeDecl(this.manager, decl) &&
342
+ !isFlatAssociativeDecl(this.manager, decl),
343
+ );
342
344
  }
343
345
 
344
- // is_diseq_core: the roots are distinct values, or an equality between the two classes is false.
345
- // The congruence table is searched with m_is_diseq_tmp, an equality of the sort, which holds a
346
- // reference until an equality of another sort replaces it.
347
- isDiseq(first: Enode, second: Enode) {
346
+ isDiseq(first: Enode, second: Enode, isCheckingValues = true) {
348
347
  const manager = this.manager;
349
- if (manager.areDistinct(first.root.owner, second.root.owner)) return true;
348
+ if (isCheckingValues && manager.areDistinct(first.root.owner, second.root.owner)) return true;
350
349
  const tmp = this.isDiseqTmp;
351
350
  if (tmp === -1 || manager.sorts[manager.getArg(tmp, 0)] !== manager.sorts[first.owner]) {
352
351
  if (tmp !== -1) manager.decRef(tmp);
@@ -386,8 +385,8 @@ export abstract class Internalizer {
386
385
  if (arg === manager.trueExpr) return L_FALSE;
387
386
  return L_UNDEF;
388
387
  }
389
- if (this.isBInternalized(expr)) return this.getAssignmentOfExpr(expr);
390
388
  if (expr === manager.falseExpr) return L_FALSE;
389
+ if (this.isBInternalized(expr)) return this.getAssignmentOfExpr(expr);
391
390
  if (expr === manager.trueExpr) return L_TRUE;
392
391
  return L_UNDEF;
393
392
  }
@@ -401,7 +400,6 @@ export abstract class Internalizer {
401
400
  return this.relevancy.isRelevant(expr);
402
401
  }
403
402
 
404
- // context::mark_as_relevant, which propagates the relevancy at once.
405
403
  markAsRelevant(expr: number) {
406
404
  this.relevancy.markAsRelevant(expr);
407
405
  this.relevancy.propagate();
@@ -415,13 +413,10 @@ export abstract class Internalizer {
415
413
  return this.conflict !== null;
416
414
  }
417
415
 
418
- // get_generation: the generation of the congruence root. Equalities have generation 0, since
419
- // patterns have no equalities.
420
416
  getGeneration(node: Enode) {
421
417
  return node.isEq ? 0 : this.getCgRoot(node).generation;
422
418
  }
423
419
 
424
- // get_cg_root: a node's cg can be stale, so a node that is not a congruence root looks the root up.
425
420
  private getCgRoot(node: Enode) {
426
421
  if (!node.usesCgTable() || node.isCgr()) return node;
427
422
  return this.cgTable.findCongruent(node) ?? node;
@@ -439,9 +434,6 @@ export abstract class Internalizer {
439
434
  ) {
440
435
  this.setGeneration(first, firstGeneration);
441
436
  this.setGeneration(second, secondGeneration);
442
- // apply_sticky_updates: a lowered generation outlives the merge that it was made under. Only the
443
- // updates of the two nodes' declarations can be congruent to them, and a node with an update
444
- // uses the congruence table, so it has arguments and is no equality.
445
437
  this.applyStickyUpdates(first, firstGeneration, second, secondGeneration);
446
438
  if (second.decl !== first.decl) this.applyStickyUpdates(second, secondGeneration, null, 0);
447
439
  }
@@ -473,10 +465,6 @@ export abstract class Internalizer {
473
465
  }
474
466
  }
475
467
 
476
- // Boolean variables and enodes.
477
-
478
- // mk_bool_var: m_b_internalized_stack holds a reference to the expression until the variable is
479
- // deleted.
480
468
  mkBoolVar(expr: number) {
481
469
  const boolVar = toBoolVar(this.numBoolVars++);
482
470
  const literal = mkLiteral(boolVar);
@@ -491,7 +479,12 @@ export abstract class Internalizer {
491
479
  this.boolVarData[2 * boolVar] = 0;
492
480
  this.boolVarData[2 * boolVar + 1] = this.scopeLevel;
493
481
  this.justifications[boolVar] = null;
494
- this.activity[boolVar] = this.isSearching ? -((this.getRandomValue() % 1000) / 1000) : 0;
482
+ const initialActivity = this.config.randomInitialActivity;
483
+ this.activity[boolVar] =
484
+ initialActivity === IA_RANDOM ||
485
+ (initialActivity === IA_RANDOM_WHEN_SEARCHING && this.isSearching)
486
+ ? -((this.getRandomValue() % 1000) / 1000)
487
+ : 0;
495
488
  this.assignment[literal] = L_UNDEF;
496
489
  this.assignment[literal + 1] = L_UNDEF;
497
490
  this.resetWatches(literal);
@@ -501,8 +494,6 @@ export abstract class Internalizer {
501
494
  return boolVar;
502
495
  }
503
496
 
504
- // The arrays keep the deleted variable's entries, which mkBoolVar overwrites. Those that hold
505
- // objects are cleared, so the objects can be collected.
506
497
  private undoMkBoolVar() {
507
498
  const boolVar = toBoolVar(--this.numBoolVars);
508
499
  const expr = this.boolVar2Expr[boolVar];
@@ -513,7 +504,6 @@ export abstract class Internalizer {
513
504
  this.manager.decRef(expr);
514
505
  }
515
506
 
516
- // The level of the variable's assignment.
517
507
  getLevel(boolVar: number) {
518
508
  return this.boolVarData[2 * boolVar] & LEVEL_MASK;
519
509
  }
@@ -523,7 +513,6 @@ export abstract class Internalizer {
523
513
  this.boolVarData[index] = (this.boolVarData[index] & ~LEVEL_MASK) | level;
524
514
  }
525
515
 
526
- // The scope level at which the variable was internalized.
527
516
  getInternLevel(boolVar: number) {
528
517
  return this.boolVarData[2 * boolVar + 1];
529
518
  }
@@ -547,10 +536,9 @@ export abstract class Internalizer {
547
536
  this.setBoolVarFlag(boolVar, BV_MARK, value);
548
537
  }
549
538
 
550
- // watch_list::reset: a new variable's lists keep the room of a deleted one's. Assigning undefined to
551
- // a literal past the end keeps the arrays without holes.
552
539
  private resetWatches(literal: number) {
553
540
  const list = this.watches[literal];
541
+ // HACK: assigning undefined to a literal past the end keeps V8's arrays without holes.
554
542
  if (list === undefined) this.watches[literal] = undefined;
555
543
  else shrink(list, 0);
556
544
  const binary = this.binaryWatches[literal];
@@ -562,7 +550,12 @@ export abstract class Internalizer {
562
550
  return this.hasBoolVarFlag(boolVar, BV_EQ | BV_ENODE | BV_THEORY | BV_QUANTIFIER);
563
551
  }
564
552
 
565
- setVarTheory(boolVar: BoolVar) {
553
+ getBoolVarTheory(boolVar: BoolVar) {
554
+ return this.hasBoolVarFlag(boolVar, BV_THEORY) ? this.boolVarTheories[boolVar] : -1;
555
+ }
556
+
557
+ setVarTheory(boolVar: BoolVar, thId: number) {
558
+ setAt(this.boolVarTheories, boolVar, thId);
566
559
  if (this.scopeLevel > this.getInternLevel(boolVar)) {
567
560
  this.trailInts.push(boolVar);
568
561
  this.trailKinds.push(UNDO_VAR_THEORY);
@@ -570,6 +563,12 @@ export abstract class Internalizer {
570
563
  this.setBoolVarFlag(boolVar, BV_THEORY, true);
571
564
  }
572
565
 
566
+ forcePhase(literal: Literal) {
567
+ const boolVar = getVar(literal);
568
+ this.setBoolVarFlag(boolVar, BV_PHASE_AVAILABLE, true);
569
+ this.setBoolVarFlag(boolVar, BV_PHASE, !isNegated(literal));
570
+ }
571
+
573
572
  setTrueFirstFlag(boolVar: BoolVar) {
574
573
  this.trailInts.push(boolVar);
575
574
  this.trailKinds.push(UNDO_TRUE_FIRST);
@@ -587,15 +586,19 @@ export abstract class Internalizer {
587
586
  const moreArgs: Enode[] = numArgs > 2 ? [] : NO_ENODES;
588
587
  for (let index = 2; index < numArgs; index++) moreArgs.push(this.getArgEnode(expr, index));
589
588
  const isEq = !isSuppressingArgs && manager.getOp(expr) === OP_EQ;
589
+ const decl = manager.decls[expr];
590
+ const isCommutative = isEq || (numArgs === 2 && isCommutativeDecl(manager, decl));
590
591
  const node = new Enode(
591
592
  expr,
592
- manager.decls[expr],
593
+ decl,
593
594
  numArgs,
594
595
  numArgs > 0 ? this.getArgEnode(expr, 0) : null,
595
596
  numArgs > 1 ? this.getArgEnode(expr, 1) : null,
596
597
  moreArgs,
597
598
  generation,
598
599
  isEq,
600
+ isCommutative,
601
+ isEq || (isCommutative && !isFlatAssociativeDecl(manager, decl)),
599
602
  manager.sorts[expr] === SORT_BOOL,
600
603
  isMergeTf,
601
604
  isCgcEnabled,
@@ -604,7 +607,6 @@ export abstract class Internalizer {
604
607
  for (let index = 0; index < numArgs; index++) node.getArg(index).root.addParent(node);
605
608
  if (manager.isUniqueValue(expr)) node.isInterpreted = true;
606
609
  setAt(this.exprToEnode, expr, node);
607
- // m_e_internalized_stack holds a reference to the expression until the enode is deleted.
608
610
  manager.incRef(expr);
609
611
  this.trailKinds.push(UNDO_MK_ENODE);
610
612
  this.enodes.push(node);
@@ -632,7 +634,6 @@ export abstract class Internalizer {
632
634
  return node;
633
635
  }
634
636
 
635
- // The enode of an argument of expr, which is internalized before expr.
636
637
  private getArgEnode(expr: number, index: number) {
637
638
  const node = this.exprToEnode[this.manager.getArg(expr, index)];
638
639
  if (node === undefined) throw new SmtInvariantError("an argument was not internalized");
@@ -680,8 +681,6 @@ export abstract class Internalizer {
680
681
  this.setBoolVarFlag(boolVar, BV_ENODE, true);
681
682
  }
682
683
 
683
- // update_generation: a node of a congruence class records its lower generation as sticky, so
684
- // undoing a merge of the class keeps it.
685
684
  private updateGeneration(node: Enode) {
686
685
  if (node.isEq) return;
687
686
  if (this.generation > 0 && this.generation < this.getGeneration(node)) {
@@ -690,16 +689,12 @@ export abstract class Internalizer {
690
689
  }
691
690
  }
692
691
 
693
- // Internalization.
694
-
695
692
  private isGate(expr: number) {
696
693
  const op = this.manager.getOp(expr);
697
694
  if (op === OP_AND || op === OP_OR || op === OP_ITE) return true;
698
695
  return op === OP_EQ && this.manager.isBool(this.manager.getArg(expr, 0));
699
696
  }
700
697
 
701
- // should_internalize_rec: a term, or a Boolean application of the basic family or an
702
- // uninterpreted declaration.
703
698
  private shouldInternalizeRec(expr: number) {
704
699
  const manager = this.manager;
705
700
  if (manager.kinds[expr] !== KIND_APP || manager.sorts[expr] !== SORT_BOOL) return true;
@@ -707,27 +702,24 @@ export abstract class Internalizer {
707
702
  return family === FAMILY_BASIC || family === FAMILY_USER;
708
703
  }
709
704
 
710
- // internalize_deep: internalizes the subterms of a deep expression bottom up, in the order of a
711
- // topological sort, so the recursion of internalizeRec stays shallow.
712
- private internalizeDeep(expr: number) {
713
- if (
714
- this.isEInternalized(expr) ||
715
- this.manager.depths[expr] <= DEEP_EXPR_THRESHOLD ||
716
- !this.shouldInternalizeRec(expr)
717
- )
718
- return;
705
+ // Internalizes bottom up in topological order, so the recursion of internalizeRec stays shallow.
706
+ private internalizeDeep(exprs: readonly number[]) {
719
707
  const manager = this.manager;
720
- // The color of each expression in a gate context and outside one: white while unvisited, grey
721
- // while its children are visited, and black once it is sorted.
708
+ const isDeep = (expr: number) =>
709
+ !this.isEInternalized(expr) &&
710
+ manager.depths[expr] > DEEP_EXPR_THRESHOLD &&
711
+ this.shouldInternalizeRec(expr);
712
+ if (!exprs.some(isDeep)) return;
722
713
  const colors = new Map<number, number>();
723
714
  const getColor = (current: number, isGate: boolean) =>
724
715
  colors.get(current * 2 + (isGate ? 1 : 0)) ?? WHITE;
725
- const todo: [number, boolean][] = [[expr, true]];
716
+ const todo: [number, boolean][] = exprs
717
+ .filter(isDeep)
718
+ .map((innerExpr): [number, boolean] => [innerExpr, true]);
726
719
  const sorted: [number, boolean][] = [];
727
720
  const visitChild = (child: number, isGate: boolean) => {
728
721
  if (getColor(child, isGate) === WHITE) todo.push([child, isGate]);
729
722
  };
730
- // ts_visit_children, which Z3 calls again on grey expressions only in its assertions.
731
723
  const visitChildren = (current: number) => {
732
724
  if (manager.kinds[current] === KIND_QUANTIFIER || !this.shouldInternalizeRec(current)) return;
733
725
  const node = this.exprToEnode[current];
@@ -754,7 +746,7 @@ export abstract class Internalizer {
754
746
  visitChildren(top[0]);
755
747
  } else {
756
748
  colors.set(top[0] * 2 + (top[1] ? 1 : 0), BLACK);
757
- if (top[0] !== expr && !manager.isNot(top[0]) && this.shouldInternalizeRec(top[0]))
749
+ if (!exprs.includes(top[0]) && !manager.isNot(top[0]) && this.shouldInternalizeRec(top[0]))
758
750
  sorted.push(top);
759
751
  }
760
752
  }
@@ -764,7 +756,7 @@ export abstract class Internalizer {
764
756
  internalizeAssertion(expr: number, generation: number) {
765
757
  const savedGeneration = this.generation;
766
758
  this.generation = generation;
767
- this.internalizeDeep(expr);
759
+ this.internalizeDeep([expr]);
768
760
  const manager = this.manager;
769
761
  if (this.isGate(expr)) {
770
762
  switch (manager.getOp(expr)) {
@@ -828,13 +820,19 @@ export abstract class Internalizer {
828
820
  internalize(expr: number, isGateContext: boolean, generation = this.generation) {
829
821
  const savedGeneration = this.generation;
830
822
  this.generation = generation;
831
- this.internalizeDeep(expr);
823
+ this.internalizeDeep([expr]);
832
824
  this.internalizeRec(expr, isGateContext);
833
825
  this.generation = savedGeneration;
834
826
  }
835
827
 
828
+ internalizeAll(exprs: readonly number[], isGateContext: boolean) {
829
+ this.internalizeDeep(exprs);
830
+ for (const expr of exprs) this.internalizeRec(expr, isGateContext);
831
+ }
832
+
836
833
  private internalizeRec(expr: number, isGateContext: boolean) {
837
834
  const manager = this.manager;
835
+ if (manager.isLambda(expr)) throw new SmtUnsupportedError("lambdas in the array theory");
838
836
  if (manager.sorts[expr] === SORT_BOOL) this.internalizeFormula(expr, isGateContext);
839
837
  else this.internalizeTerm(expr);
840
838
  }
@@ -873,17 +871,16 @@ export abstract class Internalizer {
873
871
  this.internalizeFormulaCore(expr, isGateContext);
874
872
  const boolVar = this.getBoolVar(expr);
875
873
  this.setBoolVarFlag(boolVar, BV_EQ, true);
876
- if (this.manager.sorts[this.manager.getArg(expr, 0)] !== SORT_BOOL && this.isArithSort(expr))
877
- this.theory.internalizeEqEh(expr);
878
- }
879
-
880
- private isArithSort(eq: number) {
881
- return isArithSort(this.manager.sorts[this.manager.getArg(eq, 0)]);
874
+ const manager = this.manager;
875
+ this.getTheory(manager.getSortFamily(manager.sorts[manager.getArg(expr, 0)]))?.internalizeEqEh(
876
+ expr,
877
+ boolVar,
878
+ );
882
879
  }
883
880
 
884
881
  private internalizeTheoryAtom(expr: number, isGateContext: boolean) {
885
- if (this.manager.getFamily(expr) !== FAMILY_ARITH || !this.theory.internalizeAtom(expr))
886
- return false;
882
+ const theory = this.getTheory(this.manager.getFamily(expr));
883
+ if (theory === undefined || !theory.internalizeAtom(expr, isGateContext)) return false;
887
884
  const boolVar = this.getBoolVar(expr);
888
885
  if (!isGateContext) {
889
886
  const node = this.exprToEnode[expr];
@@ -995,7 +992,6 @@ export abstract class Internalizer {
995
992
  }
996
993
  }
997
994
 
998
- // mk_gate_clause with two or three literals.
999
995
  private mkGateClause(first: Literal, second: Literal, third?: Literal) {
1000
996
  const literals = this.gateLiterals;
1001
997
  shrink(literals, 0);
@@ -1009,27 +1005,30 @@ export abstract class Internalizer {
1009
1005
  const existing = this.exprToEnode[expr];
1010
1006
  if (existing !== undefined) {
1011
1007
  this.updateGeneration(existing);
1012
- // The theory may have made a nested term, such as the 2 of (* 2 x), without a variable, which
1013
- // it needs once the term occurs elsewhere.
1014
- if (manager.getFamily(expr) === FAMILY_ARITH && !this.theory.isAttachedToVar(existing)) {
1015
- this.theory.internalizeTerm(expr);
1016
- }
1008
+ const theory = this.getTheory(manager.getFamily(expr));
1009
+ if (theory !== undefined && !theory.isAttachedToVar(existing)) theory.internalizeTerm(expr);
1017
1010
  return;
1018
1011
  }
1019
1012
  if (manager.getOp(expr) === OP_ITE) {
1020
1013
  this.internalizeIteTerm(expr);
1021
1014
  return;
1022
1015
  }
1023
- if (manager.getFamily(expr) === FAMILY_ARITH && this.theory.internalizeTerm(expr)) return;
1024
- for (let index = 0; index < manager.getNumArgs(expr); index++) {
1025
- const arg = manager.getArg(expr, index);
1026
- this.internalizeRec(arg, false);
1016
+ if (!this.getTheory(manager.getFamily(expr))?.internalizeTerm(expr)) {
1017
+ for (let index = 0; index < manager.getNumArgs(expr); index++) {
1018
+ const arg = manager.getArg(expr, index);
1019
+ this.internalizeRec(arg, false);
1020
+ }
1021
+ if (this.exprToEnode[expr] === undefined) this.mkEnode(expr, false, false, true);
1027
1022
  }
1028
- if (this.exprToEnode[expr] !== undefined) return;
1029
- this.mkEnode(expr, false, false, true);
1023
+ const node = this.exprToEnode[expr];
1024
+ if (node !== undefined) this.applySortCnstr(expr, node);
1025
+ }
1026
+
1027
+ private applySortCnstr(expr: number, node: Enode) {
1028
+ const sort = this.manager.sorts[expr];
1029
+ this.getTheory(this.manager.getSortFamily(sort))?.applySortCnstr(node, sort);
1030
1030
  }
1031
1031
 
1032
- // mk_eq_atom: the side with the smaller id goes first.
1033
1032
  mkEqAtom(lhs: number, rhs: number) {
1034
1033
  const ids = this.manager.ids;
1035
1034
  return ids[lhs] < ids[rhs] ? this.manager.mkEq(lhs, rhs) : this.manager.mkEq(rhs, lhs);
@@ -1047,7 +1046,6 @@ export abstract class Internalizer {
1047
1046
  const condition = this.getLiteral(this.manager.getArg(expr, 0));
1048
1047
  this.mkClause([negate(condition), this.getLiteral(thenEq)], null, CLS_AUX);
1049
1048
  this.mkClause([condition, this.getLiteral(elseEq)], null, CLS_AUX);
1050
- // ite_term_relevancy_eh: it marks the terms for the propagator, which propagates them later.
1051
1049
  const handler = () => {
1052
1050
  if (!this.isRelevant(expr)) return;
1053
1051
  this.relevancy.markAsRelevant(this.manager.getArg(expr, 0));
@@ -1096,8 +1094,6 @@ export abstract class Internalizer {
1096
1094
  this.addRelWatch(negate(literal), handler);
1097
1095
  }
1098
1096
 
1099
- // Clauses.
1100
-
1101
1097
  mkThAxiom(literals: Literal[]) {
1102
1098
  this.mkClause(literals, null, CLS_TH_AXIOM);
1103
1099
  }
@@ -1125,8 +1121,6 @@ export abstract class Internalizer {
1125
1121
  return true;
1126
1122
  }
1127
1123
 
1128
- // simplify_aux_lemma_literals: unlike an aux clause, a theory lemma keeps its false literals, so it
1129
- // needs no unit resolution justification.
1130
1124
  private simplifyAuxLemmaLiterals(literals: Literal[]) {
1131
1125
  sortNumbers(literals);
1132
1126
  let previous: Literal | null = null;
@@ -1191,8 +1185,6 @@ export abstract class Internalizer {
1191
1185
  this.addWatch(negate(this.clauses.getLiteral(clause, index)), clause);
1192
1186
  }
1193
1187
 
1194
- // A literal's first watch gets a list of its own size, since growing an empty list allocates room
1195
- // for many.
1196
1188
  protected addWatch(literal: Literal, clause: Clause) {
1197
1189
  const list = this.watches[literal];
1198
1190
  if (list === undefined) this.watches[literal] = [clause];
@@ -1202,7 +1194,6 @@ export abstract class Internalizer {
1202
1194
  protected removeWatchLiteral(clause: Clause, index: number) {
1203
1195
  const list = this.watches[negate(this.clauses.getLiteral(clause, index))];
1204
1196
  if (list === undefined) return;
1205
- // A clause is deleted when its scope is popped, so it is most often near the end.
1206
1197
  const position = list.lastIndexOf(clause);
1207
1198
  if (position === -1) return;
1208
1199
  list.copyWithin(position, position + 1);
@@ -1217,9 +1208,6 @@ export abstract class Internalizer {
1217
1208
  return created;
1218
1209
  }
1219
1210
 
1220
- // use_binary_clause_opt: a clause of two literals at the base level of the first scope, over
1221
- // variables created there, becomes a pair of binary watches. With relevancy, lemmas stay clauses so
1222
- // their propagations can mark literals as relevant.
1223
1211
  private isUsingBinaryClauseOpt(first: Literal, second: Literal, isLemma: boolean) {
1224
1212
  if (isLemma && this.relevancy.isEnabled) return false;
1225
1213
  if (this.baseLevel > 0) return false;
@@ -1240,14 +1228,12 @@ export abstract class Internalizer {
1240
1228
  this.clausesToReinit[level].push(clause);
1241
1229
  }
1242
1230
 
1243
- // mk_clause: like Z3's, it simplifies the literals in the array it is given.
1244
1231
  mkClause(
1245
- input: Literal[],
1232
+ literals: Literal[],
1246
1233
  inputJustification: Justification | null,
1247
1234
  kind: number,
1248
1235
  delEh: (() => void) | null = null,
1249
1236
  ) {
1250
- const literals = input;
1251
1237
  let justification = inputJustification;
1252
1238
  if (kind === CLS_TH_LEMMA) {
1253
1239
  if (!this.simplifyAuxLemmaLiterals(literals)) return null;
@@ -1298,8 +1284,6 @@ export abstract class Internalizer {
1298
1284
  this.addWatchLiteral(clause, 1);
1299
1285
  const first = clauses.getLiteral(clause, 0);
1300
1286
  const second = clauses.getLiteral(clause, 1);
1301
- // A theory lemma that conflicts or propagates above the base level is checked again when the
1302
- // level is backtracked.
1303
1287
  const isPropagating =
1304
1288
  this.assignment[first] === L_FALSE || this.assignment[second] === L_FALSE;
1305
1289
  if (this.assignment[first] === L_FALSE) this.setConflict(clause, null);
@@ -1317,7 +1301,6 @@ export abstract class Internalizer {
1317
1301
  return clause;
1318
1302
  }
1319
1303
 
1320
- // del_clause. A clause in the reinit stack is only marked deleted, and reinitClauses frees it.
1321
1304
  protected deleteClause(clause: Clause) {
1322
1305
  const clauses = this.clauses;
1323
1306
  if (clauses.isDeleted(clause)) return;
@@ -1329,14 +1312,11 @@ export abstract class Internalizer {
1329
1312
  if (!clauses.isReinit(clause)) clauses.free(clause);
1330
1313
  }
1331
1314
 
1332
- // release_atoms: the clause no longer holds its atoms.
1333
1315
  protected releaseAtoms(clause: Clause) {
1334
1316
  for (const atom of this.clauses.getAtoms(clause)) this.manager.decRef(atom);
1335
1317
  this.clauses.clearAtoms(clause);
1336
1318
  }
1337
1319
 
1338
- // del_clauses: past 1,000 clauses, mark each deleted, filter each of their watch lists once, then
1339
- // release their atoms, instead of searching a watch list per clause.
1340
1320
  protected deleteClauses(clauses: Clause[], oldSize: number) {
1341
1321
  if (clauses.length - oldSize <= 1000) {
1342
1322
  for (let index = clauses.length - 1; index >= oldSize; index--)