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,514 @@
1
+ // Ported from Z3 (src/math/lp/int_solver.cpp, src/math/lp/int_gcd_test.cpp,
2
+ // src/math/lp/int_branch.cpp), MIT license, see z3-license.txt. The integer check of the final
3
+ // check: the GCD test on rows, patching fractional basic columns through integer non-basic ones,
4
+ // the cube and largest cube tests, HNF cuts, the Diophantine solver, Gomory cuts, and a branch on a
5
+ // fractional basic column.
6
+ import { getGcd, getLcm, Rational } from "../rational";
7
+ import { COLUMN_BOXED, COLUMN_FIXED, COLUMN_FREE, COLUMN_LOWER, COLUMN_UPPER } from "./core-solver";
8
+ import { DiophantineSolver } from "./dioph-eq";
9
+ import { Explanation } from "./explanation";
10
+ import { getGomoryCuts } from "./gomory";
11
+ import { makeHnfCut } from "./hnf-cutter";
12
+ import { findCube, findLargestCube } from "./int-cube";
13
+ import type { LarSolver } from "./lar-solver";
14
+ import { LarTerm } from "./lar-term";
15
+ import { Impq } from "./numeric-pair";
16
+ import type { RowCell } from "./static-matrix";
17
+
18
+ export type LiaMove =
19
+ | { kind: "sat" }
20
+ | { kind: "undef" }
21
+ | { kind: "conflict" }
22
+ | { kind: "continue" }
23
+ | { kind: "cut"; offset: Rational; isUpper: boolean }
24
+ | { kind: "branch"; isUpper: boolean; offset: Rational };
25
+
26
+ const getFractionalPart = (value: Rational) => value.sub(value.floor());
27
+
28
+ // gcd(a, b, u, v): the gcd of a and b, with a * u + b * v equal to it.
29
+ const getExtendedGcd = (first: bigint, second: bigint) => {
30
+ let previous = [first, 1n, 0n];
31
+ let current = [second, 0n, 1n];
32
+ while (current[0] !== 0n) {
33
+ const quotient = previous[0] / current[0];
34
+ const next = [
35
+ previous[0] - quotient * current[0],
36
+ previous[1] - quotient * current[1],
37
+ previous[2] - quotient * current[2],
38
+ ];
39
+ previous = current;
40
+ current = next;
41
+ }
42
+ return previous[0] < 0n ? previous.map((value) => -value) : previous;
43
+ };
44
+
45
+ // get_patching_deltas: the moves of a column with coefficient alpha that make x integral.
46
+ const getPatchingDeltas = (x: Rational, alpha: Rational) => {
47
+ if (alpha.den % x.den !== 0n) return undefined;
48
+ const scale = alpha.den / x.den;
49
+ const coeff = getExtendedGcd(alpha.num, x.den)[1];
50
+ const product = coeff * scale * x.num;
51
+ const remainder = ((product % alpha.den) + alpha.den) % alpha.den;
52
+ const plus = Rational.of(remainder);
53
+ return { plus, minus: plus.sub(Rational.of(alpha.den)) };
54
+ };
55
+
56
+ interface Parity {
57
+ offset: bigint;
58
+ modulus: bigint;
59
+ row: RowCell[];
60
+ }
61
+
62
+ export class IntSolver {
63
+ private numberOfCalls = 0;
64
+ // m_parities and m_inserted_vars of the GCD test, for one test.
65
+ private parities = new Map<number, Parity[]>();
66
+ private parityColumns: number[] = [];
67
+ private lcubePeriod: number;
68
+ readonly explanation = new Explanation();
69
+ // m_t: the term of a branch or a cut, kept across calls as Z3 keeps its table.
70
+ readonly term = new LarTerm();
71
+
72
+ private dio: DiophantineSolver;
73
+ private initialDioCallsPeriod: number;
74
+ // m_dio_undef_in_a_row: the Diophantine solver's calls in a row that found nothing.
75
+ private dioUndefInARow = 0;
76
+
77
+ constructor(readonly solver: LarSolver) {
78
+ this.lcubePeriod = solver.settings.intFindCubePeriod;
79
+ this.initialDioCallsPeriod = solver.settings.dioCallsPeriod;
80
+ this.dio = new DiophantineSolver(this);
81
+ }
82
+
83
+ isColumnIntInf(column: number) {
84
+ return this.solver.isInt(column) && !this.solver.getValue(column).isInt();
85
+ }
86
+
87
+ atBound(column: number) {
88
+ const core = this.solver.core;
89
+ const value = core.x[column];
90
+ switch (core.getColumnType(column)) {
91
+ case COLUMN_FIXED:
92
+ case COLUMN_BOXED:
93
+ return core.lowerBounds[column].equals(value) || core.upperBounds[column].equals(value);
94
+ case COLUMN_LOWER:
95
+ return core.lowerBounds[column].equals(value);
96
+ case COLUMN_UPPER:
97
+ return core.upperBounds[column].equals(value);
98
+ default:
99
+ return false;
100
+ }
101
+ }
102
+
103
+ atLower(column: number) {
104
+ const core = this.solver.core;
105
+ const type = core.getColumnType(column);
106
+ const hasLower = type === COLUMN_FIXED || type === COLUMN_BOXED || type === COLUMN_LOWER;
107
+ return hasLower && core.lowerBounds[column].equals(core.x[column]);
108
+ }
109
+
110
+ atUpper(column: number) {
111
+ const core = this.solver.core;
112
+ const type = core.getColumnType(column);
113
+ const hasUpper = type === COLUMN_FIXED || type === COLUMN_BOXED || type === COLUMN_UPPER;
114
+ return hasUpper && core.upperBounds[column].equals(core.x[column]);
115
+ }
116
+
117
+ private hitPeriod(period: number) {
118
+ return period <= 1 || this.solver.settings.getRandomNext(period) === 0;
119
+ }
120
+
121
+ check(): LiaMove {
122
+ const solver = this.solver;
123
+ if (!solver.hasInfInt()) return { kind: "sat" };
124
+ this.term.clear();
125
+ this.explanation.clear();
126
+ // lp.dio_run_gcd is off, so the GCD test runs only when the Diophantine solver ignores terms.
127
+ const move: LiaMove = this.dio.hasIgnoredTerms ? this.gcdTest() : { kind: "undef" };
128
+ return solver.core.withoutTouchedRows(() => this.checkAfterGcd(move));
129
+ }
130
+
131
+ private checkAfterGcd(gcdMove: LiaMove): LiaMove {
132
+ const settings = this.solver.settings;
133
+ if (settings.isCanceled()) return { kind: "undef" };
134
+ this.numberOfCalls++;
135
+ const move = gcdMove.kind === "undef" ? this.getMoveAfterGcd() : gcdMove;
136
+ return settings.isCanceled() ? { kind: "undef" } : move;
137
+ }
138
+
139
+ private getMoveAfterGcd(): LiaMove {
140
+ const solver = this.solver;
141
+ const settings = solver.settings;
142
+ if (this.patchBasicColumns()) return { kind: "sat" };
143
+ if (this.hitPeriod(settings.intFindCubePeriod) && findCube(solver)) return { kind: "sat" };
144
+ if (this.hitPeriod(this.lcubePeriod) && this.findLcube()) return { kind: "sat" };
145
+ solver.moveNonBasicColumnsToBounds();
146
+ if (this.hitPeriod(settings.hnfCutPeriod)) {
147
+ const move = makeHnfCut(this);
148
+ if (move.kind !== "undef") return move;
149
+ }
150
+ if (this.shouldSolveDiophantineEquations()) {
151
+ const move = this.solveDiophantineEquations();
152
+ if (move.kind !== "undef") return move;
153
+ }
154
+ const isGomoryAllowed = settings.isRunningGomoryWithDio || this.dio.hasIgnoredTerms;
155
+ if (isGomoryAllowed && this.hitPeriod(settings.intGomoryCutPeriod)) {
156
+ const move = getGomoryCuts(this, 2);
157
+ if (move.kind !== "undef") return move;
158
+ }
159
+ return this.branch();
160
+ }
161
+
162
+ // find_lcube: the period doubles while the largest cube finds nothing, and resets when it finds a
163
+ // solution.
164
+ private findLcube() {
165
+ const isSat = findLargestCube(this.solver);
166
+ if (isSat) this.lcubePeriod = this.solver.settings.intFindCubePeriod;
167
+ else if (this.lcubePeriod < 1 << 30) this.lcubePeriod *= 2;
168
+ return isSat;
169
+ }
170
+
171
+ // should_solve_dioph_eq: a draw with the current period, which relaxes toward the initial one
172
+ // when it misses.
173
+ private shouldSolveDiophantineEquations() {
174
+ const settings = this.solver.settings;
175
+ const isHit = this.hitPeriod(settings.dioCallsPeriod);
176
+ if (!isHit && settings.dioCallsPeriod > this.initialDioCallsPeriod) {
177
+ const decrease = settings.dioCallsPeriodDecrease;
178
+ settings.dioCallsPeriod =
179
+ settings.dioCallsPeriod > this.initialDioCallsPeriod + decrease
180
+ ? settings.dioCallsPeriod - decrease
181
+ : this.initialDioCallsPeriod;
182
+ }
183
+ return isHit;
184
+ }
185
+
186
+ // solve_dioph_eq: a conflict resets the period and stops Gomory cuts, and nothing found doubles
187
+ // the period and starts Gomory cuts after enough failures in a row. Z3 also sets the GCD test's
188
+ // flag, which it does not read while the Diophantine solver is on.
189
+ private solveDiophantineEquations(): LiaMove {
190
+ const settings = this.solver.settings;
191
+ if (this.dio.check() === "conflict") {
192
+ this.dio.explain(this.explanation);
193
+ settings.dioCallsPeriod = this.initialDioCallsPeriod;
194
+ this.dioUndefInARow = 0;
195
+ settings.isRunningGomoryWithDio = false;
196
+ return { kind: "conflict" };
197
+ }
198
+ settings.dioCallsPeriod *= 2;
199
+ this.dioUndefInARow++;
200
+ if (this.dioUndefInARow >= settings.dioGomoryEnablePeriod)
201
+ settings.isRunningGomoryWithDio = true;
202
+ return { kind: "undef" };
203
+ }
204
+
205
+ // GCD test.
206
+
207
+ private gcdTest(): LiaMove {
208
+ const solver = this.solver;
209
+ solver.settings.stats.gcdCalls++;
210
+ if (this.isGcdTestFeasible()) return { kind: "undef" };
211
+ solver.settings.stats.gcdConflicts++;
212
+ return { kind: "conflict" };
213
+ }
214
+
215
+ // gcd_test: the rows of fractional basic columns, then the other rows of the columns whose
216
+ // parity a row fixed.
217
+ private isGcdTestFeasible() {
218
+ const solver = this.solver;
219
+ this.parities.clear();
220
+ this.parityColumns = [];
221
+ const visited = new Set<number>();
222
+ for (let rowIndex = 0; rowIndex < solver.getRowCount(); rowIndex++) {
223
+ const basic = solver.core.basis[rowIndex];
224
+ if (!solver.isInt(basic) || solver.getValue(basic).isInt()) continue;
225
+ if (!this.gcdTestForRow(rowIndex)) return false;
226
+ visited.add(rowIndex);
227
+ }
228
+ for (let index = this.parityColumns.length; index-- > 0;)
229
+ for (const cell of solver.core.matrix.columns[this.parityColumns[index]]) {
230
+ if (visited.has(cell.row)) continue;
231
+ visited.add(cell.row);
232
+ if (!this.gcdTestForRow(cell.row)) return false;
233
+ }
234
+ return true;
235
+ }
236
+
237
+ private gcdTestForRow(rowIndex: number) {
238
+ const solver = this.solver;
239
+ const basic = solver.core.basis[rowIndex];
240
+ if (!solver.isInt(basic)) return true;
241
+ const row = solver.getRow(rowIndex);
242
+ let lcmDen = 1n;
243
+ for (const cell of row) lcmDen = getLcm(lcmDen, cell.coeff.den);
244
+ const lcm = Rational.of(lcmDen);
245
+ let consts = Rational.zero;
246
+ let gcds = Rational.zero;
247
+ let leastCoeff = Rational.zero;
248
+ let isLeastCoeffBounded = false;
249
+ let isLeastCoeffUnique = false;
250
+ let leastCoeffColumn = 0;
251
+ for (const cell of row) {
252
+ const column = cell.column;
253
+ const scaled = lcm.mul(cell.coeff);
254
+ if (solver.isFixed(column)) {
255
+ consts = consts.add(scaled.mul(solver.getLowerBound(column).x));
256
+ continue;
257
+ }
258
+ if (!solver.isInt(column)) return true;
259
+ const magnitude = scaled.abs();
260
+ const isBounded = this.isBounded(column);
261
+ if (gcds.isZero()) {
262
+ gcds = magnitude;
263
+ leastCoeff = magnitude;
264
+ isLeastCoeffBounded = isBounded;
265
+ isLeastCoeffUnique = true;
266
+ leastCoeffColumn = column;
267
+ continue;
268
+ }
269
+ gcds = Rational.of(getGcd(gcds.num, magnitude.num));
270
+ const comparison = magnitude.compare(leastCoeff);
271
+ if (comparison < 0) {
272
+ leastCoeff = magnitude;
273
+ isLeastCoeffBounded = isBounded;
274
+ isLeastCoeffUnique = true;
275
+ leastCoeffColumn = column;
276
+ } else if (comparison === 0) {
277
+ isLeastCoeffBounded = isLeastCoeffBounded && isBounded;
278
+ isLeastCoeffUnique = false;
279
+ }
280
+ }
281
+ if (gcds.isZero()) return true;
282
+ if (!consts.div(gcds).isInt()) {
283
+ this.fillExplanationFromFixedColumns(row);
284
+ return false;
285
+ }
286
+ if (
287
+ isLeastCoeffBounded &&
288
+ !leastCoeff.equals(Rational.one) &&
289
+ !solver.getValue(basic).isInt() &&
290
+ !this.extGcdTest(row, lcm, consts, leastCoeff)
291
+ )
292
+ return false;
293
+ if (!isLeastCoeffUnique) return true;
294
+ return this.accumulateParity(row, leastCoeffColumn, lcm, consts, leastCoeff);
295
+ }
296
+
297
+ // accumulate_parity: the row fixes the residue of its unique least column modulo the gcd of the
298
+ // others, and two rows that fix different residues for the same modulus conflict.
299
+ private accumulateParity(
300
+ row: RowCell[],
301
+ leastColumn: number,
302
+ lcm: Rational,
303
+ consts: Rational,
304
+ leastCoeff: Rational,
305
+ ) {
306
+ const solver = this.solver;
307
+ let modulus = 0n;
308
+ let isLeastNegative = false;
309
+ for (const cell of row) {
310
+ if (cell.column === leastColumn) isLeastNegative = cell.coeff.isNegative();
311
+ else if (!solver.isFixed(cell.column)) {
312
+ const magnitude = lcm.mul(cell.coeff).abs().num;
313
+ if (getGcd(leastCoeff.num, magnitude) !== leastCoeff.num) return true;
314
+ modulus = modulus === 0n ? magnitude : getGcd(modulus, magnitude);
315
+ if (modulus === 1n) return true;
316
+ }
317
+ }
318
+ modulus /= leastCoeff.num;
319
+ if (modulus === 0n) return true;
320
+ const quotient = consts.div(leastCoeff);
321
+ if (!quotient.isInt()) return true;
322
+ let offset = ((quotient.num % modulus) + modulus) % modulus;
323
+ if (!isLeastNegative && offset !== 0n) offset = modulus - offset;
324
+ return this.insertParity(leastColumn, row, offset, modulus);
325
+ }
326
+
327
+ private insertParity(column: number, row: RowCell[], offset: bigint, modulus: bigint) {
328
+ const parities = this.parities.get(column) ?? [];
329
+ for (const parity of parities) {
330
+ if (parity.modulus !== modulus) continue;
331
+ if (parity.offset === offset) return true;
332
+ this.fillExplanationFromFixedColumns(row);
333
+ this.fillExplanationFromFixedColumns(parity.row);
334
+ return false;
335
+ }
336
+ this.parityColumns.push(column);
337
+ parities.push({ offset, modulus, row });
338
+ this.parities.set(column, parities);
339
+ return true;
340
+ }
341
+
342
+ private isBounded(column: number) {
343
+ const type = this.solver.core.getColumnType(column);
344
+ return type === COLUMN_BOXED || type === COLUMN_FIXED;
345
+ }
346
+
347
+ private extGcdTest(row: RowCell[], lcm: Rational, consts: Rational, leastCoeff: Rational) {
348
+ const solver = this.solver;
349
+ let gcds = Rational.zero;
350
+ let lower = consts;
351
+ let upper = consts;
352
+ const boxed: number[] = [];
353
+ for (const cell of row) {
354
+ const column = cell.column;
355
+ if (solver.isFixed(column)) continue;
356
+ const scaled = lcm.mul(cell.coeff);
357
+ const magnitude = scaled.abs();
358
+ if (magnitude.equals(leastCoeff)) {
359
+ const low = solver.getLowerBound(column).x;
360
+ const high = solver.getUpperBound(column).x;
361
+ lower = lower.add(scaled.mul(scaled.isPositive() ? low : high));
362
+ upper = upper.add(scaled.mul(scaled.isPositive() ? high : low));
363
+ boxed.push(column);
364
+ } else gcds = gcds.isZero() ? magnitude : Rational.of(getGcd(gcds.num, magnitude.num));
365
+ }
366
+ if (gcds.isZero()) return true;
367
+ if (upper.div(gcds).floor().compare(lower.div(gcds).ceil()) >= 0) return true;
368
+ for (const column of boxed) this.addBoundWitnesses(column);
369
+ this.fillExplanationFromFixedColumns(row);
370
+ return false;
371
+ }
372
+
373
+ private addBoundWitnesses(column: number) {
374
+ this.explanation.pushDependency(this.solver.getBoundWitnesses(column));
375
+ }
376
+
377
+ private fillExplanationFromFixedColumns(row: RowCell[]) {
378
+ for (const cell of row)
379
+ if (this.solver.isFixed(cell.column)) this.addBoundWitnesses(cell.column);
380
+ }
381
+
382
+ // Patching.
383
+
384
+ private patchBasicColumns() {
385
+ const solver = this.solver;
386
+ solver.settings.stats.patches++;
387
+ solver.removeFixedVarsFromBase();
388
+ for (const column of solver.core.basis)
389
+ if (!solver.getModelValue(column).isInt() && solver.isInt(column) && !solver.isFixed(column))
390
+ this.patchBasicColumn(column);
391
+ if (solver.hasInfInt()) return false;
392
+ solver.settings.stats.patchesSuccess++;
393
+ return true;
394
+ }
395
+
396
+ private patchBasicColumn(basic: number) {
397
+ const solver = this.solver;
398
+ for (const cell of solver.getRow(solver.core.heading[basic])) {
399
+ if (cell.column === basic || !solver.isInt(cell.column) || cell.coeff.isInt()) continue;
400
+ const deltas = getPatchingDeltas(
401
+ getFractionalPart(solver.getModelValue(basic)),
402
+ getFractionalPart(cell.coeff),
403
+ );
404
+ if (deltas === undefined) continue;
405
+ const isPlusFirst = solver.settings.getRandomNext() % 2 !== 0;
406
+ const first = isPlusFirst ? deltas.plus : deltas.minus;
407
+ const second = isPlusFirst ? deltas.minus : deltas.plus;
408
+ if (this.tryPatchColumn(cell.column, first) || this.tryPatchColumn(cell.column, second))
409
+ return;
410
+ }
411
+ }
412
+
413
+ private tryPatchColumn(column: number, delta: Rational) {
414
+ const solver = this.solver;
415
+ const core = solver.core;
416
+ const value = solver.getValue(column).add(new Impq(delta));
417
+ if (delta.isNegative()) {
418
+ if (core.hasLowerBound(column) && value.compare(solver.getLowerBound(column)) < 0)
419
+ return false;
420
+ } else if (core.hasUpperBound(column) && value.compare(solver.getUpperBound(column)) > 0)
421
+ return false;
422
+ for (const cell of core.matrix.columns[column]) {
423
+ const basic = core.basis[cell.row];
424
+ const oldValue = solver.getValue(basic);
425
+ const newValue = new Impq(oldValue.x.sub(core.matrix.getVal(cell).mul(delta)), oldValue.y);
426
+ if (core.hasLowerBound(basic) && newValue.compare(solver.getLowerBound(basic)) < 0)
427
+ return false;
428
+ if (core.hasUpperBound(basic) && newValue.compare(solver.getUpperBound(basic)) > 0)
429
+ return false;
430
+ if (oldValue.isInt() && !newValue.isInt()) return false;
431
+ }
432
+ solver.setValueForNbasicColumn(column, value);
433
+ return true;
434
+ }
435
+
436
+ // Branching.
437
+
438
+ private branch(): LiaMove {
439
+ const solver = this.solver;
440
+ solver.moveNonBasicColumnsToBounds();
441
+ const column = this.findInfIntBaseColumn();
442
+ if (column === -1) return { kind: "sat" };
443
+ const settings = solver.settings;
444
+ solver.settings.stats.branches++;
445
+ this.term.clear();
446
+ this.term.addMonomial(Rational.one, column);
447
+ const isUpper = settings.getRandomNext() % 2 !== 0;
448
+ const value = solver.getValue(column);
449
+ const isFree = solver.core.getColumnType(column) === COLUMN_FREE;
450
+ const offset = isFree ? Rational.zero : isUpper ? value.floor() : value.ceil();
451
+ return { kind: "branch", isUpper, offset };
452
+ }
453
+
454
+ private findInfIntBaseColumn() {
455
+ const solver = this.solver;
456
+ const settings = solver.settings;
457
+ const core = solver.core;
458
+ const smallValue = Rational.of(1024n);
459
+ let smallBox = -1;
460
+ let smallValueColumn = -1;
461
+ let anyValue = -1;
462
+ let numSmallBox = 1;
463
+ let numSmallValue = 1;
464
+ let numAnyValue = 1;
465
+ let range = Rational.zero;
466
+ let minAnyValue = Rational.zero;
467
+ let previousUsage = 0;
468
+ for (const column of core.basis) {
469
+ if (!this.isColumnIntInf(column)) continue;
470
+ if (settings.isCanceled()) return -1;
471
+ const usage = solver.getUsageInTerms(column);
472
+ if (core.getColumnType(column) === COLUMN_BOXED) {
473
+ const newRange = solver
474
+ .getUpperBound(column)
475
+ .x.sub(solver.getLowerBound(column).x)
476
+ .sub(Rational.of(BigInt(2 * usage)));
477
+ if (newRange.compare(smallValue) <= 0) {
478
+ const isImproved = smallBox === -1 || newRange.compare(range) <= 0;
479
+ if (isImproved) range = newRange;
480
+ if (smallBox === -1) smallBox = column;
481
+ else if (isImproved && settings.getRandomNext() % ++numSmallBox === 0) smallBox = column;
482
+ continue;
483
+ }
484
+ }
485
+ const value = solver.getValue(column);
486
+ if (
487
+ value.x.abs().compare(smallValue) < 0 ||
488
+ (core.hasUpperBound(column) &&
489
+ smallValue.compare(solver.getUpperBound(column).x.sub(value.x)) > 0) ||
490
+ (core.hasLowerBound(column) &&
491
+ smallValue.compare(value.x.sub(solver.getLowerBound(column).x)) > 0)
492
+ ) {
493
+ if (smallValueColumn === -1) smallValueColumn = column;
494
+ else if (settings.getRandomNext() % ++numSmallValue === 0) smallValueColumn = column;
495
+ continue;
496
+ }
497
+ const magnitude = value.x.abs();
498
+ if (anyValue === -1 || magnitude.compare(minAnyValue) < 0) {
499
+ anyValue = column;
500
+ minAnyValue = magnitude;
501
+ numAnyValue = 1;
502
+ previousUsage = usage;
503
+ } else if (magnitude.equals(minAnyValue)) {
504
+ if (usage >= previousUsage && settings.getRandomNext() % ++numAnyValue === 0)
505
+ anyValue = column;
506
+ if (usage > previousUsage) previousUsage = usage;
507
+ }
508
+ }
509
+ if (smallBox !== -1 && settings.getRandomNext() % 3 !== 0) return smallBox;
510
+ if (smallValueColumn !== -1 && settings.getRandomNext() % 3 !== 0) return smallValueColumn;
511
+ if (anyValue !== -1) return anyValue;
512
+ return smallBox !== -1 ? smallBox : smallValueColumn;
513
+ }
514
+ }