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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,533 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ FAMILY_BASIC,
5
+ KIND_APP,
6
+ OP_ADD,
7
+ OP_AND,
8
+ OP_BADD,
9
+ OP_BMUL,
10
+ OP_BNEG,
11
+ OP_BSMUL_NO_OVFL,
12
+ OP_BSMUL_NO_UDFL,
13
+ OP_BSUB,
14
+ OP_DIV,
15
+ OP_EQ,
16
+ OP_EXTRACT,
17
+ OP_GE,
18
+ OP_GT,
19
+ OP_IMPLIES,
20
+ OP_ITE,
21
+ OP_LE,
22
+ OP_LT,
23
+ OP_MUL,
24
+ OP_NOT,
25
+ OP_POWER,
26
+ OP_SIGN_EXT,
27
+ OP_SLEQ,
28
+ OP_SUB,
29
+ OP_TO_REAL,
30
+ OP_UBV2INT,
31
+ OP_UMINUS,
32
+ SORT_BOOL,
33
+ SORT_REAL,
34
+ } from "./ast";
35
+ import { mkBvApp } from "./bv-decl-plugin";
36
+ import { getNumBits } from "./bv2int-rewriter";
37
+ import { getGcd, getLcm, Rational } from "./rational";
38
+ import { RefVector } from "./ref-vector";
39
+ import { RewriterTpl } from "./rewriter-tpl";
40
+
41
+ interface Bv2Real {
42
+ s: number;
43
+ t: number;
44
+ divisor: bigint;
45
+ root: bigint;
46
+ }
47
+
48
+ export class Bv2RealUtil {
49
+ readonly decls: number[] = [];
50
+ readonly sideConditions: RefVector;
51
+ readonly posLt: number;
52
+ readonly posLe: number;
53
+ private sig2decl = new Map<string, number>();
54
+ private decl2sig = new Map<number, { divisor: bigint; root: bigint }>();
55
+ readonly maxDivisor: bigint;
56
+
57
+ constructor(
58
+ private manager: AstManager,
59
+ readonly defaultRoot: bigint,
60
+ readonly defaultDivisor: bigint,
61
+ readonly maxNumBits: number,
62
+ ) {
63
+ this.sideConditions = new RefVector(manager);
64
+ this.maxDivisor = 2n * defaultDivisor;
65
+ this.posLt = manager.mkFreshFuncDecl("<", [SORT_REAL, SORT_REAL], SORT_BOOL);
66
+ this.posLe = manager.mkFreshFuncDecl("<=", [SORT_REAL, SORT_REAL], SORT_BOOL);
67
+ this.addAuxDecl(this.posLt);
68
+ this.addAuxDecl(this.posLe);
69
+ }
70
+
71
+ addAuxDecl(decl: number) {
72
+ this.manager.incDeclRef(decl);
73
+ this.decls.push(decl);
74
+ }
75
+
76
+ getBv2Real(expr: number): Bv2Real | undefined {
77
+ const manager = this.manager;
78
+ if (manager.kinds[expr] !== KIND_APP) return undefined;
79
+ const sig = this.decl2sig.get(manager.decls[expr]);
80
+ if (sig === undefined) return undefined;
81
+ return {
82
+ s: manager.getArg(expr, 0),
83
+ t: manager.getArg(expr, 1),
84
+ divisor: sig.divisor,
85
+ root: sig.root,
86
+ };
87
+ }
88
+
89
+ // bv2real_util::is_bv2real(expr*, expr_ref&, expr_ref&, rational&, rational&): also a rational
90
+ // numeral that is not an integer.
91
+ getBv2RealOrNumeral(expr: number): Bv2Real | undefined {
92
+ const manager = this.manager;
93
+ const found = this.getBv2Real(expr);
94
+ if (found !== undefined) return found;
95
+ if (!manager.isNumeral(expr) || manager.sorts[expr] !== SORT_REAL) return undefined;
96
+ const value = manager.getRationalValue(expr);
97
+ return {
98
+ s: this.mkSbv(value.num),
99
+ t: this.mkSbv(0n),
100
+ divisor: value.den,
101
+ root: this.defaultRoot,
102
+ };
103
+ }
104
+
105
+ containsBv2Real(expr: number) {
106
+ const manager = this.manager;
107
+ const visited = new Set<number>();
108
+ const todo = [expr];
109
+ for (let curr = todo.pop(); curr !== undefined; curr = todo.pop()) {
110
+ if (visited.has(curr) || manager.kinds[curr] !== KIND_APP) continue;
111
+ visited.add(curr);
112
+ if (this.decl2sig.has(manager.decls[curr])) return true;
113
+ manager.pushArgs(curr, todo);
114
+ }
115
+ return false;
116
+ }
117
+
118
+ mkBv2Real(s: number, t: number, divisor: bigint, root: bigint) {
119
+ const aligned = this.alignDivisor(s, t, divisor);
120
+ return aligned === undefined
121
+ ? undefined
122
+ : this.mkBv2RealC(aligned.s, aligned.t, aligned.divisor, root);
123
+ }
124
+
125
+ mkBv2RealC(s: number, t: number, divisor: bigint, root: bigint) {
126
+ const manager = this.manager;
127
+ const sSort = manager.sorts[s];
128
+ const tSort = manager.sorts[t];
129
+ const key = `${manager.getBvSize(sSort)}:${manager.getBvSize(tSort)}:${divisor}:${root}`;
130
+ let decl = this.sig2decl.get(key);
131
+ if (decl === undefined) {
132
+ decl = manager.mkFreshFuncDecl("bv2real", [sSort, tSort], SORT_REAL);
133
+ this.addAuxDecl(decl);
134
+ this.sig2decl.set(key, decl);
135
+ this.decl2sig.set(decl, { divisor, root });
136
+ }
137
+ return manager.mkApp(decl, [s, t], SORT_REAL);
138
+ }
139
+
140
+ mkBv2RealReduced(s: number, t: number, divisor: bigint, root: bigint) {
141
+ const manager = this.manager;
142
+ const real = (value: Rational) => manager.mkNumeralOfSort(value, SORT_REAL);
143
+ const mkDiv = (expr: number) =>
144
+ manager.mkApp(OP_DIV, [expr, real(Rational.of(divisor))], SORT_REAL);
145
+ const sReal = this.mkSbv2Real(s);
146
+ const tReal = this.mkSbv2Real(t);
147
+ const sDiv = mkDiv(sReal);
148
+ const tDiv = mkDiv(tReal);
149
+ const sqrt = manager.mkApp(
150
+ OP_POWER,
151
+ [real(Rational.of(root)), real(Rational.of(1n, 2n))],
152
+ SORT_REAL,
153
+ );
154
+ return manager.mkApp(OP_ADD, [sDiv, manager.mkApp(OP_MUL, [tDiv, sqrt], SORT_REAL)], SORT_REAL);
155
+ }
156
+
157
+ private mkSbv2Real(word: number) {
158
+ const manager = this.manager;
159
+ const size = manager.getBvSize(manager.sorts[word]);
160
+ const value = manager.mkApp(OP_TO_REAL, [mkBvApp(manager, OP_UBV2INT, [word])], SORT_REAL);
161
+ const condition = mkBvApp(manager, OP_SLEQ, [manager.mkBvNumeral(0n, size), word]);
162
+ const shifted = manager.mkApp(
163
+ OP_SUB,
164
+ [value, manager.mkNumeralOfSort(Rational.of(2n ** BigInt(size)), SORT_REAL)],
165
+ SORT_REAL,
166
+ );
167
+ return manager.mkApp(OP_ITE, [condition, value, shifted], SORT_REAL);
168
+ }
169
+
170
+ mkBvMulByConstant(value: bigint, word: number) {
171
+ return value === 1n ? word : this.mkBvMul(this.mkSbv(value), word);
172
+ }
173
+
174
+ alignDivisors(first: Bv2Real, second: Bv2Real) {
175
+ if (first.divisor === second.divisor) return;
176
+ const gcd = getGcd(first.divisor, second.divisor);
177
+ const lcm = getLcm(first.divisor, second.divisor);
178
+ const firstFactor = second.divisor / gcd;
179
+ const secondFactor = first.divisor / gcd;
180
+ first.s = this.mkBvMulByConstant(firstFactor, first.s);
181
+ first.t = this.mkBvMulByConstant(firstFactor, first.t);
182
+ second.s = this.mkBvMulByConstant(secondFactor, second.s);
183
+ second.t = this.mkBvMulByConstant(secondFactor, second.t);
184
+ first.divisor = lcm;
185
+ second.divisor = lcm;
186
+ }
187
+
188
+ mkBvMul(s: number, t: number) {
189
+ const manager = this.manager;
190
+ if (this.isZero(s)) return s;
191
+ if (this.isZero(t)) return t;
192
+ let [s1, t1] = this.alignSizes(s, t);
193
+ const size = manager.getBvSize(manager.sorts[t1]);
194
+ const maxBits = this.maxNumBits;
195
+ if (size < maxBits) {
196
+ const extension = 2 * size > maxBits ? maxBits - size : size;
197
+ s1 = this.mkExtend(extension, s1);
198
+ t1 = this.mkExtend(extension, t1);
199
+ }
200
+ if (2 * size > maxBits) {
201
+ this.sideConditions.push(mkBvApp(manager, OP_BSMUL_NO_OVFL, [s1, t1]));
202
+ this.sideConditions.push(mkBvApp(manager, OP_BSMUL_NO_UDFL, [s1, t1]));
203
+ }
204
+ return mkBvApp(manager, OP_BMUL, [s1, t1]);
205
+ }
206
+
207
+ isZero(expr: number) {
208
+ const manager = this.manager;
209
+ return manager.isBvNumeral(expr) && manager.getBvNumeralValue(expr) === 0n;
210
+ }
211
+
212
+ mkBvAdd(s: number, t: number) {
213
+ if (this.isZero(s)) return t;
214
+ if (this.isZero(t)) return s;
215
+ const [s1, t1] = this.alignSizes(s, t);
216
+ return mkBvApp(this.manager, OP_BADD, [this.mkExtend(1, s1), this.mkExtend(1, t1)]);
217
+ }
218
+
219
+ alignSizes(s: number, t: number): [number, number] {
220
+ const manager = this.manager;
221
+ const sSize = manager.getBvSize(manager.sorts[s]);
222
+ const tSize = manager.getBvSize(manager.sorts[t]);
223
+ if (sSize > tSize) return [s, this.mkExtend(sSize - tSize, t)];
224
+ if (sSize < tSize) return [this.mkExtend(tSize - sSize, s), t];
225
+ return [s, t];
226
+ }
227
+
228
+ mkSbv(value: bigint) {
229
+ const manager = this.manager;
230
+ if (value >= 0n) return manager.mkBvNumeral(value, getNumBits(value) + 1);
231
+ return mkBvApp(manager, OP_BNEG, [manager.mkBvNumeral(-value, getNumBits(-value) + 1)]);
232
+ }
233
+
234
+ mkBvSub(s: number, t: number) {
235
+ const [s1, t1] = this.alignSizes(s, t);
236
+ return mkBvApp(this.manager, OP_BSUB, [this.mkExtend(1, s1), this.mkExtend(1, t1)]);
237
+ }
238
+
239
+ mkExtend(size: number, word: number) {
240
+ const manager = this.manager;
241
+ if (size === 0) return word;
242
+ if (manager.isBvNumeral(word)) {
243
+ const value = manager.getBvNumeralValue(word);
244
+ const width = manager.getBvSize(manager.sorts[word]);
245
+ if (2n ** BigInt(width - 1) > value) return manager.mkBvNumeral(value, width + size);
246
+ }
247
+ return mkBvApp(manager, OP_SIGN_EXT, [word], [size]);
248
+ }
249
+
250
+ private alignDivisor(inputS: number, inputT: number, inputDivisor: bigint) {
251
+ if (inputDivisor <= this.maxDivisor) return { s: inputS, t: inputT, divisor: inputDivisor };
252
+ if (inputDivisor % this.maxDivisor !== 0n) return undefined;
253
+ const overflow = inputDivisor / this.maxDivisor;
254
+ const s = this.mkIsDivisibleBy(inputS, overflow);
255
+ if (s === undefined) return undefined;
256
+ const t = this.mkIsDivisibleBy(inputT, overflow);
257
+ if (t === undefined) return undefined;
258
+ return { s, t, divisor: this.maxDivisor };
259
+ }
260
+
261
+ private mkIsDivisibleBy(word: number, inputOverflow: bigint) {
262
+ const manager = this.manager;
263
+ let overflow = inputOverflow;
264
+ let power2 = 0;
265
+ while (overflow % 2n === 0n) {
266
+ power2++;
267
+ overflow /= 2n;
268
+ }
269
+ let result = word;
270
+ if (power2 > 0) {
271
+ const size = manager.getBvSize(manager.sorts[word]);
272
+ if (size <= power2) {
273
+ this.sideConditions.push(manager.mkEq(word, manager.mkBvNumeral(0n, size)));
274
+ result = manager.mkBvNumeral(0n, 1);
275
+ } else {
276
+ const low = mkBvApp(manager, OP_EXTRACT, [word], [power2 - 1, 0]);
277
+ this.sideConditions.push(manager.mkEq(low, manager.mkBvNumeral(0n, power2)));
278
+ result = mkBvApp(manager, OP_EXTRACT, [word], [size - 1, power2]);
279
+ }
280
+ }
281
+ return overflow === 1n ? result : undefined;
282
+ }
283
+
284
+ release() {
285
+ this.sideConditions.reset();
286
+ for (const decl of this.decls) this.manager.decDeclRef(decl);
287
+ }
288
+ }
289
+
290
+ export class Bv2RealRewriter extends RewriterTpl {
291
+ constructor(
292
+ manager: AstManager,
293
+ private util: Bv2RealUtil,
294
+ ) {
295
+ super(manager);
296
+ }
297
+
298
+ isRewritingPatterns() {
299
+ return false;
300
+ }
301
+
302
+ reduceApp(decl: number, args: number[], _sort: number) {
303
+ const manager = this.manager;
304
+ const outer = manager.beginTemporaries();
305
+ const result = this.mkAppCore(decl, args);
306
+ if (result !== -1) manager.incRef(typeof result === "number" ? result : result.expr);
307
+ manager.endTemporaries(outer);
308
+ return result;
309
+ }
310
+
311
+ private mkAppCore(decl: number, args: number[]) {
312
+ const manager = this.manager;
313
+ const funcDecl = manager.funcDecls[decl];
314
+ const util = this.util;
315
+ if (funcDecl.family === FAMILY_ARITH)
316
+ switch (funcDecl.op) {
317
+ case OP_LE:
318
+ return this.mkLe(args[0], args[1]);
319
+ case OP_GE:
320
+ return this.mkLe(args[1], args[0]);
321
+ case OP_LT:
322
+ return { expr: manager.mkNot(this.mkArithLe(args[1], args[0])), depth: 2 };
323
+ case OP_GT:
324
+ return { expr: manager.mkNot(this.mkArithLe(args[0], args[1])), depth: 2 };
325
+ case OP_ADD:
326
+ return this.fold(args, (left, right) => this.mkAdd(left, right));
327
+ case OP_MUL:
328
+ return this.fold(args, (left, right) => this.mkMul(left, right));
329
+ case OP_SUB:
330
+ return this.fold(args, (left, right) => this.mkSub(left, right));
331
+ case OP_UMINUS:
332
+ return this.mkUminus(args[0]);
333
+ default:
334
+ return -1;
335
+ }
336
+ if (funcDecl.family === FAMILY_BASIC) {
337
+ if (funcDecl.op === OP_EQ) return this.mkEq(args[0], args[1]);
338
+ if (funcDecl.op === OP_ITE) return this.mkIte(args[0], args[1], args[2]);
339
+ return -1;
340
+ }
341
+ if (decl === util.posLt) return this.mkLeWithPolarity(args[1], args[0], false, true) ?? -1;
342
+ if (decl === util.posLe) return this.mkLeWithPolarity(args[0], args[1], true, false) ?? -1;
343
+ return -1;
344
+ }
345
+
346
+ private fold(args: number[], combine: (left: number, right: number) => number) {
347
+ let result = args[0];
348
+ for (let index = 1; index < args.length; index++) {
349
+ result = combine(result, args[index]);
350
+ if (result === -1) return -1;
351
+ }
352
+ return result;
353
+ }
354
+
355
+ private mkArithLe(left: number, right: number) {
356
+ return this.manager.mkApp(OP_LE, [left, right], SORT_BOOL);
357
+ }
358
+
359
+ private getPair(s: number, t: number) {
360
+ const util = this.util;
361
+ const first = util.getBv2RealOrNumeral(s);
362
+ if (first === undefined) return undefined;
363
+ const second = util.getBv2RealOrNumeral(t);
364
+ if (second === undefined || first.root !== second.root) return undefined;
365
+ return [first, second];
366
+ }
367
+
368
+ private mkLeWithPolarity(s: number, t: number, isPositive: boolean, isNegative: boolean) {
369
+ const manager = this.manager;
370
+ const util = this.util;
371
+ const pair = this.getPair(s, t);
372
+ if (pair === undefined || pair[0].root !== 2n) return undefined;
373
+ const [first, second] = pair;
374
+ util.alignDivisors(first, second);
375
+ const s1 = util.mkBvSub(first.s, second.s);
376
+ const s2 = util.mkBvSub(first.t, second.t);
377
+ const s2Size = manager.getBvSize(manager.sorts[s2]);
378
+ const leProxy = manager.mkFreshConst("le_proxy", SORT_BOOL);
379
+ util.addAuxDecl(manager.decls[leProxy]);
380
+ const gtProxy = manager.mkNot(leProxy);
381
+ const isS2Nonpos = mkBvApp(manager, OP_SLEQ, [s2, manager.mkBvNumeral(0n, s2Size)]);
382
+ const under = util.mkBvAdd(util.mkBvMulByConstant(4n, s1), util.mkBvMulByConstant(5n, s2));
383
+ const leUnder = mkBvApp(manager, OP_SLEQ, [
384
+ under,
385
+ manager.mkBvNumeral(0n, manager.getBvSize(manager.sorts[under])),
386
+ ]);
387
+ const over = util.mkBvAdd(util.mkBvMulByConstant(2n, s1), util.mkBvMulByConstant(3n, s2));
388
+ const leOver = mkBvApp(manager, OP_SLEQ, [
389
+ over,
390
+ manager.mkBvNumeral(0n, manager.getBvSize(manager.sorts[over])),
391
+ ]);
392
+ const mkAnd = (first: number, second: number) =>
393
+ manager.mkApp(OP_AND, [first, second], SORT_BOOL);
394
+ const mkImplies = (first: number, second: number) =>
395
+ manager.mkApp(OP_IMPLIES, [first, second], SORT_BOOL);
396
+ const isS2Pos = manager.mkApp(OP_NOT, [isS2Nonpos], SORT_BOOL);
397
+ if (isPositive) {
398
+ util.sideConditions.push(mkImplies(mkAnd(leProxy, isS2Nonpos), leUnder));
399
+ util.sideConditions.push(mkImplies(mkAnd(leProxy, isS2Pos), leOver));
400
+ }
401
+ if (isNegative) {
402
+ util.sideConditions.push(
403
+ mkImplies(mkAnd(gtProxy, isS2Pos), manager.mkApp(OP_NOT, [leUnder], SORT_BOOL)),
404
+ );
405
+ util.sideConditions.push(
406
+ mkImplies(mkAnd(gtProxy, isS2Nonpos), manager.mkApp(OP_NOT, [leOver], SORT_BOOL)),
407
+ );
408
+ }
409
+ return isPositive ? leProxy : gtProxy;
410
+ }
411
+
412
+ private mkLe(s: number, t: number) {
413
+ const manager = this.manager;
414
+ const util = this.util;
415
+ const withPolarity = this.mkLeWithPolarity(s, t, true, true);
416
+ if (withPolarity !== undefined) return withPolarity;
417
+ const pair = this.getPair(s, t);
418
+ if (pair === undefined) return -1;
419
+ const [first, second] = pair;
420
+ util.alignDivisors(first, second);
421
+ const t1 = util.mkBvSub(second.s, first.s);
422
+ const t2 = util.mkBvSub(second.t, first.t);
423
+ const zero1 = manager.mkBvNumeral(0n, manager.getBvSize(manager.sorts[t1]));
424
+ const zero2 = manager.mkBvNumeral(0n, manager.getBvSize(manager.sorts[t2]));
425
+ const isT1Nonneg = mkBvApp(manager, OP_SLEQ, [zero1, t1]);
426
+ const isT1Nonpos = mkBvApp(manager, OP_SLEQ, [t1, zero1]);
427
+ const isT2Nonneg = mkBvApp(manager, OP_SLEQ, [zero2, t2]);
428
+ const isT2Nonpos = mkBvApp(manager, OP_SLEQ, [t2, zero2]);
429
+ const [t12, t22] = util.alignSizes(
430
+ util.mkBvMul(t1, t1),
431
+ util.mkBvMulByConstant(first.root, util.mkBvMul(t2, t2)),
432
+ );
433
+ const mkNot = (expr: number) => manager.mkApp(OP_NOT, [expr], SORT_BOOL);
434
+ return manager.mkAnd([
435
+ manager.mkOr([isT1Nonneg, isT2Nonneg]),
436
+ manager.mkOr([mkNot(isT1Nonneg), mkNot(isT2Nonpos), mkBvApp(manager, OP_SLEQ, [t22, t12])]),
437
+ manager.mkOr([mkNot(isT2Nonneg), mkNot(isT1Nonpos), mkBvApp(manager, OP_SLEQ, [t12, t22])]),
438
+ ]);
439
+ }
440
+
441
+ private mkIte(condition: number, s: number, t: number) {
442
+ const manager = this.manager;
443
+ const util = this.util;
444
+ const pair = this.getPair(s, t);
445
+ if (pair === undefined) return -1;
446
+ const [first, second] = pair;
447
+ util.alignDivisors(first, second);
448
+ const [s1, t1] = util.alignSizes(first.s, second.s);
449
+ const [s2, t2] = util.alignSizes(first.t, second.t);
450
+ return (
451
+ util.mkBv2Real(
452
+ manager.mkApp(OP_ITE, [condition, s1, t1], manager.sorts[s1]),
453
+ manager.mkApp(OP_ITE, [condition, s2, t2], manager.sorts[s2]),
454
+ first.divisor,
455
+ first.root,
456
+ ) ?? -1
457
+ );
458
+ }
459
+
460
+ private mkEq(s: number, t: number) {
461
+ const manager = this.manager;
462
+ const util = this.util;
463
+ const pair = this.getPair(s, t);
464
+ if (pair === undefined) return -1;
465
+ const [first, second] = pair;
466
+ util.alignDivisors(first, second);
467
+ const [s1, t1] = util.alignSizes(first.s, second.s);
468
+ const [s2, t2] = util.alignSizes(first.t, second.t);
469
+ return manager.mkApp(OP_AND, [manager.mkEq(s1, t1), manager.mkEq(s2, t2)], SORT_BOOL);
470
+ }
471
+
472
+ private mkUminus(s: number) {
473
+ const manager = this.manager;
474
+ const util = this.util;
475
+ const value = util.getBv2RealOrNumeral(s);
476
+ if (value === undefined) return -1;
477
+ const s1 = util.mkExtend(1, value.s);
478
+ const s2 = util.mkExtend(1, value.t);
479
+ return (
480
+ util.mkBv2Real(
481
+ mkBvApp(manager, OP_BNEG, [s1]),
482
+ mkBvApp(manager, OP_BNEG, [s2]),
483
+ value.divisor,
484
+ value.root,
485
+ ) ?? -1
486
+ );
487
+ }
488
+
489
+ private mkAdd(s: number, t: number) {
490
+ const util = this.util;
491
+ const pair = this.getPair(s, t);
492
+ if (pair === undefined) return -1;
493
+ const [first, second] = pair;
494
+ util.alignDivisors(first, second);
495
+ return (
496
+ util.mkBv2Real(
497
+ util.mkBvAdd(first.s, second.s),
498
+ util.mkBvAdd(second.t, first.t),
499
+ first.divisor,
500
+ first.root,
501
+ ) ?? -1
502
+ );
503
+ }
504
+
505
+ private mkMul(s: number, t: number) {
506
+ const util = this.util;
507
+ const pair = this.getPair(s, t);
508
+ if (pair === undefined) return -1;
509
+ const [first, second] = pair;
510
+ const u1 = util.mkBvAdd(
511
+ util.mkBvMul(first.s, second.s),
512
+ util.mkBvMulByConstant(first.root, util.mkBvMul(second.t, first.t)),
513
+ );
514
+ const u2 = util.mkBvAdd(util.mkBvMul(first.s, second.t), util.mkBvMul(first.t, second.s));
515
+ return util.mkBv2Real(u1, u2, first.divisor * second.divisor, first.root) ?? -1;
516
+ }
517
+
518
+ private mkSub(s: number, t: number) {
519
+ const util = this.util;
520
+ const pair = this.getPair(s, t);
521
+ if (pair === undefined) return -1;
522
+ const [first, second] = pair;
523
+ util.alignDivisors(first, second);
524
+ return (
525
+ util.mkBv2Real(
526
+ util.mkBvSub(first.s, second.s),
527
+ util.mkBvSub(first.t, second.t),
528
+ first.divisor,
529
+ first.root,
530
+ ) ?? -1
531
+ );
532
+ }
533
+ }
@@ -0,0 +1,110 @@
1
+ import { SmtUnsupportedError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ OP_ADD,
7
+ OP_EQ,
8
+ OP_GE,
9
+ OP_GT,
10
+ OP_ITE,
11
+ OP_LE,
12
+ OP_LT,
13
+ OP_MUL,
14
+ OP_SUB,
15
+ OP_UMINUS,
16
+ } from "./ast";
17
+ import type { Goal } from "./goal";
18
+ import { Rational } from "./rational";
19
+ import { Rewriter, type RewriterOptions } from "./rewriter";
20
+
21
+ interface Bound {
22
+ value: Rational;
23
+ }
24
+
25
+ const isPbSum = (manager: AstManager, expr: number, factor: Rational, bound: Bound): boolean => {
26
+ if (manager.kinds[expr] !== KIND_APP) return false;
27
+ const args = manager.getArgs(expr);
28
+ switch (manager.getOp(expr)) {
29
+ case OP_ADD:
30
+ return args.every((arg) => isPbSum(manager, arg, factor, bound));
31
+ case OP_SUB:
32
+ return (
33
+ isPbSum(manager, args[0], factor, bound) &&
34
+ args.slice(1).every((arg) => isPbSum(manager, arg, factor.neg(), bound))
35
+ );
36
+ case OP_UMINUS:
37
+ return isPbSum(manager, args[0], factor.neg(), bound);
38
+ case OP_MUL:
39
+ if (args.length !== 2) return false;
40
+ if (manager.isNumeral(args[0]))
41
+ return isPbSum(manager, args[1], manager.getRationalValue(args[0]).mul(factor), bound);
42
+ if (manager.isNumeral(args[1]))
43
+ return isPbSum(manager, args[0], manager.getRationalValue(args[1]).mul(factor), bound);
44
+ return false;
45
+ case OP_ITE: {
46
+ if (!manager.isNumeral(args[1]) || !manager.isNumeral(args[2])) return false;
47
+ const thenValue = manager.getRationalValue(args[1]).mul(factor);
48
+ const elseValue = manager.getRationalValue(args[2]).mul(factor);
49
+ const low = thenValue.compare(elseValue) < 0 ? thenValue : elseValue;
50
+ bound.value = bound.value.sub(low);
51
+ return bound.value.isInt() && thenValue.sub(elseValue).isInt();
52
+ }
53
+ default:
54
+ if (!manager.isNumeral(expr)) return false;
55
+ bound.value = bound.value.sub(factor.mul(manager.getRationalValue(expr)));
56
+ return bound.value.isInt();
57
+ }
58
+ };
59
+
60
+ const isPb = (manager: AstManager, first: number, second: number) => {
61
+ const bound = { value: Rational.zero };
62
+ return (
63
+ isPbSum(manager, first, Rational.one, bound) &&
64
+ isPbSum(manager, second, Rational.minusOne, bound)
65
+ );
66
+ };
67
+
68
+ // The port has no pseudo-Boolean constraints, so a comparison the encoder would rewrite is unsupported.
69
+ export const checkPbFree = (manager: AstManager, form: number) => {
70
+ const visited = new Set<number>();
71
+ const todo = [form];
72
+ while (todo.length > 0) {
73
+ const expr = todo.pop() as number;
74
+ if (visited.has(expr)) continue;
75
+ visited.add(expr);
76
+ if (manager.kinds[expr] === KIND_QUANTIFIER) {
77
+ todo.push(manager.getQuantifier(expr).body);
78
+ continue;
79
+ }
80
+ if (manager.kinds[expr] !== KIND_APP) continue;
81
+ const op = manager.getOp(expr);
82
+ const args = manager.getArgs(expr);
83
+ const isEncoded =
84
+ op === OP_LE || op === OP_LT
85
+ ? isPb(manager, args[0], args[1])
86
+ : op === OP_GE || op === OP_GT
87
+ ? isPb(manager, args[1], args[0])
88
+ : op === OP_EQ && isPb(manager, args[0], args[1]);
89
+ if (isEncoded) throw new SmtUnsupportedError("pseudo-Boolean constraints");
90
+ todo.push(...args);
91
+ }
92
+ };
93
+
94
+ export const card2bv = (manager: AstManager, goal: Goal, options: RewriterOptions) => {
95
+ if (!goal.isProofsEnabled) {
96
+ const rewriter = new Rewriter(manager, options);
97
+ const size = goal.forms.size;
98
+ for (let index = 0; index < size && !goal.isInconsistent; index++) {
99
+ const form = goal.forms.items[index];
100
+ const rewritten = rewriter.rewrite(form);
101
+ checkPbFree(manager, rewritten);
102
+ if (rewritten !== form) goal.update(index, rewritten);
103
+ manager.decRef(rewritten);
104
+ }
105
+ rewriter.release();
106
+ }
107
+ goal.elimTrue();
108
+ goal.elimRedundancies();
109
+ goal.depth++;
110
+ };
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_case_split_queue.cpp, src/util/heap.h), MIT license, see z3-license.txt.
2
-
3
1
  import { BoolVar, toBoolVar } from "./literal";
4
2
 
5
3
  class ActivityHeap {