Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r488-tall-171631132900557.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DoubleExponent-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717194264551

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:24:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 22:24:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:24:25] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-31 22:24:25] [INFO ] Transformed 534 places.
[2024-05-31 22:24:25] [INFO ] Transformed 498 transitions.
[2024-05-31 22:24:25] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 498 rows 534 cols
[2024-05-31 22:24:26] [INFO ] Computed 54 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, 1, +inf, +inf, 1, 3, 1, 1, 1, 3, 2, +inf]
RANDOM walk for 10000 steps (325 resets) in 27 ms. (357 steps per ms)
FORMULA DoubleExponent-PT-010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150003 steps (4245 resets) in 222 ms. (672 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 3, 1, 1, 1, 3, 2, +inf]
[2024-05-31 22:24:26] [INFO ] Invariant cache hit.
[2024-05-31 22:24:26] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2024-05-31 22:24:26] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2024-05-31 22:24:27] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-05-31 22:24:27] [INFO ] Deduced a trap composed of 205 places in 407 ms of which 48 ms to minimize.
[2024-05-31 22:24:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-31 22:24:27] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-31 22:24:28] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-31 22:24:28] [INFO ] Deduced a trap composed of 187 places in 146 ms of which 4 ms to minimize.
[2024-05-31 22:24:28] [INFO ] Deduced a trap composed of 194 places in 152 ms of which 4 ms to minimize.
[2024-05-31 22:24:28] [INFO ] Deduced a trap composed of 195 places in 140 ms of which 4 ms to minimize.
[2024-05-31 22:24:28] [INFO ] Deduced a trap composed of 186 places in 157 ms of which 4 ms to minimize.
[2024-05-31 22:24:28] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 3 ms to minimize.
[2024-05-31 22:24:29] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:24:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1039 ms
[2024-05-31 22:24:29] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 36 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 22:24:32] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-31 22:24:32] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-31 22:24:33] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2024-05-31 22:24:33] [INFO ] Deduced a trap composed of 193 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:24:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-31 22:24:33] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2024-05-31 22:24:33] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-05-31 22:24:33] [INFO ] Deduced a trap composed of 193 places in 142 ms of which 3 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 221 places in 149 ms of which 3 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 229 places in 146 ms of which 4 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 4 ms to minimize.
[2024-05-31 22:24:34] [INFO ] Deduced a trap composed of 183 places in 143 ms of which 3 ms to minimize.
[2024-05-31 22:24:35] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 4 ms to minimize.
[2024-05-31 22:24:35] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-31 22:24:35] [INFO ] Deduced a trap composed of 188 places in 145 ms of which 3 ms to minimize.
[2024-05-31 22:24:35] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 3 ms to minimize.
[2024-05-31 22:24:35] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 3 ms to minimize.
[2024-05-31 22:24:36] [INFO ] Deduced a trap composed of 204 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:24:36] [INFO ] Deduced a trap composed of 193 places in 152 ms of which 3 ms to minimize.
[2024-05-31 22:24:36] [INFO ] Deduced a trap composed of 207 places in 144 ms of which 4 ms to minimize.
[2024-05-31 22:24:36] [INFO ] Deduced a trap composed of 206 places in 158 ms of which 3 ms to minimize.
[2024-05-31 22:24:37] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 3669 ms
[2024-05-31 22:24:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:24:37] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-31 22:24:37] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2024-05-31 22:24:37] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 3 ms to minimize.
[2024-05-31 22:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:24:38] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-31 22:24:38] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2024-05-31 22:24:38] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:24:38] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-05-31 22:24:38] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-31 22:24:38] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-31 22:24:39] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:24:39] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:24:39] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:24:39] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:24:39] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:24:39] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:24:39] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-05-31 22:24:39] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-31 22:24:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1666 ms
[2024-05-31 22:24:40] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 46 ms.
[2024-05-31 22:24:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 22:24:43] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-31 22:24:43] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2024-05-31 22:24:43] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-31 22:24:43] [INFO ] Deduced a trap composed of 140 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:24:43] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-31 22:24:44] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2024-05-31 22:24:44] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-31 22:24:44] [INFO ] Deduced a trap composed of 151 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:24:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2024-05-31 22:24:44] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-31 22:24:48] [INFO ] Added : 410 causal constraints over 82 iterations in 4275 ms. Result :unknown
[2024-05-31 22:24:48] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:24:48] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-31 22:24:48] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-05-31 22:24:49] [INFO ] Deduced a trap composed of 216 places in 148 ms of which 4 ms to minimize.
[2024-05-31 22:24:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:24:49] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-31 22:24:49] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2024-05-31 22:24:49] [INFO ] Deduced a trap composed of 216 places in 144 ms of which 3 ms to minimize.
[2024-05-31 22:24:49] [INFO ] Deduced a trap composed of 215 places in 143 ms of which 3 ms to minimize.
[2024-05-31 22:24:50] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-31 22:24:50] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 3 ms to minimize.
[2024-05-31 22:24:50] [INFO ] Deduced a trap composed of 208 places in 140 ms of which 3 ms to minimize.
[2024-05-31 22:24:50] [INFO ] Deduced a trap composed of 206 places in 138 ms of which 3 ms to minimize.
[2024-05-31 22:24:50] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 4 ms to minimize.
[2024-05-31 22:24:50] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-05-31 22:24:51] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 3 ms to minimize.
[2024-05-31 22:24:51] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 4 ms to minimize.
[2024-05-31 22:24:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1670 ms
[2024-05-31 22:24:51] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-31 22:24:54] [INFO ] Added : 325 causal constraints over 65 iterations in 3007 ms. Result :unknown
[2024-05-31 22:24:54] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:24:54] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-31 22:24:54] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2024-05-31 22:24:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:24:54] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-31 22:24:55] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2024-05-31 22:24:55] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 3 ms to minimize.
[2024-05-31 22:24:55] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:24:55] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:24:55] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:24:55] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-31 22:24:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 710 ms
[2024-05-31 22:24:55] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-31 22:24:56] [INFO ] Added : 20 causal constraints over 4 iterations in 851 ms. Result :sat
Minimization took 608 ms.
[2024-05-31 22:24:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:24:57] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2024-05-31 22:24:57] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-05-31 22:24:57] [INFO ] Deduced a trap composed of 204 places in 158 ms of which 4 ms to minimize.
[2024-05-31 22:24:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:24:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:24:58] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 24 ms returned sat
[2024-05-31 22:24:58] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-05-31 22:24:58] [INFO ] Deduced a trap composed of 204 places in 149 ms of which 3 ms to minimize.
[2024-05-31 22:24:58] [INFO ] Deduced a trap composed of 189 places in 147 ms of which 3 ms to minimize.
[2024-05-31 22:24:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2024-05-31 22:24:58] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-31 22:25:01] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-31 22:25:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2024-05-31 22:25:02] [INFO ] Added : 304 causal constraints over 61 iterations in 3500 ms. Result :sat
Minimization took 731 ms.
[2024-05-31 22:25:02] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-31 22:25:02] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2024-05-31 22:25:03] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-31 22:25:03] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-31 22:25:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:25:03] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-31 22:25:03] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-05-31 22:25:03] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-31 22:25:08] [INFO ] Added : 460 causal constraints over 92 iterations in 4656 ms. Result :unknown
[2024-05-31 22:25:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:25:08] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 13 ms returned unsat
[2024-05-31 22:25:08] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:25:08] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-31 22:25:08] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-05-31 22:25:08] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-31 22:25:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:25:08] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-31 22:25:09] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2024-05-31 22:25:09] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:25:09] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:25:09] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:25:09] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:25:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 493 ms
[2024-05-31 22:25:09] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-31 22:25:13] [INFO ] Added : 345 causal constraints over 69 iterations in 4206 ms. Result :unknown
[2024-05-31 22:25:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:25:14] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-31 22:25:14] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2024-05-31 22:25:14] [INFO ] Deduced a trap composed of 208 places in 142 ms of which 3 ms to minimize.
[2024-05-31 22:25:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:25:14] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-31 22:25:14] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2024-05-31 22:25:14] [INFO ] Deduced a trap composed of 208 places in 144 ms of which 3 ms to minimize.
[2024-05-31 22:25:15] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 3 ms to minimize.
[2024-05-31 22:25:15] [INFO ] Deduced a trap composed of 193 places in 136 ms of which 4 ms to minimize.
[2024-05-31 22:25:15] [INFO ] Deduced a trap composed of 184 places in 130 ms of which 3 ms to minimize.
[2024-05-31 22:25:15] [INFO ] Deduced a trap composed of 101 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:25:15] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:25:15] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-05-31 22:25:16] [INFO ] Deduced a trap composed of 222 places in 138 ms of which 3 ms to minimize.
[2024-05-31 22:25:16] [INFO ] Deduced a trap composed of 159 places in 136 ms of which 3 ms to minimize.
[2024-05-31 22:25:16] [INFO ] Deduced a trap composed of 113 places in 134 ms of which 3 ms to minimize.
[2024-05-31 22:25:16] [INFO ] Deduced a trap composed of 216 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:25:16] [INFO ] Deduced a trap composed of 211 places in 144 ms of which 3 ms to minimize.
[2024-05-31 22:25:16] [INFO ] Deduced a trap composed of 152 places in 136 ms of which 3 ms to minimize.
[2024-05-31 22:25:16] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 3 ms to minimize.
[2024-05-31 22:25:17] [INFO ] Deduced a trap composed of 209 places in 127 ms of which 3 ms to minimize.
[2024-05-31 22:25:17] [INFO ] Deduced a trap composed of 218 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:25:17] [INFO ] Deduced a trap composed of 181 places in 128 ms of which 3 ms to minimize.
[2024-05-31 22:25:17] [INFO ] Deduced a trap composed of 223 places in 137 ms of which 3 ms to minimize.
[2024-05-31 22:25:17] [INFO ] Deduced a trap composed of 211 places in 132 ms of which 3 ms to minimize.
[2024-05-31 22:25:17] [INFO ] Deduced a trap composed of 219 places in 132 ms of which 3 ms to minimize.
[2024-05-31 22:25:18] [INFO ] Deduced a trap composed of 174 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:25:18] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:25:18] [INFO ] Deduced a trap composed of 193 places in 132 ms of which 3 ms to minimize.
[2024-05-31 22:25:18] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:25:18] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:25:18] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:25:18] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:25:18] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4158 ms
[2024-05-31 22:25:18] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-31 22:25:19] [INFO ] Added : 35 causal constraints over 7 iterations in 527 ms. Result :unknown
[2024-05-31 22:25:19] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-31 22:25:19] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-31 22:25:19] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2024-05-31 22:25:20] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 3 ms to minimize.
[2024-05-31 22:25:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:25:20] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-31 22:25:20] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2024-05-31 22:25:20] [INFO ] Deduced a trap composed of 159 places in 115 ms of which 2 ms to minimize.
[2024-05-31 22:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-31 22:25:20] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-31 22:25:23] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2024-05-31 22:25:24] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-31 22:25:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2024-05-31 22:25:24] [INFO ] Added : 328 causal constraints over 67 iterations in 3473 ms. Result :sat
Minimization took 694 ms.
[2024-05-31 22:25:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:25:24] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 12 ms returned unsat
[2024-05-31 22:25:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 22:25:25] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-31 22:25:25] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 22:25:25] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-05-31 22:25:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:25:25] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-31 22:25:25] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-31 22:25:25] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 3 ms to minimize.
[2024-05-31 22:25:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2024-05-31 22:25:25] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-31 22:25:28] [INFO ] Added : 219 causal constraints over 44 iterations in 2999 ms. Result :sat
Minimization took 691 ms.
[2024-05-31 22:25:29] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:25:29] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 24 ms returned sat
[2024-05-31 22:25:30] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2024-05-31 22:25:30] [INFO ] Deduced a trap composed of 200 places in 138 ms of which 4 ms to minimize.
[2024-05-31 22:25:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:25:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:25:30] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 23 ms returned sat
[2024-05-31 22:25:31] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2024-05-31 22:25:31] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-31 22:25:35] [INFO ] Added : 410 causal constraints over 82 iterations in 4268 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 1, 2, +inf]
FORMULA DoubleExponent-PT-010-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-010-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
Support contains 13 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 527 transition count 388
Reduce places removed 108 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 111 rules applied. Total rules applied 223 place count 419 transition count 385
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 226 place count 416 transition count 385
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 226 place count 416 transition count 363
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 270 place count 394 transition count 363
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 446 place count 306 transition count 275
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 480 place count 289 transition count 275
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 3 with 36 rules applied. Total rules applied 516 place count 289 transition count 239
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 552 place count 253 transition count 239
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 592 place count 253 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 252 transition count 238
Applied a total of 593 rules in 175 ms. Remains 252 /534 variables (removed 282) and now considering 238/498 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 252/534 places, 238/498 transitions.
Found an invariant !
This invariant on transitions {33=1, 49=1, 53=1, 86=1, 89=1, 125=1, 171=1, 212=1, 228=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 49=1, 53=1, 86=1, 89=1, 125=1, 171=1, 212=1, 228=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
// Phase 1: matrix 238 rows 252 cols
[2024-05-31 22:26:08] [INFO ] Computed 50 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
RANDOM walk for 1000000 steps (128256 resets) in 968 ms. (1031 steps per ms)
BEST_FIRST walk for 13000005 steps (1100338 resets) in 7765 ms. (1673 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
[2024-05-31 22:26:17] [INFO ] Invariant cache hit.
[2024-05-31 22:26:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:17] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2024-05-31 22:26:17] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-31 22:26:17] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:26:17] [INFO ] [Real]Added 33 Read/Feed constraints in 124 ms returned sat
[2024-05-31 22:26:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:17] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:17] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 22:26:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 139 ms returned sat
[2024-05-31 22:26:17] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 27 ms.
[2024-05-31 22:26:18] [INFO ] Added : 116 causal constraints over 24 iterations in 853 ms. Result :sat
Minimization took 512 ms.
[2024-05-31 22:26:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:19] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:19] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-31 22:26:19] [INFO ] [Real]Added 33 Read/Feed constraints in 106 ms returned sat
[2024-05-31 22:26:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 22:26:19] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2024-05-31 22:26:19] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-31 22:26:19] [INFO ] [Nat]Added 33 Read/Feed constraints in 158 ms returned sat
[2024-05-31 22:26:19] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-31 22:26:21] [INFO ] Added : 178 causal constraints over 37 iterations in 1487 ms. Result :sat
Minimization took 648 ms.
[2024-05-31 22:26:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:22] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2024-05-31 22:26:22] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-31 22:26:22] [INFO ] [Real]Added 33 Read/Feed constraints in 136 ms returned sat
[2024-05-31 22:26:22] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 15 ms.
[2024-05-31 22:26:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:22] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:22] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-31 22:26:22] [INFO ] [Nat]Added 33 Read/Feed constraints in 184 ms returned sat
[2024-05-31 22:26:22] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 17 ms.
[2024-05-31 22:26:24] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:26:24] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:26:24] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:26:24] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:26:25] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:26:25] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:26:25] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:26:25] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:26:25] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:26:25] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:26:25] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:26:25] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:26:25] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:26:26] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:26:26] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:26:26] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1699 ms
[2024-05-31 22:26:26] [INFO ] Added : 183 causal constraints over 37 iterations in 3427 ms. Result :sat
Minimization took 687 ms.
[2024-05-31 22:26:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:27] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-31 22:26:27] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-31 22:26:27] [INFO ] [Real]Added 33 Read/Feed constraints in 130 ms returned sat
[2024-05-31 22:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:27] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:27] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-31 22:26:27] [INFO ] [Nat]Added 33 Read/Feed constraints in 106 ms returned sat
[2024-05-31 22:26:27] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 13 ms.
[2024-05-31 22:26:28] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:26:28] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:26:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2024-05-31 22:26:28] [INFO ] Added : 123 causal constraints over 25 iterations in 1333 ms. Result :sat
Minimization took 638 ms.
[2024-05-31 22:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:29] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:29] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-31 22:26:29] [INFO ] [Real]Added 33 Read/Feed constraints in 47 ms returned sat
[2024-05-31 22:26:29] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-31 22:26:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:29] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-31 22:26:29] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-31 22:26:30] [INFO ] [Nat]Added 33 Read/Feed constraints in 67 ms returned sat
[2024-05-31 22:26:30] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 15 ms.
[2024-05-31 22:26:31] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:26:31] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:26:31] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:26:31] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:26:31] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:26:31] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:26:32] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:26:33] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:26:33] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:26:33] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:26:33] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:26:33] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 4 ms to minimize.
[2024-05-31 22:26:33] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:26:33] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:26:33] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2431 ms
[2024-05-31 22:26:33] [INFO ] Added : 162 causal constraints over 33 iterations in 3723 ms. Result :sat
Minimization took 697 ms.
[2024-05-31 22:26:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:26:34] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:34] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-31 22:26:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:34] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-31 22:26:34] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-31 22:26:34] [INFO ] [Nat]Added 33 Read/Feed constraints in 171 ms returned sat
[2024-05-31 22:26:35] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-31 22:26:36] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:26:36] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:26:36] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 3 ms to minimize.
[2024-05-31 22:26:36] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:26:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 417 ms
[2024-05-31 22:26:36] [INFO ] Added : 171 causal constraints over 36 iterations in 1947 ms. Result :sat
Minimization took 579 ms.
[2024-05-31 22:26:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:37] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-31 22:26:37] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-31 22:26:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:37] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:37] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-31 22:26:38] [INFO ] [Nat]Added 33 Read/Feed constraints in 157 ms returned sat
[2024-05-31 22:26:38] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-31 22:26:38] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 18 ms.
[2024-05-31 22:26:39] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:26:39] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:26:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2024-05-31 22:26:39] [INFO ] Added : 112 causal constraints over 23 iterations in 1560 ms. Result :sat
Minimization took 458 ms.
[2024-05-31 22:26:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:40] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2024-05-31 22:26:40] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-31 22:26:40] [INFO ] [Real]Added 33 Read/Feed constraints in 91 ms returned sat
[2024-05-31 22:26:40] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 13 ms.
[2024-05-31 22:26:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:40] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-31 22:26:40] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-31 22:26:40] [INFO ] [Nat]Added 33 Read/Feed constraints in 174 ms returned sat
[2024-05-31 22:26:40] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 16 ms.
[2024-05-31 22:26:42] [INFO ] Added : 203 causal constraints over 41 iterations in 1759 ms. Result :sat
Minimization took 747 ms.
[2024-05-31 22:26:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:43] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-31 22:26:43] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-31 22:26:43] [INFO ] [Real]Added 33 Read/Feed constraints in 170 ms returned sat
[2024-05-31 22:26:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:26:43] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2024-05-31 22:26:43] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-31 22:26:44] [INFO ] [Nat]Added 33 Read/Feed constraints in 170 ms returned sat
[2024-05-31 22:26:44] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 13 ms.
[2024-05-31 22:26:45] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 3 ms to minimize.
[2024-05-31 22:26:45] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:26:45] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:26:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 294 ms
[2024-05-31 22:26:45] [INFO ] Added : 134 causal constraints over 27 iterations in 1223 ms. Result :sat
Minimization took 498 ms.
[2024-05-31 22:26:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:26:45] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2024-05-31 22:26:46] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-31 22:26:46] [INFO ] [Real]Added 33 Read/Feed constraints in 224 ms returned sat
[2024-05-31 22:26:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:26:46] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-31 22:26:46] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-31 22:26:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 258 ms returned sat
[2024-05-31 22:26:46] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-31 22:26:48] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:26:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-31 22:26:48] [INFO ] Added : 179 causal constraints over 36 iterations in 1501 ms. Result :sat
Minimization took 604 ms.
[2024-05-31 22:26:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:48] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2024-05-31 22:26:48] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-31 22:26:49] [INFO ] [Real]Added 33 Read/Feed constraints in 53 ms returned sat
[2024-05-31 22:26:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:49] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 15 ms returned sat
[2024-05-31 22:26:49] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-31 22:26:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 115 ms returned sat
[2024-05-31 22:26:49] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-31 22:26:50] [INFO ] Added : 123 causal constraints over 25 iterations in 959 ms. Result :sat
Minimization took 577 ms.
[2024-05-31 22:26:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:50] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:51] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-31 22:26:51] [INFO ] [Real]Added 33 Read/Feed constraints in 74 ms returned sat
[2024-05-31 22:26:51] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 13 ms.
[2024-05-31 22:26:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 22:26:51] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2024-05-31 22:26:51] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-31 22:26:51] [INFO ] [Nat]Added 33 Read/Feed constraints in 79 ms returned sat
[2024-05-31 22:26:51] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 13 ms.
[2024-05-31 22:26:51] [INFO ] Added : 36 causal constraints over 8 iterations in 173 ms. Result :sat
Minimization took 352 ms.
[2024-05-31 22:26:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:52] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:52] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-31 22:26:52] [INFO ] [Real]Added 33 Read/Feed constraints in 105 ms returned sat
[2024-05-31 22:26:52] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 13 ms.
[2024-05-31 22:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:26:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 22:26:52] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-31 22:26:52] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-31 22:26:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 114 ms returned sat
[2024-05-31 22:26:52] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 13 ms.
[2024-05-31 22:26:54] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-05-31 22:26:54] [INFO ] Added : 153 causal constraints over 31 iterations in 1756 ms. Result :sat
Minimization took 553 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
Support contains 13 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 238/238 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 238/238 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 252/252 places, 238/238 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 238/238 transitions.
Applied a total of 0 rules in 10 ms. Remains 252 /252 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-05-31 22:27:32] [INFO ] Invariant cache hit.
[2024-05-31 22:27:32] [INFO ] Implicit Places using invariants in 307 ms returned [21, 27, 48, 53, 75, 81, 102, 108, 130, 136, 137, 164, 188, 196, 203, 211, 217, 242]
[2024-05-31 22:27:32] [INFO ] Actually due to overlaps returned [27, 203, 21, 136]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 309 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 248/252 places, 238/238 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 248 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 236
Applied a total of 4 rules in 20 ms. Remains 246 /248 variables (removed 2) and now considering 236/238 (removed 2) transitions.
// Phase 1: matrix 236 rows 246 cols
[2024-05-31 22:27:32] [INFO ] Computed 46 invariants in 22 ms
[2024-05-31 22:27:32] [INFO ] Implicit Places using invariants in 224 ms returned [45, 50, 72, 78, 99, 105, 127, 133, 160, 184, 192, 206, 211, 236]
[2024-05-31 22:27:32] [INFO ] Actually due to overlaps returned [50, 45, 236]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 225 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 243/252 places, 236/238 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 242 transition count 235
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 242 transition count 235
Applied a total of 3 rules in 23 ms. Remains 242 /243 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 242 cols
[2024-05-31 22:27:32] [INFO ] Computed 43 invariants in 21 ms
[2024-05-31 22:27:33] [INFO ] Implicit Places using invariants in 349 ms returned [69, 75, 96, 102, 124, 130, 157, 181, 189, 203, 208]
[2024-05-31 22:27:33] [INFO ] Actually due to overlaps returned [75, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 349 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 240/252 places, 235/238 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 240 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 239 transition count 234
Applied a total of 2 rules in 15 ms. Remains 239 /240 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 239 cols
[2024-05-31 22:27:33] [INFO ] Computed 41 invariants in 10 ms
[2024-05-31 22:27:33] [INFO ] Implicit Places using invariants in 278 ms returned [93, 99, 121, 127, 154, 178, 186, 200, 205]
[2024-05-31 22:27:33] [INFO ] Actually due to overlaps returned [99, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 279 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 237/252 places, 234/238 transitions.
Applied a total of 0 rules in 7 ms. Remains 237 /237 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 1243 ms. Remains : 237/252 places, 234/238 transitions.
Found an invariant !
This invariant on transitions {30=1, 49=1, 76=1, 112=1, 158=1, 199=1, 215=1, 227=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 49=1, 76=1, 112=1, 158=1, 199=1, 215=1, 227=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
// Phase 1: matrix 234 rows 237 cols
[2024-05-31 22:28:03] [INFO ] Computed 39 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
RANDOM walk for 1000000 steps (144158 resets) in 794 ms. (1257 steps per ms)
BEST_FIRST walk for 13000005 steps (1188977 resets) in 7237 ms. (1796 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
[2024-05-31 22:28:11] [INFO ] Invariant cache hit.
[2024-05-31 22:28:11] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:28:11] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:11] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-31 22:28:11] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:28:11] [INFO ] [Real]Added 33 Read/Feed constraints in 76 ms returned sat
[2024-05-31 22:28:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:28:12] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 22:28:12] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-31 22:28:12] [INFO ] [Nat]Added 33 Read/Feed constraints in 135 ms returned sat
[2024-05-31 22:28:12] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:28:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-31 22:28:12] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-31 22:28:14] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:28:14] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:28:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2024-05-31 22:28:14] [INFO ] Added : 146 causal constraints over 31 iterations in 1856 ms. Result :sat
Minimization took 838 ms.
[2024-05-31 22:28:15] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:15] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-31 22:28:15] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-31 22:28:15] [INFO ] [Real]Added 33 Read/Feed constraints in 62 ms returned sat
[2024-05-31 22:28:15] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:28:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 22:28:15] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 7 ms returned sat
[2024-05-31 22:28:15] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-31 22:28:15] [INFO ] [Nat]Added 33 Read/Feed constraints in 140 ms returned sat
[2024-05-31 22:28:15] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:28:15] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:28:15] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:28:15] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:28:16] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:28:16] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:28:16] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:28:16] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:28:16] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:28:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 890 ms
[2024-05-31 22:28:16] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 14 ms.
[2024-05-31 22:28:19] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:28:19] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:28:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2024-05-31 22:28:19] [INFO ] Added : 210 causal constraints over 44 iterations in 2921 ms. Result :sat
Minimization took 1134 ms.
[2024-05-31 22:28:20] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:28:20] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-31 22:28:20] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-05-31 22:28:20] [INFO ] [Real]Added 33 Read/Feed constraints in 139 ms returned sat
[2024-05-31 22:28:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 22:28:20] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 22:28:21] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-31 22:28:21] [INFO ] [Nat]Added 33 Read/Feed constraints in 114 ms returned sat
[2024-05-31 22:28:21] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-31 22:28:22] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:28:22] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:28:22] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:28:22] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:28:22] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:28:23] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:28:23] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:28:23] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:28:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 798 ms
[2024-05-31 22:28:23] [INFO ] Added : 161 causal constraints over 33 iterations in 2112 ms. Result :sat
Minimization took 479 ms.
[2024-05-31 22:28:23] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:23] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-31 22:28:23] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-31 22:28:24] [INFO ] [Real]Added 33 Read/Feed constraints in 35 ms returned sat
[2024-05-31 22:28:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:24] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:24] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 22:28:24] [INFO ] [Nat]Added 33 Read/Feed constraints in 109 ms returned sat
[2024-05-31 22:28:24] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 12 ms.
[2024-05-31 22:28:25] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:28:25] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:28:25] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:28:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2024-05-31 22:28:26] [INFO ] Added : 137 causal constraints over 29 iterations in 1757 ms. Result :sat
Minimization took 587 ms.
[2024-05-31 22:28:26] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 22:28:26] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-31 22:28:26] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-31 22:28:26] [INFO ] [Real]Added 33 Read/Feed constraints in 82 ms returned sat
[2024-05-31 22:28:26] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-31 22:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 22:28:27] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-31 22:28:27] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-31 22:28:27] [INFO ] [Nat]Added 33 Read/Feed constraints in 108 ms returned sat
[2024-05-31 22:28:27] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:28:27] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:28:27] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:28:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 283 ms
[2024-05-31 22:28:27] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 12 ms.
[2024-05-31 22:28:28] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:28:28] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:28:29] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:28:29] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:28:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 399 ms
[2024-05-31 22:28:29] [INFO ] Added : 151 causal constraints over 31 iterations in 1690 ms. Result :sat
Minimization took 422 ms.
[2024-05-31 22:28:29] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:28:29] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:29] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-31 22:28:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:28:29] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:30] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-05-31 22:28:30] [INFO ] [Nat]Added 33 Read/Feed constraints in 402 ms returned sat
[2024-05-31 22:28:30] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-31 22:28:30] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 12 ms.
[2024-05-31 22:28:34] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:28:34] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:28:34] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:28:34] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:28:34] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:28:34] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:28:35] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:28:35] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:28:35] [INFO ] Deduced a trap composed of 96 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:28:35] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:28:35] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:28:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1061 ms
[2024-05-31 22:28:35] [INFO ] Added : 207 causal constraints over 42 iterations in 4909 ms. Result :sat
Minimization took 723 ms.
[2024-05-31 22:28:36] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:36] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-31 22:28:36] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-31 22:28:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:36] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-31 22:28:36] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-31 22:28:36] [INFO ] [Nat]Added 33 Read/Feed constraints in 196 ms returned sat
[2024-05-31 22:28:36] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 10 ms.
[2024-05-31 22:28:37] [INFO ] Added : 82 causal constraints over 17 iterations in 582 ms. Result :sat
Minimization took 376 ms.
[2024-05-31 22:28:37] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:28:37] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-31 22:28:37] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-31 22:28:37] [INFO ] [Real]Added 33 Read/Feed constraints in 94 ms returned sat
[2024-05-31 22:28:38] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 14 ms.
[2024-05-31 22:28:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:38] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:38] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-31 22:28:38] [INFO ] [Nat]Added 33 Read/Feed constraints in 107 ms returned sat
[2024-05-31 22:28:38] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 12 ms.
[2024-05-31 22:28:40] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-31 22:28:40] [INFO ] Added : 211 causal constraints over 43 iterations in 2646 ms. Result :sat
Minimization took 954 ms.
[2024-05-31 22:28:41] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 22:28:42] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-31 22:28:42] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-31 22:28:42] [INFO ] [Real]Added 33 Read/Feed constraints in 83 ms returned sat
[2024-05-31 22:28:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:42] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:42] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-31 22:28:42] [INFO ] [Nat]Added 33 Read/Feed constraints in 175 ms returned sat
[2024-05-31 22:28:42] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:28:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-31 22:28:42] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 15 ms.
[2024-05-31 22:28:45] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:28:45] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:28:45] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:28:45] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:28:45] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:28:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 513 ms
[2024-05-31 22:28:45] [INFO ] Added : 207 causal constraints over 43 iterations in 3011 ms. Result :sat
Minimization took 903 ms.
[2024-05-31 22:28:46] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:46] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:46] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-31 22:28:46] [INFO ] [Real]Added 33 Read/Feed constraints in 78 ms returned sat
[2024-05-31 22:28:46] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:28:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:46] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-31 22:28:47] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-31 22:28:47] [INFO ] [Nat]Added 33 Read/Feed constraints in 208 ms returned sat
[2024-05-31 22:28:47] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:28:47] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:28:47] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:28:47] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:28:47] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:28:47] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:28:47] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:28:47] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:28:48] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:28:49] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:28:49] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1795 ms
[2024-05-31 22:28:49] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-31 22:28:49] [INFO ] Added : 104 causal constraints over 21 iterations in 719 ms. Result :sat
Minimization took 434 ms.
[2024-05-31 22:28:50] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:50] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:50] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-31 22:28:50] [INFO ] [Real]Added 33 Read/Feed constraints in 44 ms returned sat
[2024-05-31 22:28:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:50] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-31 22:28:50] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-31 22:28:50] [INFO ] [Nat]Added 33 Read/Feed constraints in 75 ms returned sat
[2024-05-31 22:28:50] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-31 22:28:51] [INFO ] Added : 94 causal constraints over 20 iterations in 741 ms. Result :sat
Minimization took 521 ms.
[2024-05-31 22:28:51] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:51] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-31 22:28:52] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-31 22:28:52] [INFO ] [Real]Added 33 Read/Feed constraints in 40 ms returned sat
[2024-05-31 22:28:52] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-31 22:28:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:52] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:52] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-31 22:28:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 53 ms returned sat
[2024-05-31 22:28:52] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 15 ms.
[2024-05-31 22:28:52] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:28:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-31 22:28:52] [INFO ] Added : 32 causal constraints over 7 iterations in 302 ms. Result :sat
Minimization took 330 ms.
[2024-05-31 22:28:53] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:28:53] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-31 22:28:53] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-31 22:28:53] [INFO ] [Real]Added 33 Read/Feed constraints in 87 ms returned sat
[2024-05-31 22:28:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:28:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:28:53] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-31 22:28:53] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 22:28:53] [INFO ] [Nat]Added 33 Read/Feed constraints in 206 ms returned sat
[2024-05-31 22:28:53] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-31 22:28:54] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:28:54] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:28:54] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:28:54] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:28:54] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:28:54] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:28:55] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:28:55] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:28:55] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:28:55] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:28:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 897 ms
[2024-05-31 22:28:55] [INFO ] Added : 125 causal constraints over 25 iterations in 1744 ms. Result :sat
Minimization took 412 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
Support contains 13 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 234/234 transitions.
Applied a total of 0 rules in 16 ms. Remains 237 /237 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 237/237 places, 234/234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 234/234 transitions.
Applied a total of 0 rules in 6 ms. Remains 237 /237 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-31 22:29:26] [INFO ] Invariant cache hit.
[2024-05-31 22:29:26] [INFO ] Implicit Places using invariants in 150 ms returned [119, 125, 152, 176, 184, 198, 203]
[2024-05-31 22:29:26] [INFO ] Actually due to overlaps returned [125, 119]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 161 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/237 places, 234/234 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 233
Applied a total of 2 rules in 10 ms. Remains 234 /235 variables (removed 1) and now considering 233/234 (removed 1) transitions.
// Phase 1: matrix 233 rows 234 cols
[2024-05-31 22:29:26] [INFO ] Computed 37 invariants in 9 ms
[2024-05-31 22:29:26] [INFO ] Implicit Places using invariants in 156 ms returned [149, 173, 181, 195, 200]
[2024-05-31 22:29:26] [INFO ] Actually due to overlaps returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/237 places, 233/234 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 233
Applied a total of 1 rules in 10 ms. Remains 233 /233 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 233 cols
[2024-05-31 22:29:26] [INFO ] Computed 36 invariants in 8 ms
[2024-05-31 22:29:26] [INFO ] Implicit Places using invariants in 145 ms returned [172, 180, 194, 199]
[2024-05-31 22:29:26] [INFO ] Actually due to overlaps returned [172, 180]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 146 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 231/237 places, 233/234 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 233
Applied a total of 1 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 231 cols
[2024-05-31 22:29:26] [INFO ] Computed 34 invariants in 8 ms
[2024-05-31 22:29:26] [INFO ] Implicit Places using invariants in 134 ms returned [192, 197]
[2024-05-31 22:29:26] [INFO ] Actually due to overlaps returned [192]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 230/237 places, 233/234 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 232
Applied a total of 2 rules in 7 ms. Remains 229 /230 variables (removed 1) and now considering 232/233 (removed 1) transitions.
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 22:29:26] [INFO ] Computed 33 invariants in 9 ms
[2024-05-31 22:29:27] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 22:29:27] [INFO ] Invariant cache hit.
[2024-05-31 22:29:27] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:29:28] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 229/237 places, 232/234 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 1993 ms. Remains : 229/237 places, 232/234 transitions.
Found an invariant !
This invariant on transitions {29=1, 46=1, 73=1, 105=1, 151=1, 192=1, 208=1, 220=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 46=1, 73=1, 105=1, 151=1, 192=1, 208=1, 220=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
[2024-05-31 22:34:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
RANDOM walk for 1000000 steps (144161 resets) in 789 ms. (1265 steps per ms)
BEST_FIRST walk for 13000004 steps (1188987 resets) in 7151 ms. (1817 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
[2024-05-31 22:34:08] [INFO ] Invariant cache hit.
[2024-05-31 22:34:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:08] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-31 22:34:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:34:08] [INFO ] [Real]Added 33 Read/Feed constraints in 82 ms returned sat
[2024-05-31 22:34:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:08] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-31 22:34:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 128 ms returned sat
[2024-05-31 22:34:09] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-31 22:34:09] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-31 22:34:09] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-31 22:34:09] [INFO ] Added : 100 causal constraints over 20 iterations in 639 ms. Result :sat
Minimization took 312 ms.
[2024-05-31 22:34:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:10] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-31 22:34:10] [INFO ] [Real]Added 33 Read/Feed constraints in 119 ms returned sat
[2024-05-31 22:34:10] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-31 22:34:10] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 22:34:10] [INFO ] [Nat]Added 33 Read/Feed constraints in 175 ms returned sat
[2024-05-31 22:34:10] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-31 22:34:10] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 22:34:12] [INFO ] Added : 139 causal constraints over 28 iterations in 1252 ms. Result :sat
Minimization took 361 ms.
[2024-05-31 22:34:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:12] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:12] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 22:34:12] [INFO ] [Real]Added 33 Read/Feed constraints in 69 ms returned sat
[2024-05-31 22:34:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:12] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:12] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-31 22:34:13] [INFO ] [Nat]Added 33 Read/Feed constraints in 134 ms returned sat
[2024-05-31 22:34:13] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-31 22:34:13] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-31 22:34:14] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-05-31 22:34:14] [INFO ] Added : 135 causal constraints over 28 iterations in 1154 ms. Result :sat
Minimization took 379 ms.
[2024-05-31 22:34:14] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:14] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 22:34:14] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-31 22:34:14] [INFO ] [Real]Added 33 Read/Feed constraints in 118 ms returned sat
[2024-05-31 22:34:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:14] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:15] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-31 22:34:15] [INFO ] [Nat]Added 33 Read/Feed constraints in 109 ms returned sat
[2024-05-31 22:34:15] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:34:16] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 4 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:34:17] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1078 ms
[2024-05-31 22:34:17] [INFO ] Added : 139 causal constraints over 29 iterations in 2260 ms. Result :sat
Minimization took 327 ms.
[2024-05-31 22:34:17] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:17] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:17] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-31 22:34:18] [INFO ] [Real]Added 33 Read/Feed constraints in 79 ms returned sat
[2024-05-31 22:34:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:18] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:18] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-31 22:34:18] [INFO ] [Nat]Added 33 Read/Feed constraints in 132 ms returned sat
[2024-05-31 22:34:18] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:34:18] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2024-05-31 22:34:18] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-31 22:34:19] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:19] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:34:19] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:19] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:34:19] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 495 ms
[2024-05-31 22:34:19] [INFO ] Added : 119 causal constraints over 25 iterations in 1213 ms. Result :sat
Minimization took 343 ms.
[2024-05-31 22:34:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:20] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:20] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-31 22:34:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:20] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:20] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 22:34:20] [INFO ] [Nat]Added 33 Read/Feed constraints in 552 ms returned sat
[2024-05-31 22:34:21] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 15 ms.
[2024-05-31 22:34:25] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:25] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:34:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2024-05-31 22:34:25] [INFO ] Added : 207 causal constraints over 43 iterations in 4301 ms. Result :sat
Minimization took 1333 ms.
[2024-05-31 22:34:26] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:26] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-31 22:34:26] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-31 22:34:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:26] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-31 22:34:26] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-31 22:34:27] [INFO ] [Nat]Added 33 Read/Feed constraints in 226 ms returned sat
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 575 ms
[2024-05-31 22:34:27] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 16 ms.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:29] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:34:30] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 94 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:34:31] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:34:32] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 3656 ms
[2024-05-31 22:34:32] [INFO ] Added : 146 causal constraints over 30 iterations in 5075 ms. Result :sat
Minimization took 491 ms.
[2024-05-31 22:34:33] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:33] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-31 22:34:33] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-31 22:34:33] [INFO ] [Real]Added 33 Read/Feed constraints in 102 ms returned sat
[2024-05-31 22:34:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:33] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:33] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-31 22:34:33] [INFO ] [Nat]Added 33 Read/Feed constraints in 118 ms returned sat
[2024-05-31 22:34:33] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-31 22:34:36] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:34:36] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:34:36] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:34:36] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:34:36] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:34:37] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Deduced a trap composed of 95 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Deduced a trap composed of 90 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:34:38] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2328 ms
[2024-05-31 22:34:38] [INFO ] Added : 201 causal constraints over 41 iterations in 5031 ms. Result :sat
Minimization took 677 ms.
[2024-05-31 22:34:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:39] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-31 22:34:39] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-05-31 22:34:39] [INFO ] [Real]Added 33 Read/Feed constraints in 99 ms returned sat
[2024-05-31 22:34:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:39] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 22:34:40] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-05-31 22:34:40] [INFO ] [Nat]Added 33 Read/Feed constraints in 157 ms returned sat
[2024-05-31 22:34:40] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-31 22:34:40] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 17 ms.
[2024-05-31 22:34:42] [INFO ] Added : 205 causal constraints over 41 iterations in 2539 ms. Result :sat
Minimization took 565 ms.
[2024-05-31 22:34:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:43] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:43] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-31 22:34:43] [INFO ] [Real]Added 33 Read/Feed constraints in 60 ms returned sat
[2024-05-31 22:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:43] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 22:34:43] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-31 22:34:43] [INFO ] [Nat]Added 33 Read/Feed constraints in 105 ms returned sat
[2024-05-31 22:34:43] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:44] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:45] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:45] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:34:45] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:34:45] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:45] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:34:45] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1646 ms
[2024-05-31 22:34:45] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 22:34:46] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:34:47] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:34:48] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1259 ms
[2024-05-31 22:34:48] [INFO ] Added : 127 causal constraints over 27 iterations in 2773 ms. Result :sat
Minimization took 467 ms.
[2024-05-31 22:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-31 22:34:48] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-31 22:34:48] [INFO ] [Real]Added 33 Read/Feed constraints in 67 ms returned sat
[2024-05-31 22:34:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 22:34:49] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-31 22:34:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 76 ms returned sat
[2024-05-31 22:34:49] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-31 22:34:49] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-31 22:34:49] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:34:49] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:34:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-05-31 22:34:50] [INFO ] Added : 98 causal constraints over 21 iterations in 756 ms. Result :sat
Minimization took 261 ms.
[2024-05-31 22:34:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:50] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-31 22:34:50] [INFO ] [Real]Added 33 Read/Feed constraints in 54 ms returned sat
[2024-05-31 22:34:50] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 22:34:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:34:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-31 22:34:50] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 22:34:50] [INFO ] [Nat]Added 33 Read/Feed constraints in 39 ms returned sat
[2024-05-31 22:34:50] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-31 22:34:50] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-31 22:34:51] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-31 22:34:51] [INFO ] Added : 31 causal constraints over 7 iterations in 314 ms. Result :sat
Minimization took 201 ms.
[2024-05-31 22:34:51] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:51] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-31 22:34:51] [INFO ] [Real]Added 33 Read/Feed constraints in 173 ms returned sat
[2024-05-31 22:34:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:34:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:34:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:34:51] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-31 22:34:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 162 ms returned sat
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:34:53] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:34:53] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:53] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 4 ms to minimize.
[2024-05-31 22:34:53] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:53] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:34:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1434 ms
[2024-05-31 22:34:53] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 22:34:54] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:34:54] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:54] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:34:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1157 ms
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:56] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:34:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1738 ms
[2024-05-31 22:34:57] [INFO ] Added : 146 causal constraints over 30 iterations in 4439 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
Support contains 13 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Applied a total of 0 rules in 12 ms. Remains 229 /229 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 229/229 places, 232/232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2024-05-31 22:35:39] [INFO ] Invariant cache hit.
[2024-05-31 22:35:39] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 22:35:39] [INFO ] Invariant cache hit.
[2024-05-31 22:35:39] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:35:40] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2024-05-31 22:35:40] [INFO ] Redundant transitions in 13 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-31 22:35:40] [INFO ] Invariant cache hit.
[2024-05-31 22:35:40] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:35:43] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 106 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 105 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:35:44] [INFO ] Deduced a trap composed of 108 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:35:45] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:35:45] [INFO ] Deduced a trap composed of 105 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:35:45] [INFO ] Deduced a trap composed of 103 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:35:45] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:35:45] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:35:45] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:35:46] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:35:46] [INFO ] Deduced a trap composed of 104 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:35:46] [INFO ] Deduced a trap composed of 104 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:35:46] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:35:46] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:35:46] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:35:46] [INFO ] Deduced a trap composed of 111 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:35:46] [INFO ] Deduced a trap composed of 103 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:35:47] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:35:47] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:35:48] [INFO ] Deduced a trap composed of 119 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:35:48] [INFO ] Deduced a trap composed of 112 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:35:49] [INFO ] Deduced a trap composed of 112 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:35:49] [INFO ] Deduced a trap composed of 110 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:35:49] [INFO ] Deduced a trap composed of 114 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:35:49] [INFO ] Deduced a trap composed of 108 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 232/461 variables, 229/296 constraints. Problems are: Problem set: 0 solved, 231 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 33/329 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/461 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 329 constraints, problems are : Problem set: 0 solved, 231 unsolved in 19941 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 229/229 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:36:02] [INFO ] Deduced a trap composed of 105 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:36:02] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:36:02] [INFO ] Deduced a trap composed of 112 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:36:03] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:36:04] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:36:05] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:36:05] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:36:05] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:36:05] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:36:05] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 109 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 105 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:36:06] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:36:07] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:36:07] [INFO ] Deduced a trap composed of 94 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (OVERLAPS) 232/461 variables, 229/321 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 33/354 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 231/585 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:36:20] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:36:21] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:36:21] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:36:21] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:36:21] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 20/605 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:36:30] [INFO ] Deduced a trap composed of 112 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:36:30] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:36:30] [INFO ] Deduced a trap composed of 119 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:36:30] [INFO ] Deduced a trap composed of 119 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:36:30] [INFO ] Deduced a trap composed of 112 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:36:30] [INFO ] Deduced a trap composed of 120 places in 59 ms of which 1 ms to minimize.
SMT process timed out in 50121ms, After SMT, problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 50133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51495 ms. Remains : 229/229 places, 232/232 transitions.
Found an invariant !
This invariant on transitions {29=1, 46=1, 73=1, 105=1, 151=1, 192=1, 208=1, 220=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 46=1, 73=1, 105=1, 151=1, 192=1, 208=1, 220=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1468 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
RANDOM walk for 40000 steps (5787 resets) in 1350 ms. (29 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (369 resets) in 122 ms. (32 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (380 resets) in 163 ms. (24 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (380 resets) in 53 ms. (74 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (359 resets) in 61 ms. (64 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (371 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (372 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (352 resets) in 51 ms. (76 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (361 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (366 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (361 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (372 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (360 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (368 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (380 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (350 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (379 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (378 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (378 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (382 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (354 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (389 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (359 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (386 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (364 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 211561 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :2 out of 24
Probabilistic random walk after 211561 steps, saw 105798 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :2
[2024-05-31 22:41:07] [INFO ] Invariant cache hit.
[2024-05-31 22:41:07] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 126/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem MAX12 is UNSAT
At refinement iteration 3 (OVERLAPS) 86/224 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 232/456 variables, 224/255 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 33/288 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 5/461 variables, 5/293 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 2/295 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/461 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 295 constraints, problems are : Problem set: 1 solved, 21 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 229/229 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 126/138 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-31 22:41:08] [INFO ] Deduced a trap composed of 111 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 113 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 86/224 variables, 29/33 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:41:09] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 20/53 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:41:10] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:11] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 20/73 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:41:12] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 20/93 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
SMT process timed out in 6066ms, After SMT, problems are : Problem set: 1 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 229 transition count 229
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 226 transition count 229
Applied a total of 6 rules in 9 ms. Remains 226 /229 variables (removed 3) and now considering 229/232 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 226/229 places, 229/232 transitions.
RANDOM walk for 40000 steps (5791 resets) in 376 ms. (106 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (350 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (351 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (363 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (346 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (360 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (350 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (345 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (365 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (357 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (372 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (368 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (368 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (366 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (355 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (338 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (360 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (378 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (362 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (357 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (347 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (370 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 280780 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 21
Probabilistic random walk after 280780 steps, saw 140417 distinct states, run finished after 3002 ms. (steps per millisecond=93 ) properties seen :0
// Phase 1: matrix 229 rows 226 cols
[2024-05-31 22:41:17] [INFO ] Computed 33 invariants in 9 ms
[2024-05-31 22:41:17] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 157/169 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 52/221 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 229/450 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 33/285 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 5/455 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/455 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 292 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 226/226 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 157/169 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:41:18] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:18] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:41:18] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:18] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:41:18] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 52/221 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:41:21] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:41:25] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:41:25] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:41:25] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 229/450 variables, 221/340 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 33/373 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 21/394 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:41:26] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:41:26] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 5/455 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/455 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/455 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (OVERLAPS) 0/455 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 403 constraints, problems are : Problem set: 0 solved, 21 unsolved in 10701 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 226/226 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 90/90 constraints]
After SMT, in 11725ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 29449 ms.
Support contains 12 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 229/229 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 226/226 places, 229/229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 229/229 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-31 22:41:58] [INFO ] Invariant cache hit.
[2024-05-31 22:41:58] [INFO ] Implicit Places using invariants in 160 ms returned [223]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 161 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 225/226 places, 229/229 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 228
Applied a total of 2 rules in 9 ms. Remains 224 /225 variables (removed 1) and now considering 228/229 (removed 1) transitions.
// Phase 1: matrix 228 rows 224 cols
[2024-05-31 22:41:58] [INFO ] Computed 32 invariants in 10 ms
[2024-05-31 22:41:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-31 22:41:58] [INFO ] Invariant cache hit.
[2024-05-31 22:41:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:41:59] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 224/226 places, 228/229 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1554 ms. Remains : 224/226 places, 228/229 transitions.
RANDOM walk for 40000 steps (5773 resets) in 193 ms. (206 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (368 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (371 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (375 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (371 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (377 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (372 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (367 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (371 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (368 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (354 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (354 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (356 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (382 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (351 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (348 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (346 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (345 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (360 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (353 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (357 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (379 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 239876 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 21
Probabilistic random walk after 239876 steps, saw 119955 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-31 22:42:03] [INFO ] Invariant cache hit.
[2024-05-31 22:42:03] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 155/167 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 52/219 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 228/447 variables, 219/249 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 33/282 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 5/452 variables, 5/287 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/452 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 289 constraints, problems are : Problem set: 0 solved, 21 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 224/224 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 155/167 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 96 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 102 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 108 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 52/219 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:09] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 17/178 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 11/197 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 14/213 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:42:20] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:21] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:21] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:42:21] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:42:21] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:42:21] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:42:21] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:42:21] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:42:21] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 228/447 variables, 219/452 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/447 variables, 33/485 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/447 variables, 21/506 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:25] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/447 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:42:26] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:42:26] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/447 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/447 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 25 (OVERLAPS) 5/452 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/452 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/452 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 28 (OVERLAPS) 0/452 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 516 constraints, problems are : Problem set: 0 solved, 21 unsolved in 25673 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 224/224 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 206/206 constraints]
After SMT, in 26635ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 31761 ms.
Support contains 12 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 224 /224 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 224/224 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 224 /224 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-31 22:43:01] [INFO ] Invariant cache hit.
[2024-05-31 22:43:01] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-31 22:43:01] [INFO ] Invariant cache hit.
[2024-05-31 22:43:01] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:43:03] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
[2024-05-31 22:43:03] [INFO ] Redundant transitions in 12 ms returned []
Running 227 sub problems to find dead transitions.
[2024-05-31 22:43:03] [INFO ] Invariant cache hit.
[2024-05-31 22:43:03] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 1/224 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 22:43:05] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:43:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/452 variables, 224/258 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 33/291 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 227 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/452 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 291 constraints, problems are : Problem set: 0 solved, 227 unsolved in 14630 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 224/224 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 1/224 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/452 variables, 224/258 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 33/291 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 227/518 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 22:43:26] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:43:26] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 20/538 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-31 22:43:33] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 5)
(s5 5)
(s6 1)
(s7 6)
(s8 2)
(s9 2)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 3)
(s32 2)
(s33 3)
(s34 1)
(s35 2)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 10)
(s53 9)
(s54 10)
(s55 1)
(s56 2)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 1)
(s78 12)
(s79 13)
(s80 13)
(s81 2)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 27)
(s104 1)
(s105 27)
(s106 1)
(s107 27)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 539 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 224/224 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 23/23 constraints]
After SMT, in 44725ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 44728ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46211 ms. Remains : 224/224 places, 228/228 transitions.
FORMULA DoubleExponent-PT-010-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 6]
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 22:43:47] [INFO ] Computed 33 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1405 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10000 steps (905 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:43:47] [INFO ] Invariant cache hit.
[2024-05-31 22:43:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:43:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:43:47] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-31 22:43:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:43:48] [INFO ] [Real]Added 33 Read/Feed constraints in 83 ms returned sat
[2024-05-31 22:43:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:43:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:43:48] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:43:48] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 22:43:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 132 ms returned sat
[2024-05-31 22:43:48] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:43:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-31 22:43:48] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-31 22:43:49] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-31 22:43:49] [INFO ] Added : 100 causal constraints over 20 iterations in 646 ms. Result :sat
Minimization took 313 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p283) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 227 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 225 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 225 transition count 224
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 93 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 98 place count 135 transition count 131
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 508 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 5 rules applied. Total rules applied 103 place count 130 transition count 131
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 130 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 129 transition count 130
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 129 transition count 126
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 114 place count 125 transition count 126
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 116 place count 125 transition count 126
Applied a total of 116 rules in 13 ms. Remains 125 /229 variables (removed 104) and now considering 126/230 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 125/229 places, 126/230 transitions.
// Phase 1: matrix 126 rows 125 cols
[2024-05-31 22:43:49] [INFO ] Computed 20 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144466 resets) in 576 ms. (1733 steps per ms)
BEST_FIRST walk for 1000001 steps (91502 resets) in 418 ms. (2386 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:43:50] [INFO ] Invariant cache hit.
[2024-05-31 22:43:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:43:50] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-31 22:43:50] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-31 22:43:50] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-31 22:43:50] [INFO ] [Real]Added 23 Read/Feed constraints in 30 ms returned sat
[2024-05-31 22:43:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:43:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:43:51] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-31 22:43:51] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 22:43:51] [INFO ] [Nat]Added 23 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:43:51] [INFO ] Computed and/alt/rep : 104/629/104 causal constraints (skipped 21 transitions) in 10 ms.
[2024-05-31 22:43:51] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2024-05-31 22:43:51] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:43:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2024-05-31 22:43:51] [INFO ] Added : 81 causal constraints over 18 iterations in 508 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 125/125 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-31 22:43:51] [INFO ] Invariant cache hit.
[2024-05-31 22:43:51] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 22:43:51] [INFO ] Invariant cache hit.
[2024-05-31 22:43:52] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-31 22:43:52] [INFO ] Implicit Places using invariants and state equation in 479 ms returned [74, 122]
[2024-05-31 22:43:52] [INFO ] Actually due to overlaps returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 565 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/125 places, 126/126 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 125
Applied a total of 2 rules in 7 ms. Remains 123 /124 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 123 cols
[2024-05-31 22:43:52] [INFO ] Computed 19 invariants in 3 ms
[2024-05-31 22:43:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 22:43:52] [INFO ] Invariant cache hit.
[2024-05-31 22:43:52] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-31 22:43:53] [INFO ] Implicit Places using invariants and state equation in 544 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 622 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 122/125 places, 125/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1199 ms. Remains : 122/125 places, 125/126 transitions.
// Phase 1: matrix 125 rows 122 cols
[2024-05-31 22:43:53] [INFO ] Computed 18 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144315 resets) in 594 ms. (1680 steps per ms)
BEST_FIRST walk for 1000000 steps (91323 resets) in 418 ms. (2386 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:43:54] [INFO ] Invariant cache hit.
[2024-05-31 22:43:54] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 22:43:54] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 20 ms returned sat
[2024-05-31 22:43:54] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-31 22:43:54] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-31 22:43:54] [INFO ] [Real]Added 23 Read/Feed constraints in 29 ms returned sat
[2024-05-31 22:43:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:43:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:43:54] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-31 22:43:54] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 22:43:54] [INFO ] [Nat]Added 23 Read/Feed constraints in 14 ms returned sat
[2024-05-31 22:43:54] [INFO ] Computed and/alt/rep : 108/669/108 causal constraints (skipped 16 transitions) in 9 ms.
[2024-05-31 22:43:54] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:43:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-31 22:43:54] [INFO ] Added : 104 causal constraints over 21 iterations in 588 ms. Result :sat
Minimization took 277 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 122/122 places, 125/125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 22:43:55] [INFO ] Invariant cache hit.
[2024-05-31 22:43:55] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 22:43:55] [INFO ] Invariant cache hit.
[2024-05-31 22:43:55] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-31 22:43:55] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-05-31 22:43:55] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-31 22:43:55] [INFO ] Invariant cache hit.
[2024-05-31 22:43:55] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 2/122 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD123 is UNSAT
At refinement iteration 6 (OVERLAPS) 125/247 variables, 122/140 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 23/163 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 163 constraints, problems are : Problem set: 1 solved, 123 unsolved in 3869 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 122/122 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 2/122 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 5/18 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 125/247 variables, 122/140 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 23/163 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 123/286 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 123 unsolved
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:44:04] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:44:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/247 variables, 15/301 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/301 constraints. Problems are: Problem set: 1 solved, 123 unsolved
[2024-05-31 22:44:08] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/247 variables, 1/302 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 302 constraints, problems are : Problem set: 1 solved, 123 unsolved in 14803 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 122/122 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 123/124 constraints, Known Traps: 16/16 constraints]
After SMT, in 18716ms problems are : Problem set: 1 solved, 123 unsolved
Search for dead transitions found 1 dead transitions in 18718ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/122 places, 124/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-31 22:44:14] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19218 ms. Remains : 122/122 places, 124/125 transitions.
// Phase 1: matrix 124 rows 122 cols
[2024-05-31 22:44:14] [INFO ] Computed 19 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143971 resets) in 576 ms. (1733 steps per ms)
BEST_FIRST walk for 1000000 steps (91551 resets) in 424 ms. (2352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:44:15] [INFO ] Invariant cache hit.
[2024-05-31 22:44:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:44:15] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-31 22:44:15] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-31 22:44:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-31 22:44:15] [INFO ] [Real]Added 22 Read/Feed constraints in 27 ms returned sat
[2024-05-31 22:44:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:44:15] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 8 ms returned sat
[2024-05-31 22:44:15] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 22:44:15] [INFO ] [Nat]Added 22 Read/Feed constraints in 22 ms returned sat
[2024-05-31 22:44:15] [INFO ] Computed and/alt/rep : 107/659/107 causal constraints (skipped 16 transitions) in 11 ms.
[2024-05-31 22:44:16] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:44:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-31 22:44:16] [INFO ] Added : 79 causal constraints over 17 iterations in 406 ms. Result :sat
Minimization took 160 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 124/124 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 122/122 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 124/124 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-31 22:44:16] [INFO ] Invariant cache hit.
[2024-05-31 22:44:16] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 22:44:16] [INFO ] Invariant cache hit.
[2024-05-31 22:44:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-31 22:44:17] [INFO ] Implicit Places using invariants and state equation in 374 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 460 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 121/122 places, 124/124 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 123
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 120 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 119 transition count 123
Applied a total of 4 rules in 6 ms. Remains 119 /121 variables (removed 2) and now considering 123/124 (removed 1) transitions.
// Phase 1: matrix 123 rows 119 cols
[2024-05-31 22:44:17] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 22:44:17] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 22:44:17] [INFO ] Invariant cache hit.
[2024-05-31 22:44:17] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 22:44:17] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 119/122 places, 123/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 898 ms. Remains : 119/122 places, 123/124 transitions.
[2024-05-31 22:44:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144204 resets) in 601 ms. (1661 steps per ms)
BEST_FIRST walk for 1000001 steps (91387 resets) in 418 ms. (2386 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:44:18] [INFO ] Invariant cache hit.
[2024-05-31 22:44:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:44:18] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 22:44:18] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 22:44:18] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 22:44:18] [INFO ] [Real]Added 24 Read/Feed constraints in 20 ms returned sat
[2024-05-31 22:44:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:44:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:44:18] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 22:44:18] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 22:44:18] [INFO ] [Nat]Added 24 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:44:18] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 9 ms to minimize.
[2024-05-31 22:44:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-31 22:44:18] [INFO ] Computed and/alt/rep : 104/651/104 causal constraints (skipped 18 transitions) in 7 ms.
[2024-05-31 22:44:19] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:44:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 22:44:19] [INFO ] Added : 90 causal constraints over 18 iterations in 509 ms. Result :sat
Minimization took 172 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 119/119 places, 123/123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-31 22:44:19] [INFO ] Invariant cache hit.
[2024-05-31 22:44:19] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 22:44:19] [INFO ] Invariant cache hit.
[2024-05-31 22:44:19] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 22:44:20] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-31 22:44:20] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-31 22:44:20] [INFO ] Invariant cache hit.
[2024-05-31 22:44:20] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/242 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 24/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 161 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3827 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/242 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 24/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 122/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:44:26] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:44:26] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:44:26] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:44:26] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:44:27] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:44:28] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:44:28] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:44:28] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:44:28] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:44:29] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:44:29] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:44:29] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:44:29] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:44:30] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:44:30] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:44:32] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:44:37] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:44:37] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:44:37] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:44:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:44:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/242 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (OVERLAPS) 0/242 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 304 constraints, problems are : Problem set: 0 solved, 122 unsolved in 21415 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 21/21 constraints]
After SMT, in 25279ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 25281ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25724 ms. Remains : 119/119 places, 123/123 transitions.
RANDOM walk for 40000 steps (5810 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3667 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3579 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 695688 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 2
Probabilistic random walk after 695688 steps, saw 347907 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
[2024-05-31 22:44:48] [INFO ] Invariant cache hit.
[2024-05-31 22:44:48] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 118/222 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/241 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/242 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/242 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 118/222 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/241 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/241 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:44:49] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/241 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/241 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/242 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 719ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 785 ms.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 119/119 places, 123/123 transitions.
RANDOM walk for 40000 steps (5770 resets) in 58 ms. (677 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3628 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3628 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 487104 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 2
Probabilistic random walk after 487104 steps, saw 243601 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-31 22:44:52] [INFO ] Invariant cache hit.
[2024-05-31 22:44:52] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 118/222 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/241 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/242 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/242 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 118/222 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/241 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/241 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/241 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/241 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/242 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 751 ms.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 119/119 places, 123/123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-31 22:44:54] [INFO ] Invariant cache hit.
[2024-05-31 22:44:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 22:44:54] [INFO ] Invariant cache hit.
[2024-05-31 22:44:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 22:44:54] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-31 22:44:54] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-31 22:44:54] [INFO ] Invariant cache hit.
[2024-05-31 22:44:54] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/242 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 24/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 161 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3759 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/242 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 24/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 122/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:45:01] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:45:01] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:45:01] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:45:01] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:45:01] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 62 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:45:05] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:45:05] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:45:07] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/242 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (OVERLAPS) 0/242 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 304 constraints, problems are : Problem set: 0 solved, 122 unsolved in 21430 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 21/21 constraints]
After SMT, in 25242ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 25245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25702 ms. Remains : 119/119 places, 123/123 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 119 transition count 112
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 108 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 102 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 102 transition count 106
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 102 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 101 transition count 105
Applied a total of 36 rules in 10 ms. Remains 101 /119 variables (removed 18) and now considering 105/123 (removed 18) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 105 rows 101 cols
[2024-05-31 22:45:20] [INFO ] Computed 18 invariants in 4 ms
[2024-05-31 22:45:20] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:45:20] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 22:45:20] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:45:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:45:20] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:45:20] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:45:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:45:20] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 22:45:20] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:45:20] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:45:20] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:45:20] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:45:20] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:45:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
TRAPS : Iteration 1
[2024-05-31 22:45:20] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:45:20] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 349 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-00 in 92654 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 22:45:20] [INFO ] Computed 33 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1444 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (909 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:45:20] [INFO ] Invariant cache hit.
[2024-05-31 22:45:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:45:20] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:45:20] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-31 22:45:20] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:45:20] [INFO ] [Real]Added 33 Read/Feed constraints in 125 ms returned sat
[2024-05-31 22:45:20] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:45:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:45:20] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 22:45:21] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 22:45:21] [INFO ] [Nat]Added 33 Read/Feed constraints in 179 ms returned sat
[2024-05-31 22:45:21] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:45:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2024-05-31 22:45:21] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 22:45:22] [INFO ] Added : 139 causal constraints over 28 iterations in 1264 ms. Result :sat
Minimization took 374 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p513) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 231/231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 228 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 227 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 227 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 226 transition count 228
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 15 place count 221 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 219 transition count 223
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 28 place count 219 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 37 place count 210 transition count 214
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 210 transition count 214
Applied a total of 41 rules in 25 ms. Remains 210 /229 variables (removed 19) and now considering 214/231 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 210/229 places, 214/231 transitions.
// Phase 1: matrix 214 rows 210 cols
[2024-05-31 22:45:33] [INFO ] Computed 33 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144333 resets) in 671 ms. (1488 steps per ms)
BEST_FIRST walk for 1000000 steps (91363 resets) in 470 ms. (2123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:45:34] [INFO ] Invariant cache hit.
[2024-05-31 22:45:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:45:34] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:45:34] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-31 22:45:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 22:45:34] [INFO ] [Real]Added 40 Read/Feed constraints in 48 ms returned sat
[2024-05-31 22:45:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:45:34] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 22:45:34] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-31 22:45:34] [INFO ] [Nat]Added 40 Read/Feed constraints in 87 ms returned sat
[2024-05-31 22:45:34] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:45:34] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:45:34] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:45:34] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:45:37] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:45:37] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:45:37] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:45:37] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:45:37] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3098 ms
[2024-05-31 22:45:37] [INFO ] Computed and/alt/rep : 165/1041/165 causal constraints (skipped 48 transitions) in 13 ms.
[2024-05-31 22:45:39] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:45:39] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:45:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2024-05-31 22:45:39] [INFO ] Added : 127 causal constraints over 27 iterations in 1649 ms. Result :sat
Minimization took 366 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 210/210 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-31 22:45:42] [INFO ] Invariant cache hit.
[2024-05-31 22:45:42] [INFO ] Implicit Places using invariants in 156 ms returned [134, 207]
[2024-05-31 22:45:42] [INFO ] Actually due to overlaps returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/210 places, 214/214 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 213
Applied a total of 2 rules in 8 ms. Remains 208 /209 variables (removed 1) and now considering 213/214 (removed 1) transitions.
// Phase 1: matrix 213 rows 208 cols
[2024-05-31 22:45:42] [INFO ] Computed 32 invariants in 9 ms
[2024-05-31 22:45:43] [INFO ] Implicit Places using invariants in 142 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/210 places, 213/214 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 7 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 206 cols
[2024-05-31 22:45:43] [INFO ] Computed 31 invariants in 11 ms
[2024-05-31 22:45:43] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-31 22:45:43] [INFO ] Invariant cache hit.
[2024-05-31 22:45:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 22:45:44] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 206/210 places, 212/214 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1722 ms. Remains : 206/210 places, 212/214 transitions.
[2024-05-31 22:45:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144192 resets) in 665 ms. (1501 steps per ms)
BEST_FIRST walk for 1000000 steps (91316 resets) in 465 ms. (2145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:45:45] [INFO ] Invariant cache hit.
[2024-05-31 22:45:45] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-31 22:45:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:45:45] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-31 22:45:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:45:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-31 22:45:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:45:45] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-31 22:45:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 22:45:45] [INFO ] [Nat]Added 40 Read/Feed constraints in 147 ms returned sat
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1701 ms
[2024-05-31 22:45:47] [INFO ] Computed and/alt/rep : 168/1080/168 causal constraints (skipped 43 transitions) in 11 ms.
[2024-05-31 22:45:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:45:49] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:45:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2024-05-31 22:45:49] [INFO ] Added : 150 causal constraints over 31 iterations in 2244 ms. Result :sat
Minimization took 665 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2024-05-31 22:46:05] [INFO ] Invariant cache hit.
[2024-05-31 22:46:05] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-31 22:46:05] [INFO ] Invariant cache hit.
[2024-05-31 22:46:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 22:46:06] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2024-05-31 22:46:06] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2024-05-31 22:46:06] [INFO ] Invariant cache hit.
[2024-05-31 22:46:06] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Problem TDEAD97 is UNSAT
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 1 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 40/277 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 277 constraints, problems are : Problem set: 1 solved, 210 unsolved in 9060 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/20 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/31 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 40/277 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 210/487 constraints. Problems are: Problem set: 1 solved, 210 unsolved
[2024-05-31 22:46:24] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:46:24] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:46:24] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:46:25] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:46:26] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:46:26] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:46:26] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:46:26] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:46:26] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:46:26] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:46:27] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:46:27] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:46:27] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:46:27] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 20/507 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/507 constraints. Problems are: Problem set: 1 solved, 210 unsolved
[2024-05-31 22:46:38] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:46:38] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:46:38] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:46:39] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:46:39] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/418 variables, 5/512 constraints. Problems are: Problem set: 1 solved, 210 unsolved
[2024-05-31 22:46:44] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 513 constraints, problems are : Problem set: 1 solved, 210 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 210/211 constraints, Known Traps: 26/26 constraints]
After SMT, in 39168ms problems are : Problem set: 1 solved, 210 unsolved
Search for dead transitions found 1 dead transitions in 39172ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/206 places, 211/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-31 22:46:45] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40626 ms. Remains : 206/206 places, 211/212 transitions.
// Phase 1: matrix 211 rows 206 cols
[2024-05-31 22:46:45] [INFO ] Computed 32 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144149 resets) in 687 ms. (1453 steps per ms)
BEST_FIRST walk for 1000001 steps (91635 resets) in 481 ms. (2074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:46:46] [INFO ] Invariant cache hit.
[2024-05-31 22:46:46] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:46:46] [INFO ] [Real]Absence check using 13 positive and 19 generalized place invariants in 2 ms returned sat
[2024-05-31 22:46:47] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-31 22:46:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:46:47] [INFO ] [Real]Added 39 Read/Feed constraints in 83 ms returned sat
[2024-05-31 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:46:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:46:47] [INFO ] [Nat]Absence check using 13 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:46:47] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-31 22:46:47] [INFO ] [Nat]Added 39 Read/Feed constraints in 88 ms returned sat
[2024-05-31 22:46:47] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:46:47] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:46:47] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:46:47] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:46:47] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:46:47] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:46:47] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:46:48] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:46:49] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:46:49] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:46:49] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:46:49] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:46:49] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:46:49] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2086 ms
[2024-05-31 22:46:49] [INFO ] Computed and/alt/rep : 167/1072/167 causal constraints (skipped 43 transitions) in 11 ms.
[2024-05-31 22:46:51] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:46:51] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:46:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2024-05-31 22:46:51] [INFO ] Added : 143 causal constraints over 29 iterations in 2041 ms. Result :sat
Minimization took 407 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-31 22:47:01] [INFO ] Invariant cache hit.
[2024-05-31 22:47:01] [INFO ] Implicit Places using invariants in 136 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 144 ms. Remains : 205/206 places, 211/211 transitions.
// Phase 1: matrix 211 rows 205 cols
[2024-05-31 22:47:01] [INFO ] Computed 31 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144393 resets) in 669 ms. (1492 steps per ms)
BEST_FIRST walk for 1000001 steps (91469 resets) in 470 ms. (2123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:47:02] [INFO ] Invariant cache hit.
[2024-05-31 22:47:02] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:47:02] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:47:02] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-31 22:47:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:47:02] [INFO ] [Real]Added 39 Read/Feed constraints in 70 ms returned sat
[2024-05-31 22:47:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:47:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:47:02] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 22:47:02] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-31 22:47:02] [INFO ] [Nat]Added 39 Read/Feed constraints in 124 ms returned sat
[2024-05-31 22:47:03] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:47:03] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:47:03] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:47:03] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:47:03] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:47:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 438 ms
[2024-05-31 22:47:03] [INFO ] Computed and/alt/rep : 167/1072/167 causal constraints (skipped 43 transitions) in 14 ms.
[2024-05-31 22:47:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:47:05] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:47:05] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:47:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 254 ms
[2024-05-31 22:47:05] [INFO ] Added : 150 causal constraints over 31 iterations in 2332 ms. Result :sat
Minimization took 468 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 205/205 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-31 22:47:11] [INFO ] Invariant cache hit.
[2024-05-31 22:47:11] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 22:47:11] [INFO ] Invariant cache hit.
[2024-05-31 22:47:11] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:47:12] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2024-05-31 22:47:12] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 22:47:12] [INFO ] Invariant cache hit.
[2024-05-31 22:47:12] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/416 variables, 205/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 39/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 275 constraints, problems are : Problem set: 0 solved, 210 unsolved in 12223 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/416 variables, 205/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 39/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 210/485 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 22:47:31] [INFO ] Deduced a trap composed of 95 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:47:33] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:47:34] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:47:35] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:47:36] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 22:47:40] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:47:40] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:47:43] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:47:43] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 509 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 24/24 constraints]
After SMT, in 42317ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 42321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43764 ms. Remains : 205/205 places, 211/211 transitions.
RANDOM walk for 40000 steps (5748 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3665 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 526792 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 2
Probabilistic random walk after 526792 steps, saw 263453 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-31 22:47:57] [INFO ] Invariant cache hit.
[2024-05-31 22:47:57] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 211/412 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 39/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/416 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 211/412 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 39/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:47:58] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:47:59] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 10/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/416 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 1537ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11736 ms.
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 211/211 transitions.
RANDOM walk for 40000 steps (5758 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3655 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 555236 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 2
Probabilistic random walk after 555236 steps, saw 277674 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
[2024-05-31 22:48:14] [INFO ] Invariant cache hit.
[2024-05-31 22:48:14] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:48:14] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-31 22:48:14] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:48:14] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:48:14] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 211/412 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 39/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/416 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 211/412 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 39/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:48:15] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 10/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/416 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 1611ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9532 ms.
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 205/205 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-31 22:48:25] [INFO ] Invariant cache hit.
[2024-05-31 22:48:25] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-31 22:48:25] [INFO ] Invariant cache hit.
[2024-05-31 22:48:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:48:26] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
[2024-05-31 22:48:26] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 22:48:26] [INFO ] Invariant cache hit.
[2024-05-31 22:48:26] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/416 variables, 205/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 39/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 275 constraints, problems are : Problem set: 0 solved, 210 unsolved in 12120 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/416 variables, 205/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 39/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 210/485 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 22:48:45] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:48:47] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:48:48] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:48:48] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:48:48] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:48:48] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:48:49] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:48:49] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:48:49] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:48:50] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:48:51] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 22:48:54] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:48:55] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:48:58] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:48:58] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 509 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 24/24 constraints]
After SMT, in 42216ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 42220ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43648 ms. Remains : 205/205 places, 211/211 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 205 transition count 193
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 187 transition count 193
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 178 transition count 184
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 178 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 177 transition count 183
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 177 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 58 place count 176 transition count 182
Applied a total of 58 rules in 18 ms. Remains 176 /205 variables (removed 29) and now considering 182/211 (removed 29) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 182 rows 176 cols
[2024-05-31 22:49:09] [INFO ] Computed 31 invariants in 16 ms
[2024-05-31 22:49:09] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:49:09] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 22:49:09] [INFO ] After 132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:49:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:49:09] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:49:09] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
TRAPS : Iteration 1
[2024-05-31 22:49:09] [INFO ] After 102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:49:09] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:49:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 22:49:09] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:49:09] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:49:09] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:49:09] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:49:09] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:49:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
TRAPS : Iteration 1
[2024-05-31 22:49:09] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:49:09] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 701 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-01 in 229292 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 22:49:09] [INFO ] Computed 33 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1453 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (879 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:49:09] [INFO ] Invariant cache hit.
[2024-05-31 22:49:09] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:49:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:49:09] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-31 22:49:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:49:10] [INFO ] [Real]Added 33 Read/Feed constraints in 71 ms returned sat
[2024-05-31 22:49:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:49:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:49:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-05-31 22:49:10] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-31 22:49:10] [INFO ] [Nat]Added 33 Read/Feed constraints in 134 ms returned sat
[2024-05-31 22:49:10] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:49:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-05-31 22:49:10] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 22:49:11] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-31 22:49:11] [INFO ] Added : 135 causal constraints over 28 iterations in 1126 ms. Result :sat
Minimization took 384 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p465) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 226 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 226 transition count 225
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 224 transition count 225
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 220 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 218 transition count 221
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 28 place count 218 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 35 place count 211 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 211 transition count 214
Applied a total of 38 rules in 32 ms. Remains 211 /229 variables (removed 18) and now considering 214/230 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 211/229 places, 214/230 transitions.
// Phase 1: matrix 214 rows 211 cols
[2024-05-31 22:49:18] [INFO ] Computed 33 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144223 resets) in 683 ms. (1461 steps per ms)
BEST_FIRST walk for 1000000 steps (91363 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:49:19] [INFO ] Invariant cache hit.
[2024-05-31 22:49:19] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 22:49:19] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 22:49:19] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-31 22:49:19] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:49:19] [INFO ] [Real]Added 39 Read/Feed constraints in 83 ms returned sat
[2024-05-31 22:49:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:49:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 22:49:19] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 22:49:19] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-31 22:49:20] [INFO ] [Nat]Added 39 Read/Feed constraints in 184 ms returned sat
[2024-05-31 22:49:20] [INFO ] Computed and/alt/rep : 167/1045/167 causal constraints (skipped 46 transitions) in 14 ms.
[2024-05-31 22:49:20] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:49:21] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:49:22] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:49:22] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:49:22] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:49:22] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:49:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1664 ms
[2024-05-31 22:49:22] [INFO ] Added : 94 causal constraints over 19 iterations in 2429 ms. Result :sat
Minimization took 294 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-31 22:49:26] [INFO ] Invariant cache hit.
[2024-05-31 22:49:27] [INFO ] Implicit Places using invariants in 152 ms returned [134, 208]
[2024-05-31 22:49:27] [INFO ] Actually due to overlaps returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 154 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 210/211 places, 214/214 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 213
Applied a total of 2 rules in 7 ms. Remains 209 /210 variables (removed 1) and now considering 213/214 (removed 1) transitions.
// Phase 1: matrix 213 rows 209 cols
[2024-05-31 22:49:27] [INFO ] Computed 32 invariants in 13 ms
[2024-05-31 22:49:27] [INFO ] Implicit Places using invariants in 161 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 162 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/211 places, 213/214 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 212
Applied a total of 2 rules in 6 ms. Remains 207 /208 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 207 cols
[2024-05-31 22:49:27] [INFO ] Computed 31 invariants in 10 ms
[2024-05-31 22:49:27] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 22:49:27] [INFO ] Invariant cache hit.
[2024-05-31 22:49:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:49:28] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned [146, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1663 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 205/211 places, 212/214 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 204 transition count 211
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 204 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 202 transition count 211
Applied a total of 6 rules in 16 ms. Remains 202 /205 variables (removed 3) and now considering 211/212 (removed 1) transitions.
// Phase 1: matrix 211 rows 202 cols
[2024-05-31 22:49:28] [INFO ] Computed 29 invariants in 12 ms
[2024-05-31 22:49:29] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-31 22:49:29] [INFO ] Invariant cache hit.
[2024-05-31 22:49:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:49:30] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 202/211 places, 211/214 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3341 ms. Remains : 202/211 places, 211/214 transitions.
[2024-05-31 22:49:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144046 resets) in 672 ms. (1485 steps per ms)
BEST_FIRST walk for 1000000 steps (91187 resets) in 482 ms. (2070 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:49:31] [INFO ] Invariant cache hit.
[2024-05-31 22:49:31] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 22:49:31] [INFO ] [Real]Absence check using 12 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-31 22:49:31] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-31 22:49:31] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:49:31] [INFO ] [Real]Added 39 Read/Feed constraints in 81 ms returned sat
[2024-05-31 22:49:31] [INFO ] Computed and/alt/rep : 158/1027/158 causal constraints (skipped 52 transitions) in 14 ms.
[2024-05-31 22:49:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:49:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 22:49:31] [INFO ] [Nat]Absence check using 12 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-31 22:49:31] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-31 22:49:31] [INFO ] [Nat]Added 39 Read/Feed constraints in 104 ms returned sat
[2024-05-31 22:49:31] [INFO ] Computed and/alt/rep : 158/1027/158 causal constraints (skipped 52 transitions) in 15 ms.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:49:33] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:49:34] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1612 ms
[2024-05-31 22:49:34] [INFO ] Added : 134 causal constraints over 28 iterations in 2840 ms. Result :sat
Minimization took 556 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 202/202 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 202 /202 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-31 22:49:37] [INFO ] Invariant cache hit.
[2024-05-31 22:49:37] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 22:49:37] [INFO ] Invariant cache hit.
[2024-05-31 22:49:37] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:49:38] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2024-05-31 22:49:38] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 22:49:38] [INFO ] Invariant cache hit.
[2024-05-31 22:49:38] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/202 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 22:49:41] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 6 (OVERLAPS) 211/413 variables, 202/232 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 39/271 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/271 constraints. Problems are: Problem set: 19 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/271 constraints. Problems are: Problem set: 19 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 271 constraints, problems are : Problem set: 19 solved, 191 unsolved in 11656 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 202/202 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 19 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 2/2 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 15/17 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 10/193 variables, 10/27 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/28 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/28 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 6/199 variables, 2/30 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 22:49:52] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:49:52] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:49:52] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 3/33 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/33 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 211/410 variables, 199/232 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 39/271 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 132/403 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 22:49:59] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:49:59] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:49:59] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:49:59] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 4/407 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 22:50:03] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:50:03] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:50:03] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:50:03] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:50:03] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:50:03] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:50:04] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:50:06] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:50:06] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 17/424 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 22:50:14] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:50:14] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:50:14] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:50:14] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 4/428 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 22:50:20] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 1 ms to minimize.
SMT process timed out in 41796ms, After SMT, problems are : Problem set: 19 solved, 191 unsolved
Search for dead transitions found 19 dead transitions in 41798ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/202 places, 192/211 transitions.
Graph (complete) has 984 edges and 202 vertex of which 185 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 185 /202 variables (removed 17) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 185 cols
[2024-05-31 22:50:20] [INFO ] Computed 28 invariants in 7 ms
[2024-05-31 22:50:20] [INFO ] Implicit Places using invariants in 128 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 184/202 places, 192/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 191
Applied a total of 2 rules in 5 ms. Remains 183 /184 variables (removed 1) and now considering 191/192 (removed 1) transitions.
// Phase 1: matrix 191 rows 183 cols
[2024-05-31 22:50:20] [INFO ] Computed 27 invariants in 7 ms
[2024-05-31 22:50:20] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-31 22:50:20] [INFO ] Invariant cache hit.
[2024-05-31 22:50:20] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 22:50:21] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 183/202 places, 191/211 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 44437 ms. Remains : 183/202 places, 191/211 transitions.
[2024-05-31 22:50:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144087 resets) in 641 ms. (1557 steps per ms)
BEST_FIRST walk for 1000001 steps (91359 resets) in 464 ms. (2150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:50:22] [INFO ] Invariant cache hit.
[2024-05-31 22:50:22] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 22:50:22] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:50:23] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-31 22:50:23] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 22:50:23] [INFO ] [Real]Added 35 Read/Feed constraints in 58 ms returned sat
[2024-05-31 22:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:50:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 22:50:23] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:50:23] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-31 22:50:23] [INFO ] [Nat]Added 35 Read/Feed constraints in 106 ms returned sat
[2024-05-31 22:50:23] [INFO ] Computed and/alt/rep : 152/980/152 causal constraints (skipped 38 transitions) in 9 ms.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:50:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:50:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 872 ms
[2024-05-31 22:50:26] [INFO ] Added : 146 causal constraints over 31 iterations in 2639 ms. Result :sat
Minimization took 640 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 183/183 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-31 22:50:30] [INFO ] Invariant cache hit.
[2024-05-31 22:50:30] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-31 22:50:30] [INFO ] Invariant cache hit.
[2024-05-31 22:50:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 22:50:31] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2024-05-31 22:50:31] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 22:50:31] [INFO ] Invariant cache hit.
[2024-05-31 22:50:31] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 2/183 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/374 variables, 183/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 35/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 245 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6856 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 2/183 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 22:50:39] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 191/374 variables, 183/211 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 35/246 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 190/436 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 22:50:45] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:50:45] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:50:46] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 439 constraints, problems are : Problem set: 0 solved, 190 unsolved in 23678 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 4/4 constraints]
After SMT, in 30605ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 30609ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31793 ms. Remains : 183/183 places, 191/191 transitions.
RANDOM walk for 40000 steps (5697 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3617 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3683 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 588885 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 2
Probabilistic random walk after 588885 steps, saw 294496 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
[2024-05-31 22:51:05] [INFO ] Invariant cache hit.
[2024-05-31 22:51:05] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:51:05] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/178 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 191/369 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/374 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/178 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 191/369 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/374 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 248 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3937 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 183/183 places, 191/191 transitions.
RANDOM walk for 40000 steps (5797 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3648 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3680 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 593285 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 2
Probabilistic random walk after 593285 steps, saw 296700 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2024-05-31 22:51:12] [INFO ] Invariant cache hit.
[2024-05-31 22:51:12] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:51:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/178 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 191/369 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/374 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/178 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 191/369 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/374 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 248 constraints, problems are : Problem set: 0 solved, 2 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 574ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3357 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 183/183 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-31 22:51:16] [INFO ] Invariant cache hit.
[2024-05-31 22:51:16] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 22:51:16] [INFO ] Invariant cache hit.
[2024-05-31 22:51:16] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 22:51:17] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2024-05-31 22:51:17] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 22:51:17] [INFO ] Invariant cache hit.
[2024-05-31 22:51:17] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 2/183 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/374 variables, 183/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 35/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 245 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6785 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 2/183 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 22:51:25] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 191/374 variables, 183/211 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 35/246 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 190/436 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-31 22:51:31] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:51:32] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 439 constraints, problems are : Problem set: 0 solved, 190 unsolved in 23288 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 4/4 constraints]
After SMT, in 30144ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 30147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31304 ms. Remains : 183/183 places, 191/191 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 183 transition count 174
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 166 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 158 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 158 transition count 166
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 158 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 156 transition count 164
Applied a total of 54 rules in 9 ms. Remains 156 /183 variables (removed 27) and now considering 164/191 (removed 27) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 164 rows 156 cols
[2024-05-31 22:51:47] [INFO ] Computed 27 invariants in 7 ms
[2024-05-31 22:51:47] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 22:51:47] [INFO ] [Real]Absence check using 12 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 22:51:48] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:51:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:51:48] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:51:48] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:51:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 22:51:48] [INFO ] [Nat]Absence check using 12 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 22:51:48] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:51:48] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:51:48] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:51:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 1
[2024-05-31 22:51:48] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:51:48] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 455 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-02 in 158616 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 22:51:48] [INFO ] Computed 33 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1444 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (908 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:51:48] [INFO ] Invariant cache hit.
[2024-05-31 22:51:48] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:51:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-31 22:51:48] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-31 22:51:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:51:48] [INFO ] [Real]Added 33 Read/Feed constraints in 113 ms returned sat
[2024-05-31 22:51:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:51:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:51:48] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:51:48] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-31 22:51:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 106 ms returned sat
[2024-05-31 22:51:48] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:51:50] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:51:51] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:51:51] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:51:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1067 ms
[2024-05-31 22:51:51] [INFO ] Added : 139 causal constraints over 29 iterations in 2268 ms. Result :sat
Minimization took 338 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p350) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 227 transition count 226
Reduce places removed 4 places and 4 transitions.
Graph (complete) has 931 edges and 223 vertex of which 222 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 222 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 222 transition count 220
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 220 transition count 220
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 215 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 214 transition count 215
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 35 place count 214 transition count 206
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 45 place count 204 transition count 206
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 204 transition count 206
Applied a total of 49 rules in 23 ms. Remains 204 /229 variables (removed 25) and now considering 206/230 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 204/229 places, 206/230 transitions.
// Phase 1: matrix 206 rows 204 cols
[2024-05-31 22:51:51] [INFO ] Computed 33 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144304 resets) in 663 ms. (1506 steps per ms)
BEST_FIRST walk for 1000000 steps (91503 resets) in 480 ms. (2079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:51:53] [INFO ] Invariant cache hit.
[2024-05-31 22:51:53] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 22:51:53] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 22:51:53] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-31 22:51:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 22:51:53] [INFO ] [Real]Added 40 Read/Feed constraints in 54 ms returned sat
[2024-05-31 22:51:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:51:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-31 22:51:53] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:51:53] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-31 22:51:53] [INFO ] [Nat]Added 40 Read/Feed constraints in 91 ms returned sat
[2024-05-31 22:51:53] [INFO ] Computed and/alt/rep : 154/978/154 causal constraints (skipped 51 transitions) in 13 ms.
[2024-05-31 22:51:54] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:51:54] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:51:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:51:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2024-05-31 22:51:54] [INFO ] Added : 98 causal constraints over 21 iterations in 965 ms. Result :sat
Minimization took 292 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 204/204 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-31 22:51:55] [INFO ] Invariant cache hit.
[2024-05-31 22:51:55] [INFO ] Implicit Places using invariants in 153 ms returned [98, 129, 201]
[2024-05-31 22:51:55] [INFO ] Actually due to overlaps returned [201]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 154 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 203/204 places, 206/206 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 203 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 202 transition count 205
Applied a total of 2 rules in 6 ms. Remains 202 /203 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 202 cols
[2024-05-31 22:51:55] [INFO ] Computed 32 invariants in 9 ms
[2024-05-31 22:51:55] [INFO ] Implicit Places using invariants in 137 ms returned [98, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 138 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 200/204 places, 205/206 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 204
Applied a total of 2 rules in 6 ms. Remains 199 /200 variables (removed 1) and now considering 204/205 (removed 1) transitions.
// Phase 1: matrix 204 rows 199 cols
[2024-05-31 22:51:55] [INFO ] Computed 30 invariants in 7 ms
[2024-05-31 22:51:55] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 22:51:55] [INFO ] Invariant cache hit.
[2024-05-31 22:51:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 22:51:57] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1645 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 198/204 places, 204/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1958 ms. Remains : 198/204 places, 204/206 transitions.
// Phase 1: matrix 204 rows 198 cols
[2024-05-31 22:51:57] [INFO ] Computed 29 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144134 resets) in 664 ms. (1503 steps per ms)
BEST_FIRST walk for 1000000 steps (91679 resets) in 466 ms. (2141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:51:58] [INFO ] Invariant cache hit.
[2024-05-31 22:51:58] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 22:51:58] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 2 ms returned sat
[2024-05-31 22:51:58] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-31 22:51:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:51:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 22:51:58] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 2 ms returned sat
[2024-05-31 22:51:58] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-05-31 22:51:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:51:58] [INFO ] [Nat]Added 38 Read/Feed constraints in 64 ms returned sat
[2024-05-31 22:51:58] [INFO ] Computed and/alt/rep : 156/1000/156 causal constraints (skipped 47 transitions) in 10 ms.
[2024-05-31 22:51:59] [INFO ] Added : 105 causal constraints over 22 iterations in 752 ms. Result :sat
Minimization took 342 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 198/198 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 22:52:00] [INFO ] Invariant cache hit.
[2024-05-31 22:52:00] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 22:52:00] [INFO ] Invariant cache hit.
[2024-05-31 22:52:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-31 22:52:01] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
[2024-05-31 22:52:01] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-31 22:52:01] [INFO ] Invariant cache hit.
[2024-05-31 22:52:01] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 2/198 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 5 (OVERLAPS) 204/402 variables, 198/227 constraints. Problems are: Problem set: 61 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 38/265 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/265 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/265 constraints. Problems are: Problem set: 61 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 265 constraints, problems are : Problem set: 61 solved, 142 unsolved in 6359 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 198/198 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 61 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 11/13 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/13 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 32/168 variables, 8/21 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/21 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 26/194 variables, 7/28 constraints. Problems are: Problem set: 61 solved, 142 unsolved
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:52:09] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 2/30 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 2/196 variables, 1/31 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/31 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 204/400 variables, 196/227 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 38/265 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 104/369 constraints. Problems are: Problem set: 61 solved, 142 unsolved
[2024-05-31 22:52:14] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:52:15] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:52:15] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:52:15] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:52:16] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:52:16] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:52:16] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:52:16] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:52:16] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:52:16] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:52:16] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:52:17] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:52:17] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:52:17] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:52:17] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:52:17] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:52:17] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 17/386 constraints. Problems are: Problem set: 61 solved, 142 unsolved
[2024-05-31 22:52:19] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:52:21] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 2/388 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 0/388 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 16 (OVERLAPS) 2/402 variables, 2/390 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/402 variables, 38/428 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 0/428 constraints. Problems are: Problem set: 61 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 428 constraints, problems are : Problem set: 61 solved, 142 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 198/198 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 142/203 constraints, Known Traps: 21/21 constraints]
After SMT, in 36464ms problems are : Problem set: 61 solved, 142 unsolved
Search for dead transitions found 61 dead transitions in 36467ms
Found 61 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 61 transitions
Dead transitions reduction (with SMT) removed 61 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/198 places, 143/204 transitions.
Graph (complete) has 675 edges and 198 vertex of which 138 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 138 /198 variables (removed 60) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 138 cols
[2024-05-31 22:52:38] [INFO ] Computed 21 invariants in 6 ms
[2024-05-31 22:52:38] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-31 22:52:38] [INFO ] Invariant cache hit.
[2024-05-31 22:52:38] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 22:52:38] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 138/198 places, 143/204 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38668 ms. Remains : 138/198 places, 143/204 transitions.
[2024-05-31 22:52:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144200 resets) in 591 ms. (1689 steps per ms)
BEST_FIRST walk for 1000000 steps (91487 resets) in 421 ms. (2369 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:52:39] [INFO ] Invariant cache hit.
[2024-05-31 22:52:39] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-31 22:52:39] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 1 ms returned sat
[2024-05-31 22:52:39] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-31 22:52:40] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 22:52:40] [INFO ] [Real]Added 26 Read/Feed constraints in 20 ms returned sat
[2024-05-31 22:52:40] [INFO ] Computed and/alt/rep : 118/744/118 causal constraints (skipped 24 transitions) in 9 ms.
[2024-05-31 22:52:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:52:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-31 22:52:40] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:52:40] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 22:52:40] [INFO ] [Nat]Added 26 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:52:40] [INFO ] Computed and/alt/rep : 118/744/118 causal constraints (skipped 24 transitions) in 10 ms.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:52:40] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:52:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 223 ms
[2024-05-31 22:52:41] [INFO ] Added : 110 causal constraints over 24 iterations in 862 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 138/138 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-05-31 22:52:41] [INFO ] Invariant cache hit.
[2024-05-31 22:52:41] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 22:52:41] [INFO ] Invariant cache hit.
[2024-05-31 22:52:41] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 22:52:42] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-31 22:52:42] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-31 22:52:42] [INFO ] Invariant cache hit.
[2024-05-31 22:52:42] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/281 variables, 138/159 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 26/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 185 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3972 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/281 variables, 138/159 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 26/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 142/327 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-31 22:52:51] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:52:51] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:52:51] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:52:51] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/281 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-31 22:52:54] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:52:54] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-31 22:52:58] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2024-05-31 22:52:58] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:52:58] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:52:58] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:52:58] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:52:58] [INFO ] Deduced a trap composed of 69 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/281 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 339 constraints, problems are : Problem set: 0 solved, 142 unsolved in 19151 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 12/12 constraints]
After SMT, in 23173ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 23175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23787 ms. Remains : 138/138 places, 143/143 transitions.
RANDOM walk for 40000 steps (5833 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3634 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3601 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 674652 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 2
Probabilistic random walk after 674652 steps, saw 337392 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
[2024-05-31 22:53:08] [INFO ] Invariant cache hit.
[2024-05-31 22:53:08] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/134 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 143/277 variables, 134/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 26/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/281 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/281 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/134 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:53:09] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 143/277 variables, 134/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 26/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/281 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/281 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 1098ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1245 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 138/138 places, 143/143 transitions.
RANDOM walk for 40000 steps (5764 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3667 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3751 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 623870 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 2
Probabilistic random walk after 623870 steps, saw 311999 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
[2024-05-31 22:53:13] [INFO ] Invariant cache hit.
[2024-05-31 22:53:13] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:13] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/134 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:13] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 143/277 variables, 134/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 26/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/281 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/281 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/134 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:53:14] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 143/277 variables, 134/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 26/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/281 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/281 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1361 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 138/138 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-05-31 22:53:16] [INFO ] Invariant cache hit.
[2024-05-31 22:53:16] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 22:53:16] [INFO ] Invariant cache hit.
[2024-05-31 22:53:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 22:53:16] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-31 22:53:16] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-31 22:53:16] [INFO ] Invariant cache hit.
[2024-05-31 22:53:16] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/281 variables, 138/159 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 26/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 185 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3921 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/281 variables, 138/159 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 26/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 142/327 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-31 22:53:26] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:53:26] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:53:26] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:53:26] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/281 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-31 22:53:29] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 0 ms to minimize.
[2024-05-31 22:53:29] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:53:34] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/281 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 339 constraints, problems are : Problem set: 0 solved, 142 unsolved in 20360 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 12/12 constraints]
After SMT, in 24329ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 24331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24952 ms. Remains : 138/138 places, 143/143 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 138 transition count 130
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 125 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 119 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 119 transition count 124
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 119 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 118 transition count 123
Applied a total of 40 rules in 12 ms. Remains 118 /138 variables (removed 20) and now considering 123/143 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 118 cols
[2024-05-31 22:53:41] [INFO ] Computed 21 invariants in 3 ms
[2024-05-31 22:53:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:53:41] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-31 22:53:41] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:53:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:53:41] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:53:41] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:53:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:53:41] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-31 22:53:41] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:53:41] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:53:41] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
TRAPS : Iteration 1
[2024-05-31 22:53:41] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:53:41] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 307 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 113233 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 22:53:41] [INFO ] Computed 33 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1419 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (924 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:53:41] [INFO ] Invariant cache hit.
[2024-05-31 22:53:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:53:41] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 22:53:41] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-31 22:53:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:53:41] [INFO ] [Real]Added 33 Read/Feed constraints in 82 ms returned sat
[2024-05-31 22:53:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:53:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:53:41] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:53:42] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-31 22:53:42] [INFO ] [Nat]Added 33 Read/Feed constraints in 133 ms returned sat
[2024-05-31 22:53:42] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:53:42] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:53:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2024-05-31 22:53:42] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:53:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 471 ms
[2024-05-31 22:53:43] [INFO ] Added : 119 causal constraints over 25 iterations in 1204 ms. Result :sat
Minimization took 345 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p367) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 1 places and 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 225
Reduce places removed 3 places and 13 transitions.
Graph (complete) has 794 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 223 transition count 212
Reduce places removed 9 places and 14 transitions.
Graph (complete) has 751 edges and 214 vertex of which 210 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 19 place count 209 transition count 197
Reduce places removed 7 places and 6 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 722 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 9 rules applied. Total rules applied 28 place count 200 transition count 190
Reduce places removed 2 places and 4 transitions.
Graph (complete) has 705 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 31 place count 196 transition count 186
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 37 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 81 place count 151 transition count 144
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 84 place count 148 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 86 place count 147 transition count 144
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 88 place count 146 transition count 144
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 94 place count 146 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 100 place count 140 transition count 138
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 102 place count 140 transition count 138
Applied a total of 102 rules in 17 ms. Remains 140 /229 variables (removed 89) and now considering 138/230 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 140/229 places, 138/230 transitions.
// Phase 1: matrix 138 rows 140 cols
[2024-05-31 22:53:44] [INFO ] Computed 24 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144023 resets) in 580 ms. (1721 steps per ms)
BEST_FIRST walk for 1000000 steps (91398 resets) in 429 ms. (2325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:53:45] [INFO ] Invariant cache hit.
[2024-05-31 22:53:45] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-31 22:53:45] [INFO ] [Real]Absence check using 9 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-31 22:53:45] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-31 22:53:45] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-31 22:53:45] [INFO ] [Real]Added 28 Read/Feed constraints in 32 ms returned sat
[2024-05-31 22:53:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:53:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-31 22:53:45] [INFO ] [Nat]Absence check using 9 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 22:53:45] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-31 22:53:45] [INFO ] [Nat]Added 28 Read/Feed constraints in 28 ms returned sat
[2024-05-31 22:53:45] [INFO ] Computed and/alt/rep : 112/685/112 causal constraints (skipped 25 transitions) in 11 ms.
[2024-05-31 22:53:45] [INFO ] Added : 101 causal constraints over 21 iterations in 568 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 140/140 places, 138/138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-31 22:53:46] [INFO ] Invariant cache hit.
[2024-05-31 22:53:46] [INFO ] Implicit Places using invariants in 99 ms returned [98, 103, 137]
[2024-05-31 22:53:46] [INFO ] Actually due to overlaps returned [137, 103]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 100 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 138/140 places, 138/138 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 138 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 137
Applied a total of 2 rules in 4 ms. Remains 137 /138 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 137 cols
[2024-05-31 22:53:46] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 22:53:46] [INFO ] Implicit Places using invariants in 83 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 136/140 places, 137/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 136 /136 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 192 ms. Remains : 136/140 places, 137/138 transitions.
// Phase 1: matrix 137 rows 136 cols
[2024-05-31 22:53:46] [INFO ] Computed 21 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144348 resets) in 575 ms. (1736 steps per ms)
BEST_FIRST walk for 1000001 steps (91423 resets) in 412 ms. (2421 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:53:47] [INFO ] Invariant cache hit.
[2024-05-31 22:53:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:53:47] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-31 22:53:47] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-31 22:53:47] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 22:53:47] [INFO ] [Real]Added 26 Read/Feed constraints in 19 ms returned sat
[2024-05-31 22:53:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:53:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:53:47] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-31 22:53:47] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 22:53:47] [INFO ] [Nat]Added 26 Read/Feed constraints in 23 ms returned sat
[2024-05-31 22:53:47] [INFO ] Computed and/alt/rep : 116/721/116 causal constraints (skipped 20 transitions) in 9 ms.
[2024-05-31 22:53:48] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:53:48] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:53:48] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:53:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 193 ms
[2024-05-31 22:53:48] [INFO ] Added : 109 causal constraints over 22 iterations in 789 ms. Result :sat
Minimization took 219 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 136/136 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-31 22:53:48] [INFO ] Invariant cache hit.
[2024-05-31 22:53:49] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 22:53:49] [INFO ] Invariant cache hit.
[2024-05-31 22:53:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 22:53:49] [INFO ] Implicit Places using invariants and state equation in 463 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 552 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/136 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 557 ms. Remains : 135/136 places, 137/137 transitions.
// Phase 1: matrix 137 rows 135 cols
[2024-05-31 22:53:49] [INFO ] Computed 20 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144398 resets) in 574 ms. (1739 steps per ms)
BEST_FIRST walk for 1000001 steps (91191 resets) in 405 ms. (2463 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:53:50] [INFO ] Invariant cache hit.
[2024-05-31 22:53:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:53:50] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-31 22:53:50] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-31 22:53:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 22:53:50] [INFO ] [Real]Added 26 Read/Feed constraints in 22 ms returned sat
[2024-05-31 22:53:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:53:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:53:50] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-31 22:53:50] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 22:53:50] [INFO ] [Nat]Added 26 Read/Feed constraints in 26 ms returned sat
[2024-05-31 22:53:50] [INFO ] Computed and/alt/rep : 116/719/116 causal constraints (skipped 20 transitions) in 8 ms.
[2024-05-31 22:53:51] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:53:51] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:53:51] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:53:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 185 ms
[2024-05-31 22:53:51] [INFO ] Added : 101 causal constraints over 22 iterations in 791 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 135/135 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-31 22:53:51] [INFO ] Invariant cache hit.
[2024-05-31 22:53:52] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 22:53:52] [INFO ] Invariant cache hit.
[2024-05-31 22:53:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 22:53:52] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-31 22:53:52] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-31 22:53:52] [INFO ] Invariant cache hit.
[2024-05-31 22:53:52] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/272 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 26/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 181 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4773 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/272 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 26/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 136/317 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:53:59] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 61 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 62 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/272 variables, 11/332 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:54:07] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:54:07] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:54:12] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/272 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 0 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 0 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:54:15] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 7/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 342 constraints, problems are : Problem set: 0 solved, 136 unsolved in 26679 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 25/25 constraints]
After SMT, in 31498ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 31502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31922 ms. Remains : 135/135 places, 137/137 transitions.
RANDOM walk for 40000 steps (5771 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3678 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 490335 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 2
Probabilistic random walk after 490335 steps, saw 245212 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2024-05-31 22:54:26] [INFO ] Invariant cache hit.
[2024-05-31 22:54:26] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/110 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/126 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/128 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 136/264 variables, 128/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 24/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/272 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/110 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/126 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/128 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 136/264 variables, 128/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/272 variables, 7/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/272 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/272 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/272 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 198 constraints, problems are : Problem set: 0 solved, 2 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 964ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1150 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 135/135 places, 137/137 transitions.
RANDOM walk for 40000 steps (5724 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3715 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3644 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 596830 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 2
Probabilistic random walk after 596830 steps, saw 298466 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2024-05-31 22:54:32] [INFO ] Invariant cache hit.
[2024-05-31 22:54:32] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/110 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/126 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/128 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 136/264 variables, 128/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 24/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/272 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/110 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/126 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/128 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 136/264 variables, 128/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/272 variables, 7/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/272 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/272 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/272 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 198 constraints, problems are : Problem set: 0 solved, 2 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 966ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 907 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 135/135 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-31 22:54:34] [INFO ] Invariant cache hit.
[2024-05-31 22:54:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 22:54:34] [INFO ] Invariant cache hit.
[2024-05-31 22:54:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 22:54:34] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-31 22:54:34] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-31 22:54:34] [INFO ] Invariant cache hit.
[2024-05-31 22:54:34] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/272 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 26/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 181 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4859 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/272 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 26/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 136/317 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 62 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 0 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 0 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/272 variables, 11/332 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:54:54] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/272 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 7/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 342 constraints, problems are : Problem set: 0 solved, 136 unsolved in 26938 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 25/25 constraints]
After SMT, in 31844ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 31846ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32276 ms. Remains : 135/135 places, 137/137 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 135 transition count 124
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 122 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 116 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 116 transition count 118
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 116 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 115 transition count 117
Applied a total of 40 rules in 5 ms. Remains 115 /135 variables (removed 20) and now considering 117/137 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 117 rows 115 cols
[2024-05-31 22:55:06] [INFO ] Computed 20 invariants in 3 ms
[2024-05-31 22:55:06] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:55:06] [INFO ] [Real]Absence check using 8 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:55:06] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:55:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:55:06] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:55:06] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:55:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:55:06] [INFO ] [Nat]Absence check using 8 positive and 12 generalized place invariants in 1 ms returned sat
[2024-05-31 22:55:06] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:55:06] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:55:06] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:55:06] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 237 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-05 in 84995 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 22:55:06] [INFO ] Computed 33 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1451 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (904 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:55:06] [INFO ] Invariant cache hit.
[2024-05-31 22:55:06] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:55:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 22:55:06] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-31 22:55:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:55:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:55:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:55:06] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-31 22:55:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:55:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:55:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 557 ms returned sat
[2024-05-31 22:55:07] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-31 22:55:09] [INFO ] Added : 165 causal constraints over 33 iterations in 2376 ms. Result :sat
Minimization took 508 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 228 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 228 transition count 229
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 226 transition count 229
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 222 transition count 225
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 220 transition count 225
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 220 transition count 217
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 212 transition count 217
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 212 transition count 217
Applied a total of 39 rules in 20 ms. Remains 212 /229 variables (removed 17) and now considering 217/232 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 212/229 places, 217/232 transitions.
Found an invariant !
This invariant on transitions {21=1, 30=1, 34=2, 35=2, 48=1, 75=1, 90=2, 94=1, 121=1, 136=1, 137=1, 148=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {21=1, 30=1, 48=1, 75=1, 94=1, 121=1, 136=1, 148=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1407 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 217 rows 212 cols
[2024-05-31 22:55:25] [INFO ] Computed 33 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144025 resets) in 692 ms. (1443 steps per ms)
BEST_FIRST walk for 1000000 steps (91338 resets) in 476 ms. (2096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:55:26] [INFO ] Invariant cache hit.
[2024-05-31 22:55:26] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 22:55:26] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:55:26] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-31 22:55:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:55:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 22:55:27] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:55:27] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2024-05-31 22:55:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:55:27] [INFO ] [Nat]Added 39 Read/Feed constraints in 344 ms returned sat
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:55:29] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:55:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1659 ms
[2024-05-31 22:55:29] [INFO ] Computed and/alt/rep : 168/1051/168 causal constraints (skipped 48 transitions) in 12 ms.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:55:31] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:55:31] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:55:31] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:55:31] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:55:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 595 ms
[2024-05-31 22:55:31] [INFO ] Added : 121 causal constraints over 25 iterations in 2264 ms. Result :sat
Minimization took 439 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 212/212 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2024-05-31 22:55:32] [INFO ] Invariant cache hit.
[2024-05-31 22:55:33] [INFO ] Implicit Places using invariants in 145 ms returned [134, 209]
[2024-05-31 22:55:33] [INFO ] Actually due to overlaps returned [209]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/212 places, 217/217 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 6 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-31 22:55:33] [INFO ] Computed 32 invariants in 9 ms
[2024-05-31 22:55:33] [INFO ] Implicit Places using invariants in 134 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/212 places, 216/217 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 215
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 208 cols
[2024-05-31 22:55:33] [INFO ] Computed 31 invariants in 9 ms
[2024-05-31 22:55:33] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-31 22:55:33] [INFO ] Invariant cache hit.
[2024-05-31 22:55:33] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:55:34] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 208/212 places, 215/217 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1622 ms. Remains : 208/212 places, 215/217 transitions.
Found an invariant !
This invariant on transitions {21=1, 29=1, 46=1, 72=1, 91=1, 117=1, 132=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {21=1, 29=1, 46=1, 72=1, 91=1, 117=1, 132=1, 144=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:56:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144496 resets) in 672 ms. (1485 steps per ms)
BEST_FIRST walk for 1000000 steps (91483 resets) in 475 ms. (2100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:56:44] [INFO ] Invariant cache hit.
[2024-05-31 22:56:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:56:44] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:56:44] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-31 22:56:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:56:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 22:56:44] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:56:44] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-31 22:56:44] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:56:44] [INFO ] [Nat]Added 39 Read/Feed constraints in 475 ms returned sat
[2024-05-31 22:56:44] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:56:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 484 ms
[2024-05-31 22:56:45] [INFO ] Computed and/alt/rep : 171/1090/171 causal constraints (skipped 43 transitions) in 11 ms.
[2024-05-31 22:56:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:56:46] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:56:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2024-05-31 22:56:46] [INFO ] Added : 105 causal constraints over 22 iterations in 1154 ms. Result :sat
Minimization took 310 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 22:56:55] [INFO ] Invariant cache hit.
[2024-05-31 22:56:55] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 22:56:55] [INFO ] Invariant cache hit.
[2024-05-31 22:56:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:56:56] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2024-05-31 22:56:56] [INFO ] Redundant transitions in 2 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-31 22:56:56] [INFO ] Invariant cache hit.
[2024-05-31 22:56:56] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/423 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 39/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 278 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9426 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/423 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 39/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 214/492 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:57:14] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:57:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:57:15] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:57:20] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:57:28] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:57:28] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:57:28] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 499 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 7/7 constraints]
After SMT, in 39521ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40833 ms. Remains : 208/208 places, 215/215 transitions.
Found an invariant !
This invariant on transitions {21=1, 29=1, 46=1, 72=1, 91=1, 117=1, 132=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {21=1, 29=1, 46=1, 72=1, 91=1, 117=1, 132=1, 144=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40000 steps (5801 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3630 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 885630 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 1
Probabilistic random walk after 885630 steps, saw 442901 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
[2024-05-31 22:58:47] [INFO ] Invariant cache hit.
[2024-05-31 22:58:47] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/203 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/418 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 39/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/423 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 96 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 93 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/203 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:58:48] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/418 variables, 203/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/423 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1384 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 1555ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 213 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 215/215 transitions.
RANDOM walk for 40000 steps (5798 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3698 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 887812 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 1
Probabilistic random walk after 887812 steps, saw 443993 distinct states, run finished after 3002 ms. (steps per millisecond=295 ) properties seen :0
[2024-05-31 22:58:52] [INFO ] Invariant cache hit.
[2024-05-31 22:58:52] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/203 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/418 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 39/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/423 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:58:52] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:58:52] [INFO ] Deduced a trap composed of 93 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 96 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 93 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/203 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:58:53] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/418 variables, 203/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 39/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/423 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1576 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 1751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 584 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 208/208 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 22:58:54] [INFO ] Invariant cache hit.
[2024-05-31 22:58:55] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 22:58:55] [INFO ] Invariant cache hit.
[2024-05-31 22:58:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 22:58:56] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2024-05-31 22:58:56] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-31 22:58:56] [INFO ] Invariant cache hit.
[2024-05-31 22:58:56] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/423 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 39/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 278 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9333 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/423 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 39/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 214/492 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:59:14] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:59:14] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:59:15] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:59:19] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:59:27] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:59:28] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:59:28] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 499 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 7/7 constraints]
After SMT, in 39424ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39428ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40754 ms. Remains : 208/208 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 187
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 180 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 58 place count 179 transition count 186
Applied a total of 58 rules in 12 ms. Remains 179 /208 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 179 cols
[2024-05-31 22:59:35] [INFO ] Computed 31 invariants in 17 ms
[2024-05-31 22:59:35] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:59:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 22:59:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:59:35] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:59:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:59:35] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:59:36] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:59:36] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:59:36] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:59:36] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:59:36] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:59:36] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:59:36] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:59:36] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:59:36] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:59:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 594 ms
TRAPS : Iteration 1
[2024-05-31 22:59:36] [INFO ] After 660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:59:36] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 881 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-06 in 270009 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 22:59:36] [INFO ] Computed 33 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1412 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (921 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:59:36] [INFO ] Invariant cache hit.
[2024-05-31 22:59:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:59:36] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 22:59:36] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-31 22:59:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:59:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:59:36] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 22:59:36] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-31 22:59:36] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 22:59:37] [INFO ] [Nat]Added 33 Read/Feed constraints in 230 ms returned sat
[2024-05-31 22:59:37] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:59:37] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:59:37] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:59:37] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:59:37] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:59:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 585 ms
[2024-05-31 22:59:37] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:59:39] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:59:40] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:59:41] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:59:41] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:59:41] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:59:41] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:59:41] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:59:41] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:59:41] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:59:41] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:59:41] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:59:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 230
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 227 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 227 transition count 228
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 225 transition count 228
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 220 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 219 transition count 223
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 219 transition count 216
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 212 transition count 216
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 212 transition count 216
Applied a total of 36 rules in 16 ms. Remains 212 /229 variables (removed 17) and now considering 216/232 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 212/229 places, 216/232 transitions.
Found an invariant !
This invariant on transitions {22=1, 31=1, 34=2, 35=2, 53=1, 82=1, 97=2, 101=1, 129=1, 144=1, 145=1, 156=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 31=1, 53=1, 82=1, 101=1, 129=1, 144=1, 156=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 216 rows 212 cols
[2024-05-31 22:59:47] [INFO ] Computed 33 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144096 resets) in 689 ms. (1449 steps per ms)
BEST_FIRST walk for 1000000 steps (91326 resets) in 478 ms. (2087 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:59:49] [INFO ] Invariant cache hit.
[2024-05-31 22:59:49] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-31 22:59:49] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:59:49] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-31 22:59:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 22:59:49] [INFO ] [Real]Added 36 Read/Feed constraints in 36 ms returned sat
[2024-05-31 22:59:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:59:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 22:59:49] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 22:59:49] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-31 22:59:49] [INFO ] [Nat]Added 36 Read/Feed constraints in 249 ms returned sat
[2024-05-31 22:59:49] [INFO ] Computed and/alt/rep : 175/1068/175 causal constraints (skipped 40 transitions) in 13 ms.
[2024-05-31 22:59:50] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:59:50] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:59:50] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:59:50] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:59:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 395 ms
[2024-05-31 22:59:50] [INFO ] Added : 84 causal constraints over 17 iterations in 909 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 22:59:51] [INFO ] Invariant cache hit.
[2024-05-31 22:59:51] [INFO ] Implicit Places using invariants in 150 ms returned [136, 209]
[2024-05-31 22:59:51] [INFO ] Actually due to overlaps returned [209]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/212 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 215
Applied a total of 2 rules in 7 ms. Remains 210 /211 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 210 cols
[2024-05-31 22:59:51] [INFO ] Computed 32 invariants in 10 ms
[2024-05-31 22:59:51] [INFO ] Implicit Places using invariants in 136 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/212 places, 215/216 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 7 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-31 22:59:51] [INFO ] Computed 31 invariants in 10 ms
[2024-05-31 22:59:51] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 22:59:51] [INFO ] Invariant cache hit.
[2024-05-31 22:59:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 22:59:52] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 208/212 places, 214/216 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1598 ms. Remains : 208/212 places, 214/216 transitions.
Found an invariant !
This invariant on transitions {22=1, 30=1, 51=1, 79=1, 98=1, 125=1, 140=1, 152=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 30=1, 51=1, 79=1, 98=1, 125=1, 140=1, 152=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 23:00:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144180 resets) in 670 ms. (1490 steps per ms)
BEST_FIRST walk for 1000001 steps (91433 resets) in 478 ms. (2087 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 23:00:24] [INFO ] Invariant cache hit.
[2024-05-31 23:00:24] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 23:00:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:00:24] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-31 23:00:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 23:00:24] [INFO ] [Real]Added 36 Read/Feed constraints in 27 ms returned sat
[2024-05-31 23:00:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:00:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-31 23:00:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:00:24] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-31 23:00:24] [INFO ] [Nat]Added 36 Read/Feed constraints in 119 ms returned sat
[2024-05-31 23:00:24] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-05-31 23:00:24] [INFO ] Computed and/alt/rep : 178/1107/178 causal constraints (skipped 35 transitions) in 12 ms.
[2024-05-31 23:00:25] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:00:25] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:00:25] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:00:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 395 ms
[2024-05-31 23:00:25] [INFO ] Added : 84 causal constraints over 18 iterations in 1158 ms. Result :sat
Minimization took 334 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-31 23:00:26] [INFO ] Invariant cache hit.
[2024-05-31 23:00:26] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 23:00:26] [INFO ] Invariant cache hit.
[2024-05-31 23:00:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 23:00:27] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2024-05-31 23:00:27] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-31 23:00:27] [INFO ] Invariant cache hit.
[2024-05-31 23:00:27] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 275 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/488 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 23:00:44] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:00:44] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 95 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:00:45] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:00:46] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:00:47] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 15/503 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/422 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 503 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 15/15 constraints]
After SMT, in 39157ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40474 ms. Remains : 208/208 places, 214/214 transitions.
Found an invariant !
This invariant on transitions {22=1, 30=1, 51=1, 79=1, 98=1, 125=1, 140=1, 152=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 30=1, 51=1, 79=1, 98=1, 125=1, 140=1, 152=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40000 steps (5736 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3630 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 884878 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :0 out of 1
Probabilistic random walk after 884878 steps, saw 442527 distinct states, run finished after 3002 ms. (steps per millisecond=294 ) properties seen :0
[2024-05-31 23:01:39] [INFO ] Invariant cache hit.
[2024-05-31 23:01:39] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/155 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/203 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/417 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 36/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/422 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/155 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 96 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 106 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 98 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 97 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 48/203 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:01:40] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:01:41] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 36/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/422 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 1951ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
RANDOM walk for 40000 steps (5790 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3689 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 885060 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :0 out of 1
Probabilistic random walk after 885060 steps, saw 442618 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
[2024-05-31 23:01:45] [INFO ] Invariant cache hit.
[2024-05-31 23:01:45] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/155 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/203 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/417 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 36/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/422 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/155 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 96 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 106 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 98 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 97 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 98 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 101 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 48/203 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:01:45] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-31 23:01:46] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 36/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/422 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1781 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 1932ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-31 23:01:46] [INFO ] Invariant cache hit.
[2024-05-31 23:01:47] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-31 23:01:47] [INFO ] Invariant cache hit.
[2024-05-31 23:01:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 23:01:48] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
[2024-05-31 23:01:48] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-31 23:01:48] [INFO ] Invariant cache hit.
[2024-05-31 23:01:48] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 275 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9194 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/488 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-31 23:02:04] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:02:05] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:02:06] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:02:07] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:02:08] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 15/503 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/422 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 503 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 15/15 constraints]
After SMT, in 39278ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39281ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40587 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 182 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 11 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-31 23:02:27] [INFO ] Computed 31 invariants in 14 ms
[2024-05-31 23:02:27] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:02:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 23:02:27] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-31 23:02:27] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 23:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:02:27] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:02:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:02:27] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:02:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
TRAPS : Iteration 1
[2024-05-31 23:02:27] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:02:27] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 362 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-07 in 171318 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 23:02:27] [INFO ] Computed 33 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1465 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10000 steps (936 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:02:27] [INFO ] Invariant cache hit.
[2024-05-31 23:02:28] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 23:02:28] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2024-05-31 23:02:28] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-31 23:02:28] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 23:02:28] [INFO ] [Real]Added 33 Read/Feed constraints in 101 ms returned sat
[2024-05-31 23:02:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 23:02:28] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 23:02:28] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-31 23:02:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 120 ms returned sat
[2024-05-31 23:02:28] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:02:31] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 87 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:02:32] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:02:33] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:02:33] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:02:33] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:02:33] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 2068 ms
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p463) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 231/231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 228
Reduce places removed 3 places and 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 225 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 224 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 place count 224 transition count 223
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 222 transition count 223
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 219 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 217 transition count 220
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 28 place count 217 transition count 213
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 35 place count 210 transition count 213
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 210 transition count 213
Applied a total of 38 rules in 20 ms. Remains 210 /229 variables (removed 19) and now considering 213/231 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 210/229 places, 213/231 transitions.
// Phase 1: matrix 213 rows 210 cols
[2024-05-31 23:02:33] [INFO ] Computed 33 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143845 resets) in 679 ms. (1470 steps per ms)
BEST_FIRST walk for 1000001 steps (91619 resets) in 473 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:02:34] [INFO ] Invariant cache hit.
[2024-05-31 23:02:34] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 23:02:34] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:02:34] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-31 23:02:34] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:02:34] [INFO ] [Real]Added 39 Read/Feed constraints in 58 ms returned sat
[2024-05-31 23:02:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 23:02:34] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 23:02:34] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-31 23:02:34] [INFO ] [Nat]Added 39 Read/Feed constraints in 157 ms returned sat
[2024-05-31 23:02:34] [INFO ] Computed and/alt/rep : 166/1038/166 causal constraints (skipped 46 transitions) in 11 ms.
[2024-05-31 23:02:35] [INFO ] Added : 113 causal constraints over 23 iterations in 712 ms. Result :sat
Minimization took 336 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-31 23:02:39] [INFO ] Invariant cache hit.
[2024-05-31 23:02:40] [INFO ] Implicit Places using invariants in 148 ms returned [134, 207]
[2024-05-31 23:02:40] [INFO ] Actually due to overlaps returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/210 places, 213/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 212
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 208 cols
[2024-05-31 23:02:40] [INFO ] Computed 32 invariants in 10 ms
[2024-05-31 23:02:40] [INFO ] Implicit Places using invariants in 134 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/210 places, 212/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 211
Applied a total of 2 rules in 6 ms. Remains 206 /207 variables (removed 1) and now considering 211/212 (removed 1) transitions.
// Phase 1: matrix 211 rows 206 cols
[2024-05-31 23:02:40] [INFO ] Computed 31 invariants in 9 ms
[2024-05-31 23:02:40] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-31 23:02:40] [INFO ] Invariant cache hit.
[2024-05-31 23:02:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:02:41] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned [146, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1471 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 204/210 places, 211/213 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 204 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 211
Applied a total of 4 rules in 6 ms. Remains 202 /204 variables (removed 2) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 202 cols
[2024-05-31 23:02:41] [INFO ] Computed 29 invariants in 8 ms
[2024-05-31 23:02:41] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-31 23:02:41] [INFO ] Invariant cache hit.
[2024-05-31 23:02:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:02:43] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1484 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 202/210 places, 211/213 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3261 ms. Remains : 202/210 places, 211/213 transitions.
[2024-05-31 23:02:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144059 resets) in 687 ms. (1453 steps per ms)
BEST_FIRST walk for 1000000 steps (91362 resets) in 474 ms. (2105 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:02:44] [INFO ] Invariant cache hit.
[2024-05-31 23:02:44] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 23:02:44] [INFO ] [Real]Absence check using 12 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-31 23:02:44] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-31 23:02:44] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:02:44] [INFO ] [Real]Added 39 Read/Feed constraints in 86 ms returned sat
[2024-05-31 23:02:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:02:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 23:02:44] [INFO ] [Nat]Absence check using 12 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-31 23:02:44] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-31 23:02:44] [INFO ] [Nat]Added 39 Read/Feed constraints in 96 ms returned sat
[2024-05-31 23:02:44] [INFO ] Computed and/alt/rep : 158/1017/158 causal constraints (skipped 52 transitions) in 13 ms.
[2024-05-31 23:02:45] [INFO ] Added : 118 causal constraints over 25 iterations in 1053 ms. Result :sat
Minimization took 483 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 202/202 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-31 23:02:47] [INFO ] Invariant cache hit.
[2024-05-31 23:02:47] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-31 23:02:47] [INFO ] Invariant cache hit.
[2024-05-31 23:02:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:02:49] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2024-05-31 23:02:49] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 23:02:49] [INFO ] Invariant cache hit.
[2024-05-31 23:02:49] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/202 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 5 (OVERLAPS) 211/413 variables, 202/231 constraints. Problems are: Problem set: 19 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 39/270 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/270 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/413 variables, 0/270 constraints. Problems are: Problem set: 19 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 270 constraints, problems are : Problem set: 19 solved, 191 unsolved in 8054 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 202/202 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 2/2 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 15/17 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 10/193 variables, 10/27 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/27 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 6/199 variables, 2/29 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 23:02:59] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/30 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 211/410 variables, 199/229 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 39/268 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 136/404 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 23:03:05] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/405 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 23:03:12] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 1/406 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 23:03:20] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 1/407 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-31 23:03:24] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/413 variables, and 408 constraints, problems are : Problem set: 19 solved, 191 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 199/202 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 136/210 constraints, Known Traps: 5/5 constraints]
After SMT, in 38147ms problems are : Problem set: 19 solved, 191 unsolved
Search for dead transitions found 19 dead transitions in 38152ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/202 places, 192/211 transitions.
Graph (complete) has 966 edges and 202 vertex of which 185 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 185 /202 variables (removed 17) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 185 cols
[2024-05-31 23:03:27] [INFO ] Computed 28 invariants in 10 ms
[2024-05-31 23:03:27] [INFO ] Implicit Places using invariants in 137 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 184/202 places, 192/211 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 184 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 190
Applied a total of 4 rules in 6 ms. Remains 182 /184 variables (removed 2) and now considering 190/192 (removed 2) transitions.
// Phase 1: matrix 190 rows 182 cols
[2024-05-31 23:03:27] [INFO ] Computed 27 invariants in 6 ms
[2024-05-31 23:03:27] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-31 23:03:27] [INFO ] Invariant cache hit.
[2024-05-31 23:03:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 23:03:28] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 182/202 places, 190/211 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 40940 ms. Remains : 182/202 places, 190/211 transitions.
[2024-05-31 23:03:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144188 resets) in 645 ms. (1547 steps per ms)
BEST_FIRST walk for 1000001 steps (91527 resets) in 459 ms. (2173 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:03:29] [INFO ] Invariant cache hit.
[2024-05-31 23:03:29] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:29] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 23:03:29] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-31 23:03:29] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 23:03:29] [INFO ] [Real]Added 35 Read/Feed constraints in 48 ms returned sat
[2024-05-31 23:03:29] [INFO ] Computed and/alt/rep : 151/973/151 causal constraints (skipped 38 transitions) in 13 ms.
[2024-05-31 23:03:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:03:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-31 23:03:29] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:03:30] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-31 23:03:30] [INFO ] [Nat]Added 35 Read/Feed constraints in 106 ms returned sat
[2024-05-31 23:03:30] [INFO ] Computed and/alt/rep : 151/973/151 causal constraints (skipped 38 transitions) in 11 ms.
[2024-05-31 23:03:31] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:03:31] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-31 23:03:31] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:03:31] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:03:31] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:03:32] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-31 23:03:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 378 ms
[2024-05-31 23:03:32] [INFO ] Added : 149 causal constraints over 30 iterations in 1980 ms. Result :sat
Minimization took 330 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 182/182 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-31 23:03:34] [INFO ] Invariant cache hit.
[2024-05-31 23:03:34] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 23:03:34] [INFO ] Invariant cache hit.
[2024-05-31 23:03:34] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 23:03:35] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2024-05-31 23:03:35] [INFO ] Redundant transitions in 2 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-31 23:03:35] [INFO ] Invariant cache hit.
[2024-05-31 23:03:35] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 2/182 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/372 variables, 182/209 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 35/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 244 constraints, problems are : Problem set: 0 solved, 189 unsolved in 6848 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 2/182 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/372 variables, 182/209 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 35/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 189/433 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-31 23:03:48] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:03:48] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-31 23:03:58] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-31 23:03:58] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/372 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-31 23:04:08] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/372 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 438 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 5/5 constraints]
After SMT, in 36932ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 36935ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37961 ms. Remains : 182/182 places, 190/190 transitions.
RANDOM walk for 40000 steps (5727 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3613 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3664 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 503076 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 2
Probabilistic random walk after 503076 steps, saw 251585 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-31 23:04:15] [INFO ] Invariant cache hit.
[2024-05-31 23:04:15] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/177 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:04:15] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 190/367 variables, 177/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 35/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/372 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/372 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 268 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1379 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/177 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:04:16] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:04:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:04:17] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 190/367 variables, 177/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 35/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/372 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/372 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
After SMT, in 1859ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3966 ms.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 182/182 places, 190/190 transitions.
RANDOM walk for 40000 steps (5738 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3669 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3662 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 570641 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 2
Probabilistic random walk after 570641 steps, saw 285377 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2024-05-31 23:04:24] [INFO ] Invariant cache hit.
[2024-05-31 23:04:24] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/177 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:04:24] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 190/367 variables, 177/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 35/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/372 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/372 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 268 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1438 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/177 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:04:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:04:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 190/367 variables, 177/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 35/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/372 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/372 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
After SMT, in 1973ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4550 ms.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 182/182 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-31 23:04:30] [INFO ] Invariant cache hit.
[2024-05-31 23:04:30] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 23:04:30] [INFO ] Invariant cache hit.
[2024-05-31 23:04:31] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 23:04:31] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2024-05-31 23:04:31] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-31 23:04:31] [INFO ] Invariant cache hit.
[2024-05-31 23:04:31] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 2/182 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/372 variables, 182/209 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 35/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 244 constraints, problems are : Problem set: 0 solved, 189 unsolved in 6957 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 2/182 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/372 variables, 182/209 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 35/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 189/433 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-31 23:04:44] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:04:45] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-31 23:04:55] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-31 23:04:55] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/372 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-31 23:05:05] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/372 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 438 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 5/5 constraints]
After SMT, in 37047ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 37049ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38077 ms. Remains : 182/182 places, 190/190 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 182 transition count 173
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 165 transition count 173
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 157 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 157 transition count 165
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 157 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 155 transition count 163
Applied a total of 54 rules in 8 ms. Remains 155 /182 variables (removed 27) and now considering 163/190 (removed 27) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 163 rows 155 cols
[2024-05-31 23:05:08] [INFO ] Computed 27 invariants in 8 ms
[2024-05-31 23:05:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 23:05:08] [INFO ] [Real]Absence check using 4 positive and 23 generalized place invariants in 5 ms returned sat
[2024-05-31 23:05:09] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 23:05:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:05:09] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:05:09] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:05:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 23:05:09] [INFO ] [Nat]Absence check using 4 positive and 23 generalized place invariants in 6 ms returned sat
[2024-05-31 23:05:09] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 23:05:09] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:05:09] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:05:09] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 361 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-08 in 161315 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 23:05:09] [INFO ] Computed 33 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1428 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (874 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:05:09] [INFO ] Invariant cache hit.
[2024-05-31 23:05:09] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 23:05:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 23:05:09] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-31 23:05:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 23:05:09] [INFO ] [Real]Added 33 Read/Feed constraints in 102 ms returned sat
[2024-05-31 23:05:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:05:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 23:05:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 23:05:09] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-31 23:05:09] [INFO ] [Nat]Added 33 Read/Feed constraints in 169 ms returned sat
[2024-05-31 23:05:09] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-31 23:05:09] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 23:05:12] [INFO ] Added : 205 causal constraints over 41 iterations in 2671 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p439) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 1 places and 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 225
Reduce places removed 3 places and 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 225 transition count 223
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 225 transition count 221
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 37 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 41 place count 192 transition count 184
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 48 place count 186 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 185 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 49 place count 185 transition count 182
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 184 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 182 transition count 182
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 182 transition count 174
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 72 place count 173 transition count 174
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 173 transition count 174
Applied a total of 74 rules in 25 ms. Remains 173 /229 variables (removed 56) and now considering 174/230 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 173/229 places, 174/230 transitions.
// Phase 1: matrix 174 rows 173 cols
[2024-05-31 23:05:13] [INFO ] Computed 28 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144544 resets) in 679 ms. (1470 steps per ms)
BEST_FIRST walk for 1000000 steps (91444 resets) in 495 ms. (2016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:05:14] [INFO ] Invariant cache hit.
[2024-05-31 23:05:14] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 23:05:14] [INFO ] [Real]Absence check using 11 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-31 23:05:14] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 23:05:14] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 23:05:14] [INFO ] [Real]Added 32 Read/Feed constraints in 16 ms returned sat
[2024-05-31 23:05:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:05:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 23:05:14] [INFO ] [Nat]Absence check using 11 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-31 23:05:14] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-31 23:05:14] [INFO ] [Nat]Added 32 Read/Feed constraints in 51 ms returned sat
[2024-05-31 23:05:14] [INFO ] Computed and/alt/rep : 136/843/136 causal constraints (skipped 37 transitions) in 11 ms.
[2024-05-31 23:05:15] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:05:15] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:05:15] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:05:15] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:05:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 265 ms
[2024-05-31 23:05:15] [INFO ] Added : 114 causal constraints over 23 iterations in 905 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 173/173 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-31 23:05:17] [INFO ] Invariant cache hit.
[2024-05-31 23:05:17] [INFO ] Implicit Places using invariants in 127 ms returned [127, 134, 170]
[2024-05-31 23:05:17] [INFO ] Actually due to overlaps returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 172/173 places, 174/174 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 172 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 171 transition count 173
Applied a total of 2 rules in 5 ms. Remains 171 /172 variables (removed 1) and now considering 173/174 (removed 1) transitions.
// Phase 1: matrix 173 rows 171 cols
[2024-05-31 23:05:17] [INFO ] Computed 27 invariants in 6 ms
[2024-05-31 23:05:17] [INFO ] Implicit Places using invariants in 118 ms returned [127, 134]
[2024-05-31 23:05:17] [INFO ] Actually due to overlaps returned [127]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 170/173 places, 173/174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 172
Applied a total of 2 rules in 4 ms. Remains 169 /170 variables (removed 1) and now considering 172/173 (removed 1) transitions.
// Phase 1: matrix 172 rows 169 cols
[2024-05-31 23:05:17] [INFO ] Computed 26 invariants in 5 ms
[2024-05-31 23:05:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 23:05:17] [INFO ] Invariant cache hit.
[2024-05-31 23:05:17] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 23:05:18] [INFO ] Implicit Places using invariants and state equation in 890 ms returned [143]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1002 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 168/173 places, 172/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1268 ms. Remains : 168/173 places, 172/174 transitions.
// Phase 1: matrix 172 rows 168 cols
[2024-05-31 23:05:18] [INFO ] Computed 26 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144259 resets) in 681 ms. (1466 steps per ms)
BEST_FIRST walk for 1000000 steps (91451 resets) in 453 ms. (2202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:05:19] [INFO ] Invariant cache hit.
[2024-05-31 23:05:19] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-31 23:05:19] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:05:19] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 23:05:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 23:05:19] [INFO ] [Real]Added 32 Read/Feed constraints in 44 ms returned sat
[2024-05-31 23:05:19] [INFO ] Computed and/alt/rep : 139/880/139 causal constraints (skipped 32 transitions) in 9 ms.
[2024-05-31 23:05:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:05:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-31 23:05:20] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:05:20] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 23:05:20] [INFO ] [Nat]Added 32 Read/Feed constraints in 57 ms returned sat
[2024-05-31 23:05:20] [INFO ] Computed and/alt/rep : 139/880/139 causal constraints (skipped 32 transitions) in 9 ms.
[2024-05-31 23:05:20] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-31 23:05:20] [INFO ] Added : 125 causal constraints over 26 iterations in 867 ms. Result :sat
Minimization took 333 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 168/168 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-31 23:05:26] [INFO ] Invariant cache hit.
[2024-05-31 23:05:26] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 23:05:26] [INFO ] Invariant cache hit.
[2024-05-31 23:05:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 23:05:27] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2024-05-31 23:05:27] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-31 23:05:27] [INFO ] Invariant cache hit.
[2024-05-31 23:05:27] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/168 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/340 variables, 168/194 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 32/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 226 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5796 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/168 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/340 variables, 168/194 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 32/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 171/397 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-31 23:05:37] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:05:37] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:05:40] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:05:40] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:05:40] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:05:40] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-31 23:05:45] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:05:45] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:05:45] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:05:45] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-31 23:05:49] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-31 23:05:54] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:05:55] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:05:55] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 0 ms to minimize.
[2024-05-31 23:05:55] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 0 ms to minimize.
[2024-05-31 23:05:55] [INFO ] Deduced a trap composed of 76 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:05:56] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:05:56] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 7/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 415 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 18/18 constraints]
After SMT, in 35861ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 35865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36978 ms. Remains : 168/168 places, 172/172 transitions.
RANDOM walk for 40000 steps (5840 resets) in 58 ms. (677 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3632 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3707 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 585664 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 2
Probabilistic random walk after 585664 steps, saw 292890 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2024-05-31 23:06:06] [INFO ] Invariant cache hit.
[2024-05-31 23:06:06] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 50/164 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 172/336 variables, 164/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 32/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/340 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 50/164 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 172/336 variables, 164/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 32/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/340 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 231 constraints, problems are : Problem set: 0 solved, 2 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 589ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2538 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 168/168 places, 172/172 transitions.
RANDOM walk for 40000 steps (5836 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3638 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3634 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 632043 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 2
Probabilistic random walk after 632043 steps, saw 316086 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2024-05-31 23:06:12] [INFO ] Invariant cache hit.
[2024-05-31 23:06:12] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:06:12] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 50/164 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:06:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:06:12] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 172/336 variables, 164/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 32/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/340 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 50/164 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 172/336 variables, 164/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 32/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/340 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 231 constraints, problems are : Problem set: 0 solved, 2 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2225 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 168/168 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-31 23:06:15] [INFO ] Invariant cache hit.
[2024-05-31 23:06:15] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-31 23:06:15] [INFO ] Invariant cache hit.
[2024-05-31 23:06:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 23:06:16] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2024-05-31 23:06:16] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-31 23:06:16] [INFO ] Invariant cache hit.
[2024-05-31 23:06:16] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/168 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/340 variables, 168/194 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 32/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 226 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5649 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/168 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/340 variables, 168/194 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 32/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 171/397 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-31 23:06:26] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:06:26] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:06:28] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:06:28] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:06:28] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:06:29] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 0 ms to minimize.
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:06:34] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-31 23:06:38] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-31 23:06:43] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:06:43] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:06:43] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:06:44] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:06:44] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 0 ms to minimize.
[2024-05-31 23:06:44] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:06:44] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 7/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 415 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 18/18 constraints]
After SMT, in 35719ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 35721ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36786 ms. Remains : 168/168 places, 172/172 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 168 transition count 157
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 153 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 146 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 146 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 145 transition count 149
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 145 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 48 place count 144 transition count 148
Applied a total of 48 rules in 10 ms. Remains 144 /168 variables (removed 24) and now considering 148/172 (removed 24) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 148 rows 144 cols
[2024-05-31 23:06:51] [INFO ] Computed 26 invariants in 9 ms
[2024-05-31 23:06:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-31 23:06:51] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:06:52] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 23:06:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:06:52] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:06:52] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:06:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 23:06:52] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:06:52] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 23:06:52] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:06:52] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:06:52] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 299 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-10 in 102963 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 23:06:52] [INFO ] Computed 33 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1455 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (898 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:06:52] [INFO ] Invariant cache hit.
[2024-05-31 23:06:52] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 23:06:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 23:06:52] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-31 23:06:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 23:06:52] [INFO ] [Real]Added 33 Read/Feed constraints in 62 ms returned sat
[2024-05-31 23:06:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:06:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 23:06:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 23:06:52] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-31 23:06:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 101 ms returned sat
[2024-05-31 23:06:52] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:06:52] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:06:52] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:06:53] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:06:54] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:06:54] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:06:54] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:06:54] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1632 ms
[2024-05-31 23:06:54] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-31 23:06:55] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:06:55] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:06:55] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1239 ms
[2024-05-31 23:06:57] [INFO ] Added : 127 causal constraints over 27 iterations in 2717 ms. Result :sat
Minimization took 409 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p448) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 227 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 227 transition count 226
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 225 transition count 226
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 220 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 218 transition count 221
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 218 transition count 213
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 210 transition count 213
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 210 transition count 213
Applied a total of 41 rules in 23 ms. Remains 210 /229 variables (removed 19) and now considering 213/230 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 210/229 places, 213/230 transitions.
// Phase 1: matrix 213 rows 210 cols
[2024-05-31 23:06:57] [INFO ] Computed 33 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143834 resets) in 675 ms. (1479 steps per ms)
BEST_FIRST walk for 1000001 steps (91321 resets) in 488 ms. (2044 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:06:58] [INFO ] Invariant cache hit.
[2024-05-31 23:06:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 23:06:58] [INFO ] [Real]Absence check using 3 positive and 30 generalized place invariants in 11 ms returned sat
[2024-05-31 23:06:58] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-31 23:06:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 23:06:58] [INFO ] [Real]Added 40 Read/Feed constraints in 70 ms returned sat
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:06:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:06:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 23:06:59] [INFO ] [Nat]Absence check using 3 positive and 30 generalized place invariants in 6 ms returned sat
[2024-05-31 23:06:59] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-31 23:06:59] [INFO ] [Nat]Added 40 Read/Feed constraints in 200 ms returned sat
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1325 ms
[2024-05-31 23:07:00] [INFO ] Computed and/alt/rep : 164/1033/164 causal constraints (skipped 48 transitions) in 13 ms.
[2024-05-31 23:07:02] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:07:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-31 23:07:02] [INFO ] Added : 93 causal constraints over 19 iterations in 1532 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-31 23:07:04] [INFO ] Invariant cache hit.
[2024-05-31 23:07:04] [INFO ] Implicit Places using invariants in 150 ms returned [134, 207]
[2024-05-31 23:07:04] [INFO ] Actually due to overlaps returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/210 places, 213/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 212
Applied a total of 2 rules in 7 ms. Remains 208 /209 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 208 cols
[2024-05-31 23:07:04] [INFO ] Computed 32 invariants in 7 ms
[2024-05-31 23:07:04] [INFO ] Implicit Places using invariants in 136 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/210 places, 212/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 211
Applied a total of 2 rules in 9 ms. Remains 206 /207 variables (removed 1) and now considering 211/212 (removed 1) transitions.
// Phase 1: matrix 211 rows 206 cols
[2024-05-31 23:07:04] [INFO ] Computed 31 invariants in 8 ms
[2024-05-31 23:07:04] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-31 23:07:04] [INFO ] Invariant cache hit.
[2024-05-31 23:07:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 23:07:06] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 206/210 places, 211/213 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1913 ms. Remains : 206/210 places, 211/213 transitions.
[2024-05-31 23:07:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144379 resets) in 676 ms. (1477 steps per ms)
BEST_FIRST walk for 1000000 steps (91556 resets) in 476 ms. (2096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:07:07] [INFO ] Invariant cache hit.
[2024-05-31 23:07:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 23:07:07] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2024-05-31 23:07:07] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-31 23:07:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 23:07:07] [INFO ] [Real]Added 40 Read/Feed constraints in 73 ms returned sat
[2024-05-31 23:07:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:07:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 23:07:07] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 16 ms returned sat
[2024-05-31 23:07:07] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-31 23:07:08] [INFO ] [Nat]Added 40 Read/Feed constraints in 189 ms returned sat
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:07:09] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:07:09] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:07:09] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:07:09] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:07:09] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:07:09] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1308 ms
[2024-05-31 23:07:09] [INFO ] Computed and/alt/rep : 167/1072/167 causal constraints (skipped 43 transitions) in 13 ms.
[2024-05-31 23:07:11] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:07:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:07:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1156 ms
[2024-05-31 23:07:13] [INFO ] Added : 151 causal constraints over 32 iterations in 3681 ms. Result :sat
Minimization took 400 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-31 23:07:15] [INFO ] Invariant cache hit.
[2024-05-31 23:07:15] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-31 23:07:15] [INFO ] Invariant cache hit.
[2024-05-31 23:07:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 23:07:16] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2024-05-31 23:07:16] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 23:07:16] [INFO ] Invariant cache hit.
[2024-05-31 23:07:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 1/205 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD138 is UNSAT
At refinement iteration 8 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 1 solved, 209 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 40/277 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 11 (OVERLAPS) 0/417 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 277 constraints, problems are : Problem set: 1 solved, 209 unsolved in 10810 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/20 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 1/205 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 9/30 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 40/277 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 209/486 constraints. Problems are: Problem set: 1 solved, 209 unsolved
[2024-05-31 23:07:36] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:07:37] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:07:37] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:07:38] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:07:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:07:40] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:07:40] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 15/501 constraints. Problems are: Problem set: 1 solved, 209 unsolved
[2024-05-31 23:07:45] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:07:48] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 2/503 constraints. Problems are: Problem set: 1 solved, 209 unsolved
[2024-05-31 23:07:55] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:07:55] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 2/505 constraints. Problems are: Problem set: 1 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 505 constraints, problems are : Problem set: 1 solved, 209 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 209/210 constraints, Known Traps: 19/19 constraints]
After SMT, in 40898ms problems are : Problem set: 1 solved, 209 unsolved
Search for dead transitions found 1 dead transitions in 40901ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/206 places, 210/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-31 23:07:57] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 42544 ms. Remains : 206/206 places, 210/211 transitions.
// Phase 1: matrix 210 rows 206 cols
[2024-05-31 23:07:57] [INFO ] Computed 32 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144336 resets) in 687 ms. (1453 steps per ms)
BEST_FIRST walk for 1000001 steps (91587 resets) in 482 ms. (2070 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:07:59] [INFO ] Invariant cache hit.
[2024-05-31 23:07:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 23:07:59] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-31 23:07:59] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-31 23:07:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:07:59] [INFO ] [Real]Added 39 Read/Feed constraints in 112 ms returned sat
[2024-05-31 23:07:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:07:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 23:07:59] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 23:07:59] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-31 23:07:59] [INFO ] [Nat]Added 39 Read/Feed constraints in 169 ms returned sat
[2024-05-31 23:07:59] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-31 23:07:59] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-31 23:07:59] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:08:02] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:08:02] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2379 ms
[2024-05-31 23:08:02] [INFO ] Computed and/alt/rep : 166/1058/166 causal constraints (skipped 43 transitions) in 14 ms.
[2024-05-31 23:08:02] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:08:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-31 23:08:02] [INFO ] Added : 89 causal constraints over 18 iterations in 902 ms. Result :sat
Minimization took 340 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-31 23:08:05] [INFO ] Invariant cache hit.
[2024-05-31 23:08:05] [INFO ] Implicit Places using invariants in 130 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/206 places, 210/210 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 204 transition count 209
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 204 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 203 transition count 208
Applied a total of 4 rules in 10 ms. Remains 203 /205 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 203 cols
[2024-05-31 23:08:05] [INFO ] Computed 31 invariants in 11 ms
[2024-05-31 23:08:05] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-31 23:08:05] [INFO ] Invariant cache hit.
[2024-05-31 23:08:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 23:08:06] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 1627 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 203/206 places, 208/210 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1772 ms. Remains : 203/206 places, 208/210 transitions.
[2024-05-31 23:08:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143953 resets) in 664 ms. (1503 steps per ms)
BEST_FIRST walk for 1000001 steps (91641 resets) in 476 ms. (2096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:08:08] [INFO ] Invariant cache hit.
[2024-05-31 23:08:08] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 23:08:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 23:08:08] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 23:08:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 23:08:08] [INFO ] [Real]Added 41 Read/Feed constraints in 85 ms returned sat
[2024-05-31 23:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:08:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-31 23:08:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:08:08] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-31 23:08:08] [INFO ] [Nat]Added 41 Read/Feed constraints in 130 ms returned sat
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:08:11] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 3177 ms
[2024-05-31 23:08:11] [INFO ] Computed and/alt/rep : 163/1045/163 causal constraints (skipped 44 transitions) in 12 ms.
[2024-05-31 23:08:12] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:08:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-31 23:08:12] [INFO ] Added : 112 causal constraints over 23 iterations in 1120 ms. Result :sat
Minimization took 421 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 203/203 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-31 23:08:18] [INFO ] Invariant cache hit.
[2024-05-31 23:08:18] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 23:08:18] [INFO ] Invariant cache hit.
[2024-05-31 23:08:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 23:08:20] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
[2024-05-31 23:08:20] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-31 23:08:20] [INFO ] Invariant cache hit.
[2024-05-31 23:08:20] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/203 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 208/411 variables, 203/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 41/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 275 constraints, problems are : Problem set: 0 solved, 207 unsolved in 11819 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/203 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 208/411 variables, 203/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 41/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 207/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-31 23:08:40] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:08:42] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:08:42] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-31 23:08:46] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:08:46] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:08:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:08:47] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:08:47] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:08:47] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:08:47] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:08:47] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:08:47] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:08:48] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:08:48] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:08:48] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:08:48] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:08:48] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:08:48] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:08:49] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:08:49] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:08:49] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:08:49] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:08:49] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-31 23:09:01] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 506 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 24/24 constraints]
After SMT, in 41914ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 41919ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43501 ms. Remains : 203/203 places, 208/208 transitions.
RANDOM walk for 40000 steps (5785 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3648 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3710 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 564388 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 2
Probabilistic random walk after 564388 steps, saw 282255 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2024-05-31 23:09:05] [INFO ] Invariant cache hit.
[2024-05-31 23:09:05] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:05] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:05] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/196 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/198 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 208/406 variables, 198/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 41/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:05] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 5/411 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/196 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 13/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/198 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 208/406 variables, 198/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/406 variables, 41/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/406 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:10] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:09:10] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/406 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/406 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 5/411 variables, 5/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/411 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/411 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/411 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4382 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 58/58 constraints]
After SMT, in 4959ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2689 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 203/203 places, 208/208 transitions.
RANDOM walk for 40000 steps (5741 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3642 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3661 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 588064 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 2
Probabilistic random walk after 588064 steps, saw 294089 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2024-05-31 23:09:16] [INFO ] Invariant cache hit.
[2024-05-31 23:09:16] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:16] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:16] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/196 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/198 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 208/406 variables, 198/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 41/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:16] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 5/411 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/196 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:16] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 13/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/198 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 208/406 variables, 198/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/406 variables, 41/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/406 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/406 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/406 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 5/411 variables, 5/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/411 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/411 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/411 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4303 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 58/58 constraints]
After SMT, in 4891ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5177 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 203/203 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-31 23:09:26] [INFO ] Invariant cache hit.
[2024-05-31 23:09:26] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 23:09:26] [INFO ] Invariant cache hit.
[2024-05-31 23:09:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 23:09:27] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
[2024-05-31 23:09:27] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-31 23:09:27] [INFO ] Invariant cache hit.
[2024-05-31 23:09:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/203 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 208/411 variables, 203/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 41/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 275 constraints, problems are : Problem set: 0 solved, 207 unsolved in 11669 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/203 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 208/411 variables, 203/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 41/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 207/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-31 23:09:47] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:09:49] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:09:50] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-31 23:09:54] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:09:54] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:09:54] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:09:54] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:09:54] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:56] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:09:56] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:09:56] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:09:56] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:09:56] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:09:56] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:09:56] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-31 23:10:09] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 506 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 24/24 constraints]
After SMT, in 41762ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 41767ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43303 ms. Remains : 203/203 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 203 transition count 191
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 186 transition count 191
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 177 transition count 182
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 177 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 176 transition count 181
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 176 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 174 transition count 179
Applied a total of 58 rules in 17 ms. Remains 174 /203 variables (removed 29) and now considering 179/208 (removed 29) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 179 rows 174 cols
[2024-05-31 23:10:09] [INFO ] Computed 31 invariants in 13 ms
[2024-05-31 23:10:09] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-31 23:10:09] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 23:10:09] [INFO ] After 79ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 23:10:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:10:09] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:10:09] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:10:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 23:10:09] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:10:09] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 23:10:09] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:10:09] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:10:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-31 23:10:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
TRAPS : Iteration 1
[2024-05-31 23:10:10] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:10:10] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 477 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 197846 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 23:10:10] [INFO ] Computed 33 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1456 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (914 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:10:10] [INFO ] Invariant cache hit.
[2024-05-31 23:10:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 23:10:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-31 23:10:10] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-31 23:10:10] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 23:10:10] [INFO ] [Real]Added 33 Read/Feed constraints in 68 ms returned sat
[2024-05-31 23:10:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:10:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 23:10:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-05-31 23:10:10] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-31 23:10:10] [INFO ] [Nat]Added 33 Read/Feed constraints in 78 ms returned sat
[2024-05-31 23:10:10] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:10:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-31 23:10:10] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-31 23:10:11] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:10:11] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:10:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2024-05-31 23:10:11] [INFO ] Added : 98 causal constraints over 21 iterations in 814 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p247) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 231/231 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 228 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 227 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 227 transition count 226
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 225 transition count 226
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 220 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 218 transition count 221
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 29 place count 218 transition count 213
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 37 place count 210 transition count 213
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 210 transition count 213
Applied a total of 41 rules in 15 ms. Remains 210 /229 variables (removed 19) and now considering 213/231 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 210/229 places, 213/231 transitions.
// Phase 1: matrix 213 rows 210 cols
[2024-05-31 23:10:11] [INFO ] Computed 33 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144562 resets) in 681 ms. (1466 steps per ms)
BEST_FIRST walk for 1000000 steps (91646 resets) in 475 ms. (2100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:10:13] [INFO ] Invariant cache hit.
[2024-05-31 23:10:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 23:10:13] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 23:10:13] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-31 23:10:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:10:13] [INFO ] [Real]Added 39 Read/Feed constraints in 57 ms returned sat
[2024-05-31 23:10:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:10:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 23:10:13] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-31 23:10:13] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-31 23:10:13] [INFO ] [Nat]Added 39 Read/Feed constraints in 147 ms returned sat
[2024-05-31 23:10:13] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-31 23:10:13] [INFO ] Computed and/alt/rep : 165/1038/165 causal constraints (skipped 47 transitions) in 13 ms.
[2024-05-31 23:10:14] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-31 23:10:14] [INFO ] Added : 86 causal constraints over 18 iterations in 860 ms. Result :sat
Minimization took 279 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-31 23:10:15] [INFO ] Invariant cache hit.
[2024-05-31 23:10:15] [INFO ] Implicit Places using invariants in 148 ms returned [134, 207]
[2024-05-31 23:10:15] [INFO ] Actually due to overlaps returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/210 places, 213/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 212
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 208 cols
[2024-05-31 23:10:15] [INFO ] Computed 32 invariants in 9 ms
[2024-05-31 23:10:15] [INFO ] Implicit Places using invariants in 141 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/210 places, 212/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 211
Applied a total of 2 rules in 6 ms. Remains 206 /207 variables (removed 1) and now considering 211/212 (removed 1) transitions.
// Phase 1: matrix 211 rows 206 cols
[2024-05-31 23:10:15] [INFO ] Computed 31 invariants in 11 ms
[2024-05-31 23:10:15] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-31 23:10:15] [INFO ] Invariant cache hit.
[2024-05-31 23:10:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:10:16] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 206/210 places, 211/213 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1669 ms. Remains : 206/210 places, 211/213 transitions.
[2024-05-31 23:10:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144416 resets) in 683 ms. (1461 steps per ms)
BEST_FIRST walk for 1000000 steps (91589 resets) in 473 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:10:18] [INFO ] Invariant cache hit.
[2024-05-31 23:10:18] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 23:10:18] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:10:18] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-31 23:10:18] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:10:18] [INFO ] [Real]Added 39 Read/Feed constraints in 58 ms returned sat
[2024-05-31 23:10:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:10:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-31 23:10:18] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 23:10:18] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-31 23:10:18] [INFO ] [Nat]Added 39 Read/Feed constraints in 62 ms returned sat
[2024-05-31 23:10:18] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-31 23:10:18] [INFO ] Computed and/alt/rep : 168/1077/168 causal constraints (skipped 42 transitions) in 15 ms.
[2024-05-31 23:10:18] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:10:18] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:10:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-05-31 23:10:18] [INFO ] Added : 66 causal constraints over 14 iterations in 528 ms. Result :sat
Minimization took 205 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-31 23:10:19] [INFO ] Invariant cache hit.
[2024-05-31 23:10:19] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 23:10:19] [INFO ] Invariant cache hit.
[2024-05-31 23:10:19] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:10:20] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2024-05-31 23:10:20] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 23:10:20] [INFO ] Invariant cache hit.
[2024-05-31 23:10:20] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 39/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 276 constraints, problems are : Problem set: 0 solved, 210 unsolved in 11945 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 39/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 210/486 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-31 23:10:42] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:10:44] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:10:45] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:10:45] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:10:45] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:10:45] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 5/511 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:10:58] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:10:58] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:10:58] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/417 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 514 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 28/28 constraints]
After SMT, in 42041ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 42045ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43397 ms. Remains : 206/206 places, 211/211 transitions.
RANDOM walk for 40000 steps (5795 resets) in 296 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3619 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3672 resets) in 371 ms. (107 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 457518 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 2
Probabilistic random walk after 457518 steps, saw 228808 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2024-05-31 23:11:05] [INFO ] Invariant cache hit.
[2024-05-31 23:11:05] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 211/412 variables, 201/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 39/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/417 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 54/201 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 211/412 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 39/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/417 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/417 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints]
After SMT, in 1688ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 638 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 206/206 places, 211/211 transitions.
RANDOM walk for 40000 steps (5820 resets) in 401 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3666 resets) in 345 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3692 resets) in 333 ms. (119 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 494828 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 2
Probabilistic random walk after 494828 steps, saw 247465 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2024-05-31 23:11:11] [INFO ] Invariant cache hit.
[2024-05-31 23:11:11] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 211/412 variables, 201/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 39/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/417 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 54/201 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 0 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:11:13] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 211/412 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 39/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:11:13] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:11:13] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/417 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/417 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints]
After SMT, in 1786ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 388 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-31 23:11:13] [INFO ] Invariant cache hit.
[2024-05-31 23:11:13] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-31 23:11:13] [INFO ] Invariant cache hit.
[2024-05-31 23:11:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 23:11:15] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2024-05-31 23:11:15] [INFO ] Redundant transitions in 2 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 23:11:15] [INFO ] Invariant cache hit.
[2024-05-31 23:11:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 39/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 276 constraints, problems are : Problem set: 0 solved, 210 unsolved in 11367 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 39/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 210/486 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:11:32] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:11:34] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:11:34] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:11:34] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:11:34] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:11:34] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:11:36] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:11:38] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:11:38] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:11:38] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:11:38] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:11:39] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 5/511 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:11:51] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:11:51] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:11:52] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/417 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 514 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 28/28 constraints]
After SMT, in 41457ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 41460ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42819 ms. Remains : 206/206 places, 211/211 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 182
Applied a total of 58 rules in 10 ms. Remains 177 /206 variables (removed 29) and now considering 182/211 (removed 29) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 182 rows 177 cols
[2024-05-31 23:11:56] [INFO ] Computed 31 invariants in 19 ms
[2024-05-31 23:11:56] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 23:11:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:11:56] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 23:11:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:11:56] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:11:56] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-05-31 23:11:56] [INFO ] After 108ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:11:56] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:11:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 23:11:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-31 23:11:57] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 23:11:57] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:11:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:11:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 1
[2024-05-31 23:11:57] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:11:57] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 550 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 107143 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 232 rows 229 cols
[2024-05-31 23:11:57] [INFO ] Computed 33 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (1454 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10000 steps (893 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 23:11:57] [INFO ] Invariant cache hit.
[2024-05-31 23:11:57] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 23:11:57] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 23:11:57] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-31 23:11:57] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 23:11:57] [INFO ] [Real]Added 33 Read/Feed constraints in 172 ms returned sat
[2024-05-31 23:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 23:11:57] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-31 23:11:57] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-31 23:11:57] [INFO ] [Nat]Added 33 Read/Feed constraints in 170 ms returned sat
[2024-05-31 23:11:57] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:11:58] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:11:59] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:11:59] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:11:59] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:11:59] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:11:59] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1428 ms
[2024-05-31 23:11:59] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-31 23:12:00] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 1 ms to minimize.
[2024-05-31 23:12:00] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:12:00] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:00] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:12:01] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:12:01] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:12:01] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:12:01] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:12:01] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:12:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1168 ms
[2024-05-31 23:12:01] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:12:02] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:02] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:02] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:12:02] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:12:02] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:12:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 230
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 227 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 227 transition count 228
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 225 transition count 228
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 220 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 218 transition count 223
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 218 transition count 216
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 36 place count 211 transition count 216
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 211 transition count 216
Applied a total of 40 rules in 15 ms. Remains 211 /229 variables (removed 18) and now considering 216/232 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 211/229 places, 216/232 transitions.
// Phase 1: matrix 216 rows 211 cols
[2024-05-31 23:12:02] [INFO ] Computed 33 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (144045 resets) in 688 ms. (1451 steps per ms)
BEST_FIRST walk for 1000000 steps (91580 resets) in 474 ms. (2105 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-31 23:12:03] [INFO ] Invariant cache hit.
[2024-05-31 23:12:03] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 23:12:03] [INFO ] [Real]Absence check using 13 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-31 23:12:03] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-31 23:12:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 23:12:04] [INFO ] [Real]Added 40 Read/Feed constraints in 118 ms returned sat
[2024-05-31 23:12:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:12:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-31 23:12:04] [INFO ] [Nat]Absence check using 13 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-31 23:12:04] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-31 23:12:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 129 ms returned sat
[2024-05-31 23:12:04] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-05-31 23:12:04] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:12:04] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:12:04] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:04] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:12:05] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:12:06] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-31 23:12:07] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:07] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:07] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:12:07] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:12:07] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3103 ms
[2024-05-31 23:12:07] [INFO ] Computed and/alt/rep : 170/1061/170 causal constraints (skipped 45 transitions) in 15 ms.
[2024-05-31 23:12:08] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:12:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-31 23:12:08] [INFO ] Added : 114 causal constraints over 24 iterations in 1168 ms. Result :sat
Minimization took 453 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 23:12:10] [INFO ] Invariant cache hit.
[2024-05-31 23:12:10] [INFO ] Implicit Places using invariants in 151 ms returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 210/211 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 215
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-31 23:12:10] [INFO ] Computed 32 invariants in 9 ms
[2024-05-31 23:12:10] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-31 23:12:10] [INFO ] Invariant cache hit.
[2024-05-31 23:12:10] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 23:12:11] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/211 places, 215/216 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1407 ms. Remains : 209/211 places, 215/216 transitions.
[2024-05-31 23:12:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (144413 resets) in 667 ms. (1497 steps per ms)
BEST_FIRST walk for 1000000 steps (91121 resets) in 472 ms. (2114 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-31 23:12:12] [INFO ] Invariant cache hit.
[2024-05-31 23:12:12] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 23:12:12] [INFO ] [Real]Absence check using 12 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-31 23:12:13] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-31 23:12:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 23:12:13] [INFO ] [Real]Added 40 Read/Feed constraints in 167 ms returned sat
[2024-05-31 23:12:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:12:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 23:12:13] [INFO ] [Nat]Absence check using 12 positive and 20 generalized place invariants in 2 ms returned sat
[2024-05-31 23:12:13] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-31 23:12:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 179 ms returned sat
[2024-05-31 23:12:13] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:12:13] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:13] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:13] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:12:15] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:12:15] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:12:15] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:12:15] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:15] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:12:15] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:12:15] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:12:17] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:12:17] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:12:17] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 3622 ms
[2024-05-31 23:12:17] [INFO ] Computed and/alt/rep : 174/1101/174 causal constraints (skipped 40 transitions) in 18 ms.
[2024-05-31 23:12:18] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:12:18] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:12:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2024-05-31 23:12:18] [INFO ] Added : 108 causal constraints over 22 iterations in 1082 ms. Result :sat
Minimization took 454 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 23:12:19] [INFO ] Invariant cache hit.
[2024-05-31 23:12:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 23:12:19] [INFO ] Invariant cache hit.
[2024-05-31 23:12:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 23:12:20] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
[2024-05-31 23:12:20] [INFO ] Redundant transitions in 2 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-31 23:12:20] [INFO ] Invariant cache hit.
[2024-05-31 23:12:20] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/424 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 281 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12341 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/424 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 214/495 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 23:12:42] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-31 23:12:43] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-31 23:12:43] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 23:12:48] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:12:48] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:12:49] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:12:49] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-31 23:12:49] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:12:49] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:12:49] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:51] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:12:51] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-31 23:12:51] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 23:13:03] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
SMT process timed out in 42439ms, After SMT, problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 42442ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43692 ms. Remains : 209/209 places, 215/215 transitions.
RANDOM walk for 40000 steps (5787 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3599 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3711 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 528833 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 2
Probabilistic random walk after 528833 steps, saw 264473 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-31 23:13:06] [INFO ] Invariant cache hit.
[2024-05-31 23:13:06] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 104/149 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:13:06] [INFO ] Deduced a trap composed of 97 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:13:06] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:13:06] [INFO ] Deduced a trap composed of 97 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:13:06] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 55/204 variables, 19/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 215/419 variables, 204/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 40/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/424 variables, 5/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 2/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/424 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 285 constraints, problems are : Problem set: 1 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/149 variables, 10/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 23:13:06] [INFO ] Deduced a trap composed of 95 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:13:06] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/204 variables, 19/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 23:13:07] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:13:07] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-31 23:13:07] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 3/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 215/419 variables, 204/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 40/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 1/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/424 variables, 5/289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 2/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/424 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 291 constraints, problems are : Problem set: 1 solved, 1 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 1354ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 283 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
RANDOM walk for 40000 steps (5714 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3624 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 881328 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 1
Probabilistic random walk after 881328 steps, saw 440750 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
[2024-05-31 23:13:11] [INFO ] Invariant cache hit.
[2024-05-31 23:13:11] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/149 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/204 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/419 variables, 204/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 40/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/424 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/149 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 95 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/204 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/419 variables, 204/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-31 23:13:11] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:13:12] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/424 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/424 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 966 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1122ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 328 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 23:13:12] [INFO ] Invariant cache hit.
[2024-05-31 23:13:12] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 23:13:12] [INFO ] Invariant cache hit.
[2024-05-31 23:13:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 23:13:13] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2024-05-31 23:13:13] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-31 23:13:13] [INFO ] Invariant cache hit.
[2024-05-31 23:13:13] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/424 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 281 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12078 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/424 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 214/495 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 23:13:35] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:13:35] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:13:35] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 23:13:40] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:13:41] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:13:41] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:13:41] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:13:42] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:13:42] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:13:42] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:13:42] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:13:42] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:13:42] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:13:43] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 23:13:55] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 519 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 24/24 constraints]
After SMT, in 42169ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 42172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43378 ms. Remains : 209/209 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 197
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 197
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 189
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 10 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-31 23:13:55] [INFO ] Computed 32 invariants in 12 ms
[2024-05-31 23:13:55] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:13:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-31 23:13:55] [INFO ] [Nat]Absence check using 12 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-31 23:13:56] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 23:13:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:13:56] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:13:56] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:13:56] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 225 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[5]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-15 in 118867 ms.
[2024-05-31 23:13:56] [INFO ] Flatten gal took : 62 ms
[2024-05-31 23:13:56] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 23:13:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 232 transitions and 1168 arcs took 7 ms.
Total runtime 2970619 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-00
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-01
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-02
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-04
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-05
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-06
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-07
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-08
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-10
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-11
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-12
Could not compute solution for formula : DoubleExponent-PT-010-UpperBounds-15

