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,92 @@
1
+ import { SmtCanceledError, SmtUnsupportedError } from "../../../errors";
2
+ import { L_FALSE, L_UNDEF } from "./lbool";
3
+ import { Maxcore } from "./maxcore";
4
+ import { isMaxlex, Maxlex } from "./maxlex";
5
+ import type { MaxsatContext, MaxsmtSolverBase, Soft } from "./maxsmt-base";
6
+ import type { ProtoModel } from "./proto-model";
7
+ import { Rational } from "./rational";
8
+ import { RefVector } from "./ref-vector";
9
+
10
+ export class Maxsmt {
11
+ private soft: Soft[] = [];
12
+ private softIndex = new Map<number, number>();
13
+ private terms: RefVector;
14
+ private msolver: MaxsmtSolverBase | null = null;
15
+ private lower = Rational.zero;
16
+ private upper = Rational.zero;
17
+ model: ProtoModel | null = null;
18
+
19
+ constructor(
20
+ private readonly context: MaxsatContext,
21
+ private readonly index: number,
22
+ ) {
23
+ this.terms = new RefVector(context.manager);
24
+ }
25
+
26
+ run(isCommitted: boolean) {
27
+ const context = this.context;
28
+ const engine = context.params.maxsatEngine;
29
+ this.msolver?.release();
30
+ this.msolver = null;
31
+ if (!isCommitted && context.params.isMaxlexEnabled && isMaxlex(this.soft))
32
+ this.msolver = new Maxlex(context, this.index, this.soft);
33
+ else if (this.soft.length === 0 || engine === "maxres")
34
+ this.msolver = new Maxcore(context, this.index, this.soft);
35
+ else throw new SmtUnsupportedError(`the MaxSAT engine ${engine}`);
36
+ const status = (() => {
37
+ try {
38
+ return this.msolver.run();
39
+ } catch (error) {
40
+ if (!(error instanceof SmtCanceledError)) throw error;
41
+ return L_UNDEF;
42
+ }
43
+ })();
44
+ if (status !== L_FALSE) this.model = this.msolver.model;
45
+ return status;
46
+ }
47
+
48
+ add(expr: number, weight: Rational) {
49
+ const existing = this.softIndex.get(expr);
50
+ if (existing !== undefined) this.soft[existing].weight = this.soft[existing].weight.add(weight);
51
+ else {
52
+ this.terms.push(expr);
53
+ this.softIndex.set(expr, this.soft.length);
54
+ this.soft.push({ expr, weight, value: L_UNDEF });
55
+ }
56
+ this.upper = this.upper.add(weight);
57
+ }
58
+
59
+ getLower() {
60
+ const lower = this.msolver?.lower;
61
+ return this.context.adjust(
62
+ this.index,
63
+ lower !== undefined && lower.compare(this.lower) > 0 ? lower : this.lower,
64
+ );
65
+ }
66
+
67
+ getUpper() {
68
+ const upper = this.msolver?.upper;
69
+ return this.context.adjust(
70
+ this.index,
71
+ upper !== undefined && upper.compare(this.upper) < 0 ? upper : this.upper,
72
+ );
73
+ }
74
+
75
+ updateLower(value: Rational) {
76
+ this.lower = value;
77
+ }
78
+
79
+ updateUpper(value: Rational) {
80
+ this.upper = value;
81
+ }
82
+
83
+ commitAssignment() {
84
+ this.msolver?.commitAssignment();
85
+ }
86
+
87
+ release() {
88
+ this.msolver?.release();
89
+ this.msolver = null;
90
+ this.terms.reset();
91
+ }
92
+ }
@@ -0,0 +1,467 @@
1
+ import { SmtInvariantError, SmtUnsupportedError } from "../../../../errors";
2
+ import {
3
+ type AstManager,
4
+ OP_ADD,
5
+ OP_AND,
6
+ OP_DISTINCT,
7
+ OP_DIV,
8
+ OP_EQ,
9
+ OP_GE,
10
+ OP_GT,
11
+ OP_IDIV,
12
+ OP_ITE,
13
+ OP_LE,
14
+ OP_LT,
15
+ OP_MOD,
16
+ OP_MUL,
17
+ OP_OR,
18
+ OP_SUB,
19
+ OP_UMINUS,
20
+ SORT_BOOL,
21
+ SORT_INT,
22
+ SORT_REAL,
23
+ } from "../ast";
24
+ import { getExtendedNumeral, mkNot } from "../ast-util";
25
+ import { ExprSafeReplace } from "../expr-safe-replace";
26
+ import { ObjMap } from "../hashtable";
27
+ import {
28
+ DEF_ADD,
29
+ DEF_CONST,
30
+ DEF_DIV,
31
+ DEF_MUL,
32
+ type MboDef,
33
+ type MboRow,
34
+ type MboVar,
35
+ ModelBasedOpt,
36
+ T_DIV,
37
+ T_DIVIDES,
38
+ T_EQ,
39
+ T_LE,
40
+ T_LT,
41
+ T_MOD,
42
+ } from "../model-based-opt";
43
+ import { getEuclideanDiv, getEuclideanMod, Rational } from "../rational";
44
+ import type { RefVector } from "../ref-vector";
45
+ import { getBinaryArgs, getNumeral, markRec, type MbpContext } from "./mbp-plugin";
46
+
47
+ const isArith = (manager: AstManager, expr: number) =>
48
+ manager.sorts[expr] === SORT_INT || manager.sorts[expr] === SORT_REAL;
49
+
50
+ const insertMul = (terms: ObjMap<Rational>, expr: number, value: Rational) =>
51
+ terms.set(expr, (terms.get(expr) ?? Rational.zero).add(value));
52
+
53
+ interface Constant {
54
+ value: Rational;
55
+ }
56
+
57
+ interface Definition {
58
+ readonly variable: number;
59
+ readonly term: number;
60
+ }
61
+
62
+ export class ArithProjectPlugin {
63
+ private manager: AstManager;
64
+ isCheckPurified = true;
65
+ isApplyProjection = false;
66
+
67
+ constructor(private context: MbpContext) {
68
+ this.manager = context.manager;
69
+ }
70
+
71
+ private mkNumeral(value: Rational, isInt: boolean) {
72
+ return this.manager.mkNumeralOfSort(value, isInt ? SORT_INT : SORT_REAL);
73
+ }
74
+
75
+ private mkBinary(op: number, left: number, right: number) {
76
+ const sort =
77
+ op === OP_ADD || op === OP_MUL || op === OP_IDIV || op === OP_MOD || op === OP_DIV
78
+ ? this.manager.sorts[left]
79
+ : SORT_BOOL;
80
+ return this.manager.mkApp(op, [left, right], sort);
81
+ }
82
+
83
+ private mkMul(coeff: Rational, expr: number) {
84
+ const isInt = this.manager.sorts[expr] === SORT_INT;
85
+ return this.mkBinary(OP_MUL, this.mkNumeral(coeff, isInt), expr);
86
+ }
87
+
88
+ private mkAdd(terms: number[]) {
89
+ return terms.length === 0
90
+ ? this.manager.mkNumeral(0n)
91
+ : terms.length === 1
92
+ ? terms[0]
93
+ : this.manager.mkApp(OP_ADD, terms, this.manager.sorts[terms[0]]);
94
+ }
95
+
96
+ // Extracts the linear inequalities of a literal into mbo. It picks the branches of conditionals
97
+ // by the model, and gives mbo the values of the subterms that it treats as variables.
98
+ private linearizeLit(
99
+ mbo: ModelBasedOpt,
100
+ lit: number,
101
+ fmls: RefVector,
102
+ tids: Map<number, number>,
103
+ ): boolean {
104
+ const context = this.context;
105
+ const manager = this.manager;
106
+ const terms = new ObjMap<Rational>((expr) => manager.hashes[expr]);
107
+ const constant: Constant = { value: Rational.zero };
108
+ let mul = Rational.one;
109
+ let type = T_LE;
110
+ const isNot = manager.isNot(lit);
111
+ const atom = isNot ? manager.getArg(lit, 0) : lit;
112
+ if (isNot) mul = mul.neg();
113
+ const linearizeBoth = (first: number, second: number) => {
114
+ this.linearize(mbo, mul, first, constant, fmls, terms, tids);
115
+ this.linearize(mbo, mul.neg(), second, constant, fmls, terms, tids);
116
+ };
117
+ const op = manager.getOp(atom);
118
+ const binary = manager.getNumArgs(atom) === 2 ? manager.getArgs(atom) : undefined;
119
+ if (binary !== undefined && (op === OP_LE || op === OP_GE)) {
120
+ if (op === OP_LE) linearizeBoth(binary[0], binary[1]);
121
+ else linearizeBoth(binary[1], binary[0]);
122
+ type = isNot ? T_LT : T_LE;
123
+ } else if (binary !== undefined && (op === OP_LT || op === OP_GT)) {
124
+ if (op === OP_LT) linearizeBoth(binary[0], binary[1]);
125
+ else linearizeBoth(binary[1], binary[0]);
126
+ type = isNot ? T_LE : T_LT;
127
+ } else if (op === OP_EQ && !isNot && isArith(manager, manager.getArg(atom, 0))) {
128
+ linearizeBoth(manager.getArg(atom, 0), manager.getArg(atom, 1));
129
+ type = T_EQ;
130
+ } else if (op === OP_EQ && isNot && isArith(manager, manager.getArg(atom, 0))) {
131
+ let first = manager.getArg(atom, 0);
132
+ let second = manager.getArg(atom, 1);
133
+ const value1 = getNumeral(manager, context.eval(first, true));
134
+ const value2 = getNumeral(manager, context.eval(second, true));
135
+ if (value1 === undefined || value2 === undefined) return false;
136
+ if (value1.compare(value2) < 0) [first, second] = [second, first];
137
+ type = T_LT;
138
+ linearizeBoth(first, second);
139
+ } else if (op === OP_DISTINCT && !isNot && isArith(manager, manager.getArg(atom, 0))) {
140
+ const nums: { expr: number; value: Rational }[] = [];
141
+ for (const arg of manager.getArgs(atom)) {
142
+ const value = getNumeral(manager, context.eval(arg, true));
143
+ if (value === undefined) return false;
144
+ nums.push({ expr: arg, value });
145
+ }
146
+ nums.sort((left, right) => left.value.compare(right.value));
147
+ for (let index = 0; index + 1 < nums.length; index++) {
148
+ const less = context.pin(this.mkBinary(OP_LT, nums[index].expr, nums[index + 1].expr));
149
+ if (!this.linearizeLit(mbo, less, fmls, tids)) return false;
150
+ }
151
+ return true;
152
+ } else if (op === OP_DISTINCT && isNot && isArith(manager, manager.getArg(atom, 0))) {
153
+ // Linearizes two arguments that are equal.
154
+ const values: { value: Rational; expr: number }[] = [];
155
+ for (const arg of manager.getArgs(atom)) {
156
+ const value = getNumeral(manager, context.eval(arg, true));
157
+ if (value === undefined) return false;
158
+ const other = values.find((entry) => entry.value.equals(value));
159
+ if (other !== undefined) {
160
+ type = T_EQ;
161
+ linearizeBoth(arg, other.expr);
162
+ break;
163
+ }
164
+ values.push({ value, expr: arg });
165
+ }
166
+ } else if (op === OP_AND && !isNot) {
167
+ for (const arg of manager.getArgs(atom)) fmls.push(arg);
168
+ return true;
169
+ } else if (op === OP_OR && isNot) {
170
+ for (const arg of manager.getArgs(atom)) fmls.push(context.pin(mkNot(manager, arg)));
171
+ return true;
172
+ } else if (op === OP_OR && !isNot) {
173
+ const found = manager.getArgs(atom).find((arg) => context.isTrue(arg, true));
174
+ if (found === undefined) return false;
175
+ fmls.push(found);
176
+ return true;
177
+ } else if (op === OP_AND && isNot) {
178
+ const found = manager.getArgs(atom).find((arg) => context.isFalse(arg, true));
179
+ if (found === undefined) return false;
180
+ fmls.push(context.pin(mkNot(manager, found)));
181
+ return true;
182
+ } else return false;
183
+ mbo.addConstraint(this.extractCoefficients(mbo, terms, tids), constant.value, type);
184
+ return true;
185
+ }
186
+
187
+ // Adds a linear arithmetic term to the inequality for mbo.
188
+ private linearize(
189
+ mbo: ModelBasedOpt,
190
+ mul: Rational,
191
+ term: number,
192
+ constant: Constant,
193
+ fmls: RefVector,
194
+ terms: ObjMap<Rational>,
195
+ tids: Map<number, number>,
196
+ ): void {
197
+ const context = this.context;
198
+ const manager = this.manager;
199
+ const recurse = (factor: Rational, arg: number) =>
200
+ this.linearize(mbo, factor, arg, constant, fmls, terms, tids);
201
+ const addDef = (arg: number) => {
202
+ const termsOfArg = new ObjMap<Rational>((expr) => manager.hashes[expr]);
203
+ const argConstant: Constant = { value: Rational.zero };
204
+ this.linearize(mbo, Rational.one, arg, argConstant, fmls, termsOfArg, tids);
205
+ const coeffs = this.extractCoefficients(mbo, termsOfArg, tids);
206
+ insertMul(terms, term, mul);
207
+ return { coeffs, value: argConstant.value };
208
+ };
209
+ const mulArgs = getBinaryArgs(manager, term, OP_MUL);
210
+ const factor0 = mulArgs === undefined ? undefined : getExtendedNumeral(manager, mulArgs[0]);
211
+ const factor1 = mulArgs === undefined ? undefined : getExtendedNumeral(manager, mulArgs[1]);
212
+ const op = manager.getOp(term);
213
+ const divisor =
214
+ (op === OP_MOD || op === OP_IDIV) && manager.getNumArgs(term) === 2
215
+ ? getExtendedNumeral(manager, manager.getArg(term, 1))
216
+ : undefined;
217
+ const numeral = getNumeral(manager, term);
218
+ if (tids.has(term)) insertMul(terms, term, mul);
219
+ else if (mulArgs !== undefined && factor0 !== undefined) recurse(mul.mul(factor0), mulArgs[1]);
220
+ else if (mulArgs !== undefined && factor1 !== undefined) recurse(mul.mul(factor1), mulArgs[0]);
221
+ else if (op === OP_UMINUS && manager.getNumArgs(term) === 1)
222
+ recurse(mul.neg(), manager.getArg(term, 0));
223
+ else if (numeral !== undefined) constant.value = constant.value.add(mul.mul(numeral));
224
+ else if (op === OP_ADD) for (const arg of manager.getArgs(term)) recurse(mul, arg);
225
+ else if (op === OP_SUB && manager.getNumArgs(term) === 2) {
226
+ recurse(mul, manager.getArg(term, 0));
227
+ recurse(mul.neg(), manager.getArg(term, 1));
228
+ } else if (op === OP_ITE) {
229
+ const condition = manager.getArg(term, 0);
230
+ const value = context.eval(condition, true);
231
+ if (manager.isTrue(value)) {
232
+ recurse(mul, manager.getArg(term, 1));
233
+ fmls.push(condition);
234
+ } else if (manager.isFalse(value)) {
235
+ fmls.push(context.pin(mkNot(manager, condition)));
236
+ recurse(mul, manager.getArg(term, 2));
237
+ } else throw new SmtUnsupportedError("mbp evaluation didn't produce a truth value");
238
+ } else if (op === OP_MOD && divisor !== undefined && divisor.isPositive()) {
239
+ // v = t1 mod divisor
240
+ const definition = addDef(manager.getArg(term, 0));
241
+ tids.set(term, mbo.addMod(definition.coeffs, definition.value, divisor));
242
+ } else if (op === OP_IDIV && divisor !== undefined && divisor.isPositive()) {
243
+ // v = t1 div divisor
244
+ const definition = addDef(manager.getArg(term, 0));
245
+ tids.set(term, mbo.addDiv(definition.coeffs, definition.value, divisor));
246
+ } else insertMul(terms, term, mul);
247
+ }
248
+
249
+ private extractCoefficients(
250
+ mbo: ModelBasedOpt,
251
+ terms: ObjMap<Rational>,
252
+ tids: Map<number, number>,
253
+ ) {
254
+ const manager = this.manager;
255
+ const coeffs: MboVar[] = [];
256
+ for (const [expr, coeff] of terms) {
257
+ let id = tids.get(expr);
258
+ if (id === undefined) {
259
+ const value = getNumeral(manager, this.context.eval(expr, true));
260
+ if (value === undefined) throw new SmtUnsupportedError("mbp evaluation was only partial");
261
+ id = mbo.addVar(value, manager.sorts[expr] === SORT_INT);
262
+ tids.set(expr, id);
263
+ }
264
+ if (!coeff.isZero()) coeffs.push({ id, coeff });
265
+ }
266
+ return coeffs;
267
+ }
268
+
269
+ project1(variable: number, lits: RefVector) {
270
+ const vars = [variable];
271
+ return this.project(vars, lits) && vars.length === 0;
272
+ }
273
+
274
+ // Projects the arithmetic variables it can out of the literals, and leaves the others in vars.
275
+ project(vars: number[], fmls: RefVector) {
276
+ const context = this.context;
277
+ const manager = this.manager;
278
+ if (!vars.some((innerVar) => isArith(manager, innerVar))) return true;
279
+ const mbo = new ModelBasedOpt();
280
+ const tids = new Map<number, number>();
281
+ let kept = 0;
282
+ for (let index = 0; index < fmls.size; index++) {
283
+ const formula = fmls.items[index];
284
+ // The linearized formulas hold the terms of tids.
285
+ if (this.linearizeLit(mbo, formula, fmls, tids)) context.pin(formula);
286
+ else fmls.set(kept++, formula);
287
+ }
288
+ fmls.shrink(kept);
289
+ const varMark = new Set(vars);
290
+ for (const innerVar of vars) {
291
+ if (!isArith(manager, innerVar) || tids.has(innerVar)) continue;
292
+ const value = getNumeral(manager, context.eval(innerVar, true));
293
+ if (value === undefined)
294
+ throw new SmtUnsupportedError("evaluation did not produce a numeral");
295
+ tids.set(innerVar, mbo.addVar(value, manager.sorts[innerVar] === SORT_INT));
296
+ }
297
+ // Variables in non-linear subterms stay.
298
+ const isPure = (expr: number) => {
299
+ const op = manager.getOp(expr);
300
+ if (op === OP_MOD && manager.getNumArgs(expr) === 2)
301
+ return manager.isNumeral(manager.getArg(expr, 1));
302
+ if (op === OP_IDIV && manager.getNumArgs(expr) === 2)
303
+ return getNumeral(manager, manager.getArg(expr, 1))?.isPositive() === true;
304
+ return false;
305
+ };
306
+ const fmlsMark = new Set<number>();
307
+ for (const expr of tids.keys())
308
+ if (isArith(manager, expr) && !isPure(expr) && !varMark.has(expr))
309
+ markRec(manager, fmlsMark, expr);
310
+ if (this.isCheckPurified) {
311
+ for (const formula of fmls.items) markRec(manager, fmlsMark, formula);
312
+ for (const expr of tids.keys())
313
+ if (!varMark.has(expr) && !isPure(expr)) markRec(manager, fmlsMark, expr);
314
+ }
315
+ const index2Expr: number[] = [];
316
+ for (const [expr, id] of tids) index2Expr[id] = expr;
317
+ const realVars: number[] = [];
318
+ let keptVars = 0;
319
+ for (const innerVar of vars) {
320
+ if (isArith(manager, innerVar) && !fmlsMark.has(innerVar))
321
+ realVars.push(tids.get(innerVar) as number);
322
+ else vars[keptVars++] = innerVar;
323
+ }
324
+ vars.length = keptVars;
325
+ const defs = mbo.project(realVars, this.isApplyProjection);
326
+ const rows = mbo.getLiveRows();
327
+ const defVars = new Map<number, MboRow>();
328
+ for (const row of rows) if (row.type === T_MOD || row.type === T_DIV) defVars.set(row.id, row);
329
+ this.rows2Fmls(defVars, rows, index2Expr, fmls);
330
+ if (!this.isApplyProjection) return true;
331
+ const definitions = defs.map((def, index) => {
332
+ if (def === null) throw new SmtInvariantError("mbo computes a definition for each variable");
333
+ const variable = index2Expr[realVars[index]];
334
+ const isInt = manager.sorts[variable] === SORT_INT;
335
+ return { variable, term: context.pin(this.fromDef(defVars, def, isInt, index2Expr)) };
336
+ });
337
+ return this.applyProjection(definitions, fmls);
338
+ }
339
+
340
+ private fromDef(
341
+ defVars: Map<number, MboRow>,
342
+ def: MboDef,
343
+ isInt: boolean,
344
+ index2Expr: number[],
345
+ ): number {
346
+ if (def.kind === DEF_ADD || def.kind === DEF_MUL)
347
+ return this.mkBinary(
348
+ def.kind === DEF_ADD ? OP_ADD : OP_MUL,
349
+ this.fromDef(defVars, def.x, isInt, index2Expr),
350
+ this.fromDef(defVars, def.y, isInt, index2Expr),
351
+ );
352
+ if (def.kind === DEF_CONST) return this.mkNumeral(def.value, isInt);
353
+ if (def.kind === DEF_DIV)
354
+ return this.mkBinary(
355
+ isInt ? OP_IDIV : OP_DIV,
356
+ this.fromDef(defVars, def.x, isInt, index2Expr),
357
+ this.mkNumeral(def.div, isInt),
358
+ );
359
+ const term = this.id2Expr(defVars, index2Expr, def.v.id);
360
+ return def.v.coeff.equals(Rational.one)
361
+ ? term
362
+ : this.mkBinary(OP_MUL, this.mkNumeral(def.v.coeff, isInt), term);
363
+ }
364
+
365
+ // apply_projection: substitutes the definitions into the formulas, and fails on a formula the
366
+ // model falsifies.
367
+ private applyProjection(definitions: Definition[], fmls: RefVector) {
368
+ const context = this.context;
369
+ if (fmls.size === 0 || definitions.length === 0) return true;
370
+ const subst = new ExprSafeReplace(this.manager);
371
+ for (let index = definitions.length; index-- > 0;) {
372
+ const term = subst.apply(definitions[index].term);
373
+ context.pinned.pushOwned(term);
374
+ subst.insert(definitions[index].variable, term);
375
+ }
376
+ for (let index = 0; index < fmls.size; index++) {
377
+ const replaced = subst.apply(fmls.items[index]);
378
+ context.pinned.pushOwned(replaced);
379
+ if (context.isFalse(replaced, true)) {
380
+ subst.release();
381
+ return false;
382
+ }
383
+ fmls.set(index, replaced);
384
+ }
385
+ subst.release();
386
+ return true;
387
+ }
388
+
389
+ private id2Expr(defVars: Map<number, MboRow>, index2Expr: number[], id: number): number {
390
+ const row = defVars.get(id);
391
+ return row === undefined ? index2Expr[id] : this.row2Expr(defVars, index2Expr, row);
392
+ }
393
+
394
+ private row2Expr(defVars: Map<number, MboRow>, index2Expr: number[], row: MboRow) {
395
+ const manager = this.manager;
396
+ const terms: number[] = [];
397
+ for (const innerVar of row.vars) {
398
+ const expr = this.id2Expr(defVars, index2Expr, innerVar.id);
399
+ const value = getNumeral(manager, expr);
400
+ if (value?.isZero()) continue;
401
+ const isInt = manager.sorts[expr] === SORT_INT;
402
+ terms.push(
403
+ value !== undefined
404
+ ? this.mkNumeral(innerVar.coeff.mul(value), isInt)
405
+ : innerVar.coeff.equals(Rational.one)
406
+ ? expr
407
+ : this.mkMul(innerVar.coeff, expr),
408
+ );
409
+ }
410
+ const mkInt = (value: bigint) => manager.mkNumeral(value);
411
+ if (row.type === T_MOD || row.type === T_DIV) {
412
+ const isMod = row.type === T_MOD;
413
+ if (terms.length === 0)
414
+ return mkInt(
415
+ isMod
416
+ ? getEuclideanMod(row.coeff.num, row.mod.num)
417
+ : getEuclideanDiv(row.coeff.num, row.mod.num),
418
+ );
419
+ if (!row.coeff.isZero()) terms.push(mkInt(row.coeff.num));
420
+ return this.mkBinary(isMod ? OP_MOD : OP_IDIV, this.mkAdd(terms), mkInt(row.mod.num));
421
+ }
422
+ if (row.type === T_DIVIDES) {
423
+ terms.push(mkInt(row.coeff.num));
424
+ return this.mkAdd(terms);
425
+ }
426
+ return this.mkAdd(terms);
427
+ }
428
+
429
+ private rows2Fmls(
430
+ defVars: Map<number, MboRow>,
431
+ rows: MboRow[],
432
+ index2Expr: number[],
433
+ fmls: RefVector,
434
+ ) {
435
+ const context = this.context;
436
+ const manager = this.manager;
437
+ for (const row of rows) {
438
+ if (row.vars.length === 0 || row.type === T_MOD || row.type === T_DIV) continue;
439
+ const single = row.vars[0];
440
+ if (
441
+ row.vars.length === 1 &&
442
+ single.coeff.isNegative() &&
443
+ (row.type === T_EQ || row.type === T_LE || row.type === T_LT)
444
+ ) {
445
+ let term = this.id2Expr(defVars, index2Expr, single.id);
446
+ const isInt = manager.sorts[term] === SORT_INT;
447
+ if (!single.coeff.equals(Rational.minusOne)) term = this.mkMul(single.coeff.neg(), term);
448
+ const bound = this.mkNumeral(row.coeff, isInt);
449
+ const op = row.type === T_LT ? OP_GT : row.type === T_LE ? OP_GE : OP_EQ;
450
+ fmls.push(context.pin(this.mkBinary(op, term, bound)));
451
+ continue;
452
+ }
453
+ const term = this.row2Expr(defVars, index2Expr, row);
454
+ const bound = this.mkNumeral(
455
+ row.coeff.neg(),
456
+ row.coeff.isInt() && manager.sorts[term] === SORT_INT,
457
+ );
458
+ if (row.type === T_DIVIDES) {
459
+ const remainder = this.mkBinary(OP_MOD, term, manager.mkNumeral(row.mod.num));
460
+ fmls.push(context.pin(manager.mkEq(remainder, manager.mkNumeral(0n))));
461
+ continue;
462
+ }
463
+ const op = row.type === T_LT ? OP_LT : row.type === T_LE ? OP_LE : OP_EQ;
464
+ fmls.push(context.pin(this.mkBinary(op, term, bound)));
465
+ }
466
+ }
467
+ }
@@ -0,0 +1,101 @@
1
+ import { OP_AND, OP_DISTINCT, OP_IMPLIES, OP_ITE, OP_OR } from "../ast";
2
+ import { isAppOf, mkNot } from "../ast-util";
3
+ import type { MbpContext } from "./mbp-plugin";
4
+ import type { TermGraph } from "./mbp-term-graph";
5
+
6
+ export class MbpBasicTg {
7
+ isUsingModel = false;
8
+
9
+ constructor(
10
+ private context: MbpContext,
11
+ private termGraph: TermGraph,
12
+ private seen: Set<number>,
13
+ ) {}
14
+
15
+ // Splits on the ite terms, whether or not they contain variables.
16
+ apply() {
17
+ const context = this.context;
18
+ const manager = context.manager;
19
+ const termGraph = this.termGraph;
20
+ const isUsingModel = this.isUsingModel;
21
+ const shouldSplit = (expr: number) => isUsingModel || termGraph.hasValInClass(expr);
22
+ const isTrue = (expr: number) =>
23
+ (isUsingModel || termGraph.hasValInClass(expr)) && context.isTrue(expr, true);
24
+ const isFalse = (expr: number) =>
25
+ (isUsingModel || termGraph.hasValInClass(expr)) && context.isFalse(expr, true);
26
+ let isProgress = false;
27
+ for (const term of termGraph.getTerms()) {
28
+ if (this.seen.has(term)) continue;
29
+ if (isAppOf(manager, term, OP_ITE) && shouldSplit(manager.getArg(term, 0))) {
30
+ const condition = manager.getArg(term, 0);
31
+ this.seen.add(term);
32
+ isProgress = true;
33
+ if (context.isTrue(condition, true)) {
34
+ termGraph.addLit(condition);
35
+ termGraph.addEq(term, manager.getArg(term, 1));
36
+ } else {
37
+ termGraph.addLit(context.pin(mkNot(manager, condition)));
38
+ termGraph.addEq(term, manager.getArg(term, 2));
39
+ }
40
+ }
41
+ if (isAppOf(manager, term, OP_IMPLIES)) {
42
+ const condition = manager.getArg(term, 0);
43
+ const conclusion = manager.getArg(term, 1);
44
+ if (isTrue(conclusion) || isFalse(condition)) {
45
+ this.seen.add(term);
46
+ isProgress = true;
47
+ if (isTrue(conclusion)) termGraph.addLit(conclusion);
48
+ else if (isFalse(condition)) termGraph.addLit(condition);
49
+ termGraph.addEq(term, manager.trueExpr);
50
+ } else if (isTrue(condition) && isFalse(conclusion)) {
51
+ this.seen.add(term);
52
+ isProgress = true;
53
+ termGraph.addEq(term, manager.falseExpr);
54
+ }
55
+ }
56
+ if (isAppOf(manager, term, OP_OR) || isAppOf(manager, term, OP_AND)) {
57
+ const isOr = isAppOf(manager, term, OP_OR);
58
+ const args = manager.getArgs(term);
59
+ const isTrueTerm = isOr ? args.some(isTrue) : args.every(isTrue);
60
+ const isFalseTerm = isOr ? args.every(isFalse) : args.some(isFalse);
61
+ if (isTrueTerm || isFalseTerm) {
62
+ this.seen.add(term);
63
+ isProgress = true;
64
+ termGraph.addEq(term, isTrueTerm ? manager.trueExpr : manager.falseExpr);
65
+ if (isFalseTerm) {
66
+ for (const arg of args) {
67
+ if (!isFalse(arg)) continue;
68
+ termGraph.addLit(context.pin(mkNot(manager, arg)));
69
+ if (!isOr) break;
70
+ }
71
+ } else {
72
+ for (const arg of args) {
73
+ if (!isTrue(arg)) continue;
74
+ termGraph.addLit(arg);
75
+ if (isOr) break;
76
+ }
77
+ }
78
+ }
79
+ }
80
+ if (isUsingModel && isAppOf(manager, term, OP_DISTINCT)) {
81
+ this.seen.add(term);
82
+ isProgress = true;
83
+ let isEq = false;
84
+ const args = manager.getArgs(term);
85
+ for (const first of args) {
86
+ for (const second of args) {
87
+ if (first === second) continue;
88
+ if (context.isTrue(context.pin(manager.mkEq(first, second)), true)) {
89
+ termGraph.addEq(first, second);
90
+ isEq = true;
91
+ break;
92
+ }
93
+ termGraph.addDeq(first, second);
94
+ }
95
+ }
96
+ termGraph.addEq(term, isEq ? manager.falseExpr : manager.trueExpr);
97
+ }
98
+ }
99
+ return isProgress;
100
+ }
101
+ }