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

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 (568) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +3 -0
  8. package/dist/index.d.ts +3 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2682 -426
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +42 -39
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +49 -702
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +0 -2
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +55 -338
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/json.ts +4 -7
  48. package/src/levels.ts +39 -42
  49. package/src/lexer.ts +5 -3
  50. package/src/liveness-checker.ts +553 -237
  51. package/src/liveness.ts +94 -86
  52. package/src/obligations/action.ts +14 -17
  53. package/src/obligations/anonymize.ts +37 -16
  54. package/src/obligations/enabled-axioms.ts +218 -0
  55. package/src/obligations/equality.ts +1 -3
  56. package/src/obligations/expression.ts +36 -8
  57. package/src/obligations/format.ts +0 -2
  58. package/src/obligations/generate.ts +66 -54
  59. package/src/obligations/index.ts +38 -8
  60. package/src/obligations/levels.ts +24 -11
  61. package/src/obligations/module.ts +28 -41
  62. package/src/obligations/normalize.ts +26 -14
  63. package/src/obligations/operators.ts +0 -2
  64. package/src/obligations/pragma.ts +53 -16
  65. package/src/obligations/printer.ts +43 -13
  66. package/src/obligations/proof.ts +3 -2
  67. package/src/obligations/regroup.ts +0 -2
  68. package/src/obligations/simplify.ts +55 -50
  69. package/src/obligations/source.ts +118 -74
  70. package/src/obligations/subexpression.ts +45 -18
  71. package/src/obligations/substitution.ts +1 -3
  72. package/src/obligations/temporal.ts +5 -7
  73. package/src/obligations/tuples.ts +0 -2
  74. package/src/parallel-worker.ts +10 -30
  75. package/src/parallel.ts +24 -47
  76. package/src/parser.ts +580 -180
  77. package/src/pretty-print.ts +1 -1
  78. package/src/prover/decide-pool.ts +3 -3
  79. package/src/prover/deciders.ts +12 -9
  80. package/src/prover/isabelle/decide.ts +3 -25
  81. package/src/prover/isabelle/encode.ts +72 -42
  82. package/src/prover/isabelle/isar/attrib.ts +250 -0
  83. package/src/prover/isabelle/isar/context.ts +335 -0
  84. package/src/prover/isabelle/isar/induct.ts +382 -0
  85. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  86. package/src/prover/isabelle/isar/method.ts +509 -212
  87. package/src/prover/isabelle/isar/proof.ts +570 -14
  88. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  89. package/src/prover/isabelle/isar/theory.ts +487 -76
  90. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  91. package/src/prover/isabelle/isar/type-check.ts +89 -14
  92. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  93. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  94. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  98. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  99. package/src/prover/isabelle/provers/classical.ts +45 -20
  100. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  101. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  102. package/src/prover/isabelle/pure/consts.ts +0 -2
  103. package/src/prover/isabelle/pure/conv.ts +2 -10
  104. package/src/prover/isabelle/pure/drule.ts +72 -6
  105. package/src/prover/isabelle/pure/envir.ts +0 -2
  106. package/src/prover/isabelle/pure/goal.ts +1 -3
  107. package/src/prover/isabelle/pure/logic.ts +1 -3
  108. package/src/prover/isabelle/pure/name.ts +0 -2
  109. package/src/prover/isabelle/pure/net.ts +0 -2
  110. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  111. package/src/prover/isabelle/pure/pattern.ts +0 -2
  112. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  113. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  114. package/src/prover/isabelle/pure/search.ts +0 -2
  115. package/src/prover/isabelle/pure/seq.ts +0 -2
  116. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  117. package/src/prover/isabelle/pure/table.ts +2 -3
  118. package/src/prover/isabelle/pure/tactic.ts +0 -2
  119. package/src/prover/isabelle/pure/tactical.ts +42 -37
  120. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  121. package/src/prover/isabelle/pure/term.ts +0 -2
  122. package/src/prover/isabelle/pure/thm.ts +14 -13
  123. package/src/prover/isabelle/pure/type.ts +0 -2
  124. package/src/prover/isabelle/pure/unify.ts +0 -2
  125. package/src/prover/isabelle/pure/variable.ts +0 -2
  126. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  127. package/src/prover/isabelle/tla/context.ts +58 -11
  128. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  129. package/src/prover/isabelle/tla/logic.ts +49 -21
  130. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  131. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  132. package/src/prover/ocaml.ts +4 -1
  133. package/src/prover/prep/action.ts +30 -31
  134. package/src/prover/prep/enabled-axioms.ts +11 -2
  135. package/src/prover/prep/fingerprint.ts +2 -5
  136. package/src/prover/prep/methods.ts +181 -51
  137. package/src/prover/prep/normalize.ts +38 -9
  138. package/src/prover/prove.ts +395 -94
  139. package/src/prover/ptl/decide.ts +95 -50
  140. package/src/prover/ptl/encode.ts +2 -3
  141. package/src/prover/ptl/tableau.ts +28 -2
  142. package/src/prover/smt/arithmetic.ts +310 -0
  143. package/src/prover/smt/axioms.ts +12 -8
  144. package/src/prover/smt/context.ts +43 -8
  145. package/src/prover/smt/data.ts +498 -379
  146. package/src/prover/smt/encode.ts +148 -57
  147. package/src/prover/smt/extensionality.ts +5 -3
  148. package/src/prover/smt/flatten.ts +4 -6
  149. package/src/prover/smt/format.ts +28 -4
  150. package/src/prover/smt/instances.ts +7 -1
  151. package/src/prover/smt/layout.ts +91 -0
  152. package/src/prover/smt/rewrite.ts +1021 -618
  153. package/src/prover/smt/simplify.ts +441 -0
  154. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  155. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  156. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  157. package/src/prover/smt/solver/act-cache.ts +0 -1
  158. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  159. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  160. package/src/prover/smt/solver/aig.ts +889 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  162. package/src/prover/smt/solver/arith-terms.ts +121 -0
  163. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  164. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  165. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  166. package/src/prover/smt/solver/ast-lt.ts +166 -12
  167. package/src/prover/smt/solver/ast-util.ts +160 -2
  168. package/src/prover/smt/solver/ast.ts +1427 -41
  169. package/src/prover/smt/solver/auf-solver.ts +2 -6
  170. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  171. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  172. package/src/prover/smt/solver/bound-manager.ts +196 -0
  173. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  174. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  175. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  176. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  177. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  178. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  179. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  180. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  181. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  182. package/src/prover/smt/solver/card2bv.ts +110 -0
  183. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  184. package/src/prover/smt/solver/cg-table.ts +39 -25
  185. package/src/prover/smt/solver/check-logic.ts +330 -0
  186. package/src/prover/smt/solver/clause.ts +0 -1
  187. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  188. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  189. package/src/prover/smt/solver/context.ts +516 -115
  190. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  191. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  192. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  193. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  194. package/src/prover/smt/solver/demodulator.ts +786 -0
  195. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  196. package/src/prover/smt/solver/der.ts +38 -10
  197. package/src/prover/smt/solver/diff-neq.ts +206 -0
  198. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  199. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  200. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  201. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  202. package/src/prover/smt/solver/e-matching.ts +7 -8
  203. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  204. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  205. package/src/prover/smt/solver/enode.ts +100 -3
  206. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  207. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  208. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  209. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  210. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  211. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  212. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  213. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  214. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  215. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  216. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  217. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  218. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  219. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  220. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  221. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  222. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  223. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  224. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  225. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  226. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  227. package/src/prover/smt/solver/expr-ref.ts +0 -1
  228. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  229. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  230. package/src/prover/smt/solver/factor.ts +141 -0
  231. package/src/prover/smt/solver/fd-solver.ts +265 -0
  232. package/src/prover/smt/solver/fingerprints.ts +15 -15
  233. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  234. package/src/prover/smt/solver/flat-literals.ts +0 -1
  235. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  236. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  237. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  238. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  239. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  240. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  241. package/src/prover/smt/solver/goal.ts +175 -15
  242. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  243. package/src/prover/smt/solver/guard-set.ts +219 -0
  244. package/src/prover/smt/solver/hash.ts +0 -1
  245. package/src/prover/smt/solver/hashtable.ts +30 -16
  246. package/src/prover/smt/solver/inf-eps.ts +63 -0
  247. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  248. package/src/prover/smt/solver/internalizer.ts +110 -38
  249. package/src/prover/smt/solver/lackr.ts +381 -0
  250. package/src/prover/smt/solver/lbool.ts +0 -1
  251. package/src/prover/smt/solver/lia2card.ts +268 -0
  252. package/src/prover/smt/solver/lia2pb.ts +154 -0
  253. package/src/prover/smt/solver/literal.ts +0 -1
  254. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  255. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  256. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  257. package/src/prover/smt/solver/lp/containers.ts +0 -1
  258. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  259. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  260. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  261. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  262. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  263. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  264. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  265. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  266. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  267. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  268. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  269. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  270. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  271. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  272. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  273. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  274. package/src/prover/smt/solver/lp/nex.ts +0 -1
  275. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  278. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  282. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  286. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  288. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  289. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  292. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  294. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  295. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  296. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  299. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  300. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  301. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  302. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  303. package/src/prover/smt/solver/macro-finder.ts +530 -0
  304. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  305. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  306. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  307. package/src/prover/smt/solver/max-cliques.ts +105 -0
  308. package/src/prover/smt/solver/maxcore.ts +309 -0
  309. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  310. package/src/prover/smt/solver/maxlex.ts +115 -0
  311. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  312. package/src/prover/smt/solver/maxsmt.ts +92 -0
  313. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  314. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  315. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  316. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  317. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  318. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  319. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  320. package/src/prover/smt/solver/model-checker.ts +18 -27
  321. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  322. package/src/prover/smt/solver/model-finder.ts +12 -18
  323. package/src/prover/smt/solver/model-generator.ts +56 -29
  324. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  325. package/src/prover/smt/solver/model-printer.ts +214 -0
  326. package/src/prover/smt/solver/mpf.ts +711 -0
  327. package/src/prover/smt/solver/mus.ts +51 -0
  328. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  329. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  330. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  331. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  332. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  333. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  334. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  335. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  336. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  337. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  338. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  339. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  340. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  341. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  342. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  343. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  344. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  345. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  346. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  347. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  348. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  349. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  350. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  351. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  352. package/src/prover/smt/solver/nlqsat.ts +484 -0
  353. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  354. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  355. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  356. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  357. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  358. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  359. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  360. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  361. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  362. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  363. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  364. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  365. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  366. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  367. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  368. package/src/prover/smt/solver/nnf.ts +105 -23
  369. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  370. package/src/prover/smt/solver/occf.ts +97 -0
  371. package/src/prover/smt/solver/opt-context.ts +787 -0
  372. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  373. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  374. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  375. package/src/prover/smt/solver/opt-solver.ts +308 -0
  376. package/src/prover/smt/solver/opt-value.ts +55 -0
  377. package/src/prover/smt/solver/optsmt.ts +692 -0
  378. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  379. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  380. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  381. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  382. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  383. package/src/prover/smt/solver/probes.ts +512 -0
  384. package/src/prover/smt/solver/propagate-values.ts +37 -21
  385. package/src/prover/smt/solver/proto-model.ts +648 -19
  386. package/src/prover/smt/solver/pull-quant.ts +28 -12
  387. package/src/prover/smt/solver/purify-arith.ts +632 -0
  388. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  389. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  390. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  391. package/src/prover/smt/solver/qe-lite.ts +37 -17
  392. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  393. package/src/prover/smt/solver/qe.ts +1498 -0
  394. package/src/prover/smt/solver/qel.ts +25 -0
  395. package/src/prover/smt/solver/qi-queue.ts +0 -1
  396. package/src/prover/smt/solver/qsat.ts +814 -0
  397. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  398. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  399. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  400. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  401. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  402. package/src/prover/smt/solver/random-gen.ts +0 -1
  403. package/src/prover/smt/solver/rational.ts +45 -1
  404. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  405. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  406. package/src/prover/smt/solver/reduce-args.ts +225 -0
  407. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  408. package/src/prover/smt/solver/ref-vector.ts +0 -1
  409. package/src/prover/smt/solver/relevancy.ts +1 -2
  410. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  411. package/src/prover/smt/solver/rewriter.ts +475 -36
  412. package/src/prover/smt/solver/rlimit.ts +25 -2
  413. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  414. package/src/prover/smt/solver/sat/big.ts +177 -0
  415. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  416. package/src/prover/smt/solver/sat/clause.ts +203 -0
  417. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  418. package/src/prover/smt/solver/sat/config.ts +122 -0
  419. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  420. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  421. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  422. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  423. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  424. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  425. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  426. package/src/prover/smt/solver/sat/probing.ts +170 -0
  427. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  428. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  429. package/src/prover/smt/solver/sat/scc.ts +142 -0
  430. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  431. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  432. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  433. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  434. package/src/prover/smt/solver/search-tree.ts +284 -0
  435. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  436. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  437. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  438. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  439. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  440. package/src/prover/smt/solver/seq-factory.ts +89 -0
  441. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  442. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  443. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  444. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  445. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  446. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  447. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  448. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  449. package/src/prover/smt/solver/seq-subset.ts +165 -0
  450. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  451. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  452. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  453. package/src/prover/smt/solver/smt-logics.ts +66 -0
  454. package/src/prover/smt/solver/smt-setup.ts +496 -0
  455. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  456. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  457. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  458. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  459. package/src/prover/smt/solver/solver.ts +113 -22
  460. package/src/prover/smt/solver/static-features.ts +314 -0
  461. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  462. package/src/prover/smt/solver/tactic.ts +1986 -0
  463. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  464. package/src/prover/smt/solver/theory-array.ts +1240 -0
  465. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  466. package/src/prover/smt/solver/theory-char.ts +355 -0
  467. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  468. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  469. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  470. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  471. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  472. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  473. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  474. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  475. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  476. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  477. package/src/prover/smt/solver/theory-lra.ts +188 -1
  478. package/src/prover/smt/solver/theory-pb.ts +934 -0
  479. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  480. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  481. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  482. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  483. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  484. package/src/prover/smt/solver/theory-seq.ts +961 -0
  485. package/src/prover/smt/solver/theory.ts +189 -0
  486. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  487. package/src/prover/smt/solver/var-subst.ts +36 -14
  488. package/src/prover/smt/table.ts +3 -2
  489. package/src/prover/smt/types.ts +146 -0
  490. package/src/prover/tlapm/cache.ts +50 -19
  491. package/src/prover/tlapm/tlapm.ts +15 -9
  492. package/src/prover/tlapm-library.ts +3208 -0
  493. package/src/prover/verdict.ts +9 -0
  494. package/src/prover/zenon/check/check.ts +1 -2
  495. package/src/prover/zenon/check/records.ts +1 -1
  496. package/src/prover/zenon/check/relations.ts +2 -1
  497. package/src/prover/zenon/check/rewrites.ts +2 -15
  498. package/src/prover/zenon/check/sets.ts +40 -58
  499. package/src/prover/zenon/check/terms.ts +1 -2
  500. package/src/prover/zenon/decide.ts +10 -7
  501. package/src/prover/zenon/encode.ts +0 -2
  502. package/src/prover/zenon/eqrel.ts +2 -2
  503. package/src/prover/zenon/equality-rules.ts +0 -2
  504. package/src/prover/zenon/expr.ts +7 -2
  505. package/src/prover/zenon/index-table.ts +9 -21
  506. package/src/prover/zenon/isar-case.ts +0 -2
  507. package/src/prover/zenon/isar.ts +35 -37
  508. package/src/prover/zenon/llproof.ts +2 -13
  509. package/src/prover/zenon/mltoll.ts +12 -30
  510. package/src/prover/zenon/node.ts +20 -5
  511. package/src/prover/zenon/parse.ts +9 -8
  512. package/src/prover/zenon/phrase.ts +0 -2
  513. package/src/prover/zenon/proof.ts +0 -2
  514. package/src/prover/zenon/propositional-rules.ts +0 -2
  515. package/src/prover/zenon/rules.ts +0 -2
  516. package/src/prover/zenon/search.ts +11 -19
  517. package/src/prover/zenon/tla/functions.ts +2 -4
  518. package/src/prover/zenon/tla/llproof.ts +9 -13
  519. package/src/prover/zenon/tla/records.ts +1 -8
  520. package/src/prover/zenon/tla/rewrites.ts +0 -2
  521. package/src/prover/zenon/tla/sets.ts +22 -22
  522. package/src/prover/zenon/tla/terms.ts +0 -2
  523. package/src/prover/zenon/tla/tla.ts +7 -8
  524. package/src/resolve.ts +56 -74
  525. package/src/runtime.ts +4 -0
  526. package/src/sany/generation.ts +394 -0
  527. package/src/sany/generator-def-entries.ts +210 -0
  528. package/src/sany/generator-definitions.ts +686 -0
  529. package/src/sany/generator-expressions.ts +1100 -0
  530. package/src/sany/generator-proofs.ts +662 -0
  531. package/src/sany/generator.ts +155 -2625
  532. package/src/sany/levels.ts +0 -2
  533. package/src/sany/lexer.ts +17 -16
  534. package/src/sany/linter.ts +0 -2
  535. package/src/sany/nodes.ts +2 -3
  536. package/src/sany/report.ts +3 -6
  537. package/src/sany/selectors.ts +35 -38
  538. package/src/sany/xml.ts +23 -55
  539. package/src/search.ts +205 -43
  540. package/src/simulate.ts +157 -133
  541. package/src/spec-description.ts +33 -48
  542. package/src/standard-definitions.ts +4 -0
  543. package/src/standard-modules.ts +16 -32
  544. package/src/state-graph.ts +0 -2
  545. package/src/substitution-levels.ts +5 -4
  546. package/src/successors.ts +6 -8
  547. package/src/symmetry.ts +2 -2
  548. package/src/tableau.ts +2 -2
  549. package/src/tlc/fingerprint.ts +81 -9
  550. package/src/tlc/messages.ts +20 -15
  551. package/src/tlc/random.ts +4 -4
  552. package/src/tlc/replay.ts +8 -15
  553. package/src/tlc/summary.ts +29 -14
  554. package/src/tlc/tlc-operators.ts +2 -3
  555. package/src/tlc/tlcext-operators.ts +44 -12
  556. package/src/tlc/trace-spec.ts +21 -40
  557. package/src/typed-tier.ts +6535 -0
  558. package/src/typescript/actions.ts +2 -4
  559. package/src/typescript/collections.ts +34 -20
  560. package/src/typescript/compile.ts +1 -3
  561. package/src/typescript/formula.ts +5 -3
  562. package/src/typescript/model.ts +4 -5
  563. package/src/typescript/steps.ts +20 -18
  564. package/src/values.ts +62 -152
  565. package/src/prover/isabelle/isar/statement.ts +0 -52
  566. package/src/prover/smt/solver/z3-license.txt +0 -10
  567. package/src/prover/tlaps-module.ts +0 -510
  568. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,170 @@