BK_STOP 1717197236609

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name DoubleExponent-PT-010-UpperBounds-00
ub formula formula --maxsum=/tmp/9583/ub_0_
ub formula name DoubleExponent-PT-010-UpperBounds-01
ub formula formula --maxsum=/tmp/9583/ub_1_
ub formula name DoubleExponent-PT-010-UpperBounds-02
ub formula formula --maxsum=/tmp/9583/ub_2_
ub formula name DoubleExponent-PT-010-UpperBounds-04
ub formula formula --maxsum=/tmp/9583/ub_3_
ub formula name DoubleExponent-PT-010-UpperBounds-05
ub formula formula --maxsum=/tmp/9583/ub_4_
ub formula name DoubleExponent-PT-010-UpperBounds-06
ub formula formula --maxsum=/tmp/9583/ub_5_
ub formula name DoubleExponent-PT-010-UpperBounds-07
ub formula formula --maxsum=/tmp/9583/ub_6_
ub formula name DoubleExponent-PT-010-UpperBounds-08
ub formula formula --maxsum=/tmp/9583/ub_7_
ub formula name DoubleExponent-PT-010-UpperBounds-10
ub formula formula --maxsum=/tmp/9583/ub_8_
ub formula name DoubleExponent-PT-010-UpperBounds-11
ub formula formula --maxsum=/tmp/9583/ub_9_
ub formula name DoubleExponent-PT-010-UpperBounds-12
ub formula formula --maxsum=/tmp/9583/ub_10_
ub formula name DoubleExponent-PT-010-UpperBounds-15
ub formula formula --maxsum=/tmp/9583/ub_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc