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.r549-tall-171734898200277.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 FireWire-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898200277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 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 FireWire-PT-14-UpperBounds-00
FORMULA_NAME FireWire-PT-14-UpperBounds-01
FORMULA_NAME FireWire-PT-14-UpperBounds-02
FORMULA_NAME FireWire-PT-14-UpperBounds-03
FORMULA_NAME FireWire-PT-14-UpperBounds-04
FORMULA_NAME FireWire-PT-14-UpperBounds-05
FORMULA_NAME FireWire-PT-14-UpperBounds-06
FORMULA_NAME FireWire-PT-14-UpperBounds-07
FORMULA_NAME FireWire-PT-14-UpperBounds-08
FORMULA_NAME FireWire-PT-14-UpperBounds-09
FORMULA_NAME FireWire-PT-14-UpperBounds-10
FORMULA_NAME FireWire-PT-14-UpperBounds-11
FORMULA_NAME FireWire-PT-14-UpperBounds-12
FORMULA_NAME FireWire-PT-14-UpperBounds-13
FORMULA_NAME FireWire-PT-14-UpperBounds-14
FORMULA_NAME FireWire-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717370494185

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:21:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 23:21:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:21:35] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-02 23:21:35] [INFO ] Transformed 205 places.
[2024-06-02 23:21:35] [INFO ] Transformed 610 transitions.
[2024-06-02 23:21:35] [INFO ] Found NUPN structural information;
[2024-06-02 23:21:35] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 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]
[2024-06-02 23:21:35] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
// Phase 1: matrix 501 rows 205 cols
[2024-06-02 23:21:35] [INFO ] Computed 10 invariants in 19 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 (292 resets) in 51 ms. (192 steps per ms)
FORMULA FireWire-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (252 resets) in 49 ms. (800 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 23:21:35] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
[2024-06-02 23:21:35] [INFO ] Invariant cache hit.
[2024-06-02 23:21:35] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-06-02 23:21:36] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-06-02 23:21:36] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 23:21:36] [INFO ] [Real]Added 73 Read/Feed constraints in 22 ms returned sat
[2024-06-02 23:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-02 23:21:36] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-02 23:21:36] [INFO ] [Nat]Added 73 Read/Feed constraints in 88 ms returned sat
[2024-06-02 23:21:36] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 57 ms.
[2024-06-02 23:21:36] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 8 ms to minimize.
[2024-06-02 23:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-06-02 23:21:36] [INFO ] Added : 11 causal constraints over 3 iterations in 315 ms. Result :sat
Minimization took 125 ms.
[2024-06-02 23:21:36] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:21:37] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-06-02 23:21:37] [INFO ] [Real]Added 73 Read/Feed constraints in 13 ms returned sat
[2024-06-02 23:21:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-02 23:21:37] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-02 23:21:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 29 ms returned sat
[2024-06-02 23:21:37] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 55 ms.
[2024-06-02 23:21:37] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 3 ms to minimize.
[2024-06-02 23:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-06-02 23:21:37] [INFO ] Added : 38 causal constraints over 9 iterations in 512 ms. Result :sat
Minimization took 142 ms.
[2024-06-02 23:21:38] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:21:38] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-06-02 23:21:38] [INFO ] [Real]Added 73 Read/Feed constraints in 33 ms returned sat
[2024-06-02 23:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:21:38] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-02 23:21:38] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2024-06-02 23:21:38] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 45 ms.
[2024-06-02 23:21:38] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:21:38] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:21:38] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:21:39] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:21:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 528 ms
[2024-06-02 23:21:39] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2024-06-02 23:21:39] [INFO ] Added : 31 causal constraints over 9 iterations in 1060 ms. Result :sat
Minimization took 150 ms.
[2024-06-02 23:21:39] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:21:39] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-02 23:21:39] [INFO ] [Real]Added 73 Read/Feed constraints in 39 ms returned sat
[2024-06-02 23:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:21:39] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-02 23:21:40] [INFO ] [Nat]Added 73 Read/Feed constraints in 37 ms returned sat
[2024-06-02 23:21:40] [INFO ] Computed and/alt/rep : 208/803/208 causal constraints (skipped 292 transitions) in 36 ms.
[2024-06-02 23:21:40] [INFO ] Added : 26 causal constraints over 6 iterations in 234 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 539/539 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 536
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 533
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 533
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 196 transition count 521
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 196 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 193 transition count 509
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 193 transition count 509
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 191 transition count 505
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 191 transition count 505
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 189 transition count 499
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 189 transition count 499
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 187 transition count 495
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 187 transition count 495
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 185 transition count 489
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 185 transition count 489
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 183 transition count 485
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 183 transition count 485
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 181 transition count 479
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 179 transition count 475
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 179 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 178 transition count 472
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 178 transition count 472
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 177 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 177 transition count 470
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 174 transition count 467
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 171 transition count 473
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 171 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 89 place count 171 transition count 458
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 171 transition count 464
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 101 place count 168 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 107 place count 168 transition count 452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 167 transition count 451
Applied a total of 108 rules in 192 ms. Remains 167 /205 variables (removed 38) and now considering 451/539 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 167/205 places, 451/539 transitions.
[2024-06-02 23:21:40] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
// Phase 1: matrix 414 rows 167 cols
[2024-06-02 23:21:40] [INFO ] Computed 10 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (31999 resets) in 1838 ms. (543 steps per ms)
FORMULA FireWire-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (20603 resets) in 1577 ms. (1901 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 23:21:44] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:21:44] [INFO ] Invariant cache hit.
[2024-06-02 23:21:44] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:44] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:21:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:21:44] [INFO ] [Real]Added 61 Read/Feed constraints in 20 ms returned sat
[2024-06-02 23:21:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:44] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-02 23:21:44] [INFO ] [Nat]Added 61 Read/Feed constraints in 30 ms returned sat
[2024-06-02 23:21:44] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 27 ms.
[2024-06-02 23:21:44] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:21:45] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:21:45] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:21:45] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:21:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 371 ms
[2024-06-02 23:21:45] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-06-02 23:21:45] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-06-02 23:21:45] [INFO ] Added : 36 causal constraints over 11 iterations in 911 ms. Result :sat
Minimization took 131 ms.
[2024-06-02 23:21:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:45] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:21:45] [INFO ] [Real]Added 61 Read/Feed constraints in 30 ms returned sat
[2024-06-02 23:21:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:45] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-02 23:21:46] [INFO ] [Nat]Added 61 Read/Feed constraints in 40 ms returned sat
[2024-06-02 23:21:46] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 28 ms.
[2024-06-02 23:21:46] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:21:46] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:21:46] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:21:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2024-06-02 23:21:46] [INFO ] Added : 18 causal constraints over 4 iterations in 348 ms. Result :sat
Minimization took 120 ms.
[2024-06-02 23:21:46] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:46] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:21:46] [INFO ] [Real]Added 61 Read/Feed constraints in 38 ms returned sat
[2024-06-02 23:21:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:46] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:21:46] [INFO ] [Nat]Added 61 Read/Feed constraints in 21 ms returned sat
[2024-06-02 23:21:46] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:21:46] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:21:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-06-02 23:21:46] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 23 ms.
[2024-06-02 23:21:47] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:21:47] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:21:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2024-06-02 23:21:47] [INFO ] Added : 33 causal constraints over 8 iterations in 396 ms. Result :sat
Minimization took 126 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 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 451/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 167 /167 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 167/167 places, 451/451 transitions.
[2024-06-02 23:21:47] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:21:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (31977 resets) in 1503 ms. (664 steps per ms)
BEST_FIRST walk for 3000003 steps (20520 resets) in 1416 ms. (2117 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 23:21:50] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:21:50] [INFO ] Invariant cache hit.
[2024-06-02 23:21:50] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:21:50] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:21:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:21:50] [INFO ] [Real]Added 61 Read/Feed constraints in 20 ms returned sat
[2024-06-02 23:21:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:50] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 23:21:50] [INFO ] [Nat]Added 61 Read/Feed constraints in 29 ms returned sat
[2024-06-02 23:21:50] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 23 ms.
[2024-06-02 23:21:51] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:21:51] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:21:51] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:21:51] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:21:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 382 ms
[2024-06-02 23:21:51] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-02 23:21:51] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-06-02 23:21:51] [INFO ] Added : 36 causal constraints over 11 iterations in 883 ms. Result :sat
Minimization took 132 ms.
[2024-06-02 23:21:51] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:51] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:21:51] [INFO ] [Real]Added 61 Read/Feed constraints in 37 ms returned sat
[2024-06-02 23:21:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:52] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:21:52] [INFO ] [Nat]Added 61 Read/Feed constraints in 41 ms returned sat
[2024-06-02 23:21:52] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 29 ms.
[2024-06-02 23:21:52] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:21:52] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:21:52] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:21:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 203 ms
[2024-06-02 23:21:52] [INFO ] Added : 18 causal constraints over 4 iterations in 349 ms. Result :sat
Minimization took 112 ms.
[2024-06-02 23:21:52] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:52] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:21:52] [INFO ] [Real]Added 61 Read/Feed constraints in 36 ms returned sat
[2024-06-02 23:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:52] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-02 23:21:52] [INFO ] [Nat]Added 61 Read/Feed constraints in 21 ms returned sat
[2024-06-02 23:21:52] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:21:53] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2024-06-02 23:21:53] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 27 ms.
[2024-06-02 23:21:53] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:21:53] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-06-02 23:21:53] [INFO ] Added : 33 causal constraints over 8 iterations in 427 ms. Result :sat
Minimization took 120 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 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 451/451 transitions.
Applied a total of 0 rules in 10 ms. Remains 167 /167 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 167/167 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 451/451 transitions.
Applied a total of 0 rules in 26 ms. Remains 167 /167 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-02 23:21:53] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:21:53] [INFO ] Invariant cache hit.
[2024-06-02 23:21:53] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-02 23:21:53] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:21:53] [INFO ] Invariant cache hit.
[2024-06-02 23:21:54] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:21:54] [INFO ] Implicit Places using invariants and state equation in 329 ms returned [18, 66, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 544 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/167 places, 451/451 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 580 ms. Remains : 164/167 places, 451/451 transitions.
[2024-06-02 23:21:54] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
// Phase 1: matrix 414 rows 164 cols
[2024-06-02 23:21:54] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (32064 resets) in 1450 ms. (689 steps per ms)
BEST_FIRST walk for 3000001 steps (20555 resets) in 1417 ms. (2115 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 23:21:57] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:21:57] [INFO ] Invariant cache hit.
[2024-06-02 23:21:57] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:57] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 23:21:57] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:21:57] [INFO ] [Real]Added 61 Read/Feed constraints in 25 ms returned sat
[2024-06-02 23:21:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:21:57] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-02 23:21:57] [INFO ] [Nat]Added 61 Read/Feed constraints in 29 ms returned sat
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 3 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2024-06-02 23:21:57] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 29 ms.
[2024-06-02 23:21:57] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-06-02 23:21:57] [INFO ] Added : 32 causal constraints over 8 iterations in 306 ms. Result :sat
Minimization took 191 ms.
[2024-06-02 23:21:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:58] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-02 23:21:58] [INFO ] [Real]Added 61 Read/Feed constraints in 39 ms returned sat
[2024-06-02 23:21:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:58] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-06-02 23:21:58] [INFO ] [Nat]Added 61 Read/Feed constraints in 25 ms returned sat
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-02 23:21:58] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 23 ms.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:21:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2024-06-02 23:21:58] [INFO ] Added : 26 causal constraints over 7 iterations in 417 ms. Result :sat
Minimization took 176 ms.
[2024-06-02 23:21:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:59] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 23:21:59] [INFO ] [Real]Added 61 Read/Feed constraints in 19 ms returned sat
[2024-06-02 23:21:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:21:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:21:59] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-02 23:21:59] [INFO ] [Nat]Added 61 Read/Feed constraints in 18 ms returned sat
[2024-06-02 23:21:59] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 28 ms.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 23:21:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2024-06-02 23:21:59] [INFO ] Added : 24 causal constraints over 6 iterations in 306 ms. Result :sat
Minimization took 173 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 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 451/451 transitions.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 164/164 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 451/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-02 23:22:00] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:22:00] [INFO ] Invariant cache hit.
[2024-06-02 23:22:00] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:22:00] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:22:00] [INFO ] Invariant cache hit.
[2024-06-02 23:22:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:22:00] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-06-02 23:22:00] [INFO ] Redundant transitions in 25 ms returned []
Running 445 sub problems to find dead transitions.
[2024-06-02 23:22:00] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:22:00] [INFO ] Invariant cache hit.
[2024-06-02 23:22:00] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:22:02] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:22:02] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:22:02] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 23:22:03] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:22:03] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:22:03] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 23:22:03] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:22:04] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:22:04] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:22:04] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:22:04] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:22:04] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:22:05] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (OVERLAPS) 414/578 variables, 164/184 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:22:11] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:22:13] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:22:13] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:22:14] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:22:16] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:22:21] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:22:23] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:22:24] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/578 variables, and 253 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:22:32] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 414/578 variables, 164/193 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 61/254 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 445/699 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 8 (OVERLAPS) 0/578 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 445 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 699 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 22/22 constraints]
After SMT, in 60571ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 60585ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60976 ms. Remains : 164/164 places, 451/451 transitions.
RANDOM walk for 40000 steps (1282 resets) in 1330 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (280 resets) in 258 ms. (154 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (267 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (275 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (276 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (265 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (273 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 581758 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 6
Probabilistic random walk after 581758 steps, saw 172242 distinct states, run finished after 3004 ms. (steps per millisecond=193 ) properties seen :0
[2024-06-02 23:23:04] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:23:04] [INFO ] Invariant cache hit.
[2024-06-02 23:23:04] [INFO ] State equation strengthened by 61 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) 131/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 396/530 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 44/574 variables, 26/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/575 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/578 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 232 constraints, problems are : Problem set: 0 solved, 6 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 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) 131/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 396/530 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 44/574 variables, 26/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:23:05] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:23:05] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/575 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/575 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/578 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:23:06] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/578 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/578 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 241 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1584ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 234 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 451/451 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 164/164 places, 451/451 transitions.
RANDOM walk for 40000 steps (1293 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (292 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (287 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (298 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (289 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (265 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (261 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 581337 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 6
Probabilistic random walk after 581337 steps, saw 172107 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
[2024-06-02 23:23:09] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:23:09] [INFO ] Invariant cache hit.
[2024-06-02 23:23:09] [INFO ] State equation strengthened by 61 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) 131/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 396/530 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 44/574 variables, 26/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/575 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/578 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/578 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 232 constraints, problems are : Problem set: 0 solved, 6 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 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) 131/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 396/530 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 44/574 variables, 26/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:23:10] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:23:10] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/575 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/575 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/578 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:23:11] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/578 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/578 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 241 constraints, problems are : Problem set: 0 solved, 6 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1358ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 451/451 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 164/164 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 451/451 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-02 23:23:11] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:23:11] [INFO ] Invariant cache hit.
[2024-06-02 23:23:11] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 23:23:11] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:23:11] [INFO ] Invariant cache hit.
[2024-06-02 23:23:11] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:23:11] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-06-02 23:23:11] [INFO ] Redundant transitions in 8 ms returned []
Running 445 sub problems to find dead transitions.
[2024-06-02 23:23:11] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:23:11] [INFO ] Invariant cache hit.
[2024-06-02 23:23:11] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:23:13] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:23:14] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:23:14] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-06-02 23:23:14] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:23:14] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:23:14] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 23:23:15] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:23:15] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:23:15] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 23:23:15] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:23:15] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:23:16] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:23:16] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (OVERLAPS) 414/578 variables, 164/184 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:23:24] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-06-02 23:23:24] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:23:25] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:23:27] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:23:32] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:23:34] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:23:35] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/578 variables, and 253 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-02 23:23:44] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 414/578 variables, 164/193 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 61/254 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 445/699 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 8 (OVERLAPS) 0/578 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 445 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 699 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 22/22 constraints]
After SMT, in 60413ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60829 ms. Remains : 164/164 places, 451/451 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 164 vertex of which 29 / 164 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 138 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 138 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 137 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 137 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 136 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 135 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 135 transition count 247
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 135 transition count 232
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 126 transition count 229
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 46 place count 126 transition count 229
Applied a total of 46 rules in 47 ms. Remains 126 /164 variables (removed 38) and now considering 229/451 (removed 222) transitions.
Running SMT prover for 6 properties.
[2024-06-02 23:24:12] [INFO ] Flow matrix only has 227 transitions (discarded 2 similar events)
// Phase 1: matrix 227 rows 126 cols
[2024-06-02 23:24:12] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:24:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:24:12] [INFO ] After 195ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
TRAPS : Iteration 0
[2024-06-02 23:24:12] [INFO ] After 236ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:2
[2024-06-02 23:24:12] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:2
[2024-06-02 23:24:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:24:12] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-02 23:24:13] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-02 23:24:13] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 672 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 FireWire-PT-14-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:24:13] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
// Phase 1: matrix 414 rows 164 cols
[2024-06-02 23:24:13] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (354 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (79 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:24:13] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:24:13] [INFO ] Invariant cache hit.
[2024-06-02 23:24:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:24:13] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 23:24:13] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:24:13] [INFO ] [Real]Added 61 Read/Feed constraints in 25 ms returned sat
[2024-06-02 23:24:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:24:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:24:13] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 23:24:13] [INFO ] [Nat]Added 61 Read/Feed constraints in 29 ms returned sat
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2024-06-02 23:24:13] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 22 ms.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-02 23:24:13] [INFO ] Added : 32 causal constraints over 8 iterations in 270 ms. Result :sat
Minimization took 174 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 164 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p97) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 448/448 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 162 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 162 transition count 444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 160 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 160 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 159 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 159 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 158 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 158 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 157 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 157 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 156 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 156 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 155 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 155 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 154 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 154 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 153 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 153 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 152 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 152 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 151 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 151 transition count 418
Applied a total of 26 rules in 39 ms. Remains 151 /164 variables (removed 13) and now considering 418/448 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 151/164 places, 418/448 transitions.
[2024-06-02 23:24:14] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
// Phase 1: matrix 381 rows 151 cols
[2024-06-02 23:24:14] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32101 resets) in 1399 ms. (714 steps per ms)
BEST_FIRST walk for 1000000 steps (6812 resets) in 434 ms. (2298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:24:15] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 23:24:15] [INFO ] Invariant cache hit.
[2024-06-02 23:24:15] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 23:24:15] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-02 23:24:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:24:15] [INFO ] [Real]Added 56 Read/Feed constraints in 12 ms returned sat
[2024-06-02 23:24:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:24:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:24:16] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 23:24:16] [INFO ] [Nat]Added 56 Read/Feed constraints in 13 ms returned sat
[2024-06-02 23:24:16] [INFO ] Computed and/alt/rep : 155/572/155 causal constraints (skipped 220 transitions) in 22 ms.
[2024-06-02 23:24:16] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 23:24:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-06-02 23:24:16] [INFO ] Added : 23 causal constraints over 5 iterations in 198 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 418/418 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 151/151 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 418/418 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-06-02 23:24:16] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 23:24:16] [INFO ] Invariant cache hit.
[2024-06-02 23:24:16] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:24:16] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 23:24:16] [INFO ] Invariant cache hit.
[2024-06-02 23:24:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:24:16] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-02 23:24:16] [INFO ] Redundant transitions in 4 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-02 23:24:16] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 23:24:16] [INFO ] Invariant cache hit.
[2024-06-02 23:24:16] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:24:18] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 23:24:18] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:24:22] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:24:22] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:24:22] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:24:23] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:24:23] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:24:23] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:24:23] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (OVERLAPS) 381/532 variables, 151/171 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:24:32] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:24:33] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:24:33] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:24:35] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 231 constraints, problems are : Problem set: 0 solved, 412 unsolved in 26900 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 381/532 variables, 151/175 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 412/643 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 0/532 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 643 constraints, problems are : Problem set: 0 solved, 412 unsolved in 25159 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
After SMT, in 52372ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 52377ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52733 ms. Remains : 151/151 places, 418/418 transitions.
RANDOM walk for 40000 steps (1272 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (272 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (288 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 845368 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :0 out of 2
Probabilistic random walk after 845368 steps, saw 248867 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
[2024-06-02 23:25:12] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 23:25:12] [INFO ] Invariant cache hit.
[2024-06-02 23:25:12] [INFO ] State equation strengthened by 56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/354 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/355 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/514 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/530 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/532 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/354 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/355 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/514 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/530 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/532 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 428ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 418/418 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 151/151 places, 418/418 transitions.
RANDOM walk for 40000 steps (1285 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (274 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (269 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 675915 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 2
Probabilistic random walk after 675915 steps, saw 200074 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2024-06-02 23:25:15] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 23:25:15] [INFO ] Invariant cache hit.
[2024-06-02 23:25:15] [INFO ] State equation strengthened by 56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/354 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/355 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 159/514 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/530 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/532 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 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) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/168 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/354 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/355 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/514 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/530 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/532 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/532 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 418/418 transitions.
Applied a total of 0 rules in 13 ms. Remains 151 /151 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 151/151 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 418/418 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-06-02 23:25:16] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 23:25:16] [INFO ] Invariant cache hit.
[2024-06-02 23:25:16] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:25:16] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 23:25:16] [INFO ] Invariant cache hit.
[2024-06-02 23:25:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:25:16] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-02 23:25:16] [INFO ] Redundant transitions in 3 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-02 23:25:16] [INFO ] Flow matrix only has 381 transitions (discarded 37 similar events)
[2024-06-02 23:25:16] [INFO ] Invariant cache hit.
[2024-06-02 23:25:16] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:25:18] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 23:25:18] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:25:22] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:25:22] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:25:22] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:25:23] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:25:23] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:25:23] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:25:23] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:25:24] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:25:25] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:25:25] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:25:26] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (OVERLAPS) 381/532 variables, 151/171 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:25:33] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-02 23:25:36] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 231 constraints, problems are : Problem set: 0 solved, 412 unsolved in 27615 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 1/151 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 381/532 variables, 151/175 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 56/231 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 412/643 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 0/532 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 643 constraints, problems are : Problem set: 0 solved, 412 unsolved in 26108 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
After SMT, in 54072ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 54077ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54438 ms. Remains : 151/151 places, 418/418 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 151 vertex of which 29 / 151 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 125 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 124 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 124 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 123 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 122 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 122 transition count 221
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 122 transition count 206
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 113 transition count 203
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 46 place count 113 transition count 203
Applied a total of 46 rules in 25 ms. Remains 113 /151 variables (removed 38) and now considering 203/418 (removed 215) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:26:10] [INFO ] Flow matrix only has 201 transitions (discarded 2 similar events)
// Phase 1: matrix 201 rows 113 cols
[2024-06-02 23:26:10] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:26:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:26:10] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:26:10] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 23:26:10] [INFO ] After 93ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:26:10] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:26:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:26:11] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:26:11] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-02 23:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-06-02 23:26:11] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:26:11] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 312 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-14-UpperBounds-01 in 118015 ms.
Starting property specific reduction for FireWire-PT-14-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]
[2024-06-02 23:26:11] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
// Phase 1: matrix 414 rows 164 cols
[2024-06-02 23:26:11] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (331 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10000 steps (71 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:26:11] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:26:11] [INFO ] Invariant cache hit.
[2024-06-02 23:26:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:26:11] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-02 23:26:11] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:26:11] [INFO ] [Real]Added 61 Read/Feed constraints in 39 ms returned sat
[2024-06-02 23:26:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:26:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:26:11] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-02 23:26:11] [INFO ] [Nat]Added 61 Read/Feed constraints in 31 ms returned sat
[2024-06-02 23:26:11] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 23:26:11] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 22 ms.
[2024-06-02 23:26:11] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:26:11] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:26:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2024-06-02 23:26:11] [INFO ] Added : 26 causal constraints over 7 iterations in 371 ms. Result :sat
Minimization took 154 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 164 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p154) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 449/449 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 162 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 162 transition count 444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 160 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 160 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 159 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 159 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 158 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 158 transition count 436
Applied a total of 12 rules in 11 ms. Remains 158 /164 variables (removed 6) and now considering 436/449 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 158/164 places, 436/449 transitions.
[2024-06-02 23:26:12] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
// Phase 1: matrix 399 rows 158 cols
[2024-06-02 23:26:12] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32143 resets) in 1424 ms. (701 steps per ms)
BEST_FIRST walk for 1000001 steps (6808 resets) in 431 ms. (2314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:26:13] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 23:26:13] [INFO ] Invariant cache hit.
[2024-06-02 23:26:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:26:14] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-02 23:26:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:26:14] [INFO ] [Real]Added 60 Read/Feed constraints in 24 ms returned sat
[2024-06-02 23:26:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:26:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:26:14] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-02 23:26:14] [INFO ] [Nat]Added 60 Read/Feed constraints in 16 ms returned sat
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 321 ms
[2024-06-02 23:26:14] [INFO ] Computed and/alt/rep : 163/596/163 causal constraints (skipped 230 transitions) in 20 ms.
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2024-06-02 23:26:14] [INFO ] Added : 37 causal constraints over 8 iterations in 366 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 158/158 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2024-06-02 23:26:15] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 23:26:15] [INFO ] Invariant cache hit.
[2024-06-02 23:26:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:26:15] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 23:26:15] [INFO ] Invariant cache hit.
[2024-06-02 23:26:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:26:15] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-02 23:26:15] [INFO ] Redundant transitions in 4 ms returned []
Running 430 sub problems to find dead transitions.
[2024-06-02 23:26:15] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 23:26:15] [INFO ] Invariant cache hit.
[2024-06-02 23:26:15] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:26:17] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:26:18] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:26:21] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:26:21] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:26:21] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:26:21] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:26:21] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:26:22] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:26:22] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:26:23] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:26:23] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 399/557 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 60/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:26:28] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:26:28] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:26:37] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:26:37] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 12 (OVERLAPS) 0/557 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 240 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:26:49] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 399/557 variables, 158/181 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 430/671 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 11 (OVERLAPS) 0/557 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 671 constraints, problems are : Problem set: 0 solved, 430 unsolved in 29630 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 16/16 constraints]
After SMT, in 59987ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 59992ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60340 ms. Remains : 158/158 places, 436/436 transitions.
RANDOM walk for 40000 steps (1250 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (265 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (276 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 773621 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 2
Probabilistic random walk after 773621 steps, saw 229551 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
[2024-06-02 23:27:18] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 23:27:18] [INFO ] Invariant cache hit.
[2024-06-02 23:27:18] [INFO ] State equation strengthened by 60 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 143/193 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/379 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/380 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/539 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/555 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/555 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/557 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 143/193 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/379 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/380 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/539 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/555 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/557 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/557 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/557 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 448ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 158/158 places, 436/436 transitions.
RANDOM walk for 40000 steps (1326 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (275 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (304 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 824453 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 2
Probabilistic random walk after 824453 steps, saw 242731 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-06-02 23:27:22] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 23:27:22] [INFO ] Invariant cache hit.
[2024-06-02 23:27:22] [INFO ] State equation strengthened by 60 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 143/193 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/379 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/380 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/539 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/555 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/555 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/557 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 143/193 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/379 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/380 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/539 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/555 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/555 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/557 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/557 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/557 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 442ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 158/158 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 436/436 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2024-06-02 23:27:22] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 23:27:22] [INFO ] Invariant cache hit.
[2024-06-02 23:27:22] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:27:22] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 23:27:22] [INFO ] Invariant cache hit.
[2024-06-02 23:27:22] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:27:22] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-02 23:27:22] [INFO ] Redundant transitions in 4 ms returned []
Running 430 sub problems to find dead transitions.
[2024-06-02 23:27:22] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 23:27:22] [INFO ] Invariant cache hit.
[2024-06-02 23:27:22] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:27:25] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:27:25] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:27:28] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:27:28] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:27:28] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:27:28] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:27:29] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:27:29] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:27:30] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:27:30] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:27:30] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 399/557 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 60/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:27:36] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:27:36] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:27:45] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2024-06-02 23:27:45] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/557 variables, and 240 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 23:27:56] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 399/557 variables, 158/181 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 60/241 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 430/671 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 11 (OVERLAPS) 0/557 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 671 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 16/16 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60702 ms. Remains : 158/158 places, 436/436 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 158 vertex of which 29 / 158 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 132 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 132 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 131 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 131 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 130 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 129 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 235
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 129 transition count 220
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 120 transition count 217
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 46 place count 120 transition count 217
Applied a total of 46 rules in 20 ms. Remains 120 /158 variables (removed 38) and now considering 217/436 (removed 219) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:28:23] [INFO ] Flow matrix only has 215 transitions (discarded 2 similar events)
// Phase 1: matrix 215 rows 120 cols
[2024-06-02 23:28:23] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:28:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:28:23] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:28:23] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 23:28:23] [INFO ] After 114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:28:23] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:28:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:28:23] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:28:23] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-02 23:28:23] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-06-02 23:28:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
TRAPS : Iteration 1
[2024-06-02 23:28:23] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:28:23] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 412 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-14-UpperBounds-13 in 132576 ms.
Starting property specific reduction for FireWire-PT-14-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]
[2024-06-02 23:28:23] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
// Phase 1: matrix 414 rows 164 cols
[2024-06-02 23:28:23] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (327 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (59 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:28:23] [INFO ] Flow matrix only has 414 transitions (discarded 37 similar events)
[2024-06-02 23:28:23] [INFO ] Invariant cache hit.
[2024-06-02 23:28:23] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:28:23] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-02 23:28:23] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:28:23] [INFO ] [Real]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 23:28:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:28:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:28:23] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-02 23:28:23] [INFO ] [Nat]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-02 23:28:24] [INFO ] Computed and/alt/rep : 167/612/167 causal constraints (skipped 241 transitions) in 27 ms.
[2024-06-02 23:28:24] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:28:24] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:28:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2024-06-02 23:28:24] [INFO ] Added : 24 causal constraints over 6 iterations in 333 ms. Result :sat
Minimization took 168 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 164 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p35) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 449/449 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 162 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 162 transition count 444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 160 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 160 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 158 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 158 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 156 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 156 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 155 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 155 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 154 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 154 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 153 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 153 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 152 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 152 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 151 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 151 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 150 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 150 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 149 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 149 transition count 414
Applied a total of 30 rules in 25 ms. Remains 149 /164 variables (removed 15) and now considering 414/449 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 149/164 places, 414/449 transitions.
[2024-06-02 23:28:24] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
// Phase 1: matrix 377 rows 149 cols
[2024-06-02 23:28:24] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (32158 resets) in 1420 ms. (703 steps per ms)
BEST_FIRST walk for 1000001 steps (6954 resets) in 445 ms. (2242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 23:28:26] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 23:28:26] [INFO ] Invariant cache hit.
[2024-06-02 23:28:26] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:28:26] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 23:28:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:28:26] [INFO ] [Real]Added 56 Read/Feed constraints in 30 ms returned sat
[2024-06-02 23:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:28:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:28:26] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-02 23:28:26] [INFO ] [Nat]Added 56 Read/Feed constraints in 14 ms returned sat
[2024-06-02 23:28:26] [INFO ] Computed and/alt/rep : 154/569/154 causal constraints (skipped 217 transitions) in 22 ms.
[2024-06-02 23:28:26] [INFO ] Added : 29 causal constraints over 7 iterations in 171 ms. Result :sat
Minimization took 115 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 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 414/414 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 149/149 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 414/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2024-06-02 23:28:27] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 23:28:27] [INFO ] Invariant cache hit.
[2024-06-02 23:28:27] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 23:28:27] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 23:28:27] [INFO ] Invariant cache hit.
[2024-06-02 23:28:27] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:28:27] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-02 23:28:27] [INFO ] Redundant transitions in 4 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 23:28:27] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 23:28:27] [INFO ] Invariant cache hit.
[2024-06-02 23:28:27] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:28:29] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 23:28:29] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 1/149 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:28:33] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:28:33] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:28:34] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:28:34] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:28:36] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (OVERLAPS) 377/526 variables, 149/165 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 56/221 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:28:40] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:28:41] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:28:41] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:28:46] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:28:46] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:28:50] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/526 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/526 variables, and 227 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 1/149 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 377/526 variables, 149/171 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 408/635 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 10 (OVERLAPS) 0/526 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 635 constraints, problems are : Problem set: 0 solved, 408 unsolved in 24547 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
After SMT, in 54836ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 54841ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55173 ms. Remains : 149/149 places, 414/414 transitions.
RANDOM walk for 40000 steps (1264 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (266 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (273 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 756618 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 2
Probabilistic random walk after 756618 steps, saw 223934 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2024-06-02 23:29:25] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 23:29:25] [INFO ] Invariant cache hit.
[2024-06-02 23:29:25] [INFO ] State equation strengthened by 56 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 121/162 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/348 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/349 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/508 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/524 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/524 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/524 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/526 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/526 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 121/162 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/348 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/508 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/524 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/524 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/524 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/526 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/526 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 414/414 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 149/149 places, 414/414 transitions.
RANDOM walk for 40000 steps (1265 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (269 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (273 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 800527 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 2
Probabilistic random walk after 800527 steps, saw 236929 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-06-02 23:29:28] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 23:29:28] [INFO ] Invariant cache hit.
[2024-06-02 23:29:28] [INFO ] State equation strengthened by 56 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 121/162 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/348 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/349 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/508 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/524 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/524 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/524 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/526 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/526 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 121/162 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/348 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/508 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/524 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/524 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/524 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/526 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/526 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 414/414 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 149/149 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 414/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2024-06-02 23:29:29] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 23:29:29] [INFO ] Invariant cache hit.
[2024-06-02 23:29:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 23:29:29] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 23:29:29] [INFO ] Invariant cache hit.
[2024-06-02 23:29:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:29:29] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 23:29:29] [INFO ] Redundant transitions in 3 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 23:29:29] [INFO ] Flow matrix only has 377 transitions (discarded 37 similar events)
[2024-06-02 23:29:29] [INFO ] Invariant cache hit.
[2024-06-02 23:29:29] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:29:31] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 23:29:31] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 1/149 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:29:34] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:29:34] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:29:35] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:29:35] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:29:36] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:29:36] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (OVERLAPS) 377/526 variables, 149/165 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 56/221 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:29:42] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:29:43] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-02 23:29:43] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:29:48] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:29:48] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:29:52] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/526 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/526 variables, and 227 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 1/149 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 377/526 variables, 149/171 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 408/635 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 10 (OVERLAPS) 0/526 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 635 constraints, problems are : Problem set: 0 solved, 408 unsolved in 24325 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
After SMT, in 54626ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 54630ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54956 ms. Remains : 149/149 places, 414/414 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 149 vertex of which 29 / 149 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 123 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 123 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 122 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 122 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 121 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 120 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 120 transition count 218
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 120 transition count 203
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 111 transition count 200
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 46 place count 111 transition count 200
Applied a total of 46 rules in 17 ms. Remains 111 /149 variables (removed 38) and now considering 200/414 (removed 214) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:30:24] [INFO ] Flow matrix only has 198 transitions (discarded 2 similar events)
// Phase 1: matrix 198 rows 111 cols
[2024-06-02 23:30:24] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:30:24] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:30:24] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:30:24] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-06-02 23:30:24] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 142 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for FireWire-PT-14-UpperBounds-15 in 120758 ms.
[2024-06-02 23:30:24] [INFO ] Flatten gal took : 80 ms
[2024-06-02 23:30:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2024-06-02 23:30:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 451 transitions and 1703 arcs took 7 ms.
Total runtime 529295 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-14

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 164
TRANSITIONS: 451
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.004s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1542
MODEL NAME: /home/mcc/execution/413/model
164 places, 451 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-14-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-14-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-14-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717371029263

--------------------
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="FireWire-PT-14"
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 FireWire-PT-14, 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 r549-tall-171734898200277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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