1
+ import { L_UNDEF } from "../lbool";
2
+ import { Big } from "./big";
3
+ import { getBool, getNumber, type SatParams } from "./config";
4
+ import type { Solver } from "./solver";
5
+
6
+ export class Probing {
7
+ private stoppedAt = 0;
8
+ private assigned = new Uint8Array(0);
9
+ private assignedLits: number[] = [];
10
+ private toAssert: number[] = [];
11
+ private counter = 0;
12
+ private isEnabled: boolean;
13
+ private limit: number;
14
+ private isCaching: boolean;
15
+ private isBinary: boolean;
16
+ private numAssigned = 0;
17
+ private cachedBins: (number[] | undefined)[] = [];
18
+ private big: Big;
19
+
20
+ constructor(
21
+ private solver: Solver,
22
+ params: SatParams,
23
+ ) {
24
+ this.big = new Big(solver.rand);
25
+ this.isEnabled = getBool(params, "probing", true);
26
+ this.limit = getNumber(params, "probing_limit", 5000000);
27
+ this.isCaching = getBool(params, "probing_cache", true);
28
+ this.isBinary = getBool(params, "probing_binary", true);
29
+ }
30
+
31
+ dec(count: number) {
32
+ this.counter -= count;
33
+ }
34
+
35
+ cachedImpliedLits(lit: number) {
36
+ return this.isCaching ? this.cachedBins[lit] : undefined;
37
+ }
38
+
39
+ resetCache(lit: number) {
40
+ if (lit < this.cachedBins.length) this.cachedBins[lit] = undefined;
41
+ }
42
+
43
+ private cacheBins(lit: number, oldTrailSize: number) {
44
+ if (!this.isCaching) return;
45
+ this.cachedBins[lit] = this.solver.trail.slice(oldTrailSize);
46
+ }
47
+
48
+ private isAssigned(lit: number) {
49
+ return this.assigned[lit] === 1;
50
+ }
51
+
52
+ private tryLit(lit: number, isUpdatingCache: boolean) {
53
+ const solver = this.solver;
54
+ const impliedLits = isUpdatingCache ? undefined : this.cachedImpliedLits(lit);
55
+ if (impliedLits !== undefined) {
56
+ for (const other of impliedLits)
57
+ if (this.isAssigned(other)) {
58
+ solver.assignScoped(other);
59
+ this.numAssigned++;
60
+ }
61
+ } else {
62
+ this.toAssert.length = 0;
63
+ solver.push();
64
+ solver.assignScoped(lit);
65
+ this.counter--;
66
+ const oldTrailSize = solver.trail.length;
67
+ solver.propagate(false);
68
+ if (solver.isInconsistent) {
69
+ solver.pop(1);
70
+ solver.assignScoped(lit ^ 1);
71
+ solver.propagate(false);
72
+ return false;
73
+ }
74
+ for (let index = oldTrailSize; index < solver.trail.length; index++)
75
+ if (this.isAssigned(solver.trail[index])) this.toAssert.push(solver.trail[index]);
76
+ if (isUpdatingCache) this.cacheBins(lit, oldTrailSize);
77
+ solver.pop(1);
78
+ for (const other of this.toAssert) {
79
+ solver.assignScoped(other);
80
+ this.numAssigned++;
81
+ }
82
+ }
83
+ solver.propagate(false);
84
+ return !solver.isInconsistent;
85
+ }
86
+
87
+ private processCore(boolVar: number) {
88
+ const solver = this.solver;
89
+ this.counter--;
90
+ solver.push();
91
+ const lit = 2 * boolVar;
92
+ solver.assignScoped(lit);
93
+ const oldTrailSize = solver.trail.length;
94
+ solver.propagate(false);
95
+ if (solver.isInconsistent) {
96
+ solver.pop(1);
97
+ solver.assignScoped(lit ^ 1);
98
+ solver.propagate(false);
99
+ this.numAssigned++;
100
+ return;
101
+ }
102
+ for (const other of this.assignedLits) this.assigned[other] = 0;
103
+ this.assignedLits.length = 0;
104
+ for (let index = oldTrailSize; index < solver.trail.length; index++) {
105
+ this.assigned[solver.trail[index]] = 1;
106
+ this.assignedLits.push(solver.trail[index]);
107
+ }
108
+ this.cacheBins(lit, oldTrailSize);
109
+ solver.pop(1);
110
+ if (!this.tryLit(lit ^ 1, true) || !this.isBinary) return;
111
+ let size = solver.getWlist(lit ^ 1).size;
112
+ for (let index = 0; index < size; index++) {
113
+ const wlist = solver.getWlist(lit ^ 1);
114
+ if (!wlist.isBinary(index)) continue;
115
+ const other = wlist.getLiteral(index);
116
+ if (lit > other || solver.value(other) !== L_UNDEF) continue;
117
+ if (!this.tryLit(other, false) || solver.isInconsistent) return;
118
+ size = wlist.size;
119
+ }
120
+ }
121
+
122
+ run(isForced: boolean) {
123
+ const solver = this.solver;
124
+ if (!this.isEnabled) return true;
125
+ solver.propagate(false);
126
+ if (solver.isInconsistent) return true;
127
+ if (!isForced && this.counter > 0) return true;
128
+ const wasProbing = solver.isProbing;
129
+ solver.isProbing = true;
130
+ const numAssigned = this.numAssigned;
131
+ let isComplete = true;
132
+ this.counter = 0;
133
+ this.big.init(solver, true);
134
+ const numVars = solver.numVars();
135
+ this.assigned = new Uint8Array(2 * numVars);
136
+ try {
137
+ for (let index = 0; index < numVars; index++) {
138
+ const boolVar = (this.stoppedAt + index) % numVars;
139
+ if (this.counter < -this.limit) {
140
+ this.stoppedAt = boolVar;
141
+ isComplete = false;
142
+ break;
143
+ }
144
+ if (solver.isInconsistent) break;
145
+ if (solver.valueVar(boolVar) !== L_UNDEF || solver.wasEliminated(boolVar)) {
146
+ if (this.isCaching) {
147
+ this.resetCache(2 * boolVar);
148
+ this.resetCache(2 * boolVar + 1);
149
+ }
150
+ continue;
151
+ }
152
+ solver.checkpoint();
153
+ const oldCounter = this.counter;
154
+ const oldNumAssigned = this.numAssigned;
155
+ this.processCore(boolVar);
156
+ if (this.numAssigned > oldNumAssigned) this.counter = oldCounter;
157
+ }
158
+ } finally {
159
+ solver.isProbing = wasProbing;
160
+ }
161
+ if (isComplete) this.stoppedAt = 0;
162
+ this.counter = -this.counter;
163
+ if (numAssigned === this.numAssigned) this.counter *= 2;
164
+ this.assigned = new Uint8Array(0);
165
+ this.assignedLits.length = 0;
166
+ this.toAssert.length = 0;
167
+ this.cachedBins = [];
168
+ return isComplete;
169
+ }
170
+ }
@@ -0,0 +1,43 @@
1
+ import { SmtTacticError } from "../../../../errors";
2
+ import type { AstManager } from "../ast";
3
+ import type { ThSolverFactory } from "../euf/euf-solver";
4
+ import { OVER, type Goal } from "../goal";
5
+ import { L_FALSE, L_TRUE } from "../lbool";
6
+ import { ProtoModel } from "../proto-model";
7
+ import type { SatParams } from "./config";
8
+ import { Goal2Sat } from "./goal2sat";
9
+ import { sat2goal } from "./sat2goal";
10
+ import { Solver } from "./solver";
11
+
12
+ // With a theory factory, the sat solver runs the euf solver of sat.euf as its extension.
13
+ export const createSatTactic =
14
+ (manager: AstManager, params: SatParams, mkThSolver: ThSolverFactory | null = null) =>
15
+ (goal: Goal) => {
16
+ if (goal.isProofsEnabled) throw new SmtTacticError("sat does not support proof production");
17
+ goal.elimRedundancies();
18
+ const solver = new Solver(params, manager.limit);
19
+ const goal2sat = new Goal2Sat(manager, solver, params.get("ite_extra") !== false, mkThSolver);
20
+ goal2sat.run(goal.forms.items);
21
+ goal.reset();
22
+ const result = solver.check();
23
+ const unhandledFuns = goal2sat.euf?.unhandledFunctions ?? goal2sat.unhandledFuns;
24
+ if (result === L_FALSE) goal.assert(manager.falseExpr);
25
+ else if (result === L_TRUE && unhandledFuns.length === 0) {
26
+ const model = new ProtoModel(manager);
27
+ for (const [expr, boolVar] of goal2sat.atoms) {
28
+ if (!manager.isUninterpretedConst(expr)) continue;
29
+ const value = solver.model[boolVar];
30
+ if (value === L_TRUE) model.registerConst(manager.decls[expr], manager.trueExpr);
31
+ else if (value === L_FALSE) model.registerConst(manager.decls[expr], manager.falseExpr);
32
+ }
33
+ const euf = goal2sat.euf;
34
+ goal.model = (euf?.updateModel(model) ?? model).mkModel();
35
+ euf?.validateModel(goal.model);
36
+ } else {
37
+ solver.popToBaseLevel();
38
+ sat2goal(manager, solver, goal2sat.atoms, goal);
39
+ if (unhandledFuns.length > 0) goal.updatePrecision(OVER);
40
+ }
41
+ goal.depth++;
42
+ return [goal];
43
+ };
@@ -0,0 +1,165 @@
1
+ import { SmtCanceledError } from "../../../../errors";
2
+ import { type AstManager, SORT_BOOL } from "../ast";
3
+ import type { Definition, Goal } from "../goal";
4
+ import { NULL_LITERAL } from "./clause";
5
+ import { ModelConverter } from "./model-converter";
6
+ import type { Solver } from "./solver";
7
+
8
+ const mkNot = (manager: AstManager, expr: number) =>
9
+ manager.isNot(expr) ? manager.getArg(expr, 0) : manager.mkNot(expr);
10
+
11
+ export const isLiteral = (manager: AstManager, expr: number) =>
12
+ manager.isUninterpretedConst(expr) ||
13
+ (manager.isNot(expr) && manager.isUninterpretedConst(manager.getArg(expr, 0)));
14
+
15
+ class Sat2GoalConverter {
16
+ readonly smc = new ModelConverter();
17
+ var2expr: number[] = [];
18
+ readonly entries: Definition[] = [];
19
+
20
+ constructor(private manager: AstManager) {}
21
+
22
+ private add(expr: number, def: number) {
23
+ const manager = this.manager;
24
+ manager.incRef(def);
25
+ this.entries.push({ decl: manager.decls[expr], def });
26
+ }
27
+
28
+ hide(expr: number) {
29
+ this.entries.push({ decl: this.manager.decls[expr], def: -1 });
30
+ }
31
+
32
+ flushSmc(solver: Solver, atoms: Map<number, number>) {
33
+ this.smc.flush(solver.mc);
34
+ this.var2expr.length = solver.numVars();
35
+ this.var2expr.fill(-1);
36
+ for (const [expr, boolVar] of atoms) this.var2expr[boolVar] = expr;
37
+ this.flushGmc();
38
+ }
39
+
40
+ private flushGmc() {
41
+ const manager = this.manager;
42
+ const updates: number[] = [];
43
+ this.smc.expand(updates);
44
+ const clause: number[] = [];
45
+ for (let index = 0; index < updates.length; index++) {
46
+ const lit = updates[index];
47
+ if (lit === NULL_LITERAL) {
48
+ let first = clause[0];
49
+ const tail = clause.slice(1).map((other) => this.lit2expr(other ^ 1));
50
+ const head = this.lit2expr(first);
51
+ let def = manager.mkOr([head, manager.mkAnd(tail)]);
52
+ if ((first & 1) === 1) {
53
+ first ^= 1;
54
+ def = manager.mkNot(def);
55
+ }
56
+ const expr = this.lit2expr(first);
57
+ if (isLiteral(manager, expr)) this.add(expr, def);
58
+ clause.length = 0;
59
+ continue;
60
+ }
61
+ if (
62
+ clause.length === 0 &&
63
+ index + 5 < updates.length &&
64
+ updates[index] === (updates[index + 3] ^ 1) &&
65
+ updates[index + 1] === (updates[index + 4] ^ 1) &&
66
+ updates[index + 2] === NULL_LITERAL &&
67
+ updates[index + 5] === NULL_LITERAL
68
+ ) {
69
+ let first = lit;
70
+ let root = updates[index + 1] ^ 1;
71
+ if ((first & 1) === 1) {
72
+ first ^= 1;
73
+ root ^= 1;
74
+ }
75
+ const expr = this.lit2expr(first);
76
+ if (isLiteral(manager, expr)) this.add(expr, this.lit2expr(root));
77
+ index += 5;
78
+ continue;
79
+ }
80
+ clause.push(lit);
81
+ }
82
+ }
83
+
84
+ insert(boolVar: number, atom: number) {
85
+ while (this.var2expr.length <= boolVar) this.var2expr.push(-1);
86
+ this.var2expr[boolVar] = atom;
87
+ if (this.manager.isUninterpretedConst(atom)) this.hide(atom);
88
+ }
89
+
90
+ private lit2expr(lit: number) {
91
+ const manager = this.manager;
92
+ const boolVar = lit >> 1;
93
+ if (this.var2expr[boolVar] === -1) {
94
+ const aux = manager.mkFreshConst(null, SORT_BOOL);
95
+ manager.incRef(aux);
96
+ this.var2expr[boolVar] = aux;
97
+ this.hide(aux);
98
+ }
99
+ const expr = this.var2expr[boolVar];
100
+ return (lit & 1) === 1 ? manager.mkNot(expr) : expr;
101
+ }
102
+ }
103
+
104
+ export const sat2goal = (
105
+ manager: AstManager,
106
+ solver: Solver,
107
+ atoms: Map<number, number>,
108
+ goal: Goal,
109
+ ) => {
110
+ if (solver.atBaseLvl() && solver.isInconsistent) {
111
+ goal.assert(manager.falseExpr);
112
+ return;
113
+ }
114
+ const converter = new Sat2GoalConverter(manager);
115
+ converter.flushSmc(solver, atoms);
116
+ const lit2expr = new Int32Array(2 * solver.numVars()).fill(-1);
117
+ for (const [expr, boolVar] of atoms) {
118
+ lit2expr[2 * boolVar] = expr;
119
+ lit2expr[2 * boolVar + 1] = mkNot(manager, expr);
120
+ manager.incRef(lit2expr[2 * boolVar + 1]);
121
+ }
122
+ const getExpr = (lit: number) => {
123
+ if (lit2expr[lit] === -1) {
124
+ const boolVar = lit >> 1;
125
+ let aux = converter.var2expr[boolVar] ?? -1;
126
+ if (aux === -1) {
127
+ aux = manager.mkFreshConst(null, SORT_BOOL);
128
+ manager.incRef(aux);
129
+ converter.insert(boolVar, aux);
130
+ }
131
+ lit2expr[2 * boolVar] = aux;
132
+ lit2expr[2 * boolVar + 1] = mkNot(manager, aux);
133
+ manager.incRef(lit2expr[2 * boolVar + 1]);
134
+ }
135
+ return lit2expr[lit];
136
+ };
137
+ const checkpoint = () => {
138
+ if (!manager.limit.inc()) throw new SmtCanceledError();
139
+ };
140
+ const trailSize = solver.initTrailSize();
141
+ for (let index = 0; index < trailSize; index++) {
142
+ checkpoint();
143
+ goal.assert(getExpr(solver.trail[index]));
144
+ }
145
+ for (let index = 0; index < solver.watches.length; index++) {
146
+ const first = index ^ 1;
147
+ const wlist = solver.watches[index];
148
+ for (let position = 0; position < wlist.size; position++) {
149
+ if (!wlist.isBinary(position) || wlist.isLearned(position)) continue;
150
+ const second = wlist.getLiteral(position);
151
+ if (first > second) continue;
152
+ checkpoint();
153
+ goal.assert(manager.mkOr([getExpr(first), getExpr(second)]));
154
+ }
155
+ }
156
+ const arena = solver.arena;
157
+ for (const clause of solver.clauses) {
158
+ checkpoint();
159
+ goal.assert(manager.mkOr(arena.getLits(clause).map(getExpr)));
160
+ }
161
+ const formulas: number[] = [];
162
+ solver.ext?.toFormulas(getExpr, formulas);
163
+ for (const formula of formulas) goal.assert(formula);
164
+ goal.addDefinitions(converter.entries);
165
+ };
@@ -0,0 +1,142 @@
1
+ import { Big } from "./big";
2
+ import { NULL_LITERAL } from "./clause";
3
+ import type { SatConfig } from "./config";
4
+ import { ElimEqs } from "./elim-eqs";
5
+ import type { Solver } from "./solver";
6
+
7
+ const UNVISITED = -1;
8
+
9
+ export class Scc {
10
+ private big: Big;
11
+
12
+ constructor(
13
+ private solver: Solver,
14
+ private config: SatConfig,
15
+ ) {
16
+ this.big = new Big(solver.rand);
17
+ }
18
+
19
+ private extractRoots(roots: number[], toElim: number[]) {
20
+ const solver = this.solver;
21
+ const numLits = 2 * solver.numVars();
22
+ const index = new Int32Array(numLits).fill(UNVISITED);
23
+ const lowlink = new Int32Array(numLits).fill(UNVISITED);
24
+ const inStack = new Uint8Array(numLits);
25
+ const stack: number[] = [];
26
+ const frameLits: number[] = [];
27
+ const framePositions: number[] = [];
28
+ const frameIsFirst: boolean[] = [];
29
+ for (let boolVar = 0; boolVar < solver.numVars(); boolVar++) roots.push(NULL_LITERAL);
30
+ let nextIndex = 0;
31
+ const newNode = (lit: number) => {
32
+ index[lit] = nextIndex;
33
+ lowlink[lit] = nextIndex;
34
+ nextIndex++;
35
+ stack.push(lit);
36
+ inStack[lit] = 1;
37
+ frameLits.push(lit);
38
+ framePositions.push(0);
39
+ frameIsFirst.push(true);
40
+ };
41
+ for (let start = 0; start < numLits; start++) {
42
+ if (index[start] !== UNVISITED) continue;
43
+ if (solver.wasEliminated(start >> 1)) continue;
44
+ solver.checkpoint();
45
+ newNode(start);
46
+ frames: while (frameLits.length > 0) {
47
+ const top = frameLits.length - 1;
48
+ const lit = frameLits[top];
49
+ const wlist = solver.getWlist(lit);
50
+ if (!frameIsFirst[top]) {
51
+ const other = wlist.getLiteral(framePositions[top]);
52
+ if (lowlink[other] < lowlink[lit]) lowlink[lit] = lowlink[other];
53
+ framePositions[top]++;
54
+ }
55
+ frameIsFirst[top] = false;
56
+ while (framePositions[top] < wlist.size) {
57
+ const position = framePositions[top];
58
+ if (!wlist.isBinary(position)) {
59
+ framePositions[top]++;
60
+ continue;
61
+ }
62
+ const other = wlist.getLiteral(position);
63
+ if (index[other] === UNVISITED) {
64
+ newNode(other);
65
+ continue frames;
66
+ }
67
+ if (inStack[other] === 1 && index[other] < lowlink[lit]) lowlink[lit] = index[other];
68
+ framePositions[top]++;
69
+ }
70
+ if (lowlink[lit] === index[lit]) {
71
+ const boolVar = lit >> 1;
72
+ if (roots[boolVar] !== NULL_LITERAL) {
73
+ let popped: number;
74
+ do {
75
+ popped = stack.pop() as number;
76
+ inStack[popped] = 0;
77
+ } while (popped !== lit);
78
+ } else {
79
+ let root = NULL_LITERAL;
80
+ for (let position = stack.length - 1; ; position--) {
81
+ const member = stack[position];
82
+ if (member === (lit ^ 1)) {
83
+ solver.setConflict();
84
+ return false;
85
+ }
86
+ if (solver.isExternal(member >> 1)) {
87
+ root = member;
88
+ break;
89
+ }
90
+ if (member === lit) break;
91
+ }
92
+ if (root === NULL_LITERAL) root = lit;
93
+ let popped: number;
94
+ do {
95
+ popped = stack.pop() as number;
96
+ inStack[popped] = 0;
97
+ const memberVar = popped >> 1;
98
+ if (roots[memberVar] === NULL_LITERAL) {
99
+ roots[memberVar] = root ^ (popped & 1);
100
+ if (memberVar !== root >> 1) toElim.push(memberVar);
101
+ }
102
+ } while (popped !== lit);
103
+ }
104
+ }
105
+ frameLits.pop();
106
+ framePositions.pop();
107
+ frameIsFirst.pop();
108
+ }
109
+ }
110
+ for (let boolVar = 0; boolVar < solver.numVars(); boolVar++)
111
+ if (roots[boolVar] === NULL_LITERAL) roots[boolVar] = 2 * boolVar;
112
+ return true;
113
+ }
114
+
115
+ run() {
116
+ const solver = this.solver;
117
+ if (solver.isInconsistent || !this.config.isScc) return 0;
118
+ const roots: number[] = [];
119
+ const toElim: number[] = [];
120
+ if (!this.extractRoots(roots, toElim)) return 0;
121
+ new ElimEqs(solver).run(roots, toElim);
122
+ if (this.config.isSccTr) this.reduceTr();
123
+ return toElim.length;
124
+ }
125
+
126
+ private reduceTrLearned(isLearned: boolean) {
127
+ this.big.init(this.solver, isLearned);
128
+ return this.big.reduceTr(this.solver);
129
+ }
130
+
131
+ private reduceTr() {
132
+ let quota = 0;
133
+ let count = 0;
134
+ let numReduced = 0;
135
+ while ((numReduced = this.reduceTrLearned(false)) > quota && count++ < 10)
136
+ quota = Math.max(100, numReduced >>> 1);
137
+ quota = 0;
138
+ count = 0;
139
+ while ((numReduced = this.reduceTrLearned(true)) > quota && count++ < 10)
140
+ quota = Math.max(100, numReduced >>> 1);
141
+ }
142
+ }