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

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 +45 -44
  15. package/dist/run.js +45 -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 +45 -42
  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 +578 -757
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +27 -62
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +246 -240
  35. package/src/cli/tlc-output.ts +686 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +59 -707
  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 +73 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +34 -107
  47. package/src/exit-codes.ts +3 -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 +634 -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 +17 -31
  81. package/src/parallel.ts +55 -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 +165 -83
  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 +6 -3
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  310. package/src/prover/smt/solver/lp/pdd.ts +725 -289
  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 +17 -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 +244 -53
  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 +36 -50
  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 +70 -29
  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,1631 @@
1
+ import { ENCODINGS, UNICODE_ENCODING } from "./seq-decl-plugin";
2
+ import {
3
+ isStackOverflow,
4
+ SmtCanceledError,
5
+ SmtParseError,
6
+ SmtTacticError,
7
+ SmtUnsupportedError,
8
+ } from "../../../errors";
9
+ import type { DecideOptions } from "../../verdict";
10
+ import {
11
+ AstManager,
12
+ FAMILY_BASIC,
13
+ FAMILY_MODEL_VALUE,
14
+ FAMILY_USER,
15
+ KIND_APP,
16
+ KIND_QUANTIFIER,
17
+ OP_IMPLIES,
18
+ SORT_BOOL,
19
+ SORT_INT,
20
+ SORT_REAL,
21
+ } from "./ast";
22
+ import { Goal, getDependencyValues, mkDependencyLeaf, PRECISION_NAMES } from "./goal";
23
+ import { Rational } from "./rational";
24
+ import { Rewriter } from "./rewriter";
25
+ import { ResourceLimit } from "./rlimit";
26
+ import {
27
+ DEFAULT_PRINT_OPTIONS,
28
+ formatSort,
29
+ getQuotedName,
30
+ mkSeq1,
31
+ mkSeq5,
32
+ mkText,
33
+ type PrintOptions,
34
+ printExpr,
35
+ renderFormat,
36
+ } from "./smt2-printer";
37
+ import {
38
+ createCommandReader,
39
+ createSmtlibReader,
40
+ DECLARATIONS,
41
+ isSymbol,
42
+ type SExpr,
43
+ type SmtList,
44
+ type SmtlibReader,
45
+ } from "./smtlib-parser";
46
+ import { O_MAXIMIZE, O_MAXSMT, O_MINIMIZE, OptContext, type OptObjective } from "./opt-context";
47
+ import { getLogicStrategy } from "./logic-tactics";
48
+ import { isMbqiByFeatures, isMbqiByLogic } from "./smt-setup";
49
+ import { isSupportedLogic } from "./smt-logics";
50
+ import { getVerdict, solveAssertions, solveAssuming } from "./solver";
51
+ import { getConsequences } from "./smt-consequences";
52
+ import { getFdConsequences } from "./fd-solver";
53
+ import { SmtKernel } from "./smt-kernel";
54
+ import { IncSatSolver } from "./sat/inc-sat-solver";
55
+ import { mkThSolver } from "./euf/th-solvers";
56
+ import { isAstLess } from "./ast-lt";
57
+ import { InvVarShifter } from "./rewriter-tpl";
58
+ import { elimUnusedVars, getFreeVarSorts, VarSubst } from "./var-subst";
59
+ import { type Context, MBQI_MAX_ITERATIONS } from "./context";
60
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
61
+ import type { DatalogContext } from "./muz/dl-context";
62
+ import { createDatalogContext } from "./muz/horn-tactic";
63
+ import { printModel } from "./model-printer";
64
+ import { FuncInterp, getManagerSomeValue, ProtoModel } from "./proto-model";
65
+ import {
66
+ applyTactic,
67
+ checkSatUsing,
68
+ compileInternalTactic,
69
+ compileTactic,
70
+ getRewriterOptions,
71
+ getSatParams,
72
+ type TacticParam,
73
+ } from "./tactic";
74
+
75
+ const SILENT_COMMANDS = new Set([
76
+ ...DECLARATIONS,
77
+ "assert",
78
+ "push",
79
+ "pop",
80
+ "reset",
81
+ "reset-assertions",
82
+ "set-option",
83
+ "set-info",
84
+ "minimize",
85
+ "maximize",
86
+ "assert-soft",
87
+ "declare-rel",
88
+ "declare-var",
89
+ "rule",
90
+ ]);
91
+
92
+ type PrintOptionOf<Value> = {
93
+ [Key in keyof PrintOptions]: PrintOptions[Key] extends Value ? Key : never;
94
+ }[keyof PrintOptions];
95
+
96
+ const NUMERIC_PRINT_OPTIONS = new Map<string, PrintOptionOf<number>>([
97
+ [":pp.max_indent", "maxIndent"],
98
+ [":pp.max_num_lines", "maxNumLines"],
99
+ [":pp.max_width", "maxWidth"],
100
+ [":pp.max_ribbon", "maxRibbon"],
101
+ [":pp.max_depth", "maxDepth"],
102
+ [":pp.min_alias_size", "minAliasSize"],
103
+ [":pp.decimal_precision", "decimalPrecision"],
104
+ ]);
105
+
106
+ const BOOLEAN_PRINT_OPTIONS = new Map<string, PrintOptionOf<boolean>>([
107
+ [":pp.flat_assoc", "isFlatAssoc"],
108
+ [":pp.single_line", "isSingleLine"],
109
+ [":pp.bounded", "isBounded"],
110
+ [":pp.decimal", "isDecimal"],
111
+ [":pp.bv_literals", "isBvLiterals"],
112
+ [":pp.bv_neg", "isBvNeg"],
113
+ [":pp.fp_real_literals", "isFpRealLiterals"],
114
+ ]);
115
+
116
+ const SIMPLIFY_PARAMETERS = new Set([
117
+ "elim_and",
118
+ "local_ctx",
119
+ "pull_cheap_ite",
120
+ "blast_distinct",
121
+ "som",
122
+ "sort_sums",
123
+ "arith_lhs",
124
+ "gcd_rounding",
125
+ "hi_div0",
126
+ "mul2concat",
127
+ "split_concat_eq",
128
+ "algebraic_number_evaluator",
129
+ "expand_power",
130
+ "expand_tan",
131
+ "sort_store",
132
+ "elim_rem",
133
+ ]);
134
+
135
+ const SIMPLIFY_UINT_PARAMETERS = new Set([
136
+ "max_degree",
137
+ "local_ctx_limit",
138
+ "blast_distinct_threshold",
139
+ ]);
140
+
141
+ const PARAMETER_DEFAULTS = new Map([
142
+ ["auto_config", "true"],
143
+ ["smt.relevancy", "2"],
144
+ ["smt.mbqi", "true"],
145
+ ["rlimit", "0"],
146
+ ["rewriter.hi_div0", "true"],
147
+ ]);
148
+
149
+ const BUILTIN_OPTIONS = new Set([
150
+ ":print-success",
151
+ ":print-warning",
152
+ ":expand-definitions",
153
+ ":interactive-mode",
154
+ ":produce-proofs",
155
+ ":produce-unsat-cores",
156
+ ":produce-unsat-assumptions",
157
+ ":produce-models",
158
+ ":produce-assignments",
159
+ ":produce-assertions",
160
+ ":regular-output-channel",
161
+ ":diagnostic-output-channel",
162
+ ":random-seed",
163
+ ":verbosity",
164
+ ":global-decls",
165
+ ":global-declarations",
166
+ ":numeral-as-real",
167
+ ":error-behavior",
168
+ ":int-real-coercions",
169
+ ":reproducible-resource-limit",
170
+ ]);
171
+
172
+ const getParameterName = (keyword: string) => keyword.slice(1).toLowerCase().replaceAll("-", "_");
173
+
174
+ const getSoftParameters = (items: SExpr[]) => {
175
+ const parameters = { weight: Rational.one, id: null as string | null };
176
+ for (let index = 0; index < items.length; index += 2) {
177
+ const keyword = items[index];
178
+ const name = keyword.kind === "keyword" ? getParameterName(keyword.text) : "";
179
+ const value = items[index + 1];
180
+ if (name === "weight" && (value?.kind === "numeral" || value?.kind === "decimal")) {
181
+ const [whole, fraction = ""] = value.text.split(".");
182
+ parameters.weight = Rational.of(BigInt(whole + fraction), 10n ** BigInt(fraction.length));
183
+ continue;
184
+ }
185
+ if (name !== "id" || !isSymbol(value))
186
+ throw new SmtUnsupportedError(`the parameter :${name} of assert-soft`);
187
+ parameters.id = value.text;
188
+ }
189
+ return parameters;
190
+ };
191
+
192
+ const getSimplifyParams = (items: SExpr[]) => {
193
+ const params = new Map<string, TacticParam>();
194
+ for (let index = 0; index < items.length; index += 2) {
195
+ const keyword = items[index];
196
+ const name = keyword.kind === "keyword" ? getParameterName(keyword.text) : "";
197
+ const value = items[index + 1];
198
+ if (SIMPLIFY_UINT_PARAMETERS.has(name) && value?.kind === "numeral") {
199
+ params.set(name, Number(value.text));
200
+ continue;
201
+ }
202
+ if (!SIMPLIFY_PARAMETERS.has(name) || !isSymbol(value))
203
+ throw new SmtUnsupportedError(`the parameter :${name} of the simplifier`);
204
+ params.set(name, isSymbol(value, "true"));
205
+ }
206
+ return params;
207
+ };
208
+
209
+ const APPLY_PARAMETERS = new Map([
210
+ ["print", true],
211
+ ["print_model_converter", true],
212
+ ["print_benchmark", true],
213
+ ["print_dependencies", true],
214
+ ["timeout", false],
215
+ ["max_memory", false],
216
+ ["print_statistics", true],
217
+ ]);
218
+
219
+ const CHECK_SAT_USING_PARAMETERS = new Map([
220
+ ["timeout", false],
221
+ ["max_memory", false],
222
+ ["print_statistics", true],
223
+ ["print_unsat_core", true],
224
+ ["print_proof", true],
225
+ ["print_model", true],
226
+ ]);
227
+
228
+ const getCommandParams = (items: SExpr[], isBooleans: ReadonlyMap<string, boolean>) => {
229
+ const params = new Map<string, TacticParam>();
230
+ for (let index = 2; index < items.length; index += 2) {
231
+ const keyword = items[index];
232
+ if (keyword.kind !== "keyword")
233
+ throw new SmtParseError("invalid command argument, keyword expected", keyword);
234
+ const name = getParameterName(keyword.text);
235
+ const isBoolean = isBooleans.get(name);
236
+ if (isBoolean === undefined) throw new SmtParseError("invalid keyword argument", keyword);
237
+ const value = items[index + 1];
238
+ if (isBoolean) {
239
+ if (!isSymbol(value, "true") && !isSymbol(value, "false"))
240
+ throw new SmtParseError("invalid command argument, true/false expected", value ?? keyword);
241
+ params.set(name, isSymbol(value, "true"));
242
+ } else {
243
+ if (value?.kind !== "numeral")
244
+ throw new SmtParseError(
245
+ "invalid command argument, unsigned integer expected",
246
+ value ?? keyword,
247
+ );
248
+ params.set(name, Number(value.text));
249
+ }
250
+ }
251
+ return params;
252
+ };
253
+
254
+ // Z3's parse_opt_unsigned names the push command for pop as well.
255
+ const getScopeCount = (list: SmtList) => {
256
+ const argument = list.items[1];
257
+ if (argument === undefined) return 1;
258
+ if (argument.kind !== "numeral")
259
+ throw new SmtParseError("invalid push command, integer expected", argument);
260
+ if (argument.text.startsWith("-"))
261
+ throw new SmtParseError("invalid push command, value is negative.", argument);
262
+ return Number(argument.text);
263
+ };
264
+
265
+ interface Scope {
266
+ assertions: number;
267
+ objectives: number;
268
+ softTrail: number;
269
+ }
270
+
271
+ interface CheckResult {
272
+ status: number;
273
+ context: Context | undefined;
274
+ isOptimizing: boolean;
275
+ model: ProtoModel | undefined;
276
+ core: number[] | undefined;
277
+ // check_sat_result::reason_unknown, where the port tracks it.
278
+ reasonUnknown?: string;
279
+ }
280
+
281
+ interface ScriptState {
282
+ manager: AstManager;
283
+ logic: string | undefined;
284
+ reader: SmtlibReader;
285
+ assertions: number[];
286
+ names: number[];
287
+ assertionTexts: string[];
288
+ objectives: OptObjective[];
289
+ // The objective of each soft constraint, in the order they were asserted.
290
+ softTrail: number[];
291
+ optimizer: OptContext | undefined;
292
+ scopes: Scope[];
293
+ check: CheckResult | undefined;
294
+ isProofsEnabled: boolean | undefined;
295
+ isIncremental: boolean;
296
+ hasChecked: boolean;
297
+ // The datalog context of the declare-rel, declare-var, rule and query commands.
298
+ datalog: DatalogContext | undefined;
299
+ // combined_solver's incremental smt kernel, which keeps one context across the checks, or
300
+ // undefined while Z3 has made no such kernel.
301
+ kernel: SmtKernel | undefined;
302
+ // The incremental solver of sat.euf, inc_sat_solver in euf mode, or undefined once it reached
303
+ // an unported theory and the smt kernel answers in its place.
304
+ eufSolver: IncSatSolver | undefined;
305
+ }
306
+
307
+ // Z3 fixes the proof mode at the first command that needs terms.
308
+ const MANAGERLESS_COMMANDS = new Set([
309
+ "set-option",
310
+ "set-info",
311
+ "set-logic",
312
+ "get-option",
313
+ "get-info",
314
+ "echo",
315
+ ]);
316
+
317
+ export const runSmtlibScript = (
318
+ text: string,
319
+ options: DecideOptions,
320
+ printLine: (line: string, isDiagnostic?: boolean) => void,
321
+ ) => {
322
+ const commands = createCommandReader(text);
323
+ // Z3 writes to a stream: text left without a newline starts the next line.
324
+ let pendingText = "";
325
+ const print = (line: string, isDiagnostic?: boolean) => {
326
+ printLine(pendingText + line, isDiagnostic);
327
+ pendingText = "";
328
+ };
329
+ const settings = {
330
+ isPrintingSuccess: false,
331
+ isProducingModels: true,
332
+ isProducingUnsatCores: false,
333
+ isProducingProofs: false,
334
+ isExitingOnError: false,
335
+ isInteractive: false,
336
+ isDiagnosticOnStdout: false,
337
+ parameters: new Map<string, string>(),
338
+ isMbqi: true,
339
+ mbqiMaxIterations: MBQI_MAX_ITERATIONS,
340
+ isFindingMacros: false,
341
+ isHiDiv0: true,
342
+ encoding: UNICODE_ENCODING,
343
+ rlimit: 0,
344
+ printOptions: { ...DEFAULT_PRINT_OPTIONS },
345
+ parserOptions: { isIgnoringBadPatterns: true },
346
+ };
347
+ const createState = (): ScriptState => {
348
+ const manager = new AstManager(
349
+ new ResourceLimit(Date.now() + options.timeLimitMs, options.signal),
350
+ );
351
+ manager.isHiDiv0 = settings.isHiDiv0;
352
+ manager.maxChar = settings.encoding.maxChar;
353
+ manager.charBits = settings.encoding.charBits;
354
+ return {
355
+ manager,
356
+ logic: undefined,
357
+ reader: createSmtlibReader(manager, undefined, settings.parserOptions),
358
+ assertions: [],
359
+ names: [],
360
+ assertionTexts: [],
361
+ objectives: [],
362
+ softTrail: [],
363
+ optimizer: undefined,
364
+ scopes: [],
365
+ check: undefined,
366
+ isProofsEnabled: undefined,
367
+ isIncremental: false,
368
+ hasChecked: false,
369
+ datalog: undefined,
370
+ kernel: undefined,
371
+ eufSolver: undefined,
372
+ };
373
+ };
374
+ let state = createState();
375
+ const getPrintEnvironment = () => ({
376
+ options: settings.printOptions,
377
+ isUsed: state.reader.isUsed,
378
+ isClashing: state.reader.isClashing,
379
+ });
380
+ const format = (expr: number) => printExpr(state.manager, getPrintEnvironment(), expr);
381
+ const display = (expr: number) => print(format(expr));
382
+ const report = (error: SmtParseError) =>
383
+ print(`(error "line ${error.line} column ${error.column}: ${error.message}")`);
384
+ const getNamedAssertions = () => {
385
+ const manager = state.manager;
386
+ const isNamed = hasNames();
387
+ return state.assertions.map((assertion, index) =>
388
+ isNamed && state.names[index] !== -1
389
+ ? manager.mkApp(OP_IMPLIES, [state.names[index], assertion], SORT_BOOL)
390
+ : assertion,
391
+ );
392
+ };
393
+ const getOptOptions = () => {
394
+ const parameters = settings.parameters;
395
+ // symba and farkas run on the infinitesimal arithmetic solver, which is not ported.
396
+ if ((parameters.get("opt.optsmt_engine") ?? "basic") !== "basic")
397
+ throw new SmtUnsupportedError("the option :opt.optsmt_engine");
398
+ return {
399
+ priority: parameters.get("opt.priority") ?? "lex",
400
+ optsmt: {
401
+ bisectRounds: Number(parameters.get("opt.optsmt_bisect_rounds") ?? 64),
402
+ isNlsat: parameters.get("opt.optsmt_nlsat") !== "false",
403
+ isDualBounds: parameters.get("opt.optsmt_dual_bounds") !== "false",
404
+ supremumRlimit: Number(parameters.get("opt.optsmt_nlsat_supremum_rlimit") ?? 100000),
405
+ isLexAfterUnbounded: parameters.get("opt.optsmt_lex_after_unbounded") !== "false",
406
+ },
407
+ isParetoNlsat: parameters.get("opt.pareto_nlsat") !== "false",
408
+ isParetoNlsatReused: parameters.get("opt.pareto_nlsat_reuse") !== "false",
409
+ paretoMaxLemmas: Number(parameters.get("opt.pareto_nlsat_max_lemmas") ?? 128),
410
+ };
411
+ };
412
+ const optimize = (extra: number[]) => {
413
+ const manager = state.manager;
414
+ const objectives = state.objectives;
415
+ const hard = [...getNamedAssertions(), ...state.names.filter((name) => name !== -1), ...extra];
416
+ const pinned = hard.map((form) => {
417
+ manager.incRef(form);
418
+ return form;
419
+ });
420
+ state.optimizer ??= new OptContext(
421
+ manager,
422
+ {
423
+ manager,
424
+ isMbqi: settings.isMbqi,
425
+ mbqiMaxIterations: settings.mbqiMaxIterations,
426
+ isFindingMacros: settings.isFindingMacros,
427
+ setup: getSetup(),
428
+ write: () => {},
429
+ parameters: settings.parameters,
430
+ hasDefinitions: () => state.reader.hasDefinitions(),
431
+ },
432
+ objectives,
433
+ );
434
+ const optimizer = state.optimizer;
435
+ clearCheck();
436
+ state.manager.limit.push(settings.rlimit);
437
+ try {
438
+ const hasAssumptions = extra.length > 0 || hasNames();
439
+ const status = optimizer.optimize(hard, {
440
+ ...getOptOptions(),
441
+ hasAssumptions,
442
+ isSatEnabled: settings.parameters.get("opt.enable_sat") !== "false",
443
+ maxsat: {
444
+ maxsatEngine: settings.parameters.get("opt.maxsat_engine") ?? "maxres",
445
+ isMaxlexEnabled: settings.parameters.get("opt.maxlex.enable") !== "false",
446
+ isHillClimbing: settings.parameters.get("opt.maxres.hill_climb") !== "false",
447
+ maxCoreSize: Number(settings.parameters.get("opt.maxres.max_core_size") ?? 3),
448
+ },
449
+ isEliminatingZeroOne:
450
+ settings.parameters.get("opt.elim_01") !== "false" &&
451
+ state.logic === undefined &&
452
+ !hasAssumptions &&
453
+ settings.parameters.get("opt.incremental") !== "true",
454
+ });
455
+ setCheck(status, { isOptimizing: true, model: optimizer.model ?? undefined });
456
+ print(getVerdict(status));
457
+ return true;
458
+ } catch (error) {
459
+ // The unported parts of optimization keep the answer of the hard constraints.
460
+ if (error instanceof SmtUnsupportedError) {
461
+ resetOptimizer();
462
+ return false;
463
+ }
464
+ if (!(error instanceof SmtCanceledError || isStackOverflow(error))) throw error;
465
+ optimizer.release();
466
+ setCheck(L_UNDEF, { isOptimizing: true });
467
+ print("unknown");
468
+ return true;
469
+ } finally {
470
+ state.manager.limit.pop();
471
+ for (const form of pinned) manager.decRef(form);
472
+ }
473
+ };
474
+ const resetOptimizer = () => {
475
+ state.optimizer?.release();
476
+ state.optimizer = undefined;
477
+ };
478
+ // The port keeps answering with the smt kernel where it lacks a piece of the logic's strategy.
479
+ const solveWithStrategy = () => {
480
+ const goal = getGoal();
481
+ const strategy =
482
+ settings.parameters.get("tactic.default_tactic") ??
483
+ getLogicStrategy(state.logic, goal.isProofsEnabled);
484
+ try {
485
+ const checked = checkSatUsing(compileInternalTactic(getTacticEnvironment(), strategy), goal);
486
+ return { result: checked.status, context: undefined, model: checked.model };
487
+ } catch (error) {
488
+ if (!(error instanceof SmtUnsupportedError)) throw error;
489
+ const hasQuantifiers = state.assertions.some(
490
+ (assertion) => state.manager.hasQuantifierFlags[assertion],
491
+ );
492
+ return {
493
+ ...solveAssertions(state.manager, state.assertions, {
494
+ isMbqi: settings.isMbqi || isMbqiByFeatures(getSetup(), hasQuantifiers),
495
+ mbqiMaxIterations: settings.mbqiMaxIterations,
496
+ isFindingMacros: settings.isFindingMacros,
497
+ setup: getSetup(),
498
+ }),
499
+ model: undefined,
500
+ };
501
+ }
502
+ };
503
+ const getKernelParams = () => ({
504
+ isMbqi: settings.isMbqi || isMbqiByLogic(getSetup()),
505
+ mbqiMaxIterations: settings.mbqiMaxIterations,
506
+ isFindingMacros: settings.isFindingMacros,
507
+ setup: getSetup(),
508
+ });
509
+ // mk_special_solver_for_logic gives these logics the finite-domain solver, incremental or not.
510
+ const isUsingFdSolver = () =>
511
+ (state.logic === "QF_FD" || state.logic === "SAT") &&
512
+ !settings.isProducingProofs &&
513
+ !settings.parameters.has("tactic.default_tactic");
514
+ const checkSat = (extra: number[]) => {
515
+ state.manager.limit.restart(Date.now() + options.timeLimitMs);
516
+ // opt::context::optimize answers as the search of the hard constraints does: once they are
517
+ // satisfiable, optsmt and maxsmt only improve the model. The unported parts of optimization
518
+ // only get that answer.
519
+ if (state.objectives.length > 0 && optimize(extra)) return;
520
+ state.manager.limit.push(settings.rlimit);
521
+ const isOptimizing = state.objectives.length > 0;
522
+ try {
523
+ const manager = state.manager;
524
+ const names = state.names.filter((name) => name !== -1);
525
+ const isNamed = names.length > 0;
526
+ const isAssuming = isNamed || extra.length > 0;
527
+ if (isAssuming) state.isIncremental = true;
528
+ if (!isOptimizing) state.hasChecked = true;
529
+ const assumptions = isNamed ? [...names, ...extra] : extra;
530
+ const kernel =
531
+ isAssuming || (state.isIncremental && !isOptimizing && !isUsingFdSolver())
532
+ ? checkKernel(assumptions)
533
+ : undefined;
534
+ // Z3 retries a quantifier-free problem with its tactic when the incremental kernel gives up.
535
+ const solved =
536
+ kernel === undefined ||
537
+ (!isAssuming &&
538
+ kernel.result === L_UNDEF &&
539
+ !state.assertions.some((assertion) => manager.hasQuantifierFlags[assertion]) &&
540
+ manager.limit.inc())
541
+ ? { ...solveWithStrategy(), core: undefined }
542
+ : kernel;
543
+ setCheck(solved.result, {
544
+ context: solved.context,
545
+ isOptimizing,
546
+ model: solved.model,
547
+ core: solved.core ?? solved.context?.unsatCore ?? [],
548
+ });
549
+ print(getVerdict(solved.result));
550
+ } catch (error) {
551
+ if (!(error instanceof SmtCanceledError || isStackOverflow(error))) throw error;
552
+ setCheck(L_UNDEF, { isOptimizing });
553
+ print("unknown");
554
+ } finally {
555
+ state.manager.limit.release();
556
+ state.manager.limit.pop();
557
+ }
558
+ };
559
+ const getModel = (list: SmtList) => {
560
+ const check = state.check;
561
+ if (!settings.isProducingModels || check === undefined || check.status === L_FALSE)
562
+ throw new SmtParseError("model is not available", list.end);
563
+ if (check.model !== undefined) return check.model;
564
+ if (check.isOptimizing) throw new SmtUnsupportedError("the models of optimization");
565
+ if (check.context === undefined && check.status !== L_TRUE)
566
+ throw new SmtUnsupportedError("the model of a canceled search");
567
+ const model = check.context?.getModel() ?? new ProtoModel(state.manager);
568
+ model.incRef();
569
+ check.model = model;
570
+ return model;
571
+ };
572
+ const clearCheck = () => {
573
+ state.check?.model?.decRef();
574
+ state.check = undefined;
575
+ };
576
+ // The check holds a reference to its model until clearCheck.
577
+ const setCheck = (status: number, result: Partial<Omit<CheckResult, "status">> = {}) => {
578
+ result.model?.incRef();
579
+ state.check = {
580
+ status,
581
+ context: undefined,
582
+ isOptimizing: false,
583
+ model: undefined,
584
+ core: undefined,
585
+ ...result,
586
+ };
587
+ };
588
+ // cmd_context::mk_solver: mk_solver_for_logic makes the incremental solver the smt kernel unless
589
+ // the logic, the default tactic or the sat parameters pick a sat solver. Under sat.euf that
590
+ // solver is inc_sat_solver in euf mode; the other sat solvers only store their assertions.
591
+ const resetKernel = () => {
592
+ const logic = state.logic;
593
+ const parameters = settings.parameters;
594
+ const isProofsEnabled = settings.isProducingProofs || state.isProofsEnabled === true;
595
+ const isFdSolver =
596
+ ((logic === "QF_FD" || logic === "SAT") && !isProofsEnabled) || logic === "SMTFD";
597
+ const isEuf = parameters.get("sat.euf") === "true";
598
+ const isSatSolver =
599
+ isFdSolver ||
600
+ (logic === "QF_BV" && settings.isHiDiv0) ||
601
+ parameters.get("tactic.default_tactic") === "sat" ||
602
+ parameters.get("sat.smt") === "true" ||
603
+ isEuf;
604
+ state.eufSolver?.release();
605
+ state.kernel = isSatSolver ? undefined : new SmtKernel(state.manager, getKernelParams());
606
+ state.eufSolver =
607
+ isEuf && !isFdSolver && parameters.get("sat.smt") !== "true"
608
+ ? new IncSatSolver(state.manager, getSatParams(parameters), true, mkThSolver)
609
+ : undefined;
610
+ for (let index = 0; index < state.scopes.length; index++) {
611
+ state.kernel?.push();
612
+ useEufSolver((solver) => solver.push());
613
+ }
614
+ };
615
+ // The parts of sat.euf that are not ported leave its answers to the smt kernel.
616
+ const useEufSolver = <Result>(action: (solver: IncSatSolver) => Result) => {
617
+ const solver = state.eufSolver;
618
+ if (solver === undefined) return undefined;
619
+ try {
620
+ return action(solver);
621
+ } catch (error) {
622
+ if (!(error instanceof SmtUnsupportedError)) throw error;
623
+ solver.release();
624
+ state.eufSolver = undefined;
625
+ return undefined;
626
+ }
627
+ };
628
+ // solver_na2as asserts a named assertion as an implication from its name.
629
+ const assertInKernel = (formula: number, name: number) => {
630
+ const manager = state.manager;
631
+ const asserted = name === -1 ? formula : manager.mkApp(OP_IMPLIES, [name, formula], SORT_BOOL);
632
+ manager.incRef(asserted);
633
+ state.kernel?.assertExpr(asserted);
634
+ useEufSolver((solver) => solver.assertExpr(asserted));
635
+ manager.decRef(asserted);
636
+ };
637
+ const checkKernel = (assumptions: number[]) => {
638
+ const kernel = state.kernel;
639
+ const found = useEufSolver((solver) => {
640
+ const result = solver.check(assumptions);
641
+ return {
642
+ result,
643
+ context: undefined,
644
+ model: result === L_TRUE ? (solver.getModel() ?? undefined) : undefined,
645
+ core: result === L_FALSE ? [...solver.getUnsatCore()] : undefined,
646
+ };
647
+ });
648
+ if (found !== undefined) return found;
649
+ if (kernel !== undefined)
650
+ return {
651
+ result: kernel.check(assumptions),
652
+ context: kernel.context,
653
+ model: undefined,
654
+ core: undefined,
655
+ };
656
+ return {
657
+ ...solveAssuming(state.manager, getNamedAssertions(), assumptions, getKernelParams()),
658
+ model: undefined,
659
+ core: undefined,
660
+ };
661
+ };
662
+ const printDiagnostic = (line: string) => print(line, !settings.isDiagnosticOnStdout);
663
+ const write = (text: string, isDiagnostic: boolean) => {
664
+ const lines = text.split("\n");
665
+ const rest = lines.pop() ?? "";
666
+ for (const line of lines) (isDiagnostic ? printDiagnostic : print)(line);
667
+ pendingText += rest;
668
+ };
669
+ const getSetup = () => ({
670
+ logic: state.logic,
671
+ isAutoConfig:
672
+ settings.parameters.get("auto_config") !== "false" &&
673
+ settings.parameters.get("smt.auto_config") !== "false",
674
+ });
675
+ const getTacticEnvironment = () => ({
676
+ manager: state.manager,
677
+ isMbqi: settings.isMbqi,
678
+ mbqiMaxIterations: settings.mbqiMaxIterations,
679
+ isFindingMacros: settings.isFindingMacros,
680
+ setup: getSetup(),
681
+ write,
682
+ parameters: settings.parameters,
683
+ hasDefinitions: () => state.reader.hasDefinitions(),
684
+ });
685
+ const getDatalog = () => {
686
+ state.datalog ??= createDatalogContext(
687
+ state.manager,
688
+ settings.parameters,
689
+ getRewriterOptions(state.manager, new Map()),
690
+ );
691
+ return state.datalog;
692
+ };
693
+ const getTactic = (sexpr: SExpr, end: SmtList["end"]) =>
694
+ compileTactic(getTacticEnvironment(), sexpr, end);
695
+ const getGoal = (isTrackingDependencies = false) => {
696
+ const goal = new Goal(state.manager);
697
+ goal.isProofsEnabled = settings.isProducingProofs || state.isProofsEnabled === true;
698
+ goal.isCoresEnabled = settings.isProducingUnsatCores;
699
+ for (const [index, assertion] of state.assertions.entries())
700
+ goal.assert(
701
+ assertion,
702
+ isTrackingDependencies && state.names[index] !== -1
703
+ ? mkDependencyLeaf(state.names[index])
704
+ : undefined,
705
+ );
706
+ return goal;
707
+ };
708
+ const hasNames = () => state.names.some((name) => name !== -1);
709
+ // parse_check_sat shrinks the expression stack once the check has run.
710
+ const checkSatAssuming = (items: SmtList["items"]) => {
711
+ const literals: number[] = [];
712
+ try {
713
+ for (const item of items) literals.push(state.reader.parseFormula(item));
714
+ checkSat(literals);
715
+ } finally {
716
+ for (const literal of literals) state.manager.decRef(literal);
717
+ }
718
+ };
719
+ const addObjective = (list: SmtList, isMax: boolean) => {
720
+ const term = state.reader.parseTerm(list.items[1] ?? list.end);
721
+ const sort = state.manager.sorts[term];
722
+ if (sort !== SORT_INT && sort !== SORT_REAL && !state.manager.isBvSort(sort))
723
+ throw new SmtParseError("Objective must be bit-vector, integer or real", list.end);
724
+ resetOptimizer();
725
+ state.manager.incRef(term);
726
+ state.objectives.push({
727
+ type: isMax ? O_MAXIMIZE : O_MINIMIZE,
728
+ term,
729
+ terms: [],
730
+ weights: [],
731
+ id: null,
732
+ });
733
+ };
734
+ const releaseObjectives = (size: number, softSize: number) => {
735
+ for (const index of state.softTrail.splice(softSize).reverse()) {
736
+ const objective = state.objectives[index];
737
+ state.manager.decRef(objective.terms.pop() as number);
738
+ objective.weights.pop();
739
+ }
740
+ for (const objective of state.objectives.splice(size))
741
+ if (objective.type !== O_MAXSMT) state.manager.decRef(objective.term);
742
+ };
743
+ const restoreAssertions = (size: number) => {
744
+ for (const assertion of state.assertions.splice(size)) state.manager.decRef(assertion);
745
+ for (const name of state.names.splice(size)) if (name !== -1) state.manager.decRef(name);
746
+ state.assertionTexts.length = size;
747
+ };
748
+ const instantiate = (list: SmtList, isNested: boolean) => {
749
+ const manager = state.manager;
750
+ const outer = state.reader.parseTerm(list.items[1] ?? list.end);
751
+ if (manager.kinds[outer] !== KIND_QUANTIFIER)
752
+ throw new SmtParseError("invalid command, quantifier expected.", list.end);
753
+ const quantifier = isNested ? manager.getQuantifier(outer).body : outer;
754
+ if (manager.kinds[quantifier] !== KIND_QUANTIFIER)
755
+ throw new SmtParseError("invalid command, nested quantifier expected", list.end);
756
+ const terms = list.items[2];
757
+ if (terms?.kind !== "list")
758
+ throw new SmtParseError("invalid command, '(' expected", terms ?? list.end);
759
+ const args = terms.items.map((item) => state.reader.parseTerm(item));
760
+ const sorts = manager.getQuantifier(quantifier).sorts;
761
+ if (args.length !== sorts.length)
762
+ throw new SmtParseError(
763
+ "invalid command, mismatch between the number of quantified variables and the number of arguments.",
764
+ list.end,
765
+ );
766
+ for (let index = args.length - 1; index >= 0; index--)
767
+ if (manager.sorts[args[index]] !== sorts[index])
768
+ throw new SmtParseError(`invalid command, sort mismatch at position ${index}`, list.end);
769
+ const subst = new VarSubst(manager, true);
770
+ const substituted = subst.apply(manager.getQuantifier(quantifier).body, args);
771
+ subst.release();
772
+ const shifter = new InvVarShifter(manager);
773
+ const result = shifter.shift(substituted, args.length);
774
+ shifter.release();
775
+ display(result);
776
+ manager.decRef(result);
777
+ manager.decRef(substituted);
778
+ };
779
+ // parser::parse_func_decl_ref: a name, or a name with its signature. Z3 ends the message of an
780
+ // unexpected token with the last identifier it read.
781
+ const getFuncDeclRef = (reference: SExpr) => {
782
+ if (isSymbol(reference)) {
783
+ const decls = state.reader.getFuncs(reference.text);
784
+ if (decls.length > 1)
785
+ throw new SmtParseError(
786
+ `ambiguous function declaration reference, provide full signature to disambiguate (<symbol> (<sort>*) <sort>) ${reference.text}`,
787
+ reference,
788
+ );
789
+ if (decls.length === 0)
790
+ throw new SmtParseError(
791
+ `invalid function declaration reference, unknown function ${reference.text}`,
792
+ reference,
793
+ );
794
+ return decls[0];
795
+ }
796
+ const name = reference.kind === "list" ? (reference.items[0] ?? reference.end) : reference;
797
+ if (reference.kind !== "list" || name.kind !== "symbol") {
798
+ if (name.kind === "list")
799
+ throw new SmtUnsupportedError("an indexed function declaration reference");
800
+ throw new SmtParseError(
801
+ "invalid function declaration reference, symbol or '(' expected got query",
802
+ name,
803
+ );
804
+ }
805
+ const domain = reference.items[1] ?? reference.end;
806
+ if (domain.kind !== "list")
807
+ throw new SmtParseError(
808
+ `Invalid function name. Expecting sort list starting with '(' to disambiguate function name got ${domain.kind === "symbol" || domain.kind === "keyword" ? domain.text : name.text}`,
809
+ domain,
810
+ );
811
+ const sorts = domain.items.map((sort) => state.reader.parseSort(sort));
812
+ if (reference.items[2] === undefined)
813
+ throw new SmtParseError("Invalid function name invalid sort, unexpected ')'", reference.end);
814
+ const range = state.reader.parseSort(reference.items[2]);
815
+ const follower = reference.items[3] ?? reference.end;
816
+ const found = state.reader.getFuncs(name.text).find((decl) => {
817
+ const funcDecl = state.manager.funcDecls[decl];
818
+ return (
819
+ funcDecl.range === range &&
820
+ funcDecl.domain.length === sorts.length &&
821
+ funcDecl.domain.every((sort, index) => sort === sorts[index])
822
+ );
823
+ });
824
+ if (found === undefined)
825
+ throw new SmtParseError(
826
+ `invalid function declaration reference, unknown indexed function ${name.text}`,
827
+ follower,
828
+ );
829
+ if (follower !== reference.end)
830
+ throw new SmtUnsupportedError("a function declaration reference with trailing terms");
831
+ return found;
832
+ };
833
+ const runCommand = new Map<string, (list: SmtList) => void>([
834
+ [
835
+ "assert",
836
+ (list) => {
837
+ const term = list.items[1] ?? list.end;
838
+ const assertion = state.reader.parseAssertion(term);
839
+ const logicError = state.reader.getLogicError(assertion.formula);
840
+ if (logicError !== undefined) {
841
+ state.manager.decRef(assertion.formula);
842
+ throw new SmtParseError(logicError, list.end);
843
+ }
844
+ state.assertions.push(assertion.formula);
845
+ state.assertionTexts.push(
846
+ text.slice(term.offset, (term.kind === "list" ? term.end : term).endOffset).trim(),
847
+ );
848
+ if (state.hasChecked) state.isIncremental = true;
849
+ resetOptimizer();
850
+ if (!settings.isProducingUnsatCores || assertion.name === undefined) state.names.push(-1);
851
+ else {
852
+ const manager = state.manager;
853
+ const answer = manager.mkApp(
854
+ manager.mkFuncDecl(assertion.name, [], SORT_BOOL, true),
855
+ [],
856
+ SORT_BOOL,
857
+ );
858
+ manager.incRef(answer);
859
+ state.names.push(answer);
860
+ }
861
+ assertInKernel(assertion.formula, state.names[state.names.length - 1]);
862
+ clearCheck();
863
+ },
864
+ ],
865
+ ["check-sat", (list) => checkSatAssuming(list.items.slice(1))],
866
+ [
867
+ "declare-rel",
868
+ (list) => {
869
+ const name = list.items[1];
870
+ const domain = list.items[2];
871
+ if (!isSymbol(name) || domain?.kind !== "list")
872
+ throw new SmtParseError("at least 2 arguments expected", list.end);
873
+ const decl = state.manager.mkFuncDecl(
874
+ name.text,
875
+ domain.items.map((sort) => state.reader.parseSort(sort)),
876
+ SORT_BOOL,
877
+ );
878
+ state.reader.insertFunc(decl, list.end);
879
+ getDatalog().registerPredicate(decl);
880
+ },
881
+ ],
882
+ [
883
+ "declare-var",
884
+ (list) => {
885
+ const name = list.items[1];
886
+ const sort = list.items[2];
887
+ if (!isSymbol(name) || sort === undefined)
888
+ throw new SmtParseError(
889
+ "invalid declare-var command, symbol and sort expected",
890
+ list.end,
891
+ );
892
+ const manager = state.manager;
893
+ const range = state.reader.parseSort(sort);
894
+ const decl = manager.mkFuncDecl(name.text, [], range);
895
+ state.reader.insertFunc(decl, list.end);
896
+ getDatalog().registerVariable(manager.mkApp(decl, [], range));
897
+ },
898
+ ],
899
+ [
900
+ "rule",
901
+ (list) => {
902
+ const rule = list.items[1];
903
+ if (rule === undefined) throw new SmtParseError("invalid rule, expected formula", list.end);
904
+ const name = list.items[2];
905
+ getDatalog().addRule(state.reader.parseFormula(rule), isSymbol(name) ? name.text : "");
906
+ },
907
+ ],
908
+ [
909
+ "query",
910
+ (list) => {
911
+ if (list.items[1] === undefined)
912
+ throw new SmtParseError("invalid query command, argument expected", list.end);
913
+ const relation = getFuncDeclRef(list.items[1]);
914
+ const datalog = getDatalog();
915
+ // dl_query_cmd::set_next_arg runs once the parser is past the reference.
916
+ const follower = list.items[2] ?? list.end;
917
+ if (!datalog.isPredicateDecl(relation))
918
+ throw new SmtParseError(
919
+ "Invalid query argument, expected a predicate registered as a relation",
920
+ follower,
921
+ );
922
+ if (follower.kind !== "keyword" && follower !== list.end)
923
+ throw new SmtParseError("invalid command argument, keyword expected", follower);
924
+ for (const assertion of state.assertions) datalog.assertExpr(assertion);
925
+ state.manager.limit.restart(Date.now() + options.timeLimitMs);
926
+ state.manager.limit.push(settings.rlimit);
927
+ try {
928
+ print(getVerdict(datalog.relQuery(relation)));
929
+ } catch (error) {
930
+ if (!(error instanceof SmtTacticError)) throw error;
931
+ print(`(error "query failed: ${error.message}")`);
932
+ print("unknown");
933
+ } finally {
934
+ state.manager.limit.pop();
935
+ }
936
+ },
937
+ ],
938
+ [
939
+ "check-sat-using",
940
+ (list) => {
941
+ const params = getCommandParams(list.items, CHECK_SAT_USING_PARAMETERS);
942
+ if (list.items[1] === undefined)
943
+ throw new SmtParseError("check-sat-using needs a tactic argument", list.end);
944
+ const builder = getTactic(list.items[1], list.end);
945
+ const tactic = builder.build(params);
946
+ clearCheck();
947
+ state.manager.limit.restart(Date.now() + options.timeLimitMs);
948
+ state.manager.limit.push(settings.rlimit);
949
+ try {
950
+ const checked = checkSatUsing(tactic, getGoal(builder.isTrackingDependencies));
951
+ setCheck(checked.status, {
952
+ model: checked.model,
953
+ core:
954
+ builder.isTrackingDependencies || !hasNames()
955
+ ? getDependencyValues(checked.core)
956
+ : undefined,
957
+ reasonUnknown: checked.reasonUnknown,
958
+ });
959
+ print(getVerdict(checked.status));
960
+ } finally {
961
+ state.manager.limit.pop();
962
+ }
963
+ },
964
+ ],
965
+ [
966
+ "check-sat-assuming",
967
+ (list) => {
968
+ const literals = list.items[1];
969
+ if (literals?.kind !== "list")
970
+ throw new SmtParseError(
971
+ "invalid check-sat-assuming command, '(' expected",
972
+ literals ?? list.end,
973
+ );
974
+ checkSatAssuming(literals.items);
975
+ },
976
+ ],
977
+ [
978
+ "get-consequences",
979
+ (list) => {
980
+ const manager = state.manager;
981
+ const [assumptions, vars] = [list.items[1], list.items[2]].map((terms) => {
982
+ if (terms === undefined)
983
+ throw new SmtParseError("invalid command, argument(s) missing", list.end);
984
+ if (terms.kind !== "list")
985
+ throw new SmtParseError("invalid list of terms, '(' expected", terms);
986
+ return terms.items.map((item) => state.reader.parseTerm(item));
987
+ });
988
+ if (list.items.length > 3)
989
+ throw new SmtParseError("invalid command, too many arguments", list.items[3]);
990
+ clearCheck();
991
+ manager.limit.restart(Date.now() + options.timeLimitMs);
992
+ manager.limit.push(settings.rlimit);
993
+ const names = state.names.filter((name) => name !== -1);
994
+ try {
995
+ if (isUsingFdSolver()) {
996
+ if (names.length > 0)
997
+ throw new SmtUnsupportedError("the named assertions of the finite-domain solver");
998
+ const found = getFdConsequences(
999
+ manager,
1000
+ new Map(),
1001
+ state.assertions,
1002
+ assumptions,
1003
+ vars,
1004
+ );
1005
+ setCheck(found.result, { model: found.model });
1006
+ print(getVerdict(found.result));
1007
+ print("");
1008
+ for (const consequence of found.consequences.items) display(consequence);
1009
+ found.consequences.reset();
1010
+ return;
1011
+ }
1012
+ const kernel = state.kernel ?? new SmtKernel(manager, getKernelParams());
1013
+ if (state.kernel === undefined)
1014
+ for (const assertion of getNamedAssertions()) kernel.assertExpr(assertion);
1015
+ const found = getConsequences(kernel, [...names, ...assumptions], vars);
1016
+ setCheck(found.result, { context: kernel.context, core: kernel.context.unsatCore });
1017
+ print(getVerdict(found.result));
1018
+ print("");
1019
+ for (const consequence of found.consequences.items) display(consequence);
1020
+ found.consequences.reset();
1021
+ } finally {
1022
+ manager.limit.pop();
1023
+ }
1024
+ },
1025
+ ],
1026
+ ["minimize", (list) => addObjective(list, false)],
1027
+ ["maximize", (list) => addObjective(list, true)],
1028
+ [
1029
+ "assert-soft",
1030
+ (list) => {
1031
+ const formula = state.reader.parseTerm(list.items[1] ?? list.end);
1032
+ if (state.manager.sorts[formula] !== SORT_BOOL)
1033
+ throw new SmtParseError("Invalid type for expression. Expected Boolean type.", list.end);
1034
+ const parameters = getSoftParameters(list.items.slice(2));
1035
+ resetOptimizer();
1036
+ const existing = state.objectives.findIndex(
1037
+ (objective) => objective.type === O_MAXSMT && objective.id === parameters.id,
1038
+ );
1039
+ const index = existing === -1 ? state.objectives.length : existing;
1040
+ if (existing === -1)
1041
+ state.objectives.push({
1042
+ type: O_MAXSMT,
1043
+ term: -1,
1044
+ terms: [],
1045
+ weights: [],
1046
+ id: parameters.id,
1047
+ });
1048
+ if (parameters.weight.isZero()) return;
1049
+ state.manager.incRef(formula);
1050
+ state.objectives[index].terms.push(formula);
1051
+ state.objectives[index].weights.push(parameters.weight);
1052
+ state.softTrail.push(index);
1053
+ },
1054
+ ],
1055
+ [
1056
+ "push",
1057
+ (list) => {
1058
+ clearCheck();
1059
+ for (let index = getScopeCount(list); index > 0; index--) {
1060
+ state.scopes.push({
1061
+ assertions: state.assertions.length,
1062
+ objectives: state.objectives.length,
1063
+ softTrail: state.softTrail.length,
1064
+ });
1065
+ state.reader.push();
1066
+ state.isIncremental = true;
1067
+ state.kernel?.push();
1068
+ useEufSolver((solver) => solver.push());
1069
+ }
1070
+ },
1071
+ ],
1072
+ [
1073
+ "pop",
1074
+ (list) => {
1075
+ const count = getScopeCount(list);
1076
+ if (count > state.scopes.length)
1077
+ throw new SmtParseError(
1078
+ "invalid pop command, argument is greater than the current stack depth",
1079
+ list.end,
1080
+ );
1081
+ clearCheck();
1082
+ if (count === 0) return;
1083
+ state.isIncremental = true;
1084
+ const scope = state.scopes[state.scopes.length - count];
1085
+ state.kernel?.pop(count);
1086
+ useEufSolver((solver) => solver.pop(count));
1087
+ for (let index = 0; index < count; index++) state.reader.pop();
1088
+ restoreAssertions(scope.assertions);
1089
+ resetOptimizer();
1090
+ releaseObjectives(scope.objectives, scope.softTrail);
1091
+ state.scopes.length -= count;
1092
+ },
1093
+ ],
1094
+ [
1095
+ "reset",
1096
+ () => {
1097
+ clearCheck();
1098
+ resetOptimizer();
1099
+ state = createState();
1100
+ },
1101
+ ],
1102
+ [
1103
+ "reset-assertions",
1104
+ () => {
1105
+ clearCheck();
1106
+ restoreAssertions(0);
1107
+ resetOptimizer();
1108
+ releaseObjectives(0, 0);
1109
+ state.scopes = state.scopes.map(() => ({ assertions: 0, objectives: 0, softTrail: 0 }));
1110
+ if (state.isProofsEnabled !== undefined) resetKernel();
1111
+ state.isIncremental = state.scopes.length > 0;
1112
+ state.hasChecked = false;
1113
+ },
1114
+ ],
1115
+ [
1116
+ "simplify",
1117
+ (list) => {
1118
+ const manager = state.manager;
1119
+ if (list.items.length < 2)
1120
+ throw new SmtParseError("invalid simplify command, argument expected", list.end);
1121
+ const term = state.reader.parseTerm(list.items[1]);
1122
+ manager.incRef(term);
1123
+ const rewriter = new Rewriter(
1124
+ manager,
1125
+ getRewriterOptions(manager, getSimplifyParams(list.items.slice(2))),
1126
+ );
1127
+ const simplified = rewriter.rewrite(term);
1128
+ rewriter.cleanup();
1129
+ display(simplified);
1130
+ rewriter.release();
1131
+ manager.decRef(simplified);
1132
+ manager.decRef(term);
1133
+ },
1134
+ ],
1135
+ // The Boolean rewriter alone matches the simplifier only on Boolean structure over constants.
1136
+ [
1137
+ "dbg-bool-flat-rewriter",
1138
+ (list) => {
1139
+ const manager = state.manager;
1140
+ if (list.items.length !== 2)
1141
+ throw new SmtParseError("invalid command, one argument expected", list.end);
1142
+ const term = state.reader.parseTerm(list.items[1]);
1143
+ manager.incRef(term);
1144
+ const visited = new Set<number>();
1145
+ const todo = [term];
1146
+ while (todo.length > 0) {
1147
+ const expr = todo.pop() as number;
1148
+ if (visited.has(expr)) continue;
1149
+ visited.add(expr);
1150
+ const family = manager.kinds[expr] === KIND_APP ? manager.getFamily(expr) : -1;
1151
+ if (family !== FAMILY_BASIC && family !== FAMILY_USER && !manager.isNumeral(expr))
1152
+ throw new SmtUnsupportedError(
1153
+ "the command dbg-bool-flat-rewriter beyond Boolean terms",
1154
+ );
1155
+ manager.pushArgs(expr, todo);
1156
+ }
1157
+ const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
1158
+ const rewritten = rewriter.rewrite(term);
1159
+ display(rewritten);
1160
+ rewriter.release();
1161
+ manager.decRef(rewritten);
1162
+ manager.decRef(term);
1163
+ },
1164
+ ],
1165
+ [
1166
+ "apply",
1167
+ (list) => {
1168
+ const params = getCommandParams(list.items, APPLY_PARAMETERS);
1169
+ if (list.items[1] === undefined)
1170
+ throw new SmtParseError("apply needs a tactic argument", list.end);
1171
+ const builder = getTactic(list.items[1], list.end);
1172
+ const tactic = builder.build(params);
1173
+ const isPrintingDependencies = params.get("print_dependencies") === true;
1174
+ if (isPrintingDependencies && !builder.isTrackingDependencies && hasNames())
1175
+ throw new SmtUnsupportedError("the dependencies of a tactic that drops dependencies");
1176
+ state.manager.limit.restart(Date.now() + options.timeLimitMs);
1177
+ const input = getGoal(builder.isTrackingDependencies);
1178
+ const goals = (() => {
1179
+ try {
1180
+ return applyTactic(tactic, input);
1181
+ } catch (error) {
1182
+ if (!(error instanceof SmtTacticError)) throw error;
1183
+ print(`(error "tactic failed: ${error.message}")`);
1184
+ return undefined;
1185
+ }
1186
+ })();
1187
+ // apply_tactic_cmd releases the result goals and then the input goal.
1188
+ if (goals === undefined) {
1189
+ input.reset();
1190
+ return;
1191
+ }
1192
+ try {
1193
+ const manager = state.manager;
1194
+ const environment = getPrintEnvironment();
1195
+ if (params.get("print") !== false)
1196
+ print(
1197
+ [
1198
+ "(goals",
1199
+ ...goals.map((goal) =>
1200
+ [
1201
+ "(goal",
1202
+ ...goal.forms.items.flatMap((form, index) => [
1203
+ ...(isPrintingDependencies
1204
+ ? [
1205
+ [
1206
+ " |-",
1207
+ ...getDependencyValues(goal.getDependency(index)).map(format),
1208
+ ].join(" "),
1209
+ ]
1210
+ : []),
1211
+ ` ${printExpr(state.manager, environment, form, 2)}`,
1212
+ ]),
1213
+ ` :precision ${PRECISION_NAMES[goal.precision]} :depth ${goal.depth})`,
1214
+ ].join("\n"),
1215
+ ),
1216
+ ")",
1217
+ ].join("\n"),
1218
+ );
1219
+ if (
1220
+ params.get("print_model_converter") === true &&
1221
+ input.converters.some(
1222
+ (entry) => !("definitions" in entry) || entry.definitions.length > 0,
1223
+ )
1224
+ )
1225
+ throw new SmtUnsupportedError("printing a model converter");
1226
+ if (params.get("print_benchmark") !== true) return;
1227
+ const assertions =
1228
+ goals.length === 1
1229
+ ? goals[0].forms.items
1230
+ : [
1231
+ manager.mkOr(
1232
+ goals.map((goal) =>
1233
+ goal.forms.size === 1 ? goal.forms.items[0] : manager.mkAnd(goal.forms.items),
1234
+ ),
1235
+ ),
1236
+ ];
1237
+ for (const assertion of assertions) manager.incRef(assertion);
1238
+ const visited = new Set<number>();
1239
+ const decls = new Set<number>();
1240
+ for (const assertion of assertions) {
1241
+ const todo = [assertion];
1242
+ while (todo.length > 0) {
1243
+ const expr = todo.pop() as number;
1244
+ if (visited.has(expr)) continue;
1245
+ visited.add(expr);
1246
+ if (manager.kinds[expr] === KIND_QUANTIFIER) {
1247
+ const data = manager.getQuantifier(expr);
1248
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
1249
+ } else if (manager.kinds[expr] === KIND_APP) {
1250
+ manager.pushArgs(expr, todo);
1251
+ const decl = manager.decls[expr];
1252
+ const family = manager.funcDecls[decl].family;
1253
+ if (family === FAMILY_USER || family === FAMILY_MODEL_VALUE) decls.add(decl);
1254
+ }
1255
+ }
1256
+ }
1257
+ const lines = [...decls].map((decl) => {
1258
+ const funcDecl = manager.funcDecls[decl];
1259
+ return renderFormat(
1260
+ mkSeq1(
1261
+ [
1262
+ mkText(getQuotedName(funcDecl.name)),
1263
+ mkSeq5(funcDecl.domain.map((sort) => formatSort(manager, sort))),
1264
+ formatSort(manager, funcDecl.range),
1265
+ ],
1266
+ "declare-fun",
1267
+ ),
1268
+ environment.options,
1269
+ );
1270
+ });
1271
+ for (const assertion of assertions)
1272
+ lines.push(`(assert ${printExpr(manager, environment, assertion, 8)})`);
1273
+ print([...lines, "(check-sat)"].join("\n"));
1274
+ for (const assertion of assertions) manager.decRef(assertion);
1275
+ } finally {
1276
+ for (const goal of goals) if (goal !== input) goal.reset();
1277
+ input.reset();
1278
+ }
1279
+ },
1280
+ ],
1281
+ [
1282
+ "get-assertions",
1283
+ (list) => {
1284
+ if (!settings.isInteractive)
1285
+ throw new SmtParseError(
1286
+ "command is only available in interactive mode, use command (set-option :interactive-mode true)",
1287
+ list.end,
1288
+ );
1289
+ print(`(${state.assertionTexts.join("\n ")})`);
1290
+ },
1291
+ ],
1292
+ [
1293
+ "get-unsat-core",
1294
+ (list) => {
1295
+ if (!settings.isProducingUnsatCores)
1296
+ throw new SmtParseError(
1297
+ "unsat core construction is not enabled, use command (set-option :produce-unsat-cores true)",
1298
+ list.end,
1299
+ );
1300
+ const check = state.check;
1301
+ if (check === undefined || check.status !== L_FALSE)
1302
+ throw new SmtParseError("unsat core is not available", list.end);
1303
+ if (check.core === undefined)
1304
+ throw new SmtUnsupportedError("the unsat core of a tactic that drops dependencies");
1305
+ print(`(${check.core.map(format).join(" ")})`);
1306
+ },
1307
+ ],
1308
+ [
1309
+ "eval",
1310
+ (list) => {
1311
+ const target = list.items[1];
1312
+ const term = target === undefined ? -1 : state.reader.parseTerm(target);
1313
+ if (list.items.length > 2) throw new SmtUnsupportedError("the parameters of eval");
1314
+ const model = getModel(list);
1315
+ if (term === -1) throw new SmtParseError("no arguments passed to eval", list.end);
1316
+ const manager = state.manager;
1317
+ manager.incRef(term);
1318
+ const value = model.eval(term, false);
1319
+ display(value);
1320
+ manager.decRef(value);
1321
+ manager.decRef(term);
1322
+ },
1323
+ ],
1324
+ [
1325
+ "get-value",
1326
+ (list) => {
1327
+ const terms = list.items[1];
1328
+ if (terms?.kind !== "list")
1329
+ throw new SmtParseError("invalid get-value command, '(' expected", terms ?? list.end);
1330
+ const manager = state.manager;
1331
+ const exprs = terms.items.map((item) => state.reader.parseTerm(item));
1332
+ if (exprs.length === 0)
1333
+ throw new SmtParseError("invalid get-value command, empty list of terms", terms.end);
1334
+ if (list.items.length > 2) throw new SmtUnsupportedError("the parameters of get-value");
1335
+ const model = getModel(list);
1336
+ model.compact();
1337
+ // Z3 prints each term as the script spells it, from the end of the term before.
1338
+ const offsets = [
1339
+ terms.offset + 1,
1340
+ ...terms.items.map((item) => (item.kind === "list" ? item.end : item).endOffset),
1341
+ ];
1342
+ const lines = exprs.map((expr, index) => {
1343
+ manager.incRef(expr);
1344
+ const value = model.eval(expr, true);
1345
+ const line = `(${text.slice(offsets[index], offsets[index + 1]).trim()} ${format(value)})`;
1346
+ manager.decRef(value);
1347
+ manager.decRef(expr);
1348
+ return line;
1349
+ });
1350
+ print(`(${lines.join("\n ")})`);
1351
+ },
1352
+ ],
1353
+ [
1354
+ "get-objectives",
1355
+ () => {
1356
+ const optimizer = state.optimizer;
1357
+ if (optimizer === undefined || state.check === undefined)
1358
+ throw new SmtUnsupportedError("the command get-objectives");
1359
+ print(optimizer.getObjectives(format));
1360
+ },
1361
+ ],
1362
+ [
1363
+ "get-model",
1364
+ (list) => {
1365
+ if (list.items.length > 1) throw new SmtUnsupportedError("the index of get-model");
1366
+ const manager = state.manager;
1367
+ const model = getModel(list);
1368
+ model.compact();
1369
+ for (const decl of state.reader.getDeclaredFuncs()) {
1370
+ const funcDecl = manager.funcDecls[decl];
1371
+ if (
1372
+ funcDecl.family !== FAMILY_USER ||
1373
+ model.constInterps.has(decl) ||
1374
+ model.funcInterps.has(decl)
1375
+ )
1376
+ continue;
1377
+ const value = model.getSomeValue(funcDecl.range);
1378
+ if (funcDecl.domain.length === 0) {
1379
+ model.registerConst(decl, value);
1380
+ continue;
1381
+ }
1382
+ const interp = new FuncInterp(manager, funcDecl.domain.length);
1383
+ interp.setElse(value);
1384
+ model.registerFunc(decl, interp);
1385
+ }
1386
+ model.addRecFuns();
1387
+ print(`(\n${printModel(manager, getPrintEnvironment(), model, 2)})`);
1388
+ },
1389
+ ],
1390
+ ["display", (list) => display(state.reader.parseTerm(list.items[1] ?? list.end))],
1391
+ [
1392
+ "dbg-lt",
1393
+ (list) => {
1394
+ const first = state.reader.parseTerm(list.items[1] ?? list.end);
1395
+ const second = state.reader.parseTerm(list.items[2] ?? list.end);
1396
+ print(String(isAstLess(state.manager, first, second)));
1397
+ },
1398
+ ],
1399
+ [
1400
+ "dbg-some-value",
1401
+ (list) => {
1402
+ display(
1403
+ getManagerSomeValue(state.manager, state.reader.parseSort(list.items[1] ?? list.end)),
1404
+ );
1405
+ },
1406
+ ],
1407
+ [
1408
+ "dbg-used-vars",
1409
+ (list) => {
1410
+ const manager = state.manager;
1411
+ const term = state.reader.parseTerm(list.items[1] ?? list.end);
1412
+ const body =
1413
+ manager.kinds[term] === KIND_QUANTIFIER ? manager.getQuantifier(term).body : term;
1414
+ const sorts = getFreeVarSorts(manager, body, manager.freeVarBounds[body]);
1415
+ const lines = sorts.map(
1416
+ (sort, index) =>
1417
+ `\n (${String(index).padEnd(6)} ${sort === undefined ? "<not-used>" : renderFormat(formatSort(manager, sort), settings.printOptions)})`,
1418
+ );
1419
+ print(`(vars${lines.join("")})`);
1420
+ },
1421
+ ],
1422
+ [
1423
+ "dbg-elim-unused-vars",
1424
+ (list) => {
1425
+ const manager = state.manager;
1426
+ const term = state.reader.parseTerm(list.items[1] ?? list.end);
1427
+ if (manager.kinds[term] !== KIND_QUANTIFIER) {
1428
+ write(format(term), false);
1429
+ return;
1430
+ }
1431
+ display(elimUnusedVars(manager, term));
1432
+ },
1433
+ ],
1434
+ ["dbg-instantiate", (list) => instantiate(list, false)],
1435
+ ["dbg-instantiate-nested", (list) => instantiate(list, true)],
1436
+ [
1437
+ "echo",
1438
+ (list) => {
1439
+ const message = list.items[1];
1440
+ if (message?.kind !== "string")
1441
+ throw new SmtParseError("invalid echo command, string expected", message ?? list.end);
1442
+ print(message.text);
1443
+ },
1444
+ ],
1445
+ [
1446
+ "set-option",
1447
+ (list) => {
1448
+ const option = list.items[1];
1449
+ const keyword = option?.kind === "keyword" ? option.text : "";
1450
+ const optionName = `:${getParameterName(keyword)}`;
1451
+ const value = list.items[2];
1452
+ const isTrue = isSymbol(value, "true");
1453
+ if (keyword === ":produce-models") settings.isProducingModels = isTrue;
1454
+ if (keyword === ":produce-unsat-cores") settings.isProducingUnsatCores = isTrue;
1455
+ if (keyword === ":produce-proofs") settings.isProducingProofs = isTrue;
1456
+ if (keyword === ":interactive-mode") settings.isInteractive = isTrue;
1457
+ if (keyword === ":diagnostic-output-channel")
1458
+ settings.isDiagnosticOnStdout = value?.kind === "string" && value.text === "stdout";
1459
+ if (keyword === ":int-real-coercions" && !isTrue)
1460
+ throw new SmtUnsupportedError("the option :int-real-coercions false");
1461
+ if (keyword === ":error-behavior") {
1462
+ if (!isSymbol(value, "immediate-exit") && !isSymbol(value, "continued-execution"))
1463
+ throw new SmtParseError(
1464
+ "error setting :error-behavior, 'immediate-execution' or 'continued-execution' expected",
1465
+ list.end,
1466
+ );
1467
+ settings.isExitingOnError = isSymbol(value, "immediate-exit");
1468
+ }
1469
+ if (
1470
+ keyword !== "" &&
1471
+ !BUILTIN_OPTIONS.has(keyword) &&
1472
+ value !== undefined &&
1473
+ value.kind !== "list"
1474
+ )
1475
+ settings.parameters.set(getParameterName(keyword), value.text);
1476
+ if (optionName === ":print_success") settings.isPrintingSuccess = isTrue;
1477
+ if (
1478
+ !BUILTIN_OPTIONS.has(keyword) &&
1479
+ settings.parameters.get("smtlib2_compliant") === "true"
1480
+ )
1481
+ settings.isPrintingSuccess = true;
1482
+ if (optionName === ":smt.mbqi") settings.isMbqi = isTrue;
1483
+ if (optionName === ":smt.macro_finder") settings.isFindingMacros = isTrue;
1484
+ if (optionName === ":smt.mbqi.max_iterations" && value?.kind === "numeral")
1485
+ settings.mbqiMaxIterations = Number(value.text);
1486
+ if (optionName === ":rlimit" && value?.kind === "numeral")
1487
+ settings.rlimit = Number(value.text);
1488
+ if (optionName === ":rewriter.hi_div0") {
1489
+ settings.isHiDiv0 = isTrue;
1490
+ state.manager.isHiDiv0 = isTrue;
1491
+ }
1492
+ if (optionName === ":encoding" && value !== undefined && value.kind !== "list") {
1493
+ settings.encoding = ENCODINGS.get(value.text) ?? UNICODE_ENCODING;
1494
+ state.manager.maxChar = settings.encoding.maxChar;
1495
+ state.manager.charBits = settings.encoding.charBits;
1496
+ }
1497
+ if (optionName === ":parser.ignore_bad_patterns")
1498
+ settings.parserOptions.isIgnoringBadPatterns = isTrue;
1499
+ const numericOption = NUMERIC_PRINT_OPTIONS.get(optionName);
1500
+ if (numericOption !== undefined && value?.kind === "numeral")
1501
+ settings.printOptions[numericOption] = Number(value.text);
1502
+ const booleanOption = BOOLEAN_PRINT_OPTIONS.get(optionName);
1503
+ if (booleanOption !== undefined) settings.printOptions[booleanOption] = isTrue;
1504
+ if (
1505
+ optionName.startsWith(":pp.") &&
1506
+ numericOption === undefined &&
1507
+ booleanOption === undefined
1508
+ )
1509
+ throw new SmtUnsupportedError(`the option ${optionName}`);
1510
+ },
1511
+ ],
1512
+ [
1513
+ "get-option",
1514
+ (list) => {
1515
+ const option = list.items[1];
1516
+ if (option?.kind !== "keyword")
1517
+ throw new SmtParseError("invalid command argument, keyword expected", option ?? list.end);
1518
+ const builtinValues = new Map<string, boolean | string>([
1519
+ [":print-success", settings.isPrintingSuccess],
1520
+ [":produce-models", settings.isProducingModels],
1521
+ [":produce-unsat-cores", settings.isProducingUnsatCores],
1522
+ [":int-real-coercions", true],
1523
+ [":error-behavior", settings.isExitingOnError ? "immediate-exit" : "continued-execution"],
1524
+ ]);
1525
+ const name = getParameterName(option.text);
1526
+ const value =
1527
+ builtinValues.get(option.text) ??
1528
+ (BUILTIN_OPTIONS.has(option.text)
1529
+ ? undefined
1530
+ : (settings.parameters.get(name) ?? PARAMETER_DEFAULTS.get(name)));
1531
+ if (value === undefined) throw new SmtUnsupportedError(`the option ${option.text}`);
1532
+ print(String(value));
1533
+ },
1534
+ ],
1535
+ [
1536
+ "get-info",
1537
+ (list) => {
1538
+ const info = list.items[1];
1539
+ if (info?.kind !== "keyword")
1540
+ throw new SmtParseError("invalid command argument, keyword expected", info ?? list.end);
1541
+ const optimizer = state.optimizer;
1542
+ const check = state.check;
1543
+ if (
1544
+ info.text === ":reason-unknown" &&
1545
+ check?.status === L_UNDEF &&
1546
+ optimizer !== undefined &&
1547
+ optimizer.reasonUnknown !== ""
1548
+ ) {
1549
+ print(`(:reason-unknown "${optimizer.reasonUnknown}")`);
1550
+ return;
1551
+ }
1552
+ const reasonUnknown =
1553
+ check === undefined
1554
+ ? "state of the most recent check-sat command is not known"
1555
+ : check.reasonUnknown;
1556
+ if (info.text === ":reason-unknown" && reasonUnknown !== undefined) {
1557
+ print(`(:reason-unknown "${reasonUnknown.replaceAll('"', '\\"')}")`);
1558
+ return;
1559
+ }
1560
+ if (info.text === ":rlimit") {
1561
+ print(`(:rlimit ${state.manager.limit.count})`);
1562
+ return;
1563
+ }
1564
+ if (info.text !== ":error-behavior")
1565
+ throw new SmtUnsupportedError(`the information ${info.text}`);
1566
+ print(
1567
+ `(:error-behavior ${settings.isExitingOnError ? "immediate-exit" : "continued-execution"})`,
1568
+ );
1569
+ },
1570
+ ],
1571
+ [
1572
+ "set-logic",
1573
+ (list) => {
1574
+ const logic = list.items[1];
1575
+ if (!isSymbol(logic))
1576
+ throw new SmtParseError("invalid logic name, symbol expected", logic ?? list.end);
1577
+ if (state.logic !== undefined)
1578
+ throw new SmtParseError("the logic has already been set", logic);
1579
+ if (state.assertions.length > 0)
1580
+ throw new SmtParseError("logic must be set before initialization", logic);
1581
+ if (!isSupportedLogic(logic.text)) {
1582
+ print("unsupported");
1583
+ printDiagnostic(
1584
+ `; ignoring unsupported logic ${logic.text} line: ${list.line} position: ${list.column}`,
1585
+ );
1586
+ return;
1587
+ }
1588
+ state.logic = logic.text;
1589
+ if (state.isProofsEnabled === undefined)
1590
+ state.reader = createSmtlibReader(state.manager, logic.text, settings.parserOptions);
1591
+ else {
1592
+ state.reader.restrictSorts(logic.text);
1593
+ // Deviation from Z3: its new solver starts without the open scopes, so it ignores their pop
1594
+ // and keeps what they asserted.
1595
+ resetKernel();
1596
+ }
1597
+ if (settings.isPrintingSuccess) print("success");
1598
+ },
1599
+ ],
1600
+ ["set-info", () => {}],
1601
+ ]);
1602
+ const run = (list: SmtList) => {
1603
+ const head = list.items[0];
1604
+ if (!isSymbol(head))
1605
+ throw new SmtParseError("invalid command, symbol expected", head ?? list.end);
1606
+ const command = DECLARATIONS.has(head.text)
1607
+ ? (declaration: SmtList) => state.reader.declareCommand(declaration)
1608
+ : runCommand.get(head.text);
1609
+ if (command === undefined) throw new SmtUnsupportedError(`the command ${head.text}`);
1610
+ if (!MANAGERLESS_COMMANDS.has(head.text) && state.isProofsEnabled === undefined) {
1611
+ state.isProofsEnabled = settings.parameters.get("proof") === "true";
1612
+ resetKernel();
1613
+ }
1614
+ command(list);
1615
+ if (settings.isPrintingSuccess && SILENT_COMMANDS.has(head.text)) print("success");
1616
+ };
1617
+ for (;;) {
1618
+ try {
1619
+ const list = commands.read();
1620
+ if (list === undefined || isSymbol(list.items[0], "exit")) break;
1621
+ run(list);
1622
+ } catch (error) {
1623
+ if (!(error instanceof SmtParseError)) throw error;
1624
+ report(error);
1625
+ if (settings.isExitingOnError) break;
1626
+ state.reader.reset();
1627
+ commands.skip(report);
1628
+ }
1629
+ }
1630
+ if (pendingText !== "") printLine(pendingText);
1631
+ };