tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
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 +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +120 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +757 -326
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +19 -30
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +9 -20
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +624 -9
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +886 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +178 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +34 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +111 -39
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +30 -11
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +68 -17
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +110 -24
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +22 -25
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2176 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +57 -26
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,7 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/nlsat/levelwise.cpp, src/nlsat/nlsat_common.cpp), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
|
-
// Deviation from Z3: ties between polynomials break by creation-order id, where Z3 recycles ids of
|
|
4
|
-
// freed polynomials (id_gen in polynomial.cpp), so a cell bound can be another polynomial with the same root.
|
|
5
1
|
import { NlsatUnsupportedError } from "../../../../errors";
|
|
6
2
|
import { Rational } from "../rational";
|
|
7
3
|
import { type AlgebraicManager, type Anum, mergeSortIndices } from "./algebraic";
|
|
@@ -10,14 +6,26 @@ import {
|
|
|
10
6
|
type Polynomial,
|
|
11
7
|
type PolynomialCache,
|
|
12
8
|
type PolynomialManager,
|
|
9
|
+
PolynomialRef,
|
|
10
|
+
PolynomialRefVector,
|
|
13
11
|
} from "./polynomial";
|
|
14
12
|
|
|
15
|
-
|
|
16
|
-
isSection
|
|
17
|
-
lower:
|
|
18
|
-
lowerIndex
|
|
19
|
-
upper:
|
|
20
|
-
upperIndex
|
|
13
|
+
export class CellInterval {
|
|
14
|
+
isSection = false;
|
|
15
|
+
readonly lower: PolynomialRef;
|
|
16
|
+
lowerIndex = 0;
|
|
17
|
+
readonly upper: PolynomialRef;
|
|
18
|
+
upperIndex = 0;
|
|
19
|
+
|
|
20
|
+
constructor(pm: PolynomialManager) {
|
|
21
|
+
this.lower = new PolynomialRef(pm);
|
|
22
|
+
this.upper = new PolynomialRef(pm);
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
release() {
|
|
26
|
+
this.upper.reset();
|
|
27
|
+
this.lower.reset();
|
|
28
|
+
}
|
|
21
29
|
}
|
|
22
30
|
|
|
23
31
|
interface RootFunction {
|
|
@@ -33,103 +41,119 @@ const UNSET = -1;
|
|
|
33
41
|
const BOTH_SIDES = 3;
|
|
34
42
|
const SPANNING_TREE_THRESHOLD = 4;
|
|
35
43
|
|
|
44
|
+
export const releaseIntervals = (intervals: readonly CellInterval[]) => {
|
|
45
|
+
for (let index = intervals.length; index-- > 0;) intervals[index].release();
|
|
46
|
+
};
|
|
47
|
+
|
|
36
48
|
export class TodoSet {
|
|
37
|
-
|
|
38
|
-
private inSet =
|
|
49
|
+
readonly set: PolynomialRefVector;
|
|
50
|
+
private inSet: boolean[] = [];
|
|
39
51
|
|
|
40
52
|
constructor(
|
|
41
|
-
private pm: PolynomialManager,
|
|
42
53
|
private cache: PolynomialCache,
|
|
43
|
-
|
|
54
|
+
private isCanonicalizing: boolean,
|
|
55
|
+
) {
|
|
56
|
+
this.set = new PolynomialRefVector(cache.pm);
|
|
57
|
+
}
|
|
44
58
|
|
|
45
59
|
get isEmpty() {
|
|
46
|
-
return this.
|
|
60
|
+
return this.set.size === 0;
|
|
47
61
|
}
|
|
48
62
|
|
|
49
63
|
reset() {
|
|
50
|
-
this.
|
|
51
|
-
this.
|
|
64
|
+
for (const polynomial of this.set.items) this.inSet[polynomial.id] = false;
|
|
65
|
+
this.set.reset();
|
|
52
66
|
}
|
|
53
67
|
|
|
54
68
|
insert(polynomial: Polynomial) {
|
|
55
|
-
|
|
69
|
+
const pm = this.cache.pm;
|
|
70
|
+
if (this.inSet[polynomial.id] === true) return polynomial;
|
|
56
71
|
if (this.cache.contains(polynomial)) {
|
|
57
|
-
this.inSet
|
|
58
|
-
this.
|
|
72
|
+
this.inSet[polynomial.id] = true;
|
|
73
|
+
this.set.push(polynomial);
|
|
59
74
|
return polynomial;
|
|
60
75
|
}
|
|
61
|
-
const
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
76
|
+
const pinned = new PolynomialRef(pm);
|
|
77
|
+
let p = polynomial;
|
|
78
|
+
if (this.isCanonicalizing) {
|
|
79
|
+
if (!pm.isZero(p) && !pm.isConst(p)) {
|
|
80
|
+
pinned.move(pm.pp(p, pm.maxVar(p)));
|
|
81
|
+
p = pinned.get();
|
|
82
|
+
} else pinned.set(p);
|
|
83
|
+
p = pm.flipSignIfLmNeg(p);
|
|
84
|
+
pinned.set(p);
|
|
85
|
+
}
|
|
86
|
+
p = this.cache.mkUnique(p);
|
|
87
|
+
if (this.inSet[p.id] !== true) {
|
|
88
|
+
this.inSet[p.id] = true;
|
|
89
|
+
this.set.push(p);
|
|
69
90
|
}
|
|
70
|
-
|
|
91
|
+
pinned.reset();
|
|
92
|
+
return p;
|
|
71
93
|
}
|
|
72
94
|
|
|
73
95
|
getMaxVar() {
|
|
74
|
-
|
|
75
|
-
for (const polynomial of this.polynomials) {
|
|
76
|
-
const variable = this.pm.maxVar(polynomial);
|
|
77
|
-
if (result === NULL_VAR || variable > result) result = variable;
|
|
78
|
-
}
|
|
79
|
-
return result;
|
|
96
|
+
return this.cache.pm.getMaxVarOfPolys(this.set.items);
|
|
80
97
|
}
|
|
81
98
|
|
|
82
|
-
extractMaxPolys(out:
|
|
83
|
-
out.
|
|
99
|
+
extractMaxPolys(out: PolynomialRefVector) {
|
|
100
|
+
out.reset();
|
|
84
101
|
const variable = this.getMaxVar();
|
|
85
102
|
this.extractPolysAtLevel(variable, out);
|
|
86
103
|
return variable;
|
|
87
104
|
}
|
|
88
105
|
|
|
89
|
-
extractPolysAtLevel(variable: number, out:
|
|
90
|
-
const
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
this.
|
|
106
|
+
extractPolysAtLevel(variable: number, out: PolynomialRefVector) {
|
|
107
|
+
const pm = this.cache.pm;
|
|
108
|
+
let kept = 0;
|
|
109
|
+
for (let index = 0; index < this.set.size; index++) {
|
|
110
|
+
const polynomial = this.set.get(index);
|
|
111
|
+
if (pm.maxVar(polynomial) === variable) {
|
|
112
|
+
out.push(polynomial);
|
|
113
|
+
this.inSet[polynomial.id] = false;
|
|
114
|
+
} else this.set.set(kept++, polynomial);
|
|
98
115
|
}
|
|
99
|
-
this.
|
|
116
|
+
this.set.shrink(kept);
|
|
100
117
|
}
|
|
101
118
|
}
|
|
102
119
|
|
|
103
|
-
class Levelwise {
|
|
104
|
-
|
|
105
|
-
private todo: TodoSet;
|
|
120
|
+
export class Levelwise {
|
|
121
|
+
readonly intervals: CellInterval[] = [];
|
|
106
122
|
private level = 0;
|
|
107
|
-
private levelPolys: Polynomial[] = [];
|
|
108
|
-
private witnesses: (Polynomial | null)[] = [];
|
|
109
|
-
private hasRoots: boolean[] = [];
|
|
110
|
-
private rootFunctions: RootFunction[] = [];
|
|
111
|
-
private pairs = new Map<string, [number, number]>();
|
|
112
|
-
private sideMask: number[] = [];
|
|
113
|
-
private isLcOmitted: boolean[] = [];
|
|
114
123
|
private lowerRf = UNSET;
|
|
115
124
|
private upperRf = UNSET;
|
|
125
|
+
private todo: TodoSet;
|
|
126
|
+
private levelPs: PolynomialRefVector;
|
|
127
|
+
private witnesses: PolynomialRef[] = [];
|
|
128
|
+
private polyHasRoots: boolean[] = [];
|
|
129
|
+
private pscTmp: PolynomialRefVector;
|
|
130
|
+
private sideMask: number[] = [];
|
|
131
|
+
private isLcOmitted: boolean[] = [];
|
|
132
|
+
private degInOrderGraph: number[] = [];
|
|
133
|
+
private rootFunctions: RootFunction[] = [];
|
|
134
|
+
private pairs = new Map<string, [number, number]>();
|
|
116
135
|
|
|
117
136
|
constructor(
|
|
118
137
|
private pm: PolynomialManager,
|
|
119
138
|
private am: AlgebraicManager,
|
|
120
139
|
private cache: PolynomialCache,
|
|
121
|
-
private
|
|
140
|
+
private polynomials: PolynomialRefVector,
|
|
122
141
|
private maxVar: number,
|
|
142
|
+
private sample: readonly (Anum | undefined)[],
|
|
123
143
|
private isLinear: boolean,
|
|
124
144
|
) {
|
|
125
|
-
this.todo = new TodoSet(
|
|
126
|
-
this.
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
145
|
+
this.todo = new TodoSet(cache, true);
|
|
146
|
+
this.levelPs = new PolynomialRefVector(pm);
|
|
147
|
+
this.pscTmp = new PolynomialRefVector(pm);
|
|
148
|
+
for (let index = 0; index < maxVar; index++) this.intervals.push(new CellInterval(pm));
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
release() {
|
|
152
|
+
this.pscTmp.reset();
|
|
153
|
+
this.clearWitnesses();
|
|
154
|
+
this.levelPs.reset();
|
|
155
|
+
this.todo.set.reset();
|
|
156
|
+
releaseIntervals(this.intervals);
|
|
133
157
|
}
|
|
134
158
|
|
|
135
159
|
private getSign(polynomial: Polynomial) {
|
|
@@ -140,93 +164,200 @@ class Levelwise {
|
|
|
140
164
|
return this.sample.map((value, index) => (index === variable ? undefined : value));
|
|
141
165
|
}
|
|
142
166
|
|
|
143
|
-
private
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
for (let
|
|
173
|
-
if (
|
|
174
|
-
const
|
|
175
|
-
|
|
176
|
-
if (
|
|
177
|
-
|
|
167
|
+
private clearWitnesses() {
|
|
168
|
+
for (let index = this.witnesses.length; index-- > 0;) this.witnesses[index].reset();
|
|
169
|
+
this.witnesses = [];
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
private handleNullifiedPoly(p: Polynomial) {
|
|
173
|
+
const pm = this.pm;
|
|
174
|
+
const degree = pm.degree(p, this.level);
|
|
175
|
+
for (let power = 0; power <= degree; power++) {
|
|
176
|
+
const coeff = new PolynomialRef(pm);
|
|
177
|
+
coeff.set(pm.coeff(p, this.level, power));
|
|
178
|
+
if (!pm.isZero(coeff.get()) && !pm.isConst(coeff.get())) this.requestFactorized(coeff.get());
|
|
179
|
+
coeff.reset();
|
|
180
|
+
}
|
|
181
|
+
let curPolys = new PolynomialRefVector(pm);
|
|
182
|
+
let curMinVar: number[] = [];
|
|
183
|
+
curPolys.push(p);
|
|
184
|
+
curMinVar.push(0);
|
|
185
|
+
while (curPolys.size > 0) {
|
|
186
|
+
const nextPolys = new PolynomialRefVector(pm);
|
|
187
|
+
const nextMinVar: number[] = [];
|
|
188
|
+
for (let index = 0; index < curPolys.size; index++) {
|
|
189
|
+
const q = new PolynomialRef(pm);
|
|
190
|
+
q.set(curPolys.get(index));
|
|
191
|
+
const maxVar = pm.maxVar(q.get());
|
|
192
|
+
if (maxVar === NULL_VAR) {
|
|
193
|
+
q.reset();
|
|
194
|
+
continue;
|
|
195
|
+
}
|
|
196
|
+
for (let x = curMinVar[index]; x <= maxVar; x++) {
|
|
197
|
+
if (pm.degree(q.get(), x) === 0) continue;
|
|
198
|
+
const dq = new PolynomialRef(pm);
|
|
199
|
+
dq.set(pm.derivative(q.get(), x));
|
|
200
|
+
if (pm.isZero(dq.get()) || pm.isConst(dq.get())) {
|
|
201
|
+
dq.reset();
|
|
202
|
+
continue;
|
|
203
|
+
}
|
|
204
|
+
if (this.getSign(dq.get()) !== 0) {
|
|
205
|
+
this.requestFactorized(dq.get());
|
|
206
|
+
dq.reset();
|
|
207
|
+
q.reset();
|
|
208
|
+
nextPolys.reset();
|
|
209
|
+
curPolys.reset();
|
|
178
210
|
return;
|
|
179
211
|
}
|
|
180
|
-
|
|
212
|
+
nextPolys.push(dq.get());
|
|
213
|
+
nextMinVar.push(x);
|
|
214
|
+
dq.reset();
|
|
181
215
|
}
|
|
216
|
+
q.reset();
|
|
217
|
+
}
|
|
218
|
+
for (let index = 0; index < nextPolys.size; index++) {
|
|
219
|
+
const dq = new PolynomialRef(pm);
|
|
220
|
+
dq.set(nextPolys.get(index));
|
|
221
|
+
this.requestFactorized(dq.get());
|
|
222
|
+
dq.reset();
|
|
223
|
+
}
|
|
224
|
+
curPolys.reset();
|
|
225
|
+
curPolys = nextPolys;
|
|
226
|
+
curMinVar = nextMinVar;
|
|
227
|
+
}
|
|
228
|
+
}
|
|
229
|
+
|
|
230
|
+
private resetInterval(interval: CellInterval) {
|
|
231
|
+
interval.isSection = false;
|
|
232
|
+
interval.lower.reset();
|
|
233
|
+
interval.upper.reset();
|
|
234
|
+
interval.lowerIndex = 0;
|
|
235
|
+
interval.upperIndex = 0;
|
|
236
|
+
}
|
|
237
|
+
|
|
238
|
+
private getFirstPsc(chain: PolynomialRefVector) {
|
|
239
|
+
const r = new PolynomialRef(this.pm);
|
|
240
|
+
for (let index = 0; index < chain.size; index++) {
|
|
241
|
+
r.set(chain.get(index));
|
|
242
|
+
if (this.pm.isZero(r.get())) continue;
|
|
243
|
+
if (this.pm.isConst(r.get())) {
|
|
244
|
+
r.reset();
|
|
245
|
+
return r;
|
|
182
246
|
}
|
|
183
|
-
|
|
184
|
-
|
|
247
|
+
return r;
|
|
248
|
+
}
|
|
249
|
+
r.reset();
|
|
250
|
+
return r;
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
private pscDiscriminant(pIn: Polynomial, x: number) {
|
|
254
|
+
const pm = this.pm;
|
|
255
|
+
if (pm.isZero(pIn) || pm.isConst(pIn) || pm.degree(pIn, x) < 2) return new PolynomialRef(pm);
|
|
256
|
+
const p = new PolynomialRef(pm);
|
|
257
|
+
p.set(pIn);
|
|
258
|
+
const d = new PolynomialRef(pm);
|
|
259
|
+
d.set(pm.derivative(p.get(), x));
|
|
260
|
+
const chain = this.pscTmp;
|
|
261
|
+
chain.reset();
|
|
262
|
+
this.cache.pscChain(p.get(), d.get(), x, chain);
|
|
263
|
+
const disc = this.getFirstPsc(chain);
|
|
264
|
+
d.reset();
|
|
265
|
+
p.reset();
|
|
266
|
+
return disc;
|
|
267
|
+
}
|
|
268
|
+
|
|
269
|
+
private pscResultant(a: Polynomial, b: Polynomial, x: number) {
|
|
270
|
+
const pa = new PolynomialRef(this.pm);
|
|
271
|
+
pa.set(a);
|
|
272
|
+
const pb = new PolynomialRef(this.pm);
|
|
273
|
+
pb.set(b);
|
|
274
|
+
const chain = this.pscTmp;
|
|
275
|
+
chain.reset();
|
|
276
|
+
this.cache.pscChain(pa.get(), pb.get(), x, chain);
|
|
277
|
+
const r = this.getFirstPsc(chain);
|
|
278
|
+
pb.reset();
|
|
279
|
+
pa.reset();
|
|
280
|
+
return r;
|
|
281
|
+
}
|
|
282
|
+
|
|
283
|
+
private requestFactorized(polynomial: Polynomial | null) {
|
|
284
|
+
const pm = this.pm;
|
|
285
|
+
if (polynomial === null || pm.isZero(polynomial) || pm.isConst(polynomial)) return;
|
|
286
|
+
const factors = new PolynomialRefVector(pm);
|
|
287
|
+
this.cache.factor(polynomial, factors);
|
|
288
|
+
for (let index = 0; index < factors.size; index++) {
|
|
289
|
+
const f = new PolynomialRef(pm);
|
|
290
|
+
f.set(factors.get(index));
|
|
291
|
+
if (!pm.isZero(f.get()) && !pm.isConst(f.get())) this.todo.insert(f.get());
|
|
292
|
+
f.reset();
|
|
185
293
|
}
|
|
294
|
+
factors.reset();
|
|
186
295
|
}
|
|
187
296
|
|
|
188
|
-
private chooseNonzeroCoeff(
|
|
189
|
-
const
|
|
297
|
+
private chooseNonzeroCoeff(p: Polynomial, x: number) {
|
|
298
|
+
const pm = this.pm;
|
|
299
|
+
const degree = pm.degree(p, x);
|
|
300
|
+
const coeff = new PolynomialRef(pm);
|
|
190
301
|
for (let power = 0; power <= degree; power++) {
|
|
191
|
-
|
|
192
|
-
if (
|
|
302
|
+
coeff.set(pm.coeff(p, x, power));
|
|
303
|
+
if (pm.isZero(coeff.get())) continue;
|
|
304
|
+
if (pm.isConst(coeff.get())) return coeff;
|
|
193
305
|
}
|
|
194
|
-
|
|
306
|
+
const best = new PolynomialRef(pm);
|
|
307
|
+
let bestTotalDegree = 0;
|
|
308
|
+
let bestSize = 0;
|
|
309
|
+
let bestMaxVar = NULL_VAR;
|
|
195
310
|
for (let power = 0; power <= degree; power++) {
|
|
196
|
-
|
|
197
|
-
|
|
198
|
-
|
|
199
|
-
const
|
|
311
|
+
coeff.set(pm.coeff(p, x, power));
|
|
312
|
+
const current = coeff.get();
|
|
313
|
+
if (pm.isZero(current) || this.getSign(current) === 0) continue;
|
|
314
|
+
const totalDegree = pm.totalDegree(current);
|
|
315
|
+
const size = current.size;
|
|
316
|
+
const maxVar = pm.maxVar(current);
|
|
200
317
|
if (
|
|
201
|
-
best === null ||
|
|
202
|
-
totalDegree <
|
|
203
|
-
(totalDegree ===
|
|
204
|
-
(
|
|
205
|
-
(
|
|
206
|
-
)
|
|
207
|
-
best
|
|
318
|
+
best.getOrNull() === null ||
|
|
319
|
+
totalDegree < bestTotalDegree ||
|
|
320
|
+
(totalDegree === bestTotalDegree &&
|
|
321
|
+
(size < bestSize ||
|
|
322
|
+
(size === bestSize && (bestMaxVar === NULL_VAR || maxVar < bestMaxVar))))
|
|
323
|
+
) {
|
|
324
|
+
best.copy(coeff);
|
|
325
|
+
bestTotalDegree = totalDegree;
|
|
326
|
+
bestSize = size;
|
|
327
|
+
bestMaxVar = maxVar;
|
|
328
|
+
}
|
|
208
329
|
}
|
|
330
|
+
coeff.reset();
|
|
209
331
|
return best;
|
|
210
332
|
}
|
|
211
333
|
|
|
212
334
|
private addProjectionForPoly(
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
335
|
+
p: Polynomial,
|
|
336
|
+
x: number,
|
|
337
|
+
nonzeroCoeff: Polynomial | null,
|
|
216
338
|
isLcAdded: boolean,
|
|
339
|
+
isDiscAdded: boolean,
|
|
217
340
|
) {
|
|
218
|
-
|
|
341
|
+
const pm = this.pm;
|
|
342
|
+
let isNonzeroCoeffAdded = nonzeroCoeff !== null && !pm.isConst(nonzeroCoeff);
|
|
219
343
|
if (isLcAdded) {
|
|
220
|
-
const
|
|
221
|
-
|
|
222
|
-
|
|
344
|
+
const lc = new PolynomialRef(pm);
|
|
345
|
+
lc.set(pm.coeff(p, x, pm.degree(p, x)));
|
|
346
|
+
this.requestFactorized(lc.get());
|
|
347
|
+
if (isNonzeroCoeffAdded && this.getSign(lc.get()) !== 0) isNonzeroCoeffAdded = false;
|
|
348
|
+
lc.reset();
|
|
223
349
|
}
|
|
224
|
-
|
|
225
|
-
|
|
226
|
-
this.
|
|
227
|
-
|
|
350
|
+
if (isDiscAdded) {
|
|
351
|
+
const disc = new PolynomialRef(pm);
|
|
352
|
+
disc.move(this.pscDiscriminant(p, x));
|
|
353
|
+
const value = disc.getOrNull();
|
|
354
|
+
if (value !== null) {
|
|
355
|
+
this.requestFactorized(value);
|
|
356
|
+
if (isNonzeroCoeffAdded && this.getSign(value) !== 0) isNonzeroCoeffAdded = false;
|
|
357
|
+
}
|
|
358
|
+
disc.reset();
|
|
228
359
|
}
|
|
229
|
-
if (
|
|
360
|
+
if (isNonzeroCoeffAdded) this.requestFactorized(nonzeroCoeff);
|
|
230
361
|
}
|
|
231
362
|
|
|
232
363
|
private addPair(first: number, second: number) {
|
|
@@ -248,7 +379,7 @@ class Levelwise {
|
|
|
248
379
|
|
|
249
380
|
private computeSideMask() {
|
|
250
381
|
if (this.lowerRf === UNSET) return;
|
|
251
|
-
while (this.sideMask.length < this.
|
|
382
|
+
while (this.sideMask.length < this.levelPs.size) this.sideMask.push(0);
|
|
252
383
|
this.rootFunctions.forEach((rootFunction, index) => {
|
|
253
384
|
this.sideMask[rootFunction.psIndex] |= index <= this.lowerRf ? 1 : 2;
|
|
254
385
|
});
|
|
@@ -258,20 +389,24 @@ class Levelwise {
|
|
|
258
389
|
return rootFunctionIndex === UNSET ? UNSET : this.rootFunctions[rootFunctionIndex].psIndex;
|
|
259
390
|
}
|
|
260
391
|
|
|
392
|
+
private computeResultantGraphDegree() {
|
|
393
|
+
this.degInOrderGraph = Array.from({ length: this.levelPs.size }, () => 0);
|
|
394
|
+
for (const pair of this.pairs.values()) {
|
|
395
|
+
this.degInOrderGraph[pair[0]]++;
|
|
396
|
+
this.degInOrderGraph[pair[1]]++;
|
|
397
|
+
}
|
|
398
|
+
}
|
|
399
|
+
|
|
261
400
|
private computeOmitLcBothSides(isLeafRequired: boolean) {
|
|
262
|
-
this.isLcOmitted = this.
|
|
401
|
+
this.isLcOmitted = Array.from({ length: this.levelPs.size }, () => false);
|
|
263
402
|
if (this.rootFunctions.length === 0 || this.pairs.size === 0 || this.sideMask.length === 0)
|
|
264
403
|
return;
|
|
265
|
-
|
|
266
|
-
for (const pair of this.pairs.values()) {
|
|
267
|
-
degrees[pair[0]]++;
|
|
268
|
-
degrees[pair[1]]++;
|
|
269
|
-
}
|
|
404
|
+
if (isLeafRequired) this.computeResultantGraphDegree();
|
|
270
405
|
const lowerBound = this.getBoundIndex(this.lowerRf);
|
|
271
406
|
const upperBound = this.getBoundIndex(this.upperRf);
|
|
272
|
-
for (let index = 0; index < this.
|
|
407
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
273
408
|
if (this.sideMask[index] !== BOTH_SIDES) continue;
|
|
274
|
-
if (isLeafRequired &&
|
|
409
|
+
if (isLeafRequired && this.degInOrderGraph[index] !== 1) continue;
|
|
275
410
|
if (index === lowerBound || index === upperBound) continue;
|
|
276
411
|
this.isLcOmitted[index] = true;
|
|
277
412
|
}
|
|
@@ -287,26 +422,24 @@ class Levelwise {
|
|
|
287
422
|
}
|
|
288
423
|
|
|
289
424
|
private fillRelationSection() {
|
|
425
|
+
if (this.rootFunctions.length === 0) return;
|
|
290
426
|
for (let index = 0; index < this.lowerRf; index++) this.addPair(index, this.lowerRf);
|
|
291
427
|
for (let index = this.lowerRf + 1; index < this.rootFunctions.length; index++)
|
|
292
428
|
this.addPair(this.lowerRf, index);
|
|
293
429
|
}
|
|
294
430
|
|
|
295
431
|
private buildBothSideSpanningTree() {
|
|
296
|
-
const lowerRfs = this.
|
|
297
|
-
const upperRfs = this.
|
|
432
|
+
const lowerRfs = Array.from({ length: this.levelPs.size }, () => UNSET);
|
|
433
|
+
const upperRfs = Array.from({ length: this.levelPs.size }, () => UNSET);
|
|
298
434
|
for (let index = 0; index <= this.lowerRf; index++)
|
|
299
435
|
lowerRfs[this.rootFunctions[index].psIndex] = index;
|
|
300
436
|
for (let index = this.upperRf; index < this.rootFunctions.length; index++)
|
|
301
437
|
upperRfs[this.rootFunctions[index].psIndex] = index;
|
|
302
|
-
const both =
|
|
303
|
-
|
|
304
|
-
|
|
305
|
-
lowerRf: lowerRfs[psIndex],
|
|
306
|
-
|
|
307
|
-
}))
|
|
308
|
-
.filter((info) => this.sideMask[info.psIndex] === BOTH_SIDES)
|
|
309
|
-
.sort((first, second) => first.lowerRf - second.lowerRf);
|
|
438
|
+
const both: { psIndex: number; lowerRf: number; upperRf: number }[] = [];
|
|
439
|
+
for (let psIndex = 0; psIndex < this.levelPs.size; psIndex++)
|
|
440
|
+
if (this.sideMask[psIndex] === BOTH_SIDES)
|
|
441
|
+
both.push({ psIndex, lowerRf: lowerRfs[psIndex], upperRf: upperRfs[psIndex] });
|
|
442
|
+
both.sort((first, second) => first.lowerRf - second.lowerRf);
|
|
310
443
|
for (let first = 0; first < both.length - 1; first++) {
|
|
311
444
|
let closest = first + 1;
|
|
312
445
|
for (let index = first + 2; index < both.length; index++)
|
|
@@ -337,21 +470,21 @@ class Levelwise {
|
|
|
337
470
|
}
|
|
338
471
|
|
|
339
472
|
private isolateRootsAroundSample(
|
|
473
|
+
p: Polynomial,
|
|
340
474
|
psIndex: number,
|
|
341
475
|
value: Anum,
|
|
342
476
|
lower: RootFunction[],
|
|
343
477
|
upper: RootFunction[],
|
|
344
478
|
) {
|
|
345
|
-
const polynomial = this.levelPolys[psIndex];
|
|
346
479
|
const values = this.getValuesWithout(this.level);
|
|
347
480
|
const mkRootFunction = (root: Anum, index: number) => ({
|
|
348
481
|
value: this.am.copy(root),
|
|
349
|
-
polynomial,
|
|
482
|
+
polynomial: p,
|
|
350
483
|
index,
|
|
351
484
|
psIndex,
|
|
352
485
|
});
|
|
353
486
|
if (value.value instanceof Rational) {
|
|
354
|
-
const closest = this.am.isolateRootsClosest(this.pm,
|
|
487
|
+
const closest = this.am.isolateRootsClosest(this.pm, p, values, value.value);
|
|
355
488
|
closest.roots.forEach((root, index) => {
|
|
356
489
|
(this.am.compare(root, value) <= 0 ? lower : upper).push(
|
|
357
490
|
mkRootFunction(root, closest.indices[index]),
|
|
@@ -359,7 +492,7 @@ class Levelwise {
|
|
|
359
492
|
});
|
|
360
493
|
return closest.roots.length > 0;
|
|
361
494
|
}
|
|
362
|
-
const roots = this.am.isolateRoots(this.pm,
|
|
495
|
+
const roots = this.am.isolateRoots(this.pm, p, values);
|
|
363
496
|
let lowerIndex = UNSET;
|
|
364
497
|
let upperIndex = UNSET;
|
|
365
498
|
let isSection = false;
|
|
@@ -406,95 +539,115 @@ class Levelwise {
|
|
|
406
539
|
if (middle === 0) {
|
|
407
540
|
this.lowerRf = UNSET;
|
|
408
541
|
this.upperRf = 0;
|
|
409
|
-
interval.upper
|
|
542
|
+
interval.upper.set(rootFunctions[0].polynomial);
|
|
410
543
|
interval.upperIndex = rootFunctions[0].index;
|
|
411
544
|
return;
|
|
412
545
|
}
|
|
413
546
|
this.lowerRf = middle - 1;
|
|
414
547
|
const lower = rootFunctions[middle - 1];
|
|
415
|
-
interval.lower = lower.polynomial;
|
|
416
|
-
interval.lowerIndex = lower.index;
|
|
417
548
|
if (this.am.compare(lower.value, value) === 0) {
|
|
418
549
|
interval.isSection = true;
|
|
550
|
+
interval.lower.set(lower.polynomial);
|
|
551
|
+
interval.lowerIndex = lower.index;
|
|
419
552
|
this.upperRf = this.lowerRf;
|
|
420
553
|
return;
|
|
421
554
|
}
|
|
555
|
+
interval.lower.set(lower.polynomial);
|
|
556
|
+
interval.lowerIndex = lower.index;
|
|
422
557
|
if (middle < rootFunctions.length) {
|
|
423
558
|
this.upperRf = this.lowerRf + 1;
|
|
424
|
-
interval.upper
|
|
559
|
+
interval.upper.set(rootFunctions[middle].polynomial);
|
|
425
560
|
interval.upperIndex = rootFunctions[middle].index;
|
|
426
561
|
}
|
|
427
562
|
}
|
|
428
563
|
|
|
429
|
-
private addLinearPolyFromRoot(root: Anum, isLower: boolean) {
|
|
430
|
-
const
|
|
431
|
-
const
|
|
432
|
-
|
|
433
|
-
|
|
434
|
-
);
|
|
564
|
+
private addLinearPolyFromRoot(root: Anum, isLower: boolean, p: PolynomialRef) {
|
|
565
|
+
const pm = this.pm;
|
|
566
|
+
const value = this.am.toRational(root);
|
|
567
|
+
p.set(pm.mkVar(this.level));
|
|
568
|
+
const scaled = new PolynomialRef(pm);
|
|
569
|
+
scaled.set(pm.mulConst(value.den, p.get()));
|
|
570
|
+
const constant = new PolynomialRef(pm);
|
|
571
|
+
constant.set(pm.mkConst(value.num));
|
|
572
|
+
const difference = new PolynomialRef(pm);
|
|
573
|
+
difference.set(pm.sub(scaled.get(), constant.get()));
|
|
574
|
+
constant.reset();
|
|
575
|
+
p.move(difference);
|
|
576
|
+
scaled.reset();
|
|
435
577
|
const interval = this.intervals[this.level];
|
|
436
578
|
if (isLower) {
|
|
437
|
-
interval.lower
|
|
579
|
+
interval.lower.copy(p);
|
|
438
580
|
interval.lowerIndex = 1;
|
|
439
581
|
} else {
|
|
440
|
-
interval.upper
|
|
582
|
+
interval.upper.copy(p);
|
|
441
583
|
interval.upperIndex = 1;
|
|
442
584
|
}
|
|
443
|
-
this.
|
|
444
|
-
this.
|
|
445
|
-
this.
|
|
446
|
-
|
|
585
|
+
this.levelPs.push(p.get());
|
|
586
|
+
this.polyHasRoots.push(true);
|
|
587
|
+
const witness = this.chooseNonzeroCoeff(p.get(), this.level);
|
|
588
|
+
const copy = new PolynomialRef(pm);
|
|
589
|
+
copy.copy(witness);
|
|
590
|
+
this.witnesses.push(copy);
|
|
591
|
+
witness.reset();
|
|
447
592
|
}
|
|
448
593
|
|
|
449
594
|
private addLinearApproximations(value: Anum) {
|
|
595
|
+
const pLower = new PolynomialRef(this.pm);
|
|
596
|
+
const pUpper = new PolynomialRef(this.pm);
|
|
450
597
|
const interval = this.intervals[this.level];
|
|
451
598
|
const mkRootFunction = (polynomial: Polynomial, root: Anum) => ({
|
|
452
599
|
value: this.am.copy(root),
|
|
453
600
|
polynomial,
|
|
454
601
|
index: 1,
|
|
455
|
-
psIndex: this.
|
|
602
|
+
psIndex: this.levelPs.size - 1,
|
|
456
603
|
});
|
|
457
604
|
if (interval.isSection) {
|
|
458
605
|
if (!this.am.isRational(value))
|
|
459
606
|
throw new NlsatUnsupportedError("a linear cell around an irrational section");
|
|
460
|
-
if (this.pm.totalDegree(interval.lower
|
|
461
|
-
|
|
462
|
-
this.rootFunctions.splice(this.lowerRf, 0, mkRootFunction(
|
|
607
|
+
if (this.pm.totalDegree(interval.lower.get()) > 1) {
|
|
608
|
+
this.addLinearPolyFromRoot(value, true, pLower);
|
|
609
|
+
this.rootFunctions.splice(this.lowerRf, 0, mkRootFunction(pLower.get(), value));
|
|
463
610
|
}
|
|
611
|
+
pUpper.reset();
|
|
612
|
+
pLower.reset();
|
|
464
613
|
return;
|
|
465
614
|
}
|
|
466
|
-
|
|
615
|
+
const lower = interval.lower.getOrNull();
|
|
616
|
+
if (lower !== null && this.pm.totalDegree(lower) > 1) {
|
|
467
617
|
const between = this.am.select(this.rootFunctions[this.lowerRf].value, value);
|
|
468
|
-
|
|
469
|
-
this.rootFunctions.splice(this.lowerRf + 1, 0, mkRootFunction(
|
|
618
|
+
this.addLinearPolyFromRoot(between, true, pLower);
|
|
619
|
+
this.rootFunctions.splice(this.lowerRf + 1, 0, mkRootFunction(pLower.get(), between));
|
|
470
620
|
this.lowerRf++;
|
|
471
621
|
if (this.upperRf !== UNSET) this.upperRf++;
|
|
472
622
|
}
|
|
473
|
-
|
|
623
|
+
const upper = interval.upper.getOrNull();
|
|
624
|
+
if (upper !== null && this.pm.totalDegree(upper) > 1) {
|
|
474
625
|
const between = this.am.select(value, this.rootFunctions[this.upperRf].value);
|
|
475
|
-
|
|
476
|
-
this.rootFunctions.splice(this.upperRf, 0, mkRootFunction(
|
|
626
|
+
this.addLinearPolyFromRoot(between, false, pUpper);
|
|
627
|
+
this.rootFunctions.splice(this.upperRf, 0, mkRootFunction(pUpper.get(), between));
|
|
477
628
|
}
|
|
629
|
+
pUpper.reset();
|
|
630
|
+
pLower.reset();
|
|
478
631
|
}
|
|
479
632
|
|
|
480
633
|
private buildInterval() {
|
|
481
634
|
this.rootFunctions = [];
|
|
482
635
|
this.pairs.clear();
|
|
483
|
-
|
|
484
|
-
isSection: false,
|
|
485
|
-
lower: null,
|
|
486
|
-
lowerIndex: 0,
|
|
487
|
-
upper: null,
|
|
488
|
-
upperIndex: 0,
|
|
489
|
-
});
|
|
636
|
+
this.resetInterval(this.intervals[this.level]);
|
|
490
637
|
this.lowerRf = UNSET;
|
|
491
638
|
this.upperRf = UNSET;
|
|
492
639
|
const value = this.sample[this.level]!;
|
|
640
|
+
this.polyHasRoots = Array.from({ length: this.levelPs.size }, () => false);
|
|
493
641
|
const lower: RootFunction[] = [];
|
|
494
642
|
const upper: RootFunction[] = [];
|
|
495
|
-
|
|
496
|
-
this.isolateRootsAroundSample(
|
|
497
|
-
|
|
643
|
+
for (let index = 0; index < this.levelPs.size; index++)
|
|
644
|
+
this.polyHasRoots[index] = this.isolateRootsAroundSample(
|
|
645
|
+
this.levelPs.get(index),
|
|
646
|
+
index,
|
|
647
|
+
value,
|
|
648
|
+
lower,
|
|
649
|
+
upper,
|
|
650
|
+
);
|
|
498
651
|
if (lower.length === 0 && upper.length === 0) return false;
|
|
499
652
|
this.rootFunctions = [
|
|
500
653
|
...this.sortRootFunctions(lower, true),
|
|
@@ -507,20 +660,27 @@ class Levelwise {
|
|
|
507
660
|
}
|
|
508
661
|
|
|
509
662
|
private addRelationResultants() {
|
|
510
|
-
for (const pair of this.getSortedPairs())
|
|
511
|
-
this.
|
|
512
|
-
this.
|
|
663
|
+
for (const pair of this.getSortedPairs()) {
|
|
664
|
+
const res = this.pscResultant(
|
|
665
|
+
this.levelPs.get(pair[0]),
|
|
666
|
+
this.levelPs.get(pair[1]),
|
|
667
|
+
this.level,
|
|
513
668
|
);
|
|
669
|
+
this.requestFactorized(res.getOrNull());
|
|
670
|
+
res.reset();
|
|
671
|
+
}
|
|
514
672
|
}
|
|
515
673
|
|
|
516
674
|
private addAdjacentRootResultants() {
|
|
675
|
+
this.polyHasRoots = Array.from({ length: this.levelPs.size }, () => false);
|
|
517
676
|
const rootValues: { root: Anum; polynomial: Polynomial }[] = [];
|
|
518
677
|
const values = this.getValuesWithout(this.maxVar);
|
|
519
|
-
|
|
678
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
679
|
+
const polynomial = this.levelPs.get(index);
|
|
520
680
|
const roots = this.am.isolateRoots(this.pm, polynomial, values);
|
|
681
|
+
this.polyHasRoots[index] = roots.length > 0;
|
|
521
682
|
for (const root of roots) rootValues.push({ root: this.am.copy(root), polynomial });
|
|
522
|
-
|
|
523
|
-
});
|
|
683
|
+
}
|
|
524
684
|
if (rootValues.length < 2) return;
|
|
525
685
|
const order = mergeSortIndices(
|
|
526
686
|
rootValues.length,
|
|
@@ -535,32 +695,51 @@ class Levelwise {
|
|
|
535
695
|
const key = `${low.id},${high.id}`;
|
|
536
696
|
if (added.has(key)) continue;
|
|
537
697
|
added.add(key);
|
|
538
|
-
this.
|
|
698
|
+
const res = this.pscResultant(low, high, this.maxVar);
|
|
699
|
+
this.requestFactorized(res.getOrNull());
|
|
700
|
+
res.reset();
|
|
539
701
|
}
|
|
540
702
|
}
|
|
541
703
|
|
|
542
704
|
private addSectionProjections() {
|
|
543
|
-
const sectionPolynomial = this.intervals[this.level].lower;
|
|
705
|
+
const sectionPolynomial = this.intervals[this.level].lower.get();
|
|
544
706
|
const withRoots = new Set(this.rootFunctions.map((rootFunction) => rootFunction.psIndex));
|
|
545
|
-
this.
|
|
546
|
-
const
|
|
547
|
-
|
|
548
|
-
|
|
707
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
708
|
+
const p = new PolynomialRef(this.pm);
|
|
709
|
+
p.set(this.levelPs.get(index));
|
|
710
|
+
const witness = new PolynomialRef(this.pm);
|
|
711
|
+
witness.copy(this.witnesses[index]);
|
|
712
|
+
const isFull = this.levelPs.get(index) === sectionPolynomial || !withRoots.has(index);
|
|
713
|
+
this.addProjectionForPoly(p.get(), this.level, witness.getOrNull(), isFull, true);
|
|
714
|
+
witness.reset();
|
|
715
|
+
p.reset();
|
|
716
|
+
}
|
|
549
717
|
}
|
|
550
718
|
|
|
551
719
|
private addSectorProjections() {
|
|
552
|
-
|
|
720
|
+
const pm = this.pm;
|
|
721
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
722
|
+
const p = new PolynomialRef(pm);
|
|
723
|
+
p.set(this.levelPs.get(index));
|
|
724
|
+
const lc = new PolynomialRef(pm);
|
|
725
|
+
lc.set(pm.coeff(p.get(), this.level, pm.degree(p.get(), this.level)));
|
|
553
726
|
const isLcAdded = !(this.isLcOmitted[index] ?? false);
|
|
554
|
-
|
|
727
|
+
const witness = new PolynomialRef(pm);
|
|
728
|
+
witness.copy(this.witnesses[index]);
|
|
729
|
+
const value = witness.getOrNull();
|
|
555
730
|
if (
|
|
556
731
|
isLcAdded &&
|
|
557
|
-
|
|
558
|
-
!
|
|
559
|
-
|
|
732
|
+
value !== null &&
|
|
733
|
+
!pm.isConst(value) &&
|
|
734
|
+
!pm.isZero(lc.get()) &&
|
|
735
|
+
this.getSign(lc.get()) !== 0
|
|
560
736
|
)
|
|
561
|
-
witness
|
|
562
|
-
this.addProjectionForPoly(
|
|
563
|
-
|
|
737
|
+
witness.reset();
|
|
738
|
+
this.addProjectionForPoly(p.get(), this.level, witness.getOrNull(), isLcAdded, true);
|
|
739
|
+
witness.reset();
|
|
740
|
+
lc.reset();
|
|
741
|
+
p.reset();
|
|
742
|
+
}
|
|
564
743
|
}
|
|
565
744
|
|
|
566
745
|
private shouldUseSpanningTree() {
|
|
@@ -568,12 +747,19 @@ class Levelwise {
|
|
|
568
747
|
if (this.lowerRf === UNSET || this.upperRf === UNSET) return false;
|
|
569
748
|
if (this.getBoundIndex(this.lowerRf) === this.getBoundIndex(this.upperRf)) return false;
|
|
570
749
|
let bothCount = 0;
|
|
571
|
-
for (let index = 0; index < this.
|
|
750
|
+
for (let index = 0; index < this.levelPs.size; index++)
|
|
572
751
|
if (this.sideMask[index] === BOTH_SIDES && ++bothCount >= SPANNING_TREE_THRESHOLD)
|
|
573
752
|
return true;
|
|
574
753
|
return false;
|
|
575
754
|
}
|
|
576
755
|
|
|
756
|
+
private clearLevelState() {
|
|
757
|
+
this.isLcOmitted = [];
|
|
758
|
+
this.pairs.clear();
|
|
759
|
+
this.sideMask = [];
|
|
760
|
+
this.degInOrderGraph = [];
|
|
761
|
+
}
|
|
762
|
+
|
|
577
763
|
private processLevelWithMode(mode: ProjectionMode, hasInterval: boolean) {
|
|
578
764
|
if (hasInterval) {
|
|
579
765
|
if (mode === "section") this.fillRelationSection();
|
|
@@ -590,21 +776,23 @@ class Levelwise {
|
|
|
590
776
|
}
|
|
591
777
|
|
|
592
778
|
private collectNonNullWitnesses() {
|
|
593
|
-
this.
|
|
594
|
-
for (let index = 0; index < this.
|
|
595
|
-
const
|
|
596
|
-
|
|
597
|
-
|
|
598
|
-
this.
|
|
599
|
-
|
|
600
|
-
|
|
779
|
+
this.clearWitnesses();
|
|
780
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
781
|
+
const p = new PolynomialRef(this.pm);
|
|
782
|
+
p.set(this.levelPs.get(index));
|
|
783
|
+
const witness = this.chooseNonzeroCoeff(p.get(), this.level);
|
|
784
|
+
if (witness.getOrNull() === null) this.handleNullifiedPoly(p.get());
|
|
785
|
+
const copy = new PolynomialRef(this.pm);
|
|
786
|
+
copy.copy(witness);
|
|
787
|
+
this.witnesses.push(copy);
|
|
788
|
+
if (index + 1 === this.levelPs.size) this.todo.extractPolysAtLevel(this.level, this.levelPs);
|
|
789
|
+
witness.reset();
|
|
790
|
+
p.reset();
|
|
601
791
|
}
|
|
602
792
|
}
|
|
603
793
|
|
|
604
794
|
private processLevel() {
|
|
605
|
-
this.
|
|
606
|
-
this.pairs.clear();
|
|
607
|
-
this.sideMask = [];
|
|
795
|
+
this.clearLevelState();
|
|
608
796
|
this.collectNonNullWitnesses();
|
|
609
797
|
const hasInterval = this.buildInterval();
|
|
610
798
|
this.processLevelWithMode(
|
|
@@ -618,39 +806,65 @@ class Levelwise {
|
|
|
618
806
|
}
|
|
619
807
|
|
|
620
808
|
private processTopLevel() {
|
|
809
|
+
const pm = this.pm;
|
|
621
810
|
this.collectNonNullWitnesses();
|
|
622
811
|
this.addAdjacentRootResultants();
|
|
623
|
-
this.
|
|
624
|
-
const
|
|
625
|
-
|
|
626
|
-
|
|
627
|
-
|
|
628
|
-
|
|
812
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
813
|
+
const p = new PolynomialRef(pm);
|
|
814
|
+
p.set(this.levelPs.get(index));
|
|
815
|
+
const lc = new PolynomialRef(pm);
|
|
816
|
+
lc.set(pm.coeff(p.get(), this.maxVar, pm.degree(p.get(), this.maxVar)));
|
|
817
|
+
let isLcAdded = true;
|
|
818
|
+
if (
|
|
819
|
+
!(this.polyHasRoots[index] ?? false) &&
|
|
820
|
+
!pm.isZero(lc.get()) &&
|
|
821
|
+
this.getSign(lc.get()) !== 0
|
|
822
|
+
) {
|
|
823
|
+
isLcAdded = false;
|
|
824
|
+
this.witnesses[index].reset();
|
|
825
|
+
}
|
|
826
|
+
this.addProjectionForPoly(
|
|
827
|
+
p.get(),
|
|
828
|
+
this.maxVar,
|
|
829
|
+
this.witnesses[index].getOrNull(),
|
|
830
|
+
isLcAdded,
|
|
831
|
+
true,
|
|
832
|
+
);
|
|
833
|
+
lc.reset();
|
|
834
|
+
p.reset();
|
|
835
|
+
}
|
|
836
|
+
}
|
|
837
|
+
|
|
838
|
+
private copyIntervals() {
|
|
839
|
+
return this.intervals.map((interval) => {
|
|
840
|
+
const copy = new CellInterval(this.pm);
|
|
841
|
+
copy.isSection = interval.isSection;
|
|
842
|
+
copy.lower.copy(interval.lower);
|
|
843
|
+
copy.lowerIndex = interval.lowerIndex;
|
|
844
|
+
copy.upper.copy(interval.upper);
|
|
845
|
+
copy.upperIndex = interval.upperIndex;
|
|
846
|
+
return copy;
|
|
629
847
|
});
|
|
630
848
|
}
|
|
631
849
|
|
|
632
|
-
|
|
633
|
-
if (this.maxVar === 0) return this.
|
|
634
|
-
|
|
635
|
-
|
|
850
|
+
singleCell() {
|
|
851
|
+
if (this.maxVar === 0) return this.copyIntervals();
|
|
852
|
+
this.todo.reset();
|
|
853
|
+
for (let index = 0; index < this.polynomials.size; index++) {
|
|
854
|
+
const p = new PolynomialRef(this.pm);
|
|
855
|
+
p.set(this.polynomials.get(index));
|
|
856
|
+
this.requestFactorized(p.get());
|
|
857
|
+
p.reset();
|
|
858
|
+
}
|
|
859
|
+
if (this.todo.isEmpty) return this.copyIntervals();
|
|
636
860
|
if (this.todo.getMaxVar() === this.maxVar) {
|
|
637
|
-
this.level = this.todo.extractMaxPolys(this.
|
|
861
|
+
this.level = this.todo.extractMaxPolys(this.levelPs);
|
|
638
862
|
this.processTopLevel();
|
|
639
863
|
}
|
|
640
864
|
while (!this.todo.isEmpty) {
|
|
641
|
-
this.level = this.todo.extractMaxPolys(this.
|
|
865
|
+
this.level = this.todo.extractMaxPolys(this.levelPs);
|
|
642
866
|
this.processLevel();
|
|
643
867
|
}
|
|
644
|
-
return this.
|
|
868
|
+
return this.copyIntervals();
|
|
645
869
|
}
|
|
646
870
|
}
|
|
647
|
-
|
|
648
|
-
export const getSingleCell = (
|
|
649
|
-
pm: PolynomialManager,
|
|
650
|
-
am: AlgebraicManager,
|
|
651
|
-
cache: PolynomialCache,
|
|
652
|
-
polynomials: readonly Polynomial[],
|
|
653
|
-
maxVar: number,
|
|
654
|
-
sample: readonly (Anum | undefined)[],
|
|
655
|
-
isLinear: boolean,
|
|
656
|
-
) => new Levelwise(pm, am, cache, sample, maxVar, isLinear).computeSingleCell(polynomials);
|