tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

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 (586) 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 +37 -0
  8. package/dist/index.d.ts +37 -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 +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  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 +44 -41
  19. package/dist/transfer.js +44 -41
  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 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  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 +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  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 +118 -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 +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -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 +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -16
  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 +261 -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 +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  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 +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -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 +2127 -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 +1010 -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 +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  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 +1986 -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 +1200 -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 +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -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/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,105 @@
1
+ const getSortedSet = (set: Set<number>) => [...set].sort((left, right) => left - right);
2
+
3
+ export class MaxCliques {
4
+ private next: number[][] = [];
5
+ private tc: number[][] = [];
6
+ private seen1 = new Set<number>();
7
+ private seen2 = new Set<number>();
8
+
9
+ constructor(private negate: (vertex: number) => number) {}
10
+
11
+ private getNext(vertex: number) {
12
+ return this.next[vertex] ?? [];
13
+ }
14
+
15
+ private getTc(vertex: number) {
16
+ this.tc[vertex] ??= [];
17
+ return this.tc[vertex];
18
+ }
19
+
20
+ private getReachable(start: number, goal: Set<number>, reachable: Set<number>) {
21
+ this.seen1.clear();
22
+ const todo = [start];
23
+ for (let index = 0; index < todo.length; index++) {
24
+ const vertex = todo[index];
25
+ if (this.seen1.has(vertex)) continue;
26
+ this.seen1.add(vertex);
27
+ if (this.seen2.has(vertex)) {
28
+ for (const next of this.getTc(vertex)) if (goal.has(next)) reachable.add(next);
29
+ continue;
30
+ }
31
+ const negated = this.negate(vertex);
32
+ if (goal.has(negated)) reachable.add(negated);
33
+ todo.push(...this.getNext(negated));
34
+ }
35
+ for (let index = todo.length; index-- > 0;) {
36
+ const vertex = todo[index];
37
+ if (this.seen2.has(vertex)) continue;
38
+ this.seen2.add(vertex);
39
+ const negated = this.negate(vertex);
40
+ const tc = this.getTc(vertex);
41
+ if (goal.has(negated)) tc.push(negated);
42
+ else for (const next of this.getNext(negated)) tc.push(...this.getTc(next));
43
+ }
44
+ }
45
+
46
+ addEdge(source: number, target: number) {
47
+ (this.next[source] ??= []).push(target);
48
+ (this.next[target] ??= []).push(source);
49
+ }
50
+
51
+ cliques2(vertices: readonly number[]) {
52
+ const goal = new Set(vertices);
53
+ const conns = new Map<number, Set<number>>();
54
+ for (const vertex of vertices) {
55
+ const reach = new Set<number>();
56
+ this.getReachable(vertex, goal, reach);
57
+ conns.set(vertex, reach);
58
+ }
59
+ return this.cliques(vertices, conns);
60
+ }
61
+
62
+ cliques(vertices: readonly number[], conns: Map<number, Set<number>>) {
63
+ const getConns = (vertex: number) => {
64
+ const set = conns.get(vertex);
65
+ if (set !== undefined) return set;
66
+ const created = new Set<number>();
67
+ conns.set(vertex, created);
68
+ return created;
69
+ };
70
+ const isLess = (first: number, second: number) => {
71
+ const firstSize = getConns(first).size;
72
+ const secondSize = getConns(second).size;
73
+ return firstSize < secondSize || (firstSize === secondSize && first < second);
74
+ };
75
+ const todo = new Set(vertices);
76
+ const heap = new Set(vertices);
77
+ const result: number[][] = [];
78
+ while (todo.size > 0) {
79
+ let vertex = -1;
80
+ for (const candidate of heap)
81
+ if (vertex === -1 || isLess(candidate, vertex)) vertex = candidate;
82
+ const atMostOne = new Set<number>();
83
+ const next = getSortedSet(getConns(vertex))
84
+ .filter((neighbor) => todo.has(neighbor))
85
+ .sort((first, second) => (isLess(first, second) ? -1 : isLess(second, first) ? 1 : 0));
86
+ for (const neighbor of next) {
87
+ const isAll =
88
+ heap.has(neighbor) &&
89
+ getSortedSet(atMostOne).every((member) => getConns(neighbor).has(member));
90
+ if (isAll) atMostOne.add(neighbor);
91
+ }
92
+ atMostOne.add(vertex);
93
+ const members = getSortedSet(atMostOne);
94
+ for (const member of members) {
95
+ todo.delete(member);
96
+ for (const neighbor of getSortedSet(getConns(member))) getConns(neighbor).delete(member);
97
+ }
98
+ for (const member of members) heap.delete(member);
99
+ if (members.length <= 1) continue;
100
+ if (members.length === 2 && members[0] === this.negate(members[1])) continue;
101
+ result.push(members);
102
+ }
103
+ return result;
104
+ }
105
+ }
@@ -0,0 +1,309 @@
1
+ // Only the maxres strategy with Z3's default parameters is ported.
2
+ import { OP_AND, OP_EQ, OP_IMPLIES, OP_OR, SORT_BOOL } from "./ast";
3
+ import { mkNot } from "./ast-util";
4
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
5
+ import { type MaxsatContext, MaxsmtSolverBase, type Soft } from "./maxsmt-base";
6
+ import { Mus } from "./mus";
7
+ import type { ProtoModel } from "./proto-model";
8
+ import { Rational } from "./rational";
9
+ import { RefVector } from "./ref-vector";
10
+
11
+ export class Maxcore extends MaxsmtSolverBase {
12
+ private asms: RefVector;
13
+ private defs: RefVector;
14
+ private asm2weight = new Map<number, Rational>();
15
+ private mus: Mus;
16
+ private csmodel: ProtoModel | null = null;
17
+ private correctionSetSize = 0;
18
+ private isFeasibleOptimumFound = false;
19
+
20
+ constructor(context: MaxsatContext, index: number, soft: Soft[]) {
21
+ super(context, soft, index);
22
+ this.asms = new RefVector(context.manager);
23
+ this.defs = new RefVector(context.manager);
24
+ this.mus = new Mus(context.manager, context.getSolver());
25
+ }
26
+
27
+ private isLiteral(expr: number) {
28
+ const manager = this.manager;
29
+ const atom = manager.isNot(expr) ? manager.getArg(expr, 0) : expr;
30
+ return manager.isUninterpretedConst(atom);
31
+ }
32
+
33
+ private pin(expr: number) {
34
+ this.trail.push(expr);
35
+ return expr;
36
+ }
37
+
38
+ private mkApp(op: number, args: number[]) {
39
+ return this.pin(this.manager.mkApp(op, args, SORT_BOOL));
40
+ }
41
+
42
+ private add(expr: number) {
43
+ if (!this.manager.isTrue(expr)) this.solver.assertExpr(expr);
44
+ }
45
+
46
+ private addSoft(expr: number, weight: Rational) {
47
+ const existing = this.asm2weight.get(expr);
48
+ if (existing !== undefined) {
49
+ this.asm2weight.set(expr, existing.add(weight));
50
+ return;
51
+ }
52
+ if (this.isLiteral(expr)) {
53
+ this.newAssumption(expr, weight);
54
+ return;
55
+ }
56
+ const assumption = this.mkFreshBool("soft");
57
+ const fml = this.mkApp(OP_EQ, [assumption, expr]);
58
+ this.defs.push(fml);
59
+ this.add(fml);
60
+ this.newAssumption(assumption, weight);
61
+ }
62
+
63
+ private newAssumption(expr: number, weight: Rational) {
64
+ this.asm2weight.set(expr, weight);
65
+ this.asms.push(expr);
66
+ this.trail.push(expr);
67
+ }
68
+
69
+ private isFalseIn(model: ProtoModel, expr: number) {
70
+ const value = model.eval(expr, true);
71
+ const isFalse = value === this.manager.falseExpr;
72
+ this.manager.decRef(value);
73
+ return isFalse;
74
+ }
75
+
76
+ run() {
77
+ this.defs.reset();
78
+ if (!this.init()) return L_UNDEF;
79
+ this.initLocal();
80
+ while (this.lower.compare(this.upper) < 0) {
81
+ const status = this.checkSatHillClimb(this.asms.items);
82
+ if (!this.manager.limit.inc()) return L_UNDEF;
83
+ if (status === L_TRUE) {
84
+ this.foundOptimum();
85
+ return L_TRUE;
86
+ }
87
+ if (status === L_UNDEF) return L_UNDEF;
88
+ const processed = this.processUnsat();
89
+ if (processed === L_FALSE) this.lower = this.upper;
90
+ if (processed === L_UNDEF) return L_UNDEF;
91
+ }
92
+ this.foundOptimum();
93
+ return L_TRUE;
94
+ }
95
+
96
+ private checkSatHillClimb(assumptions: readonly number[]) {
97
+ if (!this.context.params.isHillClimbing) return this.checkSat(assumptions);
98
+ const asms = this.sortAssumptions(assumptions);
99
+ let status = L_TRUE;
100
+ let lastIndex = 0;
101
+ let index = 0;
102
+ while (index < asms.length && status === L_TRUE) {
103
+ while (asms.length > 20 * (index - lastIndex) && index < asms.length)
104
+ index = this.nextIndex(asms, index);
105
+ lastIndex = index;
106
+ status = this.checkSat(asms.slice(0, index));
107
+ }
108
+ return status;
109
+ }
110
+
111
+ private checkSat(assumptions: readonly number[]) {
112
+ const status = this.solver.checkSat(assumptions);
113
+ if (status !== L_TRUE) return status;
114
+ const model = this.solver.getModel();
115
+ if (model !== null) this.updateAssignment(model);
116
+ return status;
117
+ }
118
+
119
+ private foundOptimum() {
120
+ const model = this.model;
121
+ this.lower = Rational.zero;
122
+ for (const soft of this.soft) {
123
+ soft.value = model !== null && this.isTrueIn(model, soft.expr) ? L_TRUE : L_UNDEF;
124
+ if (soft.value !== L_TRUE) this.lower = this.lower.add(soft.weight);
125
+ }
126
+ this.upper = this.lower;
127
+ this.isFeasibleOptimumFound = true;
128
+ }
129
+
130
+ private getWeight(expr: number) {
131
+ return this.asm2weight.get(expr) ?? Rational.zero;
132
+ }
133
+
134
+ private sortAssumptions(assumptions: readonly number[]) {
135
+ const ids = this.manager.ids;
136
+ return [...assumptions].sort(
137
+ (first, second) =>
138
+ this.getWeight(second).compare(this.getWeight(first)) || ids[second] - ids[first],
139
+ );
140
+ }
141
+
142
+ private nextIndex(asms: readonly number[], start: number) {
143
+ if (start >= asms.length) return start;
144
+ const weight = this.getWeight(asms[start]);
145
+ let index = start + 1;
146
+ while (index < asms.length && weight.equals(this.getWeight(asms[index]))) index++;
147
+ return index;
148
+ }
149
+
150
+ private processUnsat() {
151
+ const cores: { core: number[]; weight: Rational }[] = [];
152
+ let status = L_FALSE;
153
+ while (status === L_FALSE) {
154
+ const core = new RefVector(this.manager);
155
+ for (const expr of this.solver.getUnsatCore()) core.push(expr);
156
+ this.updateMusModel();
157
+ status = this.minimizeCore(core);
158
+ const items = [...core.items];
159
+ for (const expr of items) this.trail.push(expr);
160
+ core.reset();
161
+ if (status !== L_TRUE) break;
162
+ if (items.length === 0) {
163
+ this.lower = this.upper;
164
+ return L_TRUE;
165
+ }
166
+ const weight = this.getCoreWeight(items);
167
+ cores.push({ core: items, weight });
168
+ this.removeSoft(items);
169
+ this.splitCore(items, weight);
170
+ if (items.length >= this.context.params.maxCoreSize) break;
171
+ status = this.checkSatHillClimb(this.asms.items);
172
+ }
173
+ if (status !== L_TRUE) return status;
174
+ if (cores.length === 0) return L_FALSE;
175
+ for (const entry of cores) this.processCore(entry.core, entry.weight);
176
+ return L_TRUE;
177
+ }
178
+
179
+ // The SAT core extracts a model while it computes a core; mus keeps no model for opt.
180
+ private updateMusModel() {
181
+ if (!this.context.isSatEnabled) return;
182
+ const model = this.solver.getModel();
183
+ if (model !== null && this.upper.isPositive()) this.updateAssignment(model);
184
+ }
185
+
186
+ private minimizeCore(core: RefVector) {
187
+ if (core.size === 0 || this.context.isSatEnabled) return L_TRUE;
188
+ this.mus.reset();
189
+ for (const expr of core.items) this.mus.addSoft(expr);
190
+ const minimized = new RefVector(this.manager);
191
+ const status = this.mus.getMus(minimized);
192
+ if (status === L_TRUE) {
193
+ core.reset();
194
+ for (const expr of minimized.items) core.push(expr);
195
+ }
196
+ minimized.reset();
197
+ return status;
198
+ }
199
+
200
+ private getCoreWeight(core: readonly number[]) {
201
+ if (core.length === 0) return Rational.zero;
202
+ return core
203
+ .map((expr) => this.getWeight(expr))
204
+ .reduce((minimum, weight) => (weight.compare(minimum) < 0 ? weight : minimum));
205
+ }
206
+
207
+ private splitCore(core: readonly number[], weight: Rational) {
208
+ for (const expr of core) {
209
+ const other = this.getWeight(expr);
210
+ if (other.compare(weight) > 0) this.newAssumption(expr, other.sub(weight));
211
+ }
212
+ }
213
+
214
+ private updateModel(def: number, value: number) {
215
+ const decl = this.manager.decls[def];
216
+ for (const model of [this.csmodel, this.model]) {
217
+ if (model === null) continue;
218
+ const evaluated = model.eval(value, true);
219
+ model.registerConst(decl, evaluated);
220
+ this.manager.decRef(evaluated);
221
+ }
222
+ }
223
+
224
+ private processCore(core: readonly number[], weight: Rational) {
225
+ this.maxResolve(core, weight);
226
+ const fml = this.pin(mkNot(this.manager, this.pin(this.manager.mkAnd([...core]))));
227
+ this.add(fml);
228
+ if (core.length <= 2) this.defs.push(fml);
229
+ this.lower = this.lower.add(weight);
230
+ if (this.csmodel !== null && this.correctionSetSize > 0) this.correctionSetSize--;
231
+ }
232
+
233
+ private maxResolve(core: readonly number[], weight: Rational) {
234
+ let disjunct = -1;
235
+ for (let index = 1; index < core.length; index++) {
236
+ const previous = core[index - 1];
237
+ const current = core[index];
238
+ if (index === 1) disjunct = previous;
239
+ else if (index === 2) disjunct = this.mkApp(OP_AND, [previous, disjunct]);
240
+ else {
241
+ const fresh = this.mkFreshBool("d");
242
+ for (const implied of [disjunct, previous]) {
243
+ const fml = this.mkApp(OP_IMPLIES, [fresh, implied]);
244
+ this.add(fml);
245
+ this.defs.push(fml);
246
+ }
247
+ this.updateModel(fresh, this.mkApp(OP_AND, [disjunct, previous]));
248
+ disjunct = fresh;
249
+ }
250
+ const assumption = this.mkFreshBool("a");
251
+ const clause = this.mkApp(OP_OR, [current, disjunct]);
252
+ const fml = this.mkApp(OP_IMPLIES, [assumption, clause]);
253
+ this.updateModel(assumption, clause);
254
+ this.newAssumption(assumption, weight);
255
+ this.add(fml);
256
+ this.defs.push(fml);
257
+ }
258
+ }
259
+
260
+ private getCost(model: ProtoModel) {
261
+ let cost = Rational.zero;
262
+ for (const soft of this.soft)
263
+ if (!this.isTrueIn(model, soft.expr)) cost = cost.add(soft.weight);
264
+ return cost;
265
+ }
266
+
267
+ private updateAssignment(model: ProtoModel) {
268
+ let correctionSetSize = 0;
269
+ for (const expr of this.asms.items) if (this.isFalseIn(model, expr)) correctionSetSize++;
270
+ if (this.csmodel === null || correctionSetSize < this.correctionSetSize) {
271
+ this.csmodel = model;
272
+ this.correctionSetSize = correctionSetSize;
273
+ }
274
+ const upper = this.getCost(model);
275
+ if (upper.compare(this.upper) > 0) return;
276
+ if (!this.context.verifyModel(this.index, model, upper)) return;
277
+ this.model = model;
278
+ this.context.modelUpdated(model);
279
+ for (const soft of this.soft) soft.value = this.isTrueIn(model, soft.expr) ? L_TRUE : L_UNDEF;
280
+ this.upper = upper;
281
+ }
282
+
283
+ private removeSoft(core: readonly number[]) {
284
+ const kept = this.asms.items.filter((expr) => !core.includes(expr));
285
+ for (const expr of kept) this.trail.push(expr);
286
+ this.asms.reset();
287
+ for (const expr of kept) this.asms.push(expr);
288
+ }
289
+
290
+ private initLocal() {
291
+ for (const soft of this.soft) this.addSoft(soft.expr, soft.weight);
292
+ this.isFeasibleOptimumFound = false;
293
+ this.csmodel = null;
294
+ this.correctionSetSize = 0;
295
+ }
296
+
297
+ commitAssignment() {
298
+ if (!this.isFeasibleOptimumFound) return;
299
+ for (const expr of this.defs.items) this.add(expr);
300
+ for (const expr of this.asms.items) this.add(expr);
301
+ }
302
+
303
+ release() {
304
+ this.asms.reset();
305
+ this.defs.reset();
306
+ this.mus.reset();
307
+ super.release();
308
+ }
309
+ }
@@ -1,5 +1,4 @@
1
- // Ported from Z3 (src/ast/rewriter/maximize_ac_sharing.cpp), MIT license, see z3-license.txt.
2
- import { OP_ADD, OP_OR } from "./ast";
1
+ import { OP_ADD, OP_BADD, OP_BAND, OP_BMUL, OP_BOR, OP_OR } from "./ast";
3
2
  import { RewriterTpl } from "./rewriter-tpl";
