tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,52 @@
1
+ import { SmtUnsupportedError } from "../../../../errors";
2
+ import { L_FALSE } from "../lbool";
3
+ import { ProtoModel } from "../proto-model";
4
+ import type { DatalogContext, Engine, ModelConverter } from "./dl-context";
5
+ import { MkSlice } from "./dl-mk-slice";
6
+ import { RuleSet } from "./dl-rule-set";
7
+ import { applyDefaultTransformation, transformRules } from "./dl-rule-transformer";
8
+ import { SpacerContext } from "./spacer-context";
9
+
10
+ // Each query gets a fresh spacer context, where Z3 keeps the lemmas of a previous query whose
11
+ // rules subsume the new ones.
12
+ export class SpacerDlInterface implements Engine {
13
+ private spacer: SpacerContext | undefined;
14
+ private modelConverters: readonly ModelConverter[] = [];
15
+
16
+ constructor(private context: DatalogContext) {}
17
+
18
+ query(query: number) {
19
+ const context = this.context;
20
+ const params = context.params;
21
+ context.ensureOpened();
22
+ const oldRules = RuleSet.copy(context.getRules());
23
+ context.ruleManager.mkQuery(query, context.getRules());
24
+ applyDefaultTransformation(context);
25
+ if (params.getBool("xform.slice", true)) transformRules(context, [new MkSlice(context)]);
26
+ if (params.getUint("xform.unfold_rules", 0) > 0)
27
+ throw new SmtUnsupportedError("fp.xform.unfold_rules");
28
+ const rules = context.getRules();
29
+ if (rules.outputPredicates.size === 0) return L_FALSE;
30
+ const queryPred = rules.getOutputPredicate();
31
+ const spacerRules = new RuleSet(context);
32
+ spacerRules.replaceRules(rules);
33
+ spacerRules.close();
34
+ context.reopen();
35
+ context.replaceRules(oldRules);
36
+ context.manager.limit.checkpoint();
37
+ const spacer = new SpacerContext(context);
38
+ this.spacer = spacer;
39
+ this.modelConverters = context.modelConverters ?? [];
40
+ spacer.setQuery(queryPred);
41
+ spacer.updateRules(spacerRules);
42
+ if (spacerRules.rules.length === 0) return L_FALSE;
43
+ return spacer.solve(params.getUint("spacer.min_level", 0));
44
+ }
45
+
46
+ getModel() {
47
+ return this.modelConverters.reduceRight(
48
+ (model, convert) => convert(model),
49
+ this.spacer?.getModel() ?? new ProtoModel(this.context.manager),
50
+ );
51
+ }
52
+ }
@@ -0,0 +1,241 @@
1
+ import { MBQI_MAX_ITERATIONS } from "../context";
2
+ import { SmtUnsupportedError } from "../../../../errors";
3
+ import {
4
+ type AstManager,
5
+ FAMILY_ARRAY,
6
+ FAMILY_DATATYPE,
7
+ FAMILY_USER,
8
+ isArithSort,
9
+ KIND_APP,
10
+ OP_EQ,
11
+ OP_GE,
12
+ OP_LE,
13
+ OP_MOD,
14
+ SORT_BOOL,
15
+ } from "../ast";
16
+ import { L_FALSE } from "../lbool";
17
+ import { SmtKernel } from "../smt-kernel";
18
+ import type { Lemma, SpacerContext } from "./spacer-context";
19
+ import { mkAndOf, pin } from "./spacer-util";
20
+
21
+ export type LemmaGeneralizer = (lemma: Lemma) => void;
22
+
23
+ const getSortFamilyOf = (manager: AstManager, expr: number) =>
24
+ manager.getSortFamily(manager.sorts[expr]);
25
+
26
+ const expandLiterals = (manager: AstManager, conjs: number[]) => {
27
+ for (let index = 0; index < conjs.length; index++) {
28
+ const expr = conjs[index];
29
+ if (manager.getOp(expr) !== OP_EQ) continue;
30
+ const left = manager.getArg(expr, 0);
31
+ const right = manager.getArg(expr, 1);
32
+ if (
33
+ isArithSort(manager.sorts[left]) &&
34
+ manager.getOp(left) !== OP_MOD &&
35
+ manager.getOp(right) !== OP_MOD
36
+ ) {
37
+ conjs[index] = pin(manager, manager.mkApp(OP_LE, [left, right], SORT_BOOL));
38
+ const ge = pin(manager, manager.mkApp(OP_GE, [left, right], SORT_BOOL));
39
+ if (index + 1 === conjs.length) conjs.push(ge);
40
+ else {
41
+ conjs.push(conjs[index + 1]);
42
+ conjs[index + 1] = ge;
43
+ }
44
+ index++;
45
+ } else if (
46
+ getSortFamilyOf(manager, left) === FAMILY_DATATYPE ||
47
+ manager.isBvSort(manager.sorts[left])
48
+ )
49
+ throw new SmtUnsupportedError("weakening datatype and bit-vector literals of spacer lemmas");
50
+ }
51
+ };
52
+
53
+ const mkInductiveGeneralizer = (context: SpacerContext): LemmaGeneralizer => {
54
+ const manager = context.manager;
55
+ const trueExpr = manager.trueExpr;
56
+ return (lemma) => {
57
+ if (lemma.getCube().length === 0) return;
58
+ const pt = (lemma.pob as NonNullable<Lemma["pob"]>).pt;
59
+ let level = lemma.level;
60
+ const cube = [...lemma.getCube()];
61
+ let core: number[] = [];
62
+
63
+ const loadCubeToCore = () => {
64
+ core = cube.filter((lit) => lit !== trueExpr);
65
+ };
66
+
67
+ const isCubeInductive = () => {
68
+ loadCubeToCore();
69
+ if (core.length === 0) return false;
70
+ const usedLevel = pt.checkInductive(level, core);
71
+ if (usedLevel === undefined) return false;
72
+ level = Math.max(level, usedLevel);
73
+ return true;
74
+ };
75
+
76
+ const updateCubeByCore = (from: number) => {
77
+ const marked = new Set(core);
78
+ let success = 0;
79
+ for (let index = from; index < cube.length; index++) {
80
+ if (cube[index] === trueExpr || marked.has(cube[index])) continue;
81
+ cube[index] = trueExpr;
82
+ success++;
83
+ }
84
+ return success;
85
+ };
86
+
87
+ const generalizeCore = (from: number) => {
88
+ if (core.length === 0) return 0;
89
+ const usedLevel = pt.checkInductive(level, core);
90
+ if (usedLevel === undefined) return 0;
91
+ const success = updateCubeByCore(from);
92
+ level = Math.max(level, usedLevel);
93
+ return success;
94
+ };
95
+
96
+ const generalize1 = (litIndex: number) => {
97
+ core = cube.filter((lit, index) => lit !== trueExpr && index !== litIndex);
98
+ return generalizeCore(litIndex);
99
+ };
100
+
101
+ const generalizeRange = (from: number, to: number) => {
102
+ let success = 0;
103
+ for (let index = from; index < to; index++) success += generalize1(index);
104
+ return success;
105
+ };
106
+
107
+ const weaken1 = (litIndex: number) => {
108
+ if (cube[litIndex] === trueExpr) return 0;
109
+ let success = 0;
110
+ const cubeSize = cube.length;
111
+ const saved = cube[litIndex];
112
+ cube[litIndex] = trueExpr;
113
+ const weakening = [saved];
114
+ expandLiterals(manager, weakening);
115
+ if (weakening[0] !== saved) {
116
+ cube.push(...weakening);
117
+ success +=
118
+ cube.length - cubeSize >= 2
119
+ ? generalizeRange(cubeSize, cube.length)
120
+ : isCubeInductive()
121
+ ? 1
122
+ : 0;
123
+ }
124
+ if (success === 0) {
125
+ cube[litIndex] = saved;
126
+ cube.length = cubeSize;
127
+ }
128
+ return success;
129
+ };
130
+
131
+ const weakenRange = (from: number, to: number) => {
132
+ let success = 0;
133
+ for (let index = from; index < to; index++) success += weaken1(index);
134
+ return success;
135
+ };
136
+
137
+ let numGens = generalizeRange(0, cube.length);
138
+ const cubeSize = cube.length;
139
+ numGens += weakenRange(0, cubeSize);
140
+ if (cubeSize < cube.length) numGens += weakenRange(cubeSize, cube.length);
141
+ if (numGens === 0) return;
142
+ lemma.updateCube(
143
+ lemma.pob,
144
+ cube.filter((lit) => lit !== trueExpr),
145
+ );
146
+ lemma.setLevel(level);
147
+ };
148
+ };
149
+
150
+ const isArrayEq = (manager: AstManager, expr: number) =>
151
+ manager.getOp(expr) === OP_EQ &&
152
+ manager
153
+ .getArgs(expr)
154
+ .every(
155
+ (arg) =>
156
+ manager.kinds[arg] === KIND_APP &&
157
+ manager.getFamily(arg) === FAMILY_USER &&
158
+ manager.getNumArgs(arg) === 0 &&
159
+ getSortFamilyOf(manager, arg) === FAMILY_ARRAY,
160
+ );
161
+
162
+ const collectArraySymbols = (manager: AstManager, root: number) => {
163
+ const symbols = new Set<number>();
164
+ let arraySort = -1;
165
+ const visited = new Set<number>();
166
+ const todo = [root];
167
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
168
+ if (visited.has(expr) || manager.kinds[expr] !== KIND_APP) continue;
169
+ visited.add(expr);
170
+ manager.pushArgs(expr, todo);
171
+ if (manager.getFamily(expr) !== FAMILY_USER || getSortFamilyOf(manager, expr) !== FAMILY_ARRAY)
172
+ continue;
173
+ if (arraySort !== -1 && arraySort !== manager.sorts[expr]) continue;
174
+ arraySort = manager.sorts[expr];
175
+ symbols.add(manager.decls[expr]);
176
+ }
177
+ return symbols;
178
+ };
179
+
180
+ const mkArrayEqGeneralizer =
181
+ (context: SpacerContext): LemmaGeneralizer =>
182
+ (lemma) => {
183
+ const manager = context.manager;
184
+ const core = [...lemma.getCube()];
185
+ const symbols = [...collectArraySymbols(manager, mkAndOf(manager, core))];
186
+ if (symbols.length <= 1 || symbols.length > 8) return;
187
+ const eqs: number[] = [];
188
+ for (let first = 0; first < symbols.length; first++)
189
+ for (let second = first + 1; second < symbols.length; second++) {
190
+ const mkConst = (decl: number) => manager.mkApp(decl, [], manager.funcDecls[decl].range);
191
+ eqs.push(pin(manager, manager.mkEq(mkConst(symbols[first]), mkConst(symbols[second]))));
192
+ }
193
+ const solver = new SmtKernel(manager, {
194
+ isMbqi: true,
195
+ isFindingMacros: false,
196
+ mbqiMaxIterations: MBQI_MAX_ITERATIONS,
197
+ });
198
+ const lits = [...core];
199
+ let isDirty = false;
200
+ for (let index = 0; index < core.length; index++) {
201
+ if (manager.isNot(lits[index]) && isArrayEq(manager, manager.getArg(lits[index], 0)))
202
+ continue;
203
+ solver.push();
204
+ solver.assertExpr(lits[index]);
205
+ for (const eq of eqs) {
206
+ solver.push();
207
+ solver.assertExpr(eq);
208
+ const result = solver.check([]);
209
+ solver.pop(1);
210
+ if (result === L_FALSE) {
211
+ lits[index] = pin(manager, manager.mkNot(eq));
212
+ isDirty = true;
213
+ break;
214
+ }
215
+ }
216
+ solver.pop(1);
217
+ }
218
+ if (!isDirty) return;
219
+ const pob = lemma.pob as NonNullable<Lemma["pob"]>;
220
+ const usedLevel = pob.pt.checkInductive(lemma.level, lits);
221
+ if (usedLevel === undefined) return;
222
+ lemma.updateCube(pob, lits);
223
+ lemma.setLevel(usedLevel);
224
+ };
225
+
226
+ export const mkLemmaGeneralizers = (context: SpacerContext) => {
227
+ const params = context.params;
228
+ if (
229
+ params.getBool("spacer.use_euf_gen", false) ||
230
+ params.getBool("spacer.use_lim_num_gen", false)
231
+ )
232
+ throw new SmtUnsupportedError("the euf and limit-number spacer generalizers");
233
+ if (params.getBool("spacer.expand_bnd", false) || params.getBool("spacer.validate_lemmas", false))
234
+ throw new SmtUnsupportedError("spacer.expand_bnd and spacer.validate_lemmas");
235
+ const generalizers: LemmaGeneralizer[] = [];
236
+ if (params.getBool("spacer.use_inductive_generalizer", true))
237
+ generalizers.push(mkInductiveGeneralizer(context));
238
+ if (params.getBool("spacer.use_array_eq_generalizer", true))
239
+ generalizers.push(mkArrayEqGeneralizer(context));
240
+ return generalizers;
241
+ };
@@ -0,0 +1,127 @@
1
+ import { type AstManager, getSymbolName, KIND_APP } from "../ast";
2
+ import { RewriterTpl } from "../rewriter-tpl";
3
+ import { pin } from "./spacer-util";
4
+
5
+ interface MuxEntry {
6
+ main: number;
7
+ variants: number[];
8
+ }
9
+
10
+ class ShiftRewriter extends RewriterTpl {
11
+ constructor(
12
+ manager: AstManager,
13
+ private shift: (decl: number) => number | undefined,
14
+ ) {
15
+ super(manager);
16
+ }
17
+
18
+ getSubst(expr: number) {
19
+ const manager = this.manager;
20
+ if (manager.kinds[expr] !== KIND_APP) return undefined;
21
+ const target = this.shift(manager.decls[expr]);
22
+ if (target === undefined) return undefined;
23
+ return pin(manager, manager.mkApp(target, manager.getArgs(expr), manager.sorts[expr]));
24
+ }
25
+ }
26
+
27
+ // The n (index 0) and o (index i + 1) variants of the predicate signatures and spacer's own
28
+ // constants. Z3's manager hash-conses the declarations by name, so the variants are kept here.
29
+ export class SpacerManager {
30
+ private decls = new Map<string, number>();
31
+ private entries = new Map<number, MuxEntry>();
32
+ private muxes = new Map<number, { entry: MuxEntry; index: number }>();
33
+
34
+ constructor(readonly manager: AstManager) {}
35
+
36
+ mkFuncDecl(name: string, domain: number[], range: number) {
37
+ const key = `${name}|${domain.join(",")}|${range}`;
38
+ const existing = this.decls.get(key);
39
+ if (existing !== undefined) return existing;
40
+ const decl = this.manager.mkFuncDecl(name, domain, range);
41
+ this.manager.incDeclRef(decl);
42
+ this.decls.set(key, decl);
43
+ return decl;
44
+ }
45
+
46
+ mkConst(name: string, sort: number) {
47
+ return pin(this.manager, this.manager.mkApp(this.mkFuncDecl(name, [], sort), [], sort));
48
+ }
49
+
50
+ constOf(decl: number) {
51
+ return pin(this.manager, this.manager.mkApp(decl, [], this.manager.funcDecls[decl].range));
52
+ }
53
+
54
+ private mkVariant(decl: number, index: number) {
55
+ const funcDecl = this.manager.funcDecls[decl];
56
+ const name = `${getSymbolName(funcDecl.name)}_${index === 0 ? "n" : String(index - 1)}`;
57
+ return this.mkFuncDecl(name, funcDecl.domain, funcDecl.range);
58
+ }
59
+
60
+ private ensureCapacity(entry: MuxEntry, size: number) {
61
+ while (entry.variants.length < size) {
62
+ const index = entry.variants.length;
63
+ const variant = this.mkVariant(entry.main, index);
64
+ entry.variants.push(variant);
65
+ this.muxes.set(variant, { entry, index });
66
+ }
67
+ }
68
+
69
+ private findByDecl(decl: number, index: number) {
70
+ let entry = this.entries.get(decl);
71
+ if (entry === undefined) {
72
+ entry = { main: decl, variants: [] };
73
+ this.entries.set(decl, entry);
74
+ this.ensureCapacity(entry, 2);
75
+ }
76
+ this.ensureCapacity(entry, index + 1);
77
+ return entry.variants[index];
78
+ }
79
+
80
+ getOPred(decl: number, index: number) {
81
+ return this.findByDecl(decl, index + 1);
82
+ }
83
+
84
+ getNPred(decl: number) {
85
+ return this.findByDecl(decl, 0);
86
+ }
87
+
88
+ private shiftDecl(decl: number, target: number) {
89
+ const mux = this.muxes.get(decl);
90
+ if (mux === undefined) return undefined;
91
+ this.ensureCapacity(mux.entry, target + 1);
92
+ return mux.entry.variants[target];
93
+ }
94
+
95
+ o2n(decl: number) {
96
+ return this.shiftDecl(decl, 0) ?? decl;
97
+ }
98
+
99
+ o2o(decl: number, targetIndex: number) {
100
+ return this.shiftDecl(decl, targetIndex + 1) ?? decl;
101
+ }
102
+
103
+ n2o(decl: number, oIndex: number) {
104
+ return this.shiftDecl(decl, oIndex + 1) ?? decl;
105
+ }
106
+
107
+ private shiftExpr(expr: number, sourceIndex: number, targetIndex: number) {
108
+ if (sourceIndex === targetIndex) return expr;
109
+ const rewriter = new ShiftRewriter(this.manager, (decl) => {
110
+ const mux = this.muxes.get(decl);
111
+ return mux === undefined || mux.index !== sourceIndex
112
+ ? undefined
113
+ : this.shiftDecl(decl, targetIndex);
114
+ });
115
+ const result = rewriter.rewrite(pin(this.manager, expr));
116
+ rewriter.release();
117
+ return result;
118
+ }
119
+
120
+ formulaO2n(expr: number, oIndex: number) {
121
+ return this.shiftExpr(expr, oIndex + 1, 0);
122
+ }
123
+
124
+ formulaN2o(expr: number, oIndex: number) {
125
+ return this.shiftExpr(expr, 0, oIndex + 1);
126
+ }
127
+ }
@@ -0,0 +1,219 @@
1
+ import { SmtUnsupportedError } from "../../../../errors";
2
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
3
+ import { L_GAVE_UP, type Pob, type SpacerContext } from "./spacer-context";
4
+ import { INFTY_LEVEL } from "./spacer-util";
5
+
6
+ class ModelNode {
7
+ next: ModelNode | undefined;
8
+ prev: ModelNode | undefined;
9
+ readonly origLevel: number;
10
+ depth = 0;
11
+ isClosed = false;
12
+ children: ModelNode[] = [];
13
+
14
+ constructor(
15
+ readonly parent: ModelNode | undefined,
16
+ readonly pob: Pob,
17
+ ) {
18
+ this.origLevel = pob.level;
19
+ parent?.addChild(this);
20
+ }
21
+
22
+ private addChild(kid: ModelNode) {
23
+ this.children.push(kid);
24
+ kid.depth = this.depth + 1;
25
+ if (this.isClosed) this.setOpen();
26
+ }
27
+
28
+ isOneClosed() {
29
+ if (this.isClosed) return true;
30
+ if (this.children.length === 0) return false;
31
+ return this.children.every((kid) => kid.isClosed);
32
+ }
33
+
34
+ checkPreClosed() {
35
+ if (this.children.some((kid) => !kid.isClosed)) return;
36
+ this.isClosed = true;
37
+ for (let parent = this.parent; parent?.isOneClosed(); parent = parent.parent)
38
+ parent.isClosed = true;
39
+ }
40
+
41
+ setOpen() {
42
+ this.isClosed = false;
43
+ for (let parent = this.parent; parent?.isClosed; parent = parent.parent)
44
+ parent.isClosed = false;
45
+ }
46
+
47
+ isInQueue() {
48
+ return this.next !== undefined && this.prev !== undefined;
49
+ }
50
+
51
+ insertAfter(node: ModelNode) {
52
+ if (this === node) {
53
+ this.next = node;
54
+ this.prev = node;
55
+ return;
56
+ }
57
+ const next = this.next as ModelNode;
58
+ node.next = next;
59
+ next.prev = node;
60
+ this.next = node;
61
+ node.prev = this;
62
+ }
63
+ }
64
+
65
+ class ModelSearch {
66
+ root: ModelNode | undefined;
67
+ private head: ModelNode | undefined;
68
+ private cache: Map<number, ModelNode[]>[] = [];
69
+
70
+ constructor(private isBfs: boolean) {}
71
+
72
+ private detach(node: ModelNode) {
73
+ if (node === node.next) this.head = undefined;
74
+ else {
75
+ (node.next as ModelNode).prev = node.prev;
76
+ (node.prev as ModelNode).next = node.next;
77
+ if (node === this.head) this.head = node.next;
78
+ }
79
+ node.prev = undefined;
80
+ node.next = undefined;
81
+ }
82
+
83
+ private getCache(node: ModelNode) {
84
+ while (this.cache.length <= node.origLevel) this.cache.push(new Map());
85
+ return this.cache[node.origLevel];
86
+ }
87
+
88
+ reset() {
89
+ if (this.root !== undefined) {
90
+ this.eraseChildren(this.root, false);
91
+ this.removeNode(this.root, false);
92
+ this.root = undefined;
93
+ }
94
+ this.cache = [];
95
+ }
96
+
97
+ popFront() {
98
+ const result = this.head;
99
+ if (result !== undefined) this.detach(result);
100
+ return result;
101
+ }
102
+
103
+ addLeaf(node: ModelNode) {
104
+ const cache = this.getCache(node);
105
+ let nodes = cache.get(node.pob.post);
106
+ if (nodes === undefined) {
107
+ nodes = [];
108
+ cache.set(node.pob.post, nodes);
109
+ }
110
+ if (nodes.includes(node)) return;
111
+ nodes.push(node);
112
+ if (nodes.length === 1) this.enqueueLeaf(node);
113
+ else node.isClosed = true;
114
+ }
115
+
116
+ enqueueLeaf(node: ModelNode) {
117
+ if (this.head === undefined) {
118
+ this.head = node;
119
+ node.insertAfter(node);
120
+ } else if (this.isBfs) this.head.insertAfter(node);
121
+ else (this.head.next as ModelNode).insertAfter(node);
122
+ }
123
+
124
+ setRoot(root: ModelNode) {
125
+ this.reset();
126
+ this.root = root;
127
+ this.addLeaf(root);
128
+ }
129
+
130
+ backtrackLevel(node: ModelNode) {
131
+ const parent = node.parent;
132
+ if (parent === undefined) return;
133
+ this.eraseChildren(parent, true);
134
+ this.enqueueLeaf(parent);
135
+ }
136
+
137
+ private eraseChildren(node: ModelNode, isBacktracking: boolean) {
138
+ const todo = [...node.children];
139
+ if (node.isInQueue()) this.detach(node);
140
+ node.children = [];
141
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
142
+ todo.push(...current.children);
143
+ this.removeNode(current, isBacktracking);
144
+ }
145
+ }
146
+
147
+ private removeNode(node: ModelNode, isBacktracking: boolean) {
148
+ const cache = this.getCache(node);
149
+ const nodes = cache.get(node.pob.post) as ModelNode[];
150
+ nodes.splice(nodes.indexOf(node), 1);
151
+ if (node.isInQueue()) this.detach(node);
152
+ if (nodes.length > 0 && isBacktracking && nodes[0].children.length === 0 && nodes[0].isClosed) {
153
+ nodes[0].setOpen();
154
+ this.enqueueLeaf(nodes[0]);
155
+ }
156
+ if (nodes.length === 0) cache.delete(node.pob.post);
157
+ }
158
+ }
159
+
160
+ // Deviation from Z3: gpdr_check_reachability closes only the node that reaches its premises
161
+ // (set_closed), so the root of a reachable query stays open and Z3 answers unreachable
162
+ // (spacer_pdr.cpp). The parents that all their children close are closed here, up to the root.
163
+ const closeNode = (node: ModelNode, root: ModelNode) => {
164
+ node.isClosed = true;
165
+ for (let parent = node.parent; parent?.isOneClosed(); parent = parent.parent)
166
+ parent.isClosed = true;
167
+ return root.isClosed;
168
+ };
169
+
170
+ const checkReachability = (context: SpacerContext, level: number, search: ModelSearch) => {
171
+ const manager = context.manager;
172
+ const query = context.query as NonNullable<SpacerContext["query"]>;
173
+ const rootPob = query.mkPob(undefined, level, 0, manager.trueExpr);
174
+ const root = new ModelNode(undefined, rootPob);
175
+ search.setRoot(root);
176
+ const newPobs: Pob[] = [];
177
+ for (let node = search.popFront(); node !== undefined; node = search.popFront()) {
178
+ newPobs.length = 0;
179
+ manager.limit.checkpoint();
180
+ if (node.pob.pt.isMustReachable(node.pob.post) !== undefined) {
181
+ if (closeNode(node, root)) return L_TRUE;
182
+ continue;
183
+ }
184
+ switch (context.expandPob(node.pob, newPobs)) {
185
+ case L_TRUE:
186
+ if (closeNode(node, root)) return L_TRUE;
187
+ break;
188
+ case L_FALSE:
189
+ search.backtrackLevel(node);
190
+ if (node === root) return L_FALSE;
191
+ break;
192
+ case L_GAVE_UP:
193
+ return L_UNDEF;
194
+ default:
195
+ for (const pob of newPobs) if (pob !== node.pob) search.addLeaf(new ModelNode(node, pob));
196
+ node.checkPreClosed();
197
+ }
198
+ }
199
+ return root.isClosed ? L_TRUE : L_FALSE;
200
+ };
201
+
202
+ export const gpdrSolveCore = (context: SpacerContext) => {
203
+ context.query = context.rels.get(context.queryPred);
204
+ if (context.query === undefined) return L_FALSE;
205
+ const search = new ModelSearch(context.isPdrBfs);
206
+ for (let level = 0; level < context.maxLevel; level++) {
207
+ context.manager.limit.checkpoint();
208
+ context.expandedLevel = INFTY_LEVEL;
209
+ const reachable = checkReachability(context, level, search);
210
+ if (reachable !== L_FALSE) return reachable;
211
+ if (level > 0 && context.propagate(context.expandedLevel, level)) return L_FALSE;
212
+ }
213
+ context.datalogContext.isBounded = true;
214
+ return L_UNDEF;
215
+ };
216
+
217
+ export const gpdrCreateSplitChildren = () => {
218
+ throw new SmtUnsupportedError("gpdr on rules with several predecessors");
219
+ };