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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,2107 @@
1
+ import { SmtCanceledError } from "../../../../errors";
2
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
3
+ import { RandomGen } from "../random-gen";
4
+ import type { ResourceLimit } from "../rlimit";
5
+ import { AsymmBranch } from "./asymm-branch";
6
+ import { Cleaner } from "./cleaner";
7
+ import { ClauseArena, NULL_LITERAL, UINT_MAX } from "./clause";
8
+ import {
9
+ GC_DYN_PSM,
10
+ GC_GLUE,
11
+ GC_GLUE_PSM,
12
+ GC_PSM,
13
+ GC_PSM_GLUE,
14
+ getSatConfig,
15
+ PS_ALWAYS_FALSE,
16
+ PS_ALWAYS_TRUE,
17
+ PS_BASIC_CACHING,
18
+ PS_FROZEN,
19
+ PS_RANDOM,
20
+ PS_SAT_CACHING,
21
+ RS_EMA,
22
+ RS_GEOMETRIC,
23
+ RS_LUBY,
24
+ type SatConfig,
25
+ type SatParams,
26
+ } from "./config";
27
+ import { MaxCliques } from "../max-cliques";
28
+ import { ModelConverter } from "./model-converter";
29
+ import { Probing } from "./probing";
30
+ import { Scc } from "./scc";
31
+ import { Simplifier } from "./simplifier";
32
+ import { VarQueue } from "./var-queue";
33
+ import { WATCH_BINARY, WATCH_EXT_CONSTRAINT, WatchList, mkClauseWatch } from "./watch-list";
34
+
35
+ export const JUSTIFICATION_NONE = 0;
36
+ export const JUSTIFICATION_BINARY = 1;
37
+ export const JUSTIFICATION_CLAUSE = 2;
38
+ export const JUSTIFICATION_EXT = 3;
39
+
40
+ export const CR_DONE = 0;
41
+ export const CR_CONTINUE = 1;
42
+ export const CR_GIVEUP = 2;
43
+
44
+ export interface SatExtension {
45
+ propagated(lit: number, index: number): boolean;
46
+ unitPropagate?(): boolean;
47
+ canPropagate?(): boolean;
48
+ asserted?(lit: number): void;
49
+ check?(): number;
50
+ getReasonUnknown?(): string;
51
+ getPhase?(boolVar: number): number;
52
+ initSearch?(): void;
53
+ preSimplify?(): void;
54
+ isExternal?(boolVar: number): boolean;
55
+ setEliminated?(boolVar: number): void;
56
+ getAntecedents(lit: number, index: number, antecedents: number[]): void;
57
+ resolveConflict(): number;
58
+ push(): void;
59
+ pop(numScopes: number): void;
60
+ userPush?(): void;
61
+ userPop?(numScopes: number): void;
62
+ gcVars?(numVars: number): void;
63
+ popReinit(): void;
64
+ simplify(): void;
65
+ gc(): void;
66
+ setRoot(lit: number, root: number): boolean;
67
+ flushRoots(): void;
68
+ initUseList(useVars: Set<number>): void;
69
+ findMutexes(lits: number[], mutexes: number[][]): void;
70
+ toFormulas(lit2expr: (lit: number) => number, formulas: number[]): void;
71
+ }
72
+
73
+ const RANDOM_MAX_VALUE = 0x7fff;
74
+
75
+ const S_SAT = 0;
76
+ const S_UNSAT = 1;
77
+
78
+ class Ema {
79
+ private beta = 1;
80
+ value = 0;
81
+ private period = 0;
82
+ private wait = 0;
83
+
84
+ constructor(private alpha = 0) {}
85
+
86
+ setAlpha(alpha: number) {
87
+ this.alpha = alpha;
88
+ }
89
+
90
+ update(sample: number) {
91
+ this.value += this.beta * (sample - this.value);
92
+ if (this.beta <= this.alpha || this.wait-- !== 0) return;
93
+ this.period = 2 * (this.period + 1) - 1;
94
+ this.wait = this.period;
95
+ this.beta *= 0.5;
96
+ if (this.beta < this.alpha) this.beta = this.alpha;
97
+ }
98
+ }
99
+
100
+ interface Scope {
101
+ trailLim: number;
102
+ clausesToReinitLim: number;
103
+ }
104
+
105
+ const getLuby = (index: number) => {
106
+ let size = 1;
107
+ let sequence = 0;
108
+ while (size < index) {
109
+ sequence++;
110
+ size = 2 * size + 1;
111
+ }
112
+ let remaining = index - 1;
113
+ while (size - 1 !== remaining) {
114
+ size = (size - 1) >> 1;
115
+ sequence--;
116
+ remaining %= size;
117
+ }
118
+ return 2 ** sequence;
119
+ };
120
+
121
+ const sortClauses = (clauses: number[], isLess: (first: number, second: number) => boolean) =>
122
+ clauses.sort((first, second) => (isLess(first, second) ? -1 : isLess(second, first) ? 1 : 0));
123
+
124
+ export class Solver {
125
+ config: SatConfig;
126
+ rand: RandomGen;
127
+ arena = new ClauseArena();
128
+ cleaner: Cleaner;
129
+ mc = new ModelConverter();
130
+ simplifier: Simplifier;
131
+ scc: Scc;
132
+ asymmBranch: AsymmBranch;
133
+ probing: Probing;
134
+ ext: SatExtension | null = null;
135
+ isProbing = false;
136
+ private isGivenUp = false;
137
+ private activeVars: number[] = [];
138
+ private varsLim: number[] = [];
139
+ varsToReinit: number[] = [];
140
+ model = new Int8Array(0);
141
+ isModelCurrent = false;
142
+ isInconsistent = false;
143
+ conflictJustLevel = 0;
144
+ conflictLevel = 0;
145
+ conflictVal = 0;
146
+ conflictKind = JUSTIFICATION_NONE;
147
+ notL = NULL_LITERAL;
148
+ clauses: number[] = [];
149
+ learned: number[] = [];
150
+ watches: WatchList[] = [];
151
+ assignment = new Int8Array(16);
152
+ justLevel = new Uint32Array(8);
153
+ private varCount = 0;
154
+ justVal: number[] = [];
155
+ justKind: number[] = [];
156
+ mark: boolean[] = [];
157
+ litMark: boolean[] = [];
158
+ eliminated: boolean[] = [];
159
+ external: boolean[] = [];
160
+ varScope: number[] = [];
161
+ touched: number[] = [];
162
+ touchIndex = 0;
163
+ replayAssign: number[] = [];
164
+ activity: number[] = [];
165
+ activityInc = 128;
166
+ phase: boolean[] = [];
167
+ bestPhase: boolean[] = [];
168
+ prevPhase: boolean[] = [];
169
+ phaseBirthdate: number[] = [];
170
+ bestPhaseBirthdate: number[] = [];
171
+ assignedSinceGc: boolean[] = [];
172
+ searchState = S_UNSAT;
173
+ searchUnsatConflicts = 0;
174
+ searchSatConflicts = 0;
175
+ searchNextToggle = 0;
176
+ phaseCounter = 0;
177
+ bestPhaseSize = 0;
178
+ rephaseLim = 0;
179
+ rephaseInc = 0;
180
+ rephaseCount = 0;
181
+ caseSplitQueue: VarQueue;
182
+ qhead = 0;
183
+ scopeLvl = 0;
184
+ searchLvl = 0;
185
+ fastGlueAvg = new Ema();
186
+ slowGlueAvg = new Ema();
187
+ fastGlueBackup = new Ema();
188
+ slowGlueBackup = new Ema();
189
+ trailAvg = new Ema();
190
+ trail: number[] = [];
191
+ clausesToReinit: number[] = [];
192
+ reasonUnknown = "";
193
+ visited: number[] = [];
194
+ visitedTimestamp = 0;
195
+ scopes: Scope[] = [];
196
+ core: number[] = [];
197
+ conflicts = 0;
198
+ conflictsSinceInit = 0;
199
+ restarts = 0;
200
+ conflictsSinceRestart = 0;
201
+ isForcingConflictAnalysis = false;
202
+ simplifications = 0;
203
+ restartThreshold = 0;
204
+ lubyIndex = 0;
205
+ conflictsSinceGc = 0;
206
+ gcThreshold = 0;
207
+ defragThreshold = 0;
208
+ gcClauses = 0;
209
+ minDTk = 0;
210
+ nextSimplify = 0;
211
+ isSimplifyEnabled = true;
212
+ isRestartEnabled = true;
213
+ lemma: number[] = [];
214
+ private incremental: boolean;
215
+ private assumptions: number[] = [];
216
+ private assumptionSet = new Set<number>();
217
+ readonly userScopeLiterals: number[] = [];
218
+ private diffLevels: boolean[] = [];
219
+ private unmark: number[] = [];
220
+ private lvlSet = 0;
221
+ private lemmaMinStack: number[] = [];
222
+
223
+ constructor(
224
+ readonly params: SatParams,
225
+ readonly limit: ResourceLimit,
226
+ isIncremental = false,
227
+ ) {
228
+ this.incremental = isIncremental;
229
+ this.config = getSatConfig(params);
230
+ this.rand = new RandomGen(this.config.randomSeed);
231
+ this.caseSplitQueue = new VarQueue(this.activity);
232
+ this.cleaner = new Cleaner(this);
233
+ this.simplifier = new Simplifier(this, params);
234
+ this.scc = new Scc(this, this.config);
235
+ this.asymmBranch = new AsymmBranch(this, params);
236
+ this.probing = new Probing(this, params);
237
+ this.updateParams();
238
+ this.mkVar(false);
239
+ }
240
+
241
+ private updateParams() {
242
+ this.fastGlueAvg.setAlpha(this.config.fastGlueAvg);
243
+ this.slowGlueAvg.setAlpha(this.config.slowGlueAvg);
244
+ this.fastGlueBackup.setAlpha(this.config.fastGlueAvg);
245
+ this.slowGlueBackup.setAlpha(this.config.slowGlueAvg);
246
+ this.trailAvg.setAlpha(this.config.slowGlueAvg);
247
+ }
248
+
249
+ numVars() {
250
+ return this.varCount;
251
+ }
252
+
253
+ value(lit: number) {
254
+ return this.assignment[lit];
255
+ }
256
+
257
+ valueVar(boolVar: number) {
258
+ return this.assignment[2 * boolVar];
259
+ }
260
+
261
+ lvl(lit: number) {
262
+ return this.justLevel[lit >> 1];
263
+ }
264
+
265
+ lvlVar(boolVar: number) {
266
+ return this.justLevel[boolVar];
267
+ }
268
+
269
+ atBaseLvl() {
270
+ return this.scopeLvl === 0;
271
+ }
272
+
273
+ isExternal(boolVar: number) {
274
+ return this.external[boolVar];
275
+ }
276
+
277
+ wasEliminated(boolVar: number) {
278
+ return this.eliminated[boolVar];
279
+ }
280
+
281
+ getWlist(lit: number) {
282
+ return this.watches[lit];
283
+ }
284
+
285
+ initTrailSize() {
286
+ return this.atBaseLvl() ? this.trail.length : this.scopes[0].trailLim;
287
+ }
288
+
289
+ isAssumption(boolVar: number) {
290
+ return this.isAssumptionLit(2 * boolVar) || this.isAssumptionLit(2 * boolVar + 1);
291
+ }
292
+
293
+ private isAssumptionLit(lit: number) {
294
+ return this.trackingAssumptions() && this.assumptionSet.has(lit);
295
+ }
296
+
297
+ isIncremental() {
298
+ return this.incremental;
299
+ }
300
+
301
+ trackingAssumptions() {
302
+ return this.assumptions.length > 0 || this.userScopeLiterals.length > 0;
303
+ }
304
+
305
+ setExternal(boolVar: number) {
306
+ this.external[boolVar] = true;
307
+ }
308
+
309
+ initVisited() {
310
+ const size = 2 * this.numVars();
311
+ while (this.visited.length < size) this.visited.push(0);
312
+ this.visitedTimestamp++;
313
+ }
314
+
315
+ isVisited(lit: number) {
316
+ return this.visited[lit] === this.visitedTimestamp;
317
+ }
318
+
319
+ markVisited(lit: number) {
320
+ this.visited[lit] = this.visitedTimestamp;
321
+ }
322
+
323
+ checkpoint() {
324
+ if (!this.limit.inc()) {
325
+ this.isModelCurrent = false;
326
+ this.reasonUnknown = "sat.canceled";
327
+ throw new SmtCanceledError();
328
+ }
329
+ }
330
+
331
+ mkVar(isExternal: boolean) {
332
+ this.isModelCurrent = false;
333
+ const boolVar = this.varCount++;
334
+ this.activeVars.push(boolVar);
335
+ if (boolVar === this.justLevel.length) {
336
+ const assignment = new Int8Array(4 * boolVar);
337
+ assignment.set(this.assignment);
338
+ this.assignment = assignment;
339
+ const justLevel = new Uint32Array(2 * boolVar);
340
+ justLevel.set(this.justLevel);
341
+ this.justLevel = justLevel;
342
+ }
343
+ this.watches.push(new WatchList(), new WatchList());
344
+ this.justLevel[boolVar] = UINT_MAX;
345
+ this.justVal.push(0);
346
+ this.justKind.push(JUSTIFICATION_NONE);
347
+ this.eliminated.push(false);
348
+ this.external.push(isExternal);
349
+ this.varScope.push(this.scopeLvl);
350
+ this.touched.push(0);
351
+ this.activity.push(0);
352
+ this.mark.push(false);
353
+ this.litMark.push(false, false);
354
+ this.phase.push(false);
355
+ this.bestPhase.push(false);
356
+ this.prevPhase.push(false);
357
+ this.phaseBirthdate.push(0);
358
+ this.bestPhaseBirthdate.push(0);
359
+ this.assignedSinceGc.push(false);
360
+ this.caseSplitQueue.mkVar(boolVar);
361
+ this.simplifier.insertElimTodo(boolVar);
362
+ return boolVar;
363
+ }
364
+
365
+ setEliminated(boolVar: number, isEliminated: boolean) {
366
+ if (this.eliminated[boolVar] === isEliminated) return;
367
+ this.eliminated[boolVar] = isEliminated;
368
+ if (isEliminated) this.ext?.setEliminated?.(boolVar);
369
+ }
370
+
371
+ setNonExternal(boolVar: number) {
372
+ this.external[boolVar] = false;
373
+ }
374
+
375
+ private isExtPropagating() {
376
+ return this.ext !== null && (!this.isProbing || this.atBaseLvl());
377
+ }
378
+
379
+ get numUserScopes() {
380
+ return this.userScopeLiterals.length;
381
+ }
382
+
383
+ mkClause(lits: number[], isLearned = false, isTheory = false) {
384
+ this.isModelCurrent = false;
385
+ return this.mkClauseCore(
386
+ this.userScopeLiterals.length === 0 ? lits : [...lits, ...this.userScopeLiterals],
387
+ isLearned,
388
+ isTheory,
389
+ );
390
+ }
391
+
392
+ delClause(clause: number) {
393
+ this.arena.delClause(clause);
394
+ }
395
+
396
+ mkClauseCore(lits: number[], isRedundant: boolean, isTheory = false): number {
397
+ if ((!isRedundant || isTheory) && !this.simplifyClause(lits)) return -1;
398
+ switch (lits.length) {
399
+ case 0:
400
+ this.setConflict();
401
+ return -1;
402
+ case 1:
403
+ this.assign(lits[0], 0, JUSTIFICATION_NONE, 0);
404
+ return -1;
405
+ case 2:
406
+ this.mkBinClause(lits[0], lits[1], isRedundant);
407
+ return -1;
408
+ default:
409
+ return this.mkNaryClause(lits, isRedundant, isTheory);
410
+ }
411
+ }
412
+
413
+ mkBinClause(first: number, second: number, isRedundant: boolean) {
414
+ this.touched[first >> 1] = this.touchIndex;
415
+ this.touched[second >> 1] = this.touchIndex;
416
+ if (
417
+ isRedundant &&
418
+ this.getWlist(first ^ 1).findBinary(second ^ 1) !== -1 &&
419
+ this.value(first) === L_UNDEF
420
+ ) {
421
+ this.assignUnit(first);
422
+ return;
423
+ }
424
+ if (
425
+ isRedundant &&
426
+ this.getWlist(second ^ 1).findBinary(first ^ 1) !== -1 &&
427
+ this.value(second) === L_UNDEF
428
+ ) {
429
+ this.assignUnit(second);
430
+ return;
431
+ }
432
+ const found = isRedundant ? this.getWlist(first ^ 1).findBinary(second) : -1;
433
+ if (found !== -1) {
434
+ if (this.propagateBinClause(first, second) && !this.atBaseLvl() && !isRedundant)
435
+ this.pushReinitBinary(first, second);
436
+ else if (this.hasVariablesToReinitBinary(first, second)) this.pushReinitBinary(first, second);
437
+ return;
438
+ }
439
+ if (this.propagateBinClause(first, second)) {
440
+ if (!this.atBaseLvl()) this.pushReinitBinary(first, second);
441
+ else return;
442
+ } else if (this.hasVariablesToReinitBinary(first, second)) this.pushReinitBinary(first, second);
443
+ this.getWlist(first ^ 1).pushBinary(second, isRedundant);
444
+ this.getWlist(second ^ 1).pushBinary(first, isRedundant);
445
+ }
446
+
447
+ private hasVariablesToReinit(clause: number) {
448
+ const arena = this.arena;
449
+ for (let index = 0; index < arena.size[clause]; index++)
450
+ if (this.varScope[arena.get(clause, index) >> 1] > 0) return true;
451
+ return false;
452
+ }
453
+
454
+ private hasVariablesToReinitBinary(first: number, second: number) {
455
+ if (this.atBaseLvl()) return false;
456
+ return this.varScope[first >> 1] > 0 || this.varScope[second >> 1] > 0;
457
+ }
458
+
459
+ propagateBinClause(first: number, second: number) {
460
+ if (this.value(second) === L_FALSE && this.value(first) !== L_TRUE) {
461
+ this.assign(first, this.lvl(second), JUSTIFICATION_BINARY, second);
462
+ return true;
463
+ }
464
+ if (this.value(first) === L_FALSE && this.value(second) !== L_TRUE) {
465
+ this.assign(second, this.lvl(first), JUSTIFICATION_BINARY, first);
466
+ return true;
467
+ }
468
+ return false;
469
+ }
470
+
471
+ pushReinitStack(clause: number) {
472
+ this.clausesToReinit.push(clause, NULL_LITERAL);
473
+ this.arena.setReinitStack(clause, true);
474
+ }
475
+
476
+ private pushReinitBinary(first: number, second: number) {
477
+ this.clausesToReinit.push(first, second);
478
+ }
479
+
480
+ private mkNaryClause(lits: number[], isRedundant: boolean, isTheory: boolean) {
481
+ const clause = this.arena.mkClause(lits, lits.length, isRedundant);
482
+ const isReinit = this.attachNaryClause(clause, isRedundant && !isTheory);
483
+ if (isReinit || this.hasVariablesToReinit(clause)) this.pushReinitStack(clause);
484
+ if (isRedundant) this.learned.push(clause);
485
+ else this.clauses.push(clause);
486
+ for (const lit of lits) this.touched[lit >> 1] = this.touchIndex;
487
+ return clause;
488
+ }
489
+
490
+ private attachNaryClause(clause: number, isAsserting: boolean) {
491
+ const arena = this.arena;
492
+ let isReinit = false;
493
+ if (!this.atBaseLvl()) {
494
+ if (isAsserting) arena.swap(clause, 1, this.selectLearnedWatchLit(clause));
495
+ else {
496
+ arena.swap(clause, 0, this.selectWatchLit(clause, 0));
497
+ arena.swap(clause, 1, this.selectWatchLit(clause, 1));
498
+ }
499
+ const size = arena.size[clause];
500
+ if (this.value(arena.get(clause, 0)) === L_FALSE) {
501
+ let level = this.lvl(arena.get(clause, 0));
502
+ for (let index = size; index-- > 2;)
503
+ level = Math.max(level, this.lvl(arena.get(clause, index)));
504
+ this.assign(arena.get(clause, 1), level, JUSTIFICATION_CLAUSE, clause);
505
+ isReinit ||= !arena.isLearned(clause);
506
+ } else if (this.value(arena.get(clause, 1)) === L_FALSE) {
507
+ let level = this.lvl(arena.get(clause, 1));
508
+ for (let index = size; index-- > 2;)
509
+ level = Math.max(level, this.lvl(arena.get(clause, index)));
510
+ this.assign(arena.get(clause, 0), level, JUSTIFICATION_CLAUSE, clause);
511
+ isReinit ||= !arena.isLearned(clause);
512
+ }
513
+ }
514
+ const blockedLit = arena.get(clause, arena.size[clause] >> 1);
515
+ this.watches[arena.get(clause, 0) ^ 1].pushClause(blockedLit, clause);
516
+ this.watches[arena.get(clause, 1) ^ 1].pushClause(blockedLit, clause);
517
+ return isReinit;
518
+ }
519
+
520
+ attachClause(clause: number) {
521
+ return this.attachNaryClause(
522
+ clause,
523
+ this.arena.isLearned(clause) && !this.arena.isOnReinitStack(clause),
524
+ );
525
+ }
526
+
527
+ shrink(clause: number, oldSize: number, newSize: number) {
528
+ if (oldSize === newSize) return;
529
+ this.arena.shrink(clause, newSize);
530
+ for (let index = 0; index < newSize; index++)
531
+ this.touched[this.arena.get(clause, index) >> 1] = this.touchIndex;
532
+ }
533
+
534
+ setPhase(boolVar: number, isPositive: boolean) {
535
+ if (this.phase[boolVar] !== isPositive) this.phaseBirthdate[boolVar] = this.conflicts;
536
+ this.phase[boolVar] = isPositive;
537
+ }
538
+
539
+ setBestPhase(boolVar: number, isPositive: boolean) {
540
+ if (this.bestPhase[boolVar] !== isPositive) this.bestPhaseBirthdate[boolVar] = this.conflicts;
541
+ this.bestPhase[boolVar] = isPositive;
542
+ }
543
+
544
+ setPhaseLiteral(lit: number) {
545
+ if (lit >> 1 >= this.numVars()) return;
546
+ this.setPhase(lit >> 1, (lit & 1) === 0);
547
+ this.setBestPhase(lit >> 1, (lit & 1) === 0);
548
+ }
549
+
550
+ private shouldDefrag() {
551
+ if (this.defragThreshold > 0) this.defragThreshold--;
552
+ return this.defragThreshold === 0 && this.config.isGcDefrag;
553
+ }
554
+
555
+ private defragClauses() {
556
+ this.defragThreshold = 2;
557
+ this.pop(this.scopeLvl);
558
+ const source = this.arena;
559
+ const target = new ClauseArena();
560
+ const newClauses: number[] = [];
561
+ const newLearned: number[] = [];
562
+ const newIds = new Map<number, number>();
563
+ for (const clause of this.clauses) source.unmarkUsed(clause);
564
+ for (const clause of this.learned) source.unmarkUsed(clause);
565
+ const vars: number[] = [];
566
+ for (let boolVar = 0; boolVar < this.numVars(); boolVar++) vars.push(boolVar);
567
+ vars.sort((first, second) => this.activity[second] - this.activity[first]);
568
+ const copy = (clause: number) => {
569
+ const id = target.copyClause(source, clause);
570
+ (source.isLearned(clause) ? newLearned : newClauses).push(id);
571
+ return id;
572
+ };
573
+ for (const boolVar of vars)
574
+ for (const lit of [2 * boolVar, 2 * boolVar + 1]) {
575
+ const wlist = this.watches[lit];
576
+ for (let index = 0; index < wlist.size; index++) {
577
+ if (!wlist.isClause(index)) continue;
578
+ const clause = wlist.getClause(index);
579
+ const id = newIds.get(clause) ?? copy(clause);
580
+ newIds.set(clause, id);
581
+ wlist.setClause(index, wlist.getBlockedLiteral(index), id);
582
+ }
583
+ }
584
+ for (const clause of this.clauses) if (!newIds.has(clause)) copy(clause);
585
+ for (const clause of this.learned) if (!newIds.has(clause)) copy(clause);
586
+ this.clauses = newClauses;
587
+ this.learned = newLearned;
588
+ this.arena = target;
589
+ this.reinitAssumptions();
590
+ }
591
+
592
+ private selectWatchLit(clause: number, startingAt: number) {
593
+ const arena = this.arena;
594
+ let minTrueIndex = -1;
595
+ let maxFalseIndex = -1;
596
+ let unknownIndex = -1;
597
+ for (let index = startingAt; index < arena.size[clause]; index++) {
598
+ const lit = arena.get(clause, index);
599
+ switch (this.value(lit)) {
600
+ case L_FALSE:
601
+ if (maxFalseIndex === -1 || this.lvl(lit) > this.lvl(arena.get(clause, maxFalseIndex)))
602
+ maxFalseIndex = index;
603
+ break;
604
+ case L_UNDEF:
605
+ unknownIndex = index;
606
+ break;
607
+ case L_TRUE:
608
+ if (minTrueIndex === -1 || this.lvl(lit) < this.lvl(arena.get(clause, minTrueIndex)))
609
+ minTrueIndex = index;
610
+ break;
611
+ }
612
+ }
613
+ if (minTrueIndex !== -1) return minTrueIndex;
614
+ if (unknownIndex !== -1) return unknownIndex;
615
+ return maxFalseIndex;
616
+ }
617
+
618
+ private selectLearnedWatchLit(clause: number) {
619
+ const arena = this.arena;
620
+ let maxFalseIndex = -1;
621
+ for (let index = 1; index < arena.size[clause]; index++)
622
+ if (
623
+ maxFalseIndex === -1 ||
624
+ this.lvl(arena.get(clause, index)) > this.lvl(arena.get(clause, maxFalseIndex))
625
+ )
626
+ maxFalseIndex = index;
627
+ return maxFalseIndex;
628
+ }
629
+
630
+ private simplifyClause(lits: number[]) {
631
+ const isLvl0 = this.atBaseLvl();
632
+ lits.sort((first, second) => first - second);
633
+ let previous = NULL_LITERAL;
634
+ let next = 0;
635
+ for (let index = 0; index < lits.length; index++) {
636
+ const current = lits[index];
637
+ const value = !isLvl0 && this.lvl(current) > 0 ? L_UNDEF : this.value(current);
638
+ if (value === L_TRUE) return false;
639
+ if (value === L_FALSE) continue;
640
+ if (current === (previous ^ 1)) return false;
641
+ if (current !== previous) {
642
+ previous = current;
643
+ if (index !== next) {
644
+ lits[index] = lits[next];
645
+ lits[next] = current;
646
+ }
647
+ next++;
648
+ }
649
+ }
650
+ lits.length = next;
651
+ return true;
652
+ }
653
+
654
+ setLearned1(first: number, second: number, isRedundant: boolean) {
655
+ const wlist = this.getWlist(first ^ 1);
656
+ for (let index = 0; index < wlist.size; index++)
657
+ if (wlist.isBinary(index) && wlist.getLiteral(index) === second && !wlist.isLearned(index)) {
658
+ wlist.setLearned(index, isRedundant);
659
+ return;
660
+ }
661
+ }
662
+
663
+ detachClause(clause: number) {
664
+ this.getWlist(this.arena.get(clause, 0) ^ 1).eraseClause(clause);
665
+ this.getWlist(this.arena.get(clause, 1) ^ 1).eraseClause(clause);
666
+ }
667
+
668
+ setConflict(level = 0, kind = JUSTIFICATION_NONE, val = 0, notL = NULL_LITERAL) {
669
+ if (this.isInconsistent) return;
670
+ this.isInconsistent = true;
671
+ this.conflictJustLevel = level;
672
+ this.conflictKind = kind;
673
+ this.conflictVal = val;
674
+ this.notL = notL;
675
+ }
676
+
677
+ assign(lit: number, level: number, kind: number, val: number) {
678
+ switch (this.value(lit)) {
679
+ case L_FALSE:
680
+ this.setConflict(level, kind, val, lit ^ 1);
681
+ break;
682
+ case L_UNDEF:
683
+ this.assignCore(lit, level, kind, val);
684
+ break;
685
+ case L_TRUE:
686
+ if (level === 0 && this.lvl(lit) !== 0) {
687
+ this.justLevel[lit >> 1] = 0;
688
+ this.justKind[lit >> 1] = kind;
689
+ this.justVal[lit >> 1] = val;
690
+ }
691
+ break;
692
+ }
693
+ }
694
+
695
+ assignUnit(lit: number) {
696
+ this.assign(lit, 0, JUSTIFICATION_NONE, 0);
697
+ }
698
+
699
+ assignScoped(lit: number) {
700
+ this.assign(lit, this.scopeLvl, JUSTIFICATION_NONE, 0);
701
+ }
702
+
703
+ assignCore(lit: number, level: number, kind: number, val: number) {
704
+ const boolVar = lit >> 1;
705
+ this.assignment[lit] = L_TRUE;
706
+ this.assignment[lit ^ 1] = L_FALSE;
707
+ this.justLevel[boolVar] = level;
708
+ this.justKind[boolVar] = level === 0 ? JUSTIFICATION_NONE : kind;
709
+ this.justVal[boolVar] = level === 0 ? 0 : val;
710
+ this.setPhase(boolVar, (lit & 1) === 0);
711
+ this.assignedSinceGc[boolVar] = true;
712
+ this.trail.push(lit);
713
+ }
714
+
715
+ propagate(isUpdating: boolean) {
716
+ if (this.isExtPropagating()) this.ext?.unitPropagate?.();
717
+ while (this.qhead < this.trail.length && !this.isInconsistent) {
718
+ do {
719
+ this.checkpoint();
720
+ this.cleaner.dec();
721
+ const lit = this.trail[this.qhead];
722
+ this.qhead++;
723
+ if (!this.propagateLiteral(lit, isUpdating)) return false;
724
+ } while (this.qhead < this.trail.length);
725
+ if (this.isExtPropagating()) this.ext?.unitPropagate?.();
726
+ }
727
+ return !this.isInconsistent;
728
+ }
729
+
730
+ private propagateClause(clause: number, isUpdating: boolean, assignLevel: number, first: number) {
731
+ const arena = this.arena;
732
+ arena.markUsed(clause);
733
+ this.assignCore(first, assignLevel, JUSTIFICATION_CLAUSE, clause);
734
+ if (isUpdating && arena.isLearned(clause) && arena.glue[clause] > 2) {
735
+ const glue = this.numDiffLevelsBelow(clause, arena.glue[clause] - 1);
736
+ if (glue !== -1) arena.setGlue(clause, glue);
737
+ }
738
+ }
739
+
740
+ private propagateLiteral(lit: number, isUpdating: boolean) {
741
+ const arena = this.arena;
742
+ const lits = arena.lits;
743
+ const starts = arena.start;
744
+ const sizes = arena.size;
745
+ const assignment = this.assignment;
746
+ const justLevel = this.justLevel;
747
+ const currLevel = justLevel[lit >> 1];
748
+ const notL = lit ^ 1;
749
+ const wlist = this.watches[lit];
750
+ let data = wlist.data;
751
+ this.asymmBranch.dec(wlist.size);
752
+ this.probing.dec(wlist.size);
753
+ const end = wlist.size;
754
+ let target = 0;
755
+ for (let index = 0; index < end; index++) {
756
+ const val1 = data[2 * index];
757
+ const val2 = data[2 * index + 1];
758
+ if ((val2 & 3) === WATCH_BINARY) {
759
+ const value = assignment[val1];
760
+ if (value === L_FALSE) {
761
+ for (; index < end; index++, target++) wlist.copy(target, index);
762
+ wlist.setEnd(target);
763
+ this.setConflict(currLevel, JUSTIFICATION_BINARY, notL, val1 ^ 1);
764
+ return false;
765
+ }
766
+ if (value === L_UNDEF) this.assignCore(val1, currLevel, JUSTIFICATION_BINARY, notL);
767
+ data[2 * target] = val1;
768
+ data[2 * target + 1] = val2;
769
+ target++;
770
+ continue;
771
+ }
772
+ if ((val2 & 3) === WATCH_EXT_CONSTRAINT) {
773
+ const isKept = (this.ext as SatExtension).propagated(lit, val1);
774
+ data = wlist.data;
775
+ if (this.isInconsistent) {
776
+ if (!isKept) index++;
777
+ for (; index < end; index++, target++) wlist.copy(target, index);
778
+ wlist.setEnd(target);
779
+ return false;
780
+ }
781
+ if (isKept) {
782
+ data[2 * target] = val1;
783
+ data[2 * target + 1] = val2;
784
+ target++;
785
+ }
786
+ continue;
787
+ }
788
+ if (assignment[val2 >> 2] === L_TRUE) {
789
+ data[2 * target] = val1;
790
+ data[2 * target + 1] = val2;
791
+ target++;
792
+ continue;
793
+ }
794
+ const clause = val1;
795
+ const base = starts[clause];
796
+ if (lits[base] === notL) {
797
+ lits[base] = lits[base + 1];
798
+ lits[base + 1] = notL;
799
+ }
800
+ const size = sizes[clause];
801
+ if (arena.wasRemoved(clause) || size === 1 || lits[base + 1] !== notL) {
802
+ data[2 * target] = val1;
803
+ data[2 * target + 1] = val2;
804
+ target++;
805
+ continue;
806
+ }
807
+ const first = lits[base];
808
+ const firstValue = assignment[first];
809
+ if (firstValue === L_TRUE) {
810
+ data[2 * target] = clause;
811
+ data[2 * target + 1] = mkClauseWatch(first);
812
+ target++;
813
+ continue;
814
+ }
815
+ let undefIndex = 0;
816
+ let assignLevel = currLevel;
817
+ let maxIndex = 1;
818
+ let numUndef = 0;
819
+ let isSatisfied = false;
820
+ for (let position = 2; position < size && numUndef <= 1; position++) {
821
+ const other = lits[base + position];
822
+ const value = assignment[other];
823
+ if (value === L_TRUE) {
824
+ data[2 * target] = clause;
825
+ data[2 * target + 1] = mkClauseWatch(other);
826
+ target++;
827
+ isSatisfied = true;
828
+ break;
829
+ }
830
+ if (value === L_UNDEF) {
831
+ undefIndex = position;
832
+ numUndef++;
833
+ continue;
834
+ }
835
+ const level = justLevel[other >> 1];
836
+ if (level > assignLevel) {
837
+ assignLevel = level;
838
+ maxIndex = position;
839
+ }
840
+ }
841
+ if (isSatisfied) continue;
842
+ if (firstValue === L_FALSE) assignLevel = Math.max(assignLevel, justLevel[first >> 1]);
843
+ if (undefIndex !== 0) {
844
+ this.setWatch(clause, undefIndex);
845
+ if (firstValue === L_FALSE && numUndef === 1) {
846
+ arena.swap(clause, 0, 1);
847
+ this.propagateClause(clause, isUpdating, assignLevel, lits[base]);
848
+ }
849
+ continue;
850
+ }
851
+ if (firstValue === L_FALSE) {
852
+ arena.markUsed(clause);
853
+ for (; index < end; index++, target++) wlist.copy(target, index);
854
+ wlist.setEnd(target);
855
+ this.setConflict(assignLevel, JUSTIFICATION_CLAUSE, clause);
856
+ return false;
857
+ }
858
+ if (maxIndex !== 1) this.setWatch(clause, maxIndex);
859
+ else {
860
+ data[2 * target] = val1;
861
+ data[2 * target + 1] = val2;
862
+ target++;
863
+ }
864
+ this.propagateClause(clause, isUpdating, assignLevel, first);
865
+ }
866
+ wlist.setEnd(target);
867
+ if (this.external[lit >> 1] && this.isExtPropagating()) this.ext?.asserted?.(lit);
868
+ return true;
869
+ }
870
+
871
+ private setWatch(clause: number, index: number) {
872
+ this.arena.swap(clause, 1, index);
873
+ this.watches[this.arena.get(clause, 1) ^ 1].pushClause(this.arena.get(clause, 0), clause);
874
+ }
875
+
876
+ check(assumptions: readonly number[] = []) {
877
+ this.reasonUnknown = "no reason given";
878
+ this.popToBaseLevel();
879
+ this.isGivenUp = false;
880
+ this.initSearch();
881
+ if (this.checkInconsistent()) return L_FALSE;
882
+ this.propagate(false);
883
+ if (this.checkInconsistent()) return L_FALSE;
884
+ this.initAssumptions(assumptions);
885
+ this.propagate(false);
886
+ if (this.checkInconsistent()) return L_FALSE;
887
+ if (this.config.isForcingCleanup) this.doCleanup(true);
888
+ if (this.config.isGcBurst) {
889
+ this.conflictsSinceGc = this.gcThreshold + 1;
890
+ this.doGc();
891
+ }
892
+ if (this.config.isEnablingPreSimplify) {
893
+ this.doSimplify();
894
+ if (this.checkInconsistent()) return L_FALSE;
895
+ }
896
+ if (this.config.maxConflicts === 0) return L_UNDEF;
897
+ if (this.config.maxConflicts > 0 && this.config.burstSearch > 0) {
898
+ this.restartThreshold = this.config.burstSearch;
899
+ const result = this.boundedSearch();
900
+ if (result !== L_UNDEF || this.isGivenUp) return result;
901
+ this.popReinit(this.scopeLvl);
902
+ this.conflictsSinceRestart = 0;
903
+ this.restartThreshold = this.config.restartInitial;
904
+ }
905
+ return this.basicSearch();
906
+ }
907
+
908
+ checkInconsistent() {
909
+ if (!this.isInconsistent) return false;
910
+ if (this.trackingAssumptions() && this.scopeLvl === this.searchLvl) this.resolveConflict();
911
+ return true;
912
+ }
913
+
914
+ resolveConflict() {
915
+ for (;;) {
916
+ if (this.resolveConflictCore() === L_FALSE) return false;
917
+ if (!this.isInconsistent) return true;
918
+ }
919
+ }
920
+
921
+ initAssumptions(lits: readonly number[]) {
922
+ if (lits.length === 0 && this.userScopeLiterals.length === 0) return;
923
+ this.resetAssumptions();
924
+ this.push();
925
+ this.propagate(false);
926
+ if (this.isInconsistent) return;
927
+ for (let index = 0; !this.isInconsistent && index < this.userScopeLiterals.length; index++)
928
+ this.assignScoped(this.userScopeLiterals[index] ^ 1);
929
+ for (let index = 0; !this.isInconsistent && index < lits.length; index++) {
930
+ const lit = lits[index];
931
+ this.setExternal(lit >> 1);
932
+ this.addAssumption(lit);
933
+ this.assignScoped(lit);
934
+ }
935
+ this.searchLvl = this.scopeLvl;
936
+ }
937
+
938
+ private resetAssumptions() {
939
+ this.assumptions = [];
940
+ this.assumptionSet.clear();
941
+ }
942
+
943
+ addAssumption(lit: number) {
944
+ this.assumptionSet.add(lit);
945
+ this.assumptions.push(lit);
946
+ this.setExternal(lit >> 1);
947
+ }
948
+
949
+ private reinitAssumptions() {
950
+ if (!this.trackingAssumptions() || !this.atBaseLvl() || this.isInconsistent) return;
951
+ if (!this.propagate(false)) return;
952
+ this.push();
953
+ for (const lit of this.userScopeLiterals) {
954
+ if (this.isInconsistent) break;
955
+ this.assignScoped(lit ^ 1);
956
+ }
957
+ for (const lit of this.assumptions) {
958
+ if (this.isInconsistent) break;
959
+ this.assignScoped(lit);
960
+ }
961
+ if (!this.isInconsistent) this.propagate(false);
962
+ }
963
+
964
+ private processAntecedentForUnsatCore(antecedent: number) {
965
+ const boolVar = antecedent >> 1;
966
+ if (this.mark[boolVar]) return;
967
+ this.mark[boolVar] = true;
968
+ this.unmark.push(boolVar);
969
+ if (this.isAssumptionLit(antecedent)) this.core.push(antecedent);
970
+ }
971
+
972
+ private processConsequentForUnsatCore(consequent: number, kind: number, val: number) {
973
+ if (kind === JUSTIFICATION_BINARY) {
974
+ this.processAntecedentForUnsatCore(val ^ 1);
975
+ return;
976
+ }
977
+ if (kind === JUSTIFICATION_EXT) {
978
+ for (const lit of this.getExtAntecedents(consequent, val))
979
+ this.processAntecedentForUnsatCore(lit);
980
+ return;
981
+ }
982
+ if (kind !== JUSTIFICATION_CLAUSE) return;
983
+ const arena = this.arena;
984
+ let position = 0;
985
+ if (consequent !== NULL_LITERAL) {
986
+ if (arena.get(val, 0) === consequent) position = 1;
987
+ else {
988
+ this.processAntecedentForUnsatCore(arena.get(val, 0) ^ 1);
989
+ position = 2;
990
+ }
991
+ }
992
+ for (; position < arena.size[val]; position++)
993
+ this.processAntecedentForUnsatCore(arena.get(val, position) ^ 1);
994
+ }
995
+
996
+ private resolveConflictForUnsatCore() {
997
+ this.core = [];
998
+ if (this.conflictLevel === 0) return;
999
+ const oldSize = this.unmark.length;
1000
+ let index = this.skipLiteralsAboveConflictLevel();
1001
+ let consequent = this.notL;
1002
+ if (this.notL !== NULL_LITERAL) {
1003
+ const boolVar = this.notL >> 1;
1004
+ this.processAntecedentForUnsatCore(this.notL);
1005
+ if (this.isAssumptionLit(this.notL ^ 1)) this.core.push(this.notL ^ 1);
1006
+ else
1007
+ this.processConsequentForUnsatCore(
1008
+ this.notL,
1009
+ this.justKind[boolVar],
1010
+ this.justVal[boolVar],
1011
+ );
1012
+ consequent = this.notL ^ 1;
1013
+ }
1014
+ let kind = this.conflictKind;
1015
+ let val = this.conflictVal;
1016
+ const initSize = this.initTrailSize();
1017
+ for (;;) {
1018
+ this.processConsequentForUnsatCore(consequent, kind, val);
1019
+ while (index >= initSize) {
1020
+ consequent = this.trail[index];
1021
+ if (this.mark[consequent >> 1] && this.lvl(consequent) === this.conflictLevel) break;
1022
+ index--;
1023
+ }
1024
+ if (index < initSize) break;
1025
+ kind = this.justKind[consequent >> 1];
1026
+ val = this.justVal[consequent >> 1];
1027
+ index--;
1028
+ }
1029
+ this.resetUnmark(oldSize);
1030
+ if (this.core.length > 1) this.core = this.core.filter((lit) => this.lvl(lit) > 0);
1031
+ }
1032
+
1033
+ // max_cliques over the binary clauses, the largest mutexes first.
1034
+ findMutexes(lits: readonly number[]) {
1035
+ const remaining = [...lits];
1036
+ const extMutexes: number[][] = [];
1037
+ this.ext?.findMutexes(remaining, extMutexes);
1038
+ const cliques = new MaxCliques((index) => index ^ 1);
1039
+ const seen = new Set<string>();
1040
+ for (let index = 0; index < this.watches.length; index++) {
1041
+ const first = index ^ 1;
1042
+ const wlist = this.watches[index];
1043
+ for (let position = 0; position < wlist.size; position++) {
1044
+ if (!wlist.isBinary(position)) continue;
1045
+ const second = wlist.getLiteral(position);
1046
+ const key = `${first},${second}`;
1047
+ if (first > second || seen.has(key)) continue;
1048
+ seen.add(key);
1049
+ cliques.addEdge(first, second);
1050
+ }
1051
+ }
1052
+ const mutexes = cliques.cliques2(remaining);
1053
+ const sorted: number[][][] = [];
1054
+ for (const mutex of mutexes) (sorted[mutex.length] ??= []).push(mutex);
1055
+ const result = extMutexes;
1056
+ for (let size = sorted.length; size-- > 0;) result.push(...(sorted[size] ?? []));
1057
+ return result;
1058
+ }
1059
+
1060
+ private shouldCancel() {
1061
+ if (!this.limit.inc()) {
1062
+ this.isModelCurrent = false;
1063
+ this.reasonUnknown = "sat.canceled";
1064
+ return true;
1065
+ }
1066
+ if (this.config.restartMax <= this.restarts) {
1067
+ this.reasonUnknown = "sat.max.restarts";
1068
+ return true;
1069
+ }
1070
+ if (this.config.inprocessMax <= this.simplifications) {
1071
+ this.reasonUnknown = "sat.max.inprocess";
1072
+ return true;
1073
+ }
1074
+ return this.reachedMaxConflicts();
1075
+ }
1076
+
1077
+ private reachedMaxConflicts() {
1078
+ if (this.config.maxConflicts === 0 || this.conflictsSinceInit > this.config.maxConflicts) {
1079
+ this.reasonUnknown = "sat.max.conflicts";
1080
+ return !this.isInconsistent;
1081
+ }
1082
+ return false;
1083
+ }
1084
+
1085
+ private nextVar() {
1086
+ if (this.rand.next() < Math.trunc(this.config.randomFreq * RANDOM_MAX_VALUE)) {
1087
+ if (this.numVars() === 0) return -1;
1088
+ const next = this.rand.next() % this.numVars();
1089
+ if (this.valueVar(next) === L_UNDEF && !this.wasEliminated(next)) return next;
1090
+ }
1091
+ while (!this.caseSplitQueue.isEmpty()) {
1092
+ const next = this.caseSplitQueue.nextVar();
1093
+ if (this.valueVar(next) === L_UNDEF && !this.wasEliminated(next)) return next;
1094
+ }
1095
+ return -1;
1096
+ }
1097
+
1098
+ private guess(next: number) {
1099
+ const extPhase = this.ext?.getPhase?.(next) ?? L_UNDEF;
1100
+ if (extPhase !== L_UNDEF) return extPhase === L_TRUE;
1101
+ switch (this.config.phase) {
1102
+ case PS_ALWAYS_TRUE:
1103
+ return true;
1104
+ case PS_ALWAYS_FALSE:
1105
+ return false;
1106
+ case PS_BASIC_CACHING:
1107
+ return this.phase[next];
1108
+ case PS_FROZEN:
1109
+ return this.bestPhase[next];
1110
+ case PS_SAT_CACHING:
1111
+ return this.searchState === S_UNSAT ? this.phase[next] : this.bestPhase[next];
1112
+ default:
1113
+ return this.rand.next() % 2 === 0;
1114
+ }
1115
+ }
1116
+
1117
+ private decide() {
1118
+ const next = this.nextVar();
1119
+ if (next === -1) return false;
1120
+ this.push();
1121
+ this.assignScoped(2 * next + (this.guess(next) ? 0 : 1));
1122
+ return true;
1123
+ }
1124
+
1125
+ boundedSearch() {
1126
+ this.isSimplifyEnabled = false;
1127
+ this.isRestartEnabled = false;
1128
+ try {
1129
+ return this.basicSearch();
1130
+ } finally {
1131
+ this.isSimplifyEnabled = true;
1132
+ this.isRestartEnabled = true;
1133
+ }
1134
+ }
1135
+
1136
+ private basicSearch() {
1137
+ let result = L_UNDEF;
1138
+ while (result === L_UNDEF && !this.isGivenUp && !this.shouldCancel()) {
1139
+ if (this.isInconsistent) result = this.resolveConflictCore();
1140
+ else if (this.qhead < this.trail.length || this.ext?.canPropagate?.() === true)
1141
+ this.propagate(true);
1142
+ else if (this.doCleanup(false)) continue;
1143
+ else if (this.shouldGc()) this.doGc();
1144
+ else if (this.shouldRephase()) this.doRephase();
1145
+ else if (this.shouldRestart()) {
1146
+ if (!this.isRestartEnabled) return L_UNDEF;
1147
+ this.doRestart(!this.config.isRestartFast);
1148
+ } else if (this.shouldSimplify()) this.doSimplify();
1149
+ else if (!this.decide()) result = this.finalCheck();
1150
+ }
1151
+ return result;
1152
+ }
1153
+
1154
+ private finalCheck() {
1155
+ const ext = this.ext;
1156
+ if (ext?.check === undefined) {
1157
+ this.mkModel();
1158
+ return L_TRUE;
1159
+ }
1160
+ switch (ext.check()) {
1161
+ case CR_DONE:
1162
+ this.mkModel();
1163
+ return L_TRUE;
1164
+ case CR_GIVEUP:
1165
+ this.reasonUnknown = ext.getReasonUnknown?.() ?? "unknown";
1166
+ this.isGivenUp = true;
1167
+ return L_UNDEF;
1168
+ default:
1169
+ return L_UNDEF;
1170
+ }
1171
+ }
1172
+
1173
+ initSearch() {
1174
+ this.isModelCurrent = false;
1175
+ this.phaseCounter = 0;
1176
+ this.searchState = S_UNSAT;
1177
+ this.searchUnsatConflicts = this.config.searchUnsatConflicts;
1178
+ this.searchSatConflicts = this.config.searchSatConflicts;
1179
+ this.searchNextToggle = this.searchUnsatConflicts;
1180
+ this.bestPhaseSize = 0;
1181
+ this.rephaseLim = 0;
1182
+ this.rephaseInc = 0;
1183
+ this.conflictsSinceRestart = 0;
1184
+ this.isForcingConflictAnalysis = false;
1185
+ this.restartThreshold = this.config.restartInitial;
1186
+ this.lubyIndex = 1;
1187
+ this.gcThreshold = this.config.gcInitial;
1188
+ this.defragThreshold = 2;
1189
+ this.restarts = 0;
1190
+ this.simplifications = 0;
1191
+ this.conflictsSinceInit = 0;
1192
+ this.nextSimplify = this.config.simplifyDelay;
1193
+ this.minDTk = 1;
1194
+ this.searchLvl = 0;
1195
+ if (this.learned.length <= 2 * this.clauses.length) this.conflictsSinceGc = 0;
1196
+ this.asymmBranch.initSearch();
1197
+ this.core = [];
1198
+ this.simplifier.initSearch();
1199
+ this.ext?.initSearch?.();
1200
+ }
1201
+
1202
+ private shouldSimplify() {
1203
+ return this.conflictsSinceInit >= this.nextSimplify && this.isSimplifyEnabled;
1204
+ }
1205
+
1206
+ doSimplify() {
1207
+ if (!this.shouldSimplify()) return;
1208
+ this.simplifications++;
1209
+ this.pop(this.scopeLvl);
1210
+ this.cleaner.run(this.config.isForcingCleanup);
1211
+ this.scc.run();
1212
+ this.ext?.preSimplify?.();
1213
+ this.simplifier.run(false);
1214
+ if (this.learned.length > 0) this.simplifier.run(true);
1215
+ this.sortWatchLits();
1216
+ this.ext?.simplify();
1217
+ this.probing.run(false);
1218
+ this.asymmBranch.run(false);
1219
+ this.reinitAssumptions();
1220
+ if (this.isInconsistent) return;
1221
+ if (this.nextSimplify === 0) this.nextSimplify = this.config.nextSimplify1;
1222
+ else {
1223
+ this.nextSimplify = Math.trunc(this.conflictsSinceInit * this.config.simplifyMult2);
1224
+ if (this.nextSimplify > this.conflictsSinceInit + this.config.simplifyMax)
1225
+ this.nextSimplify = this.conflictsSinceInit + this.config.simplifyMax;
1226
+ }
1227
+ }
1228
+
1229
+ private sortWatchLits() {
1230
+ for (const wlist of this.watches) wlist.sortBinariesFirst();
1231
+ }
1232
+
1233
+ private mkModel() {
1234
+ this.isModelCurrent = true;
1235
+ const numVars = this.numVars();
1236
+ this.model = new Int8Array(numVars);
1237
+ for (let boolVar = 0; boolVar < numVars; boolVar++) {
1238
+ if (this.wasEliminated(boolVar)) continue;
1239
+ this.model[boolVar] = this.valueVar(boolVar);
1240
+ const isTrue = this.valueVar(boolVar) === L_TRUE;
1241
+ this.setPhase(boolVar, isTrue);
1242
+ this.setBestPhase(boolVar, isTrue);
1243
+ }
1244
+ this.mc.apply(this.model);
1245
+ }
1246
+
1247
+ private shouldRestart() {
1248
+ if (this.conflictsSinceRestart <= this.restartThreshold) return false;
1249
+ if (this.scopeLvl < 2 + this.searchLvl) return false;
1250
+ if (this.caseSplitQueue.isEmpty()) return false;
1251
+ if (this.config.restart !== RS_EMA) return true;
1252
+ return (
1253
+ this.fastGlueAvg.value + this.searchLvl <= this.scopeLvl &&
1254
+ this.config.restartMargin * this.slowGlueAvg.value <= this.fastGlueAvg.value
1255
+ );
1256
+ }
1257
+
1258
+ doRestart(isToBase: boolean) {
1259
+ this.restarts++;
1260
+ this.popReinit(this.restartLevel(isToBase));
1261
+ this.setNextRestart();
1262
+ }
1263
+
1264
+ private restartLevel(isToBase: boolean) {
1265
+ if (isToBase || this.scopeLvl === this.searchLvl) return this.scopeLvl - this.searchLvl;
1266
+ const next = this.caseSplitQueue.minVar();
1267
+ let level = this.searchLvl;
1268
+ while (
1269
+ level < this.scopeLvl &&
1270
+ this.caseSplitQueue.isMoreActive(this.trail[this.scopes[level].trailLim] >> 1, next)
1271
+ )
1272
+ level++;
1273
+ return level - this.searchLvl;
1274
+ }
1275
+
1276
+ private setNextRestart() {
1277
+ this.conflictsSinceRestart = 0;
1278
+ switch (this.config.restart) {
1279
+ case RS_GEOMETRIC:
1280
+ this.restartThreshold = Math.trunc(this.restartThreshold * this.config.restartFactor);
1281
+ break;
1282
+ case RS_LUBY:
1283
+ this.lubyIndex++;
1284
+ this.restartThreshold = this.config.restartInitial * getLuby(this.lubyIndex);
1285
+ break;
1286
+ case RS_EMA:
1287
+ this.restartThreshold = this.config.restartInitial;
1288
+ break;
1289
+ }
1290
+ }
1291
+
1292
+ private resolveConflictCore() {
1293
+ this.conflictsSinceInit++;
1294
+ this.conflictsSinceRestart++;
1295
+ this.conflictsSinceGc++;
1296
+ this.conflicts++;
1297
+ const conflict = this.getMaxLvl(this.notL, this.conflictKind, this.conflictVal);
1298
+ this.conflictLevel = conflict.level;
1299
+ if (
1300
+ this.conflictLevel <= 1 &&
1301
+ (this.assumptions.length > 0 || this.userScopeLiterals.length > 0)
1302
+ ) {
1303
+ this.resolveConflictForUnsatCore();
1304
+ return L_FALSE;
1305
+ }
1306
+ if (this.conflictLevel === 0) return L_FALSE;
1307
+ if (this.allowBacktracking() && conflict.isUniqueMax && !this.isForcingConflictAnalysis) {
1308
+ this.popReinit(this.scopeLvl - this.conflictLevel + 1);
1309
+ this.isForcingConflictAnalysis = true;
1310
+ return L_UNDEF;
1311
+ }
1312
+ this.isForcingConflictAnalysis = false;
1313
+ this.updatePhaseOfVars();
1314
+ if (this.ext !== null) {
1315
+ const result = this.ext.resolveConflict();
1316
+ if (result === L_TRUE) {
1317
+ this.learnLemmaAndBackjump();
1318
+ return L_UNDEF;
1319
+ }
1320
+ if (result === L_FALSE) return L_UNDEF;
1321
+ }
1322
+ this.lemma = [NULL_LITERAL];
1323
+ let index = this.skipLiteralsAboveConflictLevel();
1324
+ let numMarks = 0;
1325
+ let consequent = NULL_LITERAL;
1326
+ let kind = this.conflictKind;
1327
+ let val = this.conflictVal;
1328
+ if (this.notL !== NULL_LITERAL) {
1329
+ numMarks = this.processAntecedent(this.notL, numMarks);
1330
+ consequent = this.notL ^ 1;
1331
+ }
1332
+ do {
1333
+ if (kind === JUSTIFICATION_BINARY) numMarks = this.processAntecedent(val ^ 1, numMarks);
1334
+ else if (kind === JUSTIFICATION_CLAUSE) {
1335
+ const arena = this.arena;
1336
+ let position = 0;
1337
+ if (consequent !== NULL_LITERAL) {
1338
+ if (arena.get(val, 0) === consequent) position = 1;
1339
+ else {
1340
+ numMarks = this.processAntecedent(arena.get(val, 0) ^ 1, numMarks);
1341
+ position = 2;
1342
+ }
1343
+ }
1344
+ for (; position < arena.size[val]; position++)
1345
+ numMarks = this.processAntecedent(arena.get(val, position) ^ 1, numMarks);
1346
+ } else if (kind === JUSTIFICATION_EXT)
1347
+ for (const lit of this.getExtAntecedents(consequent, val))
1348
+ numMarks = this.processAntecedent(lit, numMarks);
1349
+ let boolVar: number;
1350
+ for (;;) {
1351
+ consequent = this.trail[index];
1352
+ boolVar = consequent >> 1;
1353
+ if (this.mark[boolVar] && this.lvlVar(boolVar) === this.conflictLevel) break;
1354
+ index--;
1355
+ }
1356
+ kind = this.justKind[boolVar];
1357
+ val = this.justVal[boolVar];
1358
+ index--;
1359
+ numMarks--;
1360
+ this.mark[boolVar] = false;
1361
+ } while (numMarks > 0);
1362
+ this.lemma[0] = consequent ^ 1;
1363
+ this.learnLemmaAndBackjump();
1364
+ return L_UNDEF;
1365
+ }
1366
+
1367
+ private learnLemmaAndBackjump() {
1368
+ if (this.config.isMinimizingLemmas) {
1369
+ this.minimizeLemma();
1370
+ this.resetLemmaVarMarks();
1371
+ if (this.config.isDynSubRes) this.dynSubRes();
1372
+ } else this.resetLemmaVarMarks();
1373
+ const lemma = this.lemma;
1374
+ let backtrackLvl = this.lvl(lemma[0]);
1375
+ let backjumpLvl = 0;
1376
+ for (let index = lemma.length; index-- > 1;)
1377
+ backjumpLvl = Math.max(this.lvl(lemma[index]), backjumpLvl);
1378
+ if (backtrackLvl < backjumpLvl) {
1379
+ backtrackLvl = backjumpLvl;
1380
+ for (let index = lemma.length; index-- > 1;)
1381
+ if (this.lvl(lemma[index]) === backjumpLvl) {
1382
+ const lit = lemma[index];
1383
+ lemma[index] = lemma[0];
1384
+ lemma[0] = lit;
1385
+ break;
1386
+ }
1387
+ }
1388
+ const glue = this.numDiffLevels(lemma);
1389
+ this.fastGlueAvg.update(glue);
1390
+ this.slowGlueAvg.update(glue);
1391
+ const numScopes = this.scopeLvl - backjumpLvl;
1392
+ if (this.useBackjumping(numScopes)) this.popReinit(numScopes);
1393
+ else this.popReinit(this.scopeLvl - backtrackLvl + 1);
1394
+ const clause = this.mkClauseCore(lemma, true);
1395
+ if (clause !== -1) this.arena.setGlue(clause, glue);
1396
+ this.lemma = [];
1397
+ this.activityInc = Math.trunc(((this.activityInc * this.config.variableDecay) % 2 ** 32) / 100);
1398
+ this.updatePhaseCounters();
1399
+ }
1400
+
1401
+ private useBackjumping(numScopes: number) {
1402
+ return numScopes > 0 && (numScopes <= this.config.backtrackScopes || !this.allowBacktracking());
1403
+ }
1404
+
1405
+ private allowBacktracking() {
1406
+ return this.conflictsSinceInit > this.config.backtrackInitConflicts;
1407
+ }
1408
+
1409
+ getMaxLvl(notL: number, kind: number, val: number) {
1410
+ let isUniqueMax = true;
1411
+ let level = notL !== NULL_LITERAL ? this.lvl(notL) : 0;
1412
+ const update = (lit: number) => {
1413
+ const litLevel = this.lvl(lit);
1414
+ if (litLevel < level) return;
1415
+ isUniqueMax = litLevel > level;
1416
+ level = litLevel;
1417
+ };
1418
+ if (kind === JUSTIFICATION_NONE) level = Math.max(level, this.conflictJustLevel);
1419
+ else if (kind === JUSTIFICATION_BINARY) update(val);
1420
+ else if (kind === JUSTIFICATION_EXT)
1421
+ for (const lit of this.getExtAntecedents(notL === NULL_LITERAL ? notL : notL ^ 1, val))
1422
+ update(lit);
1423
+ else
1424
+ for (let index = 0; index < this.arena.size[val]; index++) update(this.arena.get(val, index));
1425
+ return { level, isUniqueMax };
1426
+ }
1427
+
1428
+ private getExtAntecedents(consequent: number, index: number) {
1429
+ const antecedents: number[] = [];
1430
+ (this.ext as SatExtension).getAntecedents(consequent, index, antecedents);
1431
+ return antecedents;
1432
+ }
1433
+
1434
+ private skipLiteralsAboveConflictLevel() {
1435
+ let index = this.trail.length;
1436
+ if (index === 0) return index;
1437
+ index--;
1438
+ while (this.lvl(this.trail[index]) > this.conflictLevel) index--;
1439
+ return index;
1440
+ }
1441
+
1442
+ private processAntecedent(antecedent: number, numMarks: number) {
1443
+ const boolVar = antecedent >> 1;
1444
+ const varLvl = this.lvlVar(boolVar);
1445
+ if (this.mark[boolVar] || varLvl <= 0) return numMarks;
1446
+ this.mark[boolVar] = true;
1447
+ this.incActivity(boolVar);
1448
+ if (varLvl === this.conflictLevel) return numMarks + 1;
1449
+ this.lemma.push(antecedent ^ 1);
1450
+ return numMarks;
1451
+ }
1452
+
1453
+ private isTwoPhase() {
1454
+ return this.config.phase === PS_SAT_CACHING;
1455
+ }
1456
+
1457
+ private isSatPhase() {
1458
+ return this.isTwoPhase() && this.searchState === S_SAT;
1459
+ }
1460
+
1461
+ private updatePhaseOfVars() {
1462
+ if (this.config.phase === PS_FROZEN) return;
1463
+ const fromLvl = this.conflictLevel;
1464
+ const head = fromLvl === 0 ? 0 : this.scopes[fromLvl - 1].trailLim;
1465
+ for (let index = head; index < this.trail.length; index++)
1466
+ this.setPhase(this.trail[index] >> 1, this.rand.next() % 2 === 0);
1467
+ if (this.isSatPhase() && head >= this.bestPhaseSize) {
1468
+ this.bestPhaseSize = head;
1469
+ for (let index = 0; index < head; index++) {
1470
+ const boolVar = this.trail[index] >> 1;
1471
+ this.setBestPhase(boolVar, this.phase[boolVar]);
1472
+ }
1473
+ }
1474
+ }
1475
+
1476
+ private shouldToggleSearchState() {
1477
+ if (this.searchState === S_UNSAT) this.trailAvg.update(this.trail.length);
1478
+ return (
1479
+ this.phaseCounter >= this.searchNextToggle &&
1480
+ (this.searchState === S_SAT || this.trail.length > 0.5 * this.trailAvg.value)
1481
+ );
1482
+ }
1483
+
1484
+ private doToggleSearchState() {
1485
+ if (this.isTwoPhase()) {
1486
+ this.bestPhaseSize = 0;
1487
+ [this.fastGlueBackup, this.fastGlueAvg] = [this.fastGlueAvg, this.fastGlueBackup];
1488
+ [this.slowGlueBackup, this.slowGlueAvg] = [this.slowGlueAvg, this.slowGlueBackup];
1489
+ if (this.searchState === S_SAT) this.searchUnsatConflicts += this.config.searchUnsatConflicts;
1490
+ else this.searchSatConflicts += this.config.searchSatConflicts;
1491
+ }
1492
+ if (this.searchState === S_UNSAT) {
1493
+ this.searchState = S_SAT;
1494
+ this.searchNextToggle = this.searchSatConflicts;
1495
+ } else {
1496
+ this.searchState = S_UNSAT;
1497
+ this.searchNextToggle = this.searchUnsatConflicts;
1498
+ }
1499
+ this.phaseCounter = 0;
1500
+ }
1501
+
1502
+ private shouldRephase() {
1503
+ return this.conflictsSinceInit > this.rephaseLim;
1504
+ }
1505
+
1506
+ private doRephase() {
1507
+ const size = this.phase.length;
1508
+ switch (this.config.phase) {
1509
+ case PS_ALWAYS_TRUE:
1510
+ for (let index = 0; index < size; index++) this.setPhase(index, true);
1511
+ break;
1512
+ case PS_ALWAYS_FALSE:
1513
+ for (let index = 0; index < size; index++) this.setPhase(index, false);
1514
+ break;
1515
+ case PS_BASIC_CACHING:
1516
+ switch (this.rephaseCount % 4) {
1517
+ case 0:
1518
+ for (let index = 0; index < size; index++)
1519
+ this.setPhase(index, this.rand.next() % 2 === 0);
1520
+ break;
1521
+ case 1:
1522
+ for (let index = 0; index < size; index++) this.setPhase(index, false);
1523
+ break;
1524
+ case 2:
1525
+ for (let index = 0; index < size; index++) this.setPhase(index, !this.phase[index]);
1526
+ break;
1527
+ }
1528
+ break;
1529
+ case PS_SAT_CACHING:
1530
+ if (this.searchState === S_SAT)
1531
+ for (let index = 0; index < size; index++) this.setPhase(index, this.bestPhase[index]);
1532
+ break;
1533
+ case PS_RANDOM:
1534
+ for (let index = 0; index < size; index++) this.setPhase(index, this.rand.next() % 2 === 0);
1535
+ break;
1536
+ }
1537
+ this.rephaseInc += this.config.rephaseBase;
1538
+ this.rephaseLim += this.rephaseInc;
1539
+ this.rephaseCount++;
1540
+ }
1541
+
1542
+ private updatePhaseCounters() {
1543
+ this.phaseCounter++;
1544
+ if (this.shouldToggleSearchState()) this.doToggleSearchState();
1545
+ }
1546
+
1547
+ numDiffLevels(lits: number[]) {
1548
+ let result = 0;
1549
+ for (const lit of lits) {
1550
+ const litLvl = this.lvl(lit);
1551
+ if (!this.diffLevels[litLvl]) {
1552
+ this.diffLevels[litLvl] = true;
1553
+ result++;
1554
+ }
1555
+ }
1556
+ for (const lit of lits) this.diffLevels[this.lvl(lit)] = false;
1557
+ return result;
1558
+ }
1559
+
1560
+ numDiffFalseLevelsBelow(lits: number[], maxGlue: number) {
1561
+ let glue = 0;
1562
+ let index = 0;
1563
+ for (; index < lits.length && glue < maxGlue; index++) {
1564
+ if (this.value(lits[index]) !== L_FALSE) continue;
1565
+ const litLvl = this.lvl(lits[index]);
1566
+ if (!this.diffLevels[litLvl]) {
1567
+ this.diffLevels[litLvl] = true;
1568
+ glue++;
1569
+ }
1570
+ }
1571
+ while (index-- > 0)
1572
+ if (this.value(lits[index]) === L_FALSE) this.diffLevels[this.lvl(lits[index])] = false;
1573
+ return glue < maxGlue ? glue : -1;
1574
+ }
1575
+
1576
+ private numDiffLevelsBelow(clause: number, maxGlue: number) {
1577
+ const arena = this.arena;
1578
+ let glue = 0;
1579
+ let index = 0;
1580
+ for (; index < arena.size[clause] && glue < maxGlue; index++) {
1581
+ const litLvl = this.lvl(arena.get(clause, index));
1582
+ if (!this.diffLevels[litLvl]) {
1583
+ this.diffLevels[litLvl] = true;
1584
+ glue++;
1585
+ }
1586
+ }
1587
+ while (index-- > 0) this.diffLevels[this.lvl(arena.get(clause, index))] = false;
1588
+ return glue < maxGlue ? glue : -1;
1589
+ }
1590
+
1591
+ private processAntecedentForMinimization(antecedent: number) {
1592
+ const boolVar = antecedent >> 1;
1593
+ const varLvl = this.lvlVar(boolVar);
1594
+ if (!this.mark[boolVar] && varLvl > 0) {
1595
+ if ((this.lvlSet & (1 << (varLvl & 31))) === 0) return false;
1596
+ this.mark[boolVar] = true;
1597
+ this.unmark.push(boolVar);
1598
+ this.lemmaMinStack.push(antecedent);
1599
+ }
1600
+ return true;
1601
+ }
1602
+
1603
+ private impliedByMarked(start: number) {
1604
+ this.lemmaMinStack = [start];
1605
+ const oldSize = this.unmark.length;
1606
+ while (this.lemmaMinStack.length > 0) {
1607
+ const boolVar = (this.lemmaMinStack.pop() as number) >> 1;
1608
+ const kind = this.justKind[boolVar];
1609
+ const val = this.justVal[boolVar];
1610
+ let isImplied = true;
1611
+ if (kind === JUSTIFICATION_NONE) isImplied = this.lvlVar(boolVar) <= 0;
1612
+ else if (kind === JUSTIFICATION_BINARY)
1613
+ isImplied = this.processAntecedentForMinimization(val ^ 1);
1614
+ else if (kind === JUSTIFICATION_EXT) {
1615
+ const consequent = 2 * boolVar + (this.valueVar(boolVar) === L_FALSE ? 1 : 0);
1616
+ for (const lit of this.getExtAntecedents(consequent, val))
1617
+ if (!(isImplied = this.processAntecedentForMinimization(lit))) break;
1618
+ } else {
1619
+ const arena = this.arena;
1620
+ let position = 1;
1621
+ if (arena.get(val, 0) >> 1 !== boolVar) {
1622
+ isImplied = this.processAntecedentForMinimization(arena.get(val, 0) ^ 1);
1623
+ position = 2;
1624
+ }
1625
+ for (; isImplied && position < arena.size[val]; position++)
1626
+ isImplied = this.processAntecedentForMinimization(arena.get(val, position) ^ 1);
1627
+ }
1628
+ if (!isImplied) {
1629
+ this.resetUnmark(oldSize);
1630
+ return false;
1631
+ }
1632
+ }
1633
+ return true;
1634
+ }
1635
+
1636
+ private resetUnmark(oldSize: number) {
1637
+ for (let index = oldSize; index < this.unmark.length; index++)
1638
+ this.mark[this.unmark[index]] = false;
1639
+ this.unmark.length = oldSize;
1640
+ }
1641
+
1642
+ private minimizeLemma() {
1643
+ this.lvlSet = 0;
1644
+ for (const lit of this.lemma) this.lvlSet |= 1 << (this.lvl(lit) & 31);
1645
+ const size = this.lemma.length;
1646
+ let next = 1;
1647
+ for (let index = 1; index < size; index++) {
1648
+ const lit = this.lemma[index];
1649
+ if (this.impliedByMarked(lit)) this.unmark.push(lit >> 1);
1650
+ else this.lemma[next++] = lit;
1651
+ }
1652
+ this.resetUnmark(0);
1653
+ this.lemma.length = next;
1654
+ }
1655
+
1656
+ private resetLemmaVarMarks() {
1657
+ this.updateLrbReasoned();
1658
+ for (let index = 1; index < this.lemma.length; index++)
1659
+ this.mark[this.lemma[index] >> 1] = false;
1660
+ }
1661
+
1662
+ private updateLrbReasoned() {
1663
+ const lemma = this.lemma;
1664
+ const size = lemma.length;
1665
+ this.mark[lemma[0] >> 1] = true;
1666
+ const reason = (lit: number) => {
1667
+ const boolVar = lit >> 1;
1668
+ if (this.mark[boolVar]) return;
1669
+ this.mark[boolVar] = true;
1670
+ this.incActivity(boolVar);
1671
+ lemma.push(lit);
1672
+ };
1673
+ for (let index = lemma.length; index-- > 0;) {
1674
+ const boolVar = lemma[index] >> 1;
1675
+ const kind = this.justKind[boolVar];
1676
+ const val = this.justVal[boolVar];
1677
+ if (kind === JUSTIFICATION_BINARY) reason(val);
1678
+ else if (kind === JUSTIFICATION_CLAUSE)
1679
+ for (let position = 0; position < this.arena.size[val]; position++)
1680
+ reason(this.arena.get(val, position));
1681
+ else if (kind === JUSTIFICATION_EXT)
1682
+ for (const lit of this.getExtAntecedents(lemma[index] ^ 1, val)) reason(lit);
1683
+ }
1684
+ this.mark[lemma[0] >> 1] = false;
1685
+ for (let index = lemma.length; index-- > size;) this.mark[lemma[index] >> 1] = false;
1686
+ lemma.length = size;
1687
+ }
1688
+
1689
+ private dynSubRes() {
1690
+ const lemma = this.lemma;
1691
+ const size = lemma.length;
1692
+ for (const lit of lemma) this.litMark[lit] = true;
1693
+ const first = lemma[0];
1694
+ for (let index = 0; index < size; index++) {
1695
+ const lit = lemma[index];
1696
+ if (!this.litMark[lit]) continue;
1697
+ const wlist = this.getWlist(lit ^ 1);
1698
+ for (let position = 0; position < wlist.size && wlist.isBinary(position); position++) {
1699
+ const other = wlist.getLiteral(position);
1700
+ if (this.litMark[other ^ 1] && first !== (other ^ 1)) this.litMark[other ^ 1] = false;
1701
+ }
1702
+ const impliedLits = this.probing.cachedImpliedLits(lit ^ 1);
1703
+ if (impliedLits !== undefined)
1704
+ for (const other of impliedLits)
1705
+ if (this.litMark[other ^ 1] && first !== (other ^ 1)) this.litMark[other ^ 1] = false;
1706
+ }
1707
+ let next = 0;
1708
+ for (let index = 0; index < size; index++) {
1709
+ const lit = lemma[index];
1710
+ if (this.litMark[lit]) {
1711
+ this.litMark[lit] = false;
1712
+ lemma[next++] = lit;
1713
+ }
1714
+ }
1715
+ lemma.length = next;
1716
+ }
1717
+
1718
+ push() {
1719
+ this.scopes.push({
1720
+ trailLim: this.trail.length,
1721
+ clausesToReinitLim: this.clausesToReinit.length,
1722
+ });
1723
+ this.scopeLvl++;
1724
+ if (this.ext !== null) {
1725
+ this.varsLim.push(this.activeVars.length);
1726
+ this.ext.push();
1727
+ }
1728
+ }
1729
+
1730
+ popReinit(numScopes: number) {
1731
+ this.pop(numScopes);
1732
+ this.reinitAssumptions();
1733
+ }
1734
+
1735
+ // pop_vars keeps every variable made in the popped scopes: no variable is freed for reuse.
1736
+ private popVars(numScopes: number) {
1737
+ this.varsToReinit = [];
1738
+ const oldNumVars = this.varsLim[this.varsLim.length - numScopes];
1739
+ this.varsLim.length -= numScopes;
1740
+ const newLvl = this.scopes.length - numScopes;
1741
+ for (let index = oldNumVars; index < this.activeVars.length; index++) {
1742
+ const boolVar = this.activeVars[index];
1743
+ this.varsToReinit.push(boolVar);
1744
+ this.varScope[boolVar] = newLvl;
1745
+ }
1746
+ }
1747
+
1748
+ pop(numScopes: number) {
1749
+ if (numScopes === 0) return;
1750
+ if (this.ext !== null) {
1751
+ this.popVars(numScopes);
1752
+ this.ext.pop(numScopes);
1753
+ }
1754
+ const newLvl = this.scopeLvl - numScopes;
1755
+ const scope = this.scopes[newLvl];
1756
+ this.isInconsistent = false;
1757
+ this.unassignVars(scope.trailLim, newLvl);
1758
+ this.scopeLvl -= numScopes;
1759
+ this.reinitClauses(scope.clausesToReinitLim);
1760
+ this.scopes.length = newLvl;
1761
+ this.ext?.popReinit();
1762
+ }
1763
+
1764
+ private unassignVars(oldSize: number, newLvl: number) {
1765
+ for (let index = this.trail.length; index-- > oldSize;) {
1766
+ const lit = this.trail[index];
1767
+ const boolVar = lit >> 1;
1768
+ if (this.lvlVar(boolVar) <= newLvl) {
1769
+ this.replayAssign.push(lit);
1770
+ continue;
1771
+ }
1772
+ this.assignment[lit] = L_UNDEF;
1773
+ this.assignment[lit ^ 1] = L_UNDEF;
1774
+ this.caseSplitQueue.unassignVar(boolVar);
1775
+ }
1776
+ this.trail.length = oldSize;
1777
+ this.qhead = oldSize;
1778
+ for (let index = this.replayAssign.length; index-- > 0;)
1779
+ this.trail.push(this.replayAssign[index]);
1780
+ this.replayAssign.length = 0;
1781
+ }
1782
+
1783
+ private reinitClauses(oldSize: number) {
1784
+ const stack = this.clausesToReinit;
1785
+ let next = oldSize;
1786
+ for (let index = oldSize; index < stack.length; index += 2) {
1787
+ const first = stack[index];
1788
+ const second = stack[index + 1];
1789
+ if (second !== NULL_LITERAL) {
1790
+ if (
1791
+ (this.propagateBinClause(first, second) && !this.atBaseLvl()) ||
1792
+ (this.hasVariablesToReinitBinary(first, second) && !this.atBaseLvl())
1793
+ ) {
1794
+ stack[next++] = first;
1795
+ stack[next++] = second;
1796
+ }
1797
+ continue;
1798
+ }
1799
+ this.detachClause(first);
1800
+ const isReinit = this.attachClause(first);
1801
+ if (
1802
+ (isReinit && !this.atBaseLvl()) ||
1803
+ (this.hasVariablesToReinit(first) && !this.atBaseLvl())
1804
+ ) {
1805
+ stack[next++] = first;
1806
+ stack[next++] = second;
1807
+ } else this.arena.setReinitStack(first, false);
1808
+ }
1809
+ stack.length = next;
1810
+ }
1811
+
1812
+ popToBaseLevel() {
1813
+ this.resetAssumptions();
1814
+ this.pop(this.scopeLvl);
1815
+ this.isModelCurrent = false;
1816
+ }
1817
+
1818
+ // user_push: every clause added in the scope is guarded by the scope's literal. Without free
1819
+ // variables, the scope variable is the last one.
1820
+ userPush() {
1821
+ this.popToBaseLevel();
1822
+ this.userScopeLiterals.push(2 * this.mkVar(true));
1823
+ this.ext?.userPush?.();
1824
+ }
1825
+
1826
+ userPop(numScopes: number) {
1827
+ if (this.userScopeLiterals.length === 0) return;
1828
+ const oldSize = this.userScopeLiterals.length - numScopes;
1829
+ const maxVar = this.userScopeLiterals[oldSize] >> 1;
1830
+ this.userScopeLiterals.length = oldSize;
1831
+ this.popToBaseLevel();
1832
+ this.ext?.userPop?.(numScopes);
1833
+ this.gcVars(maxVar);
1834
+ this.qhead = 0;
1835
+ const wasSuspended = this.limit.isSuspended;
1836
+ this.limit.isSuspended = true;
1837
+ this.propagate(false);
1838
+ this.limit.isSuspended = wasSuspended;
1839
+ }
1840
+
1841
+ // gc_vars: drop the variables from maxVar on, with their watches and clauses.
1842
+ private gcVars(maxVar: number) {
1843
+ this.initVisited();
1844
+ const others: number[] = [];
1845
+ for (let lit = 2 * maxVar; lit < 2 * this.varCount; lit++) {
1846
+ const wlist = this.watches[lit];
1847
+ for (let index = 0; index < wlist.size; index++) {
1848
+ const other = wlist.getLiteral(index);
1849
+ if (wlist.isBinary(index) && other >> 1 < maxVar && !this.isVisited(other)) {
1850
+ others.push(other);
1851
+ this.markVisited(other);
1852
+ }
1853
+ }
1854
+ wlist.size = 0;
1855
+ }
1856
+ for (const lit of others) {
1857
+ const wlist = this.watches[lit ^ 1];
1858
+ let next = 0;
1859
+ for (let index = 0; index < wlist.size; index++)
1860
+ if (!wlist.isBinary(index) || wlist.getLiteral(index) >> 1 < maxVar) {
1861
+ wlist.data[2 * next] = wlist.data[2 * index];
1862
+ wlist.data[2 * next + 1] = wlist.data[2 * index + 1];
1863
+ next++;
1864
+ }
1865
+ wlist.size = next;
1866
+ }
1867
+ const gcClauses = (clauses: number[]) => {
1868
+ let next = 0;
1869
+ for (const clause of clauses) {
1870
+ if (this.arena.getLits(clause).some((lit) => lit >> 1 >= maxVar)) {
1871
+ this.detachClause(clause);
1872
+ this.delClause(clause);
1873
+ } else clauses[next++] = clause;
1874
+ }
1875
+ clauses.length = next;
1876
+ };
1877
+ gcClauses(this.learned);
1878
+ gcClauses(this.clauses);
1879
+ this.ext?.gcVars?.(maxVar);
1880
+ let next = 0;
1881
+ for (const lit of this.trail) if (lit >> 1 < maxVar) this.trail[next++] = lit;
1882
+ this.trail.length = next;
1883
+ this.shrinkVars(maxVar);
1884
+ }
1885
+
1886
+ private shrinkVars(boolVar: number) {
1887
+ for (let index = this.varCount; index-- > boolVar;) {
1888
+ this.caseSplitQueue.delVar(index);
1889
+ this.probing.resetCache(2 * index + 1);
1890
+ this.probing.resetCache(2 * index);
1891
+ }
1892
+ this.varCount = boolVar;
1893
+ this.watches.length = 2 * boolVar;
1894
+ this.assignment.fill(L_UNDEF, 2 * boolVar);
1895
+ for (const values of [
1896
+ this.justVal,
1897
+ this.justKind,
1898
+ this.eliminated,
1899
+ this.external,
1900
+ this.varScope,
1901
+ this.touched,
1902
+ this.activity,
1903
+ this.mark,
1904
+ this.phase,
1905
+ this.bestPhase,
1906
+ this.prevPhase,
1907
+ this.phaseBirthdate,
1908
+ this.bestPhaseBirthdate,
1909
+ this.assignedSinceGc,
1910
+ ])
1911
+ values.length = boolVar;
1912
+ this.litMark.length = 2 * boolVar;
1913
+ this.simplifier.resetTodos();
1914
+ }
1915
+
1916
+ incActivity(boolVar: number) {
1917
+ this.activity[boolVar] += this.activityInc;
1918
+ this.caseSplitQueue.activityIncreased(boolVar);
1919
+ if (this.activity[boolVar] > 1 << 24) this.rescaleActivity();
1920
+ }
1921
+
1922
+ private rescaleActivity() {
1923
+ for (let index = 0; index < this.activity.length; index++) this.activity[index] >>>= 14;
1924
+ this.activityInc >>>= 14;
1925
+ }
1926
+
1927
+ doCleanup(isForced: boolean) {
1928
+ if (this.conflictsSinceInit === 0 && !isForced) return false;
1929
+ return this.atBaseLvl() && !this.isInconsistent && this.cleaner.run(isForced);
1930
+ }
1931
+
1932
+ private shouldGc() {
1933
+ return (
1934
+ this.conflictsSinceGc > this.gcThreshold &&
1935
+ (this.config.gcStrategy !== GC_DYN_PSM || this.atBaseLvl())
1936
+ );
1937
+ }
1938
+
1939
+ private doGc() {
1940
+ if (!this.shouldGc()) return;
1941
+ const gc = this.gcClauses;
1942
+ this.conflictsSinceGc = 0;
1943
+ this.gcThreshold += this.config.gcIncrement;
1944
+ const arena = this.arena;
1945
+ const glue = (clause: number) => arena.glue[clause];
1946
+ const psm = (clause: number) => arena.psm[clause];
1947
+ const size = (clause: number) => arena.size[clause];
1948
+ const lex =
1949
+ (...keys: ((clause: number) => number)[]) =>
1950
+ (first: number, second: number) => {
1951
+ for (const key of keys) {
1952
+ if (key(first) < key(second)) return true;
1953
+ if (key(first) > key(second)) return false;
1954
+ }
1955
+ return false;
1956
+ };
1957
+ switch (this.config.gcStrategy) {
1958
+ case GC_GLUE:
1959
+ sortClauses(this.learned, lex(glue, size));
1960
+ this.gcHalf();
1961
+ break;
1962
+ case GC_PSM:
1963
+ this.savePsm();
1964
+ sortClauses(this.learned, lex(psm, size));
1965
+ this.gcHalf();
1966
+ break;
1967
+ case GC_GLUE_PSM:
1968
+ this.savePsm();
1969
+ sortClauses(this.learned, lex(glue, psm, size));
1970
+ this.gcHalf();
1971
+ break;
1972
+ case GC_PSM_GLUE:
1973
+ this.savePsm();
1974
+ sortClauses(this.learned, lex(psm, glue, size));
1975
+ this.gcHalf();
1976
+ break;
1977
+ case GC_DYN_PSM:
1978
+ if (!this.atBaseLvl()) return;
1979
+ this.gcDynPsm();
1980
+ break;
1981
+ }
1982
+ this.ext?.gc();
1983
+ if (gc > 0 && this.shouldDefrag()) this.defragClauses();
1984
+ }
1985
+
1986
+ private savePsm() {
1987
+ for (const clause of this.learned) this.arena.setPsm(clause, this.psm(clause));
1988
+ }
1989
+
1990
+ private gcHalf() {
1991
+ const size = this.learned.length;
1992
+ let next = size >>> 1;
1993
+ for (let index = size >>> 1; index < size; index++) {
1994
+ const clause = this.learned[index];
1995
+ if (this.canDelete(clause)) {
1996
+ this.detachClause(clause);
1997
+ this.delClause(clause);
1998
+ } else this.learned[next++] = clause;
1999
+ }
2000
+ this.gcClauses += size - next;
2001
+ this.learned.length = next;
2002
+ }
2003
+
2004
+ canDelete(clause: number) {
2005
+ if (this.arena.isOnReinitStack(clause)) return false;
2006
+ const first = this.arena.get(clause, 0);
2007
+ if (this.value(first) !== L_TRUE) return true;
2008
+ return (
2009
+ this.justKind[first >> 1] !== JUSTIFICATION_CLAUSE || this.justVal[first >> 1] !== clause
2010
+ );
2011
+ }
2012
+
2013
+ private gcDynPsm() {
2014
+ let flips = 0;
2015
+ let assigned = 0;
2016
+ for (let boolVar = 0; boolVar < this.numVars(); boolVar++) {
2017
+ if (this.assignedSinceGc[boolVar]) {
2018
+ assigned++;
2019
+ this.assignedSinceGc[boolVar] = false;
2020
+ }
2021
+ if (this.phase[boolVar] !== this.prevPhase[boolVar]) {
2022
+ flips++;
2023
+ this.prevPhase[boolVar] = this.phase[boolVar];
2024
+ }
2025
+ }
2026
+ const dTk = assigned === 0 ? this.numVars() + 1 : flips / assigned;
2027
+ if (dTk < this.minDTk) this.minDTk = dTk;
2028
+ const arena = this.arena;
2029
+ let next = 0;
2030
+ for (const clause of this.learned) {
2031
+ if (!arena.isFrozen(clause)) {
2032
+ if (arena.glue[clause] > this.config.gcSmallLbd) {
2033
+ if (arena.wasUsed(clause)) arena.inactRounds[clause] = 0;
2034
+ else {
2035
+ arena.incInactRounds(clause);
2036
+ if (arena.inactRounds[clause] > this.config.gcK) {
2037
+ this.detachClause(clause);
2038
+ this.delClause(clause);
2039
+ this.gcClauses++;
2040
+ continue;
2041
+ }
2042
+ }
2043
+ arena.unmarkUsed(clause);
2044
+ if (this.psm(clause) > Math.trunc(arena.size[clause] * this.minDTk)) {
2045
+ this.detachClause(clause);
2046
+ arena.inactRounds[clause] = 0;
2047
+ arena.setFrozen(clause, true);
2048
+ }
2049
+ }
2050
+ } else if (this.psm(clause) <= Math.trunc(arena.size[clause] * this.minDTk)) {
2051
+ arena.setFrozen(clause, false);
2052
+ if (!this.activateFrozenClause(clause)) {
2053
+ this.delClause(clause);
2054
+ continue;
2055
+ }
2056
+ } else {
2057
+ arena.incInactRounds(clause);
2058
+ if (arena.inactRounds[clause] > this.config.gcK) {
2059
+ this.delClause(clause);
2060
+ this.gcClauses++;
2061
+ continue;
2062
+ }
2063
+ }
2064
+ this.learned[next++] = clause;
2065
+ }
2066
+ this.learned.length = next;
2067
+ }
2068
+
2069
+ private activateFrozenClause(clause: number) {
2070
+ const arena = this.arena;
2071
+ const size = arena.size[clause];
2072
+ let next = 0;
2073
+ for (let index = 0; index < size; index++) {
2074
+ const value = this.value(arena.get(clause, index));
2075
+ if (value === L_TRUE) return false;
2076
+ if (value === L_UNDEF) {
2077
+ if (index !== next) arena.swap(clause, index, next);
2078
+ next++;
2079
+ }
2080
+ }
2081
+ switch (next) {
2082
+ case 0:
2083
+ this.setConflict();
2084
+ return false;
2085
+ case 1:
2086
+ this.assignUnit(arena.get(clause, 0));
2087
+ return false;
2088
+ case 2:
2089
+ this.mkBinClause(arena.get(clause, 0), arena.get(clause, 1), true);
2090
+ return false;
2091
+ default:
2092
+ this.shrink(clause, size, next);
2093
+ this.attachClause(clause);
2094
+ return true;
2095
+ }
2096
+ }
2097
+
2098
+ private psm(clause: number) {
2099
+ const arena = this.arena;
2100
+ let result = 0;
2101
+ for (let index = 0; index < arena.size[clause]; index++) {
2102
+ const lit = arena.get(clause, index);
2103
+ if (((lit & 1) === 1) !== this.phase[lit >> 1]) result++;
2104
+ }
2105
+ return result;
2106
+ }
2107
+ }