tla-ts 0.0.4-dev.a0009b7 → 0.0.4-dev.a11a30a

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 (314) hide show
  1. package/README.md +32 -143
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +35 -1
  6. package/dist/index.d.ts +35 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +996 -0
  15. package/dist/prove.js +996 -0
  16. package/dist/run-cli.cjs +37 -47
  17. package/dist/run-cli.js +37 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/check.ts +1 -0
  26. package/src/codegen.ts +26 -7
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +63 -20
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +247 -69
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
  35. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  36. package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
  37. package/src/{obligations.ts → obligations/index.ts} +32 -16
  38. package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
  39. package/src/{obligation-module.ts → obligations/module.ts} +113 -121
  40. package/src/obligations/pickle.ts +98 -0
  41. package/src/obligations/pragma.ts +189 -0
  42. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  43. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  44. package/src/{obligation-source.ts → obligations/source.ts} +154 -99
  45. package/src/obligations/temporal.ts +321 -0
  46. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  47. package/src/ocaml-marshal.ts +166 -0
  48. package/src/parallel-worker.ts +2 -18
  49. package/src/parallel.ts +10 -43
  50. package/src/prove/decide-pool.ts +95 -0
  51. package/src/prove/deciders.ts +33 -0
  52. package/src/prove/first-order.ts +78 -0
  53. package/src/prove/isabelle/LICENSE +36 -0
  54. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  55. package/src/prove/isabelle/decide.ts +47 -0
  56. package/src/prove/isabelle/encode.ts +446 -0
  57. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  58. package/src/prove/isabelle/isar/method.ts +367 -0
  59. package/src/prove/isabelle/isar/proof.ts +28 -0
  60. package/src/prove/isabelle/isar/statement.ts +57 -0
  61. package/src/prove/isabelle/isar/theory.ts +192 -0
  62. package/src/prove/isabelle/isar/type-check.ts +278 -0
  63. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  64. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  65. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  66. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  67. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  68. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  69. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  70. package/src/prove/isabelle/provers/classical.ts +389 -0
  71. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  72. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  73. package/src/prove/isabelle/pure/consts.ts +32 -0
  74. package/src/prove/isabelle/pure/conv.ts +79 -0
  75. package/src/prove/isabelle/pure/drule.ts +264 -0
  76. package/src/prove/isabelle/pure/envir.ts +363 -0
  77. package/src/prove/isabelle/pure/goal.ts +53 -0
  78. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  79. package/src/prove/isabelle/pure/list.ts +12 -0
  80. package/src/prove/isabelle/pure/logic.ts +402 -0
  81. package/src/prove/isabelle/pure/name.ts +110 -0
  82. package/src/prove/isabelle/pure/net.ts +262 -0
  83. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  84. package/src/prove/isabelle/pure/pattern.ts +650 -0
  85. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  86. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  87. package/src/prove/isabelle/pure/search.ts +68 -0
  88. package/src/prove/isabelle/pure/seq.ts +156 -0
  89. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  90. package/src/prove/isabelle/pure/table.ts +208 -0
  91. package/src/prove/isabelle/pure/tactic.ts +276 -0
  92. package/src/prove/isabelle/pure/tactical.ts +347 -0
  93. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  94. package/src/prove/isabelle/pure/term.ts +808 -0
  95. package/src/prove/isabelle/pure/thm.ts +806 -0
  96. package/src/prove/isabelle/pure/type.ts +133 -0
  97. package/src/prove/isabelle/pure/unify.ts +753 -0
  98. package/src/prove/isabelle/pure/variable.ts +25 -0
  99. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  100. package/src/prove/isabelle/tla/context.ts +74 -0
  101. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  102. package/src/prove/isabelle/tla/logic.ts +215 -0
  103. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  104. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  105. package/src/prove/ocaml.ts +22 -0
  106. package/src/prove/prep/action.ts +508 -0
  107. package/src/prove/prep/defs.ts +33 -0
  108. package/src/prove/prep/elab.ts +156 -0
  109. package/src/prove/prep/enabled-axioms.ts +189 -0
  110. package/src/prove/prep/enabled.ts +43 -0
  111. package/src/prove/prep/fingerprint.ts +388 -0
  112. package/src/prove/prep/flatten.ts +70 -0
  113. package/src/prove/prep/level-comparison.ts +529 -0
  114. package/src/prove/prep/md5.ts +67 -0
  115. package/src/prove/prep/pragma.ts +221 -0
  116. package/src/prove/prep/trivial.ts +22 -0
  117. package/src/prove/prove-worker.ts +22 -0
  118. package/src/prove/prove.ts +498 -0
  119. package/src/prove/ptl/decide.ts +68 -0
  120. package/src/prove/ptl/encode.ts +255 -0
  121. package/src/prove/ptl/sat.ts +151 -0
  122. package/src/prove/ptl/tableau.ts +276 -0
  123. package/src/prove/smt/axiomatize.ts +69 -0
  124. package/src/prove/smt/axioms.ts +209 -0
  125. package/src/prove/smt/context.ts +108 -0
  126. package/src/prove/smt/data.ts +636 -0
  127. package/src/prove/smt/encode.ts +164 -0
  128. package/src/prove/smt/extensionality.ts +65 -0
  129. package/src/prove/smt/flatten.ts +112 -0
  130. package/src/prove/smt/format.ts +154 -0
  131. package/src/prove/smt/instances.ts +181 -0
  132. package/src/prove/smt/rewrite.ts +772 -0
  133. package/src/prove/smt/simplify.ts +57 -0
  134. package/src/prove/smt/solver/act-cache.ts +265 -0
  135. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  136. package/src/prove/smt/solver/array.ts +22 -0
  137. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  138. package/src/prove/smt/solver/ast-lt.ts +157 -0
  139. package/src/prove/smt/solver/ast-util.ts +147 -0
  140. package/src/prove/smt/solver/ast.ts +1315 -0
  141. package/src/prove/smt/solver/auf-solver.ts +572 -0
  142. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  143. package/src/prove/smt/solver/cg-table.ts +175 -0
  144. package/src/prove/smt/solver/clause.ts +276 -0
  145. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  146. package/src/prove/smt/solver/context.ts +1292 -0
  147. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  148. package/src/prove/smt/solver/der.ts +224 -0
  149. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  150. package/src/prove/smt/solver/e-matching.ts +659 -0
  151. package/src/prove/smt/solver/enode.ts +259 -0
  152. package/src/prove/smt/solver/expr-ref.ts +21 -0
  153. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  154. package/src/prove/smt/solver/fingerprints.ts +92 -0
  155. package/src/prove/smt/solver/flat-literals.ts +51 -0
  156. package/src/prove/smt/solver/goal.ts +138 -0
  157. package/src/prove/smt/solver/hash.ts +173 -0
  158. package/src/prove/smt/solver/hashtable.ts +166 -0
  159. package/src/prove/smt/solver/internalizer.ts +1381 -0
  160. package/src/prove/smt/solver/lbool.ts +5 -0
  161. package/src/prove/smt/solver/literal.ts +24 -0
  162. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  163. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  164. package/src/prove/smt/solver/lp/containers.ts +296 -0
  165. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  166. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  167. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  168. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  169. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  170. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  171. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  172. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  173. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  174. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  175. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  176. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  177. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  178. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  179. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  180. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  181. package/src/prove/smt/solver/lp/nex.ts +120 -0
  182. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  183. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  184. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  185. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  186. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  187. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  188. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  189. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  190. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  191. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  192. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  193. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  194. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  195. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  196. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  197. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  198. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  199. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  200. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  201. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  202. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  203. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  204. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  205. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  206. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  207. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  208. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  209. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  210. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  211. package/src/prove/smt/solver/model-checker.ts +347 -0
  212. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  213. package/src/prove/smt/solver/model-finder.ts +155 -0
  214. package/src/prove/smt/solver/model-generator.ts +97 -0
  215. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  216. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  217. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  218. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  219. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  220. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  221. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  222. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  223. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  224. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  225. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  226. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  227. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  228. package/src/prove/smt/solver/nnf.ts +469 -0
  229. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  230. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  231. package/src/prove/smt/solver/propagate-values.ts +83 -0
  232. package/src/prove/smt/solver/proto-model.ts +551 -0
  233. package/src/prove/smt/solver/pull-quant.ts +139 -0
  234. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  235. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  236. package/src/prove/smt/solver/qe-lite.ts +381 -0
  237. package/src/prove/smt/solver/qi-queue.ts +362 -0
  238. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  239. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  240. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  241. package/src/prove/smt/solver/random-gen.ts +10 -0
  242. package/src/prove/smt/solver/rational.ts +165 -0
  243. package/src/prove/smt/solver/ref-vector.ts +62 -0
  244. package/src/prove/smt/solver/relevancy.ts +247 -0
  245. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  246. package/src/prove/smt/solver/rewriter.ts +843 -0
  247. package/src/prove/smt/solver/rlimit.ts +79 -0
  248. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  249. package/src/prove/smt/solver/solver.ts +71 -0
  250. package/src/prove/smt/solver/sort.ts +35 -0
  251. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  252. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  253. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  254. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  255. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  256. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  257. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  258. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  259. package/src/prove/smt/solver/theory-lra.ts +56 -0
  260. package/src/prove/smt/solver/var-subst.ts +258 -0
  261. package/src/prove/smt/solver/z3-license.txt +10 -0
  262. package/src/prove/smt/table.ts +170 -0
  263. package/src/prove/tlapm/tlapm.ts +96 -0
  264. package/src/prove/tlaps-module.ts +510 -0
  265. package/src/prove/verdict.ts +18 -0
  266. package/src/prove/zenon/LICENSE +32 -0
  267. package/src/prove/zenon/check/check.ts +105 -0
  268. package/src/prove/zenon/check/definitions.ts +144 -0
  269. package/src/prove/zenon/check/equality.ts +182 -0
  270. package/src/prove/zenon/check/functions.ts +62 -0
  271. package/src/prove/zenon/check/keys.ts +125 -0
  272. package/src/prove/zenon/check/propositional.ts +104 -0
  273. package/src/prove/zenon/check/records.ts +188 -0
  274. package/src/prove/zenon/check/relations.ts +121 -0
  275. package/src/prove/zenon/check/rewrites.ts +224 -0
  276. package/src/prove/zenon/check/sets.ts +302 -0
  277. package/src/prove/zenon/check/terms.ts +127 -0
  278. package/src/prove/zenon/check/tla.ts +126 -0
  279. package/src/prove/zenon/decide.ts +113 -0
  280. package/src/prove/zenon/encode.ts +379 -0
  281. package/src/prove/zenon/eqrel.ts +300 -0
  282. package/src/prove/zenon/equality-rules.ts +435 -0
  283. package/src/prove/zenon/expr.ts +551 -0
  284. package/src/prove/zenon/index-table.ts +350 -0
  285. package/src/prove/zenon/isar-case.ts +513 -0
  286. package/src/prove/zenon/isar.ts +1249 -0
  287. package/src/prove/zenon/limits.ts +15 -0
  288. package/src/prove/zenon/llproof.ts +173 -0
  289. package/src/prove/zenon/mltoll.ts +1566 -0
  290. package/src/prove/zenon/node.ts +297 -0
  291. package/src/prove/zenon/ocaml.ts +169 -0
  292. package/src/prove/zenon/parse.ts +247 -0
  293. package/src/prove/zenon/phrase.ts +191 -0
  294. package/src/prove/zenon/proof.ts +198 -0
  295. package/src/prove/zenon/propositional-rules.ts +387 -0
  296. package/src/prove/zenon/rules.ts +94 -0
  297. package/src/prove/zenon/search.ts +288 -0
  298. package/src/prove/zenon/tla/functions.ts +151 -0
  299. package/src/prove/zenon/tla/llproof.ts +480 -0
  300. package/src/prove/zenon/tla/records.ts +225 -0
  301. package/src/prove/zenon/tla/rewrites.ts +447 -0
  302. package/src/prove/zenon/tla/sets.ts +304 -0
  303. package/src/prove/zenon/tla/terms.ts +181 -0
  304. package/src/prove/zenon/tla/tla.ts +506 -0
  305. package/src/run-cli.ts +283 -81
  306. package/src/standard-modules.ts +5 -2
  307. package/src/successors.ts +24 -5
  308. package/src/tlapm-cache.ts +236 -0
  309. package/src/tlc-random.ts +55 -32
  310. package/src/tlc-version.ts +8 -7
  311. package/src/values.ts +97 -47
  312. package/src/worker.ts +65 -0
  313. package/dist/parallel.cjs +0 -12
  314. package/dist/parallel.js +0 -12
