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.r480-tall-171624189900741.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 DES-PT-50b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900741
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 127K 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 DES-PT-50b-UpperBounds-00
FORMULA_NAME DES-PT-50b-UpperBounds-01
FORMULA_NAME DES-PT-50b-UpperBounds-02
FORMULA_NAME DES-PT-50b-UpperBounds-03
FORMULA_NAME DES-PT-50b-UpperBounds-04
FORMULA_NAME DES-PT-50b-UpperBounds-05
FORMULA_NAME DES-PT-50b-UpperBounds-06
FORMULA_NAME DES-PT-50b-UpperBounds-07
FORMULA_NAME DES-PT-50b-UpperBounds-08
FORMULA_NAME DES-PT-50b-UpperBounds-09
FORMULA_NAME DES-PT-50b-UpperBounds-10
FORMULA_NAME DES-PT-50b-UpperBounds-11
FORMULA_NAME DES-PT-50b-UpperBounds-12
FORMULA_NAME DES-PT-50b-UpperBounds-13
FORMULA_NAME DES-PT-50b-UpperBounds-14
FORMULA_NAME DES-PT-50b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717198064756

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:27:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 23:27:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:27:46] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-31 23:27:46] [INFO ] Transformed 479 places.
[2024-05-31 23:27:46] [INFO ] Transformed 430 transitions.
[2024-05-31 23:27:46] [INFO ] Found NUPN structural information;
[2024-05-31 23:27:46] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 430 rows 479 cols
[2024-05-31 23:27:46] [INFO ] Computed 65 invariants in 52 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (82 resets) in 70 ms. (140 steps per ms)
FORMULA DES-PT-50b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (52 resets) in 77 ms. (641 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-31 23:27:46] [INFO ] Invariant cache hit.
[2024-05-31 23:27:46] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2024-05-31 23:27:46] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-31 23:27:47] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-05-31 23:27:47] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 51 ms to minimize.
[2024-05-31 23:27:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:27:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 35 ms returned sat
[2024-05-31 23:27:47] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 24 ms returned sat
[2024-05-31 23:27:48] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-31 23:27:48] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 4 ms to minimize.
[2024-05-31 23:27:48] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 5 ms to minimize.
[2024-05-31 23:27:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2024-05-31 23:27:48] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 33 ms.
[2024-05-31 23:27:50] [INFO ] Added : 267 causal constraints over 54 iterations in 2102 ms. Result :sat
Minimization took 464 ms.
[2024-05-31 23:27:51] [INFO ] [Real]Absence check using 40 positive place invariants in 16 ms returned sat
[2024-05-31 23:27:51] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-31 23:27:51] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-05-31 23:27:51] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-05-31 23:27:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:27:51] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-31 23:27:51] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-31 23:27:52] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2024-05-31 23:27:52] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-05-31 23:27:52] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-05-31 23:27:52] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-31 23:27:52] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-31 23:27:52] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-31 23:27:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 685 ms
[2024-05-31 23:27:52] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 29 ms.
[2024-05-31 23:27:56] [INFO ] Added : 375 causal constraints over 75 iterations in 3860 ms. Result :unknown
[2024-05-31 23:27:56] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2024-05-31 23:27:56] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-31 23:27:56] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-05-31 23:27:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:27:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2024-05-31 23:27:57] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-31 23:27:57] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-31 23:27:57] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-31 23:27:57] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2024-05-31 23:27:57] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-31 23:27:57] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 3 ms to minimize.
[2024-05-31 23:27:58] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2024-05-31 23:27:58] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:27:58] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2024-05-31 23:27:58] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-05-31 23:27:58] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-05-31 23:27:58] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:27:58] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:27:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1603 ms
[2024-05-31 23:27:58] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 36 ms.
[2024-05-31 23:28:00] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 3 ms to minimize.
[2024-05-31 23:28:00] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-31 23:28:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2024-05-31 23:28:01] [INFO ] Added : 236 causal constraints over 48 iterations in 2175 ms. Result :sat
Minimization took 418 ms.
[2024-05-31 23:28:01] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2024-05-31 23:28:01] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 28 ms returned sat
[2024-05-31 23:28:01] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-05-31 23:28:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:28:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2024-05-31 23:28:02] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-31 23:28:02] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2024-05-31 23:28:02] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 3 ms to minimize.
[2024-05-31 23:28:02] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-05-31 23:28:02] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-05-31 23:28:02] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-31 23:28:02] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 3 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:28:04] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:28:04] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1819 ms
[2024-05-31 23:28:04] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 28 ms.
[2024-05-31 23:28:06] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-05-31 23:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2024-05-31 23:28:06] [INFO ] Added : 317 causal constraints over 64 iterations in 2482 ms. Result :sat
Minimization took 381 ms.
[2024-05-31 23:28:07] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2024-05-31 23:28:07] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 23:28:07] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-05-31 23:28:07] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-05-31 23:28:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:28:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2024-05-31 23:28:07] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 23:28:07] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-05-31 23:28:07] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-31 23:28:08] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-05-31 23:28:08] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-05-31 23:28:08] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 3 ms to minimize.
[2024-05-31 23:28:08] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-31 23:28:08] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 3 ms to minimize.
[2024-05-31 23:28:08] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-31 23:28:08] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 3 ms to minimize.
[2024-05-31 23:28:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1081 ms
[2024-05-31 23:28:08] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-31 23:28:10] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:28:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2024-05-31 23:28:10] [INFO ] Added : 245 causal constraints over 49 iterations in 1933 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 468 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 468 transition count 402
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 447 transition count 402
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 447 transition count 393
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 438 transition count 393
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 419 transition count 374
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 419 transition count 374
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 419 transition count 373
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 103 place count 418 transition count 373
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 403 transition count 358
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 403 transition count 358
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 2 with 15 rules applied. Total rules applied 148 place count 403 transition count 343
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 401 transition count 342
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 401 transition count 339
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 398 transition count 339
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 321 transition count 262
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
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 315 place count 319 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 319 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 318 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 317 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 316 transition count 262
Applied a total of 320 rules in 296 ms. Remains 316 /479 variables (removed 163) and now considering 262/430 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 316/479 places, 262/430 transitions.
// Phase 1: matrix 262 rows 316 cols
[2024-05-31 23:28:15] [INFO ] Computed 60 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (47697 resets) in 3094 ms. (323 steps per ms)
BEST_FIRST walk for 5000005 steps (45685 resets) in 5375 ms. (930 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-31 23:28:23] [INFO ] Invariant cache hit.
[2024-05-31 23:28:23] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:28:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-31 23:28:23] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-31 23:28:23] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:28:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:28:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:28:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:28:24] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-31 23:28:24] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2024-05-31 23:28:24] [INFO ] Added : 118 causal constraints over 24 iterations in 505 ms. Result :sat
Minimization took 135 ms.
[2024-05-31 23:28:24] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:28:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:28:24] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-31 23:28:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:28:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:28:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:28:25] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-31 23:28:25] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 19 ms.
[2024-05-31 23:28:25] [INFO ] Added : 126 causal constraints over 26 iterations in 479 ms. Result :sat
Minimization took 112 ms.
[2024-05-31 23:28:25] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:28:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-31 23:28:25] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-31 23:28:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:28:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:28:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:28:26] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-31 23:28:26] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2024-05-31 23:28:26] [INFO ] Added : 78 causal constraints over 16 iterations in 360 ms. Result :sat
Minimization took 103 ms.
[2024-05-31 23:28:26] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:28:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:28:26] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-31 23:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:28:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:28:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:28:26] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-31 23:28:26] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2024-05-31 23:28:27] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-05-31 23:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-31 23:28:27] [INFO ] Added : 195 causal constraints over 39 iterations in 831 ms. Result :sat
Minimization took 120 ms.
[2024-05-31 23:28:27] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:28:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:28:28] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-31 23:28:28] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-31 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:28:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:28:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:28:28] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-31 23:28:28] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 26 ms.
[2024-05-31 23:28:28] [INFO ] Added : 94 causal constraints over 19 iterations in 395 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 17 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 14 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-31 23:28:30] [INFO ] Invariant cache hit.
[2024-05-31 23:28:31] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-31 23:28:31] [INFO ] Invariant cache hit.
[2024-05-31 23:28:31] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2024-05-31 23:28:31] [INFO ] Redundant transitions in 11 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-31 23:28:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/315 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/577 variables, 315/375 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-31 23:28:37] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-31 23:28:37] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:28:38] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:28:38] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-31 23:28:41] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 1/578 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/578 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 381 constraints, problems are : Problem set: 0 solved, 259 unsolved in 20969 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 262/577 variables, 315/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 259/639 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 639 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/316 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
After SMT, in 51241ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 51254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52042 ms. Remains : 316/316 places, 262/262 transitions.
RANDOM walk for 40000 steps (1885 resets) in 1082 ms. (36 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (356 resets) in 241 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (384 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (354 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (374 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (395 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (379 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (370 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (362 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (382 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (351 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 825363 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 10
Probabilistic random walk after 825363 steps, saw 116508 distinct states, run finished after 3004 ms. (steps per millisecond=274 ) properties seen :0
[2024-05-31 23:29:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 181/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/223 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 210/465 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 64/529 variables, 12/322 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 2/531 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 47/578 variables, 47/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/578 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/578 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 376 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1503 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 181/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/223 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 23:29:28] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 25/248 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 7/255 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 210/465 variables, 255/311 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 64/529 variables, 12/331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 23:29:29] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:29:29] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:29:29] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:29:29] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 2/531 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/531 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 47/578 variables, 47/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 391 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2857 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints]
After SMT, in 4387ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6584 ms.
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 14 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 316/316 places, 262/262 transitions.
RANDOM walk for 40000 steps (1949 resets) in 387 ms. (103 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (356 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (353 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (341 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (351 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (379 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (373 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (374 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (375 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (339 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (367 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 773986 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 10
Probabilistic random walk after 773986 steps, saw 109040 distinct states, run finished after 3002 ms. (steps per millisecond=257 ) properties seen :0
[2024-05-31 23:29:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 181/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/223 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/248 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/255 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 210/465 variables, 255/310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 64/529 variables, 12/322 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 2/531 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 47/578 variables, 47/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/578 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/578 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 376 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1472 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 181/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/223 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 23:29:42] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 25/248 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 7/255 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 210/465 variables, 255/311 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 64/529 variables, 12/331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 23:29:43] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:29:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:29:44] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:29:44] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 2/531 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/531 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 47/578 variables, 47/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 0/578 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 391 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2870 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints]
After SMT, in 4351ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5373 ms.
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 25 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-31 23:29:51] [INFO ] Invariant cache hit.
[2024-05-31 23:29:51] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-31 23:29:51] [INFO ] Invariant cache hit.
[2024-05-31 23:29:51] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-31 23:29:51] [INFO ] Redundant transitions in 3 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-31 23:29:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/315 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/577 variables, 315/375 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-31 23:29:57] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-31 23:29:57] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:29:57] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:29:58] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-31 23:30:01] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 1/578 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/578 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 381 constraints, problems are : Problem set: 0 solved, 259 unsolved in 20606 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 262/577 variables, 315/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 259/639 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 639 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/316 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints]
After SMT, in 50817ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 50821ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51385 ms. Remains : 316/316 places, 262/262 transitions.
Attempting over-approximation, by ignoring read arcs.
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 316 transition count 262
Applied a total of 1 rules in 17 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 262 rows 316 cols
[2024-05-31 23:30:42] [INFO ] Computed 60 invariants in 5 ms
[2024-05-31 23:30:42] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:30:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-31 23:30:42] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-31 23:30:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:30:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-31 23:30:43] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-31 23:30:43] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-31 23:30:43] [INFO ] After 891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 1085 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Starting property specific reduction for DES-PT-50b-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 262 rows 316 cols
[2024-05-31 23:30:43] [INFO ] Computed 60 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (466 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (92 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:30:43] [INFO ] Invariant cache hit.
[2024-05-31 23:30:43] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:30:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 23:30:43] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-31 23:30:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:30:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:30:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:30:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:30:43] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-31 23:30:43] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 18 ms.
[2024-05-31 23:30:44] [INFO ] Added : 118 causal constraints over 24 iterations in 513 ms. Result :sat
Minimization took 120 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 316 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p190) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 261/261 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 314 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 313 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 312 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 311 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 310 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 309 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 308 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 307 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 306 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 305 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 304 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 303 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 302 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 301 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 300 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 299 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 298 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 297 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 296 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 295 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 294 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 293 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 292 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 291 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 290 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 289 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 288 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 287 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 286 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 285 transition count 230
Applied a total of 31 rules in 46 ms. Remains 285 /316 variables (removed 31) and now considering 230/261 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 285/316 places, 230/261 transitions.
// Phase 1: matrix 230 rows 285 cols
[2024-05-31 23:30:44] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (48040 resets) in 2827 ms. (353 steps per ms)
BEST_FIRST walk for 1000001 steps (9120 resets) in 1043 ms. (957 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:30:48] [INFO ] Invariant cache hit.
[2024-05-31 23:30:48] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:30:48] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:30:48] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-31 23:30:48] [INFO ] Computed and/alt/rep : 216/408/216 causal constraints (skipped 11 transitions) in 14 ms.
[2024-05-31 23:30:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:30:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:30:49] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:30:49] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-31 23:30:49] [INFO ] Computed and/alt/rep : 216/408/216 causal constraints (skipped 11 transitions) in 14 ms.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2024-05-31 23:30:50] [INFO ] Added : 163 causal constraints over 33 iterations in 957 ms. Result :sat
Minimization took 133 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 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 230/230 transitions.
Applied a total of 0 rules in 14 ms. Remains 285 /285 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 285/285 places, 230/230 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 230/230 transitions.
Applied a total of 0 rules in 8 ms. Remains 285 /285 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-05-31 23:30:50] [INFO ] Invariant cache hit.
[2024-05-31 23:30:50] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 23:30:50] [INFO ] Invariant cache hit.
[2024-05-31 23:30:51] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2024-05-31 23:30:51] [INFO ] Redundant transitions in 3 ms returned []
Running 227 sub problems to find dead transitions.
[2024-05-31 23:30:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 2/283 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 227 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 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 TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 7 (OVERLAPS) 230/514 variables, 284/345 constraints. Problems are: Problem set: 53 solved, 174 unsolved
[2024-05-31 23:30:58] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:30:59] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-31 23:30:59] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:30:59] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:30:59] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:31:00] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 6/351 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/351 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 1/515 variables, 1/352 constraints. Problems are: Problem set: 53 solved, 174 unsolved
[2024-05-31 23:31:04] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 1/353 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 0/353 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 13 (OVERLAPS) 0/515 variables, 0/353 constraints. Problems are: Problem set: 53 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 353 constraints, problems are : Problem set: 53 solved, 174 unsolved in 18245 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 53 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 35/35 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 17/52 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 3/55 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/55 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 2/230 variables, 1/56 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/56 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 54/284 variables, 8/64 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 4/68 constraints. Problems are: Problem set: 53 solved, 174 unsolved
[2024-05-31 23:31:11] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-31 23:31:12] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-31 23:31:12] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 3/71 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 0/71 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 230/514 variables, 284/355 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 174/529 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/529 constraints. Problems are: Problem set: 53 solved, 174 unsolved
At refinement iteration 13 (OVERLAPS) 1/515 variables, 1/530 constraints. Problems are: Problem set: 53 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/515 variables, and 530 constraints, problems are : Problem set: 53 solved, 174 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 174/227 constraints, Known Traps: 10/10 constraints]
After SMT, in 48377ms problems are : Problem set: 53 solved, 174 unsolved
Search for dead transitions found 53 dead transitions in 48382ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 285/285 places, 177/230 transitions.
Graph (complete) has 767 edges and 285 vertex of which 232 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.0 ms
Discarding 53 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 232 /285 variables (removed 53) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 232 cols
[2024-05-31 23:31:39] [INFO ] Computed 61 invariants in 1 ms
[2024-05-31 23:31:39] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 23:31:39] [INFO ] Invariant cache hit.
[2024-05-31 23:31:39] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 232/285 places, 177/230 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 49322 ms. Remains : 232/285 places, 177/230 transitions.
[2024-05-31 23:31:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47864 resets) in 2725 ms. (366 steps per ms)
BEST_FIRST walk for 1000001 steps (9007 resets) in 999 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:31:43] [INFO ] Invariant cache hit.
[2024-05-31 23:31:43] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:31:43] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-31 23:31:43] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 23:31:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:31:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:31:43] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 23:31:43] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 23:31:44] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-31 23:31:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-31 23:31:44] [INFO ] Computed and/alt/rep : 163/301/163 causal constraints (skipped 11 transitions) in 11 ms.
[2024-05-31 23:31:44] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:31:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-31 23:31:44] [INFO ] Added : 100 causal constraints over 21 iterations in 391 ms. Result :sat
Minimization took 79 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 177/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-31 23:31:44] [INFO ] Invariant cache hit.
[2024-05-31 23:31:44] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-31 23:31:44] [INFO ] Invariant cache hit.
[2024-05-31 23:31:45] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-31 23:31:45] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 23:31:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 2/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 1/231 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:31:47] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-31 23:31:48] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 177/408 variables, 231/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:31:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:31:50] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:31:53] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:31:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/409 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 0/409 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 299 constraints, problems are : Problem set: 0 solved, 174 unsolved in 17036 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 2/230 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 1/231 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 177/408 variables, 231/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 174/472 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 1/409 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:32:30] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 474 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints]
After SMT, in 47116ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 47117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47540 ms. Remains : 232/232 places, 177/177 transitions.
RANDOM walk for 40000 steps (1965 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (335 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (350 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1120985 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 2
Probabilistic random walk after 1120985 steps, saw 156470 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
[2024-05-31 23:32:35] [INFO ] Invariant cache hit.
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) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/127 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/161 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/170 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 123/293 variables, 170/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/306 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/308 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/360 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/360 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/409 variables, 49/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/127 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/161 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/170 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 123/293 variables, 170/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/306 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/308 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/308 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/360 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/360 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/409 variables, 49/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/409 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/409 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 464ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 232/232 places, 177/177 transitions.
RANDOM walk for 40000 steps (1859 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (374 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (378 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1274595 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :0 out of 2
Probabilistic random walk after 1274595 steps, saw 176567 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
[2024-05-31 23:32:39] [INFO ] Invariant cache hit.
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) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/127 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/161 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/170 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 123/293 variables, 170/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/306 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/308 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/360 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/360 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/360 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/409 variables, 49/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/85 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/127 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/161 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/170 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 123/293 variables, 170/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/306 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/308 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/308 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/360 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/360 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/409 variables, 49/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/409 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/409 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 393 ms.
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 177/177 transitions.
Applied a total of 0 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 232/232 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-31 23:32:40] [INFO ] Invariant cache hit.
[2024-05-31 23:32:40] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 23:32:40] [INFO ] Invariant cache hit.
[2024-05-31 23:32:40] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-31 23:32:40] [INFO ] Redundant transitions in 0 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 23:32:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 2/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 1/231 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:32:43] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-31 23:32:43] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 177/408 variables, 231/294 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:32:46] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:32:46] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:32:49] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:32:53] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/409 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 0/409 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 299 constraints, problems are : Problem set: 0 solved, 174 unsolved in 17003 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 2/230 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 1/231 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 177/408 variables, 231/298 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 174/472 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 1/409 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:33:26] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 474 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints]
After SMT, in 47080ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 47082ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47486 ms. Remains : 232/232 places, 177/177 transitions.
Attempting over-approximation, by ignoring read arcs.
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 232 transition count 177
Applied a total of 1 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 177 rows 232 cols
[2024-05-31 23:33:27] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 23:33:27] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:33:27] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 23:33:27] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:33:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 23:33:27] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 23:33:27] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:33:27] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:33:28] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50b-UpperBounds-04 in 164519 ms.
Starting property specific reduction for DES-PT-50b-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 262 rows 316 cols
[2024-05-31 23:33:28] [INFO ] Computed 60 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (462 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 10000 steps (97 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:33:28] [INFO ] Invariant cache hit.
[2024-05-31 23:33:28] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:33:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:33:28] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-31 23:33:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:33:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-31 23:33:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-31 23:33:28] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-31 23:33:28] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 17 ms.
[2024-05-31 23:33:28] [INFO ] Added : 126 causal constraints over 26 iterations in 474 ms. Result :sat
Minimization took 109 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 316 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p134) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 261/261 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 314 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 313 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 312 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 311 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 310 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 309 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 308 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 307 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 306 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 305 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 304 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 303 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 302 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 301 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 300 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 299 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 298 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 297 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 296 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 295 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 294 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 293 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 292 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 291 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 290 transition count 235
Applied a total of 26 rules in 30 ms. Remains 290 /316 variables (removed 26) and now considering 235/261 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 290/316 places, 235/261 transitions.
// Phase 1: matrix 235 rows 290 cols
[2024-05-31 23:33:29] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (48076 resets) in 2849 ms. (350 steps per ms)
BEST_FIRST walk for 1000001 steps (9133 resets) in 1022 ms. (977 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:33:33] [INFO ] Invariant cache hit.
[2024-05-31 23:33:33] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:33:33] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 23:33:33] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-31 23:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:33:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:33:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 23:33:33] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-31 23:33:33] [INFO ] Computed and/alt/rep : 221/411/221 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-31 23:33:34] [INFO ] Added : 121 causal constraints over 25 iterations in 430 ms. Result :sat
Minimization took 100 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 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 235/235 transitions.
Applied a total of 0 rules in 5 ms. Remains 290 /290 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 290/290 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 235/235 transitions.
Applied a total of 0 rules in 4 ms. Remains 290 /290 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2024-05-31 23:33:34] [INFO ] Invariant cache hit.
[2024-05-31 23:33:34] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-31 23:33:34] [INFO ] Invariant cache hit.
[2024-05-31 23:33:34] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-31 23:33:34] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 23:33:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 2/288 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 2/290 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 235/525 variables, 290/351 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-31 23:33:42] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:33:42] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-31 23:33:43] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:33:43] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-31 23:33:46] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 0/525 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 356 constraints, problems are : Problem set: 0 solved, 232 unsolved in 18758 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 2/288 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 2/290 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 235/525 variables, 290/356 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 232/588 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-31 23:34:12] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:34:12] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 590 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 7/7 constraints]
After SMT, in 48900ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 48904ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49436 ms. Remains : 290/290 places, 235/235 transitions.
RANDOM walk for 40000 steps (1922 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (368 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (361 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 984158 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 2
Probabilistic random walk after 984158 steps, saw 137970 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
[2024-05-31 23:34:26] [INFO ] Invariant cache hit.
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) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/47 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/55 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/57 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/71 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/73 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/77 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/77 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 165/242 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/242 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 40/282 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/282 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 32/314 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/314 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/323 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/323 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 202/525 variables, 254/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/525 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/525 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/525 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 351 constraints, problems are : Problem set: 0 solved, 2 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/47 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/55 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/57 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/71 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/71 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/73 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/73 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/77 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/77 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 165/242 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/282 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/282 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/314 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/314 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/323 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/323 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 202/525 variables, 254/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/525 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/525 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/525 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 353 constraints, problems are : Problem set: 0 solved, 2 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 738ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 456 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 235/235 transitions.
Applied a total of 0 rules in 5 ms. Remains 290 /290 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 290/290 places, 235/235 transitions.
RANDOM walk for 40000 steps (1923 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (380 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (383 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1083832 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :0 out of 2
Probabilistic random walk after 1083832 steps, saw 151681 distinct states, run finished after 3001 ms. (steps per millisecond=361 ) properties seen :0
[2024-05-31 23:34:31] [INFO ] Invariant cache hit.
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) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/47 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/55 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/57 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/71 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/73 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/77 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/77 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 165/242 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/242 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 40/282 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/282 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 32/314 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/314 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/323 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/323 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 202/525 variables, 254/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/525 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/525 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/525 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 351 constraints, problems are : Problem set: 0 solved, 2 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/47 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/50 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/55 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/57 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/71 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/71 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/73 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/73 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/77 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/77 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 165/242 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 40/282 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/282 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/314 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/314 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/323 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/323 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 202/525 variables, 254/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/525 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/525 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/525 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 353 constraints, problems are : Problem set: 0 solved, 2 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 730ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 512 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 235/235 transitions.
Applied a total of 0 rules in 4 ms. Remains 290 /290 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 290/290 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 235/235 transitions.
Applied a total of 0 rules in 16 ms. Remains 290 /290 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2024-05-31 23:34:32] [INFO ] Invariant cache hit.
[2024-05-31 23:34:32] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-31 23:34:32] [INFO ] Invariant cache hit.
[2024-05-31 23:34:32] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-31 23:34:32] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 23:34:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 2/288 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 2/290 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 235/525 variables, 290/351 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-31 23:34:40] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:34:40] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:34:41] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:34:41] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-31 23:34:43] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 0/525 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 356 constraints, problems are : Problem set: 0 solved, 232 unsolved in 18444 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 2/288 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 2/290 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 235/525 variables, 290/356 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 232/588 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-31 23:35:10] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:35:10] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 590 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 7/7 constraints]
After SMT, in 48598ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 48601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49135 ms. Remains : 290/290 places, 235/235 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 290 /290 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-31 23:35:21] [INFO ] Invariant cache hit.
[2024-05-31 23:35:21] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-31 23:35:21] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-31 23:35:21] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:35:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:35:21] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-31 23:35:21] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:35:21] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:35:21] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 336 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50b-UpperBounds-07 in 113928 ms.
Starting property specific reduction for DES-PT-50b-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 262 rows 316 cols
[2024-05-31 23:35:21] [INFO ] Computed 60 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (513 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10000 steps (91 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:35:21] [INFO ] Invariant cache hit.
[2024-05-31 23:35:22] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:35:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:35:22] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-31 23:35:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:35:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:35:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:35:22] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-31 23:35:22] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 19 ms.
[2024-05-31 23:35:22] [INFO ] Added : 78 causal constraints over 16 iterations in 341 ms. Result :sat
Minimization took 104 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 316 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p50) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 261/261 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 314 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 313 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 312 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 311 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 310 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 309 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 308 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 307 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 306 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 305 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 304 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 303 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 302 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 301 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 300 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 299 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 298 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 297 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 296 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 295 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 294 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 293 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 292 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 291 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 290 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 289 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 288 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 287 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 286 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 285 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 284 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 283 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 282 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 35 place count 281 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 36 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 37 place count 279 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 38 place count 278 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 38 with 1 rules applied. Total rules applied 39 place count 277 transition count 222
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 39 with 1 rules applied. Total rules applied 40 place count 276 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 40 with 1 rules applied. Total rules applied 41 place count 275 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 41 with 1 rules applied. Total rules applied 42 place count 274 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 42 with 1 rules applied. Total rules applied 43 place count 273 transition count 218
Applied a total of 43 rules in 35 ms. Remains 273 /316 variables (removed 43) and now considering 218/261 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 273/316 places, 218/261 transitions.
// Phase 1: matrix 218 rows 273 cols
[2024-05-31 23:35:22] [INFO ] Computed 61 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47506 resets) in 2845 ms. (351 steps per ms)
BEST_FIRST walk for 1000001 steps (9136 resets) in 1032 ms. (968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:35:26] [INFO ] Invariant cache hit.
[2024-05-31 23:35:26] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2024-05-31 23:35:26] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-31 23:35:26] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-31 23:35:26] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:35:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:35:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:35:27] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-31 23:35:27] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 23:35:27] [INFO ] Computed and/alt/rep : 204/308/204 causal constraints (skipped 11 transitions) in 14 ms.
[2024-05-31 23:35:27] [INFO ] Added : 79 causal constraints over 16 iterations in 313 ms. Result :sat
Minimization took 104 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 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 273/273 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2024-05-31 23:35:27] [INFO ] Invariant cache hit.
[2024-05-31 23:35:27] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-31 23:35:27] [INFO ] Invariant cache hit.
[2024-05-31 23:35:28] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2024-05-31 23:35:28] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-31 23:35:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-31 23:35:29] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 1/270 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-31 23:35:32] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 2/272 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
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 TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 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 TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
At refinement iteration 9 (OVERLAPS) 218/490 variables, 272/335 constraints. Problems are: Problem set: 82 solved, 133 unsolved
[2024-05-31 23:35:37] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:35:37] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:35:37] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:35:38] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 4/339 constraints. Problems are: Problem set: 82 solved, 133 unsolved
[2024-05-31 23:35:39] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-31 23:35:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-31 23:35:39] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 3/342 constraints. Problems are: Problem set: 82 solved, 133 unsolved
[2024-05-31 23:35:40] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 1/343 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/343 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 14 (OVERLAPS) 1/491 variables, 1/344 constraints. Problems are: Problem set: 82 solved, 133 unsolved
[2024-05-31 23:35:42] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-31 23:35:43] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 2/346 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/346 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 17 (OVERLAPS) 0/491 variables, 0/346 constraints. Problems are: Problem set: 82 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 346 constraints, problems are : Problem set: 82 solved, 133 unsolved in 19232 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 82 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 36/36 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 17/53 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 7/60 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/60 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 1/188 variables, 1/61 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/65 constraints. Problems are: Problem set: 82 solved, 133 unsolved
[2024-05-31 23:35:48] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/66 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/66 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 84/272 variables, 7/73 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/74 constraints. Problems are: Problem set: 82 solved, 133 unsolved
[2024-05-31 23:35:49] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/75 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/75 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 218/490 variables, 272/347 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 133/480 constraints. Problems are: Problem set: 82 solved, 133 unsolved
[2024-05-31 23:35:57] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:35:57] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:35:57] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 3/483 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 0/483 constraints. Problems are: Problem set: 82 solved, 133 unsolved
At refinement iteration 16 (OVERLAPS) 1/491 variables, 1/484 constraints. Problems are: Problem set: 82 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 484 constraints, problems are : Problem set: 82 solved, 133 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 133/215 constraints, Known Traps: 17/17 constraints]
After SMT, in 49357ms problems are : Problem set: 82 solved, 133 unsolved
Search for dead transitions found 82 dead transitions in 49360ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 273/273 places, 136/218 transitions.
Graph (complete) has 594 edges and 273 vertex of which 191 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.0 ms
Discarding 82 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 191 /273 variables (removed 82) and now considering 136/136 (removed 0) transitions.
// Phase 1: matrix 136 rows 191 cols
[2024-05-31 23:36:17] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 23:36:17] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 23:36:17] [INFO ] Invariant cache hit.
[2024-05-31 23:36:17] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 191/273 places, 136/218 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50153 ms. Remains : 191/273 places, 136/218 transitions.
[2024-05-31 23:36:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47520 resets) in 2694 ms. (371 steps per ms)
BEST_FIRST walk for 1000001 steps (9074 resets) in 995 ms. (1004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:36:21] [INFO ] Invariant cache hit.
[2024-05-31 23:36:21] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:36:21] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-31 23:36:21] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-31 23:36:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:36:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:36:21] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-31 23:36:21] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-31 23:36:21] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-31 23:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-31 23:36:21] [INFO ] Computed and/alt/rep : 124/244/124 causal constraints (skipped 9 transitions) in 8 ms.
[2024-05-31 23:36:21] [INFO ] Added : 77 causal constraints over 16 iterations in 196 ms. Result :sat
Minimization took 59 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 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 136/136 transitions.
Applied a total of 0 rules in 3 ms. Remains 191 /191 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 191/191 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 136/136 transitions.
Applied a total of 0 rules in 3 ms. Remains 191 /191 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-31 23:36:22] [INFO ] Invariant cache hit.
[2024-05-31 23:36:22] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 23:36:22] [INFO ] Invariant cache hit.
[2024-05-31 23:36:22] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-31 23:36:22] [INFO ] Redundant transitions in 1 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-31 23:36:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:36:23] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 1/188 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:36:24] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-31 23:36:24] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 2/190 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 136/326 variables, 190/254 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:36:26] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 23:36:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:36:27] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 1/327 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:36:31] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/327 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:36:32] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-31 23:36:32] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 18 (OVERLAPS) 0/327 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 261 constraints, problems are : Problem set: 0 solved, 133 unsolved in 12188 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 1/188 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 2/190 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 136/326 variables, 190/260 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 133/393 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 1/327 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:36:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-31 23:36:48] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:36:55] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:36:55] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:36:55] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:36:56] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:36:58] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/327 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 401 constraints, problems are : Problem set: 0 solved, 133 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 16/16 constraints]
After SMT, in 42241ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 42244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42572 ms. Remains : 191/191 places, 136/136 transitions.
RANDOM walk for 40000 steps (1886 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (371 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (363 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1359925 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 2
Probabilistic random walk after 1359925 steps, saw 187752 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2024-05-31 23:37:07] [INFO ] Invariant cache hit.
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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 54/60 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/97 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/122 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/129 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 82/211 variables, 129/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/224 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/226 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/278 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/278 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/278 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/327 variables, 49/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/327 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/327 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/60 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/97 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/122 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/129 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 82/211 variables, 129/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/224 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/226 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/226 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/278 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/278 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/278 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/327 variables, 49/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/327 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/327 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 254 constraints, problems are : Problem set: 0 solved, 2 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 363ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 1 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 136/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 191 /191 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 191/191 places, 136/136 transitions.
RANDOM walk for 40000 steps (1885 resets) in 225 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (368 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (322 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1293939 steps, run timeout after 3004 ms. (steps per millisecond=430 ) properties seen :0 out of 2
Probabilistic random walk after 1293939 steps, saw 178941 distinct states, run finished after 3004 ms. (steps per millisecond=430 ) properties seen :0
[2024-05-31 23:37:11] [INFO ] Invariant cache hit.
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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 54/60 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/97 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/122 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/129 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 82/211 variables, 129/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/224 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/226 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/278 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/278 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/278 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/327 variables, 49/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/327 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/327 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/60 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/97 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/122 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/129 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 82/211 variables, 129/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/224 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/226 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/226 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/278 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/278 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/278 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/327 variables, 49/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/327 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/327 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 254 constraints, problems are : Problem set: 0 solved, 2 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 378ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 144 ms.
Support contains 1 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 136/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 191 /191 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 191/191 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 136/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 191 /191 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-31 23:37:12] [INFO ] Invariant cache hit.
[2024-05-31 23:37:12] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-31 23:37:12] [INFO ] Invariant cache hit.
[2024-05-31 23:37:12] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-31 23:37:12] [INFO ] Redundant transitions in 0 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-31 23:37:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:37:13] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 1/188 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:37:14] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2024-05-31 23:37:14] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 2/190 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 136/326 variables, 190/254 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:37:16] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-31 23:37:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:37:17] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 1/327 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:37:21] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/327 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:37:22] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 23:37:22] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 18 (OVERLAPS) 0/327 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 261 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11995 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 1/188 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 2/190 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 136/326 variables, 190/260 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 133/393 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 1/327 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:37:37] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-31 23:37:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-31 23:37:45] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:37:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:37:45] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:37:45] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:37:48] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/327 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 401 constraints, problems are : Problem set: 0 solved, 133 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 16/16 constraints]
After SMT, in 42049ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 42050ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42355 ms. Remains : 191/191 places, 136/136 transitions.
Attempting over-approximation, by ignoring read arcs.
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 191 transition count 136
Applied a total of 1 rules in 5 ms. Remains 191 /191 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 136 rows 191 cols
[2024-05-31 23:37:54] [INFO ] Computed 61 invariants in 1 ms
[2024-05-31 23:37:54] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:37:54] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 23:37:54] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:37:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-31 23:37:54] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 23:37:54] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:37:54] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
TRAPS : Iteration 1
[2024-05-31 23:37:54] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:37:54] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 316 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50b-UpperBounds-08 in 152999 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-09
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 262 rows 316 cols
[2024-05-31 23:37:54] [INFO ] Computed 60 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (492 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10000 steps (100 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:37:54] [INFO ] Invariant cache hit.
[2024-05-31 23:37:55] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:37:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:37:55] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-31 23:37:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:37:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:37:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-31 23:37:55] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-31 23:37:55] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-31 23:37:56] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 0 ms to minimize.
[2024-05-31 23:37:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-31 23:37:56] [INFO ] Added : 195 causal constraints over 39 iterations in 850 ms. Result :sat
Minimization took 125 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 316 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p73) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 261/261 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 314 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 313 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 312 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 311 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 310 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 309 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 308 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 307 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 306 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 305 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 304 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 303 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 302 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 301 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 300 transition count 245
Applied a total of 16 rules in 24 ms. Remains 300 /316 variables (removed 16) and now considering 245/261 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 300/316 places, 245/261 transitions.
// Phase 1: matrix 245 rows 300 cols
[2024-05-31 23:37:57] [INFO ] Computed 61 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47700 resets) in 2877 ms. (347 steps per ms)
BEST_FIRST walk for 1000000 steps (9176 resets) in 1043 ms. (957 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:38:00] [INFO ] Invariant cache hit.
[2024-05-31 23:38:01] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:38:01] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:38:01] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-31 23:38:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:38:01] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:38:01] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:38:01] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-31 23:38:01] [INFO ] Computed and/alt/rep : 231/423/231 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-31 23:38:02] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:38:02] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:38:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-31 23:38:02] [INFO ] Added : 190 causal constraints over 38 iterations in 871 ms. Result :sat
Minimization took 129 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 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 300/300 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-31 23:38:03] [INFO ] Invariant cache hit.
[2024-05-31 23:38:03] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-31 23:38:03] [INFO ] Invariant cache hit.
[2024-05-31 23:38:03] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-05-31 23:38:03] [INFO ] Redundant transitions in 0 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-31 23:38:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 2/298 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-31 23:38:07] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-31 23:38:09] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:38:09] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:38:09] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:38:09] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:38:09] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 1/299 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 10 (OVERLAPS) 245/544 variables, 299/366 constraints. Problems are: Problem set: 30 solved, 212 unsolved
[2024-05-31 23:38:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 1/367 constraints. Problems are: Problem set: 30 solved, 212 unsolved
[2024-05-31 23:38:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:38:16] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:38:17] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:38:17] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:38:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 5/372 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/372 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 14 (OVERLAPS) 1/545 variables, 1/373 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/373 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 16 (OVERLAPS) 0/545 variables, 0/373 constraints. Problems are: Problem set: 30 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 373 constraints, problems are : Problem set: 30 solved, 212 unsolved in 23000 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 30 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 36/36 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/53 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 9/62 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/62 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/268 variables, 1/63 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 2/65 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/65 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 31/299 variables, 7/72 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/73 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/73 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 245/544 variables, 299/372 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 212/584 constraints. Problems are: Problem set: 30 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 0/584 constraints. Problems are: Problem set: 30 solved, 212 unsolved
SMT process timed out in 53153ms, After SMT, problems are : Problem set: 30 solved, 212 unsolved
Search for dead transitions found 30 dead transitions in 53156ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 300/300 places, 215/245 transitions.
Graph (complete) has 912 edges and 300 vertex of which 270 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 270 /300 variables (removed 30) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 270 cols
[2024-05-31 23:38:56] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 23:38:56] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-31 23:38:56] [INFO ] Invariant cache hit.
[2024-05-31 23:38:57] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 270/300 places, 215/245 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54124 ms. Remains : 270/300 places, 215/245 transitions.
[2024-05-31 23:38:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47621 resets) in 2820 ms. (354 steps per ms)
BEST_FIRST walk for 1000001 steps (9126 resets) in 1015 ms. (984 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:39:00] [INFO ] Invariant cache hit.
[2024-05-31 23:39:01] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:39:01] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 23:39:01] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-31 23:39:01] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:39:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:39:01] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-31 23:39:01] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-31 23:39:01] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-31 23:39:01] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:39:01] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-31 23:39:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2024-05-31 23:39:01] [INFO ] Computed and/alt/rep : 201/361/201 causal constraints (skipped 11 transitions) in 17 ms.
[2024-05-31 23:39:02] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-31 23:39:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-31 23:39:02] [INFO ] Added : 166 causal constraints over 34 iterations in 663 ms. Result :sat
Minimization took 99 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 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 270 /270 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 270/270 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 270 /270 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 23:39:02] [INFO ] Invariant cache hit.
[2024-05-31 23:39:03] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-31 23:39:03] [INFO ] Invariant cache hit.
[2024-05-31 23:39:03] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2024-05-31 23:39:03] [INFO ] Redundant transitions in 0 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-31 23:39:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 2/268 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 23:39:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 215/484 variables, 269/331 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 23:39:12] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:39:12] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:39:13] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:39:13] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 23:39:14] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 13 (OVERLAPS) 1/485 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 23:39:22] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/485 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/485 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 17 (OVERLAPS) 0/485 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 338 constraints, problems are : Problem set: 0 solved, 212 unsolved in 25342 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/268 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 215/484 variables, 269/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 212/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 1/485 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 550 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 7/7 constraints]
After SMT, in 55444ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 55447ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55886 ms. Remains : 270/270 places, 215/215 transitions.
RANDOM walk for 40000 steps (1907 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (348 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (373 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1194456 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :0 out of 2
Probabilistic random walk after 1194456 steps, saw 165864 distinct states, run finished after 3001 ms. (steps per millisecond=398 ) properties seen :0
[2024-05-31 23:40:01] [INFO ] Invariant cache hit.
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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 105/139 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/176 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/201 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/208 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 161/369 variables, 208/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/382 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/384 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/384 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/436 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/436 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/485 variables, 49/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/485 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/485 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 331 constraints, problems are : Problem set: 0 solved, 2 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 105/139 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/176 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:40:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-31 23:40:02] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/201 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/208 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 161/369 variables, 208/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/382 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/382 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/382 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/384 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/384 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/436 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/485 variables, 49/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 737ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1029 ms.
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 270 /270 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 270/270 places, 215/215 transitions.
RANDOM walk for 40000 steps (1978 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (351 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (354 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1216098 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :0 out of 2
Probabilistic random walk after 1216098 steps, saw 168958 distinct states, run finished after 3001 ms. (steps per millisecond=405 ) properties seen :0
[2024-05-31 23:40:06] [INFO ] Invariant cache hit.
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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 105/139 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/176 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/201 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/208 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 161/369 variables, 208/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/382 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/384 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/384 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/436 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/436 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/485 variables, 49/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/485 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/485 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 331 constraints, problems are : Problem set: 0 solved, 2 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 105/139 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/176 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:40:07] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:40:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/201 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/208 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 161/369 variables, 208/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/382 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/382 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/382 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/384 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/384 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/436 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/485 variables, 49/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 711ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 818 ms.
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 270 /270 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 270/270 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 270 /270 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 23:40:08] [INFO ] Invariant cache hit.
[2024-05-31 23:40:08] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-31 23:40:08] [INFO ] Invariant cache hit.
[2024-05-31 23:40:08] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-31 23:40:08] [INFO ] Redundant transitions in 1 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-31 23:40:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 2/268 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 23:40:12] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 215/484 variables, 269/331 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 23:40:17] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-31 23:40:17] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:40:18] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:40:18] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 23:40:20] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 13 (OVERLAPS) 1/485 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-31 23:40:28] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/485 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/485 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 17 (OVERLAPS) 0/485 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 338 constraints, problems are : Problem set: 0 solved, 212 unsolved in 25634 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/268 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 215/484 variables, 269/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 212/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 1/485 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 550 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 7/7 constraints]
After SMT, in 55737ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 55739ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56201 ms. Remains : 270/270 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
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 270 transition count 215
Applied a total of 1 rules in 6 ms. Remains 270 /270 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 215 rows 270 cols
[2024-05-31 23:41:04] [INFO ] Computed 61 invariants in 4 ms
[2024-05-31 23:41:04] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-31 23:41:04] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-31 23:41:04] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:41:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:41:04] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-31 23:41:04] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:41:04] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
TRAPS : Iteration 1
[2024-05-31 23:41:04] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:41:04] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 426 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50b-UpperBounds-09 in 189916 ms.
Starting property specific reduction for DES-PT-50b-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 262 rows 316 cols
[2024-05-31 23:41:04] [INFO ] Computed 60 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (499 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10001 steps (89 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:41:04] [INFO ] Invariant cache hit.
[2024-05-31 23:41:04] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:41:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-31 23:41:05] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-31 23:41:05] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:41:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:41:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:41:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:41:05] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-31 23:41:05] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-31 23:41:05] [INFO ] Added : 94 causal constraints over 19 iterations in 368 ms. Result :sat
Minimization took 105 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 316 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p46) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 261/261 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 314 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 313 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 312 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 311 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 310 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 309 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 308 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 307 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 306 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 305 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 304 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 303 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 302 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 301 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 300 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 299 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 298 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 297 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 296 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 295 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 294 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 293 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 292 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 291 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 290 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 289 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 288 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 287 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 286 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 285 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 284 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 283 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 282 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 35 place count 281 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 36 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 37 place count 279 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 38 place count 278 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 38 with 1 rules applied. Total rules applied 39 place count 277 transition count 222
Applied a total of 39 rules in 26 ms. Remains 277 /316 variables (removed 39) and now considering 222/261 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 277/316 places, 222/261 transitions.
// Phase 1: matrix 222 rows 277 cols
[2024-05-31 23:41:06] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47999 resets) in 2809 ms. (355 steps per ms)
BEST_FIRST walk for 1000001 steps (9300 resets) in 1013 ms. (986 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:41:10] [INFO ] Invariant cache hit.
[2024-05-31 23:41:10] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:41:10] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:41:10] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-31 23:41:10] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-31 23:41:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:41:10] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:41:10] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-31 23:41:10] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-31 23:41:10] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:41:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-31 23:41:10] [INFO ] Computed and/alt/rep : 208/320/208 causal constraints (skipped 11 transitions) in 13 ms.
[2024-05-31 23:41:11] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-31 23:41:11] [INFO ] Added : 88 causal constraints over 19 iterations in 433 ms. Result :sat
Minimization took 98 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 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 277 /277 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 277/277 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 277 /277 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-31 23:41:11] [INFO ] Invariant cache hit.
[2024-05-31 23:41:11] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-31 23:41:11] [INFO ] Invariant cache hit.
[2024-05-31 23:41:11] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-05-31 23:41:11] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2024-05-31 23:41:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 1/274 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-31 23:41:15] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 2/276 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
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 TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 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 TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
At refinement iteration 8 (OVERLAPS) 222/498 variables, 276/338 constraints. Problems are: Problem set: 74 solved, 145 unsolved
[2024-05-31 23:41:18] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-31 23:41:19] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:41:19] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 3/341 constraints. Problems are: Problem set: 74 solved, 145 unsolved
[2024-05-31 23:41:21] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 1/342 constraints. Problems are: Problem set: 74 solved, 145 unsolved
[2024-05-31 23:41:22] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:41:23] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-31 23:41:23] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 3/345 constraints. Problems are: Problem set: 74 solved, 145 unsolved
[2024-05-31 23:41:25] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 1/346 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 0/346 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 1/499 variables, 1/347 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/499 variables, 0/347 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 16 (OVERLAPS) 0/499 variables, 0/347 constraints. Problems are: Problem set: 74 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 347 constraints, problems are : Problem set: 74 solved, 145 unsolved in 19775 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 74 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 36/36 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/53 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 5/58 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 1/59 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/62 constraints. Problems are: Problem set: 74 solved, 145 unsolved
[2024-05-31 23:41:32] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/63 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/63 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 76/276 variables, 7/70 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/71 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/71 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 222/498 variables, 276/347 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 145/492 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 0/492 constraints. Problems are: Problem set: 74 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 1/499 variables, 1/493 constraints. Problems are: Problem set: 74 solved, 145 unsolved
[2024-05-31 23:41:57] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/499 variables, 1/494 constraints. Problems are: Problem set: 74 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 494 constraints, problems are : Problem set: 74 solved, 145 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 145/219 constraints, Known Traps: 11/11 constraints]
After SMT, in 49899ms problems are : Problem set: 74 solved, 145 unsolved
Search for dead transitions found 74 dead transitions in 49901ms
Found 74 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 74 transitions
Dead transitions reduction (with SMT) removed 74 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 277/277 places, 148/222 transitions.
Graph (complete) has 642 edges and 277 vertex of which 203 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.0 ms
Discarding 74 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 203 /277 variables (removed 74) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 203 cols
[2024-05-31 23:42:01] [INFO ] Computed 61 invariants in 4 ms
[2024-05-31 23:42:01] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 23:42:01] [INFO ] Invariant cache hit.
[2024-05-31 23:42:02] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 203/277 places, 148/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50728 ms. Remains : 203/277 places, 148/222 transitions.
[2024-05-31 23:42:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47709 resets) in 2663 ms. (375 steps per ms)
BEST_FIRST walk for 1000001 steps (9078 resets) in 991 ms. (1008 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:42:05] [INFO ] Invariant cache hit.
[2024-05-31 23:42:05] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-31 23:42:05] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 23:42:05] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-31 23:42:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:42:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:42:05] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-31 23:42:05] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-31 23:42:06] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-31 23:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-31 23:42:06] [INFO ] Computed and/alt/rep : 134/246/134 causal constraints (skipped 11 transitions) in 10 ms.
[2024-05-31 23:42:06] [INFO ] Added : 95 causal constraints over 19 iterations in 231 ms. Result :sat
Minimization took 72 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, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 203/203 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-31 23:42:06] [INFO ] Invariant cache hit.
[2024-05-31 23:42:06] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 23:42:06] [INFO ] Invariant cache hit.
[2024-05-31 23:42:06] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-31 23:42:06] [INFO ] Redundant transitions in 0 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-31 23:42:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:42:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 2/202 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 148/350 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:42:10] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:42:11] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:42:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 23:42:11] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:42:12] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 1/351 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:42:13] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:42:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:42:14] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:42:14] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:42:15] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:42:15] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:42:16] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:42:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-31 23:42:16] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/351 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:42:17] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/351 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/351 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 19 (OVERLAPS) 0/351 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 280 constraints, problems are : Problem set: 0 solved, 145 unsolved in 13965 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 2/202 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 148/350 variables, 202/278 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 145/423 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:42:26] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-31 23:42:28] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 1/351 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/351 variables, and 427 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 18/18 constraints]
After SMT, in 44029ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 44030ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44361 ms. Remains : 203/203 places, 148/148 transitions.
RANDOM walk for 40000 steps (1886 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (356 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (352 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1358363 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :0 out of 2
Probabilistic random walk after 1358363 steps, saw 187452 distinct states, run finished after 3001 ms. (steps per millisecond=452 ) properties seen :0
[2024-05-31 23:42:53] [INFO ] Invariant cache hit.
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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 62/72 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/109 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/134 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 94/235 variables, 141/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/248 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/250 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/302 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/302 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/302 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/351 variables, 49/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/351 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/351 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/72 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/109 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/134 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 94/235 variables, 141/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:42:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/248 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/248 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/248 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/250 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/250 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/302 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/302 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/302 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/351 variables, 49/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/351 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/351 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 267 constraints, problems are : Problem set: 0 solved, 2 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 453ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 222 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 203/203 places, 148/148 transitions.
RANDOM walk for 40000 steps (1894 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (351 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (349 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1313345 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :0 out of 2
Probabilistic random walk after 1313345 steps, saw 181508 distinct states, run finished after 3001 ms. (steps per millisecond=437 ) properties seen :0
[2024-05-31 23:42:57] [INFO ] Invariant cache hit.
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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 62/72 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/109 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/134 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 94/235 variables, 141/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/248 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/250 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/302 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/302 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/302 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/351 variables, 49/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/351 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/351 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/72 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/109 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/134 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 94/235 variables, 141/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:42:58] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/248 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/248 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/248 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/250 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/250 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/302 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/302 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/302 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/351 variables, 49/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/351 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/351 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 267 constraints, problems are : Problem set: 0 solved, 2 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 221 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 203/203 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-31 23:42:58] [INFO ] Invariant cache hit.
[2024-05-31 23:42:58] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 23:42:58] [INFO ] Invariant cache hit.
[2024-05-31 23:42:58] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-31 23:42:58] [INFO ] Redundant transitions in 0 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-31 23:42:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:43:00] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 2/202 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 148/350 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:43:02] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:43:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:43:03] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:43:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-31 23:43:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 1/351 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:43:05] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:43:05] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:43:05] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:43:06] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:43:07] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:43:07] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-31 23:43:08] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:43:08] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:43:08] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/351 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:43:09] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/351 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/351 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 19 (OVERLAPS) 0/351 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 280 constraints, problems are : Problem set: 0 solved, 145 unsolved in 13927 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 1/200 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 2/202 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 148/350 variables, 202/278 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 145/423 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-31 23:43:18] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:43:20] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 1/351 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/351 variables, and 427 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 18/18 constraints]
After SMT, in 43988ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 43990ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44307 ms. Remains : 203/203 places, 148/148 transitions.
Attempting over-approximation, by ignoring read arcs.
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 203 transition count 148
Applied a total of 1 rules in 5 ms. Remains 203 /203 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 148 rows 203 cols
[2024-05-31 23:43:42] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 23:43:42] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-31 23:43:42] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 23:43:42] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:43:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:43:42] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 23:43:42] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:43:42] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:43:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2024-05-31 23:43:43] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:43:43] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 315 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50b-UpperBounds-10 in 158194 ms.
[2024-05-31 23:43:43] [INFO ] Flatten gal took : 67 ms
[2024-05-31 23:43:43] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 23:43:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 316 places, 262 transitions and 1275 arcs took 5 ms.
Total runtime 957310 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 : DES-PT-50b-UpperBounds-04
Could not compute solution for formula : DES-PT-50b-UpperBounds-07
Could not compute solution for formula : DES-PT-50b-UpperBounds-08
Could not compute solution for formula : DES-PT-50b-UpperBounds-09
Could not compute solution for formula : DES-PT-50b-UpperBounds-10

BK_STOP 1717199023606

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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 DES-PT-50b-UpperBounds-04
ub formula formula --maxsum=/tmp/1924/ub_0_
ub formula name DES-PT-50b-UpperBounds-07
ub formula formula --maxsum=/tmp/1924/ub_1_
ub formula name DES-PT-50b-UpperBounds-08
ub formula formula --maxsum=/tmp/1924/ub_2_
ub formula name DES-PT-50b-UpperBounds-09
ub formula formula --maxsum=/tmp/1924/ub_3_
ub formula name DES-PT-50b-UpperBounds-10
ub formula formula --maxsum=/tmp/1924/ub_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-50b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189900741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;