4
3
  import { shrink } from "./array";
5
4
 
@@ -11,8 +10,10 @@ interface SharingEntry {
11
10
 
12
11
  const MAX_NUM_ARGS_FOR_OPT = 128;
13
12
 
13
+ // Z3 compares kinds without the family, and bvmul's kind is also that of or and +.
14
+ const SHARED_OPS = new Set([OP_BADD, OP_BMUL, OP_BOR, OP_BAND, OP_OR, OP_ADD]);
15
+
14
16
  export class MaxBvSharing extends RewriterTpl {
15
- // Z3 compares the kind without the family, and bvmul has the kind of or and of +, so those are shared.
16
17
  private isInit = false;
17
18
  private entries: SharingEntry[] = [];
18
19
  private pairCache = new Map<number, Map<number, Set<number>>>();
@@ -21,9 +22,10 @@ export class MaxBvSharing extends RewriterTpl {
21
22
  reduceApp(decl: number, args: number[], sort: number) {
22
23
  const manager = this.manager;
23
24
  const op = manager.funcDecls[decl].op;
24
- if (!this.isInit || (op !== OP_OR && op !== OP_ADD) || args.length <= 2) return -1;
25
+ if (!this.isInit || !SHARED_OPS.has(op) || args.length <= 2) return -1;
25
26
  return manager.withTemporaries(() => {
26
- const pending = [...args];
27
+ const numeral = manager.isBvNumeral(args[0]) ? args[0] : -1;
28
+ const pending = numeral === -1 ? [...args] : args.slice(1);
27
29
  for (let merged = 0; pending.length > 1 && pending.length < MAX_NUM_ARGS_FOR_OPT;) {
28
30
  let pairFirst = -1;
29
31
  let pairSecond = -1;
@@ -55,7 +57,7 @@ export class MaxBvSharing extends RewriterTpl {
55
57
  }
56
58
  pending.splice(0, pending.length, ...next);
57
59
  }
58
- return pending[0];
60
+ return numeral === -1 ? pending[0] : manager.mkApp(decl, [numeral, pending[0]], sort);
59
61
  });
60
62
  }
61
63
 
@@ -0,0 +1,115 @@
1
+ import { OP_NOT, SORT_BOOL } from "./ast";
2
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
3
+ import { type MaxsatContext, MaxsmtSolverBase, type Soft } from "./maxsmt-base";
4
+ import type { ProtoModel } from "./proto-model";
5
+ import { Rational } from "./rational";
6
+
7
+ export const isMaxlex = (soft: readonly Soft[]) => {
8
+ const weights = soft.map((entry) => entry.weight).sort((first, second) => second.compare(first));
9
+ let sum = weights.reduce((total, weight) => total.add(weight), Rational.zero);
10
+ for (const weight of weights) {
11
+ if (sum.compare(weight.add(weight)) > 0) return false;
12
+ sum = sum.sub(weight);
13
+ }
14
+ return true;
15
+ };
16
+
17
+ export class Maxlex extends MaxsmtSolverBase {
18
+ constructor(context: MaxsatContext, index: number, soft: Soft[]) {
19
+ super(context, soft, index);
20
+ const ids = context.manager.ids;
21
+ soft.sort(
22
+ (first, second) => second.weight.compare(first.weight) || ids[second.expr] - ids[first.expr],
23
+ );
24
+ }
25
+
26
+ private assertValue(soft: Soft) {
27
+ if (soft.value === L_TRUE) this.solver.assertExpr(soft.expr);
28
+ else if (soft.value === L_FALSE) {
29
+ const negated = this.manager.mkApp(OP_NOT, [soft.expr], SORT_BOOL);
30
+ this.trail.push(negated);
31
+ this.solver.assertExpr(negated);
32
+ }
33
+ }
34
+
35
+ private updateFromSolver() {
36
+ const model = this.solver.getModel();
37
+ if (model === null) return false;
38
+ this.model = model;
39
+ this.context.modelUpdated(model);
40
+ this.updateAssignment(model);
41
+ return true;
42
+ }
43
+
44
+ private updateAssignment(model: ProtoModel) {
45
+ let isFirstUndef = true;
46
+ let isSecondUndef = false;
47
+ for (const soft of this.soft) {
48
+ if (isFirstUndef && soft.value !== L_UNDEF) continue;
49
+ if (isFirstUndef) {
50
+ soft.value = L_TRUE;
51
+ this.assertValue(soft);
52
+ isFirstUndef = false;
53
+ continue;
54
+ }
55
+ if (soft.value === L_FALSE) continue;
56
+ const value = this.isTrueIn(model, soft.expr) ? L_TRUE : L_UNDEF;
57
+ if (value === L_UNDEF) isSecondUndef = true;
58
+ soft.value = value;
59
+ if (!isSecondUndef) this.assertValue(soft);
60
+ }
61
+ this.updateBounds();
62
+ }
63
+
64
+ private updateBounds() {
65
+ this.lower = Rational.zero;
66
+ this.upper = Rational.zero;
67
+ for (const soft of this.soft) {
68
+ if (soft.value === L_TRUE) continue;
69
+ this.upper = this.upper.add(soft.weight);
70
+ if (soft.value === L_FALSE) this.lower = this.lower.add(soft.weight);
71
+ }
72
+ }
73
+
74
+ private initLex() {
75
+ for (const soft of this.soft) soft.value = L_UNDEF;
76
+ const model = this.solver.getModel();
77
+ if (model === null) return;
78
+ for (const soft of this.soft) {
79
+ if (!this.isTrueIn(model, soft.expr)) {
80
+ this.updateBounds();
81
+ return;
82
+ }
83
+ soft.value = L_TRUE;
84
+ this.assertValue(soft);
85
+ }
86
+ this.updateFromSolver();
87
+ }
88
+
89
+ run() {
90
+ this.initLex();
91
+ for (let index = 0; index < this.soft.length; index++) {
92
+ const soft = this.soft[index];
93
+ if (soft.value !== L_UNDEF) continue;
94
+ const status = this.solver.checkSat([soft.expr]);
95
+ if (status === L_UNDEF) return L_UNDEF;
96
+ if (status === L_TRUE) {
97
+ if (!this.updateFromSolver()) return L_UNDEF;
98
+ continue;
99
+ }
100
+ soft.value = L_FALSE;
101
+ this.assertValue(soft);
102
+ for (let later = index + 1; later < this.soft.length; later++) {
103
+ if (this.soft[later].value !== L_TRUE) break;
104
+ this.assertValue(this.soft[later]);
105
+ }
106
+ this.updateBounds();
107
+ }
108
+ return L_TRUE;
109
+ }
110
+
111
+ commitAssignment() {
112
+ if (this.soft.some((soft) => soft.value === L_UNDEF)) return;
113
+ for (const soft of this.soft) this.assertValue(soft);
114
+ }
115
+ }
@@ -0,0 +1,105 @@
1
+ import { type AstManager, SORT_BOOL } from "./ast";
2
+ import { L_TRUE, L_UNDEF } from "./lbool";
3
+ import { Preprocess } from "./opt-preprocess";
4
+ import type { ProtoModel } from "./proto-model";
5
+ import { Rational } from "./rational";
6
+ import { RefVector } from "./ref-vector";
7
+
8
+ export interface MaxsatSolver {
9
+ assertExpr(expr: number): void;
10
+ checkSat(assumptions: readonly number[]): number;
11
+ getModel(): ProtoModel | null;
12
+ getUnsatCore(): readonly number[];
13
+ findMutexes(vars: readonly number[]): { status: number; mutexes: number[][] };
14
+ }
15
+
16
+ export interface MaxsatParams {
17
+ maxsatEngine: string;
18
+ isMaxlexEnabled: boolean;
19
+ isHillClimbing: boolean;
20
+ maxCoreSize: number;
21
+ }
22
+
23
+ export interface MaxsatContext {
24
+ readonly manager: AstManager;
25
+ readonly params: MaxsatParams;
26
+ readonly isSatEnabled: boolean;
27
+ getSolver(): MaxsatSolver;
28
+ getBaseModel(): ProtoModel | null;
29
+ hide(decl: number): void;
30
+ adjust(index: number, value: Rational): Rational;
31
+ addOffset(index: number, value: Rational): void;
32
+ verifyModel(index: number, model: ProtoModel, value: Rational): boolean;
33
+ modelUpdated(model: ProtoModel): void;
34
+ }
35
+
36
+ export interface Soft {
37
+ expr: number;
38
+ weight: Rational;
39
+ value: number;
40
+ }
41
+
42
+ export abstract class MaxsmtSolverBase {
43
+ protected readonly manager: AstManager;
44
+ lower = Rational.zero;
45
+ upper = Rational.zero;
46
+ model: ProtoModel | null;
47
+ protected trail: RefVector;
48
+
49
+ constructor(
50
+ protected readonly context: MaxsatContext,
51
+ protected soft: Soft[],
52
+ protected readonly index: number,
53
+ ) {
54
+ this.manager = context.manager;
55
+ this.model = context.getBaseModel();
56
+ this.trail = new RefVector(context.manager);
57
+ }
58
+
59
+ abstract run(): number;
60
+
61
+ abstract commitAssignment(): void;
62
+
63
+ protected get solver() {
64
+ return this.context.getSolver();
65
+ }
66
+
67
+ protected isTrueIn(model: ProtoModel, expr: number) {
68
+ const value = model.eval(expr, true);
69
+ const isTrue = value === this.manager.trueExpr;
70
+ this.manager.decRef(value);
71
+ return isTrue;
72
+ }
73
+
74
+ protected init() {
75
+ this.lower = Rational.zero;
76
+ this.upper = Rational.zero;
77
+ for (const soft of this.soft) {
78
+ soft.value = this.manager.isTrue(soft.expr) ? L_TRUE : L_UNDEF;
79
+ if (soft.value !== L_TRUE) this.upper = this.upper.add(soft.weight);
80
+ }
81
+ const preprocess = new Preprocess(this.manager, this.solver);
82
+ const preprocessed = preprocess.run(this.soft);
83
+ if (preprocessed !== undefined) {
84
+ this.soft.splice(0, this.soft.length, ...preprocessed.soft);
85
+ for (const soft of this.soft) this.trail.push(soft.expr);
86
+ }
87
+ preprocess.release();
88
+ if (preprocessed === undefined) return false;
89
+ this.context.addOffset(this.index, preprocessed.lower);
90
+ this.upper = this.upper.sub(preprocessed.lower);
91
+ return true;
92
+ }
93
+
94
+ protected mkFreshBool(name: string) {
95
+ const manager = this.manager;
96
+ const fresh = manager.mkFreshConst(name, SORT_BOOL);
97
+ this.trail.push(fresh);
98
+ this.context.hide(manager.decls[fresh]);
99
+ return fresh;
100
+ }
101
+
102
+ release() {
103
+ this.trail.reset();
104
+ }
105
+ }