@@ -0,0 +1,526 @@
1
+ // Ported from Z3 (src/qe/lite/qe_lite_tactic.cpp, src/qe/mbp/mbp_solve_plugin.cpp), MIT license,
2
+ // see z3-license.txt. The eq_der of qe-lite: destructive equality resolution, which removes the
3
+ // variables of a quantifier that its body defines by an equality, with the solve plugins for
4
+ // Booleans and integer arithmetic.
5
+ import {
6
+ KIND_VAR,
7
+ OP_ADD,
8
+ OP_AND,
9
+ OP_EQ,
10
+ OP_IDIV,
11
+ OP_ITE,
12
+ OP_MOD,
13
+ OP_MUL,
14
+ OP_SUB,
15
+ OP_UMINUS,
16
+ SORT_BOOL,
17
+ SORT_INT,
18
+ type AstManager,
19
+ } from "./ast";
20
+ import { flattenAndVector, mkNot } from "./ast-util";
21
+ import { isOccurring } from "./der";
22
+ import { RefVector } from "./ref-vector";
23
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
24
+ import { BetaReducer } from "./rewriter-tpl";
25
+ import { assign, assignOwned, release } from "./expr-ref";
26
+
27
+ // A summand of a linear equation and whether it is on the left-hand side.
28
+ interface SignedExpr {
29
+ isLeft: boolean;
30
+ expr: number;
31
+ }
32
+
33
+ interface SolvedVar {
34
+ variable: number;
35
+ // Held by a reference that the receiver releases.
36
+ term: number;
37
+ }
38
+
39
+ // eq_der: destructive equality resolution on a conjunction.
40
+ export class EqDer {
41
+ private subst: BetaReducer;
42
+ private substMap: RefVector;
43
+ private newExprs: RefVector;
44
+ private rewriter: Rewriter;
45
+ private map: number[] = [];
46
+ private pos2var: number[] = [];
47
+ private var2pos: number[] = [];
48
+ private inx2var: number[] = [];
49
+ private order: number[] = [];
50
+ // is_variable_test: the variables of the quantifier at hand are those below this index.
51
+ numVars = 0;
52
+
53
+ constructor(private manager: AstManager) {
54
+ this.subst = new BetaReducer(manager);
55
+ this.substMap = new RefVector(manager);
56
+ this.newExprs = new RefVector(manager);
57
+ this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
58
+ }
59
+
60
+ private isVariable(expr: number) {
61
+ const manager = this.manager;
62
+ return manager.kinds[expr] === KIND_VAR && manager.values[expr] < this.numVars;
63
+ }
64
+
65
+ // operator(): reduce_var_set until nothing changes.
66
+ apply(conjs: RefVector) {
67
+ while (this.reduceVarSet(conjs));
68
+ this.newExprs.reset();
69
+ }
70
+
71
+ // ~eq_der.
72
+ release() {
73
+ this.rewriter.release();
74
+ this.newExprs.reset();
75
+ this.substMap.reset();
76
+ this.subst.release();
77
+ }
78
+
79
+ private reduceVarSet(conjs: RefVector) {
80
+ const manager = this.manager;
81
+ // flatten_definitions: a false conjunct is the whole conjunction.
82
+ const falseConj = conjs.items.find((conj) => manager.isFalse(conj));
83
+ if (falseConj !== undefined) {
84
+ conjs.set(0, falseConj);
85
+ conjs.shrink(1);
86
+ }
87
+ let isReduced = false;
88
+ const found = this.findDefinitions(conjs.items);
89
+ if (found.numDefs > 0) {
90
+ this.sortVars();
91
+ if (this.order.length > 0) {
92
+ const conjunction = manager.mkApp(OP_AND, conjs.items, SORT_BOOL);
93
+ manager.incRef(conjunction);
94
+ this.createSubstitution(found.largestIndex + 1);
95
+ let substituted = this.subst.rewriteWithBindings(conjunction, this.substMap.items);
96
+ substituted = assignOwned(manager, substituted, this.rewriter.rewrite(substituted));
97
+ conjs.reset();
98
+ conjs.push(substituted);
99
+ flattenAndVector(manager, conjs);
100
+ isReduced = true;
101
+ manager.decRef(substituted);
102
+ manager.decRef(conjunction);
103
+ }
104
+ }
105
+ return this.removeUnconstrained(conjs) || isReduced;
106
+ }
107
+
108
+ // find_definitions: one definition per variable, preferring values, then ground terms, then
109
+ // constants.
110
+ private findDefinitions(args: number[]) {
111
+ const manager = this.manager;
112
+ let numDefs = 0;
113
+ let largestIndex = 0;
114
+ this.map = [];
115
+ this.pos2var = args.map(() => -1);
116
+ this.var2pos = [];
117
+ this.inx2var = [];
118
+ args.forEach((arg, position) => {
119
+ manager.limit.checkpoint();
120
+ const vars: number[] = [];
121
+ const terms = new RefVector(manager);
122
+ let term = -1;
123
+ if (this.getVarEq(arg, vars, terms))
124
+ vars.forEach((variable, index) => {
125
+ term = assign(manager, term, terms.items[index]);
126
+ term = assignOwned(manager, term, this.rewriter.rewrite(term));
127
+ if (term !== terms.items[index]) this.newExprs.push(term);
128
+ const varIndex = manager.values[variable];
129
+ const old = this.map[varIndex] ?? -1;
130
+ if (old === -1) {
131
+ this.map[varIndex] = term;
132
+ this.inx2var[varIndex] = variable;
133
+ this.pos2var[position] = varIndex;
134
+ this.var2pos[varIndex] = position;
135
+ numDefs++;
136
+ largestIndex = Math.max(varIndex, largestIndex);
137
+ } else if (
138
+ manager.isUniqueValue(old) ||
139
+ !(
140
+ manager.isUniqueValue(term) ||
141
+ (manager.isGroundApp(term) && !manager.isGroundApp(old)) ||
142
+ manager.isUninterpretedConst(term)
143
+ )
144
+ )
145
+ return;
146
+ else {
147
+ this.pos2var[this.var2pos[varIndex]] = -1;
148
+ this.pos2var[position] = varIndex;
149
+ this.var2pos[varIndex] = position;
150
+ this.map[varIndex] = term;
151
+ }
152
+ this.newExprs.pushOwned(term);
153
+ term = -1;
154
+ });
155
+ release(manager, term);
156
+ terms.reset();
157
+ });
158
+ return { numDefs, largestIndex };
159
+ }
160
+
161
+ // is_var_eq: a variable and its definition from a literal, through the solve plugin of the sort.
162
+ private getVarEq(expr: number, vars: number[], terms: RefVector) {
163
+ const manager = this.manager;
164
+ const isEq = manager.getOp(expr) === OP_EQ;
165
+ if (isEq) {
166
+ const lhs = manager.getArg(expr, 0);
167
+ const rhs = manager.getArg(expr, 1);
168
+ const isSwapped = !this.isVariable(lhs);
169
+ if (this.isVariable(isSwapped ? rhs : lhs)) {
170
+ vars.push(isSwapped ? rhs : lhs);
171
+ terms.push(isSwapped ? lhs : rhs);
172
+ return true;
173
+ }
174
+ }
175
+ const sort = isEq ? manager.sorts[manager.getArg(expr, 0)] : manager.sorts[expr];
176
+ if (sort !== SORT_BOOL && sort !== SORT_INT) return false;
177
+ // solve_plugin::operator(): the arithmetic plugin only sees positive equalities.
178
+ const isNegated = manager.isNot(expr);
179
+ const solved =
180
+ sort === SORT_INT
181
+ ? this.solveArithEq(expr)
182
+ : this.solveBasic(isNegated ? manager.getArg(expr, 0) : expr, !isNegated);
183
+ const isFound =
184
+ solved !== expr &&
185
+ manager.getOp(solved) === OP_EQ &&
186
+ this.isVariable(manager.getArg(solved, 0));
187
+ if (isFound) {
188
+ vars.push(manager.getArg(solved, 0));
189
+ terms.push(manager.getArg(solved, 1));
190
+ }
191
+ manager.decRef(solved);
192
+ return isFound;
193
+ }
194
+
195
+ // arith_solve_plugin::is_invertible_const: a numeral that a variable's coefficient may be.
196
+ private getInvertibleConst(expr: number): bigint | undefined {
197
+ const manager = this.manager;
198
+ if (manager.getOp(expr) === OP_UMINUS) {
199
+ const inner = this.getInvertibleConst(manager.getArg(expr, 0));
200
+ return inner === undefined ? undefined : -inner;
201
+ }
202
+ const value = manager.getNumeral(expr);
203
+ return value === 1n || value === -1n ? value : undefined;
204
+ }
205
+
206
+ // arith_solve_plugin::is_invertible_mul: a variable times an invertible coefficient.
207
+ private getInvertibleMul(expr: number) {
208
+ const manager = this.manager;
209
+ if (this.isVariable(expr)) return { variable: expr, coefficient: 1n };
210
+ if (manager.getOp(expr) !== OP_MUL || manager.getNumArgs(expr) !== 2) return undefined;
211
+ const first = manager.getArg(expr, 0);
212
+ const second = manager.getArg(expr, 1);
213
+ const secondValue = this.getInvertibleConst(second);
214
+ if (this.isVariable(first) && secondValue !== undefined)
215
+ return { variable: first, coefficient: secondValue };
216
+ const firstValue = this.getInvertibleConst(first);
217
+ if (this.isVariable(second) && firstValue !== undefined)
218
+ return { variable: second, coefficient: firstValue };
219
+ return undefined;
220
+ }
221
+
222
+ // arith_solve_plugin::solve: lhs = rhs as variable = term.
223
+ private solveLinear(lhs: number, rhs: number): SolvedVar | undefined {
224
+ const manager = this.manager;
225
+ if (manager.sorts[lhs] !== SORT_INT) return undefined;
226
+ const todo: SignedExpr[] = [
227
+ { isLeft: true, expr: lhs },
228
+ { isLeft: false, expr: rhs },
229
+ ];
230
+ const done: SignedExpr[] = [];
231
+ for (let item = todo.pop(); item !== undefined; item = todo.pop()) {
232
+ const op = manager.getOp(item.expr);
233
+ if (op === OP_ADD)
234
+ for (let index = 0; index < manager.getNumArgs(item.expr); index++)
235
+ todo.push({ isLeft: item.isLeft, expr: manager.getArg(item.expr, index) });
236
+ else if (op === OP_SUB) {
237
+ todo.push({ isLeft: item.isLeft, expr: manager.getArg(item.expr, 0) });
238
+ for (let index = 1; index < manager.getNumArgs(item.expr); index++)
239
+ todo.push({ isLeft: !item.isLeft, expr: manager.getArg(item.expr, index) });
240
+ } else if (op === OP_UMINUS)
241
+ todo.push({ isLeft: !item.isLeft, expr: manager.getArg(item.expr, 0) });
242
+ else {
243
+ const mul = this.getInvertibleMul(item.expr);
244
+ if (mul === undefined) {
245
+ done.push(item);
246
+ continue;
247
+ }
248
+ done.push(...todo);
249
+ // mk_term: the other summands times the inverse of the coefficient, negated on the
250
+ // variable's side.
251
+ const coefficient = 1n / mul.coefficient;
252
+ const isLeft = item.isLeft;
253
+ const terms = new RefVector(manager);
254
+ for (const summand of done) {
255
+ const factor = summand.isLeft === isLeft ? -coefficient : coefficient;
256
+ terms.push(
257
+ factor === 1n
258
+ ? summand.expr
259
+ : manager.mkApp(OP_MUL, [manager.mkNumeral(factor), summand.expr], SORT_INT),
260
+ );
261
+ }
262
+ const term =
263
+ terms.size === 0
264
+ ? manager.mkNumeral(0n)
265
+ : terms.size === 1
266
+ ? terms.items[0]
267
+ : manager.mkApp(OP_ADD, terms.items, SORT_INT);
268
+ manager.incRef(term);
269
+ terms.reset();
270
+ return { variable: mul.variable, term };
271
+ }
272
+ }
273
+ return undefined;
274
+ }
275
+
276
+ // arith_solve_plugin::mk_eq_core.
277
+ private mkArithEqCore(inputLeft: number, inputRight: number) {
278
+ const manager = this.manager;
279
+ const solved = this.solveLinear(inputLeft, inputRight);
280
+ if (solved !== undefined) {
281
+ const result = manager.mkEq(solved.variable, solved.term);
282
+ manager.incRef(result);
283
+ manager.decRef(solved.term);
284
+ return result;
285
+ }
286
+ const isLeftZero = manager.getNumeral(inputLeft) === 0n;
287
+ const left = isLeftZero ? inputRight : inputLeft;
288
+ const right = isLeftZero ? inputLeft : inputRight;
289
+ const isBinarySum =
290
+ manager.getNumeral(right) === 0n &&
291
+ manager.getOp(left) === OP_ADD &&
292
+ manager.getNumArgs(left) === 2;
293
+ const negatedSecond = isBinarySum
294
+ ? manager.getTimesMinusOneArg(manager.getArg(left, 1))
295
+ : undefined;
296
+ const negatedFirst = isBinarySum
297
+ ? manager.getTimesMinusOneArg(manager.getArg(left, 0))
298
+ : undefined;
299
+ const result =
300
+ negatedSecond !== undefined
301
+ ? manager.mkEq(manager.getArg(left, 0), negatedSecond)
302
+ : negatedFirst !== undefined
303
+ ? manager.mkEq(manager.getArg(left, 1), negatedFirst)
304
+ : manager.mkEq(left, right);
305
+ manager.incRef(result);
306
+ return result;
307
+ }
308
+
309
+ // arith_solve_plugin::try_int_mul_solve: k*y = x becomes y = x div k and x mod k = 0, or x = 0
310
+ // when k is zero.
311
+ private tryIntMulSolve(atom: number) {
312
+ const manager = this.manager;
313
+ if (manager.sorts[manager.getArg(atom, 0)] !== SORT_INT) return -1;
314
+ const isMulOnLeft = manager.getOp(manager.getArg(atom, 1)) !== OP_MUL;
315
+ if (isMulOnLeft && manager.getOp(manager.getArg(atom, 0)) !== OP_MUL) return -1;
316
+ const lhs = manager.getArg(atom, isMulOnLeft ? 1 : 0);
317
+ const product = manager.getArg(atom, isMulOnLeft ? 0 : 1);
318
+ if (manager.getNumArgs(product) !== 2) return -1;
319
+ const isNumeralSecond = !manager.isNumeral(manager.getArg(product, 0));
320
+ if (isNumeralSecond && !manager.isNumeral(manager.getArg(product, 1))) return -1;
321
+ const first = manager.getArg(product, isNumeralSecond ? 1 : 0);
322
+ const second = manager.getArg(product, isNumeralSecond ? 0 : 1);
323
+ if (manager.getNumeralValue(first) === 0n) {
324
+ const result = manager.mkEq(lhs, manager.mkNumeral(0n));
325
+ manager.incRef(result);
326
+ return result;
327
+ }
328
+ const held = new RefVector(manager);
329
+ const quotientEq = manager.mkEq(second, manager.mkApp(OP_IDIV, [lhs, first], SORT_INT));
330
+ held.push(quotientEq);
331
+ const zero = manager.mkNumeral(0n);
332
+ held.push(zero);
333
+ const remainder = manager.mkApp(OP_MOD, [lhs, first], SORT_INT);
334
+ held.push(remainder);
335
+ const remainderEq = manager.mkEq(zero, remainder);
336
+ held.push(remainderEq);
337
+ const result = manager.mkApp(OP_AND, [quotientEq, remainderEq], SORT_BOOL);
338
+ manager.incRef(result);
339
+ held.items.reverse();
340
+ held.reset();
341
+ return result;
342
+ }
343
+
344
+ // arith_solve_plugin::solve on a positive equality.
345
+ private solveArithEq(atom: number) {
346
+ const manager = this.manager;
347
+ const mulSolved = this.tryIntMulSolve(atom);
348
+ if (mulSolved !== -1) return mulSolved;
349
+ const lhs = manager.getArg(atom, 0);
350
+ const rhs = manager.getArg(atom, 1);
351
+ let variable = assign(manager, -1, lhs);
352
+ let term = assign(manager, -1, rhs);
353
+ const solved = this.solveLinear(lhs, rhs);
354
+ if (solved !== undefined) {
355
+ variable = assign(manager, variable, solved.variable);
356
+ term = assignOwned(manager, term, solved.term);
357
+ }
358
+ const result = this.mkArithEqCore(variable, term);
359
+ manager.decRef(term);
360
+ manager.decRef(variable);
361
+ return result;
362
+ }
363
+
364
+ // basic_solve_plugin::solve.
365
+ private solveBasic(atom: number, isPositive: boolean): number {
366
+ const manager = this.manager;
367
+ let result = assign(manager, -1, atom);
368
+ if (manager.getOp(atom) === OP_EQ) {
369
+ const lhs = manager.getArg(atom, 0);
370
+ const rhs = manager.getArg(atom, 1);
371
+ if (manager.isNot(lhs) && this.isVariable(manager.getArg(lhs, 0)))
372
+ result = assign(manager, result, manager.mkEq(manager.getArg(lhs, 0), mkNot(manager, rhs)));
373
+ else if (manager.isNot(rhs) && this.isVariable(manager.getArg(rhs, 0)))
374
+ result = assign(manager, result, manager.mkEq(manager.getArg(rhs, 0), mkNot(manager, lhs)));
375
+ else if (this.isVariable(rhs) && !this.isVariable(lhs))
376
+ result = assign(manager, result, manager.mkEq(rhs, lhs));
377
+ }
378
+ if (manager.getOp(atom) === OP_ITE) {
379
+ const condition = manager.getArg(atom, 0);
380
+ const thenExpr = manager.getArg(atom, 1);
381
+ const elseExpr = manager.getArg(atom, 2);
382
+ const thenSolved = this.solveBasic(thenExpr, true);
383
+ const elseSolved = this.solveBasic(elseExpr, true);
384
+ if (
385
+ manager.getOp(thenSolved) === OP_EQ &&
386
+ manager.getOp(elseSolved) === OP_EQ &&
387
+ manager.getArg(thenSolved, 0) === manager.getArg(elseSolved, 0)
388
+ ) {
389
+ const thenTerm = manager.getArg(thenSolved, 1);
390
+ const ite = manager.mkApp(
391
+ OP_ITE,
392
+ [condition, thenTerm, manager.getArg(elseSolved, 1)],
393
+ manager.sorts[thenTerm],
394
+ );
395
+ result = assign(manager, result, manager.mkEq(manager.getArg(thenSolved, 0), ite));
396
+ }
397
+ manager.decRef(elseSolved);
398
+ manager.decRef(thenSolved);
399
+ }
400
+ if (this.isVariable(atom) && manager.sorts[atom] === SORT_BOOL)
401
+ return assign(
402
+ manager,
403
+ result,
404
+ manager.mkEq(atom, isPositive ? manager.trueExpr : manager.falseExpr),
405
+ );
406
+ if (isPositive) return result;
407
+ const negated = assign(manager, -1, mkNot(manager, result));
408
+ manager.decRef(result);
409
+ return negated;
410
+ }
411
+
412
+ // der_sort_vars: the definitions in an order where each only uses the ones before it, dropping
413
+ // the definitions on a cycle.
414
+ private sortVars() {
415
+ const manager = this.manager;
416
+ const definitions = this.map;
417
+ const getDefinition = (index: number) => definitions[index] ?? -1;
418
+ this.order = [];
419
+ let isFound = false;
420
+ for (let index = 0; index < definitions.length; index++) {
421
+ const definition = getDefinition(index);
422
+ if (
423
+ definition === -1 ||
424
+ manager.hasQuantifierFlags[definition] ||
425
+ isOccurring(manager, manager.values[this.inx2var[index]], definition)
426
+ )
427
+ definitions[index] = -1;
428
+ else isFound = true;
429
+ }
430
+ if (!isFound) return;
431
+ const visiting = new Set<number>();
432
+ const done = new Set<number>();
433
+ for (let index = 0; index < definitions.length; index++) {
434
+ if (getDefinition(index) === -1) continue;
435
+ const todo: [number, number][] = [[this.inx2var[index], 0]];
436
+ while (todo.length > 0) {
437
+ const frame = todo[todo.length - 1];
438
+ const expr = frame[0];
439
+ if (done.has(expr)) {
440
+ todo.pop();
441
+ continue;
442
+ }
443
+ if (manager.kinds[expr] === KIND_VAR) {
444
+ const varIndex = manager.values[expr];
445
+ if (frame[1] === 0 && getDefinition(varIndex) !== -1) {
446
+ if (!visiting.has(expr)) {
447
+ visiting.add(expr);
448
+ frame[1] = 1;
449
+ todo.push([getDefinition(varIndex), 0]);
450
+ continue;
451
+ }
452
+ visiting.delete(expr);
453
+ definitions[varIndex] = -1;
454
+ } else if (frame[1] === 1) {
455
+ visiting.delete(expr);
456
+ if (getDefinition(varIndex) !== -1) this.order.push(varIndex);
457
+ }
458
+ } else {
459
+ let isPushed = false;
460
+ while (frame[1] < manager.getNumArgs(expr) && !isPushed) {
461
+ const arg = manager.getArg(expr, frame[1]++);
462
+ if (!done.has(arg)) {
463
+ todo.push([arg, 0]);
464
+ isPushed = true;
465
+ }
466
+ }
467
+ if (isPushed) continue;
468
+ }
469
+ done.add(expr);
470
+ todo.pop();
471
+ }
472
+ }
473
+ }
474
+
475
+ private createSubstitution(size: number) {
476
+ const manager = this.manager;
477
+ this.substMap.reset();
478
+ this.substMap.resize(size);
479
+ this.subst.reset();
480
+ this.subst.setInvBindings(this.substMap.items);
481
+ for (const index of this.order) {
482
+ const definition = this.map[index];
483
+ const result = manager.isGroundApp(definition)
484
+ ? assign(manager, -1, definition)
485
+ : this.subst.rewrite(definition);
486
+ const position = size - index - 1;
487
+ this.subst.updateInvBindingAt(position, result);
488
+ this.substMap.setOwned(position, result);
489
+ }
490
+ }
491
+
492
+ // is_unconstrained: an integer variable that no other conjunct mentions.
493
+ private isUnconstrained(variable: number, term: number, position: number, conjs: number[]) {
494
+ const manager = this.manager;
495
+ const index = manager.values[variable];
496
+ return (
497
+ manager.sorts[variable] === SORT_INT &&
498
+ !isOccurring(manager, index, term) &&
499
+ conjs.every((conj, other) => other === position || !isOccurring(manager, index, conj))
500
+ );
501
+ }
502
+
503
+ // remove_unconstrained: a disequality on an unconstrained integer variable holds.
504
+ private removeUnconstrained(conjs: RefVector) {
505
+ const manager = this.manager;
506
+ let isReduced = false;
507
+ for (let isChanged = true; isChanged;) {
508
+ isChanged = false;
509
+ for (let position = 0; position < conjs.size; position++) {
510
+ const conj = conjs.items[position];
511
+ if (!manager.isNot(conj) || manager.getOp(manager.getArg(conj, 0)) !== OP_EQ) continue;
512
+ const lhs = manager.getArg(manager.getArg(conj, 0), 0);
513
+ const rhs = manager.getArg(manager.getArg(conj, 0), 1);
514
+ if (
515
+ (this.isVariable(lhs) && this.isUnconstrained(lhs, rhs, position, conjs.items)) ||
516
+ (this.isVariable(rhs) && this.isUnconstrained(rhs, lhs, position, conjs.items))
517
+ ) {
518
+ conjs.set(position, manager.trueExpr);
519
+ isReduced = true;
520
+ isChanged = true;
521
+ }
522
+ }
523
+ }
524
+ return isReduced;
525
+ }
526
+ }