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.r091-tall-171624188200685.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 greatspnxred
Input is DES-PT-20a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200685
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 57K 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-20a-UpperBounds-00
FORMULA_NAME DES-PT-20a-UpperBounds-01
FORMULA_NAME DES-PT-20a-UpperBounds-02
FORMULA_NAME DES-PT-20a-UpperBounds-03
FORMULA_NAME DES-PT-20a-UpperBounds-04
FORMULA_NAME DES-PT-20a-UpperBounds-05
FORMULA_NAME DES-PT-20a-UpperBounds-06
FORMULA_NAME DES-PT-20a-UpperBounds-07
FORMULA_NAME DES-PT-20a-UpperBounds-08
FORMULA_NAME DES-PT-20a-UpperBounds-09
FORMULA_NAME DES-PT-20a-UpperBounds-10
FORMULA_NAME DES-PT-20a-UpperBounds-11
FORMULA_NAME DES-PT-20a-UpperBounds-12
FORMULA_NAME DES-PT-20a-UpperBounds-13
FORMULA_NAME DES-PT-20a-UpperBounds-14
FORMULA_NAME DES-PT-20a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716317623060

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:53:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 18:53:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:53:44] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-21 18:53:44] [INFO ] Transformed 195 places.
[2024-05-21 18:53:44] [INFO ] Transformed 152 transitions.
[2024-05-21 18:53:44] [INFO ] Found NUPN structural information;
[2024-05-21 18:53:44] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
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 138 rows 195 cols
[2024-05-21 18:53:44] [INFO ] Computed 59 invariants in 34 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 (215 resets) in 46 ms. (212 steps per ms)
FORMULA DES-PT-20a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (132 resets) in 45 ms. (652 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 18:53:44] [INFO ] Invariant cache hit.
[2024-05-21 18:53:44] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2024-05-21 18:53:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-21 18:53:45] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-21 18:53:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:53:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 18:53:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 53 ms returned sat
[2024-05-21 18:53:45] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-21 18:53:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:53:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2024-05-21 18:53:45] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 31 ms.
[2024-05-21 18:53:45] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 42 ms to minimize.
[2024-05-21 18:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-05-21 18:53:45] [INFO ] Added : 68 causal constraints over 14 iterations in 561 ms. Result :sat
Minimization took 135 ms.
[2024-05-21 18:53:46] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2024-05-21 18:53:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2024-05-21 18:53:46] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-21 18:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:53:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 18:53:46] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 18:53:46] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-21 18:53:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-21 18:53:46] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 13 ms.
[2024-05-21 18:53:47] [INFO ] Added : 107 causal constraints over 22 iterations in 467 ms. Result :sat
Minimization took 66 ms.
[2024-05-21 18:53:47] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-21 18:53:47] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 18:53:47] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-21 18:53:47] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2024-05-21 18:53:47] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
[2024-05-21 18:53:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:53:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2024-05-21 18:53:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:53:47] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-21 18:53:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2024-05-21 18:53:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:53:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-21 18:53:47] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 11 ms.
[2024-05-21 18:53:47] [INFO ] Added : 74 causal constraints over 15 iterations in 258 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 138/138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 194 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 194 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 194 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 193 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 192 transition count 134
Applied a total of 12 rules in 77 ms. Remains 192 /195 variables (removed 3) and now considering 134/138 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 192/195 places, 134/138 transitions.
// Phase 1: matrix 134 rows 192 cols
[2024-05-21 18:53:48] [INFO ] Computed 60 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (13600 resets) in 1880 ms. (531 steps per ms)
BEST_FIRST walk for 3000002 steps (6822 resets) in 2717 ms. (1103 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 18:53:53] [INFO ] Invariant cache hit.
[2024-05-21 18:53:53] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:53:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 18:53:53] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 18:53:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:53:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:53:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 18:53:53] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-21 18:53:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:53:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 18:53:53] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 18:53:53] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-21 18:53:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-21 18:53:53] [INFO ] Added : 66 causal constraints over 14 iterations in 288 ms. Result :sat
Minimization took 51 ms.
[2024-05-21 18:53:53] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 18:53:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:53:53] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 18:53:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:53:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:53:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 18:53:53] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-21 18:53:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:53:53] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 18:53:54] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
[2024-05-21 18:53:54] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:53:54] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:53:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 251 ms
[2024-05-21 18:53:54] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 18:53:54] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-21 18:53:54] [INFO ] Added : 106 causal constraints over 22 iterations in 357 ms. Result :sat
Minimization took 58 ms.
[2024-05-21 18:53:54] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:53:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:53:54] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-21 18:53:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:53:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:53:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 18:53:54] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-21 18:53:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2024-05-21 18:53:54] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 8 ms.
[2024-05-21 18:53:54] [INFO ] Added : 71 causal constraints over 15 iterations in 181 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-21 18:53:55] [INFO ] Invariant cache hit.
[2024-05-21 18:53:55] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 18:53:55] [INFO ] Invariant cache hit.
[2024-05-21 18:53:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:53:55] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-21 18:53:55] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-21 18:53:55] [INFO ] Invariant cache hit.
[2024-05-21 18:53:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-21 18:53:57] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-21 18:53:59] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-21 18:53:59] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:53:59] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:53:59] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:54:00] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 18:54:00] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 261 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6841 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/257 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-21 18:54:17] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-21 18:54:17] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-21 18:54:18] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-21 18:54:25] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/326 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 396 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints]
After SMT, in 36939ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 36948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37320 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (552 resets) in 930 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (82 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (95 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (88 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (87 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (95 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 817527 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 6
Probabilistic random walk after 817527 steps, saw 116611 distinct states, run finished after 3004 ms. (steps per millisecond=272 ) properties seen :0
[2024-05-21 18:54:36] [INFO ] Invariant cache hit.
[2024-05-21 18:54:36] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/130 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/155 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 7/162 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 113/275 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 33/308 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/309 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 17/326 variables, 17/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 6 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/130 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:54:36] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 25/155 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 113/275 variables, 162/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 33/308 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:54:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/309 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/309 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 17/326 variables, 17/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:54:37] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 263 constraints, problems are : Problem set: 0 solved, 6 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1315ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1698 ms.
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (546 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (95 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (94 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (96 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (91 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (87 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (84 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 852075 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :0 out of 6
Probabilistic random walk after 852075 steps, saw 121413 distinct states, run finished after 3004 ms. (steps per millisecond=283 ) properties seen :0
[2024-05-21 18:54:42] [INFO ] Invariant cache hit.
[2024-05-21 18:54:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/130 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/155 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 7/162 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 113/275 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 33/308 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/309 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 17/326 variables, 17/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 6 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 94/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/130 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:54:43] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 25/155 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 113/275 variables, 162/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 33/308 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:54:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/309 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/309 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 17/326 variables, 17/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:54:43] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 263 constraints, problems are : Problem set: 0 solved, 6 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1246ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1924 ms.
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-21 18:54:45] [INFO ] Invariant cache hit.
[2024-05-21 18:54:45] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 18:54:45] [INFO ] Invariant cache hit.
[2024-05-21 18:54:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:54:46] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 18:54:46] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-21 18:54:46] [INFO ] Invariant cache hit.
[2024-05-21 18:54:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-21 18:54:47] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-21 18:54:49] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-21 18:54:49] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-21 18:54:50] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-21 18:54:50] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 18:54:50] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 18:54:50] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/326 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 261 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6699 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/325 variables, 191/257 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 131/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 1/326 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-21 18:55:08] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:55:08] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:55:09] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-21 18:55:15] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/326 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 396 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints]
After SMT, in 36776ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 36778ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37086 ms. Remains : 192/192 places, 134/134 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 192 transition count 134
Applied a total of 1 rules in 18 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 134 rows 192 cols
[2024-05-21 18:55:22] [INFO ] Computed 60 invariants in 6 ms
[2024-05-21 18:55:23] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:55:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 18:55:23] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 18:55:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 18:55:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 18:55:23] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-21 18:55:23] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-21 18:55:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-05-21 18:55:23] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-21 18:55:23] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 531 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Starting property specific reduction for DES-PT-20a-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 134 rows 192 cols
[2024-05-21 18:55:23] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (139 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (23 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:55:23] [INFO ] Invariant cache hit.
[2024-05-21 18:55:23] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 18:55:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 18:55:23] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 18:55:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:55:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:55:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 18:55:23] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-21 18:55:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:55:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:55:23] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 18:55:23] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:55:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-21 18:55:23] [INFO ] Added : 66 causal constraints over 14 iterations in 250 ms. Result :sat
Minimization took 49 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 192 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p49) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 133/133 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 191 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 190 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 189 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 188 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 187 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 186 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 185 transition count 126
Applied a total of 7 rules in 13 ms. Remains 185 /192 variables (removed 7) and now considering 126/133 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 185/192 places, 126/133 transitions.
// Phase 1: matrix 126 rows 185 cols
[2024-05-21 18:55:24] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13635 resets) in 1735 ms. (576 steps per ms)
BEST_FIRST walk for 1000001 steps (2280 resets) in 868 ms. (1150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:55:26] [INFO ] Invariant cache hit.
[2024-05-21 18:55:26] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 18:55:26] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:55:26] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-21 18:55:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:55:26] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 18:55:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:55:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 18:55:26] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 18:55:26] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 18:55:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 18:55:26] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-21 18:55:26] [INFO ] Computed and/alt/rep : 117/223/117 causal constraints (skipped 6 transitions) in 6 ms.
[2024-05-21 18:55:27] [INFO ] Added : 65 causal constraints over 14 iterations in 164 ms. Result :sat
Minimization took 64 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 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 185/185 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 126/126 transitions.
Applied a total of 0 rules in 11 ms. Remains 185 /185 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-21 18:55:27] [INFO ] Invariant cache hit.
[2024-05-21 18:55:27] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 18:55:27] [INFO ] Invariant cache hit.
[2024-05-21 18:55:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:55:27] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-21 18:55:27] [INFO ] Redundant transitions in 3 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-21 18:55:27] [INFO ] Invariant cache hit.
[2024-05-21 18:55:27] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 2/183 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 2/185 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 126/311 variables, 185/246 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-21 18:55:30] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-21 18:55:30] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2024-05-21 18:55:30] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-21 18:55:31] [INFO ] Deduced a trap composed of 18 places in 429 ms of which 1 ms to minimize.
[2024-05-21 18:55:31] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 18:55:31] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 18:55:32] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 7/255 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-21 18:55:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:55:32] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/311 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 257 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7455 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 185/185 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 2/183 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 2/185 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-21 18:55:36] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 126/311 variables, 185/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 123/381 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-21 18:55:40] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-21 18:55:45] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:55:45] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:55:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:55:47] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-21 18:55:50] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:55:52] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 9 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-21 18:56:02] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/311 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 389 constraints, problems are : Problem set: 0 solved, 123 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 185/185 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 18/18 constraints]
After SMT, in 37524ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 37526ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37838 ms. Remains : 185/185 places, 126/126 transitions.
RANDOM walk for 40000 steps (554 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (91 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (88 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1071102 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 2
Probabilistic random walk after 1071102 steps, saw 150496 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
[2024-05-21 18:56:08] [INFO ] Invariant cache hit.
[2024-05-21 18:56:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/28 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/33 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/34 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/34 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/34 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/46 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/46 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/46 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/48 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/52 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 78/130 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/130 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/164 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/164 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/196 variables, 22/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/196 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/205 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/205 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 106/311 variables, 161/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/311 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/311 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/311 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/311 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 248 constraints, problems are : Problem set: 0 solved, 2 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 185/185 constraints, ReadFeed: 2/2 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) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/28 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/33 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/34 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/34 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/34 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/46 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/46 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/46 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/48 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/48 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/52 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/52 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 78/130 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/130 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/164 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/164 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/196 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/196 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/205 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/205 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 106/311 variables, 161/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/311 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/311 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/311 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/311 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 250 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 185/185 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 325 ms.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 185 /185 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 185/185 places, 126/126 transitions.
RANDOM walk for 40000 steps (532 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (95 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (95 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1291858 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :0 out of 2
Probabilistic random walk after 1291858 steps, saw 179807 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
[2024-05-21 18:56:12] [INFO ] Invariant cache hit.
[2024-05-21 18:56:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/28 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/33 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/34 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/34 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/34 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/46 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/46 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/46 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/48 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/52 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 78/130 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/130 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/164 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/164 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/196 variables, 22/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/196 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/205 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/205 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 106/311 variables, 161/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/311 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/311 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/311 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/311 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 248 constraints, problems are : Problem set: 0 solved, 2 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 185/185 constraints, ReadFeed: 2/2 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) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/28 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/33 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/34 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/34 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/34 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/46 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/46 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/46 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/48 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/48 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/52 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/52 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 78/130 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/130 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/164 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/164 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/196 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/196 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/205 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/205 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 106/311 variables, 161/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/311 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/311 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/311 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/311 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 250 constraints, problems are : Problem set: 0 solved, 2 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 185/185 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 365ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 305 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=76 )
Parikh walk visited 2 properties in 7 ms.
FORMULA DES-PT-20a-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-20a-UpperBounds-02 in 49032 ms.
Starting property specific reduction for DES-PT-20a-UpperBounds-13
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 134 rows 192 cols
[2024-05-21 18:56:12] [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 (133 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (26 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:56:12] [INFO ] Invariant cache hit.
[2024-05-21 18:56:12] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 18:56:12] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:56:12] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 18:56:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:56:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:56:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:56:12] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-21 18:56:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:56:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:56:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-21 18:56:12] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-21 18:56:12] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:56:12] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-21 18:56:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 238 ms
[2024-05-21 18:56:12] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 7 ms.
[2024-05-21 18:56:13] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-21 18:56:13] [INFO ] Added : 106 causal constraints over 22 iterations in 336 ms. Result :sat
Minimization took 64 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 192 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p27) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 133/133 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 191 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 190 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 189 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 188 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 187 transition count 128
Applied a total of 5 rules in 10 ms. Remains 187 /192 variables (removed 5) and now considering 128/133 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 187/192 places, 128/133 transitions.
// Phase 1: matrix 128 rows 187 cols
[2024-05-21 18:56:13] [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 (13629 resets) in 1808 ms. (552 steps per ms)
BEST_FIRST walk for 1000001 steps (2318 resets) in 910 ms. (1097 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:56:16] [INFO ] Invariant cache hit.
[2024-05-21 18:56:16] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 18:56:16] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 6 ms returned sat
[2024-05-21 18:56:16] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 18:56:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:56:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 18:56:16] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:56:16] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 18:56:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:56:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 18:56:16] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:56:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:56:16] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:56:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2024-05-21 18:56:16] [INFO ] Computed and/alt/rep : 119/227/119 causal constraints (skipped 6 transitions) in 7 ms.
[2024-05-21 18:56:16] [INFO ] Added : 99 causal constraints over 20 iterations in 215 ms. Result :sat
Minimization took 64 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 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 187/187 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 187 /187 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 18:56:17] [INFO ] Invariant cache hit.
[2024-05-21 18:56:17] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 18:56:17] [INFO ] Invariant cache hit.
[2024-05-21 18:56:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:56:17] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-21 18:56:17] [INFO ] Redundant transitions in 6 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-21 18:56:17] [INFO ] Invariant cache hit.
[2024-05-21 18:56:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 2/185 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 125 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/186 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 125 unsolved
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 TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 8 (OVERLAPS) 128/314 variables, 186/247 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/249 constraints. Problems are: Problem set: 9 solved, 116 unsolved
[2024-05-21 18:56:19] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:56:20] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:56:20] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 3/252 constraints. Problems are: Problem set: 9 solved, 116 unsolved
[2024-05-21 18:56:20] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:56:20] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 2/254 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/254 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 13 (OVERLAPS) 1/315 variables, 1/255 constraints. Problems are: Problem set: 9 solved, 116 unsolved
[2024-05-21 18:56:22] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 1/256 constraints. Problems are: Problem set: 9 solved, 116 unsolved
[2024-05-21 18:56:23] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 18:56:23] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 2/258 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 0/258 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 17 (OVERLAPS) 0/315 variables, 0/258 constraints. Problems are: Problem set: 9 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 258 constraints, problems are : Problem set: 9 solved, 116 unsolved in 7882 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 9 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 35/35 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 17/52 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 7/59 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/59 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 2/176 variables, 1/60 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/61 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/61 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 10/186 variables, 8/69 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/69 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 128/314 variables, 186/255 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 2/257 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 116/373 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/373 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 13 (OVERLAPS) 1/315 variables, 1/374 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/374 constraints. Problems are: Problem set: 9 solved, 116 unsolved
At refinement iteration 15 (OVERLAPS) 0/315 variables, 0/374 constraints. Problems are: Problem set: 9 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 374 constraints, problems are : Problem set: 9 solved, 116 unsolved in 25226 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 187/187 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 116/125 constraints, Known Traps: 8/8 constraints]
After SMT, in 33142ms problems are : Problem set: 9 solved, 116 unsolved
Search for dead transitions found 9 dead transitions in 33143ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 187/187 places, 119/128 transitions.
Graph (complete) has 586 edges and 187 vertex of which 178 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 178 /187 variables (removed 9) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 178 cols
[2024-05-21 18:56:50] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 18:56:50] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 18:56:50] [INFO ] Invariant cache hit.
[2024-05-21 18:56:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:56:50] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 178/187 places, 119/128 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33765 ms. Remains : 178/187 places, 119/128 transitions.
[2024-05-21 18:56:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13598 resets) in 1790 ms. (558 steps per ms)
BEST_FIRST walk for 1000001 steps (2272 resets) in 919 ms. (1086 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:56:53] [INFO ] Invariant cache hit.
[2024-05-21 18:56:53] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 18:56:53] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 18:56:53] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 18:56:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:56:53] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-21 18:56:53] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 18:56:53] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 18:56:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:56:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 18:56:53] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:56:53] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:56:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2024-05-21 18:56:53] [INFO ] Computed and/alt/rep : 110/198/110 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-21 18:56:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:56:54] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:56:54] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:56:54] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:56:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 186 ms
[2024-05-21 18:56:54] [INFO ] Added : 106 causal constraints over 23 iterations in 424 ms. Result :sat
Minimization took 54 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 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 178/178 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-21 18:56:54] [INFO ] Invariant cache hit.
[2024-05-21 18:56:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 18:56:54] [INFO ] Invariant cache hit.
[2024-05-21 18:56:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:56:54] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-21 18:56:54] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 18:56:54] [INFO ] Invariant cache hit.
[2024-05-21 18:56:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 2/176 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/177 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 119/296 variables, 177/238 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 18:56:57] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 18:56:57] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-21 18:56:57] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-21 18:56:57] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:56:57] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-21 18:56:57] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 18:56:58] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:56:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:56:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:56:58] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (OVERLAPS) 1/297 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 16 (OVERLAPS) 0/297 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6489 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 2/176 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/177 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 18:57:02] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 119/296 variables, 177/249 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 116/367 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 18:57:04] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:57:05] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:57:05] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
[2024-05-21 18:57:07] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 18:57:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/296 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/296 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 17 (OVERLAPS) 1/297 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 18:57:24] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/297 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 18:57:29] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/297 variables, and 375 constraints, problems are : Problem set: 0 solved, 116 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 18/18 constraints]
After SMT, in 36537ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 36538ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36829 ms. Remains : 178/178 places, 119/119 transitions.
RANDOM walk for 40000 steps (552 resets) in 412 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (91 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (92 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 940036 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 2
Probabilistic random walk after 940036 steps, saw 133618 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2024-05-21 18:57:34] [INFO ] Invariant cache hit.
[2024-05-21 18:57:34] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/80 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/115 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/140 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/147 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 96/243 variables, 147/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/255 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/256 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:57:34] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
[2024-05-21 18:57:34] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/256 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/256 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 22/278 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/278 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/278 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 19/297 variables, 19/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/297 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/297 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 243 constraints, problems are : Problem set: 0 solved, 2 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/80 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/115 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/140 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/147 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 96/243 variables, 147/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/255 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/255 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/255 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/256 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/256 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/256 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/256 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 22/278 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/278 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/278 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 19/297 variables, 19/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/297 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/297 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 274 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 178/178 places, 119/119 transitions.
RANDOM walk for 40000 steps (533 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (78 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (89 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1128914 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :0 out of 2
Probabilistic random walk after 1128914 steps, saw 157930 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
[2024-05-21 18:57:38] [INFO ] Invariant cache hit.
[2024-05-21 18:57:38] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/80 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/115 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/140 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/147 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 96/243 variables, 147/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/255 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/256 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/256 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:57:38] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:57:38] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/256 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/256 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 22/278 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/278 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/278 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 19/297 variables, 19/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/297 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/297 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 243 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/80 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/115 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/140 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/147 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 96/243 variables, 147/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/255 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/255 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/255 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/256 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/256 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/256 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/256 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 22/278 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/278 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/278 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 19/297 variables, 19/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/297 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/297 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 245 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: 178/178 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 493ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26663 steps, including 67 resets, run visited all 2 properties in 275 ms. (steps per millisecond=96 )
Parikh walk visited 2 properties in 274 ms.
FORMULA DES-PT-20a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-20a-UpperBounds-13 in 86846 ms.
Starting property specific reduction for DES-PT-20a-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 134 rows 192 cols
[2024-05-21 18:57:39] [INFO ] Computed 60 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (133 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10000 steps (25 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:57:39] [INFO ] Invariant cache hit.
[2024-05-21 18:57:39] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 18:57:39] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 18:57:39] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 18:57:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:57:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2024-05-21 18:57:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 18:57:39] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-21 18:57:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:57:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:57:39] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 18:57:39] [INFO ] Added : 71 causal constraints over 15 iterations in 195 ms. Result :sat
Minimization took 51 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 192 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p15) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 133/133 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 191 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 190 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 189 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 188 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 187 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 186 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 185 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 184 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 183 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 182 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 181 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 180 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 179 transition count 120
Applied a total of 13 rules in 17 ms. Remains 179 /192 variables (removed 13) and now considering 120/133 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 179/192 places, 120/133 transitions.
// Phase 1: matrix 120 rows 179 cols
[2024-05-21 18:57:40] [INFO ] Computed 61 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13656 resets) in 1717 ms. (582 steps per ms)
BEST_FIRST walk for 1000001 steps (2225 resets) in 867 ms. (1152 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:57:42] [INFO ] Invariant cache hit.
[2024-05-21 18:57:42] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 18:57:42] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 6 ms returned sat
[2024-05-21 18:57:42] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 18:57:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:57:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 18:57:42] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-21 18:57:42] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 18:57:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:57:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 18:57:42] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-21 18:57:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-21 18:57:42] [INFO ] Computed and/alt/rep : 111/191/111 causal constraints (skipped 6 transitions) in 6 ms.
[2024-05-21 18:57:43] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 18:57:43] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-21 18:57:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2024-05-21 18:57:43] [INFO ] Added : 80 causal constraints over 17 iterations in 363 ms. Result :sat
Minimization took 43 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 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 179/179 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 18:57:43] [INFO ] Invariant cache hit.
[2024-05-21 18:57:43] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 18:57:43] [INFO ] Invariant cache hit.
[2024-05-21 18:57:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:57:43] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-21 18:57:43] [INFO ] Redundant transitions in 0 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-21 18:57:43] [INFO ] Invariant cache hit.
[2024-05-21 18:57:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/176 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 2/178 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 117 unsolved
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 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 TDEAD116 is UNSAT
At refinement iteration 7 (OVERLAPS) 120/298 variables, 178/239 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/241 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/241 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/299 variables, 1/242 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/242 constraints. Problems are: Problem set: 20 solved, 97 unsolved
[2024-05-21 18:57:48] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/299 variables, 1/243 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/243 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/299 variables, 0/243 constraints. Problems are: Problem set: 20 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 243 constraints, problems are : Problem set: 20 solved, 97 unsolved in 6407 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 179/179 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 20 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 35/35 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 17/52 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/53 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/156 variables, 1/54 constraints. Problems are: Problem set: 20 solved, 97 unsolved
[2024-05-21 18:57:50] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:57:50] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/56 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/56 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 22/178 variables, 8/64 constraints. Problems are: Problem set: 20 solved, 97 unsolved
[2024-05-21 18:57:51] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 18:57:51] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:57:51] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 3/67 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 120/298 variables, 178/245 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 2/247 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 97/344 constraints. Problems are: Problem set: 20 solved, 97 unsolved
[2024-05-21 18:57:53] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-21 18:57:53] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 2/346 constraints. Problems are: Problem set: 20 solved, 97 unsolved
[2024-05-21 18:57:57] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:57:57] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:57:57] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 18:57:57] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 4/350 constraints. Problems are: Problem set: 20 solved, 97 unsolved
[2024-05-21 18:58:00] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:58:00] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/298 variables, 2/352 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/298 variables, 0/352 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 1/299 variables, 1/353 constraints. Problems are: Problem set: 20 solved, 97 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/299 variables, 0/353 constraints. Problems are: Problem set: 20 solved, 97 unsolved
[2024-05-21 18:58:13] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 7 ms to minimize.
[2024-05-21 18:58:13] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/299 variables, 2/355 constraints. Problems are: Problem set: 20 solved, 97 unsolved
[2024-05-21 18:58:15] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-05-21 18:58:15] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/299 variables, 2/357 constraints. Problems are: Problem set: 20 solved, 97 unsolved
[2024-05-21 18:58:18] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-21 18:58:19] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/299 variables, and 359 constraints, problems are : Problem set: 20 solved, 97 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 179/179 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 97/117 constraints, Known Traps: 20/20 constraints]
After SMT, in 36463ms problems are : Problem set: 20 solved, 97 unsolved
Search for dead transitions found 20 dead transitions in 36465ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/179 places, 100/120 transitions.
Graph (complete) has 508 edges and 179 vertex of which 159 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 159 /179 variables (removed 20) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 159 cols
[2024-05-21 18:58:20] [INFO ] Computed 61 invariants in 0 ms
[2024-05-21 18:58:20] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 18:58:20] [INFO ] Invariant cache hit.
[2024-05-21 18:58:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:58:20] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 159/179 places, 100/120 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37193 ms. Remains : 159/179 places, 100/120 transitions.
[2024-05-21 18:58:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13753 resets) in 1714 ms. (583 steps per ms)
BEST_FIRST walk for 1000000 steps (2286 resets) in 875 ms. (1141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:58:23] [INFO ] Invariant cache hit.
[2024-05-21 18:58:23] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-05-21 18:58:23] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 18:58:23] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 18:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:58:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-21 18:58:23] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-21 18:58:23] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 18:58:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:58:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:58:23] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 18:58:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-21 18:58:23] [INFO ] Computed and/alt/rep : 91/163/91 causal constraints (skipped 6 transitions) in 8 ms.
[2024-05-21 18:58:23] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:58:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-21 18:58:23] [INFO ] Added : 80 causal constraints over 16 iterations in 208 ms. Result :sat
Minimization took 37 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 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 159/159 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-21 18:58:23] [INFO ] Invariant cache hit.
[2024-05-21 18:58:23] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 18:58:23] [INFO ] Invariant cache hit.
[2024-05-21 18:58:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:58:24] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-21 18:58:24] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-21 18:58:24] [INFO ] Invariant cache hit.
[2024-05-21 18:58:24] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 2/158 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 100/258 variables, 158/219 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/259 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/259 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 222 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4668 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 159/159 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 2/158 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-21 18:58:29] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-21 18:58:29] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 18:58:29] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-21 18:58:29] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-21 18:58:30] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 100/258 variables, 158/224 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 97/323 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 1/259 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-21 18:58:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-21 18:58:35] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-21 18:58:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-21 18:58:38] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/259 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-21 18:58:42] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-21 18:58:43] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/259 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-21 18:58:45] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-21 18:58:45] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2024-05-21 18:58:45] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:58:46] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:58:46] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-21 18:58:48] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:58:48] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/259 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/259 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-21 18:58:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/259 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-21 18:58:55] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-05-21 18:58:55] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:58:55] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/259 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 341 constraints, problems are : Problem set: 0 solved, 97 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 159/159 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 22/22 constraints]
After SMT, in 34702ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 34703ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35009 ms. Remains : 159/159 places, 100/100 transitions.
RANDOM walk for 40000 steps (536 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (84 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (90 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1085512 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :0 out of 2
Probabilistic random walk after 1085512 steps, saw 152126 distinct states, run finished after 3001 ms. (steps per millisecond=361 ) properties seen :0
[2024-05-21 18:59:01] [INFO ] Invariant cache hit.
[2024-05-21 18:59:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 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/61 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/96 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/128 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/205 variables, 128/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/217 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/218 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/218 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 22/240 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/240 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/240 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 19/259 variables, 19/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/259 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/259 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 159/159 constraints, ReadFeed: 2/2 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/61 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/96 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/128 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/205 variables, 128/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:59:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/217 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/218 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 22/240 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/240 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/240 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 19/259 variables, 19/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/259 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/259 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 159/159 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 393ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 388 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=194 )
Parikh walk visited 2 properties in 1 ms.
FORMULA DES-PT-20a-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-20a-UpperBounds-15 in 82989 ms.
[2024-05-21 18:59:02] [INFO ] Flatten gal took : 76 ms
Total runtime 318260 ms.
ITS solved all properties within timeout

BK_STOP 1716317942588

--------------------
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

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-20a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DES-PT-20a, 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 r091-tall-171624188200685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a 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 ;