tla-ts 0.0.3 → 0.0.4-dev.2a873ee
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.
- package/README.md +46 -115
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +194 -8
- package/dist/index.d.ts +194 -8
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +996 -0
- package/dist/prove.js +996 -0
- package/dist/run-cli.cjs +37 -20
- package/dist/run-cli.js +37 -20
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +1387 -18
- package/dist/transfer.js +1387 -18
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +24 -11
- package/src/ast.ts +149 -8
- package/src/bags.ts +4 -7
- package/src/builtins.ts +29 -11
- package/src/bundled-modules.ts +3 -3
- package/src/canonical.ts +4 -3
- package/src/check.ts +1540 -235
- package/src/cli-options.ts +12 -6
- package/src/cli.ts +8 -1
- package/src/codegen.ts +98 -39
- package/src/config.ts +254 -181
- package/src/dependencies.ts +2 -2
- package/src/environment.ts +540 -140
- package/src/errors.ts +284 -4
- package/src/evaluate.ts +1043 -293
- package/src/exit-codes.ts +22 -43
- package/src/fingerprints.ts +46 -11
- package/src/index.ts +11 -0
- package/src/instances.ts +19 -16
- package/src/java-overrides.ts +104 -25
- package/src/levels.ts +191 -45
- package/src/lexer.ts +127 -30
- package/src/live-check.ts +867 -0
- package/src/liveness.ts +218 -572
- package/src/{obligation-action.ts → obligations/action.ts} +247 -69
- package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
- package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
- package/src/{obligations.ts → obligations/index.ts} +32 -16
- package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
- package/src/{obligation-module.ts → obligations/module.ts} +113 -121
- package/src/obligations/pickle.ts +98 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/{obligation-source.ts → obligations/source.ts} +156 -99
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/ocaml-marshal.ts +166 -0
- package/src/parallel-worker.ts +169 -224
- package/src/parallel.ts +140 -81
- package/src/parser.ts +456 -147
- package/src/pcal-ast.ts +770 -0
- package/src/pcal-parse.ts +1523 -0
- package/src/pcal-tokenize.ts +516 -0
- package/src/pcal-translate.ts +1230 -0
- package/src/pcal-validate.ts +454 -0
- package/src/prove/decide-pool.ts +95 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/first-order.ts +78 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +446 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +546 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +433 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +331 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +330 -0
- package/src/prove/isabelle/pure/name.ts +98 -0
- package/src/prove/isabelle/pure/net.ts +215 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +631 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +133 -0
- package/src/prove/isabelle/pure/simplifier.ts +106 -0
- package/src/prove/isabelle/pure/table.ts +201 -0
- package/src/prove/isabelle/pure/tactic.ts +168 -0
- package/src/prove/isabelle/pure/tactical.ts +264 -0
- package/src/prove/isabelle/pure/term-ord.ts +105 -0
- package/src/prove/isabelle/pure/term.ts +688 -0
- package/src/prove/isabelle/pure/thm.ts +783 -0
- package/src/prove/isabelle/pure/type.ts +121 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +508 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +529 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +22 -0
- package/src/prove/prove.ts +498 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +255 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +209 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +636 -0
- package/src/prove/smt/encode.ts +164 -0
- package/src/prove/smt/extensionality.ts +65 -0
- package/src/prove/smt/flatten.ts +112 -0
- package/src/prove/smt/format.ts +154 -0
- package/src/prove/smt/instances.ts +181 -0
- package/src/prove/smt/rewrite.ts +772 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +91 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +379 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +162 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +24 -7
- package/src/resolve.ts +1481 -426
- package/src/run-cli.ts +1483 -212
- package/src/runtime.ts +19 -1
- package/src/sany-builtins.ts +147 -0
- package/src/sany-generator.ts +3128 -0
- package/src/sany-levels.ts +1208 -0
- package/src/sany-lexer.ts +545 -0
- package/src/sany-linter.ts +122 -0
- package/src/sany-modules.ts +1398 -0
- package/src/sany-nodes.ts +463 -0
- package/src/sany-parse-error.ts +2161 -0
- package/src/sany-report.ts +356 -0
- package/src/sany-selectors.ts +738 -0
- package/src/sany-source.ts +248 -0
- package/src/sany-xml.ts +1017 -0
- package/src/spec-description.ts +42 -11
- package/src/standard-modules.ts +203 -148
- package/src/standard-ranges.ts +116 -0
- package/src/state-graph.ts +180 -0
- package/src/subexpressions.ts +231 -171
- package/src/substitution-levels.ts +38 -17
- package/src/successors.ts +241 -110
- package/src/symmetry.ts +194 -54
- package/src/tableau.ts +54 -25
- package/src/tlapm-cache.ts +236 -0
- package/src/tlc-ext.ts +42 -29
- package/src/tlc-messages.ts +329 -0
- package/src/tlc-module.ts +52 -43
- package/src/tlc-modules.ts +4 -0
- package/src/tlc-order.ts +78 -10
- package/src/tlc-random.ts +84 -33
- package/src/tlc-replay.ts +655 -0
- package/src/tlc-summary.ts +20 -5
- package/src/tlc-version.ts +19 -0
- package/src/transfer.ts +15 -3
- package/src/values.ts +787 -190
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
|
@@ -0,0 +1,351 @@
|
|
|
1
|
+
// Ported from Z3 (src/nlsat/nlsat_interval_set.cpp), MIT license, see z3-license.txt. Sets of
|
|
2
|
+
// disjoint infeasible intervals of the values of one variable, each justified by the literal that
|
|
3
|
+
// excludes it. A null set is empty. The bounds are copies of the numbers they were built from, so
|
|
4
|
+
// refining a bound while comparing it narrows only that copy, as in Z3.
|
|
5
|
+
//
|
|
6
|
+
// A union drops the clauses of the intervals it copies, as Z3's push_back does, and this is
|
|
7
|
+
// sound. An interval's clause is read only by get_justifications, for R_propagate's lazy
|
|
8
|
+
// justification (nlsat_solver.cpp). Its literals come from the justifications alone, and the lazy
|
|
9
|
+
// clause they give is valid in the reals by itself. The clauses are used only for three things:
|
|
10
|
+
// - resolve_lazy_justification joins their assumptions into the lemma's. Resolution already
|
|
11
|
+
// collects these: each core literal's own justification is resolved, or the literal stays in
|
|
12
|
+
// the lemma.
|
|
13
|
+
// - update_var2eq skips a lazy justification with clauses. It also skips one with literals, and
|
|
14
|
+
// every interval brings a literal.
|
|
15
|
+
// - Display.
|
|
16
|
+
// So a dropped clause can only shrink an over-approximated assumption set, and never removes a
|
|
17
|
+
// literal from an explanation.
|
|
18
|
+
import { RandomGen } from "../random-gen";
|
|
19
|
+
import { Rational } from "../rational";
|
|
20
|
+
import { Anum, type AlgebraicManager } from "./algebraic";
|
|
21
|
+
import type { Clause } from "./types";
|
|
22
|
+
|
|
23
|
+
// A null bound is infinite, and an infinite end is always open.
|
|
24
|
+
export interface Interval {
|
|
25
|
+
isLowerOpen: boolean;
|
|
26
|
+
lower: Anum | null;
|
|
27
|
+
isUpperOpen: boolean;
|
|
28
|
+
upper: Anum | null;
|
|
29
|
+
justification: number;
|
|
30
|
+
clause: Clause | null;
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
export interface IntervalSet {
|
|
34
|
+
intervals: Interval[];
|
|
35
|
+
isFull: boolean;
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
interface ComplementMax {
|
|
39
|
+
sup: Anum;
|
|
40
|
+
isAttained: boolean;
|
|
41
|
+
}
|
|
42
|
+
|
|
43
|
+
export class IntervalSetManager {
|
|
44
|
+
private rand = new RandomGen(0);
|
|
45
|
+
|
|
46
|
+
constructor(private am: AlgebraicManager) {}
|
|
47
|
+
|
|
48
|
+
setSeed(seed: number) {
|
|
49
|
+
this.rand = new RandomGen(seed);
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
mk(
|
|
53
|
+
isLowerOpen: boolean,
|
|
54
|
+
lower: Anum | null,
|
|
55
|
+
isUpperOpen: boolean,
|
|
56
|
+
upper: Anum | null,
|
|
57
|
+
justification: number,
|
|
58
|
+
clause: Clause | null,
|
|
59
|
+
): IntervalSet {
|
|
60
|
+
return {
|
|
61
|
+
intervals: [
|
|
62
|
+
{
|
|
63
|
+
isLowerOpen,
|
|
64
|
+
lower: lower === null ? null : this.am.copy(lower),
|
|
65
|
+
isUpperOpen,
|
|
66
|
+
upper: upper === null ? null : this.am.copy(upper),
|
|
67
|
+
justification,
|
|
68
|
+
clause,
|
|
69
|
+
},
|
|
70
|
+
],
|
|
71
|
+
isFull: lower === null && upper === null,
|
|
72
|
+
};
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
private compareLowerLower(first: Interval, second: Interval) {
|
|
76
|
+
if (first.lower === null) return second.lower === null ? 0 : -1;
|
|
77
|
+
if (second.lower === null) return 1;
|
|
78
|
+
const sign = this.am.compare(first.lower, second.lower);
|
|
79
|
+
if (sign !== 0) return sign;
|
|
80
|
+
if (first.isLowerOpen === second.isLowerOpen) return 0;
|
|
81
|
+
return first.isLowerOpen ? 1 : -1;
|
|
82
|
+
}
|
|
83
|
+
|
|
84
|
+
private compareUpperUpper(first: Interval, second: Interval) {
|
|
85
|
+
if (first.upper === null) return second.upper === null ? 0 : 1;
|
|
86
|
+
if (second.upper === null) return -1;
|
|
87
|
+
const sign = this.am.compare(first.upper, second.upper);
|
|
88
|
+
if (sign !== 0) return sign;
|
|
89
|
+
if (first.isUpperOpen === second.isUpperOpen) return 0;
|
|
90
|
+
return first.isUpperOpen ? -1 : 1;
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
private compareUpperLower(first: Interval, second: Interval) {
|
|
94
|
+
if (first.upper === null || second.lower === null) return 1;
|
|
95
|
+
const sign = this.am.compare(first.upper, second.lower);
|
|
96
|
+
if (sign !== 0) return sign;
|
|
97
|
+
return !first.isUpperOpen && !second.isLowerOpen ? 0 : -1;
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
// adjacent: curr ends where next starts and one of them holds the shared point. Both bounds are
|
|
101
|
+
// finite.
|
|
102
|
+
private isAdjacent(current: Interval, next: Interval) {
|
|
103
|
+
return (
|
|
104
|
+
this.am.compare(current.upper!, next.lower!) === 0 &&
|
|
105
|
+
(!current.isUpperOpen || !next.isLowerOpen)
|
|
106
|
+
);
|
|
107
|
+
}
|
|
108
|
+
|
|
109
|
+
// push_back drops the clause, so a union only keeps the clauses of a set it returns unchanged.
|
|
110
|
+
private copyInterval(
|
|
111
|
+
interval: Interval,
|
|
112
|
+
upper = { isOpen: interval.isUpperOpen, value: interval.upper },
|
|
113
|
+
): Interval {
|
|
114
|
+
return {
|
|
115
|
+
isLowerOpen: interval.isLowerOpen,
|
|
116
|
+
lower: interval.lower === null ? null : this.am.copy(interval.lower),
|
|
117
|
+
isUpperOpen: upper.isOpen,
|
|
118
|
+
upper: upper.value === null ? null : this.am.copy(upper.value),
|
|
119
|
+
justification: interval.justification,
|
|
120
|
+
clause: null,
|
|
121
|
+
};
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
mkUnion(first: IntervalSet | null, second: IntervalSet | null) {
|
|
125
|
+
if (first === null || first === second) return second;
|
|
126
|
+
if (second === null) return first;
|
|
127
|
+
if (first.isFull) return first;
|
|
128
|
+
if (second.isFull) return second;
|
|
129
|
+
const result: Interval[] = [];
|
|
130
|
+
let firstIndex = 0;
|
|
131
|
+
let secondIndex = 0;
|
|
132
|
+
while (firstIndex < first.intervals.length && secondIndex < second.intervals.length) {
|
|
133
|
+
const firstInterval = first.intervals[firstIndex];
|
|
134
|
+
const secondInterval = second.intervals[secondIndex];
|
|
135
|
+
const lowerSign = this.compareLowerLower(firstInterval, secondInterval);
|
|
136
|
+
const upperSign = this.compareUpperUpper(firstInterval, secondInterval);
|
|
137
|
+
if (lowerSign <= 0) {
|
|
138
|
+
if (upperSign === 0) {
|
|
139
|
+
result.push(this.copyInterval(firstInterval));
|
|
140
|
+
firstIndex++;
|
|
141
|
+
secondIndex++;
|
|
142
|
+
} else if (upperSign > 0) secondIndex++;
|
|
143
|
+
else {
|
|
144
|
+
const touchSign = this.compareUpperLower(firstInterval, secondInterval);
|
|
145
|
+
if (touchSign < 0) result.push(this.copyInterval(firstInterval));
|
|
146
|
+
else if (touchSign === 0) {
|
|
147
|
+
if (lowerSign !== 0)
|
|
148
|
+
result.push(
|
|
149
|
+
this.copyInterval(firstInterval, { isOpen: true, value: firstInterval.upper }),
|
|
150
|
+
);
|
|
151
|
+
} else if (lowerSign !== 0)
|
|
152
|
+
result.push(
|
|
153
|
+
this.copyInterval(firstInterval, {
|
|
154
|
+
isOpen: !secondInterval.isLowerOpen,
|
|
155
|
+
value: secondInterval.lower,
|
|
156
|
+
}),
|
|
157
|
+
);
|
|
158
|
+
firstIndex++;
|
|
159
|
+
}
|
|
160
|
+
} else if (upperSign === 0) {
|
|
161
|
+
result.push(this.copyInterval(secondInterval));
|
|
162
|
+
firstIndex++;
|
|
163
|
+
secondIndex++;
|
|
164
|
+
} else if (upperSign < 0) firstIndex++;
|
|
165
|
+
else {
|
|
166
|
+
const touchSign = this.compareUpperLower(secondInterval, firstInterval);
|
|
167
|
+
if (touchSign < 0) result.push(this.copyInterval(secondInterval));
|
|
168
|
+
else if (touchSign === 0)
|
|
169
|
+
result.push(
|
|
170
|
+
this.copyInterval(secondInterval, { isOpen: true, value: secondInterval.upper }),
|
|
171
|
+
);
|
|
172
|
+
else
|
|
173
|
+
result.push(
|
|
174
|
+
this.copyInterval(secondInterval, {
|
|
175
|
+
isOpen: !firstInterval.isLowerOpen,
|
|
176
|
+
value: firstInterval.lower,
|
|
177
|
+
}),
|
|
178
|
+
);
|
|
179
|
+
secondIndex++;
|
|
180
|
+
}
|
|
181
|
+
}
|
|
182
|
+
for (; firstIndex < first.intervals.length; firstIndex++)
|
|
183
|
+
result.push(this.copyInterval(first.intervals[firstIndex]));
|
|
184
|
+
for (; secondIndex < second.intervals.length; secondIndex++)
|
|
185
|
+
result.push(this.copyInterval(second.intervals[secondIndex]));
|
|
186
|
+
// Merge adjacent intervals with the same justification.
|
|
187
|
+
const merged = [result[0]];
|
|
188
|
+
for (const next of result.slice(1)) {
|
|
189
|
+
const current = merged[merged.length - 1];
|
|
190
|
+
if (current.justification === next.justification && this.isAdjacent(current, next)) {
|
|
191
|
+
current.isUpperOpen = next.isUpperOpen;
|
|
192
|
+
current.upper = next.upper;
|
|
193
|
+
} else merged.push(next);
|
|
194
|
+
}
|
|
195
|
+
let isSlack = merged[0].lower !== null || merged[merged.length - 1].upper !== null;
|
|
196
|
+
for (let index = 0; index < merged.length - 1 && !isSlack; index++)
|
|
197
|
+
if (!this.isAdjacent(merged[index], merged[index + 1])) isSlack = true;
|
|
198
|
+
return { intervals: merged, isFull: !isSlack };
|
|
199
|
+
}
|
|
200
|
+
|
|
201
|
+
isFull(set: IntervalSet | null) {
|
|
202
|
+
return set !== null && set.isFull;
|
|
203
|
+
}
|
|
204
|
+
|
|
205
|
+
// subset: every interval of first lies in a run of adjacent intervals of second.
|
|
206
|
+
subset(first: IntervalSet | null, second: IntervalSet | null) {
|
|
207
|
+
if (first === second || first === null) return true;
|
|
208
|
+
if (second === null) return false;
|
|
209
|
+
if (second.isFull) return true;
|
|
210
|
+
if (first.isFull) return false;
|
|
211
|
+
let firstIndex = 0;
|
|
212
|
+
let secondIndex = 0;
|
|
213
|
+
while (firstIndex < first.intervals.length && secondIndex < second.intervals.length) {
|
|
214
|
+
const firstInterval = first.intervals[firstIndex];
|
|
215
|
+
if (this.compareLowerLower(firstInterval, second.intervals[secondIndex]) < 0) return false;
|
|
216
|
+
while (secondIndex < second.intervals.length) {
|
|
217
|
+
const secondInterval = second.intervals[secondIndex];
|
|
218
|
+
const upperSign = this.compareUpperUpper(firstInterval, secondInterval);
|
|
219
|
+
if (upperSign === 0) {
|
|
220
|
+
firstIndex++;
|
|
221
|
+
secondIndex++;
|
|
222
|
+
break;
|
|
223
|
+
}
|
|
224
|
+
if (upperSign < 0) {
|
|
225
|
+
firstIndex++;
|
|
226
|
+
break;
|
|
227
|
+
}
|
|
228
|
+
if (this.compareUpperLower(secondInterval, firstInterval) < 0) {
|
|
229
|
+
secondIndex++;
|
|
230
|
+
break;
|
|
231
|
+
}
|
|
232
|
+
if (secondIndex === second.intervals.length - 1) return false;
|
|
233
|
+
if (!this.isAdjacent(secondInterval, second.intervals[secondIndex + 1])) return false;
|
|
234
|
+
secondIndex++;
|
|
235
|
+
}
|
|
236
|
+
}
|
|
237
|
+
return firstIndex === first.intervals.length;
|
|
238
|
+
}
|
|
239
|
+
|
|
240
|
+
// get_justifications: the distinct justifications in order, and the clauses of the intervals
|
|
241
|
+
// that first bring each.
|
|
242
|
+
getJustifications(set: IntervalSet | null) {
|
|
243
|
+
const literals: number[] = [];
|
|
244
|
+
const clauses: Clause[] = [];
|
|
245
|
+
for (const interval of set?.intervals ?? []) {
|
|
246
|
+
if (literals.includes(interval.justification)) continue;
|
|
247
|
+
literals.push(interval.justification);
|
|
248
|
+
if (interval.clause !== null) clauses.push(interval.clause);
|
|
249
|
+
}
|
|
250
|
+
return { literals, clauses };
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
// pick_in_complement: zero when it is outside the set. Otherwise an integer above the last
|
|
254
|
+
// interval, an integer below the first, or a number in a gap, picked uniformly at random among
|
|
255
|
+
// them when randomizing, else the first found. With no gap, the shared open end of two
|
|
256
|
+
// intervals, preferring a rational one. Z3 also takes is_int, and ignores it.
|
|
257
|
+
pickInComplement(set: IntervalSet | null, isRandomized: boolean) {
|
|
258
|
+
if (set === null) return new Anum(Rational.zero);
|
|
259
|
+
const zero = new Anum(Rational.zero);
|
|
260
|
+
let isZeroAvailable = true;
|
|
261
|
+
for (const interval of set.intervals) {
|
|
262
|
+
const sign = this.compareIntervalWithZero(interval, zero);
|
|
263
|
+
if (sign === 0) {
|
|
264
|
+
isZeroAvailable = false;
|
|
265
|
+
break;
|
|
266
|
+
}
|
|
267
|
+
if (sign > 0) break;
|
|
268
|
+
}
|
|
269
|
+
if (isZeroAvailable) return zero;
|
|
270
|
+
const intervals = set.intervals;
|
|
271
|
+
const last = intervals[intervals.length - 1];
|
|
272
|
+
let count = 0;
|
|
273
|
+
let picked: Anum | null = null;
|
|
274
|
+
if (last.upper !== null) {
|
|
275
|
+
count++;
|
|
276
|
+
picked = this.am.intGt(last.upper);
|
|
277
|
+
if (!isRandomized) return picked;
|
|
278
|
+
}
|
|
279
|
+
if (intervals[0].lower !== null) {
|
|
280
|
+
count++;
|
|
281
|
+
picked = this.am.intLt(intervals[0].lower);
|
|
282
|
+
if (!isRandomized) return picked;
|
|
283
|
+
}
|
|
284
|
+
for (let index = 1; index < intervals.length; index++) {
|
|
285
|
+
if (this.am.compare(intervals[index - 1].upper!, intervals[index].lower!) < 0) {
|
|
286
|
+
count++;
|
|
287
|
+
if (count === 1 || this.rand.next() % count === 0)
|
|
288
|
+
picked = this.am.select(intervals[index - 1].upper!, intervals[index].lower!);
|
|
289
|
+
if (!isRandomized) return picked!;
|
|
290
|
+
}
|
|
291
|
+
}
|
|
292
|
+
if (picked !== null) return picked;
|
|
293
|
+
let irrational: Anum | null = null;
|
|
294
|
+
for (let index = 1; index < intervals.length; index++) {
|
|
295
|
+
const upper = intervals[index - 1].upper!;
|
|
296
|
+
if (intervals[index - 1].isUpperOpen && intervals[index].isLowerOpen) {
|
|
297
|
+
if (this.am.isRational(upper)) return this.am.copy(upper);
|
|
298
|
+
irrational ??= upper;
|
|
299
|
+
}
|
|
300
|
+
}
|
|
301
|
+
return this.am.copy(irrational!);
|
|
302
|
+
}
|
|
303
|
+
|
|
304
|
+
// compare_interval_with_zero: -1 when the interval lies below zero, 1 above, 0 when it holds it.
|
|
305
|
+
private compareIntervalWithZero(interval: Interval, zero: Anum) {
|
|
306
|
+
if (interval.upper !== null) {
|
|
307
|
+
const sign = this.am.compare(interval.upper, zero);
|
|
308
|
+
if (sign < 0 || (sign === 0 && interval.isUpperOpen)) return -1;
|
|
309
|
+
}
|
|
310
|
+
if (interval.lower !== null) {
|
|
311
|
+
const sign = this.am.compare(interval.lower, zero);
|
|
312
|
+
if (sign > 0 || (sign === 0 && interval.isLowerOpen)) return 1;
|
|
313
|
+
}
|
|
314
|
+
return 0;
|
|
315
|
+
}
|
|
316
|
+
|
|
317
|
+
// find_complement_sup: the interval whose lower bound is the supremum of the complement, when
|
|
318
|
+
// the set reaches +oo and the complement is not empty.
|
|
319
|
+
private findComplementSup(set: IntervalSet | null) {
|
|
320
|
+
if (set === null || set.intervals[set.intervals.length - 1].upper !== null) return null;
|
|
321
|
+
for (let index = set.intervals.length - 1; ; index--) {
|
|
322
|
+
const current = set.intervals[index];
|
|
323
|
+
if (current.lower === null) return null;
|
|
324
|
+
const previous = index > 0 ? set.intervals[index - 1] : null;
|
|
325
|
+
if (
|
|
326
|
+
previous === null ||
|
|
327
|
+
this.am.compare(previous.upper!, current.lower) < 0 ||
|
|
328
|
+
(current.isLowerOpen && previous.isUpperOpen)
|
|
329
|
+
)
|
|
330
|
+
return index;
|
|
331
|
+
}
|
|
332
|
+
}
|
|
333
|
+
|
|
334
|
+
// pick_max_in_complement: the largest number of the complement, or a number just below it.
|
|
335
|
+
pickMaxInComplement(set: IntervalSet | null) {
|
|
336
|
+
const index = this.findComplementSup(set);
|
|
337
|
+
if (index === null) return null;
|
|
338
|
+
const current = set!.intervals[index];
|
|
339
|
+
if (current.isLowerOpen) return this.am.copy(current.lower!);
|
|
340
|
+
if (index === 0) return this.am.intLt(current.lower!);
|
|
341
|
+
return this.am.select(set!.intervals[index - 1].upper!, current.lower!);
|
|
342
|
+
}
|
|
343
|
+
|
|
344
|
+
// query_max_in_complement: the supremum of the complement, and whether it belongs to it.
|
|
345
|
+
queryMaxInComplement(set: IntervalSet | null): ComplementMax | null {
|
|
346
|
+
const index = this.findComplementSup(set);
|
|
347
|
+
if (index === null) return null;
|
|
348
|
+
const current = set!.intervals[index];
|
|
349
|
+
return { sup: this.am.copy(current.lower!), isAttained: current.isLowerOpen };
|
|
350
|
+
}
|
|
351
|
+
}
|